cat/Tourmaline-Engine
1
1
Fork 0
Code Issues 4 Pull Requests Actions Packages Projects 1 Releases Wiki Activity

Added count(), camelCase'd all the functions, and made the keys const

Browse Source
This commit is contained in:
Dora
2026-01-28 12:31:30 +02:00
parent 8887547fdc
commit ea83805f4b
1 changed files with 15 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
headers/Containers/DualkeyMap.hpp
View File

@@ -27,8 +27,8 @@ template <Hashable AKey, Hashable BKey, typename Value,
class DualkeyMap { class DualkeyMap {
public: public:
using ResultPair = using ResultPair =
std::pair<std::variant<std::monostate, std::reference_wrapper<AKey>, std::pair<std::variant<std::monostate, std::reference_wrapper<const AKey>,
std::reference_wrapper<BKey>>, std::reference_wrapper<const BKey>>,
Value &>; Value &>;
DualkeyMap() { hashList.reserve(baseReservation); } DualkeyMap() { hashList.reserve(baseReservation); }
@@ -41,7 +41,7 @@ public:
} }
} }
void Insert(AKey firstKey, BKey secondKey, Value value) { void insert(AKey firstKey, BKey secondKey, Value value) {
std::size_t firstKeyHash = std::hash<AKey>{}(firstKey); std::size_t firstKeyHash = std::hash<AKey>{}(firstKey);
std::size_t secondKeyHash = std::hash<BKey>{}(secondKey); std::size_t secondKeyHash = std::hash<BKey>{}(secondKey);
DualkeyHash *hash = DualkeyHash *hash =
@@ -57,7 +57,7 @@ public:
} }
} }
std::size_t Delete(std::optional<AKey> firstKey, std::size_t remove(std::optional<AKey> firstKey,
std::optional<BKey> secondKey) { std::optional<BKey> secondKey) {
bool isFirstKeyGiven = firstKey.has_value(); bool isFirstKeyGiven = firstKey.has_value();
bool isSecondKeyGiven = secondKey.has_value(); bool isSecondKeyGiven = secondKey.has_value();
@@ -121,7 +121,7 @@ public:
} }
[[nodiscard("Discarding an expensive operation's result!")]] [[nodiscard("Discarding an expensive operation's result!")]]
std::vector<ResultPair> Query(std::optional<AKey> firstKey, std::vector<ResultPair> query(std::optional<AKey> firstKey,
std::optional<BKey> secondKey) { std::optional<BKey> secondKey) {
bool isFirstKeyGiven = firstKey.has_value(); bool isFirstKeyGiven = firstKey.has_value();
bool isSecondKeyGiven = secondKey.has_value(); bool isSecondKeyGiven = secondKey.has_value();
@@ -151,15 +151,13 @@ public:
case 1: // Only first key is given case 1: // Only first key is given
if (firstKeyHash == hash->firstKeyHash && if (firstKeyHash == hash->firstKeyHash &&
firstKey.value() == hash->firstKey) { firstKey.value() == hash->firstKey) {
finishedQuery.emplace_back( finishedQuery.emplace_back(std::cref(hash->secondKey), hash->value);
std::reference_wrapper<BKey>{hash->secondKey}, hash->value);
} }
continue; continue;
case 2: // Only second key is given case 2: // Only second key is given
if (secondKeyHash == hash->secondKeyHash && if (secondKeyHash == hash->secondKeyHash &&
secondKey.value() == hash->secondKey) { secondKey.value() == hash->secondKey) {
finishedQuery.emplace_back( finishedQuery.emplace_back(std::cref(hash->firstKey), hash->value);
std::reference_wrapper<AKey>{hash->firstKey}, hash->value);
} }
continue; continue;
case 3: // Both are given case 3: // Both are given
@@ -178,6 +176,11 @@ public:
return finishedQuery; return finishedQuery;
} }
[[nodiscard]]
std::size_t count() {
return hashList.size() - graveyard.size();
}
// No copying, No moving. Moving may be valid in the future. // No copying, No moving. Moving may be valid in the future.
// However as of now it is not a wise way to use this map. // However as of now it is not a wise way to use this map.
DualkeyMap(const DualkeyMap &) = delete; DualkeyMap(const DualkeyMap &) = delete;
@@ -195,9 +198,9 @@ private:
std::size_t firstKeyHash = 0; std::size_t firstKeyHash = 0;
std::size_t secondKeyHash = 0; std::size_t secondKeyHash = 0;
AKey firstKey; const AKey firstKey;
BKey secondKey; const BKey secondKey;
Value value; mutable Value value;
}; };
// It makes more sense to store the individual hash // It makes more sense to store the individual hash