Hashing concept on A and B key

headers/Containers/DualkeyMap.hpp

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

headers/Containers/Hashing.hpp

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