|
TdZdd
1.1
A top-down/breadth-first decision diagram manipulation framework
|
Closed hash map implementation. More...
#include <MyHashTable.hpp>

Public Member Functions | |
| MyHashMap (Hash const &hash=Hash(), Equal const &equal=Equal()) | |
| Default constructor. | |
| MyHashMap (size_t n, Hash const &hash=Hash(), Equal const &equal=Equal()) | |
| Constructor. More... | |
| MyHashMap (MyHashMap const &o, size_t n=1) | |
| Copy constructor. More... | |
| V & | operator[] (K const &key) |
| Move constructor. More... | |
| V * | getValue (K const &key) const |
| Get the value that is already registered. More... | |
Public Member Functions inherited from tdzdd::MyHashTable< MyHashMapEntry< K, V >, MyHashMapHashWrapper< K, V, Hash, Equal >, MyHashMapHashWrapper< K, V, Hash, Equal > > | |
| MyHashTable (MyHashMapHashWrapper< K, V, Hash, Equal > const &hash=MyHashMapHashWrapper< K, V, Hash, Equal >(), MyHashMapHashWrapper< K, V, Hash, Equal > const &equal=MyHashMapHashWrapper< K, V, Hash, Equal >()) | |
| Default constructor. | |
| MyHashTable (size_t n, MyHashMapHashWrapper< K, V, Hash, Equal > const &hash=MyHashMapHashWrapper< K, V, Hash, Equal >(), MyHashMapHashWrapper< K, V, Hash, Equal > const &equal=MyHashMapHashWrapper< K, V, Hash, Equal >()) | |
| Constructor. More... | |
| MyHashTable (MyHashTable const &o, size_t n=1) | |
| Copy constructor. More... | |
| void | moveAssign (MyHashTable &o) |
| Move constructor. More... | |
| void | clear () |
| Initialize the table to be empty. More... | |
| void | initialize (size_t n) |
| Initialize the table to be empty. More... | |
| void | rehash (size_t n=1) |
| Resize the storage appropriately. More... | |
| Entry & | add (Entry const &elem) |
| Insert an element if no other equivalent element is registered. More... | |
| Entry * | get (Entry const &elem) const |
| Get the element that is already registered. More... | |
Additional Inherited Members | |
Protected Attributes inherited from tdzdd::MyHashTable< MyHashMapEntry< K, V >, MyHashMapHashWrapper< K, V, Hash, Equal >, MyHashMapHashWrapper< K, V, Hash, Equal > > | |
| MyHashMapHashWrapper< K, V, Hash, Equal > const | hashFunc |
| Functor for getting hash codes. | |
| MyHashMapHashWrapper< K, V, Hash, Equal > const | eqFunc |
| Functor for checking equivalence. | |
| size_t | tableCapacity_ |
| Size of the hash table storage. | |
| size_t | tableSize_ |
| Size of the hash table. | |
| size_t | maxSize_ |
| The maximum number of elements. | |
| size_t | size_ |
| The number of elements. | |
| Entry * | table |
| Pointer to the storage. | |
Closed hash map implementation.
An entry for the default key K() cannot be added in the map.
| K | type of keys. |
| V | type of values. |
Definition at line 554 of file MyHashTable.hpp.
|
inline |
Constructor.
| n | initial table size. |
| hash | hash function. |
| equal | equality function. |
Definition at line 575 of file MyHashTable.hpp.
|
inline |
Copy constructor.
| o | the object to be copied. |
| n | lower bound of initial table size. |
Definition at line 585 of file MyHashTable.hpp.
|
inline |
Get the value that is already registered.
| key | the key to be searched. |
Definition at line 611 of file MyHashTable.hpp.
References tdzdd::MyHashMapEntry< K, V >::value.
Referenced by tdzdd::DdStructure< ARITY >::operator==().
|
inline |
Move constructor.
| o | the object to be moved. |
| n | lower bound of initial table size. Insert an element if no other equivalent key is registered. |
| key | key of the element to be inserted. |
Definition at line 602 of file MyHashTable.hpp.
1.8.13