diff options
author | David Oberhollenzer <david.oberhollenzer@sigma-star.at> | 2021-10-16 21:50:40 +0200 |
---|---|---|
committer | David Oberhollenzer <david.oberhollenzer@sigma-star.at> | 2022-03-30 22:31:30 +0200 |
commit | e5fa9d585ed090602bcc045689046702199def86 (patch) | |
tree | 2b391a68d67972686db86f5d44a90a416695c058 /tests/libfstree/mknode_dir.c | |
parent | 5e54880a2db2aeb7a6c301a69ee2bef9a09a237f (diff) |
Cleanup: remove node sorting from libfstree
Always insert the tree nodes in the correct oder and remove the
post-process sorting step.
Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at>
Diffstat (limited to 'tests/libfstree/mknode_dir.c')
-rw-r--r-- | tests/libfstree/mknode_dir.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/tests/libfstree/mknode_dir.c b/tests/libfstree/mknode_dir.c index 900edaa..63e01c1 100644 --- a/tests/libfstree/mknode_dir.c +++ b/tests/libfstree/mknode_dir.c @@ -48,10 +48,10 @@ int main(int argc, char **argv) TEST_ASSERT(a->parent == root); TEST_ASSERT(b->parent == root); TEST_EQUAL_UI(b->link_count, 2); - TEST_ASSERT(root->data.dir.children == b); + TEST_ASSERT(root->data.dir.children == a); + TEST_ASSERT(a->next == b); TEST_EQUAL_UI(root->link_count, 4); - TEST_ASSERT(b->next == a); - TEST_NULL(a->next); + TEST_NULL(b->next); TEST_NULL(root->parent); TEST_NULL(root->next); |