78bb1d1571
0172df743 CMakeLists: Only add tests if MASTER_PROJECT 52e8dff62 0.1.11 fc8d745cc container: hmap fixups 5b5c0130d memory: Add overaligned_unique_ptr c7c9bbd17 mcl: Increment version to 0.1.10 678aa32a8 assert: Handle expr strings separately b38a9d2ef tests: Update to Catch 3.0.1 8aeacfe32 mcl: Increment version to 0.1.9 b468a2ab5 mcl: meta_byte: Split off meta_byte_group d3ae1ae47 mcl: ihmap: Implement inline variant of hmap 5cbfe6eed mcl: hmap: Split detail into headers ee7467677 mcl: hmap: Better default hash f1d902ce9 mcl: hash: Add xmrx 322a221f0 mcl: hmap: Bugfix skip_empty_or_tombstone 689f393f7 mcl: hmap: x64 implementation fa6ff746a mcl: hmap: Add generic meta_byte_group implementation 91e3073ad mcl: hmap: Add more member functions 4998335a5 mcl: Install only if master project 7ff4d2549 mcl: hmap prototype 416a2c6b5 mcl: clang-format: Adopt WebKit style bracing d5a46fa70 mcl/assert: Flush stderr e3b6cc79e externals: Update mcl to 0.1.7 190c68475 mcl: Build as PIC git-subtree-dir: externals/mcl git-subtree-split: 0172df74316351868c215f735e5a2538b10d71fb
66 lines
1.5 KiB
C++
66 lines
1.5 KiB
C++
// This file is part of the mcl project.
|
|
// Copyright (c) 2022 merryhime
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
#include <unordered_map>
|
|
|
|
#include <catch2/catch_test_macros.hpp>
|
|
#include <fmt/core.h>
|
|
#include <mcl/container/hmap.hpp>
|
|
#include <mcl/stdint.hpp>
|
|
|
|
TEST_CASE("mcl::hmap", "[hmap]")
|
|
{
|
|
mcl::hmap<u64, u64> double_map;
|
|
|
|
constexpr int count = 100000;
|
|
|
|
REQUIRE(double_map.empty());
|
|
|
|
for (int i = 0; i < count; ++i) {
|
|
double_map[i] = i * 2;
|
|
REQUIRE(double_map.size() == i + 1);
|
|
}
|
|
|
|
for (int i = 0; i < count; ++i) {
|
|
REQUIRE(double_map[i] == i * 2);
|
|
REQUIRE(double_map.contains(i));
|
|
}
|
|
|
|
for (int i = 0; i < count; ++i) {
|
|
auto iter = double_map.find(i);
|
|
REQUIRE(iter->first == i);
|
|
REQUIRE(iter->second == i * 2);
|
|
}
|
|
|
|
for (int i = count; i < count * 2; ++i) {
|
|
REQUIRE(!double_map.contains(i));
|
|
}
|
|
|
|
for (int i = 0; i < count; ++i) {
|
|
auto result = double_map.try_emplace(i, 0);
|
|
REQUIRE(!result.second);
|
|
}
|
|
|
|
for (auto [k, v] : double_map) {
|
|
REQUIRE(k * 2 == v);
|
|
}
|
|
|
|
std::unordered_map<u64, size_t> indexes_count;
|
|
for (auto [k, v] : double_map) {
|
|
(void)v;
|
|
indexes_count[k]++;
|
|
}
|
|
for (auto [k, v] : indexes_count) {
|
|
(void)k;
|
|
REQUIRE(v == 1);
|
|
}
|
|
|
|
REQUIRE(!double_map.empty());
|
|
double_map.clear();
|
|
REQUIRE(double_map.empty());
|
|
|
|
for (auto [k, v] : double_map) {
|
|
REQUIRE(false);
|
|
}
|
|
}
|