gdsl
1.7
|
Go to the source code of this file.
Typedefs | |
typedef _gdsl_bintree_t | _gdsl_bstree_t |
GDSL low-level binary search tree type. | |
typedef int(* | _gdsl_bstree_map_func_t )(_gdsl_bstree_t TREE, void *USER_DATA) |
GDSL low-level binary search tree map function type. | |
typedef void(* | _gdsl_bstree_write_func_t )(_gdsl_bstree_t TREE, FILE *OUTPUT_FILE, void *USER_DATA) |
GDSL low-level binary search tree write function type. | |
Functions | |
_gdsl_bstree_t | _gdsl_bstree_alloc (const gdsl_element_t E) |
Create a new low-level binary search tree. | |
void | _gdsl_bstree_free (_gdsl_bstree_t T, const gdsl_free_func_t FREE_F) |
Destroy a low-level binary search tree. | |
_gdsl_bstree_t | _gdsl_bstree_copy (const _gdsl_bstree_t T, const gdsl_copy_func_t COPY_F) |
Copy a low-level binary search tree. | |
bool | _gdsl_bstree_is_empty (const _gdsl_bstree_t T) |
Check if a low-level binary search tree is empty. | |
bool | _gdsl_bstree_is_leaf (const _gdsl_bstree_t T) |
Check if a low-level binary search tree is reduced to a leaf. | |
gdsl_element_t | _gdsl_bstree_get_content (const _gdsl_bstree_t T) |
Get the root content of a low-level binary search tree. | |
bool | _gdsl_bstree_is_root (const _gdsl_bstree_t T) |
Check if a low-level binary search tree is a root. | |
_gdsl_bstree_t | _gdsl_bstree_get_parent (const _gdsl_bstree_t T) |
Get the parent tree of a low-level binary search tree. | |
_gdsl_bstree_t | _gdsl_bstree_get_left (const _gdsl_bstree_t T) |
Get the left sub-tree of a low-level binary search tree. | |
_gdsl_bstree_t | _gdsl_bstree_get_right (const _gdsl_bstree_t T) |
Get the right sub-tree of a low-level binary search tree. | |
ulong | _gdsl_bstree_get_size (const _gdsl_bstree_t T) |
Get the size of a low-level binary search tree. | |
ulong | _gdsl_bstree_get_height (const _gdsl_bstree_t T) |
Get the height of a low-level binary search tree. | |
_gdsl_bstree_t | _gdsl_bstree_insert (_gdsl_bstree_t *T, const gdsl_compare_func_t COMP_F, const gdsl_element_t VALUE, int *RESULT) |
Insert an element into a low-level binary search tree if it's not found or return it. | |
gdsl_element_t | _gdsl_bstree_remove (_gdsl_bstree_t *T, const gdsl_compare_func_t COMP_F, const gdsl_element_t VALUE) |
Remove an element from a low-level binary search tree. | |
_gdsl_bstree_t | _gdsl_bstree_search (const _gdsl_bstree_t T, const gdsl_compare_func_t COMP_F, const gdsl_element_t VALUE) |
Search for a particular element into a low-level binary search tree. | |
_gdsl_bstree_t | _gdsl_bstree_search_next (const _gdsl_bstree_t T, const gdsl_compare_func_t COMP_F, const gdsl_element_t VALUE) |
Search for the next element of a particular element into a low-level binary search tree, according to the binary search tree order. | |
_gdsl_bstree_t | _gdsl_bstree_map_prefix (const _gdsl_bstree_t T, const _gdsl_bstree_map_func_t MAP_F, void *USER_DATA) |
Parse a low-level binary search tree in prefixed order. | |
_gdsl_bstree_t | _gdsl_bstree_map_infix (const _gdsl_bstree_t T, const _gdsl_bstree_map_func_t MAP_F, void *USER_DATA) |
Parse a low-level binary search tree in infixed order. | |
_gdsl_bstree_t | _gdsl_bstree_map_postfix (const _gdsl_bstree_t T, const _gdsl_bstree_map_func_t MAP_F, void *USER_DATA) |
Parse a low-level binary search tree in postfixed order. | |
void | _gdsl_bstree_write (const _gdsl_bstree_t T, const _gdsl_bstree_write_func_t WRITE_F, FILE *OUTPUT_FILE, void *USER_DATA) |
Write the content of all nodes of a low-level binary search tree to a file. | |
void | _gdsl_bstree_write_xml (const _gdsl_bstree_t T, const _gdsl_bstree_write_func_t WRITE_F, FILE *OUTPUT_FILE, void *USER_DATA) |
Write the content of a low-level binary search tree to a file into XML. | |
void | _gdsl_bstree_dump (const _gdsl_bstree_t T, const _gdsl_bstree_write_func_t WRITE_F, FILE *OUTPUT_FILE, void *USER_DATA) |
Dump the internal structure of a low-level binary search tree to a file. |