int main () { long data[] = {3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5, 8, 9, 7}; long numData = sizeof(data) / sizeof(data[0]); long i; puts("Starting..."); rbtree_t* rbtreePtr = rbtree_alloc(&compare); assert(rbtreePtr); for (i = 0; i < numData; i++) { insertInt(rbtreePtr, &data[i]); } for (i = 0; i < numData; i++) { removeInt(rbtreePtr, &data[i]); } rbtree_free(rbtreePtr); puts("Done."); return 0; }
void vint_sender_init(void){ tree = rbtree_alloc(comp_func); }
intset_t *set_new() { return rbtree_alloc(); }
static intset_t *set_new() { return (intset_t *)rbtree_alloc(&compare); }
intset_t *set_new() { return rbtree_alloc(&compare); }