}
}
-static int rbt_default_comparitor(void* a, void* b){
+static int rbt_default_comparator(void* a, void* b){
return (a == b ? 0 : (a<b ? -1 : 1 ));
}
return node;
}
-rbt_t* rbt_new(comparitor_t comparitor){
+rbt_t* rbt_new(comparator_t comparator){
rbt_t* tree = mem_allocate(sizeof(rbt_t), &rbt_free);
tree->root = NULL;
- tree->comp = comparitor ? comparitor : rbt_default_comparitor;
+ tree->comp = comparator ? comparator : rbt_default_comparator;
return tree;
}
SELF_REFERENCE,
} rbt_status_t;
-typedef int (*comparitor_t)(void* p_a, void* p_b);
+typedef int (*comparator_t)(void* p_a, void* p_b);
typedef struct rbt_node_t {
struct rbt_node_t* left;
typedef struct {
rbt_node_t* root;
- comparitor_t comp;
+ comparator_t comp;
} rbt_t;
rbt_node_t* rbt_node_new(void* contents);
-rbt_t* rbt_new(comparitor_t comparitor);
+rbt_t* rbt_new(comparator_t comparator);
//returns a pointer to the new node
rbt_node_t* rbt_insert(rbt_t* tree, void* value);
void rbt_delete(rbt_t* tree, void* value);