219 void rbtree_init(rb_tree * tree)  in rbtree_init()
230 	rb_tree *tree = (rb_tree *) malloc(sizeof(rb_tree));  in rbtree_construct()  local
241 void rbtree_clean(rb_tree * tree, destructor d)  in rbtree_clean()
251 void rbtree_destruct(rb_tree * tree, destructor d)  in rbtree_destruct()
259 int rbtree_size(rb_tree * tree)  in rbtree_size()
266 int rbtree_depth(rb_tree * tree)  in rbtree_depth()
275 int rbtree_contains(rb_tree * tree, datatype object)  in rbtree_contains()
282 rb_node *rbtree_insert(rb_tree * tree, datatype object)  in rbtree_insert()
360 rb_node *insert_successor_at(rb_tree * tree, rb_node * at_node, datatype object)  in insert_successor_at()
419 rb_node *insert_predecessor_at(rb_tree * tree, rb_node * at_node,  in insert_predecessor_at()
479 void rbtree_remove(rb_tree * tree, datatype object, destructor d)  in rbtree_remove()
487 void rbtree_remove_at(rb_tree * tree, rb_node * node, destructor d)  in rbtree_remove_at()
603 rb_node *rbtree_minimum(rb_tree * tree)  in rbtree_minimum()
614 rb_node *rbtree_maximum(rb_tree * tree)  in rbtree_maximum()
625 rb_node *rbtree_find(rb_tree * tree, datatype object)  in rbtree_find()
645 void rbtree_rotate_left(rb_tree * tree, rb_node * x_node)  in rbtree_rotate_left()
678 void rbtree_rotate_right(rb_tree * tree, rb_node * y_node)  in rbtree_rotate_right()
711 void rbtree_insert_fixup(rb_tree * tree, rb_node * node)  in rbtree_insert_fixup()
821 void rbtree_remove_fixup(rb_tree * tree, rb_node * node)  in rbtree_remove_fixup()
1060 void rbtree_traverse(rb_tree * tree, opr * op)  in rbtree_traverse()