34 #if !defined(AVL_DEPTH) && !defined(AVL_COUNT)
int avl_search_closest(const avl_tree_t *avltree, const void *item, avl_node_t **avlnode)
unsigned int avl_count(const avl_tree_t *avltree)
struct avl_tree_t avl_tree_t
avl_node_t * avl_fixup_node(avl_tree_t *avltree, avl_node_t *newnode)
avl_node_t * avl_insert(avl_tree_t *avltree, void *item)
avl_tree_t * avl_alloc_tree(avl_compare_t cmp, avl_freeitem_t freeitem)
void avl_unlink_node(avl_tree_t *avltree, avl_node_t *avlnode)
avl_node_t * avl_insert_node(avl_tree_t *avltree, avl_node_t *newnode)
void avl_free_tree(avl_tree_t *avltree)
unsigned int avl_index(const avl_node_t *avlnode)
avl_tree_t * avl_init_tree(avl_tree_t *rc, avl_compare_t cmp, avl_freeitem_t freeitem)
c Accompany it with the information you received as to the offer to distribute corresponding source complete source code means all the source code for all modules it plus any associated interface definition plus the scripts used to control compilation and installation of the executable as a special the source code distributed need not include anything that is normally and so on of the operating system on which the executable unless that component itself accompanies the executable If distribution of executable or object code is made by offering access to copy from a designated then offering equivalent access to copy the source code from the same place counts as distribution of the source even though third parties are not compelled to copy the source along with the object code You may not or distribute the Program except as expressly provided under this License Any attempt otherwise to sublicense or distribute the Program is void
struct avl_node_t avl_node_t
avl_node_t * avl_insert_top(avl_tree_t *avltree, avl_node_t *newnode)
int(* avl_compare_t)(const void *, const void *)
avl_node_t * avl_search(const avl_tree_t *avltree, const void *item)
avl_node_t * avl_init_node(avl_node_t *newnode, void *item)
struct avl_node_t * parent
avl_node_t * avl_insert_before(avl_tree_t *avltree, avl_node_t *node, avl_node_t *newnode)
void(* avl_freeitem_t)(void *)
void * avl_delete_node(avl_tree_t *avltree, avl_node_t *avlnode)
avl_node_t * avl_insert_after(avl_tree_t *avltree, avl_node_t *node, avl_node_t *newnode)
struct avl_node_t * right
void avl_clear_tree(avl_tree_t *avltree)
void avl_free_nodes(avl_tree_t *avltree)
void * avl_delete(avl_tree_t *avltree, const void *item)
avl_node_t * avl_at(const avl_tree_t *avltree, unsigned int index)