Ekdohibs
/
zig
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

std.HashMap: use std.math.ceilPowerOfTwo

master
Ryan Liptak 2019-06-05 23:36:51 -07:00
parent 656ac43735
commit 8f4229a61c
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
std/hash_map.zig
View File

@ -139,9 +139,9 @@ pub fn HashMap(comptime K: type, comptime V: type, comptime hash: fn (key: K) u3
// ensure that the hash map will be at most 60% full if // ensure that the hash map will be at most 60% full if
// expected_count items are put into it // expected_count items are put into it
var optimized_capacity = expected_count * 5 / 3; var optimized_capacity = expected_count * 5 / 3;
// round capacity to the next power of two // an overflow here would mean the amount of memory required would not
const pow = math.log2_int_ceil(usize, optimized_capacity); // be representable in the address space
return math.pow(usize, 2, pow); return math.ceilPowerOfTwo(usize, optimized_capacity) catch unreachable;
} }
/// Increases capacity so that the hash map will be at most /// Increases capacity so that the hash map will be at most