Lines Matching defs:tree

121 static void avl_rebalance(avl_tree_t *tree, avl_node_t *node) {
279 	avl_tree_t *tree;  local
288 void avl_free_tree(avl_tree_t *tree) {
296 void avl_free_node(avl_tree_t *tree, avl_node_t *node) {
306 void *avl_search(const avl_tree_t *tree, const void *data) {
314 void *avl_search_closest(const avl_tree_t *tree, const void *data, int *result) {
322 void *avl_search_closest_smaller(const avl_tree_t *tree, const void *data) {
330 void *avl_search_closest_greater(const avl_tree_t *tree, const void *data) {
338 avl_node_t *avl_search_node(const avl_tree_t *tree, const void *data) {
347 avl_node_t *avl_search_closest_node(const avl_tree_t *tree, const void *data,
397 avl_node_t *avl_search_closest_smaller_node(const avl_tree_t *tree,
411 avl_node_t *avl_search_closest_greater_node(const avl_tree_t *tree,
427 avl_node_t *avl_insert(avl_tree_t *tree, void *data) {
466 avl_node_t *avl_insert_node(avl_tree_t *tree, avl_node_t *node) {
499 void avl_insert_top(avl_tree_t *tree, avl_node_t *node) {
504 void avl_insert_before(avl_tree_t *tree, avl_node_t *before,
537 void avl_insert_after(avl_tree_t *tree, avl_node_t *after, avl_node_t *node) {
569 avl_node_t *avl_unlink(avl_tree_t *tree, void *data) {
581 void avl_unlink_node(avl_tree_t *tree, avl_node_t *node) {
659 void avl_delete_node(avl_tree_t *tree, avl_node_t *node) {
664 void avl_delete(avl_tree_t *tree, void *data) {
676 void avl_delete_tree(avl_tree_t *tree) {
689 void avl_foreach(const avl_tree_t *tree, avl_action_t action) {
698 void avl_foreach_node(const avl_tree_t *tree, avl_action_t action) {
710 unsigned int avl_count(const avl_tree_t *tree) {
714 avl_node_t *avl_get_node(const avl_tree_t *tree, unsigned int index) {
754 unsigned int avl_depth(const avl_tree_t *tree) {