template<class K, class T, class H = RWTHash<K>, class EQ = std::equal_to<K>, class A = std::allocator<K*>>
class RWTPtrHashMapConstIterator< K, T, H, EQ, A >
- Deprecated:
- As of SourcePro 12.5, use RWTPtrHashMap::const_iterator to iterate over the elements in this collection.
RWTPtrHashMapConstIterator provides a const iterator interface to the C++ Standard Library-based container RWTPtrHashMap. This iterator prohibits any changes to the underlying collection.
Iteration over an RWTPtrHashMap is pseudo-random and dependent on the capacity of the underlying hash table and the hash function being used.
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 operator()().
For both operator++() and operator()(), iterating past the last element returns a value equivalent to boolean false. Once this state is reached, 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/tphdict.h>
template <class K, class T, class H, class EQ,
class A=std::allocator<T*> >
- 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, dereferences the resulting iterator and returns its key. If the iterator has advanced past the last item in the container, returns rwnil.
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 references the first element. If used when self references the last association in the hashmap, self references an undefined value and the method returns a value equivalent to false. Otherwise, the method returns a value equivalent to true.
