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

Hashing concept on A and B key

Browse Source
This commit is contained in:
Dora
2026-01-21 09:50:18 +02:00
parent 7405e91874
commit 2556a473cc
2 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
headers/Containers/DualkeyMap.hpp
View File

@@ -8,16 +8,17 @@
*/ */
#ifndef GUARD_TOURMALINE_DUALKEYMAP_H #ifndef GUARD_TOURMALINE_DUALKEYMAP_H
#define GUARD_TOURMALINE_DUALKEYMAP_H #define GUARD_TOURMALINE_DUALKEYMAP_H
#include "Hashing.hpp"
#include <cstddef> #include <cstddef>
#include <cstdint> #include <cstdint>
#include <vector> #include <vector>
namespace Tourmaline::Containers { namespace Tourmaline::Containers {
template <typename AKey, typename BKey, typename Value, template <Hashable AKey, Hashable BKey, typename Value,
uint64_t baseReservation = 1024, uint64_t baseReservation = 1024,
float reservationGrowthExponent = 1.5> float reservationGrowthExponent = 1.5>
class DualkeyMap { class DualkeyMap {
constexpr static uint64_t EmptyKey = -1;
DualkeyMap() { DualkeyMap() {
ValueList.reserve(baseReservation); ValueList.reserve(baseReservation);
HashList.reserve(baseReservation); HashList.reserve(baseReservation);

2
headers/Containers/Hashing.hpp
View File

@@ -14,7 +14,7 @@
namespace Tourmaline::Containers { namespace Tourmaline::Containers {
template <typename T> template <typename T>
concept hashable = requires(T x) { concept Hashable = requires(T x) {
{ std::hash<T>{x}() } -> std::convertible_to<std::size_t>; { std::hash<T>{x}() } -> std::convertible_to<std::size_t>;
}; };
} // namespace Tourmaline::Containers } // namespace Tourmaline::Containers