|
pair< Key, Val > | insert (pair< Key, Val > elem) |
|
void | reserve (size_t size) |
|
| HashMap () |
|
| HashMap (const HM_t &map) |
|
| ~HashMap () |
|
HM_t & | operator= (const HM_t &map) |
|
bool | contains (const Key &key) const |
|
Val & | operator[] (const Key &key) |
|
const Val & | operator[] (const Key &key) const |
|
Val & | getOrCreateVal (const Key &key) |
|
Val & | getVal (const Key &key) |
|
const Val & | getVal (const Key &key) const |
|
const Val & | getValOrDefault (const Key &key) const |
|
const Val & | getValOrDefault (const Key &key, const Val &defaultVal) const |
|
bool | tryGetVal (const Key &key, Val &out) const |
|
void | setVal (const Key &key, const Val &val) |
|
void | clear (bool shrinkArray=0) |
|
void | erase (iterator entry) |
|
void | erase (const Key &key) |
|
size_type | size () const |
|
iterator | begin () |
|
iterator | end () |
|
const_iterator | begin () const |
|
const_iterator | end () const |
|
iterator | find (const Key &key) |
|
const_iterator | find (const Key &key) const |
|
bool | empty () const |
|
|
typedef uint | size_type |
|
typedef IteratorImpl< Node > | iterator |
|
typedef IteratorImpl< const Node > | const_iterator |
|
The documentation for this class was generated from the following file: