/*************************************************************************/ /* test_hash_map.h */ /*************************************************************************/ /* This file is part of: */ /* GODOT ENGINE */ /* https://godotengine.org */ /*************************************************************************/ /* Copyright (c) 2007-2022 Juan Linietsky, Ariel Manzur. */ /* Copyright (c) 2014-2022 Godot Engine contributors (cf. AUTHORS.md). */ /* */ /* 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_HASH_MAP_H #define TEST_HASH_MAP_H #include "core/templates/hash_map.h" #include "tests/test_macros.h" namespace TestHashMap { TEST_CASE("[HashMap] Insert element") { HashMap map; HashMap::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("[HashMap] Overwrite element") { HashMap map; map.insert(42, 84); map.insert(42, 1234); CHECK(map[42] == 1234); } TEST_CASE("[HashMap] Erase via element") { HashMap map; HashMap::Iterator e = map.insert(42, 84); map.remove(e); CHECK(!map.has(42)); CHECK(!map.find(42)); } TEST_CASE("[HashMap] Erase via key") { HashMap map; map.insert(42, 84); map.erase(42); CHECK(!map.has(42)); CHECK(!map.find(42)); } TEST_CASE("[HashMap] Size") { HashMap 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("[HashMap] Iteration") { HashMap map; map.insert(42, 84); map.insert(123, 12385); map.insert(0, 12934); map.insert(123485, 1238888); map.insert(123, 111111); Vector> expected; expected.push_back(Pair(42, 84)); expected.push_back(Pair(123, 111111)); expected.push_back(Pair(0, 12934)); expected.push_back(Pair(123485, 1238888)); int idx = 0; for (const KeyValue &E : map) { CHECK(expected[idx] == Pair(E.key, E.value)); ++idx; } } TEST_CASE("[HashMap] Const iteration") { HashMap map; map.insert(42, 84); map.insert(123, 12385); map.insert(0, 12934); map.insert(123485, 1238888); map.insert(123, 111111); const HashMap const_map = map; Vector> expected; expected.push_back(Pair(42, 84)); expected.push_back(Pair(123, 111111)); expected.push_back(Pair(0, 12934)); expected.push_back(Pair(123485, 1238888)); expected.push_back(Pair(123, 111111)); int idx = 0; for (const KeyValue &E : const_map) { CHECK(expected[idx] == Pair(E.key, E.value)); ++idx; } } } // namespace TestHashMap #endif // TEST_HASH_MAP_H