*/
#include "lib/lib.h"
-#include "lib/conf.h"
+#include "lib/getopt.h"
#include "lib/fastbuf.h"
#include <stdio.h>
#include <stdlib.h>
struct my_tree t;
struct my2_tree t2;
int i;
- cfdeffile = NULL;
+ cf_def_file = NULL;
log_init(argv[0]);
while ((opt = cf_getopt(argc, argv, options, CF_NO_LONG_OPTS, NULL)) >= 0)
switch (opt)
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");