|
| | HashTable_iterator () |
| | Construct an uninitialized iterator.
|
| |
| T * | get () const |
| | Return a pointer to the element, null if *this == end().
|
| |
| T * | operator-> () const |
| | Return a pointer to the element.
|
| |
| T & | operator* () const |
| | Return a reference to the element.
|
| |
| | HashTable_const_iterator () |
| | Construct an uninitialized iterator.
|
| |
| const T * | get () const |
| | Return a pointer to the element, null if *this == end().
|
| |
| const T * | operator-> () const |
| | Return a pointer to the element.
|
| |
| const T & | operator* () const |
| | Return a reference to the element.
|
| |
| HashTable< T >::key_const_reference | key () const |
| | Return this element's key.
|
| |
| bool | live () const |
| | Return true iff *this != end().
|
| |
| | operator unspecified_bool_type () const |
| | Return true iff *this != end().
|
| |
| void | operator++ (int) |
| | Advance this iterator to the next element.
|
| |
| void | operator++ () |
| | Advance this iterator to the next element.
|
| |
template<typename T>
class HashTable_iterator< T >
The iterator type for HashTable.
These iterators apply to HashTable classes that store either a unified key-value pair (HashTable<T>), or to HashTable classes that map keys to explicit values (HashTable<K, V>).
Iterators for HashTable<K, V> objects have additional methods. Given HashTable<K, V>::iterator it:
-
*it has type Pair<const K, V>.
-
it.key() returns the associated key, and is equivalent to it->first.
-
it.value() returns the associated value, and is equivalent to it->second.
-
it.value() is a mutable reference for iterator objects and a const reference for const_iterator objects.