fennec-org/fennec
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

- Fixed some semantics issues to make data structure names more akin to their mathematical equivalents

Browse Source 
- multiset.h TODO: test
 - Fixed some double underscores that I missed
This commit is contained in:
Medusa Slockbower
2025-08-14 02:57:46 -04:00
parent cc4d85c393
commit f173c3e7cd
32 changed files with 899 additions and 146 deletions
Download Patch File Download Diff File Expand all files Collapse all files

56
test/tests/containers/test_rdtree.h
View File

@@ -30,8 +30,13 @@ namespace test
{
inline void fennec_test_containers_rdtree() {
using tree_t = rdtree<size_t>;
rdtree<size_t> test;
tree_t test;
constexpr size_t npos = rdtree<size_t>::npos;
constexpr size_t pre_order [] = { 1, 2, 4, 5, 3, 6 };
constexpr size_t in_order [] = { 4, 2, 5, 1, 3, 6 };
constexpr size_t post_order[] = { 4, 5, 2, 6, 3, 1 };
const size_t n = 50;
for (size_t i = 0; i < n; ++i) {
@@ -41,15 +46,56 @@ inline void fennec_test_containers_rdtree() {
const size_t next = test.child(parent);
size_t l;
assertf((l = test.insert(parent, i)) == i + 1, "Tree Construct Test Failed.");
assertf(test.parent(l) == parent, "Tree Construct Test Failed.");
assertf(test.child(l) == child, "Tree Construct Test Failed.");
assertf(test.prev(l) == prev, "Tree Construct Test Failed.");
assertf(test.next(l) == next, "Tree Construct Test Failed.");
assertf(test.parent(l) == parent, "Tree Construct Test Failed.");
assertf(test.child(l) == child, "Tree Construct Test Failed.");
assertf(test.prev(l) == prev, "Tree Construct Test Failed.");
assertf(test.next(l) == next, "Tree Construct Test Failed.");
assertf(next == rdtree<size_t>::npos || test.prev(next) == l, "Tree Construct Test Failed");
}
test.erase(0);
size_t n1 = test.insert(npos, 1);
size_t n3 = test.insert(n1, 3);
size_t n2 = test.insert(n1, 2);
size_t n5 = test.insert(n2, 5);
size_t n4 = test.insert(n2, 4);
size_t n6 = test.insert(n3, 6);
fennec_test_run(n1 != npos, true);
fennec_test_run(n2 != npos, true);
fennec_test_run(n3 != npos, true);
fennec_test_run(n4 != npos, true);
fennec_test_run(n5 != npos, true);
fennec_test_run(n6 != npos, true);
fennec_test_spacer(1);
size_t i;
i = 0;
test.traverse<tree_t::pre_order>([&](size_t x) -> uint8_t {
fennec_test_run(x, pre_order[i++]);
return traversal_control_continue;
});
fennec_test_spacer(1);
i = 0;
test.traverse<tree_t::in_order>([&](size_t x) -> uint8_t {
fennec_test_run(x, in_order[i++]);
return traversal_control_continue;
});
fennec_test_spacer(1);
i = 0;
test.traverse<tree_t::post_order>([&](size_t x) -> uint8_t {
fennec_test_run(x, post_order[i++]);
return traversal_control_continue;
});
test.erase(0);
fennec_test_run(test.empty(), true);
}