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

std.BufSet: add clone and cloneWithAllocator

Browse Source 
Following how ArrayList and HashMap does things. This is useful when one
wants to, ahem, clone the BufSet.
This commit is contained in:
Motiejus Jakštys 2022-02-28 19:37:53 +02:00 committed by Andrew Kelley
parent 2dd5e8b6f8
commit d1a4654834
1 changed files with 37 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

37
lib/std/buf_set.zig
View File

@ -71,6 +71,26 @@ pub const BufSet = struct {
return self.hash_map.allocator;
}
/// Creates a copy of this BufSet, using a specified allocator.
pub fn cloneWithAllocator(
self: *const BufSet,
new_allocator: Allocator,
) Allocator.Error!BufSet {
var cloned_hashmap = try self.hash_map.cloneWithAllocator(new_allocator);
var cloned = BufSet{ .hash_map = cloned_hashmap };
var it = self.hash_map.keyIterator();
while (it.next()) |key_ptr| {
key_ptr.* = try cloned.copy(key_ptr.*);
}
return cloned;
}
/// Creates a copy of this BufSet, using the same allocator.
pub fn clone(self: *const BufSet) Allocator.Error!BufSet {
return self.cloneWithAllocator(self.allocator());
}
fn free(self: *const BufSet, value: []const u8) void {
self.hash_map.allocator.free(value);
}
@ -95,3 +115,20 @@ test "BufSet" {
try bufset.insert("y");
try bufset.insert("z");
}
test "BufSet clone" {
var original = BufSet.init(testing.allocator);
defer original.deinit();
try original.insert("x");
var cloned = try original.clone();
defer cloned.deinit();
cloned.remove("x");
try testing.expect(original.count() == 1);
try testing.expect(cloned.count() == 0);
try testing.expectError(
error.OutOfMemory,
original.cloneWithAllocator(testing.failing_allocator),
);
}