From c6572f1df5ceed6447b873f27da626f0b43fd0e8 Mon Sep 17 00:00:00 2001
From: Tomasz Polgrabia <tomasz@polgrabia.me>
Date: Sat, 1 Feb 2025 11:36:28 +0100
Subject: [PATCH] BTree creat/destroy node.

---
 current/algorithms/numbers-zig/numbers.zig | 65 +++++++++-------------
 1 file changed, 25 insertions(+), 40 deletions(-)

diff --git a/current/algorithms/numbers-zig/numbers.zig b/current/algorithms/numbers-zig/numbers.zig
index bdbf8da..1ec0978 100644
--- a/current/algorithms/numbers-zig/numbers.zig
+++ b/current/algorithms/numbers-zig/numbers.zig
@@ -2,13 +2,10 @@ const std = @import("std");
 const print = std.debug.print;
 const expect = std.testing.expect;
 
-test "simple partition #1" {
-    var gpa = std.heap.GeneralPurposeAllocator(.{}){};
-    const allocator = gpa.allocator();
-    defer {
-        _ = gpa.deinit();
-    }
+var gpa = std.heap.GeneralPurposeAllocator(.{}){};
+const allocator = gpa.allocator();
 
+test "simple partition #1" {
     const arr = try allocator.alloc(u64, 3);
     arr[0] = 1;
     arr[1] = 3;
@@ -22,12 +19,6 @@ test "simple partition #1" {
 }
 
 test "simple partition #2" {
-    var gpa = std.heap.GeneralPurposeAllocator(.{}){};
-    const allocator = gpa.allocator();
-    defer {
-        _ = gpa.deinit();
-    }
-
     const arr = try allocator.alloc(u64, 4);
     arr[0] = 1;
     arr[1] = 3;
@@ -42,12 +33,6 @@ test "simple partition #2" {
 }
 
 test "simple partition #3" {
-    var gpa = std.heap.GeneralPurposeAllocator(.{}){};
-    const allocator = gpa.allocator();
-    defer {
-        _ = gpa.deinit();
-    }
-
     const arr = try allocator.alloc(u64, 4);
     arr[0] = 1;
     arr[1] = 3;
@@ -62,12 +47,6 @@ test "simple partition #3" {
 }
 
 test "simple partition #4" {
-    var gpa = std.heap.GeneralPurposeAllocator(.{}){};
-    const allocator = gpa.allocator();
-    defer {
-        _ = gpa.deinit();
-    }
-
     const arr = try allocator.alloc(u64, 4);
     arr[0] = 1;
     arr[1] = 3;
@@ -82,12 +61,6 @@ test "simple partition #4" {
 }
 
 test "simple partition #5" {
-    var gpa = std.heap.GeneralPurposeAllocator(.{}){};
-    const allocator = gpa.allocator();
-    defer {
-        _ = gpa.deinit();
-    }
-
     const arr = try allocator.alloc(u64, 4);
     arr[0] = 1;
     arr[1] = 3;
@@ -138,6 +111,19 @@ const BTree = struct {
     children: []?BTree,
 };
 
+pub fn BTree_Create(n: u64) !*BTree {
+    var q = try allocator.create(BTree);
+    q.values = try allocator.alloc(u64, n);
+    q.children = try allocator.alloc(?BTree, n + 1);
+    return q;
+}
+
+pub fn BTree_Destroy(q: *BTree) !void {
+    allocator.free(q.values);
+    allocator.free(q.children);
+    allocator.destroy(q);
+}
+
 pub fn BTree_Add(q: *BTree, v: u64) *BTree {
     if (q.n <= q.values.len) {
         const idx = bipartition(q.values, 0, q.n, v);
@@ -156,14 +142,13 @@ pub fn BTree_Add(q: *BTree, v: u64) *BTree {
 }
 
 pub fn main() !void {
-    const numbers = [_]u64{ 1, 2, 3 };
-    const numbers_sl: []const u64 = &numbers;
-    const children = [_]?BTree{ null, null, null, null };
-    const q = BTree{
-        .n = 0,
-        .values = numbers_sl,
-        .children = &children,
-    };
-    BTree_Add(q, 4);
-    print("Hello World {}!!!\n", .{q.values});
+    var q = try BTree_Create(4);
+    q.n = 1;
+    print("Hello World {}!!!\n", .{2});
+
+    try BTree_Destroy(q);
+
+    defer {
+        _ = gpa.deinit();
+    }
 }