refactoring + documentation + testing + added Map and Refcount

[dragonstd.git] / test / test_tree.c

diff --git a/test/test_tree.c b/test/test_tree.c
new file mode 100644 (file)
index 0000000..6166cf0
--- /dev/null
+++ b/test/test_tree.c
@@ -0,0 +1,71 @@
+#include <assert.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+#include "../tree.h"
+
+#define NUM_ELEMENTS 1e5
+
+int cmp_int(const void *ia, const void *ib)
+{
+       return *(const int *) ia - *(const int *) ib;
+}
+
+void clear_callback(void *ia, void *ib)
+{
+       assert(*(int *) ia > *(int *) ib);
+       free(ia);
+}
+
+int main()
+{
+       srand(time(NULL));
+
+       printf("------------\n");
+       printf("Testing Tree\n");
+       printf("------------\n");
+
+       Tree tree;
+
+       printf("testing ini\n");
+       tree_ini(&tree);
+
+       int a = 0;
+       int b = 1;
+       int c = 2;
+       int d = 2;
+       int e = 3;
+
+       printf("testing add\n");
+       assert(tree_add(&tree, &a, &cmp_int, NULL) == &a);
+       assert(tree_add(&tree, &b, &cmp_int, NULL) == &b);
+       assert(tree_add(&tree, &c, &cmp_int, NULL) == &c);
+       assert(tree_add(&tree, &d, &cmp_int, NULL) == &c);
+
+       printf("testing get\n");
+       assert(tree_get(&tree, &a, &cmp_int, NULL) == &a);
+       assert(tree_get(&tree, &b, &cmp_int, NULL) == &b);
+       assert(tree_get(&tree, &c, &cmp_int, NULL) == &c);
+       assert(tree_get(&tree, &d, &cmp_int, NULL) == &c);
+       assert(tree_get(&tree, &e, &cmp_int, NULL) == NULL);
+
+       printf("testing del\n");
+       assert(tree_del(&tree, &a, &cmp_int, NULL) == &a);
+       assert(tree_get(&tree, &a, &cmp_int, NULL) == NULL);
+
+       printf("testing clr\n");
+       tree_clr(&tree, NULL, NULL, 0);
+       assert(tree_get(&tree, &b, &cmp_int, NULL) == NULL);
+
+       printf("testing order and speed with %d elements\n", (int) NUM_ELEMENTS);
+       for (int i = 0; i < NUM_ELEMENTS; i++) {
+               int *n = malloc(sizeof *n);
+               *n = rand();
+
+               if (tree_add(&tree, n, &cmp_int, NULL) != n)
+                       free(n);
+       }
+
+       int last = -1;
+       tree_clr(&tree, &clear_callback, &last, TRAVERSION_INORDER);
+}