54 lines
1.5 KiB
C++
54 lines
1.5 KiB
C++
|
#include <ankerl/unordered_dense.h> // for map
|
||
|
|
#include <third-party/nanobench.h> // for Rng, doNotOptimizeAway, Bench
|
||
|
|
|
||
|
|
#include <doctest.h> // for TestCase, skip, TEST_CASE, test_...
|
||
|
|
#include <fmt/core.h> // for format
|
||
|
|
|
||
|
|
#include <cstddef> // for size_t
|
||
|
|
#include <cstdint> // for uint64_t
|
||
|
|
#include <string_view> // for string_view
|
||
|
|
#include <unordered_map> // for unordered_map, swap
|
||
|
|
#include <utility> // for swap
|
||
|
|
|
||
|
|
namespace {
|
||
|
|
|
||
|
|
template <typename Map>
|
||
|
|
void bench(std::string_view name) {
|
||
|
|
Map a;
|
||
|
|
Map b;
|
||
|
|
ankerl::nanobench::Rng rng(123);
|
||
|
|
|
||
|
|
ankerl::nanobench::Bench bench;
|
||
|
|
for (size_t j = 0; j < 10000; ++j) {
|
||
|
|
a[rng()];
|
||
|
|
b[rng()];
|
||
|
|
}
|
||
|
|
bench.run(fmt::format("swap {}", name), [&] {
|
||
|
|
std::swap(a, b);
|
||
|
|
});
|
||
|
|
ankerl::nanobench::doNotOptimizeAway(&a);
|
||
|
|
ankerl::nanobench::doNotOptimizeAway(&b);
|
||
|
|
}
|
||
|
|
|
||
|
|
} // namespace
|
||
|
|
|
||
|
|
#if 0
|
||
|
|
|
||
|
|
TEST_CASE("bench_swap_rhn" * doctest::test_suite("bench") * doctest::skip()) {
|
||
|
|
bench<robin_hood::unordered_node_map<uint64_t, uint64_t>>("robin_hood::unordered_node_map");
|
||
|
|
}
|
||
|
|
|
||
|
|
TEST_CASE("bench_swap_rhf" * doctest::test_suite("bench") * doctest::skip()) {
|
||
|
|
bench<robin_hood::unordered_flat_map<uint64_t, uint64_t>>("robin_hood::unordered_flat_map");
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif
|
||
|
|
|
||
|
|
TEST_CASE("bench_swap_std" * doctest::test_suite("bench") * doctest::skip()) {
|
||
|
|
bench<std::unordered_map<uint64_t, uint64_t>>("std::unordered_map");
|
||
|
|
}
|
||
|
|
|
||
|
|
TEST_CASE("bench_swap_udm" * doctest::test_suite("bench") * doctest::skip()) {
|
||
|
|
bench<ankerl::unordered_dense::map<uint64_t, uint64_t>>("ankerl::unordered_dense::map");
|
||
|
|
}
|