comparison: test/avl_tests.c
test/avl_tests.c
- changeset 201
- 45810f5b7b84
- parent 200
- e3aad99d2d80
- child 203
- 3d999ea3f780
equal
deleted
inserted
replaced
| 200:e3aad99d2d80 | 201:45810f5b7b84 |
|---|---|
| 158 ucx_avl_put(tree1, 1, (char*)data1); | 158 ucx_avl_put(tree1, 1, (char*)data1); |
| 159 ucx_avl_put(tree1, 3, (char*)data3); | 159 ucx_avl_put(tree1, 3, (char*)data3); |
| 160 void *val = ucx_avl_remove(tree1, 3); | 160 void *val = ucx_avl_remove(tree1, 3); |
| 161 | 161 |
| 162 UCX_TEST_ASSERT(check_tree(tree1->root), "check_tree failed (tree1)"); | 162 UCX_TEST_ASSERT(check_tree(tree1->root), "check_tree failed (tree1)"); |
| 163 UCX_TEST_ASSERT(val == data3, "wrong return value (tree1)"); | 163 UCX_TEST_ASSERT( |
| 164 val == data3, | |
| 165 "wrong return value for key: 1 (tree1)"); | |
| 164 UCX_TEST_ASSERT(ucx_avl_get(tree1, 3) == NULL, "value not removed (tree1)"); | 166 UCX_TEST_ASSERT(ucx_avl_get(tree1, 3) == NULL, "value not removed (tree1)"); |
| 167 UCX_TEST_ASSERT( | |
| 168 ucx_avl_remove(tree1, 2) == data2, | |
| 169 "wrong return value for key: 2 (tree1)"); | |
| 170 UCX_TEST_ASSERT(check_tree(tree1->root), "check_tree failed (tree1)"); | |
| 171 UCX_TEST_ASSERT( | |
| 172 ucx_avl_remove(tree1, 1) == data1, | |
| 173 "wrong return value for key: 1 (tree1)"); | |
| 174 UCX_TEST_ASSERT(check_tree(tree1->root), "check_tree failed (tree1)"); | |
| 175 UCX_TEST_ASSERT(tree1->root == NULL, "root not NULL (tree1)"); | |
| 176 | |
| 165 | 177 |
| 166 for(int i=0;i<20;i++) { | 178 for(int i=0;i<20;i++) { |
| 167 if(i==10) { | 179 if(i==10) { |
| 168 ucx_avl_put(tree2, i, data3); | 180 ucx_avl_put(tree2, i, data3); |
| 169 } else if(i==15) { | 181 } else if(i==15) { |
