A cache-friendly hash set with open addressing, linear probing and power-of-two capacity.
More...
#include <HashContainers.hpp>
|
using | size_type = size_t |
|
using | value_type = KeyT |
|
using | reference = KeyT & |
|
using | const_reference = const KeyT & |
|
template<typename KeyT, typename HashT = std::hash<KeyT>, typename CompT = HashSetEqualTo<KeyT>>
class emlib::HashSet< KeyT, HashT, CompT >
A cache-friendly hash set with open addressing, linear probing and power-of-two capacity.
template<typename KeyT , typename HashT = std::hash<KeyT>, typename CompT = HashSetEqualTo<KeyT>>
Erase an element from the hash set. return false if element was not found.
template<typename KeyT , typename HashT = std::hash<KeyT>, typename CompT = HashSetEqualTo<KeyT>>
Erase an element using an iterator. Returns an iterator to the next element (or end()).
template<typename KeyT , typename HashT = std::hash<KeyT>, typename CompT = HashSetEqualTo<KeyT>>
Insert an element, unless it already exists. Returns a pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.
template<typename KeyT , typename HashT = std::hash<KeyT>, typename CompT = HashSetEqualTo<KeyT>>
Insert an element, unless it already exists. Returns a pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.
The documentation for this class was generated from the following file: