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

more exhaustive test

Browse Source
This commit is contained in:
Pascal Zittlau
2025-12-05 15:56:50 +01:00
parent 82e96a17fd
commit a4b2e3f2bf
2 changed files with 6 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
RedBlackTree.zig
View File

@@ -808,7 +808,7 @@ const TestNode = struct {
test "insert, search, inorder, remove" { test "insert, search, inorder, remove" {
var tree = RedBlackTree{}; var tree = RedBlackTree{};
try std.testing.expect(tree.isEmpty()); try std.testing.expect(tree.isEmpty());
const count = 1000; const count = 1000000;
var reference = try std.ArrayListUnmanaged(TestNode).initCapacity(std.testing.allocator, count); var reference = try std.ArrayListUnmanaged(TestNode).initCapacity(std.testing.allocator, count);
defer reference.deinit(std.testing.allocator); defer reference.deinit(std.testing.allocator);
@@ -827,6 +827,7 @@ test "insert, search, inorder, remove" {
std.log.debug("Inserting: {}", .{item.val}); std.log.debug("Inserting: {}", .{item.val});
tree.insert(&item.node, {}, testCompareNodes); tree.insert(&item.node, {}, testCompareNodes);
if (i % (count / 10) != 0) continue;
var iter = tree.inorder(); var iter = tree.inorder();
var j: u64 = 0; var j: u64 = 0;
var prev: u32 = 0; var prev: u32 = 0;
@@ -851,6 +852,7 @@ test "insert, search, inorder, remove" {
try std.testing.expect(node_opt != null); try std.testing.expect(node_opt != null);
tree.remove(node_opt.?); tree.remove(node_opt.?);
if (i % (count / 10) != 0) continue;
var iter = tree.inorder(); var iter = tree.inorder();
var j: u64 = 0; var j: u64 = 0;
var prev: u32 = 0; var prev: u32 = 0;

4
generic_red_black_tree.zig
View File

@@ -758,7 +758,7 @@ const TestNode = TestTree.Node;
test "insert, search, inorder, remove" { test "insert, search, inorder, remove" {
var tree = TestTree{}; var tree = TestTree{};
try std.testing.expect(tree.isEmpty()); try std.testing.expect(tree.isEmpty());
const count = 1000; const count = 1000000;
var reference = try std.ArrayListUnmanaged(TestNode).initCapacity(std.testing.allocator, count); var reference = try std.ArrayListUnmanaged(TestNode).initCapacity(std.testing.allocator, count);
defer reference.deinit(std.testing.allocator); defer reference.deinit(std.testing.allocator);
@@ -777,6 +777,7 @@ test "insert, search, inorder, remove" {
std.log.debug("Inserting: {}", .{item.payload}); std.log.debug("Inserting: {}", .{item.payload});
tree.insert(item); tree.insert(item);
if (i % (count / 10) != 0) continue;
var iter = tree.inorder(); var iter = tree.inorder();
var j: u64 = 0; var j: u64 = 0;
var prev: TestInt = 0; var prev: TestInt = 0;
@@ -800,6 +801,7 @@ test "insert, search, inorder, remove" {
try std.testing.expect(node_opt != null); try std.testing.expect(node_opt != null);
tree.remove(node_opt.?); tree.remove(node_opt.?);
if (i % (count / 10) != 0) continue;
var iter = tree.inorder(); var iter = tree.inorder();
var j: u64 = 0; var j: u64 = 0;
var prev: TestInt = 0; var prev: TestInt = 0;