Medusa Slockbower
9f96155856
- Adjusted RDTreePrinter to print more "tree-like" - Added SetPrinter and MapPrinter - Fixed Issues with CStringPrinter and StringPrinter
50 lines
1.5 KiB
C++
50 lines
1.5 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_DYNARRAY_H
|
|
#define FENNEC_TEST_CONTAINERS_DYNARRAY_H
|
|
|
|
#include "../../test.h"
|
|
|
|
#include <fennec/containers/dynarray.h>
|
|
|
|
namespace fennec::test
|
|
{
|
|
|
|
inline void fennec_test_containers_dynarray() {
|
|
|
|
dynarray<int> test1;
|
|
dynarray<int> test2;
|
|
|
|
int n = 50;
|
|
for (int i = 0; i < n; ++i) {
|
|
test1.push_back(i);
|
|
test2.push_back(n - i - 1);
|
|
}
|
|
|
|
for (int i = 0; i < n; ++i) {
|
|
assertf(test1[i] == test2[n - i - 1], "Failed dynarray::push_back");
|
|
}
|
|
|
|
std::cout << "passed" << std::endl;
|
|
}
|
|
|
|
}
|
|
|
|
#endif // FENNEC_TEST_CONTAINERS_DYNARRAY_H
|