|
@@ -30,50 +30,29 @@
|
|
|
|
|
|
#pragma once
|
|
#pragma once
|
|
|
|
|
|
-#include "core/templates/hashfuncs.h"
|
|
|
|
#include "core/typedefs.h"
|
|
#include "core/typedefs.h"
|
|
|
|
+
|
|
template <typename F, typename S>
|
|
template <typename F, typename S>
|
|
struct Pair {
|
|
struct Pair {
|
|
- F first;
|
|
|
|
- S second;
|
|
|
|
|
|
+ F first{};
|
|
|
|
+ S second{};
|
|
|
|
|
|
- Pair() :
|
|
|
|
- first(),
|
|
|
|
- second() {
|
|
|
|
- }
|
|
|
|
|
|
+ constexpr Pair() = default;
|
|
|
|
+ constexpr Pair(const F &p_first, const S &p_second) :
|
|
|
|
+ first(p_first), second(p_second) {}
|
|
|
|
|
|
- Pair(F p_first, const S &p_second) :
|
|
|
|
- first(p_first),
|
|
|
|
- second(p_second) {
|
|
|
|
- }
|
|
|
|
|
|
+ constexpr bool operator==(const Pair &p_other) const { return first == p_other.first && second == p_other.second; }
|
|
|
|
+ constexpr bool operator!=(const Pair &p_other) const { return first != p_other.first || second != p_other.second; }
|
|
|
|
+ constexpr bool operator<(const Pair &p_other) const { return first == p_other.first ? (second < p_other.second) : (first < p_other.first); }
|
|
|
|
+ constexpr bool operator<=(const Pair &p_other) const { return first == p_other.first ? (second <= p_other.second) : (first < p_other.first); }
|
|
|
|
+ constexpr bool operator>(const Pair &p_other) const { return first == p_other.first ? (second > p_other.second) : (first > p_other.first); }
|
|
|
|
+ constexpr bool operator>=(const Pair &p_other) const { return first == p_other.first ? (second >= p_other.second) : (first > p_other.first); }
|
|
};
|
|
};
|
|
|
|
|
|
-template <typename F, typename S>
|
|
|
|
-bool operator==(const Pair<F, S> &pair, const Pair<F, S> &other) {
|
|
|
|
- return (pair.first == other.first) && (pair.second == other.second);
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-template <typename F, typename S>
|
|
|
|
-bool operator!=(const Pair<F, S> &pair, const Pair<F, S> &other) {
|
|
|
|
- return (pair.first != other.first) || (pair.second != other.second);
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
template <typename F, typename S>
|
|
template <typename F, typename S>
|
|
struct PairSort {
|
|
struct PairSort {
|
|
- bool operator()(const Pair<F, S> &A, const Pair<F, S> &B) const {
|
|
|
|
- if (A.first != B.first) {
|
|
|
|
- return A.first < B.first;
|
|
|
|
- }
|
|
|
|
- return A.second < B.second;
|
|
|
|
- }
|
|
|
|
-};
|
|
|
|
-
|
|
|
|
-template <typename F, typename S>
|
|
|
|
-struct PairHash {
|
|
|
|
- static uint32_t hash(const Pair<F, S> &P) {
|
|
|
|
- uint64_t h1 = HashMapHasherDefault::hash(P.first);
|
|
|
|
- uint64_t h2 = HashMapHasherDefault::hash(P.second);
|
|
|
|
- return hash_one_uint64((h1 << 32) | h2);
|
|
|
|
|
|
+ constexpr bool operator()(const Pair<F, S> &p_lhs, const Pair<F, S> &p_rhs) const {
|
|
|
|
+ return p_lhs < p_rhs;
|
|
}
|
|
}
|
|
};
|
|
};
|
|
|
|
|
|
@@ -83,34 +62,31 @@ struct is_zero_constructible<Pair<F, S>> : std::conjunction<is_zero_constructibl
|
|
|
|
|
|
template <typename K, typename V>
|
|
template <typename K, typename V>
|
|
struct KeyValue {
|
|
struct KeyValue {
|
|
- const K key;
|
|
|
|
- V value;
|
|
|
|
|
|
+ const K key{};
|
|
|
|
+ V value{};
|
|
|
|
|
|
- void operator=(const KeyValue &p_kv) = delete;
|
|
|
|
- _FORCE_INLINE_ KeyValue(const KeyValue &p_kv) :
|
|
|
|
- key(p_kv.key),
|
|
|
|
- value(p_kv.value) {
|
|
|
|
- }
|
|
|
|
- _FORCE_INLINE_ KeyValue(const K &p_key, const V &p_value) :
|
|
|
|
- key(p_key),
|
|
|
|
- value(p_value) {
|
|
|
|
- }
|
|
|
|
-};
|
|
|
|
|
|
+ KeyValue &operator=(const KeyValue &p_kv) = delete;
|
|
|
|
+ KeyValue &operator=(KeyValue &&p_kv) = delete;
|
|
|
|
|
|
-template <typename K, typename V>
|
|
|
|
-bool operator==(const KeyValue<K, V> &pair, const KeyValue<K, V> &other) {
|
|
|
|
- return (pair.key == other.key) && (pair.value == other.value);
|
|
|
|
-}
|
|
|
|
|
|
+ constexpr KeyValue(const KeyValue &p_kv) = default;
|
|
|
|
+ constexpr KeyValue(KeyValue &&p_kv) = default;
|
|
|
|
+ constexpr KeyValue(const K &p_key, const V &p_value) :
|
|
|
|
+ key(p_key), value(p_value) {}
|
|
|
|
+ constexpr KeyValue(const Pair<K, V> &p_pair) :
|
|
|
|
+ key(p_pair.first), value(p_pair.second) {}
|
|
|
|
|
|
-template <typename K, typename V>
|
|
|
|
-bool operator!=(const KeyValue<K, V> &pair, const KeyValue<K, V> &other) {
|
|
|
|
- return (pair.key != other.key) || (pair.value != other.value);
|
|
|
|
-}
|
|
|
|
|
|
+ constexpr bool operator==(const KeyValue &p_other) const { return key == p_other.key && value == p_other.value; }
|
|
|
|
+ constexpr bool operator!=(const KeyValue &p_other) const { return key != p_other.key || value != p_other.value; }
|
|
|
|
+ constexpr bool operator<(const KeyValue &p_other) const { return key == p_other.key ? (value < p_other.value) : (key < p_other.key); }
|
|
|
|
+ constexpr bool operator<=(const KeyValue &p_other) const { return key == p_other.key ? (value <= p_other.value) : (key < p_other.key); }
|
|
|
|
+ constexpr bool operator>(const KeyValue &p_other) const { return key == p_other.key ? (value > p_other.value) : (key > p_other.key); }
|
|
|
|
+ constexpr bool operator>=(const KeyValue &p_other) const { return key == p_other.key ? (value >= p_other.value) : (key > p_other.key); }
|
|
|
|
+};
|
|
|
|
|
|
template <typename K, typename V>
|
|
template <typename K, typename V>
|
|
struct KeyValueSort {
|
|
struct KeyValueSort {
|
|
- bool operator()(const KeyValue<K, V> &A, const KeyValue<K, V> &B) const {
|
|
|
|
- return A.key < B.key;
|
|
|
|
|
|
+ constexpr bool operator()(const KeyValue<K, V> &p_lhs, const KeyValue<K, V> &p_rhs) const {
|
|
|
|
+ return p_lhs.key < p_rhs.key;
|
|
}
|
|
}
|
|
};
|
|
};
|
|
|
|
|