Data Structures | |
| struct | s_cf_dataset |
| struct | s_cf_tree |
| struct | s_cf_tree_node |
Typedefs | |
| typedef s_cf_dataset | t_cf_tree_dataset |
| typedef s_cf_tree_node | t_cf_tree_node |
| typedef s_cf_tree | t_cf_tree |
Enumerations | |
| enum | e_cf_tree_balance { CF_TREE_NONE, CF_TREE_LEFT, CF_TREE_RIGHT } |
Functions | |
| void | cf_tree_init (t_cf_tree *tree, int(*compare)(t_cf_tree_dataset *, t_cf_tree_dataset *), void(*destroy)(t_cf_tree_dataset *)) |
| void | cf_tree_destroy (t_cf_tree *tree) |
| int | cf_tree_insert (t_cf_tree *tree, t_cf_tree_node **n, t_cf_tree_dataset *d) |
| int | cf_tree_remove (t_cf_tree *tree, t_cf_tree_node **n, t_cf_tree_dataset *key) |
| const t_cf_tree_dataset * | cf_tree_find (t_cf_tree *tree, t_cf_tree_node *n, t_cf_tree_dataset *key) |
|
|
AVL tree structure |
|
|
dataset structure. Used to store data in a tree node |
|
|
AVL tree node structure |
|
|
balancing types. NONE means balanced, LEFT means left subtree is overbalanced and right means right subtree is overbalanced. |
|
|
This function is used to destroy a tree
|
|
||||||||||||||||
|
Looks up a dataset
|
|
||||||||||||||||
|
This function initializes a new tree object
|
|
||||||||||||||||
|
This function inserts a tree node into a tree with the data of dataset d (d will be copied)
|
|
||||||||||||||||
|
Removes a node from a tree (expensive!)
|
1.3.5