Go to the source code of this file.
|
static void | rb_tree_rotate_left (rb_tree_t *rt, rb_node_t *x) |
|
static void | rb_tree_rotate_right (rb_tree_t *rt, rb_node_t *y) |
|
static void | rb_tree_fixup_inline (rb_tree_t *rt, rb_node_t *y, rb_node_t *z) |
|
static void | rb_tree_insert (rb_tree_t *rt, rb_node_t *z) |
|
rb_node_index_t | rb_tree_add (rb_tree_t *rt, u32 key) |
|
rb_node_index_t | rb_tree_add2 (rb_tree_t *rt, u32 key, uword opaque) |
|
rb_node_index_t | rb_tree_add_custom (rb_tree_t *rt, u32 key, uword opaque, rb_tree_lt_fn ltfn) |
|
rb_node_t * | rb_tree_search_subtree (rb_tree_t *rt, rb_node_t *x, u32 key) |
|
rb_node_t * | rb_tree_search_subtree_custom (rb_tree_t *rt, rb_node_t *x, u32 key, rb_tree_lt_fn ltfn) |
|
rb_node_t * | rb_tree_min_subtree (rb_tree_t *rt, rb_node_t *x) |
|
rb_node_t * | rb_tree_max_subtree (rb_tree_t *rt, rb_node_t *x) |
|
rb_node_t * | rb_tree_successor (rb_tree_t *rt, rb_node_t *x) |
|
rb_node_t * | rb_tree_predecessor (rb_tree_t *rt, rb_node_t *x) |
|
static void | rb_tree_transplant (rb_tree_t *rt, rb_node_t *u, rb_node_t *v) |
|
void | rb_tree_del_node (rb_tree_t *rt, rb_node_t *z) |
|
void | rb_tree_del (rb_tree_t *rt, u32 key) |
|
void | rb_tree_del_custom (rb_tree_t *rt, u32 key, rb_tree_lt_fn ltfn) |
|
u32 | rb_tree_n_nodes (rb_tree_t *rt) |
|
void | rb_tree_free_nodes (rb_tree_t *rt) |
|
void | rb_tree_init (rb_tree_t *rt) |
|
◆ rb_tree_add()
◆ rb_tree_add2()
◆ rb_tree_add_custom()
◆ rb_tree_del()
◆ rb_tree_del_custom()
◆ rb_tree_del_node()
◆ rb_tree_fixup_inline()
◆ rb_tree_free_nodes()
◆ rb_tree_init()
◆ rb_tree_insert()
◆ rb_tree_max_subtree()
◆ rb_tree_min_subtree()
◆ rb_tree_n_nodes()
◆ rb_tree_predecessor()
◆ rb_tree_rotate_left()
◆ rb_tree_rotate_right()
◆ rb_tree_search_subtree()
◆ rb_tree_search_subtree_custom()
◆ rb_tree_successor()
◆ rb_tree_transplant()