|
| | robin_set () |
| |
| | robin_set (size_type bucket_count, const Hash &hash=Hash(), const KeyEqual &equal=KeyEqual(), const Allocator &alloc=Allocator()) |
| |
| | robin_set (size_type bucket_count, const Allocator &alloc) |
| |
| | robin_set (size_type bucket_count, const Hash &hash, const Allocator &alloc) |
| |
| | robin_set (const Allocator &alloc) |
| |
| template<class InputIt > |
| | robin_set (InputIt first, InputIt last, size_type bucket_count=ht::DEFAULT_INIT_BUCKETS_SIZE, const Hash &hash=Hash(), const KeyEqual &equal=KeyEqual(), const Allocator &alloc=Allocator()) |
| |
| template<class InputIt > |
| | robin_set (InputIt first, InputIt last, size_type bucket_count, const Allocator &alloc) |
| |
| template<class InputIt > |
| | robin_set (InputIt first, InputIt last, size_type bucket_count, const Hash &hash, const Allocator &alloc) |
| |
| | robin_set (std::initializer_list< value_type > init, size_type bucket_count=ht::DEFAULT_INIT_BUCKETS_SIZE, const Hash &hash=Hash(), const KeyEqual &equal=KeyEqual(), const Allocator &alloc=Allocator()) |
| |
| | robin_set (std::initializer_list< value_type > init, size_type bucket_count, const Allocator &alloc) |
| |
| | robin_set (std::initializer_list< value_type > init, size_type bucket_count, const Hash &hash, const Allocator &alloc) |
| |
| robin_set & | operator= (std::initializer_list< value_type > ilist) |
| |
| allocator_type | get_allocator () const |
| |
| iterator | begin () noexcept |
| |
| const_iterator | begin () const noexcept |
| |
| const_iterator | cbegin () const noexcept |
| |
| iterator | end () noexcept |
| |
| const_iterator | end () const noexcept |
| |
| const_iterator | cend () const noexcept |
| |
| bool | empty () const noexcept |
| |
| size_type | size () const noexcept |
| |
| size_type | max_size () const noexcept |
| |
| void | clear () noexcept |
| |
| std::pair< iterator, bool > | insert (const value_type &value) |
| |
| std::pair< iterator, bool > | insert (value_type &&value) |
| |
| iterator | insert (const_iterator hint, const value_type &value) |
| |
| iterator | insert (const_iterator hint, value_type &&value) |
| |
| template<class InputIt > |
| void | insert (InputIt first, InputIt last) |
| |
| void | insert (std::initializer_list< value_type > ilist) |
| |
| template<class... Args> |
| std::pair< iterator, bool > | emplace (Args &&...args) |
| |
| template<class... Args> |
| iterator | emplace_hint (const_iterator hint, Args &&...args) |
| |
| iterator | erase (iterator pos) |
| |
| iterator | erase (const_iterator pos) |
| |
| iterator | erase (const_iterator first, const_iterator last) |
| |
| size_type | erase (const key_type &key) |
| |
| size_type | erase (const key_type &key, std::size_t precalculated_hash) |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| size_type | erase (const K &key) |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| size_type | erase (const K &key, std::size_t precalculated_hash) |
| |
| void | swap (robin_set &other) |
| |
| size_type | count (const Key &key) const |
| |
| size_type | count (const Key &key, std::size_t precalculated_hash) const |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| size_type | count (const K &key) const |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| size_type | count (const K &key, std::size_t precalculated_hash) const |
| |
| iterator | find (const Key &key) |
| |
| iterator | find (const Key &key, std::size_t precalculated_hash) |
| |
| const_iterator | find (const Key &key) const |
| |
| const_iterator | find (const Key &key, std::size_t precalculated_hash) const |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| iterator | find (const K &key) |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| iterator | find (const K &key, std::size_t precalculated_hash) |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| const_iterator | find (const K &key) const |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| const_iterator | find (const K &key, std::size_t precalculated_hash) const |
| |
| bool | contains (const Key &key) const |
| |
| bool | contains (const Key &key, std::size_t precalculated_hash) const |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| bool | contains (const K &key) const |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| bool | contains (const K &key, std::size_t precalculated_hash) const |
| |
| std::pair< iterator, iterator > | equal_range (const Key &key) |
| |
| std::pair< iterator, iterator > | equal_range (const Key &key, std::size_t precalculated_hash) |
| |
| std::pair< const_iterator, const_iterator > | equal_range (const Key &key) const |
| |
| std::pair< const_iterator, const_iterator > | equal_range (const Key &key, std::size_t precalculated_hash) const |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| std::pair< iterator, iterator > | equal_range (const K &key) |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| std::pair< iterator, iterator > | equal_range (const K &key, std::size_t precalculated_hash) |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| std::pair< const_iterator, const_iterator > | equal_range (const K &key) const |
| |
| template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr> |
| std::pair< const_iterator, const_iterator > | equal_range (const K &key, std::size_t precalculated_hash) const |
| |
| size_type | bucket_count () const |
| |
| size_type | max_bucket_count () const |
| |
| float | load_factor () const |
| |
| float | min_load_factor () const |
| |
| float | max_load_factor () const |
| |
| void | min_load_factor (float ml) |
| |
| void | max_load_factor (float ml) |
| |
| void | rehash (size_type my_count) |
| |
| void | reserve (size_type my_count) |
| |
| hasher | hash_function () const |
| |
| key_equal | key_eq () const |
| |
| iterator | mutable_iterator (const_iterator pos) |
| |
| template<class Serializer > |
| void | serialize (Serializer &serializer) const |
| |
template<class Key, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = tsl::rh::power_of_two_growth_policy<2>>
class tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >
Implementation of a hash set using open-addressing and the robin hood hashing algorithm with backward shift deletion.
For operations modifying the hash set (insert, erase, rehash, ...), the strong exception guarantee is only guaranteed when the expression std::is_nothrow_swappable<Key>\:\:value && std::is_nothrow_move_constructible<Key>\:\:value is true, otherwise if an exception is thrown during the swap or the move, the hash set may end up in a undefined state. Per the standard a Key with a noexcept copy constructor and no move constructor also satisfies the std::is_nothrow_move_constructible<Key>\:\:value criterion (and will thus guarantee the strong exception for the set).
When StoreHash is true, 32 bits of the hash are stored alongside the values. It can improve the performance during lookups if the KeyEqual function takes time (or engenders a cache-miss for example) as we then compare the stored hashes before comparing the keys. When tsl::rh::power_of_two_growth_policy is used as GrowthPolicy, it may also speed-up the rehash process as we can avoid to recalculate the hash. When it is detected that storing the hash will not incur any memory penalty due to alignment (i.e. sizeof(tsl::detail_robin_hash::bucket_entry<ValueType, true>) == sizeof(tsl::detail_robin_hash::bucket_entry<ValueType, false>)) and tsl::rh::power_of_two_growth_policy is used, the hash will be stored even if StoreHash is false so that we can speed-up the rehash (but it will not be used on lookups unless StoreHash is true).
GrowthPolicy defines how the set grows and consequently how a hash value is mapped to a bucket. By default the set uses tsl::rh::power_of_two_growth_policy. This policy keeps the number of buckets to a power of two and uses a mask to set the hash to a bucket instead of the slow modulo. Other growth policies are available and you may define your own growth policy, check tsl::rh::power_of_two_growth_policy for the interface.
Key must be swappable.
Key must be copy and/or move constructible.
If the destructor of Key throws an exception, the behaviour of the class is undefined.
Iterators invalidation:
- clear, operator=, reserve, rehash: always invalidate the iterators.
- insert, emplace, emplace_hint, operator[]: if there is an effective insert, invalidate the iterators.
- erase: always invalidate the iterators.
template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = tsl::rh::power_of_two_growth_policy<2>>
template<class Deserializer >
| static robin_set tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::deserialize |
( |
Deserializer & | deserializer, |
|
|
bool | hash_compatible = false ) |
|
inlinestatic |
Deserialize a previously serialized set through the deserializer parameter.
The deserializer parameter must be a function object that supports the following call:
template<typename U> U operator()(); where the types std::int16_t, std::uint32_t, std::uint64_t, float and Key must be supported for U.
If the deserialized hash set type is hash compatible with the serialized set, the deserialization process can be sped up by setting hash_compatible to true. To be hash compatible, the Hash, KeyEqual and GrowthPolicy must behave the same way than the ones used on the serialized set and the StoreHash must have the same value. The std::size_t must also be of the same size as the one on the platform used to serialize the set. If these criteria are not met, the behaviour is undefined with hash_compatible sets to true.
The behaviour is undefined if the type Key of the robin_set is not the same as the type used during serialization.
The implementation leaves binary compatibility (endianness, IEEE 754 for floats, size of int, ...) of the types it deserializes in the hands of the Deserializer function object if compatibility is required.
1.10.0