template<class K, class T, class C = std::less<K>, class A = std::allocator< std::pair<K const, T> >>
class RWTValMapIterator< K, T, C, A >
- Deprecated:
- As of SourcePro 12.5, use RWTValMap::iterator to iterate over the elements in this collection.
RWTValMapIterator provides an iterator interface to the C++ Standard Library collection represented by RWTValMap. (An STL iterator interface is provided through RWTValMap::iterator.)
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 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/tvmap.h>
#include <rw/cstring.h>
#include <iostream>
#include <functional>
int main()
{
while(itr()) {
std::cout << itr.key()
<< "\'s age is "
<< itr.value()
<< std::endl;
}
return 0;
}
Program Output:
Steve's age is 17
Mark's age is 24
John's age is 30
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 will reference the first element. If, before iteration, self pointed to the last association in the map, self will reference an undefined value and will return false. Otherwise, it returns true.
