aboutsummaryrefslogtreecommitdiff
path: root/lib/std/array_hash_map.zig
diff options
context:
space:
mode:
authorAndrew Kelley <andrew@ziglang.org>2023-11-04 15:46:30 -0700
committerAndrew Kelley <andrew@ziglang.org>2023-11-04 15:46:30 -0700
commit802c82b0720ff2b7c59ba96effbdd1eed7491df4 (patch)
treecf11620fbc06adc825df3abdb03c4e38215cd8f4 /lib/std/array_hash_map.zig
parent8bd01d2d9bbda1a2e044223db4b2272e7c5020a0 (diff)
downloadzig-802c82b0720ff2b7c59ba96effbdd1eed7491df4.tar.gz
zig-802c82b0720ff2b7c59ba96effbdd1eed7491df4.zip
std.ArrayHashMap: add init function
for when you have keys and values array
Diffstat (limited to 'lib/std/array_hash_map.zig')
-rw-r--r--lib/std/array_hash_map.zig13
1 files changed, 13 insertions, 0 deletions
diff --git a/lib/std/array_hash_map.zig b/lib/std/array_hash_map.zig
index 75a86f63f6..bf5f6581ac 100644
--- a/lib/std/array_hash_map.zig
+++ b/lib/std/array_hash_map.zig
@@ -574,6 +574,19 @@ pub fn ArrayHashMapUnmanaged(
};
}
+ pub fn init(allocator: Allocator, key_list: []const K, value_list: []const V) !Self {
+ var self: Self = .{};
+ try self.entries.resize(allocator, key_list.len);
+ errdefer self.entries.deinit(allocator);
+ @memcpy(self.keys(), key_list);
+ if (@sizeOf(V) != 0) {
+ assert(key_list.len == value_list.len);
+ @memcpy(self.values(), value_list);
+ }
+ try self.reIndex(allocator);
+ return self;
+ }
+
/// Frees the backing allocation and leaves the map in an undefined state.
/// Note that this does not free keys or values. You must take care of that
/// before calling this function, if it is needed.