void D_UNIT_FUNCT(memleaks)
{
size_t i;
t_rbtree rbtree;
D_RBTREE(init)(&rbtree, uf_rbcmp, 0);
i = 0;
while (i < 30)
{
D_RBTREE(insert)(&rbtree, (void*)i);
i = i + 1;
}
D_RBTREE(destroy)(&rbtree);
(void)t;
}
int main(int argc, char const** argv)
{
size_t i;
t_rbtree rbtree;
/*
* Initialize the structure rbtree
*/
D_RBTREE(init)(&rbtree, uf_rbcmp, 0);
i = 0;
while (i < 30)
{
/*
* Insert number i
*/
D_RBTREE(insert)(&rbtree, (void*)i);
i = i + 1;
}
/*
* Print all value
*/
D_RBTREE(erase)(&rbtree, D_RBTREE(find)(&rbtree, (void *)4));
F_RBTREE_FOREACH_IN(&rbtree, uf_print, 0);
uf_print_char('\n');
F_RBTREE_FOREACH_PRE(&rbtree, uf_print, 0);
uf_print_char('\n');
F_RBTREE_FOREACH_POST(&rbtree, uf_print, 0);
uf_print_char('\n');
/*
* free memory
*/
D_RBTREE(destroy)(&rbtree);
(void)argc;
(void)argv;
return (0);
}
void f_rbtree_delete(t_rbtree *v_this, t_rbcell *node)
{
v_this->f_delete(D_RBTREE(erase)(v_this, node));
}
