Files
fennec/test/tests/containers/test_rdtree.h
Medusa Slockbower 2cb41e1437 - Documented and Debugged containers
- Attempted to setup gdb prettywriters
2025-08-07 19:03:34 -04:00

61 lines
2.0 KiB
C++

// =====================================================================================================================
// fennec, a free and open source game engine
// Copyright © 2025 Medusa Slockbower
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>.
// =====================================================================================================================
#ifndef FENNEC_TEST_CONTAINERS_RDTREE_H
#define FENNEC_TEST_CONTAINERS_RDTREE_H
#include "../../test.h"
#include <fennec/containers/rdtree.h>
namespace fennec
{
namespace test
{
inline void fennec_test_containers_rdtree() {
rdtree<size_t> test;
const size_t n = 10000;
for (size_t i = 0; i < n; ++i) {
const size_t parent = rand() % (i + 1);
const size_t child = rdtree<size_t>::npos;
const size_t prev = rdtree<size_t>::npos;
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(next == rdtree<size_t>::npos || test.prev(next) == l, "Tree Construct Test Failed");
}
test.erase(0);
fennec_test_run(test.empty(), true);
}
}
}
#endif // FENNEC_TEST_CONTAINERS_RDTREE_H