paoda
/
hamt
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

chore: update to latest zig master

This commit is contained in:
Rekai Nyangadzayi Musuka 2023-05-21 11:46:05 -05:00
parent f992575ad3
commit d0588947f5
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/bench.zig
View File

@ -18,7 +18,7 @@ const StringHashMap = std.hash_map.StringHashMap(void);
pub fn main() !void { pub fn main() !void {
var gpa = std.heap.GeneralPurposeAllocator(.{}){}; var gpa = std.heap.GeneralPurposeAllocator(.{}){};
defer std.debug.assert(!gpa.deinit()); defer std.debug.assert(gpa.deinit() == .ok);
const allocator = gpa.allocator(); const allocator = gpa.allocator();
const elem_count = 1000; const elem_count = 1000;

4
src/trie.zig
View File

@ -45,7 +45,7 @@ pub fn HashArrayMappedTrie(comptime K: type, comptime V: type, comptime Context:
pub fn init(allocator: Allocator) !FreeList { pub fn init(allocator: Allocator) !FreeList {
const list = try allocator.create([table_size]?FreeList.Node); const list = try allocator.create([table_size]?FreeList.Node);
std.mem.set(?FreeList.Node, list, null); @memset(list, null);
return .{ .list = list }; return .{ .list = list };
} }
@ -147,7 +147,7 @@ pub fn HashArrayMappedTrie(comptime K: type, comptime V: type, comptime Context:
pub fn init(allocator: Allocator) !Self { pub fn init(allocator: Allocator) !Self {
// TODO: Add ability to have a larger root node (for quicker lookup times) // TODO: Add ability to have a larger root node (for quicker lookup times)
const root = try allocator.alloc(?*Node, table_size); const root = try allocator.alloc(?*Node, table_size);
std.mem.set(?*Node, root, null); @memset(root, null);
return Self{ .root = root, .free_list = try FreeList.init(allocator) }; return Self{ .root = root, .free_list = try FreeList.init(allocator) };
} }