RWTValHashMultiSetIterator< T, H, EQ, A > Class Template Reference
[STL Extension-based Collections]

Provides an iterator for RWTValHashMultiSet. More...

#include <rw/tvhasht.h>

Public Member Functions
	RWTValHashMultiSetIterator (RWTValHashMultiSet< T, H, EQ, A > &h)
bool	operator++ ()
bool	operator() ()
RWTValHashMultiSet< T, H, EQ,A > *	container () const
T	key () const
void	reset ()
void	reset (RWTValHashMultiSet< T, H, EQ, A > &h)

Detailed Description

template<class T, class H, class EQ, class A = std:: allocator < T >>
class RWTValHashMultiSetIterator< T, H, EQ, A >

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

Iteration over an RWTValHashMultiSet is pseudorandom and dependent on the capacity of the underlying hash table and the hash function being used. The only usable relationship between consecutive elements is that elements defined to be equivalent by the equivalence object, EQ, will be adjacent.

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== defined. This requirement is imposed by the C++ Standard Library.

Synopsis

 #include <rw/tvhasht.h>
 RWTValHashMultiSet<T,H,EQ,A> m;
 RWTValHashMultiSetIterator<T,H,EQ,A> itr(m);

Persistence

None

Examples

 #include <rw/tvmset.h>
 #include <iostream>
 #include <rw/cstring.h>
 #include <functional>
 
 int main()
 {
    RWTValMultiSet<RWCString, std::greater<RWCString> > a;
    RWTValMultiSetIterator<RWCString,
      std::greater<RWCString> > itr(a);
 
    a.insert("John");
    a.insert("Steve");
    a.insert("Mark");
    a.insert("Steve");
 
    while(itr()) {
      std::cout << itr.key() << std::endl;
    }
 
    return 0;
 }

Program Output:

 John
 Steve
 Mark
 Steve