diff --git a/src/bench.zig b/src/bench.zig
index e4cc573..3149bf9 100644
--- a/src/bench.zig
+++ b/src/bench.zig
@@ -18,7 +18,7 @@ const StringHashMap = std.hash_map.StringHashMap(void);
 
 pub fn main() !void {
     var gpa = std.heap.GeneralPurposeAllocator(.{}){};
-    defer std.debug.assert(!gpa.deinit());
+    defer std.debug.assert(gpa.deinit() == .ok);
 
     const allocator = gpa.allocator();
     const elem_count = 1000;
diff --git a/src/trie.zig b/src/trie.zig
index 1b446c3..4b43bef 100644
--- a/src/trie.zig
+++ b/src/trie.zig
@@ -45,7 +45,7 @@ pub fn HashArrayMappedTrie(comptime K: type, comptime V: type, comptime Context:
 
             pub fn init(allocator: Allocator) !FreeList {
                 const list = try allocator.create([table_size]?FreeList.Node);
-                std.mem.set(?FreeList.Node, list, null);
+                @memset(list, null);
 
                 return .{ .list = list };
             }
@@ -147,7 +147,7 @@ pub fn HashArrayMappedTrie(comptime K: type, comptime V: type, comptime Context:
         pub fn init(allocator: Allocator) !Self {
             // TODO: Add ability to have a larger root node (for quicker lookup times)
             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) };
         }