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

太棒了！tree的新版迭代器调试通过了。后续可以删除那么多没用的成员函数了

Browse Source
This commit is contained in:
建峰 2025-04-24 18:57:57 +08:00
parent 5ab918b067
commit 34875ce3fa
2 changed files with 15 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
src/tree.c
View File

@ -1966,6 +1966,7 @@ iterator_t tree_iter(struct _tree* self, enum _order order)
case ORDER_RIGHT_BREADTH: case ORDER_RIGHT_BREADTH:
{ {
// pass // pass
self->queue->push(self->queue, &self->_root);
}break; }break;
default: default:
{ {

28
test/test_tree.c
View File

@ -952,13 +952,13 @@ static void test_avltree_iter_2(void)
} }
printf("\n"); printf("\n");
// iter = tree->iter(tree, ORDER_LEFT_BREADTH); iter = tree->iter(tree, ORDER_LEFT_BREADTH);
// while(iter->hasnext(iter)) while(iter->hasnext(iter))
// { {
// temp = *(int *)iter->next(iter); temp = *(int *)iter->next(iter);
// tree->print_obj(&temp); tree->print_obj(&temp);
// } }
// printf("\n"); printf("\n");
iter = tree->iter(tree, ORDER_RIGHT_PRE); iter = tree->iter(tree, ORDER_RIGHT_PRE);
while(iter->hasnext(iter)) while(iter->hasnext(iter))
@ -984,13 +984,13 @@ static void test_avltree_iter_2(void)
} }
printf("\n"); printf("\n");
// iter = tree->iter(tree, ORDER_RIGHT_BREADTH); iter = tree->iter(tree, ORDER_RIGHT_BREADTH);
// while(iter->hasnext(iter)) while(iter->hasnext(iter))
// { {
// temp = *(int *)iter->next(iter); temp = *(int *)iter->next(iter);
// tree->print_obj(&temp); tree->print_obj(&temp);
// } }
// printf("\n"); printf("\n");
TEST_ASSERT_TRUE(tree->clear(tree)); TEST_ASSERT_TRUE(tree->clear(tree));
tree_free(&tree); tree_free(&tree);