25#ifndef QB_UNORDERED_SET_H
26#define QB_UNORDERED_SET_H
28#include <ska_hash/unordered_map.hpp>
29#include <unordered_set>
45template <
typename K,
typename H = std::hash<K>,
typename E = std::equal_to<K>,
46 typename A = std::allocator<K>>
62template <
typename K,
typename H = std::hash<K>,
typename E = std::equal_to<K>,
63 typename A = std::allocator<K>>
79template <
typename K,
typename H = std::hash<K>,
typename E = std::equal_to<K>,
80 typename A = std::allocator<K>>
std::unordered_set< K, H, E, A > unordered_set
The primary unordered set implementation.
Definition unordered_set.h:81
ska::flat_hash_set< K, H, E, A > unordered_flat_set
A high-performance flat hash set implementation.
Definition unordered_set.h:47