pzittlau/zirbtree
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update to 0.15

Browse Source
This commit is contained in:
Pascal Zittlau
2025-12-05 15:49:35 +01:00
parent b1ec27d62c
commit 82e96a17fd
2 changed files with 19 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
main.zig
View File

@@ -48,20 +48,18 @@ pub fn main() !void {
.{ .id = 7, .name = "seven" }, .{ .id = 7, .name = "seven" },
}; };
var nodes = std.ArrayList(*MyDataNode).init(allocator); var nodes = std.ArrayList(MyDataNode).empty;
defer { try nodes.ensureTotalCapacity(allocator, data_to_insert.len);
for (nodes.items) |node| { defer nodes.deinit(allocator);
allocator.destroy(node);
}
nodes.deinit();
}
std.debug.print("Inserting nodes...\n", .{}); std.debug.print("Inserting nodes...\n", .{});
for (data_to_insert) |data| { for (data_to_insert, 0..) |data, i| {
const node = try allocator.create(MyDataNode); nodes.appendAssumeCapacity(.{
node.* = .{ .id = data.id, .name = data.name, .node = .{} }; .id = data.id,
try nodes.append(node); .name = data.name,
tree.insert(&node.node, {}, compareNodes); .node = .{},
});
tree.insert(&nodes.items[i].node, {}, compareNodes);
std.debug.print("\tInserted: id = {d}, name = {s}\n", .{ data.id, data.name }); std.debug.print("\tInserted: id = {d}, name = {s}\n", .{ data.id, data.name });
} }

21
main_generic.zig
View File

@@ -33,20 +33,17 @@ pub fn main() !void {
.{ .id = 7, .name = "seven" }, .{ .id = 7, .name = "seven" },
}; };
var nodes = std.ArrayList(*MyTree.Node).init(allocator); var nodes = std.ArrayList(MyTree.Node).empty;
defer { try nodes.ensureTotalCapacity(allocator, data_to_insert.len);
for (nodes.items) |node| { defer nodes.deinit(allocator);
allocator.destroy(node);
}
nodes.deinit();
}
std.debug.print("Inserting nodes...\n", .{}); std.debug.print("Inserting nodes...\n", .{});
for (data_to_insert) |data| { for (data_to_insert, 0..) |data, i| {
const node = try allocator.create(MyTree.Node); nodes.appendAssumeCapacity(.{ .payload = .{
node.* = .{ .payload = data }; .id = data.id,
try nodes.append(node); .name = data.name,
tree.insert(node); } });
tree.insert(&nodes.items[i]);
std.debug.print("\tInserted: id = {d}, name = {s}\n", .{ data.id, data.name }); std.debug.print("\tInserted: id = {d}, name = {s}\n", .{ data.id, data.name });
} }