tudocomp
– The TU Dortmund Compression Framework
|
#include <Hash.hpp>
Classes | |
class | Iterator |
Public Types | |
typedef Key | key_t |
typedef Value | value_t |
typedef std::pair< key_t, value_t > | store_t |
Public Member Functions | |
IF_STATS (size_t m_collisions=0;size_t m_old_size=0;size_t m_resizes=0;size_t m_specialresizes=0;) public | |
float | max_load_factor () const noexcept |
HashMap (Env &, const size_t n, const size_t &remaining_characters) | |
template<class T > | |
void | incorporate (T &&o, len_t newsize) |
~HashMap () | |
HashMap (HashMap &&other)=default | |
HashMap & | operator= (HashMap &&other)=default |
void | reserve (len_t hint) |
len_t | entries () const |
len_t | table_size () const |
len_t | empty () const |
std::pair< Iterator, bool > | insert (std::pair< key_t, value_t > &&value) |
Static Public Member Functions | |
static Meta | meta () |
Public Attributes | |
EqualKey | m_eq |
HashFcn | m_h |
ProbeFcn | m_probe |
SizeManager | m_sizeman |
size_t | m_size |
key_t * | m_keys |
value_t * | m_values |
len_t | m_entries = 0 |
float | m_load_factor = 0.3f |
const size_t | m_n |
const size_t & | m_remaining_characters |
MoveGuard | m_guard |
Static Public Attributes | |
static constexpr value_t | empty_val = undef_id |
static constexpr len_t | initial_size = 4 |
typedef Key tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::key_t |
typedef std::pair<key_t,value_t> tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::store_t |
typedef Value tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::value_t |
|
inline |
|
inline |
|
inlinedefault |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inlinenoexcept |
|
inlinestatic |
|
inlinedefault |
|
inline |
|
inline |
|
static |
|
static |
len_t tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::m_entries = 0 |
EqualKey tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::m_eq |
MoveGuard tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::m_guard |
HashFcn tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::m_h |
key_t* tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::m_keys |
float tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::m_load_factor = 0.3f |
const size_t tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::m_n |
ProbeFcn tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::m_probe |
const size_t& tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::m_remaining_characters |
size_t tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::m_size |
SizeManager tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::m_sizeman |
value_t* tdc::HashMap< Key, Value, undef_id, HashFcn, EqualKey, ProbeFcn, SizeManager >::m_values |