RWTValSortedDlistIterator<T,C,A>

Module:  Essential Tools Module   Group:  STL-based Collection Classes

Does not inherit

• Local Index
• Synopsis
• Description
• Persistence
• Example
• Public Constructors
• Public Member Operators
• Public Member Functions

Members

container() findNext() key()

operator()() operator++() operator+=()

operator--() operator-=() remove()

removeNext() reset() RWTValSortedDlistIterator<T,C,A>()

#include<rw/tvsrtdli.h>
RWTValSortedDlist<T,C,A> dl;
RWTValSortedDlistIterator<T,C,A> itr(dl);

RWTValSortedDlistIterator provides the traditional Tools.h++ iterator interface to the standard library-based collections. (An STL iterator interface is provided through RWTValSortedDlist::iterator.)

The order of iteration over an RWTValSortedDlist is dependent on the supplied comparator object supplied 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 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/tvsrtdli.h>
#include <iostream>
#include <rw/cstring.h>
#include <functional>

int main() {
   RWTValSortedDlist<RWCString, std::less<RWCString> > a;
   RWTValSortedDlistIterator<RWCString, std::less<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
Mark
Steve
Steve

RWTValSortedDlistIterator<T,C,A>(RWTValSortedDlist<T,C,A>& s); 

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

bool
operator()();

Advances self to the next element. If the iterator has advanced past the last item in the container, a nil pointer will be returned.

bool
operator++();

Advances self to the next element. If the iterator has been reset or just created, self will reference the first element. If, before iteration, self referenced the last value in the list, self will now point to an undefined value distinct from the reset value and false will be returned. Otherwise, true is returned. Note: no postincrement operator is provided.

bool
operator+=(size_type n); 

Behaves as if the operator++ member function had been applied n times

bool
operator--();

Moves self back to the immediately previous element. If the iterator has been reset or just created, this operator will return false, otherwise it will return true. If self references the first element, it will now be in the reset state. If self has been iterated past the last value in the list, it will now point to the last item in the list. Note: no postdecrement operator is provided.

bool
operator-=(size_type n); 

Behaves as if the operator-- member function had been applied n times

RWTValSortedDlist<T,C,A>*
container() const; 

Returns a pointer to the collection being iterated over.

bool
findNext(const T a); 

Advances self to the first element t encountered by iterating forward, such that the expression (t == a) is true. Returns true if such an element if found, false otherwise.

bool
findNext(bool(*fn)(T, void*), void* d);

Advances self to the first element t encountered by iterating forward, such that the expression((*fn)(t,d)) is true. fn points to a user-defined tester function which must have prototype:

bool yourTester(const T a, void* d);

Client data may be passed through parameter d. Returns true if such an element if found, false otherwise.

T
key();

Returns the stored value referenced by self.

bool
remove();

Removes the stored value referenced by self from the collection. Returns true if the value was successfully removed, false otherwise.

bool
removeNext(const T); 

Removes the first element t, encountered by iterating self forward, such that the expression (t == a) is true. Returns true if such an element is successfully removed, false otherwise.

bool
removeNext(bool(*fn)(T, void*), void* d); 

Removes the first element t, encountered by iterating self forward, such that the expression((*fn)(t,d)) is true. fn points to a user-defined tester function which must have prototype:

bool yourTester(const T a, void* d);

Client data may be passed through parameter d. Returns true if such an element is successfully removed, false otherwise.

void
reset();
void
reset(RWTValSortedDlist<T,C,A>& l);

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 an RWTValSortedDlist to reset() will reset the iterator on the new container.

© 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.