aboutsummaryrefslogtreecommitdiff
path: root/lib/std/array_hash_map.zig
diff options
context:
space:
mode:
authorr00ster91 <r00ster91@proton.me>2023-06-02 22:02:45 -0400
committerAndrew Kelley <andrew@ziglang.org>2023-06-16 13:44:09 -0700
commit259315606827620daaabf82b479e59ee710097cd (patch)
tree16c797e4cc15479a27e64b4414517d9334f52250 /lib/std/array_hash_map.zig
parent22c6b6c9a9378aaca75c83c2182a6d94298f6bc2 (diff)
downloadzig-259315606827620daaabf82b479e59ee710097cd.tar.gz
zig-259315606827620daaabf82b479e59ee710097cd.zip
migration: std.math.{min, min3, max, max3} -> `@min` & `@max`
Diffstat (limited to 'lib/std/array_hash_map.zig')
-rw-r--r--lib/std/array_hash_map.zig6
1 files changed, 3 insertions, 3 deletions
diff --git a/lib/std/array_hash_map.zig b/lib/std/array_hash_map.zig
index 55b9aac6e4..b46b5c12f0 100644
--- a/lib/std/array_hash_map.zig
+++ b/lib/std/array_hash_map.zig
@@ -815,9 +815,9 @@ pub fn ArrayHashMapUnmanaged(
/// no longer guaranteed that no allocations will be performed.
pub fn capacity(self: Self) usize {
const entry_cap = self.entries.capacity;
- const header = self.index_header orelse return math.min(linear_scan_max, entry_cap);
+ const header = self.index_header orelse return @min(linear_scan_max, entry_cap);
const indexes_cap = header.capacity();
- return math.min(entry_cap, indexes_cap);
+ return @min(entry_cap, indexes_cap);
}
/// Clobbers any existing data. To detect if a put would clobber
@@ -1821,7 +1821,7 @@ fn Index(comptime I: type) type {
/// length * the size of an Index(u32). The index is 8 bytes (3 bits repr)
/// and max_usize + 1 is not representable, so we need to subtract out 4 bits.
const max_representable_index_len = @bitSizeOf(usize) - 4;
-const max_bit_index = math.min(32, max_representable_index_len);
+const max_bit_index = @min(32, max_representable_index_len);
const min_bit_index = 5;
const max_capacity = (1 << max_bit_index) - 1;
const index_capacities = blk: {