Lines Matching refs:item
47 /* User supplied function to delete an item when a node is free()d.
48 * If NULL, the item is not free()d.
58 void *item;
88 * If the tree's freeitem is not NULL it will be invoked on every item.
98 * If the tree's freeitem is not NULL it will be invoked on every item.
104 extern avl_node_t *avl_init_node(avl_node_t *avlnode, void *item);
106 /* Insert an item into the tree and return the new node.
110 extern avl_node_t *avl_insert(avl_tree_t *, void *item);
124 * If old is NULL, the item is appended to the tree.
129 * If old is NULL, the item is prepended to the tree.
134 * The item will not be free()d regardless of the tree's freeitem handler.
140 * If the tree's freeitem is not NULL, it is invoked on the item.
141 * If it is, returns the item.
145 /* Searches for an item in the tree and deletes it if found.
146 * If the tree's freeitem is not NULL, it is invoked on the item.
147 * If it is, returns the item.
149 extern void *avl_delete(avl_tree_t *, const void *item);
157 /* Searches for a node with the key closest (or equal) to the given item.
164 extern int avl_search_closest(const avl_tree_t *, const void *item, avl_node_t **avlnode);
166 /* Searches for the item in the tree and returns a matching node if found
169 extern avl_node_t *avl_search(const avl_tree_t *, const void *item);