Inherits Hash, KeyEqual, and GrowthPolicy.
|
template<class OC = OverflowContainer, typename std::enable_if<!has_key_compare< OC >::value >::type * = nullptr> |
| hopscotch_hash (size_type bucket_count, const Hash &hash, const KeyEqual &equal, const Allocator &alloc, float max_load_factor) |
|
template<class OC = OverflowContainer, typename std::enable_if< has_key_compare< OC >::value >::type * = nullptr> |
| hopscotch_hash (size_type bucket_count, const Hash &hash, const KeyEqual &equal, const Allocator &alloc, float max_load_factor, const typename OC::key_compare &comp) |
|
| hopscotch_hash (const hopscotch_hash &other) |
|
| hopscotch_hash (hopscotch_hash &&other) noexcept(std::is_nothrow_move_constructible< Hash >::value &&std::is_nothrow_move_constructible< KeyEqual >::value &&std::is_nothrow_move_constructible< GrowthPolicy >::value &&std::is_nothrow_move_constructible< buckets_container_type >::value &&std::is_nothrow_move_constructible< overflow_container_type >::value) |
|
hopscotch_hash & | operator= (const hopscotch_hash &other) |
|
hopscotch_hash & | operator= (hopscotch_hash &&other) |
|
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) |
|
template<class P , typename std::enable_if< std::is_constructible< value_type, P &&>::value >::type * = nullptr> |
std::pair< iterator, bool > | insert (P &&value) |
|
std::pair< iterator, bool > | insert (value_type &&value) |
|
iterator | insert (const_iterator hint, const value_type &value) |
|
template<class P , typename std::enable_if< std::is_constructible< value_type, P &&>::value >::type * = nullptr> |
iterator | insert (const_iterator hint, P &&value) |
|
iterator | insert (const_iterator hint, value_type &&value) |
|
template<class InputIt > |
void | insert (InputIt first, InputIt last) |
|
template<class M > |
std::pair< iterator, bool > | insert_or_assign (const key_type &k, M &&obj) |
|
template<class M > |
std::pair< iterator, bool > | insert_or_assign (key_type &&k, M &&obj) |
|
template<class M > |
iterator | insert_or_assign (const_iterator hint, const key_type &k, M &&obj) |
|
template<class M > |
iterator | insert_or_assign (const_iterator hint, key_type &&k, M &&obj) |
|
template<class... Args> |
std::pair< iterator, bool > | emplace (Args &&... args) |
|
template<class... Args> |
iterator | emplace_hint (const_iterator hint, Args &&... args) |
|
template<class... Args> |
std::pair< iterator, bool > | try_emplace (const key_type &k, Args &&... args) |
|
template<class... Args> |
std::pair< iterator, bool > | try_emplace (key_type &&k, Args &&... args) |
|
template<class... Args> |
iterator | try_emplace (const_iterator hint, const key_type &k, Args &&... args) |
|
template<class... Args> |
iterator | try_emplace (const_iterator hint, key_type &&k, Args &&... args) |
|
iterator | erase (iterator pos) |
|
iterator | erase (const_iterator pos) |
|
iterator | erase (const_iterator first, const_iterator last) |
|
template<class K > |
size_type | erase (const K &key) |
|
template<class K > |
size_type | erase (const K &key, std::size_t hash) |
|
void | swap (hopscotch_hash &other) |
|
template<class K , class U = ValueSelect, typename std::enable_if< has_mapped_type< U >::value >::type * = nullptr> |
U::value_type & | at (const K &key) |
|
template<class K , class U = ValueSelect, typename std::enable_if< has_mapped_type< U >::value >::type * = nullptr> |
U::value_type & | at (const K &key, std::size_t hash) |
|
template<class K , class U = ValueSelect, typename std::enable_if< has_mapped_type< U >::value >::type * = nullptr> |
const U::value_type & | at (const K &key) const |
|
template<class K , class U = ValueSelect, typename std::enable_if< has_mapped_type< U >::value >::type * = nullptr> |
const U::value_type & | at (const K &key, std::size_t hash) const |
|
template<class K , class U = ValueSelect, typename std::enable_if< has_mapped_type< U >::value >::type * = nullptr> |
U::value_type & | operator[] (K &&key) |
|
template<class K > |
size_type | count (const K &key) const |
|
template<class K > |
size_type | count (const K &key, std::size_t hash) const |
|
template<class K > |
iterator | find (const K &key) |
|
template<class K > |
iterator | find (const K &key, std::size_t hash) |
|
template<class K > |
const_iterator | find (const K &key) const |
|
template<class K > |
const_iterator | find (const K &key, std::size_t hash) const |
|
template<class K > |
std::pair< iterator, iterator > | equal_range (const K &key) |
|
template<class K > |
std::pair< iterator, iterator > | equal_range (const K &key, std::size_t hash) |
|
template<class K > |
std::pair< const_iterator, const_iterator > | equal_range (const K &key) const |
|
template<class K > |
std::pair< const_iterator, const_iterator > | equal_range (const K &key, std::size_t hash) const |
|
size_type | bucket_count () const |
|
size_type | max_bucket_count () const |
|
float | load_factor () const |
|
float | max_load_factor () const |
|
void | max_load_factor (float ml) |
|
void | rehash (size_type count_) |
|
void | reserve (size_type count_) |
|
hasher | hash_function () const |
|
key_equal | key_eq () const |
|
iterator | mutable_iterator (const_iterator pos) |
|
size_type | overflow_size () const noexcept |
|
template<class U = OverflowContainer, typename std::enable_if< has_key_compare< U >::value >::type * = nullptr> |
U::key_compare | key_comp () const |
|
template<class ValueType, class KeySelect, class ValueSelect, class Hash, class KeyEqual, class Allocator, unsigned int NeighborhoodSize, bool StoreHash, class GrowthPolicy, class OverflowContainer>
class tsl::detail_hopscotch_hash::hopscotch_hash< ValueType, KeySelect, ValueSelect, Hash, KeyEqual, Allocator, NeighborhoodSize, StoreHash, GrowthPolicy, OverflowContainer >
Internal common class used by (b)hopscotch_map and (b)hopscotch_set.
ValueType is what will be stored by hopscotch_hash (usually std::pair<Key, T> for a map and Key for a set).
KeySelect should be a FunctionObject which takes a ValueType in parameter and returns a reference to the key.
ValueSelect should be a FunctionObject which takes a ValueType in parameter and returns a reference to the value. ValueSelect should be void if there is no value (in a set for example).
OverflowContainer will be used as containers for overflown elements. Usually it should be a list<ValueType> or a set<Key>/map<Key, T>.