Diagrama de herencias de Aleph::DynMapLinHash< Key, Data, Cmp >
Diagrama de colaboración para Aleph::DynMapLinHash< Key, Data, Cmp >:Tipos públicos | |
|
typedef DynMapHashTable< Key, Data, Cmp, LinearHashTable > | Base |
| typedef HashTable< Key, Cmp > | Base |
Tipos públicos heredados desde Aleph::DynMapHashTable< Key, Data, Cmp, LinearHashTable > | |
| typedef LinearHashTable< Key, Cmp > | Base |
| typedef Data | Value_Type |
| typedef size_t(* | Hash_Fct )(const Key &) |
Tipos públicos heredados desde Aleph::DynHashTable< std::pair< Key, Data >, Cmp, LinearHashTable > | |
| 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 |
Tipos públicos heredados desde Aleph::LinearHashTable< std::pair< Key, Data >, Cmp > | |
|
typedef GenLinearHashTable < std::pair< Key, Data > , LinHashBucket, Cmp > | Base |
Tipos públicos heredados desde Aleph::GenLinearHashTable< std::pair< Key, Data >, LinHashBucket, Cmp > | |
| typedef size_t(* | Hash_Fct )(const std::pair< Key, Data > &) |
|
typedef LinHashBucket < std::pair< Key, Data > > | Bucket |
| El tipo de cubeta. | |
| typedef std::pair< Key, Data > | Key_Type |
| typedef std::pair< Key, Data > | Item_Type |
Otros miembros heredados | |
Métodos públicos heredados desde Aleph::DynMapHashTable< Key, Data, Cmp, LinearHashTable > | |
| 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) | |
Métodos públicos heredados desde Aleph::DynHashTable< std::pair< Key, Data >, Cmp, LinearHashTable > | |
| 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) | |
Métodos públicos heredados desde Aleph::GenLinearHashTable< std::pair< Key, Data >, LinHashBucket, Cmp > | |
| void | set_hash_fct (Hash_Fct fct) |
| Set the internal hash function. | |
| Hash_Fct | get_hash_fct () const |
| const Cmp & | get_compare () const |
| float | current_alpha () const |
| return the current table load | |
| GenLinearHashTable (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, const bool __remove_all_buckets=true, const bool __with_resize=true) throw (std::exception, std::length_error, std::domain_error, std::bad_alloc, std::overflow_error) | |
| void | swap (GenLinearHashTable &other) |
| void | empty () |
| Bucket * | search (const std::pair< Key, Data > &key) const |
| const size_t & | size () const |
| Retorna la cantidad de elementos que tiene la tabla. | |
| bool | is_empty () const |
| return true is table is empty | |
| const size_t & | capacity () const |
| Retorna el tamaño de la tabla. | |
| const size_t & | busy_slots () const |
| Retorna la cantidad de entradas vacía que tiene la tabla. | |
| const size_t & | expansions () const |
| Bucket * | insert (Bucket *bucket) |
| size_t | resize (size_t) |
| Provided for generic programming compatibility. | |
| Bucket * | remove (Bucket *bucket) |
| void | print () |
| HASH_STATS () | |
Métodos públicos estáticos heredados desde Aleph::DynMapHashTable< Key, Data, Cmp, LinearHashTable > | |
| static size_t | wrapper (const std::pair< Key, Data > &p) |
Tipos protegidos heredados desde Aleph::DynHashTable< std::pair< Key, Data >, Cmp, LinearHashTable > | |
|
typedef LinearHashTable < std::pair< Key, Data >, Cmp > | Base |
|
typedef LinearHashTable < std::pair< Key, Data >, Cmp > ::Bucket | Bucket |
Métodos protegidos heredados desde Aleph::DynHashTable< std::pair< Key, Data >, Cmp, LinearHashTable > | |
| std::pair< Key, Data > * | insert_bucket (Bucket *bucket) |
Métodos protegidos estáticos heredados desde Aleph::DynHashTable< std::pair< Key, Data >, Cmp, LinearHashTable > | |
| static Bucket * | key_to_bucket (std::pair< Key, Data > *key) |
Atributos protegidos heredados desde Aleph::GenLinearHashTable< std::pair< Key, Data >, LinHashBucket, Cmp > | |
| Hash_Fct | hash_fct |
| float | upper_alpha |
| float | lower_alpha |
| size_t | len |