Top | ![]() |
![]() |
![]() |
![]() |
raptor_avltree * | raptor_new_avltree () |
void | raptor_free_avltree () |
int | raptor_avltree_add () |
int | raptor_avltree_delete () |
int | raptor_avltree_print () |
void * | raptor_avltree_remove () |
void * | raptor_avltree_search () |
void | raptor_avltree_set_print_handler () |
int | raptor_avltree_size () |
int | raptor_avltree_visit () |
raptor_avltree_iterator * | raptor_new_avltree_iterator () |
void | raptor_free_avltree_iterator () |
void * | raptor_avltree_iterator_get () |
int | raptor_avltree_iterator_is_end () |
int | raptor_avltree_iterator_next () |
int | (*raptor_avltree_visit_handler) () |
typedef | raptor_avltree |
enum | raptor_avltree_bitflags |
typedef | raptor_avltree_iterator |
raptor_avltree * raptor_new_avltree (raptor_data_compare_handler compare_handler
,raptor_data_free_handler free_handler
,unsigned int flags
);
void raptor_avltree_set_print_handler (raptor_avltree *tree
,raptor_data_print_handler print_handler
);
int raptor_avltree_visit (raptor_avltree *tree
,raptor_avltree_visit_handler visit_handler
,void *user_data
);
raptor_avltree_iterator * raptor_new_avltree_iterator (raptor_avltree *tree
,void *range
,raptor_data_free_handler range_free_handler
,int direction
);
void
raptor_free_avltree_iterator (raptor_avltree_iterator *iterator
);
void *
raptor_avltree_iterator_get (raptor_avltree_iterator *iterator
);
int
raptor_avltree_iterator_is_end (raptor_avltree_iterator *iterator
);
int
raptor_avltree_iterator_next (raptor_avltree_iterator *iterator
);
int (*raptor_avltree_visit_handler) (int depth
,void *data
,void *user_data
);
AVL Tree visitor function as given to raptor_avltree_visit()
depth |
depth of object in tree |
|
data |
data object being visited |
|
user_data |
user data arg to |
Bit flags for AVL Tree class constructor raptor_new_avltree()
If set |
typedef struct raptor_avltree_iterator_s raptor_avltree_iterator;
AVL Tree Iterator as created by raptor_new_avltree_iterator()