mirror of
https://gitee.com/apaki/unicstl.git
synced 2025-05-17 19:41:36 +08:00
太棒了!tree的新版迭代器调试通过了。后续可以删除那么多没用的成员函数了
This commit is contained in:
parent
5ab918b067
commit
34875ce3fa
@ -1966,6 +1966,7 @@ iterator_t tree_iter(struct _tree* self, enum _order order)
|
||||
case ORDER_RIGHT_BREADTH:
|
||||
{
|
||||
// pass
|
||||
self->queue->push(self->queue, &self->_root);
|
||||
}break;
|
||||
default:
|
||||
{
|
||||
|
@ -952,13 +952,13 @@ static void test_avltree_iter_2(void)
|
||||
}
|
||||
printf("\n");
|
||||
|
||||
// iter = tree->iter(tree, ORDER_LEFT_BREADTH);
|
||||
// while(iter->hasnext(iter))
|
||||
// {
|
||||
// temp = *(int *)iter->next(iter);
|
||||
// tree->print_obj(&temp);
|
||||
// }
|
||||
// printf("\n");
|
||||
iter = tree->iter(tree, ORDER_LEFT_BREADTH);
|
||||
while(iter->hasnext(iter))
|
||||
{
|
||||
temp = *(int *)iter->next(iter);
|
||||
tree->print_obj(&temp);
|
||||
}
|
||||
printf("\n");
|
||||
|
||||
iter = tree->iter(tree, ORDER_RIGHT_PRE);
|
||||
while(iter->hasnext(iter))
|
||||
@ -984,13 +984,13 @@ static void test_avltree_iter_2(void)
|
||||
}
|
||||
printf("\n");
|
||||
|
||||
// iter = tree->iter(tree, ORDER_RIGHT_BREADTH);
|
||||
// while(iter->hasnext(iter))
|
||||
// {
|
||||
// temp = *(int *)iter->next(iter);
|
||||
// tree->print_obj(&temp);
|
||||
// }
|
||||
// printf("\n");
|
||||
iter = tree->iter(tree, ORDER_RIGHT_BREADTH);
|
||||
while(iter->hasnext(iter))
|
||||
{
|
||||
temp = *(int *)iter->next(iter);
|
||||
tree->print_obj(&temp);
|
||||
}
|
||||
printf("\n");
|
||||
|
||||
TEST_ASSERT_TRUE(tree->clear(tree));
|
||||
tree_free(&tree);
|
||||
|
Loading…
Reference in New Issue
Block a user