f1087e81ec
git-subtree-dir: third_party/unordered_dense git-subtree-split: 231e48c9426bd21c273669e5fdcd042c146975cf
24 lines
587 B
C++
24 lines
587 B
C++
#include <ankerl/unordered_dense.h>
|
|
|
|
#include <app/doctest.h>
|
|
|
|
#include <algorithm> // for max
|
|
#include <utility> // for pair
|
|
#include <vector> // for vector
|
|
|
|
TEST_CASE_MAP("iterators_insert", int, int) {
|
|
auto v = std::vector<std::pair<int, int>>();
|
|
v.reserve(1000);
|
|
for (int i = 0; i < 1000; ++i) {
|
|
v.emplace_back(i, i);
|
|
}
|
|
|
|
auto map = map_t(v.begin(), v.end());
|
|
REQUIRE(map.size() == v.size());
|
|
for (auto const& kv : v) {
|
|
REQUIRE(map.count(kv.first) == 1);
|
|
auto it = map.find(kv.first);
|
|
REQUIRE(it != map.end());
|
|
}
|
|
}
|