Tipos públicos | |
typedef DynMapHashTable< Key, Data, Cmp, LhashTable > | Base |
typedef HashTable< Key, Cmp > | Base |
![]() | |
typedef LhashTable< Key, Cmp > | Base |
typedef Data | Value_Type |
typedef size_t(* | Hash_Fct )(const Key &) |
![]() | |
typedef Base::Hash_Fct | Hash_Fct |
El tipo de función hash. | |
typedef std::pair< Key, Data > | Key_Type |
typedef std::pair< Key, Data > | Item_Type |
![]() | |
typedef GenLhashTable < std::pair< Key, Data > , LhashBucket< std::pair< Key, Data > >, Cmp > | Base |
![]() | |
typedef LhashBucket< std::pair < Key, Data > > | Bucket |
typedef size_t(* | Hash_Fct )(const std::pair< Key, Data > &) |
typedef std::pair< Key, Data > | Key_Type |
typedef std::pair< Key, Data > | Item_Type |
Otros miembros heredados | |
![]() | |
Data & | get_data (const Key &key) |
const Key & | get_key (Data *data_ptr) |
DynMapHashTable (typename Base::Hash_Fct hash_fct=wrapper< Aleph::dft_hash_fct< Key >>, const size_t len=Primes::DefaultPrime, const float lower_alpha=hash_default_lower_alpha, const float upper_alpha=hash_default_upper_alpha) | |
Key * | insert (const Key &key, const Data &data) |
Key * | insert (const Key &key, Data &&data) |
Key * | insert (Key &&key, Data &&data) |
Key * | insert (Key &&key, const Data &data) |
Data * | search (const Key &key) const |
bool | has (const Key &key) |
Data & | find (const Key &key) |
void | remove_by_data (Data &data) |
void | remove (const Key &key) |
Map_Sequences_Methods () | |
Generate_Proxy_Operator (DynMapHashTable) | |
![]() | |
DynHashTable (Hash_Fct hash_fct=Aleph::dft_hash_fct< std::pair< Key, Data > >, const size_t len=Primes::DefaultPrime, const float lower_alpha=hash_default_lower_alpha, const float upper_alpha=hash_default_upper_alpha) | |
DynHashTable (const DynHashTable &other) | |
DynHashTable (DynHashTable &&other) | |
DynHashTable & | operator= (const DynHashTable &other) |
DynHashTable & | operator= (DynHashTable &&other) |
std::pair< Key, Data > * | insert (const std::pair< Key, Data > &key) |
std::pair< Key, Data > * | insert (std::pair< Key, Data > &&key) |
std::pair< Key, Data > * | add (const std::pair< Key, Data > &key) |
std::pair< Key, Data > * | add (std::pair< Key, Data > &&key) |
std::pair< Key, Data > * | search (const std::pair< Key, Data > &key) const |
bool | has (const std::pair< Key, Data > &key) const |
bool | contains (const std::pair< Key, Data > &key) const |
std::pair< Key, Data > & | find (const std::pair< Key, Data > &key) |
Generic_Keys (std::pair< Key, Data >) | |
returns a container with all the keys of the table | |
void | remove (std::pair< Key, Data > *key) |
void | remove (const std::pair< Key, Data > &key) |
Generic_Traverse (std::pair< Key, Data >) | |
Functional_Methods (std::pair< Key, Data >) | |
Equal_To_Method (DynHashTable) | |
![]() | |
GenLhashTable (Hash_Fct __hash_fct, size_t table_size=Primes::DefaultPrime, const float &__lower_alpha=hash_default_lower_alpha, const float &__upper_alpha=hash_default_upper_alpha, const bool __remove_all_buckets=true, const bool __with_resize=true) throw (std::exception, std::bad_alloc) | |
void | swap (GenLhashTable &other) |
void | empty () |
Vacía la tabla hash; libera memoria de todas las cubetas. | |
Hash_Fct | get_hash_fct () const |
void | set_hash_fct (Hash_Fct fct) |
Set the internal hash function. | |
float | current_alpha () const |
return the current table load | |
Bucket * | insert (Bucket *bucket) |
Bucket * | search (const std::pair< Key, Data > &key) const |
Bucket * | remove (Bucket *bucket) |
size_t | resize (size_t new_size) throw (std::exception, std::bad_alloc) |
virtual | ~GenLhashTable () |
Bucket * | search_next (Bucket *bucket) const |
const size_t & | capacity () const |
Retorna el tamaño de la tabla. | |
const size_t & | size () const |
Retorna el número de elementos que contiene la tabla. | |
const size_t & | get_num_busy_slots () const |
Retorna la cantidad de entradas del arreglo que están ocupadas. | |
bool | is_empty () const |
HASH_STATS () | |
![]() | |
static size_t | wrapper (const std::pair< Key, Data > &p) |
![]() | |
typedef LhashTable< std::pair < Key, Data >, Cmp > | Base |
typedef LhashTable< std::pair < Key, Data >, Cmp >::Bucket | Bucket |
![]() | |
std::pair< Key, Data > * | insert_bucket (Bucket *bucket) |
![]() | |
static Bucket * | key_to_bucket (std::pair< Key, Data > *key) |
![]() | |
Hash_Fct | hash_fct |
size_t | len |
float | lower_alpha |
float | upper_alpha |