From 854d66bb73cd131bda6452aac74aae3d9a77b91a Mon Sep 17 00:00:00 2001 From: nasr Date: Mon, 9 Mar 2026 19:44:59 +0000 Subject: refactor(main): simplified the project. going towards a single header file project maybe... --- source/b_tree.h | 44 -------------------------------------------- 1 file changed, 44 deletions(-) delete mode 100644 source/b_tree.h (limited to 'source/b_tree.h') diff --git a/source/b_tree.h b/source/b_tree.h deleted file mode 100644 index 0fc4d3c..0000000 --- a/source/b_tree.h +++ /dev/null @@ -1,44 +0,0 @@ -#ifndef BTREE_H -#define BTREE_H - -// maximum height of the tree the lower the lower the lower amount -// of disk reads which translates into faster? -#define B_TREE_ORDER 4 - -typedef struct b_tree_node b_tree_node; -struct b_tree_node -{ - - // store the values - string8 keys[B_TREE_ORDER - 1]; - csv_row *rows[B_TREE_ORDER - 1]; - - b_tree_node *parent; - // handle to store children faster than linked list - // because now we can iteratate over the nodes instead of having cache misses - // when jumping through linked nodes - b_tree_node *children[B_TREE_ORDER]; - - // NOTE(nasr): reference count ::: check how many leaves are using this node - // also not needed for now because we don't free individual node because of arena allocator - // s32 *refc; - - s32 key_count; - - b32 leaf; - -}; - -typedef struct b_tree b_tree; -struct b_tree -{ - // NOTE(nasr): make sure this always stays in memory - // so that initial fetch never requires a disk read - b_tree_node *root; - -}; - - - - -#endif /* BTREE_H */ -- cgit v1.3