universe@56: /* universe@103: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. universe@56: * universe@259: * Copyright 2017 Mike Becker, Olaf Wintermann All rights reserved. universe@103: * universe@103: * Redistribution and use in source and binary forms, with or without universe@103: * modification, are permitted provided that the following conditions are met: universe@103: * universe@103: * 1. Redistributions of source code must retain the above copyright universe@103: * notice, this list of conditions and the following disclaimer. universe@103: * universe@103: * 2. Redistributions in binary form must reproduce the above copyright universe@103: * notice, this list of conditions and the following disclaimer in the universe@103: * documentation and/or other materials provided with the distribution. universe@103: * universe@103: * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" universe@103: * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE universe@103: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE universe@103: * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE universe@103: * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR universe@103: * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF universe@103: * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS universe@103: * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN universe@103: * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) universe@103: * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE universe@103: * POSSIBILITY OF SUCH DAMAGE. universe@56: */ universe@56: universe@192: #include "avl_tests.h" universe@56: universe@251: #include olaf@198: olaf@198: static int node_height(UcxAVLNode *node) { olaf@198: if(!node) { olaf@198: return 0; olaf@198: } olaf@198: olaf@198: int left = 0; olaf@198: int right = 0; olaf@198: if(node->left) { olaf@198: left = node_height(node->left); olaf@198: } olaf@198: if(node->right) { olaf@198: right = node_height(node->right); olaf@198: } olaf@198: olaf@198: return left > right ? left+1 : right+1; olaf@198: } olaf@198: olaf@198: static int check_tree(UcxAVLNode *node) { olaf@198: if(!node) { olaf@198: return 1; olaf@198: } olaf@198: olaf@198: int left_height = node_height(node->left); olaf@198: int right_height = node_height(node->right); olaf@198: int bf = -left_height + right_height; olaf@198: if(bf < -1 || bf > 1) { olaf@198: return 0; olaf@198: } olaf@198: int height = left_height > right_height ? left_height : right_height; olaf@198: height++; olaf@198: if(height != node->height) { olaf@198: return 0; olaf@198: } olaf@198: olaf@198: if(!check_tree(node->left)) { olaf@198: return 0; olaf@198: } olaf@198: if(!check_tree(node->right)) { olaf@198: return 0; olaf@198: } olaf@198: olaf@198: return 1; olaf@198: } olaf@198: olaf@198: UCX_TEST(test_ucx_avl_put) { universe@312: UcxAVLTree *tree1 = ucx_avl_new(ucx_cmp_ptr); universe@312: UcxAVLTree *tree2 = ucx_avl_new(ucx_cmp_ptr); universe@312: UcxAVLTree *tree3 = ucx_avl_new(ucx_cmp_ptr); universe@312: UcxAVLTree *tree4 = ucx_avl_new(ucx_cmp_ptr); universe@312: UcxAVLTree *tree5 = ucx_avl_new(ucx_cmp_ptr); olaf@198: olaf@198: char *data1 = (char*)"data1"; olaf@198: char *data2 = (char*)"data2"; olaf@198: char *data3 = (char*)"data3"; olaf@198: olaf@198: UCX_TEST_BEGIN olaf@198: olaf@198: ucx_avl_put(tree1, 2, (char*)data2); olaf@198: ucx_avl_put(tree1, 1, (char*)data1); olaf@198: ucx_avl_put(tree1, 3, (char*)data3); olaf@198: olaf@198: UCX_TEST_ASSERT(check_tree(tree1->root), "check_tree failed (tree1)"); olaf@198: UCX_TEST_ASSERT(ucx_avl_get(tree1, 1) == data1, "wrong data (tree1)"); olaf@198: UCX_TEST_ASSERT(ucx_avl_get(tree1, 2) == data2, "wrong data (tree1)"); olaf@198: UCX_TEST_ASSERT(ucx_avl_get(tree1, 3) == data3, "wrong data (tree1)"); olaf@198: olaf@198: for(int i=0;i<100000;i++) { olaf@198: ucx_avl_put(tree2, i, data1); olaf@198: } olaf@198: UCX_TEST_ASSERT(check_tree(tree2->root), "check_tree failed (tree2)"); olaf@198: olaf@198: for(int i=100000;i>=0;i--) { olaf@198: ucx_avl_put(tree3, i, data1); olaf@198: } olaf@198: UCX_TEST_ASSERT(check_tree(tree3->root), "check_tree failed (tree3)"); olaf@198: olaf@198: for(int i=0;i<100;i++) { olaf@198: ucx_avl_put(tree4, i, data1); olaf@198: } olaf@198: for(int i=400;i<500;i++) { olaf@198: ucx_avl_put(tree4, i, data2); olaf@198: } olaf@198: for(int i=399;i>200;i--) { olaf@198: ucx_avl_put(tree4, i, data3); olaf@198: } olaf@198: for(int i=800;i<1000;i++) { olaf@198: ucx_avl_put(tree4, i, data1); olaf@198: } olaf@198: UCX_TEST_ASSERT(check_tree(tree4->root), "check_tree failed (tree4)"); olaf@198: UCX_TEST_ASSERT(ucx_avl_get(tree4, 0) == data1, "wrong data for key: 0"); olaf@198: UCX_TEST_ASSERT(ucx_avl_get(tree4, 1) == data1, "wrong data for key: 1"); olaf@198: UCX_TEST_ASSERT(ucx_avl_get(tree4, 99) == data1, "wrong data for key: 99"); olaf@198: UCX_TEST_ASSERT(ucx_avl_get(tree4, 400)==data2, "wrong data for key: 400"); olaf@198: UCX_TEST_ASSERT(ucx_avl_get(tree4, 410)==data2, "wrong data for key: 410"); olaf@198: UCX_TEST_ASSERT(ucx_avl_get(tree4, 350)==data3, "wrong data for key: 350"); olaf@198: UCX_TEST_ASSERT(ucx_avl_get(tree4, 900)==data1, "wrong data for key: 900"); olaf@198: olaf@198: int values[] = { 3, 6, 12, 9, 23, 1, 0, 20, 34, 5, 8, 7, 6, 14, 15, 2, 4}; olaf@198: int len = sizeof(values) / sizeof(int); olaf@198: for(int i=0;iroot), "check_tree failed (tree5)"); olaf@198: olaf@198: UCX_TEST_END olaf@198: olaf@198: ucx_avl_free(tree1); olaf@198: ucx_avl_free(tree2); olaf@198: ucx_avl_free(tree3); olaf@198: ucx_avl_free(tree4); olaf@198: ucx_avl_free(tree5); olaf@198: } olaf@200: olaf@200: UCX_TEST(test_ucx_avl_remove) { universe@312: UcxAVLTree *tree1 = ucx_avl_new(ucx_cmp_ptr); universe@312: UcxAVLTree *tree2 = ucx_avl_new(ucx_cmp_ptr); universe@312: UcxAVLTree *tree3 = ucx_avl_new(ucx_cmp_ptr); universe@312: UcxAVLTree *tree4 = ucx_avl_new(ucx_cmp_ptr); olaf@200: olaf@200: char *data1 = (char*)"data1"; olaf@200: char *data2 = (char*)"data2"; olaf@200: char *data3 = (char*)"data3"; olaf@200: olaf@200: UCX_TEST_BEGIN olaf@200: ucx_avl_put(tree1, 2, (char*)data2); olaf@200: ucx_avl_put(tree1, 1, (char*)data1); olaf@200: ucx_avl_put(tree1, 3, (char*)data3); universe@204: void *val; universe@204: ucx_avl_remove_s(tree1, 3, NULL, &val); olaf@200: olaf@200: UCX_TEST_ASSERT(check_tree(tree1->root), "check_tree failed (tree1)"); universe@204: UCX_TEST_ASSERT(val == data3, olaf@201: "wrong return value for key: 1 (tree1)"); olaf@200: UCX_TEST_ASSERT(ucx_avl_get(tree1, 3) == NULL, "value not removed (tree1)"); universe@204: universe@204: ucx_avl_remove_s(tree1, 2, NULL, &val); universe@204: UCX_TEST_ASSERT(val == data2, olaf@201: "wrong return value for key: 2 (tree1)"); olaf@201: UCX_TEST_ASSERT(check_tree(tree1->root), "check_tree failed (tree1)"); universe@204: universe@204: ucx_avl_remove_s(tree1, 1, NULL, &val); universe@204: UCX_TEST_ASSERT(val == data1, olaf@201: "wrong return value for key: 1 (tree1)"); olaf@201: UCX_TEST_ASSERT(check_tree(tree1->root), "check_tree failed (tree1)"); olaf@201: UCX_TEST_ASSERT(tree1->root == NULL, "root not NULL (tree1)"); olaf@201: olaf@200: olaf@200: for(int i=0;i<20;i++) { olaf@200: if(i==10) { olaf@200: ucx_avl_put(tree2, i, data3); olaf@200: } else if(i==15) { olaf@200: ucx_avl_put(tree2, i, data2); olaf@200: } else { olaf@200: ucx_avl_put(tree2, i, data1); olaf@200: } olaf@200: } olaf@200: universe@204: ucx_avl_remove_s(tree2, 10, NULL, &val); universe@204: UCX_TEST_ASSERT(val == data3, olaf@200: "wrong return value for key: 10 (tree2)"); olaf@200: UCX_TEST_ASSERT(check_tree(tree2->root), "check_tree failed (tree2)"); olaf@200: universe@204: ucx_avl_remove_s(tree2, 15, NULL, &val); universe@204: UCX_TEST_ASSERT(val == data2, olaf@200: "wrong return value for key: 15 (tree2)"); olaf@200: UCX_TEST_ASSERT(check_tree(tree2->root), "check_tree failed (tree2)"); olaf@200: olaf@200: for(int i=0;i<20;i++) { olaf@200: ucx_avl_remove(tree2, i); olaf@200: UCX_TEST_ASSERT(check_tree(tree2->root), "check_tree failed (tree2)"); olaf@200: } olaf@203: UCX_TEST_ASSERT(tree2->root == NULL, "root not NULL (tree2)"); olaf@200: olaf@200: for(int i=0;i<100000;i++) { olaf@200: ucx_avl_put(tree3, i, data1); olaf@200: } olaf@200: for(int i=100000-1;i>=0;i--) { olaf@200: ucx_avl_remove(tree3, i); olaf@200: } olaf@200: UCX_TEST_ASSERT(tree3->root == NULL, "root not NULL (tree3)"); olaf@200: UCX_TEST_ASSERT(check_tree(tree3->root), "check_tree failed (tree3)"); olaf@200: olaf@200: ucx_avl_put(tree4, 1, data1); olaf@200: ucx_avl_remove(tree4, 1); olaf@200: UCX_TEST_ASSERT(check_tree(tree4->root), "check_tree failed (tree4)"); olaf@200: UCX_TEST_ASSERT(tree4->root == NULL, "root not NULL (tree4)"); olaf@200: UCX_TEST_END olaf@200: olaf@200: ucx_avl_free(tree1); olaf@200: ucx_avl_free(tree2); olaf@200: ucx_avl_free(tree3); olaf@200: ucx_avl_free(tree4); olaf@200: } universe@243: universe@244: static intmax_t dist_int(const void* a, const void* b, void* n) { universe@243: return ((intmax_t)a)-((intmax_t)b); universe@243: } universe@243: universe@243: UCX_TEST(test_ucx_avl_find) { universe@312: UcxAVLTree *tree = ucx_avl_new(ucx_cmp_ptr); universe@243: universe@243: size_t len = 12; universe@243: int val[] = {10, 15, 3, 4, -30, 20, 14, -11, 12, -5, 1, 13}; universe@243: universe@243: for (size_t i = 0 ; i < len ; i++) { universe@243: ucx_avl_put(tree, val[i], &(val[i])); universe@243: } universe@243: universe@243: UCX_TEST_BEGIN universe@243: universe@243: void* ret; universe@243: universe@243: /* test present values */ universe@243: ret = ucx_avl_find(tree,(intptr_t)-5, dist_int, UCX_AVL_FIND_CLOSEST); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == -5, "AVL find closest failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)-5, dist_int, UCX_AVL_FIND_EXACT); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == -5, "AVL find exact failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)-5, dist_int, UCX_AVL_FIND_LOWER_BOUNDED); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == -5, "AVL find LB failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)-5, dist_int, UCX_AVL_FIND_UPPER_BOUNDED); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == -5, "AVL find UB failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)12, dist_int, UCX_AVL_FIND_CLOSEST); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == 12, "AVL find closest failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)12, dist_int, UCX_AVL_FIND_EXACT); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == 12, "AVL find exact failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)12, dist_int, UCX_AVL_FIND_LOWER_BOUNDED); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == 12, "AVL find LB failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)12, dist_int, UCX_AVL_FIND_UPPER_BOUNDED); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == 12, "AVL find UB failed"); universe@243: universe@243: /* test missing values */ universe@243: ret = ucx_avl_find(tree,(intptr_t)-10, dist_int, UCX_AVL_FIND_CLOSEST); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == -11, "AVL find closest failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)-8, dist_int, UCX_AVL_FIND_EXACT); universe@243: UCX_TEST_ASSERT(!ret, "AVL find exact failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)-8, dist_int, UCX_AVL_FIND_LOWER_BOUNDED); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == -5, "AVL find LB failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)-8, dist_int, UCX_AVL_FIND_UPPER_BOUNDED); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == -11, "AVL find UB failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)18, dist_int, UCX_AVL_FIND_CLOSEST); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == 20, "AVL find closest failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)7, dist_int, UCX_AVL_FIND_EXACT); universe@243: UCX_TEST_ASSERT(!ret, "AVL find exact failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)7, dist_int, UCX_AVL_FIND_LOWER_BOUNDED); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == 10, "AVL find LB failed"); universe@243: ret = ucx_avl_find(tree,(intptr_t)7, dist_int, UCX_AVL_FIND_UPPER_BOUNDED); universe@243: UCX_TEST_ASSERT(ret && *((int*)ret) == 4, "AVL find UB failed"); universe@243: universe@243: UCX_TEST_END universe@243: universe@243: ucx_avl_free(tree); universe@243: } universe@245: universe@245: UCX_TEST(test_ucx_avl_traverse) { universe@312: UcxAVLTree *tree = ucx_avl_new(ucx_cmp_ptr); universe@245: universe@245: size_t len = 12; universe@245: universe@245: int val[] = {10, 15, 3, 4, -30, 20, 14, -11, 12, -5, 1, 13}; universe@245: int val_ordered[] = {-30, -11, -5, 1, 3, 4, 10, 12, 13, 14, 15, 20}; universe@245: universe@245: for (size_t i = 0 ; i < len ; i++) { universe@245: ucx_avl_put(tree, val[i], &(val[i])); universe@245: } universe@245: universe@245: UCX_TEST_BEGIN universe@245: universe@245: UcxAVLNode* node = ucx_avl_get_node(tree, (intptr_t) val_ordered[0]); universe@245: for (size_t i = 0 ; i < len ; i++) { universe@245: UCX_TEST_ASSERT(node->key == val_ordered[i], "AVL successor failed"); universe@245: node = ucx_avl_succ(node); universe@245: } universe@245: UCX_TEST_ASSERT(!node, "AVL maximum incorrectly has a successor"); universe@245: universe@245: node = ucx_avl_get_node(tree, (intptr_t) val_ordered[len-1]); universe@245: for (size_t i = len ; i > 0 ; i--) { universe@245: UCX_TEST_ASSERT(node->key == val_ordered[i-1],"AVL predecessor failed"); universe@245: node = ucx_avl_pred(node); universe@245: } universe@245: UCX_TEST_ASSERT(!node, "AVL minimum incorrectly has a predecessor"); universe@245: universe@245: UCX_TEST_END universe@245: universe@245: ucx_avl_free(tree); universe@245: }