|
Iterator | begin () const |
| Get an iterator pointing to the start of hash_map. More...
|
|
int32_t | bucket_count () const |
| Returns the number of buckets used by the hash map. More...
|
|
void | clear () |
| Erases all of the elements. More...
|
|
bool | contains (const TKEY &k) const |
| Check if a given key k exists in the hash map. More...
|
|
int32_t | count (const SharedBasePtr &k) const |
| Counts the number of elements whose key is k. More...
|
|
bool | empty () const |
| true if the hash map's size is 0. More...
|
|
Iterator | end () const |
| Get an iterator pointing to the end of hash_map. More...
|
|
int32_t | erase (const TKEY &k) |
| Erases the element whose key is k. More...
|
|
Iterator | find (const TKEY &k) const |
| Finds an element whose key is k. More...
|
|
| HashMapT () |
| Creates an empty hash map with hash function hasher<TKEY> and equal to function equal_to<TKEY>. More...
|
|
| HashMapT (int32_t n) |
| Creates an empty hash map with at least n buckets and hash function hasher<TKEY> and equal to function equal_to<TKEY>. More...
|
|
| HashMapT (const HashMapT &other) |
| Copy constructor. More...
|
|
bool | insert (const TKEY &k, const TVAL &v) |
| Inserts the <k, v> pair into the hash map, when k does not exist in the hash map. More...
|
|
int32_t | max_size () const |
| Returns the largest possible size of the hash map. More...
|
|
HashMapT & | operator= (const HashMapT &other) |
| Assignment operator. More...
|
|
TVAL | operator[] (const TKEY &k) |
| Returns a copy of the object that is associated with a particular key. More...
|
|
void | resize (int32_t n) |
| Increases the bucket count to at least n. More...
|
|
int32_t | size () const |
| Returns the size of the hash map. More...
|
|
void | swap (HashMapT &other) |
| Swaps the contents of two hash maps. More...
|
|
void | update (const TKEY &k, const TVAL &v) |
| Updates a value whose key must exist. More...
|
|
| ~HashMapT () |
| Destructor: the destructor of m_map would do required stuff. More...
|
|