template<class K, class T, class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K>>
class RWTValHashMapConstIterator< K, T, H, EQ, A >
- Deprecated
- As of SourcePro 12.5, use RWTValHashMap::const_iterator to iterate over the elements in this collection.
RWTValHashMapConstIterator provides a const
iterator for RWTValHashMap. The const
iterator prohibits changes to the underlying collection.
Iteration over an RWTValHashMap is pseudorandom and dependent on the capacity of the underlying hash table and the hash function being used. The only usable relationship between consecutive elements is that elements which are defined to be equivalent by the equivalence object, EQ
, will remain adjacent.
The current item referenced by this iterator is undefined after construction or after a call to reset(). The iterator becomes valid after being advanced with either a pre-increment or an operator()().
For both operator++() and operator()(), iterating past the last element returns a value equivalent to boolean false
. Continued increments return a value equivalent to false
until reset() is called.
The value
type must have operator==
defined. This requirement is imposed by the C++ Standard Library.
- Synopsis
#include <rw/tvhdict.h>
Deprecated. Provides a const iterator for RWTValHashMap.
Definition tvhdict.h:1193
Maintains a collection of keys, each with an associated item stored according to a hash object.
Definition tvhdict.h:144
- Persistence
- None
template<class K , class T , class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K>>
Advances self to the next element. If the iterator has been reset or just created self now references the first element. If, before iteration, self referenced the last association in the multimap, self now references an undefined value and false
is returned. Otherwise, true
is returned.