template<class K, class T, class C = std::less<K>, class A = std::allocator< std::pair<K* const, T*> >>
class RWTPtrMapIterator< K, T, C, A >
- Deprecated:
- As of SourcePro 12.5, use RWTPtrMap::iterator to iterate over the elements in this collection.
RWTPtrMapIterator provides an iterator interface to the C++ Standard Library-based collection represented by RWTPtrMap. (An STL iterator interface is provided through RWTPtrMap::iterator.)
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 pre-increment or operator()().
For both operator++() and operator()(), iterating past the last element will return a value equivalent to boolean false. Continued increments will 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/tpmap.h>
#include <iostream>
#include <rw/cstring.h>
int main() {
age.
insert(
new RWCString(
"John") ,
new int(30));
age.
insert(
new RWCString(
"Steve"),
new int(17));
age.
insert(
new RWCString(
"Mark") ,
new int(24));
while(itr()) {
std::cout << *itr.key() << "\'s age is " << *itr.value()
<< std::endl;
}
return 0;
}
Program Output:
John's age is 30
Mark's age is 24
Steve's age is 17
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 will now reference the first element. If, before iteration, self referenced the last association in the multimap, self will now point to an undefined value, and a value equivalent to false will be returned. Otherwise, a value equivalent to true is returned.
