apaki/unicstl
1
0
Fork 0
mirror of https://gitee.com/apaki/unicstl.git synced 2025-07-05 16:36:54 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Compare commits

base: apaki:feffd2b3c75039899c626e3cc2ba607f35be24a8
Branches Tags
apaki:master
apaki:map
apaki:dev-graph
apaki:v0.0.02
apaki:v0.0.01
...
compare: apaki:804075ab5f80fb08cb30c8d9226b1f6c5630630d
Branches Tags
apaki:map
apaki:master
apaki:dev-graph
apaki:v0.0.02
apaki:v0.0.01

5 Commits
feffd2b3c7 ... 804075ab5f

Author SHA1 Message Date
wjf-hs
804075ab5f 将插入和删除测试独立出来 2024-09-02 14:02:29 +08:00
wjf-hs
bd2ab13be8 迭代器：中序/后序遍历right优先测试通过 2024-09-02 11:44:25 +08:00
wjf-hs
e6828c2cb0 迭代器：前序遍历right优先测试通过 2024-09-02 11:38:19 +08:00
wjf-hs
c8f39bf53a 迭代器：层级遍历right优先测试通过 2024-09-02 11:31:05 +08:00
wjf-hs
8044d3b7b4 迭代器：层级遍历测试通过 2024-09-02 11:21:55 +08:00
3 changed files with 610 additions and 337 deletions
Show Stats Expand all files Collapse all files

50
README.md
View File

@ -1,35 +1,35 @@
# unicstl # unicstl
## 简介 ## 简介
全称: Universal C standard library 全称: Universal C standard library
基于C语言实现的通用C库。包含常用数据结构和算法 基于C语言实现的通用C库。包含常用数据结构和算法
> 标准：--std=c99 > 标准：--std=c99
[数据结构详细说明](http://wenjianfeng.top) [数据结构详细说明](http://wenjianfeng.top)
## 数据结构 ## 数据结构
|数据结构 | 原理 |说明 | |数据结构 | 原理 |说明 |
|---|---|---| |---|---|---|
| **stack** | | **栈** | | **stack** | | **栈** |
| stack_init | 链表 | | | stack_init | 链表 | |
| stack_init2 | 动态数组 | | | stack_init2 | 动态数组 | |
| **list** | | **列表** | **list** | | **列表**
| list_init2 | 动态数组 | | | list_init2 | 动态数组 | |
| **queue** | | **队列** | **queue** | | **队列**
| queue_init | 单向链表 | | | queue_init | 单向链表 | |
| queue_init2 | 数组 | FIFO/空/满 | | queue_init2 | 数组 | FIFO/空/满 |
| **deque** | |**双端队列** | | **deque** | |**双端队列** |
| deque_init | 双向循环链表 | | | deque_init | 双向循环链表 | |
| **tree** | |**树** | | **tree** | |**树** |
| tree_avl_init | 二叉搜索树 | AVL树 | | tree_avl_init | 二叉搜索树 | AVL树 |
| tree_rb_init | 二叉搜索树 | 红黑树 | | tree_rb_init | 二叉搜索树 | 红黑树 |
| **heap** | |**堆** | | **heap** | |**堆** |
| heap_init2 | 数组 | 最大堆/最小堆 | | heap_init2 | 数组 | 最大堆/最小堆 |
## 版本 ## 版本
| 版本 | 说明 | | 版本 | 说明 |
|:----:|:----:| |:----:|:----:|
| 0.xx.xx | 测试版本 | | 0.xx.xx | 测试版本 |

777
src/tree.c
View File

File diff suppressed because it is too large Load Diff

120
test/test_tree.c
View File

@ -537,7 +537,7 @@ static void test_tree_iter(void)
{ {
temp = data[i]; temp = data[i];
TEST_ASSERT_TRUE(tree->insert(tree, &temp)); TEST_ASSERT_TRUE(tree->insert(tree, &temp));
for (count = 0, iter = tree->begin(tree); iter != tree->end(tree); iter = tree->next(tree)) for (count = 0, iter = tree->begin(tree); iter != tree->end(tree); iter = tree->next(tree))
{ {
buff[count++] = *iter; buff[count++] = *iter;
@ -545,7 +545,7 @@ static void test_tree_iter(void)
TEST_ASSERT_EQUAL_INT_ARRAY(expected_int_array_orderpre_insert[i], buff, count); TEST_ASSERT_EQUAL_INT_ARRAY(expected_int_array_orderpre_insert[i], buff, count);
} }
for(i = 1; i < 3; i++) for(i = 1; i < 9; i++)
{ {
tree->set_order(tree, i); //ORDER_LEFT_IN tree->set_order(tree, i); //ORDER_LEFT_IN
// printf("\n ----- iter test -----\n"); // printf("\n ----- iter test -----\n");
@ -558,6 +558,8 @@ static void test_tree_iter(void)
TEST_ASSERT_EQUAL_INT_ARRAY(expected_int_array[i], buff, count); TEST_ASSERT_EQUAL_INT_ARRAY(expected_int_array[i], buff, count);
} }
#if 0
tree->order(tree, true);
printf("\n\nactual data = \n"); printf("\n\nactual data = \n");
tree->postorder(tree, tree->_root); tree->postorder(tree, tree->_root);
printf("\n"); printf("\n");
@ -565,7 +567,12 @@ static void test_tree_iter(void)
// set order // set order
// tree->set_order(tree, ORDER_LEFT_PRE); // tree->set_order(tree, ORDER_LEFT_PRE);
// tree->set_order(tree, ORDER_LEFT_IN); // tree->set_order(tree, ORDER_LEFT_IN);
tree->set_order(tree, ORDER_LEFT_POST); // tree->set_order(tree, ORDER_LEFT_POST);
// tree->set_order(tree, ORDER_LEFT_BREADTH);
// tree->set_order(tree, ORDER_RIGHT_PRE);
// tree->set_order(tree, ORDER_RIGHT_IN);
tree->set_order(tree, ORDER_RIGHT_POST);
// tree->set_order(tree, ORDER_RIGHT_BREADTH);
printf("\n ----- iter data -----\n"); printf("\n ----- iter data -----\n");
for (count = 0, iter = tree->begin(tree); iter != tree->end(tree); iter = tree->next(tree)) for (count = 0, iter = tree->begin(tree); iter != tree->end(tree); iter = tree->next(tree))
{ {
@ -573,7 +580,8 @@ static void test_tree_iter(void)
buff[count++] = *iter; buff[count++] = *iter;
} }
printf("\n"); printf("\n");
TEST_ASSERT_EQUAL_INT_ARRAY(expected_int_array[3], buff, count); TEST_ASSERT_EQUAL_INT_ARRAY(expected_int_array[tree->_order], buff, count);
#endif
TEST_ASSERT_FALSE(tree->empty(tree)); TEST_ASSERT_FALSE(tree->empty(tree));
TEST_ASSERT_TRUE(tree->clear(tree)); TEST_ASSERT_TRUE(tree->clear(tree));
@ -583,11 +591,111 @@ static void test_tree_iter(void)
TEST_ASSERT_NULL(tree); TEST_ASSERT_NULL(tree);
} }
static void test_avltree_insert(void)
{
uint32_t i = 0;
// int data[] = { 2,1,3,4};
// int data[] = { 1,2,3,4,5,6};
// int data[] = { 5,2,3,1,7,8,6 };
int data[15] = { 5, 2, 3, 1, 7, 8, 6, 4, 9, 10, 12, 11, 15, 14, 13, };
int buff[32];
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;
for (i = 0; i < len; i++)
{
temp = data[i];
TEST_ASSERT_TRUE(tree->insert(tree, &temp));
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);
}
for(i = 1; i < 9; i++)
{
tree->set_order(tree, i); //ORDER_LEFT_IN
// 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;
}
// printf("\n");
TEST_ASSERT_EQUAL_INT_ARRAY(expected_int_array[i], buff, count);
}
tree_free(&tree);
TEST_ASSERT_NULL(tree);
}
static void test_avltree_delete(void)
{
uint32_t i = 0;
int data[15] = { 5, 2, 3, 1, 7, 8, 6, 4, 9, 10, 12, 11, 15, 14, 13, };
int buff[32];
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;
for (i = 0; i < len; i++)
{
temp = data[i];
TEST_ASSERT_TRUE(tree->insert(tree, &temp));
}
for (i = 0; i < len; i++)
{
for (count = 0, iter = tree->begin(tree); iter != tree->end(tree); iter = tree->next(tree))
{
buff[count++] = *iter;
// printf("(%2d ) ", *iter);
}
// printf("\n");
TEST_ASSERT_EQUAL_INT_ARRAY(expected_int_array_orderpre_delete[i], buff, count);
temp = data[i];
// delete
TEST_ASSERT_TRUE(tree->delete(tree, &temp));
}
//
TEST_ASSERT_FALSE(tree->delete(tree, &temp));
tree_free(&tree);
TEST_ASSERT_NULL(tree);
}
void test_tree(void) void test_tree(void)
{ {
RUN_TEST(test_tree_iter);
RUN_TEST(test_avltree_insert);
RUN_TEST(test_avltree_delete);
// RUN_TEST(test_avltree_num); // RUN_TEST(test_avltree_num);
// RUN_TEST(test_rbtree_num); // RUN_TEST(test_rbtree_num);
// RUN_TEST(test_rbtree_struct); // RUN_TEST(test_rbtree_struct);
RUN_TEST(test_tree_iter);
} }