|
| htrie_hash (const Hash &hash, float max_load_factor, size_type burst_threshold) |
|
| htrie_hash (const htrie_hash &other) |
|
| htrie_hash (htrie_hash &&other) noexcept(std::is_nothrow_move_constructible< Hash >::value) |
|
htrie_hash & | operator= (const htrie_hash &other) |
|
htrie_hash & | operator= (htrie_hash &&other) |
|
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 |
|
size_type | max_key_size () const noexcept |
|
void | shrink_to_fit () |
|
void | clear () noexcept |
|
template<class... ValueArgs> |
std::pair< iterator, bool > | insert (const CharT *key, size_type key_size, ValueArgs &&... value_args) |
|
iterator | erase (const_iterator pos) |
|
iterator | erase (const_iterator first, const_iterator last) |
|
size_type | erase (const CharT *key, size_type key_size) |
|
size_type | erase_prefix (const CharT *prefix, size_type prefix_size) |
|
void | swap (htrie_hash &other) |
|
template<class U = T, typename std::enable_if< has_value< U >::value >::type * = nullptr> |
U & | at (const CharT *key, size_type key_size) |
|
template<class U = T, typename std::enable_if< has_value< U >::value >::type * = nullptr> |
const U & | at (const CharT *key, size_type key_size) const |
|
template<class U = T, typename std::enable_if< has_value< U >::value >::type * = nullptr> |
U & | access_operator (const CharT *key, size_type key_size) |
|
size_type | count (const CharT *key, size_type key_size) const |
|
iterator | find (const CharT *key, size_type key_size) |
|
const_iterator | find (const CharT *key, size_type key_size) const |
|
std::pair< iterator, iterator > | equal_range (const CharT *key, size_type key_size) |
|
std::pair< const_iterator, const_iterator > | equal_range (const CharT *key, size_type key_size) const |
|
std::pair< prefix_iterator, prefix_iterator > | equal_prefix_range (const CharT *prefix, size_type prefix_size) |
|
std::pair< const_prefix_iterator, const_prefix_iterator > | equal_prefix_range (const CharT *prefix, size_type prefix_size) const |
|
iterator | longest_prefix (const CharT *key, size_type key_size) |
|
const_iterator | longest_prefix (const CharT *key, size_type key_size) const |
|
float | max_load_factor () const |
|
void | max_load_factor (float ml) |
|
size_type | burst_threshold () const |
|
void | burst_threshold (size_type threshold) |
|
hasher | hash_function () const |
|
template<class Serializer > |
void | serialize (Serializer &serializer) const |
|
template<class Deserializer > |
void | deserialize (Deserializer &deserializer, bool hash_compatible) |
|
template<class CharT, class T, class Hash, class KeySizeT>
class tsl::detail_htrie_hash::htrie_hash< CharT, T, Hash, KeySizeT >
T should be void if there is no value associated to a key (in a set for example).