ndtree.h

Go to the documentation of this file.

 
#pragma once
 
// ============================================================================
// Opaque types.
 
typedef struct ndtree_node_t ndtree_node_t;
typedef struct ndtree_t ndtree_t;
typedef struct ndtree_iter_t ndtree_iter_t;
 
// ============================================================================
// Comparison functions.
 
typedef int (*ndtree_tree_cmp_f)(ndtree_t *tree, void *lhs, void *rhs);
typedef void (*ndtree_tree_node_f)(ndtree_t *tree, ndtree_node_t *node);
 
// ============================================================================
// Node management functions.
 
ndtree_node_t *ndtree_node_alloc(void);
 
ndtree_node_t *ndtree_node_create(void *value);
 
ndtree_node_t *ndtree_node_init(ndtree_node_t *node, void *value);
 
void ndtree_node_set_value(ndtree_node_t *node, void *value);
 
void *ndtree_node_get_value(ndtree_node_t *node);
 
void ndtree_set_root(ndtree_t *tree, ndtree_node_t *node);
 
ndtree_node_t *ndtree_create_root(ndtree_t *tree, void *value);
 
ndtree_node_t *ndtree_get_root(ndtree_t *tree);
 
void ndtree_add_child_to_node(ndtree_t *tree, ndtree_node_t *parent, ndtree_node_t *child);
 
ndtree_node_t *ndtree_create_child_of_node(ndtree_t *tree, ndtree_node_t *parent, void *value);
 
unsigned int ndtree_node_count_children(ndtree_node_t *node);
 
void ndtree_node_dealloc(ndtree_node_t *node);
 
// ============================================================================
// Tree management functions.
 
ndtree_t *ndtree_tree_alloc(void);
 
ndtree_t *ndtree_tree_create(ndtree_tree_cmp_f cmp);
 
void ndtree_tree_dealloc(ndtree_t *tree, ndtree_tree_node_f node_cb);
 
ndtree_t *ndtree_tree_init(ndtree_t *tree, ndtree_tree_cmp_f cmp);
 
ndtree_node_t *ndtree_tree_find(ndtree_t *tree, ndtree_tree_cmp_f cmp, void *value);
 
ndtree_node_t *ndtree_node_find(ndtree_t *tree, ndtree_node_t *node, ndtree_tree_cmp_f cmp, void *value);
 
unsigned int ndtree_tree_size(ndtree_t *tree);
 
int ndtree_tree_remove_node_with_cb(ndtree_t *tree, ndtree_node_t *node, ndtree_tree_node_f node_cb);
 
int ndtree_tree_remove_with_cb(ndtree_t *tree, void *value, ndtree_tree_node_f node_cb);
 
// ============================================================================
// Iterators.
 
ndtree_iter_t *ndtree_iter_alloc(void);
 
void ndtree_iter_dealloc(ndtree_iter_t *iter);
 
ndtree_node_t *ndtree_iter_first(ndtree_node_t *node, ndtree_iter_t *iter);
 
ndtree_node_t *ndtree_iter_last(ndtree_node_t *node, ndtree_iter_t *iter);
 
ndtree_node_t *ndtree_iter_next(ndtree_iter_t *iter);
 
ndtree_node_t *ndtree_iter_prev(ndtree_iter_t *iter);
 
// ============================================================================
// Tree visiting functions.
 
void ndtree_tree_visitor(ndtree_t *tree, ndtree_tree_node_f enter_fun, ndtree_tree_node_f exit_fun);