Data Fields | |
index_tree_node * | root |
Root node. | |
index_tree_node * | leftmost |
index_tree_node * | rightmost |
uint32_t | count |
Number of nodes in the tree. |
Leftmost node. Since the tree will be filled sequentially, this won't change after the first node has been added to the tree.
Referenced by index_tree_append(), and index_tree_locate().
The rightmost node in the tree. Since the tree is filled sequentially, this is always the node where to add the new data.
Referenced by index_tree_append().
uint32_t index_tree::count |