mirror of
https://gitee.com/apaki/unicstl.git
synced 2025-05-18 03:51:35 +08:00
添加测试用的数据
This commit is contained in:
parent
5954acb1a0
commit
1bf06756b7
147
test/test_tree.c
147
test/test_tree.c
@ -1,16 +1,16 @@
|
||||
/**
|
||||
* @file test_tree.c
|
||||
* @author wenjf (Orig5826@163.com)
|
||||
* @brief
|
||||
* @brief
|
||||
* @version 0.1
|
||||
* @date 2024-09-02
|
||||
*
|
||||
*
|
||||
* @copyright Copyright (c) 2024
|
||||
*
|
||||
*
|
||||
*/
|
||||
#include "test.h"
|
||||
|
||||
// if vs2022 has error: 'max': macro redefinition
|
||||
// if vs2022 has error: 'max': macro redefinition
|
||||
#ifdef max
|
||||
#undef max
|
||||
#endif
|
||||
@ -21,7 +21,7 @@
|
||||
|
||||
#if 0
|
||||
/**
|
||||
* @brief
|
||||
* @brief
|
||||
* int data[] = { 5,2,3,1,7,8,6 };
|
||||
* 5
|
||||
* | |
|
||||
@ -39,7 +39,7 @@ void test_avltree_num(void)
|
||||
int temp = 0;
|
||||
uint32_t len = sizeof(data) / sizeof(data[0]);
|
||||
|
||||
tree_t tree = tree_new,;
|
||||
tree_t tree = tree_new, ;
|
||||
tree_avl_init(tree, sizeof(int));
|
||||
tree->print_obj = print_num;
|
||||
tree->compare = compare_num;
|
||||
@ -71,7 +71,7 @@ void test_avltree_num(void)
|
||||
|
||||
printf("----- tree -----\n");
|
||||
tree->clear(tree);
|
||||
if(tree->empty(tree))
|
||||
if (tree->empty(tree))
|
||||
{
|
||||
printf("----- empty -----\n");
|
||||
}
|
||||
@ -137,7 +137,7 @@ void test_avltree_num(void)
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
if(tree->empty(tree))
|
||||
if (tree->empty(tree))
|
||||
{
|
||||
printf("----- empty -----\n");
|
||||
}
|
||||
@ -145,11 +145,11 @@ void test_avltree_num(void)
|
||||
tree_free(&tree);
|
||||
}
|
||||
|
||||
static bool tree_rb_check_color(struct _tree *self, struct _tree_node* root, int black_num, int black_num_expected)
|
||||
static bool tree_rb_check_color(struct _tree* self, struct _tree_node* root, int black_num, int black_num_expected)
|
||||
{
|
||||
if(root == NULL)
|
||||
if (root == NULL)
|
||||
{
|
||||
if(black_num != black_num_expected)
|
||||
if (black_num != black_num_expected)
|
||||
{
|
||||
printf("black_num != black_num_expected\n");
|
||||
return false;
|
||||
@ -157,29 +157,29 @@ static bool tree_rb_check_color(struct _tree *self, struct _tree_node* root, int
|
||||
return true;
|
||||
}
|
||||
|
||||
if(root->color == RBT_BLACK)
|
||||
if (root->color == RBT_BLACK)
|
||||
{
|
||||
black_num++;
|
||||
}
|
||||
|
||||
if(root->color == RBT_RED && root->parent && root->parent->color == RBT_RED)
|
||||
if (root->color == RBT_RED && root->parent && root->parent->color == RBT_RED)
|
||||
{
|
||||
printf("The red node is adjacent to the red node\n");
|
||||
return false;
|
||||
}
|
||||
return tree_rb_check_color(self, root->left, black_num, black_num_expected) &&
|
||||
return tree_rb_check_color(self, root->left, black_num, black_num_expected) &&
|
||||
tree_rb_check_color(self, root->right, black_num, black_num_expected);
|
||||
}
|
||||
|
||||
static bool tree_rb_check(struct _tree* self)
|
||||
{
|
||||
assert(self != NULL);
|
||||
if(self->_root == NULL)
|
||||
if (self->_root == NULL)
|
||||
{
|
||||
return true;
|
||||
}
|
||||
|
||||
if(self->_root->color != RBT_BLACK)
|
||||
if (self->_root->color != RBT_BLACK)
|
||||
{
|
||||
printf("self->_root->color != RBT_BLACK\n");
|
||||
return false;
|
||||
@ -187,9 +187,9 @@ static bool tree_rb_check(struct _tree* self)
|
||||
|
||||
int black_num_expected = 0;
|
||||
struct _tree_node* root = self->_root;
|
||||
while(root)
|
||||
while (root)
|
||||
{
|
||||
if(root->color == RBT_BLACK)
|
||||
if (root->color == RBT_BLACK)
|
||||
{
|
||||
black_num_expected++;
|
||||
}
|
||||
@ -199,7 +199,7 @@ static bool tree_rb_check(struct _tree* self)
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief
|
||||
* @brief
|
||||
*/
|
||||
void test_rbtree_num(void)
|
||||
{
|
||||
@ -211,7 +211,7 @@ void test_rbtree_num(void)
|
||||
int temp = 0;
|
||||
uint32_t len = sizeof(data) / sizeof(data[0]);
|
||||
|
||||
tree_t tree = tree_new,;
|
||||
tree_t tree = tree_new, ;
|
||||
tree_rb_init(tree, sizeof(int));
|
||||
tree->print_obj = print_num;
|
||||
tree->compare = compare_num;
|
||||
@ -230,7 +230,7 @@ void test_rbtree_num(void)
|
||||
tree->preorder(tree, tree->_root);
|
||||
printf("\n");
|
||||
|
||||
if(true != tree_rb_check(tree))
|
||||
if (true != tree_rb_check(tree))
|
||||
{
|
||||
printf("----- rb_check_error -----\n");
|
||||
return;
|
||||
@ -249,7 +249,7 @@ void test_rbtree_num(void)
|
||||
|
||||
printf("----- tree -----\n");
|
||||
tree->clear(tree);
|
||||
if(tree->empty(tree))
|
||||
if (tree->empty(tree))
|
||||
{
|
||||
printf("----- empty -----\n");
|
||||
}
|
||||
@ -315,14 +315,14 @@ void test_rbtree_num(void)
|
||||
tree->preorder(tree, tree->_root);
|
||||
printf("\n");
|
||||
|
||||
if(true != tree_rb_check(tree))
|
||||
if (true != tree_rb_check(tree))
|
||||
{
|
||||
printf("----- rb_check_error -----\n");
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
if(tree->empty(tree))
|
||||
if (tree->empty(tree))
|
||||
{
|
||||
printf("----- empty -----\n");
|
||||
}
|
||||
@ -331,7 +331,7 @@ void test_rbtree_num(void)
|
||||
}
|
||||
|
||||
/**
|
||||
* @brief
|
||||
* @brief
|
||||
*/
|
||||
void test_rbtree_struct(void)
|
||||
{
|
||||
@ -340,10 +340,10 @@ void test_rbtree_struct(void)
|
||||
{"zhao", 1001},{"qian", 1002}, {"sun", 1003}, {"li", 1004},
|
||||
"zhou", 1005, "wu", 1006, "zheng", 1007, "wang", 1008,
|
||||
};
|
||||
struct _student temp = {0};
|
||||
struct _student temp = { 0 };
|
||||
uint32_t len = sizeof(data) / sizeof(data[0]);
|
||||
|
||||
tree_t tree = tree_new,;
|
||||
tree_t tree = tree_new, ;
|
||||
tree_rb_init(tree, sizeof(struct _student));
|
||||
tree->print_obj = print_struct;
|
||||
tree->compare = compare_struct;
|
||||
@ -362,7 +362,7 @@ void test_rbtree_struct(void)
|
||||
tree->preorder(tree, tree->_root);
|
||||
printf("\n");
|
||||
|
||||
if(true != tree_rb_check(tree))
|
||||
if (true != tree_rb_check(tree))
|
||||
{
|
||||
printf("----- rb_check_error -----\n");
|
||||
return;
|
||||
@ -381,7 +381,7 @@ void test_rbtree_struct(void)
|
||||
|
||||
printf("----- tree -----\n");
|
||||
tree->clear(tree);
|
||||
if(tree->empty(tree))
|
||||
if (tree->empty(tree))
|
||||
{
|
||||
printf("----- empty -----\n");
|
||||
}
|
||||
@ -447,14 +447,14 @@ void test_rbtree_struct(void)
|
||||
tree->preorder(tree, tree->_root);
|
||||
printf("\n");
|
||||
|
||||
if(true != tree_rb_check(tree))
|
||||
if (true != tree_rb_check(tree))
|
||||
{
|
||||
printf("----- rb_check_error -----\n");
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
if(tree->empty(tree))
|
||||
if (tree->empty(tree))
|
||||
{
|
||||
printf("----- empty -----\n");
|
||||
}
|
||||
@ -463,11 +463,53 @@ void test_rbtree_struct(void)
|
||||
}
|
||||
#endif
|
||||
|
||||
static const int const expected_int_array[9][15] = {
|
||||
{ 5, 2, 3, 1, 7, 8, 6, 4, 9, 10, 12, 11, 15, 14, 13, }, // original data
|
||||
{ 7, 3, 2, 1, 5, 4, 6, 11, 9, 8, 10, 14, 12, 13, 15, }, // order_left_pre
|
||||
static const int expected_int_array[9][15] = {
|
||||
{ 5, 2, 3, 1, 7, 8, 6, 4, 9, 10, 12, 11, 15, 14, 13}, // original data
|
||||
{ 7, 3, 2, 1, 5, 4, 6, 11, 9, 8, 10, 14, 12, 13, 15}, // order_left_pre
|
||||
{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}, // order_left_in
|
||||
{ 1, 2, 4, 6, 5, 3, 8, 10, 9, 13, 12, 15, 14, 11, 7}, // order_left_post
|
||||
{ 7, 3, 11, 2, 5, 9, 14, 1, 4, 6, 8, 10, 12, 15, 13}, // order_left_breadth
|
||||
{ 7, 11, 14, 15, 12, 13, 9, 10, 8, 3, 5, 6, 4, 2, 1}, // order_right_pre
|
||||
{ 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1}, // order_right_in
|
||||
{ 15, 13, 12, 14, 10, 8, 9, 11, 6, 4, 5, 1, 2, 3, 7}, // order_right_post
|
||||
{ 7, 11, 3, 14, 9, 5, 2, 15, 12, 10, 8, 6, 4, 1, 13}, // order_right_breadth
|
||||
};
|
||||
|
||||
static const int expected_int_array_orderpre_insert[15][15] = {
|
||||
{ 5, },
|
||||
{ 5, 2, },
|
||||
{ 3, 2, 5, },
|
||||
{ 3, 2, 1, 5, },
|
||||
{ 3, 2, 1, 5, 7, },
|
||||
{ 3, 2, 1, 7, 5, 8, },
|
||||
{ 3, 2, 1, 7, 5, 6, 8, },
|
||||
{ 3, 2, 1, 7, 5, 4, 6, 8, },
|
||||
{ 3, 2, 1, 7, 5, 4, 6, 8, 9, },
|
||||
{ 3, 2, 1, 7, 5, 4, 6, 9, 8, 10, },
|
||||
{ 7, 3, 2, 1, 5, 4, 6, 9, 8, 10, 12, },
|
||||
{ 7, 3, 2, 1, 5, 4, 6, 9, 8, 11, 10, 12, },
|
||||
{ 7, 3, 2, 1, 5, 4, 6, 11, 9, 8, 10, 12, 15, },
|
||||
{ 7, 3, 2, 1, 5, 4, 6, 11, 9, 8, 10, 14, 12, 15, },
|
||||
{ 7, 3, 2, 1, 5, 4, 6, 11, 9, 8, 10, 14, 12, 13, 15, },
|
||||
};
|
||||
|
||||
static const int expected_int_array_orderpre_delete[15][15] = {
|
||||
{ 7, 3, 2, 1, 5, 4, 6, 11, 9, 8, 10, 14, 12, 13, 15, },
|
||||
{ 7, 3, 2, 1, 6, 4, 11, 9, 8, 10, 14, 12, 13, 15, },
|
||||
{ 7, 3, 1, 6, 4, 11, 9, 8, 10, 14, 12, 13, 15, },
|
||||
{ 7, 4, 1, 6, 11, 9, 8, 10, 14, 12, 13, 15, },
|
||||
{ 11, 7, 4, 6, 9, 8, 10, 14, 12, 13, 15, },
|
||||
{ 11, 8, 4, 6, 9, 10, 14, 12, 13, 15, },
|
||||
{ 11, 9, 4, 6, 10, 14, 12, 13, 15, },
|
||||
{ 11, 9, 4, 10, 14, 12, 13, 15, },
|
||||
{ 11, 9, 10, 14, 12, 13, 15, },
|
||||
{ 12, 11, 10, 14, 13, 15, },
|
||||
{ 12, 11, 14, 13, 15, },
|
||||
{ 13, 11, 14, 15, },
|
||||
{ 14, 13, 15, },
|
||||
{ 14, 13, },
|
||||
{ 13, },
|
||||
};
|
||||
|
||||
static void test_tree_iter(void)
|
||||
{
|
||||
@ -478,11 +520,15 @@ static void test_tree_iter(void)
|
||||
// int data[] = { 5,2,3,1,7,8,6,4,9,10,12,11,15,14,13 };
|
||||
int data[15] = { 5, 2, 3, 1, 7, 8, 6, 4, 9, 10, 12, 11, 15, 14, 13, };
|
||||
int buff[32];
|
||||
int count = 0;
|
||||
int temp = 0;
|
||||
uint32_t len = sizeof(data) / sizeof(data[0]);
|
||||
|
||||
int * iter = NULL;
|
||||
int count = 0;
|
||||
|
||||
tree_t tree = tree_new();
|
||||
TEST_ASSERT_NOT_NULL(tree);
|
||||
|
||||
tree_avl_init(tree, sizeof(int));
|
||||
tree->print_obj = print_num;
|
||||
tree->compare = compare_num;
|
||||
@ -490,28 +536,25 @@ static void test_tree_iter(void)
|
||||
for (i = 0; i < len; i++)
|
||||
{
|
||||
temp = data[i];
|
||||
tree->insert(tree, &temp);
|
||||
TEST_ASSERT_TRUE(tree->insert(tree, &temp));
|
||||
|
||||
// printf("insert = ");
|
||||
// tree->print_obj(&temp);
|
||||
// printf("size = %2d : ", tree->size(tree));
|
||||
// tree->preorder(tree, tree->_root);
|
||||
// printf("\n");
|
||||
for (count = 0, iter = tree->begin(tree); iter != tree->end(tree); iter = tree->next(tree))
|
||||
{
|
||||
buff[count++] = *iter;
|
||||
}
|
||||
TEST_ASSERT_EQUAL_INT_ARRAY(expected_int_array_orderpre_insert[i], buff, count);
|
||||
}
|
||||
printf("insert = ");
|
||||
tree->print_obj(&temp);
|
||||
printf("size = %2d : \n", tree->size(tree));
|
||||
tree->preorder(tree, tree->_root);
|
||||
printf("\n");
|
||||
|
||||
// printf("insert = ");
|
||||
// tree->print_obj(&temp);
|
||||
// printf("size = %2d : \n", tree->size(tree));
|
||||
// tree->preorder(tree, tree->_root);
|
||||
// printf("\n");
|
||||
|
||||
// set order
|
||||
tree->order(tree, ORDER_LEFT_PRE);
|
||||
tree->set_order(tree, ORDER_LEFT_PRE);
|
||||
// tree->set_order(tree, ORDER_LEFT_IN);
|
||||
|
||||
printf("\niter test\n");
|
||||
int * iter = NULL;
|
||||
for(iter = tree->begin(tree); iter != tree->end(tree); iter = tree->next(tree))
|
||||
printf("\n ----- iter test -----\n");
|
||||
for (count = 0, iter = tree->begin(tree); iter != tree->end(tree); iter = tree->next(tree))
|
||||
{
|
||||
printf("(%2d ) ", *iter);
|
||||
buff[count++] = *iter;
|
||||
|
||||
Loading…
Reference in New Issue
Block a user