RWTValMultiMapIterator< K, T, C, A > Class Template Reference

Deprecated. Provides an iterator for RWTValMultiMap. More...

#include <rw/tvmmap.h>

Public Member Functions
	RWTValMultiMapIterator (RWTValMultiMap< K, T, C, A > &m)
RWTValMultiMap< K, T, C, A > *	container () const
K	key () const
bool	operator() ()
bool	operator++ ()
void	reset ()
void	reset (RWTValMultiMap< K, T, C, A > &h)
T	value () const

Friends
class	RWTValMultiMapConstIterator< K, T, C, A >

Detailed Description

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

#include <rw/tvmmap.h>
RWTValMultiMap<K, T, C, A> vm;
RWTValMultiMapIterator<K, T, C, A> itr(vm);

Persistence

None

Example

#include <rw/cstring.h>
#include <rw/tvmmap.h>
#include <functional>
#include <iostream>
 
int main() {
  RWTValMultiMap<RWCString, int, std::greater<RWCString> > age;
  RWTValMultiMapIterator<RWCString, int, std::greater<RWCString> > itr(
      age);
 
  age.insert("John", 30);
  age.insert("Steve", 17);
  age.insert("Mark", 24);
  age.insert("Steve", 24);
 
  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

Constructor & Destructor Documentation

RWTValMultiMapIterator()

template<class K , class T , class C = std::less<K>, class A = std::allocator< std::pair<K const, T> >>

RWTValMultiMapIterator< K, T, C, A >::RWTValMultiMapIterator ( RWTValMultiMap< K, T, C, A > & m )

inline

Creates an iterator for the multi-map m. The iterator begins in an undefined state and must be advanced before the first association is accessible.

Member Function Documentation

container()

template<class K , class T , class C = std::less<K>, class A = std::allocator< std::pair<K const, T> >>

RWTValMultiMap< K, T, C, A > * RWTValMultiMapIterator< K, T, C, A >::container ( ) const

inline

Returns a pointer to the collection being iterated over.

key()

template<class K , class T , class C = std::less<K>, class A = std::allocator< std::pair<K const, T> >>

K RWTValMultiMapIterator< K, T, C, A >::key ( ) const

inline

Returns the key portion of the association currently referenced by self.

operator()()

template<class K , class T , class C = std::less<K>, class A = std::allocator< std::pair<K const, T> >>

bool RWTValMultiMapIterator< K, T, C, A >::operator() ( )

inline

Advances self to the next element and returns true. Returns false if the iterator has advanced past the last element in the collection.

operator++()

template<class K , class T , class C = std::less<K>, class A = std::allocator< std::pair<K const, T> >>

bool RWTValMultiMapIterator< K, T, C, A >::operator++ ( )

inline

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.

reset() [1/2]

template<class K , class T , class C = std::less<K>, class A = std::allocator< std::pair<K const, T> >>

void RWTValMultiMapIterator< K, T, C, A >::reset ( )

inline

Resets the iterator so that after being advanced, it references the first element of the collection.

reset() [2/2]

template<class K , class T , class C = std::less<K>, class A = std::allocator< std::pair<K const, T> >>

void RWTValMultiMapIterator< K, T, C, A >::reset ( RWTValMultiMap< K, T, C, A > & h )

inline

Resets the iterator so that after being advanced, it references the first element of the collection h.

value()

template<class K , class T , class C = std::less<K>, class A = std::allocator< std::pair<K const, T> >>

T RWTValMultiMapIterator< K, T, C, A >::value ( ) const

inline

Returns the value portion of the association referenced by self.