Module: Essential Tools Module Group: STL-based Collection Classes
Does not inherit
#include<rw/tvmap.h> RWTValMap<K,T,C,A> vm; RWTValMapIterator<K,T,C,A> itr(vm);
RWTValMapIterator provides the traditional Tools.h++ iterator interface to the standard library-based collections. (An STL iterator interface is provided through RWTValMap::iterator.)
The order of iteration over an RWTValMap 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 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.
None
#include<rw/tvmap.h> #include<iostream> #include<rw/cstring.h> #include<functional> int main(){ RWTValMap<RWCString, int, std::greater<RWCString> > age; RWTValMapIterator<RWCString, int, std::greater<RWCString> > itr(age); age.insert("John", 30); age.insert("Steve", 17); age.insert("Mark", 24); //Insertion is rejected, no duplicates allowed age.insert("Steve", 24); 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
RWTValMapIterator<K,T,C,A>(RWTValMap<K,T,C,A>& h);
Creates an iterator for the map h. The iterator begins in an undefined state and must be advanced before the first association will be accessible.
bool operator()();
Advances self to the next element. If the iterator has advanced past the last element in the collection, false will be returned. Otherwise, true will be returned.
bool operator++();
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 pointed to the last association in the map, self will now reference an undefined value and false will be returned. Otherwise, true is returned. Note: no postincrement operator is provided.
RWTValMap<K,T,C,A>* container() const;
Returns a pointer to the collection being iterated over.
K key() const;
Returns the key portion of the association currently referenced by self.
void reset(); void reset(RWTValMap<K,T,C,A>& h);
Resets the iterator so that after being advanced it will reference the first element of the collection. Using reset() with no argument will reset the iterator on the current container. Supplying a RWTValMap with reset() will reset the iterator on that container.
T value();
Returns the value portion of the association referenced by self.
© Copyright Rogue Wave Software, Inc. All Rights Reserved.
Rogue Wave and SourcePro are registered trademarks of Rogue Wave Software, Inc. in the United States and other countries. All other trademarks are the property of their respective owners.
Contact Rogue Wave about documentation or support issues.