72de3d45cc
git subtree pull --prefix shared/c-rbtree git@github.com:c-util/c-rbtree.git master --squash
67 lines
1.5 KiB
C
67 lines
1.5 KiB
C
/*
|
|
* Tests for Miscellaneous Tree Operations
|
|
* This test contains all of the minor tests that did not fit anywhere else.
|
|
*/
|
|
|
|
#undef NDEBUG
|
|
#include <assert.h>
|
|
#include <c-stdaux.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include "c-rbtree.h"
|
|
#include "c-rbtree-private.h"
|
|
|
|
static void insert(CRBTree *t, CRBNode *n) {
|
|
CRBNode **i, *p;
|
|
|
|
c_assert(t);
|
|
c_assert(n);
|
|
c_assert(!c_rbnode_is_linked(n));
|
|
|
|
i = &t->root;
|
|
p = NULL;
|
|
while (*i) {
|
|
p = *i;
|
|
if (n < *i) {
|
|
i = &(*i)->left;
|
|
} else {
|
|
c_assert(n > *i);
|
|
i = &(*i)->right;
|
|
}
|
|
}
|
|
|
|
c_rbtree_add(t, p, i, n);
|
|
}
|
|
|
|
static void test_move(void) {
|
|
CRBTree t1 = C_RBTREE_INIT, t2 = C_RBTREE_INIT;
|
|
CRBNode n[128];
|
|
unsigned int i;
|
|
|
|
for (i = 0; i < sizeof(n) / sizeof(*n); ++i) {
|
|
n[i] = (CRBNode)C_RBNODE_INIT(n[i]);
|
|
insert(&t1, &n[i]);
|
|
}
|
|
|
|
c_assert(!c_rbtree_is_empty(&t1));
|
|
c_assert(c_rbtree_is_empty(&t2));
|
|
|
|
c_rbtree_move(&t2, &t1);
|
|
|
|
c_assert(c_rbtree_is_empty(&t1));
|
|
c_assert(!c_rbtree_is_empty(&t2));
|
|
|
|
while (t2.root)
|
|
c_rbnode_unlink(t2.root);
|
|
|
|
c_assert(c_rbtree_is_empty(&t1));
|
|
c_assert(c_rbtree_is_empty(&t2));
|
|
}
|
|
|
|
int main(int argc, char **argv) {
|
|
test_move();
|
|
|
|
return 0;
|
|
}
|