template<class K, class T, class C = std::less<K>, class A = std::allocator< std::pair<K const, T> >>
class RWTValMapConstIterator< K, T, C, A >
- Deprecated:
- As of SourcePro 12.5, use RWTValMap::const_iterator to iterate over the elements in this collection.
RWTValMapConstIterator provides a const iterator for RWTValMap. A const iterator prohibits changes to the underlying collection.
The order of iteration over an RWTValMap is dependent on the supplied comparator object as applied to the key values of the stored associations.
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. Continued increments return a value equivalent to false until reset() is called.
The value type must have operator==() and operator<() defined. This requirement is imposed by the C++ Standard Library.
- Synopsis
- Persistence
- None
template<class K, class T, class C = std::less<K>, class A = std::allocator< std::pair<K const, T> >>
Advances self to the next element. If the iterator has advanced past the last element in the collection, returns false, otherwise returns true.
template<class K, class T, class C = std::less<K>, class A = std::allocator< std::pair<K const, T> >>
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 pointed to the last association in the map, self now references an undefined value and returns false, otherwise returns true.
