61typedef struct val_tree_t_ {
65typedef struct val_tree_t_ {
dlq provides general double-linked list and queue support:
void val_tree_remove_deleted(val_value_t *childval, val_tree_t *val_tree)
A node is being removed from the tree but not the que because it is marked as VAL_FL_DELETED.
Definition: val_tree.c:442
status_t val_tree_add_undeleted(val_value_t *childval, val_tree_t *val_tree)
A node is being added back to the the tree but not the que because it was marked as VAL_FL_DELETED.
Definition: val_tree.c:479
val_tree_t * val_tree_new(void)
Create a new empty val_tree.
Definition: val_tree.c:184
val_value_t * val_tree_find(const val_value_t *childval, val_tree_t *val_tree)
Find a value node from the specified val_tree.
Definition: val_tree.c:516
status_t val_tree_insert(val_value_t *childval, val_tree_t *val_tree, boolean ignore_err, boolean *inserted)
Add a list entry to the val_tree.
Definition: val_tree.c:247
boolean val_tree_remove(val_value_t *childval, val_tree_t *val_tree)
Remove a value node from the specified val_tree.
Definition: val_tree.c:334
status_t val_tree_swap(val_value_t *newval, val_value_t *childval, val_tree_t *val_tree)
Change the node in the specified tree.
Definition: val_tree.c:387
void val_tree_free(val_tree_t *val_tree)
Clean and free the specified val_tree.
Definition: val_tree.c:212
status_t
global error return code
Definition: status_enum.h:210
wrapper for the height-balanced tree struct
Definition: val_tree.h:65
hb_tree * tree
AVL stree.
Definition: val_tree.h:66
one value to match one type
Definition: val.h:912