blob: e42f7098929b9648875f20f4ae8b00f18afd8215 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
// TODO(nasr): 1. splitting the tree when getting too big? (horizontally) 2. joining trees?
internal b_tree_node *
node_alloc(mem_arena *arena)
{
b_tree_node *node = PushStructZero(arena, type);
node->leaf = 1;
return node;
}
// NOTE(nasr): @return the index of of the found element
internal s32
node_find_pos(mem_arena *arena, string8 value)
{
s32 i = 0;
while (i < n->key_count && str8_cmp(n->keys[i], k) < 0)
{
++i;
}
return i;
}
interal void
b_tree_create(mem_arena *arena, b_tree *tree)
{
tree->root = node_alloc(arena);
tree->root->leaf = 1;
tree->root->key_count = 0;
}
// NOTE(nasr): nodes that get passed as parameters should've already been loaded into memory
internal void
b_tree_search(b_tree_node *node, string8 key)
{
s32 found_index = node_find_pos(node, key);
if (found_index < n->key_count && string_compare(n->keys[i], key) == 0)
{
return n->rows[i];
}
if (n->leaf)
{
return NULL;
}
return b_tree_search(n->children[i], key);
}
internal void
b_tree_insert()
{
}
internal void
b_tree_write()
{
// TODO(nasr): write the b_tree to disk
}
|
