Class diagram for suif_hash_map_inner:

Public Members | |
| suif_hash_map_inner (helper_inner &x,int table_size = 32) | |
| iterator_inner | find (const key_inner &x) const |
| void | erase (iterator_inner &x) |
| pair_inner* | enter_value (const key_inner &x,const pair_inner &y) |
| pair_inner* | enter_value_no_change (const key_inner &x,const pair_inner &y) |
| iterator_inner | begin () const |
| iterator_inner | end () const |
| virtual | ~suif_hash_map_inner () |
| void | clear () |
| suif_hash_map_inner& | operator= (const suif_hash_map_inner &x) |
| suif_hash_map_inner (const suif_hash_map_inner &x) | |
| unsigned | size () const |
| suif_hash_map_table* | top_table |
| helper_inner* | help |
Reimplemented in suif_hash_map.
Reimplemented in suif_hash_map.
[virtual]
Reimplemented in suif_hash_map.
Reimplemented in suif_hash_map.
written by Dimitri van Heesch, © 1997-1999