f1087e81ec
git-subtree-dir: third_party/unordered_dense git-subtree-split: 231e48c9426bd21c273669e5fdcd042c146975cf
55 lines
1.3 KiB
C++
55 lines
1.3 KiB
C++
#include <ankerl/unordered_dense.h>
|
|
|
|
#include <app/counter.h>
|
|
#include <app/doctest.h>
|
|
|
|
#include <cstddef> // for size_t
|
|
#include <cstdint> // for uint64_t
|
|
#include <utility> // for pair
|
|
|
|
TEST_CASE_SET("erase_if_set", counter::obj) {
|
|
auto counts = counter();
|
|
INFO(counts);
|
|
auto set = set_t();
|
|
|
|
for (size_t i = 0; i < 1000; ++i) {
|
|
set.emplace(i, counts);
|
|
}
|
|
REQUIRE(set.size() == 1000);
|
|
auto num_erased = std::erase_if(set, [](counter::obj const& obj) {
|
|
return 0 == obj.get() % 3;
|
|
});
|
|
REQUIRE(num_erased == 334);
|
|
|
|
REQUIRE(set.size() == 666);
|
|
for (size_t i = 0; i < 1000; ++i) {
|
|
if (0 == i % 3) {
|
|
REQUIRE(!set.contains({i, counts}));
|
|
} else {
|
|
REQUIRE(set.contains({i, counts}));
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST_CASE_MAP("erase_if_map", uint64_t, uint64_t) {
|
|
auto map = map_t();
|
|
for (size_t i = 0; i < 1000; ++i) {
|
|
map.try_emplace(i, i);
|
|
}
|
|
|
|
REQUIRE(map.size() == 1000);
|
|
auto num_erased = std::erase_if(map, [](std::pair<uint64_t, uint64_t> const& x) {
|
|
return 0 == x.second % 2;
|
|
});
|
|
|
|
REQUIRE(num_erased == 500);
|
|
REQUIRE(map.size() == 500);
|
|
for (size_t i = 0; i < 1000; ++i) {
|
|
if (0 == i % 2) {
|
|
REQUIRE(!map.contains(i));
|
|
} else {
|
|
REQUIRE(map.contains(i));
|
|
}
|
|
}
|
|
}
|