mirror of
https://github.com/XRPLF/rippled.git
synced 2026-06-02 08:17:13 +00:00
87f4a482c1
Apply readability-identifier-naming clang-tidy check to branch-modified files (and their transitive includes) in preparation for merging develop. Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
101 lines
3.0 KiB
C++
101 lines
3.0 KiB
C++
#pragma once
|
|
|
|
#include <xrpl/basics/hardened_hash.h>
|
|
#include <xrpl/basics/partitioned_unordered_map.h>
|
|
#include <xrpl/beast/hash/hash_append.h>
|
|
#include <xrpl/beast/hash/uhash.h>
|
|
#include <xrpl/beast/hash/xxhasher.h>
|
|
|
|
#include <unordered_map>
|
|
#include <unordered_set>
|
|
|
|
/**
|
|
* Use hash_* containers for keys that do not need a cryptographically secure
|
|
* hashing algorithm.
|
|
*
|
|
* Use hardened_hash_* containers for keys that do need a secure hashing
|
|
* algorithm.
|
|
*
|
|
* The cryptographic security of containers where a hash function is used as a
|
|
* template parameter depends entirely on that hash function and not at all on
|
|
* what container it is.
|
|
*/
|
|
|
|
namespace xrpl {
|
|
|
|
// hash containers
|
|
|
|
template <
|
|
class Key,
|
|
class Value,
|
|
class Hash = beast::Uhash<>,
|
|
class Pred = std::equal_to<Key>,
|
|
class Allocator = std::allocator<std::pair<Key const, Value>>>
|
|
using hash_map = std::unordered_map<Key, Value, Hash, Pred, Allocator>;
|
|
|
|
template <
|
|
class Key,
|
|
class Value,
|
|
class Hash = beast::Uhash<>,
|
|
class Pred = std::equal_to<Key>,
|
|
class Allocator = std::allocator<std::pair<Key const, Value>>>
|
|
using hash_multimap = std::unordered_multimap<Key, Value, Hash, Pred, Allocator>;
|
|
|
|
template <
|
|
class Value,
|
|
class Hash = beast::Uhash<>,
|
|
class Pred = std::equal_to<Value>,
|
|
class Allocator = std::allocator<Value>>
|
|
using hash_set = std::unordered_set<Value, Hash, Pred, Allocator>;
|
|
|
|
template <
|
|
class Value,
|
|
class Hash = beast::Uhash<>,
|
|
class Pred = std::equal_to<Value>,
|
|
class Allocator = std::allocator<Value>>
|
|
using hash_multiset = std::unordered_multiset<Value, Hash, Pred, Allocator>;
|
|
|
|
// hardened_hash containers
|
|
|
|
using strong_hash = beast::Xxhasher;
|
|
|
|
template <
|
|
class Key,
|
|
class Value,
|
|
class Hash = HardenedHash<strong_hash>,
|
|
class Pred = std::equal_to<Key>,
|
|
class Allocator = std::allocator<std::pair<Key const, Value>>>
|
|
using hardened_hash_map = std::unordered_map<Key, Value, Hash, Pred, Allocator>;
|
|
|
|
template <
|
|
class Key,
|
|
class Value,
|
|
class Hash = HardenedHash<strong_hash>,
|
|
class Pred = std::equal_to<Key>,
|
|
class Allocator = std::allocator<std::pair<Key const, Value>>>
|
|
using hardened_partitioned_hash_map = PartitionedUnorderedMap<Key, Value, Hash, Pred, Allocator>;
|
|
|
|
template <
|
|
class Key,
|
|
class Value,
|
|
class Hash = HardenedHash<strong_hash>,
|
|
class Pred = std::equal_to<Key>,
|
|
class Allocator = std::allocator<std::pair<Key const, Value>>>
|
|
using hardened_hash_multimap = std::unordered_multimap<Key, Value, Hash, Pred, Allocator>;
|
|
|
|
template <
|
|
class Value,
|
|
class Hash = HardenedHash<strong_hash>,
|
|
class Pred = std::equal_to<Value>,
|
|
class Allocator = std::allocator<Value>>
|
|
using hardened_hash_set = std::unordered_set<Value, Hash, Pred, Allocator>;
|
|
|
|
template <
|
|
class Value,
|
|
class Hash = HardenedHash<strong_hash>,
|
|
class Pred = std::equal_to<Value>,
|
|
class Allocator = std::allocator<Value>>
|
|
using hardened_hash_multiset = std::unordered_multiset<Value, Hash, Pred, Allocator>;
|
|
|
|
} // namespace xrpl
|