36 #ifndef BSTREE_INTERNAL_H 37 #define BSTREE_INTERNAL_H 46 const void *
object,
size_t objsize,
50 const void *searchobj,
51 int (*comp)(
const void *,
const void *));
54 const void *searchobj,
55 int (*comp)(
const void *,
const void *));
58 const void *searchobj,
59 int (*comp)(
const void *,
const void *));
62 const void *searchobj,
63 int (*comp)(
const void *,
const void *));
66 size_t objsize,
int (*comp)(
const void *,
const void *));
69 const void *searchobj,
struct bstree *tree);
78 int (*comp)(
const void *,
const void *));
Binary search tree.
Definition: bstree.h:69
static struct bstreenode * free_bstree(struct bstreenode *currentnode)
static void * find_next_node(const struct bstreenode *currentnode, const void *searchobj, int(*comp)(const void *, const void *))
Header file to ease portability.
static int get_counter_node(const struct bstreenode *currentnode, const void *searchobj, int(*comp)(const void *, const void *))
static BEGIN_C_DECLS struct bstreenode * add_node(struct bstreenode *currentnode, const void *object, size_t objsize, struct bstree *tree)
Node coordinates for test tracing.
Definition: bstree.h:53
static void * upd_node(struct bstreenode *currentnode, const void *updobj, size_t objsize, int(*comp)(const void *, const void *))
static struct bstreenode * free_bst_node(struct bstreenode *currentnode)
#define END_C_DECLS
Use END_C_DECLS at the end of C declarations.
Definition: portability.h:50
static void * find_prev_node(const struct bstreenode *currentnode, const void *searchobj, int(*comp)(const void *, const void *))
Binary search tree header file.
#define BEGIN_C_DECLS
BEGIN_C_DECLS should be used at the beginning of declarations so that C++ compilers don't mangle thei...
Definition: portability.h:46
Binary search tree node.
Definition: bstree.h:61
static struct bstobjcoord * find_next_node_trace(const struct bstreenode *currentnode, struct bstobjcoord *searchobj, int(*comp)(const void *, const void *))
static struct bstreenode * del_node(struct bstreenode *currentnode, const void *searchobj, struct bstree *tree)
static void * find_node(const struct bstreenode *currentnode, const void *searchobj, int(*comp)(const void *, const void *))