mirror of
https://github.com/godotengine/godot.git
synced 2025-12-08 06:09:55 +00:00
Implement array based hash map
This commit is contained in:
nazarii
Nazarii
parent
1015a481ff
commit
76208f7155
13 changed files with 1202 additions and 51 deletions
295
tests/core/templates/test_a_hash_map.h
Normal file
295
tests/core/templates/test_a_hash_map.h
Normal file
|
|
@ -0,0 +1,295 @@
|
|||
/**************************************************************************/
|
||||
/* test_a_hash_map.h */
|
||||
/**************************************************************************/
|
||||
/* This file is part of: */
|
||||
/* GODOT ENGINE */
|
||||
/* https://godotengine.org */
|
||||
/**************************************************************************/
|
||||
/* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
|
||||
/* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
|
||||
/* */
|
||||
/* Permission is hereby granted, free of charge, to any person obtaining */
|
||||
/* a copy of this software and associated documentation files (the */
|
||||
/* "Software"), to deal in the Software without restriction, including */
|
||||
/* without limitation the rights to use, copy, modify, merge, publish, */
|
||||
/* distribute, sublicense, and/or sell copies of the Software, and to */
|
||||
/* permit persons to whom the Software is furnished to do so, subject to */
|
||||
/* the following conditions: */
|
||||
/* */
|
||||
/* The above copyright notice and this permission notice shall be */
|
||||
/* included in all copies or substantial portions of the Software. */
|
||||
/* */
|
||||
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
|
||||
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
|
||||
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
|
||||
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
|
||||
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
|
||||
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
|
||||
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
|
||||
/**************************************************************************/
|
||||
|
||||
#ifndef TEST_A_HASH_MAP_H
|
||||
#define TEST_A_HASH_MAP_H
|
||||
|
||||
#include "core/templates/a_hash_map.h"
|
||||
|
||||
#include "tests/test_macros.h"
|
||||
|
||||
namespace TestAHashMap {
|
||||
|
||||
TEST_CASE("[AHashMap] Insert element") {
|
||||
AHashMap<int, int> map;
|
||||
AHashMap<int, int>::Iterator e = map.insert(42, 84);
|
||||
|
||||
CHECK(e);
|
||||
CHECK(e->key == 42);
|
||||
CHECK(e->value == 84);
|
||||
CHECK(map[42] == 84);
|
||||
CHECK(map.has(42));
|
||||
CHECK(map.find(42));
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Overwrite element") {
|
||||
AHashMap<int, int> map;
|
||||
map.insert(42, 84);
|
||||
map.insert(42, 1234);
|
||||
|
||||
CHECK(map[42] == 1234);
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Erase via element") {
|
||||
AHashMap<int, int> map;
|
||||
AHashMap<int, int>::Iterator e = map.insert(42, 84);
|
||||
map.remove(e);
|
||||
CHECK(!map.has(42));
|
||||
CHECK(!map.find(42));
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Erase via key") {
|
||||
AHashMap<int, int> map;
|
||||
map.insert(42, 84);
|
||||
map.erase(42);
|
||||
CHECK(!map.has(42));
|
||||
CHECK(!map.find(42));
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Size") {
|
||||
AHashMap<int, int> map;
|
||||
map.insert(42, 84);
|
||||
map.insert(123, 84);
|
||||
map.insert(123, 84);
|
||||
map.insert(0, 84);
|
||||
map.insert(123485, 84);
|
||||
|
||||
CHECK(map.size() == 4);
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Iteration") {
|
||||
AHashMap<int, int> map;
|
||||
|
||||
map.insert(42, 84);
|
||||
map.insert(123, 12385);
|
||||
map.insert(0, 12934);
|
||||
map.insert(123485, 1238888);
|
||||
map.insert(123, 111111);
|
||||
|
||||
Vector<Pair<int, int>> expected;
|
||||
expected.push_back(Pair<int, int>(42, 84));
|
||||
expected.push_back(Pair<int, int>(123, 111111));
|
||||
expected.push_back(Pair<int, int>(0, 12934));
|
||||
expected.push_back(Pair<int, int>(123485, 1238888));
|
||||
|
||||
int idx = 0;
|
||||
for (const KeyValue<int, int> &E : map) {
|
||||
CHECK(expected[idx] == Pair<int, int>(E.key, E.value));
|
||||
idx++;
|
||||
}
|
||||
|
||||
idx--;
|
||||
for (AHashMap<int, int>::Iterator it = map.last(); it; --it) {
|
||||
CHECK(expected[idx] == Pair<int, int>(it->key, it->value));
|
||||
idx--;
|
||||
}
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Const iteration") {
|
||||
AHashMap<int, int> map;
|
||||
map.insert(42, 84);
|
||||
map.insert(123, 12385);
|
||||
map.insert(0, 12934);
|
||||
map.insert(123485, 1238888);
|
||||
map.insert(123, 111111);
|
||||
|
||||
const AHashMap<int, int> const_map = map;
|
||||
|
||||
Vector<Pair<int, int>> expected;
|
||||
expected.push_back(Pair<int, int>(42, 84));
|
||||
expected.push_back(Pair<int, int>(123, 111111));
|
||||
expected.push_back(Pair<int, int>(0, 12934));
|
||||
expected.push_back(Pair<int, int>(123485, 1238888));
|
||||
expected.push_back(Pair<int, int>(123, 111111));
|
||||
|
||||
int idx = 0;
|
||||
for (const KeyValue<int, int> &E : const_map) {
|
||||
CHECK(expected[idx] == Pair<int, int>(E.key, E.value));
|
||||
idx++;
|
||||
}
|
||||
|
||||
idx--;
|
||||
for (AHashMap<int, int>::ConstIterator it = const_map.last(); it; --it) {
|
||||
CHECK(expected[idx] == Pair<int, int>(it->key, it->value));
|
||||
idx--;
|
||||
}
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Replace key") {
|
||||
AHashMap<int, int> map;
|
||||
map.insert(42, 84);
|
||||
map.insert(0, 12934);
|
||||
CHECK(map.replace_key(0, 1));
|
||||
CHECK(map.has(1));
|
||||
CHECK(map[1] == 12934);
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Clear") {
|
||||
AHashMap<int, int> map;
|
||||
map.insert(42, 84);
|
||||
map.insert(123, 12385);
|
||||
map.insert(0, 12934);
|
||||
|
||||
map.clear();
|
||||
CHECK(!map.has(42));
|
||||
CHECK(map.size() == 0);
|
||||
CHECK(map.is_empty());
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Get") {
|
||||
AHashMap<int, int> map;
|
||||
map.insert(42, 84);
|
||||
map.insert(123, 12385);
|
||||
map.insert(0, 12934);
|
||||
|
||||
CHECK(map.get(123) == 12385);
|
||||
map.get(123) = 10;
|
||||
CHECK(map.get(123) == 10);
|
||||
|
||||
CHECK(*map.getptr(0) == 12934);
|
||||
*map.getptr(0) = 1;
|
||||
CHECK(*map.getptr(0) == 1);
|
||||
|
||||
CHECK(map.get(42) == 84);
|
||||
CHECK(map.getptr(-10) == nullptr);
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Insert, iterate and remove many elements") {
|
||||
const int elem_max = 1234;
|
||||
AHashMap<int, int> map;
|
||||
for (int i = 0; i < elem_max; i++) {
|
||||
map.insert(i, i);
|
||||
}
|
||||
|
||||
//insert order should have been kept
|
||||
int idx = 0;
|
||||
for (auto &K : map) {
|
||||
CHECK(idx == K.key);
|
||||
CHECK(idx == K.value);
|
||||
CHECK(map.has(idx));
|
||||
idx++;
|
||||
}
|
||||
|
||||
Vector<int> elems_still_valid;
|
||||
|
||||
for (int i = 0; i < elem_max; i++) {
|
||||
if ((i % 5) == 0) {
|
||||
map.erase(i);
|
||||
} else {
|
||||
elems_still_valid.push_back(i);
|
||||
}
|
||||
}
|
||||
|
||||
CHECK(elems_still_valid.size() == map.size());
|
||||
|
||||
for (int i = 0; i < elems_still_valid.size(); i++) {
|
||||
CHECK(map.has(elems_still_valid[i]));
|
||||
}
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Insert, iterate and remove many strings") {
|
||||
const int elem_max = 432;
|
||||
AHashMap<String, String> map;
|
||||
for (int i = 0; i < elem_max; i++) {
|
||||
map.insert(itos(i), itos(i));
|
||||
}
|
||||
|
||||
//insert order should have been kept
|
||||
int idx = 0;
|
||||
for (auto &K : map) {
|
||||
CHECK(itos(idx) == K.key);
|
||||
CHECK(itos(idx) == K.value);
|
||||
CHECK(map.has(itos(idx)));
|
||||
idx++;
|
||||
}
|
||||
|
||||
Vector<String> elems_still_valid;
|
||||
|
||||
for (int i = 0; i < elem_max; i++) {
|
||||
if ((i % 5) == 0) {
|
||||
map.erase(itos(i));
|
||||
} else {
|
||||
elems_still_valid.push_back(itos(i));
|
||||
}
|
||||
}
|
||||
|
||||
CHECK(elems_still_valid.size() == map.size());
|
||||
|
||||
for (int i = 0; i < elems_still_valid.size(); i++) {
|
||||
CHECK(map.has(elems_still_valid[i]));
|
||||
}
|
||||
|
||||
elems_still_valid.clear();
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Copy constructor") {
|
||||
AHashMap<int, int> map0;
|
||||
const uint32_t count = 5;
|
||||
for (uint32_t i = 0; i < count; i++) {
|
||||
map0.insert(i, i);
|
||||
}
|
||||
AHashMap<int, int> map1(map0);
|
||||
CHECK(map0.size() == map1.size());
|
||||
CHECK(map0.get_capacity() == map1.get_capacity());
|
||||
CHECK(*map0.getptr(0) == *map1.getptr(0));
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Operator =") {
|
||||
AHashMap<int, int> map0;
|
||||
AHashMap<int, int> map1;
|
||||
const uint32_t count = 5;
|
||||
map1.insert(1234, 1234);
|
||||
for (uint32_t i = 0; i < count; i++) {
|
||||
map0.insert(i, i);
|
||||
}
|
||||
map1 = map0;
|
||||
CHECK(map0.size() == map1.size());
|
||||
CHECK(map0.get_capacity() == map1.get_capacity());
|
||||
CHECK(*map0.getptr(0) == *map1.getptr(0));
|
||||
}
|
||||
|
||||
TEST_CASE("[AHashMap] Array methods") {
|
||||
AHashMap<int, int> map;
|
||||
for (int i = 0; i < 100; i++) {
|
||||
map.insert(100 - i, i);
|
||||
}
|
||||
for (int i = 0; i < 100; i++) {
|
||||
CHECK(map.get_by_index(i).value == i);
|
||||
}
|
||||
int index = map.get_index(1);
|
||||
CHECK(map.get_by_index(index).value == 99);
|
||||
CHECK(map.erase_by_index(index));
|
||||
CHECK(!map.erase_by_index(index));
|
||||
CHECK(map.get_index(1) == -1);
|
||||
}
|
||||
|
||||
} // namespace TestAHashMap
|
||||
|
||||
#endif // TEST_A_HASH_MAP_H
|
||||
Loading…
Add table
Add a link
Reference in a new issue