#include <common/suif_hash_map.h>
Inheritance diagram for suif_hash_map:
Public Types | |
typedef literator | iterator |
typedef const literator | const_iterator |
typedef pair | value_type |
typedef domain | key_type |
typedef range | data_type |
Public Methods | |
pair& | enter_value (domain x,range y) |
Enter a value into the table with key x and value y. | |
iterator | find (const domain &x) const |
Find an entry by key. More... | |
range | lookup (const domain &x) |
Similar to find() except returning the associated value. More... | |
iterator | begin () |
Get an iterator to iterate over the values. More... | |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
void | erase (iterator &iter) |
Remove item from table. | |
suif_hash_map (int size = 32) | |
Create hash table. More... | |
~suif_hash_map () | |
iterator | insert (iterator &x,const pair &p) |
Insert a value. More... | |
unsigned | size () const |
Return number of entries in table. | |
void | clear () |
Clear the table. |
|
|
|
|
|
|
Create hash table.
size | the size of the hash table to use. This will be rounded up to a power of 2 |
|
|
Reimplemented from suif_hash_map_inner.
|
Get an iterator to iterate over the values.
|
|
Reimplemented from suif_hash_map_inner.
|
|
Enter a value into the table with key x and value y.
|
Remove item from table.
|
Find an entry by key.
Returns end() if not found
|
Insert a value.
The iterator value is ignored.
|
Similar to find() except returning the associated value.
assert if no value associated with the key in ths map.
|