103 #ifndef _lub_bintree_h
104 #define _lub_bintree_h
142 const void *clientkey);
148 #define lub_bintree_MAX_KEY_STORAGE (200)
438 const void *clientnode
lub_bintree_compare_fn * compareFn
Definition: bintree.h:189
Definition: bintree.h:185
char storage[(200)]
Definition: bintree.h:160
void * lub_bintree_find(lub_bintree_t *tree, const void *key)
lub_bintree_key_t key
Definition: bintree.h:203
#define lub_bintree_MAX_KEY_STORAGE
Definition: bintree.h:148
Definition: bintree.h:200
lub_bintree_node_t * root
Definition: bintree.h:187
void * lub_bintree_iterator_previous(lub_bintree_iterator_t *iter)
void * lub_bintree_findnext(lub_bintree_t *tree, const void *key)
int magic
Definition: bintree.h:161
void * lub_bintree_findfirst(lub_bintree_t *tree)
lub_bintree_getkey_fn * getkeyFn
Definition: bintree.h:190
void lub_bintree_dump(lub_bintree_t *tree)
Definition: bintree.h:158
void lub_bintree_iterator_init(lub_bintree_iterator_t *iter, lub_bintree_t *tree, const void *clientnode)
void lub_bintree_init(lub_bintree_t *tree, size_t node_offset, lub_bintree_compare_fn compareFn, lub_bintree_getkey_fn getkeyFn)
void * lub_bintree_findlast(lub_bintree_t *tree)
Definition: bintree.h:122
void * lub_bintree_iterator_next(lub_bintree_iterator_t *iter)
size_t node_offset
Definition: bintree.h:188
int lub_bintree_insert(lub_bintree_t *tree, void *clientnode)
void * lub_bintree_findprevious(lub_bintree_t *tree, const void *key)
lub_bintree_node_t * left
Definition: bintree.h:124
lub_bintree_t * tree
Definition: bintree.h:202
void lub_bintree_node_init(lub_bintree_node_t *node)
lub_bintree_node_t * right
Definition: bintree.h:125
void lub_bintree_getkey_fn(const void *clientnode, lub_bintree_key_t *key)
Definition: bintree.h:175
int lub_bintree_compare_fn(const void *clientnode, const void *clientkey)
Definition: bintree.h:141
void lub_bintree_remove(lub_bintree_t *tree, void *clientnode)