wash/mango
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

sandbox: btree: add in-order tree traversal

Browse Source
This commit is contained in:
max 🍓
2023-01-26 20:35:56 +00:00
parent e2fbc4e40b
commit 44836149cd
2 changed files with 106 additions and 46 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
sandbox/btree/include/socks/btree.h
View File

@@ -80,7 +80,35 @@
} \
\
btree_insert_fixup(tree, &node->container_node_member); \
}
}
#define BTREE_DEFINE_SIMPLE_GET(node_type, key_type, container_node_member, container_key_member, function_name) \
node_type *get(btree_t *tree, key_type key) \
{ \
btree_node_t *cur = tree->b_root; \
while (cur) { \
node_type *cur_node = BTREE_CONTAINER(node_type, container_node_member, cur); \
if (key > cur_node->container_key_member) { \
cur = btree_right(cur); \
} else if (key < cur_node->container_key_member) { \
cur = btree_left(cur); \
} else { \
return cur_node; \
} \
} \
\
return NULL; \
}
#define btree_foreach(iter_type, iter_name, tree_name, node_member) \
for (iter_type *iter_name = BTREE_CONTAINER(iter_type, node_member, btree_first(tree_name)); \
iter_name; \
iter_name = BTREE_CONTAINER(iter_type, node_member, btree_next(&((iter_name)->node_member))))
#define btree_foreach_r(iter_type, iter_name, tree_name, node_member) \
for (iter_type *iter_name = BTREE_CONTAINER(iter_type, node_member, btree_last(tree_name)); \
iter_name; \
iter_name = BTREE_CONTAINER(iter_type, node_member, btree_prev(&((iter_name)->node_member))))
typedef struct btree_node {
struct btree_node *b_parent, *b_left, *b_right;
@@ -94,6 +122,11 @@ typedef struct btree {
extern void btree_insert_fixup(btree_t *tree, btree_node_t *node);
extern void btree_delete(btree_t *tree, btree_node_t *node);
extern btree_node_t *btree_first(btree_t *tree);
extern btree_node_t *btree_last(btree_t *tree);
extern btree_node_t *btree_next(btree_node_t *node);
extern btree_node_t *btree_prev(btree_node_t *node);
static inline void btree_put_left(btree_node_t *parent, btree_node_t *child)
{
parent->b_left = child;