RWTPtrMultiSetIterator< T, C, A > Class Template Reference
[STL-based Collections]

Provides an iterator for RWTPtrMultiSet. More...

#include <rw/tpmset.h>

Public Member Functions
	RWTPtrMultiSetIterator (RWTPtrMultiSet< T, C, A > &m)
bool	operator++ ()
T *	operator() ()
RWTPtrMultiSet< T, C,A > *	container () const
T *	key () const
void	reset ()
void	reset (RWTPtrMultiSet< T, C, A > &t)

Detailed Description

template<class T, class C, class A = std:: allocator < T* >>
class RWTPtrMultiSetIterator< T, C, A >

RWTPtrMultiSetIterator provides an iterator interface to the C++ Standard Library-based collection represented by RWTPtrMultiSet. (An STL iterator interface is provided through RWTPtrMultiSet::iterator.)

The order of iteration over an RWTPtrMultiSet is dependent upon the comparator object parameter C as applied to the values stored in the container.

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/tpmset.h>
 RWTPtrMultiSet<T,C,A>  set;
 RWTPtrMultiSetIterator<T,C,A> itr(set);

Persistence

None

Examples

 #include <rw/tpmset.h>
 #include <iostream>
 #include <rw/cstring.h>
 
 int main() {
    RWTPtrMultiSet<RWCString, std::less<RWCString> > a;
    RWTPtrMultiSetIterator<RWCString, std::less<RWCString> > itr(a);
 
    a.insert(new RWCString("John"));
    a.insert(new RWCString("Steve"));
    a.insert(new RWCString("Mark"));
    a.insert(new RWCString("Steve"));
 
    while(itr()) {
      std::cout << *itr.key() << std::endl;
    }
 
    a.clearAndDestroy();
    return 0;
 }

Program Output:

 John
 Mark
 Steve
 Steve