mirror/zig
1
0
Fork 0
mirror of https://github.com/ziglang/zig.git synced 2025-12-06 14:23:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

prepare to remove the "Managed" variant of std.ArrayHashMap

Browse Source
This commit is contained in:
Andrew Kelley 2024-11-27 14:08:57 -08:00
parent da6e80c30a
commit 20215a376c
1 changed files with 9 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
lib/std/array_hash_map.zig
View File

@ -53,6 +53,14 @@ pub fn hashString(s: []const u8) u32 {
return @as(u32, @truncate(std.hash.Wyhash.hash(0, s))); return @as(u32, @truncate(std.hash.Wyhash.hash(0, s)));
} }
/// Deprecated in favor of `ArrayHashMapWithAllocator` (no code changes needed)
/// or `ArrayHashMapUnmanaged` (will need to update callsites to pass an
/// allocator). After Zig 0.14.0 is released, `ArrayHashMapWithAllocator` will
/// be removed and `ArrayHashMapUnmanaged` will be a deprecated alias. After
/// Zig 0.15.0 is released, the deprecated alias `ArrayHashMapUnmanaged` will
/// be removed.
pub const ArrayHashMap = ArrayHashMapWithAllocator;
/// A hash table of keys and values, each stored sequentially. /// A hash table of keys and values, each stored sequentially.
/// ///
/// Insertion order is preserved. In general, this data structure supports the same /// Insertion order is preserved. In general, this data structure supports the same
@ -67,7 +75,7 @@ pub fn hashString(s: []const u8) u32 {
/// ///
/// See `ArrayHashMapUnmanaged` for a variant of this data structure that accepts an /// See `ArrayHashMapUnmanaged` for a variant of this data structure that accepts an
/// `Allocator` as a parameter when needed rather than storing it. /// `Allocator` as a parameter when needed rather than storing it.
pub fn ArrayHashMap( pub fn ArrayHashMapWithAllocator(
comptime K: type, comptime K: type,
comptime V: type, comptime V: type,
/// A namespace that provides these two functions: /// A namespace that provides these two functions: