f1087e81ec
git-subtree-dir: third_party/unordered_dense git-subtree-split: 231e48c9426bd21c273669e5fdcd042c146975cf
82 lines
2.5 KiB
C++
82 lines
2.5 KiB
C++
#include <ankerl/unordered_dense.h>
|
|
|
|
#include <app/doctest.h>
|
|
|
|
#include <cstddef> // for size_t
|
|
#include <string> // for string, operator==, allocator
|
|
#include <string_view> // for basic_string_view, operator""sv
|
|
#include <utility> // for pair
|
|
#include <vector> // for vector
|
|
|
|
using namespace std::literals;
|
|
|
|
template <class Map, class First, class Second>
|
|
auto has(Map const& map, First const& first, Second const& second) -> bool {
|
|
auto it = map.find(first);
|
|
return it != map.end() && it->second == second;
|
|
}
|
|
|
|
TEST_CASE_MAP("insert_initializer_list", int, int) {
|
|
auto m = map_t();
|
|
m.insert({{1, 2}, {3, 4}, {5, 6}});
|
|
REQUIRE(m.size() == 3U);
|
|
REQUIRE(m[1] == 2);
|
|
REQUIRE(m[3] == 4);
|
|
REQUIRE(m[5] == 6);
|
|
}
|
|
|
|
TEST_CASE_MAP("initializerlist_string", std::string, size_t) {
|
|
size_t const n1 = 17;
|
|
size_t const n2 = 10;
|
|
|
|
auto m1 = map_t{{"duck", n1}, {"lion", n2}};
|
|
auto m2 = map_t{{"duck", n1}, {"lion", n2}};
|
|
|
|
REQUIRE(m1.size() == 2);
|
|
REQUIRE(m1["duck"] == n1);
|
|
REQUIRE(m1["lion"] == n2);
|
|
|
|
REQUIRE(m2.size() == 2);
|
|
auto it = m2.find("duck");
|
|
REQUIRE((it != m2.end() && it->second == n1));
|
|
REQUIRE(m2["lion"] == n2);
|
|
}
|
|
|
|
TEST_CASE_MAP("insert_initializer_list_string", int, std::string) {
|
|
auto m = map_t();
|
|
m.insert({{1, "a"}, {3, "b"}, {5, "c"}});
|
|
REQUIRE(m.size() == 3U);
|
|
REQUIRE(m[1] == "a");
|
|
REQUIRE(m[3] == "b");
|
|
REQUIRE(m[5] == "c");
|
|
}
|
|
|
|
TEST_CASE_MAP("initializer_list_assign", int, char const*) {
|
|
auto map = map_t();
|
|
map[3] = "nope";
|
|
map = {{1, "a"}, {2, "hello"}, {12346, "world!"}};
|
|
REQUIRE(map.size() == 3);
|
|
REQUIRE(has(map, 1, "a"sv));
|
|
REQUIRE(has(map, 2, "hello"sv));
|
|
REQUIRE(has(map, 12346, "world!"sv));
|
|
}
|
|
|
|
TEST_CASE_MAP("initializer_list_ctor_alloc", int, char const*) {
|
|
using alloc_t = std::allocator<std::pair<int, char const*>>;
|
|
auto map = map_t({{1, "a"}, {2, "hello"}, {12346, "world!"}}, 0, alloc_t{});
|
|
REQUIRE(map.size() == 3);
|
|
REQUIRE(has(map, 1, "a"sv));
|
|
REQUIRE(has(map, 2, "hello"sv));
|
|
REQUIRE(has(map, 12346, "world!"sv));
|
|
}
|
|
|
|
TEST_CASE_MAP("initializer_list_ctor_hash_alloc", int, char const*) {
|
|
using hash_t = ankerl::unordered_dense::hash<int>;
|
|
using alloc_t = std::allocator<std::pair<int, char const*>>;
|
|
auto map = map_t({{1, "a"}, {2, "hello"}, {12346, "world!"}}, 0, hash_t{}, alloc_t{});
|
|
REQUIRE(map.size() == 3);
|
|
REQUIRE(has(map, 1, "a"sv));
|
|
REQUIRE(has(map, 2, "hello"sv));
|
|
REQUIRE(has(map, 12346, "world!"sv));
|
|
}
|