|
libdict
Data Structure C Library
|

Go to the source code of this file.
Data Structures | |
| struct | tree_node |
| struct | tree |
| struct | tree_iterator |
Typedefs | |
| typedef struct tree_node | tree_node |
Functions | |
| void | tree_node_rot_left (void *Tree, void *Node) |
| void | tree_node_rot_right (void *Tree, void *Node) |
| void * | tree_node_prev (void *Node) |
| void * | tree_node_next (void *Node) |
| void * | tree_node_min (void *Node) |
| void * | tree_node_max (void *Node) |
| void * | tree_search_node (void *Tree, const void *key) |
| void ** | tree_search (void *Tree, const void *key) |
| void * | tree_search_le_node (void *Tree, const void *key) |
| void ** | tree_search_le (void *Tree, const void *key) |
| void * | tree_search_lt_node (void *Tree, const void *key) |
| void ** | tree_search_lt (void *Tree, const void *key) |
| void * | tree_search_ge_node (void *Tree, const void *key) |
| void ** | tree_search_ge (void *Tree, const void *key) |
| void * | tree_search_gt_node (void *Tree, const void *key) |
| void ** | tree_search_gt (void *Tree, const void *key) |
| size_t | tree_traverse (void *Tree, dict_visit_func visit, void *user_data) |
| bool | tree_select (void *Tree, size_t n, const void **key, void **datum) |
| size_t | tree_count (const void *Tree) |
| size_t | tree_clear (void *Tree, dict_delete_func delete_func) |
| size_t | tree_free (void *Tree, dict_delete_func delete_func) |
| size_t | tree_min_path_length (const void *Tree) |
| size_t | tree_max_path_length (const void *Tree) |
| size_t | tree_total_path_length (const void *Tree) |
| bool | tree_iterator_valid (const void *Iterator) |
| void | tree_iterator_invalidate (void *Iterator) |
| void | tree_iterator_free (void *Iterator) |
| bool | tree_iterator_next (void *Iterator) |
| bool | tree_iterator_prev (void *Iterator) |
| bool | tree_iterator_nextn (void *Iterator, size_t count) |
| bool | tree_iterator_prevn (void *Iterator, size_t count) |
| bool | tree_iterator_first (void *Iterator) |
| bool | tree_iterator_last (void *Iterator) |
| bool | tree_iterator_search (void *Iterator, const void *key) |
| bool | tree_iterator_search_le (void *Iterator, const void *key) |
| bool | tree_iterator_search_lt (void *Iterator, const void *key) |
| bool | tree_iterator_search_ge (void *Iterator, const void *key) |
| bool | tree_iterator_search_gt (void *Iterator, const void *key) |
| int | tree_iterator_compare (const void *Iterator1, const void *Iterator2) |
| const void * | tree_iterator_key (const void *Iterator) |
| void ** | tree_iterator_datum (void *Iterator) |
| typedef struct tree_node tree_node |
| size_t tree_clear | ( | void * | Tree, |
| dict_delete_func | delete_func ) |
Definition at line 301 of file tree_common.c.
| size_t tree_count | ( | const void * | Tree | ) |
Definition at line 295 of file tree_common.c.
| size_t tree_free | ( | void * | Tree, |
| dict_delete_func | delete_func ) |
| int tree_iterator_compare | ( | const void * | Iterator1, |
| const void * | Iterator2 ) |
Definition at line 486 of file tree_common.c.
| void ** tree_iterator_datum | ( | void * | Iterator | ) |
Definition at line 506 of file tree_common.c.
| bool tree_iterator_first | ( | void * | Iterator | ) |
| void tree_iterator_free | ( | void * | Iterator | ) |
Definition at line 389 of file tree_common.c.
| void tree_iterator_invalidate | ( | void * | Iterator | ) |
Definition at line 383 of file tree_common.c.
| const void * tree_iterator_key | ( | const void * | Iterator | ) |
Definition at line 499 of file tree_common.c.
| bool tree_iterator_last | ( | void * | Iterator | ) |
| bool tree_iterator_next | ( | void * | Iterator | ) |
| bool tree_iterator_nextn | ( | void * | Iterator, |
| size_t | count ) |
| bool tree_iterator_prev | ( | void * | Iterator | ) |
| bool tree_iterator_prevn | ( | void * | Iterator, |
| size_t | count ) |
| bool tree_iterator_search | ( | void * | Iterator, |
| const void * | key ) |
| bool tree_iterator_search_ge | ( | void * | Iterator, |
| const void * | key ) |
| bool tree_iterator_search_gt | ( | void * | Iterator, |
| const void * | key ) |
| bool tree_iterator_search_le | ( | void * | Iterator, |
| const void * | key ) |
| bool tree_iterator_search_lt | ( | void * | Iterator, |
| const void * | key ) |
| bool tree_iterator_valid | ( | const void * | Iterator | ) |
Definition at line 377 of file tree_common.c.
| size_t tree_max_path_length | ( | const void * | Tree | ) |
Definition at line 355 of file tree_common.c.
| size_t tree_min_path_length | ( | const void * | Tree | ) |
Definition at line 340 of file tree_common.c.
| void * tree_node_max | ( | void * | Node | ) |
Definition at line 117 of file tree_common.c.
| void * tree_node_min | ( | void * | Node | ) |
Definition at line 106 of file tree_common.c.
| void * tree_node_next | ( | void * | Node | ) |
| void * tree_node_prev | ( | void * | Node | ) |
| void tree_node_rot_left | ( | void * | Tree, |
| void * | Node ) |
Definition at line 46 of file tree_common.c.
| void tree_node_rot_right | ( | void * | Tree, |
| void * | Node ) |
Definition at line 62 of file tree_common.c.
| void ** tree_search | ( | void * | Tree, |
| const void * | key ) |
| void ** tree_search_ge | ( | void * | Tree, |
| const void * | key ) |
| void * tree_search_ge_node | ( | void * | Tree, |
| const void * | key ) |
Definition at line 201 of file tree_common.c.
| void ** tree_search_gt | ( | void * | Tree, |
| const void * | key ) |
| void * tree_search_gt_node | ( | void * | Tree, |
| const void * | key ) |
Definition at line 228 of file tree_common.c.
| void ** tree_search_le | ( | void * | Tree, |
| const void * | key ) |
| void * tree_search_le_node | ( | void * | Tree, |
| const void * | key ) |
Definition at line 151 of file tree_common.c.
| void ** tree_search_lt | ( | void * | Tree, |
| const void * | key ) |
| void * tree_search_lt_node | ( | void * | Tree, |
| const void * | key ) |
Definition at line 177 of file tree_common.c.
| void * tree_search_node | ( | void * | Tree, |
| const void * | key ) |
Definition at line 128 of file tree_common.c.
| bool tree_select | ( | void * | Tree, |
| size_t | n, | ||
| const void ** | key, | ||
| void ** | datum ) |
| size_t tree_total_path_length | ( | const void * | Tree | ) |
Definition at line 370 of file tree_common.c.
| size_t tree_traverse | ( | void * | Tree, |
| dict_visit_func | visit, | ||
| void * | user_data ) |