* (c) 2002, Robert Spalek <robert@ucw.cz>
*/
-#define DEBUG
#include "lib/lib.h"
#include "lib/conf.h"
#include "lib/fastbuf.h"
#define TREE_WANT_DELETE
#define TREE_WANT_ITERATOR
#define TREE_WANT_DUMP
-#define TREE_STATIC
#define TREE_CONSERVE_SPACE
#include "redblack.h"
int
main(int argc, char **argv)
{
- uns verbose = 0, number = 1000, asserts = 0;
+ int verbose = 0, number = 1000, asserts = 0;
int opt;
struct fastbuf *fb, *dump_fb;
struct my_tree t;
}
for (i=0; i<100; i++)
{
- int res UNUSED = my_delete(&t, i);
+ int a = i/10, b = i%10, j = a*10 + (b + a) % 10;
+ int res UNUSED = my_delete(&t, j);
ASSERT(res);
my_dump(dump_fb, &t);
}
my_dump(NULL, &t);
}
my_dump(dump_fb, &t);
- for (i=0; i<997; i++)
- {
- int res UNUSED = my_delete(&t, i*111 % 997);
- ASSERT(res);
- my_dump(NULL, &t);
- }
- my_dump(dump_fb, &t);
i = 0;
TREE_FOR_ALL(my, &t, n)
{
i++;
}
TREE_END_FOR;
+ ASSERT(i == 997);
+ for (i=0; i<997; i++)
+ {
+ int res UNUSED = my_delete(&t, i*111 % 997);
+ ASSERT(res);
+ my_dump(NULL, &t);
+ }
+ my_dump(dump_fb, &t);
my_cleanup(&t);
if (verbose > 0)
bputs(fb, "Complete tree passed\n");