RWTValSetIterator< T, C, A > Class Template Reference

Deprecated. Provides an iterator for RWTValSet. More...

#include <rw/tvset.h>

Public Member Functions
	RWTValSetIterator (RWTValSet< T, C, A > &s)
RWTValSet< T, C, A > *	container () const
T	key () const
bool	operator() ()
bool	operator++ ()
void	reset ()
void	reset (RWTValSet< T, C, A > &s)

Detailed Description

template<class T, class C = std::less<T>, class A = std::allocator<T>>
class RWTValSetIterator< T, C, A >

Deprecated:

As of SourcePro 12.5, use RWTValSet::iterator to iterate over the elements in this collection.

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

The order of iteration over an RWTValSet is dependent on the supplied 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/tvset.h>
RWTValSet<T,C,A> vs;
RWTValSetIterator<T,C,A> itr(vs);

Persistence

None

Example

#include <rw/tvset.h>
#include <rw/cstring.h>
#include <iostream>
#include <functional>

int main()
{
   RWTValSet<RWCString,std::greater<RWCString> > a;
   RWTValSetIterator<RWCString,std::greater<RWCString> > itr(a);

   a.insert("John");
   a.insert("Steve");
   a.insert("Mark");

   //Rejected, duplicates are not allowed
   a.insert("Steve");

   while(itr()) {
     std::cout << itr.key() << std::endl;
   }

   return 0;
}

Program Output:

Steve
Mark
John

Constructor & Destructor Documentation

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

RWTValSetIterator< T, C, A >::RWTValSetIterator ( RWTValSet< T, C, A > &  s )

inline

Creates an iterator for the set s. The iterator begins in an undefined state and must be advanced before the first element is accessible.

Member Function Documentation

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

RWTValSet<T, C, A>* RWTValSetIterator< T, C, A >::container ( ) const

inline

Returns a pointer to the collection being iterated over.

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

T RWTValSetIterator< T, C, A >::key ( ) const

inline

Returns the value referenced by self.

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

bool RWTValSetIterator< T, C, A >::operator() ( void  )

inline

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

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

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

inline

Advances self to the next element. If the iterator has been reset or just created, self now references the first element. If, before iteration, self referenced the last association in the set, self now references an undefined value and false will be returned. Otherwise, returns true.

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

void RWTValSetIterator< T, C, A >::reset ( void  )

inline

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

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

void RWTValSetIterator< T, C, A >::reset ( RWTValSet< T, C, A > &  s )

inline

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