template<class K, class T, class C = std::less<K>, class A = std::allocator< std::pair<K const, T> >>
class RWTValMultiMapIterator< K, T, C, A >
- Deprecated:
- As of SourcePro 12.5, use RWTValMultiMap::iterator to iterate over the elements in this collection.
RWTValMultiMapIterator provides an iterator interface to the C++ Standard Library-based collection represented by RWTValMultiMap. (An STL iterator interface is provided through RWTValMultiMap::iterator.)
The order of iteration for an RWTValMultiMap is dependent upon the comparator object as applied to the keys 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
- Example
#include <rw/tvmmap.h>
#include <rw/cstring.h>
#include <iostream>
#include <functional>
int main()
{
<RWCString, int, std::greater<RWCString> > itr(age);
while(itr()) {
std::cout << itr.key()
<< "\'s age is "
<< itr.value()
<< std::endl;
}
return 0;
}
Program Output:
John's age is 30
Steve's age is 24
Steve's age is 17
Mark's age is 24
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 will now reference the first element. If, before iteration, self referenced the last association in the multi-map, self now references an undefined value and false is returned. Otherwise, returns true.
