template<class K, class T, class C = std::less<K>, class A = std::allocator< std::pair<K* const, T*> >>
class RWTPtrMapConstIterator< K, T, C, A >
- Deprecated:
- As of SourcePro 12.5, use RWTPtrMap::const_iterator to iterate over the elements in this collection.
RWTPtrMapIterator provides a const iterator interface to the C++ Standard Library-based RWTPtrMap collection. As a const iterator, it prohibits any change to the collection upon which it iterates.
The order of iteration over an RWTPtrMap is dependent on the comparator object supplied 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 preincrement 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
#include <rw/tpmap.h>
template <class K, class T, class C,
class A=std::allocator<T*> >
- 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, dereferences the resulting iterator, and returns its key. If the iterator has advanced past the last item in the container, rwnil will be returned.
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 referenced the last association in the multimap, self now points to an undefined value, and a value equivalent to false is returned. Otherwise, a value equivalent to true is returned.
