| Member Functions | ||
| container() findNext() insertAfterPoint() key() operator()() operator++() |
operator+=() operator--() operator-=() remove() removeNext() reset() |
#include<rw/tvslist.h> RWTValSlist<T> dl; RWTValSlistIterator<T> itr(dl);
If you have the Standard C++ Library, use the interface described here. Otherwise, use the restricted interface to RWTValSlistIterator described in Appendix A.
RWTValSlistIterator is supplied with Tools.h++ 7 to provide an iterator interface for class RWTValSlistIterator that is backward compatible with the container iterators provided in Tools.h++ 6.x.
The order of iteration over an RWTValSlist is dependent on the order of insertion of the values into 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 equal to false until reset() is called.
The value type must have operator== and operator< defined. This requirement is imposed by the Standard C++ Library.
None
#include<rw/tvslist.h>
#include<iostream.h>
#include<rw/cstring.h>
int main(){
RWTValSlist<RWCString> a;
RWTValSlistIterator<RWCString> itr(a);
a.insert("John");
a.insert("Steve");
a.insert("Mark");
a.insert("Steve");
for(;itr();)
cout << itr.key() << endl;
return 0;
}
Program Output
John
Steve
Mark
Steve
RWTValSlistIterator<T>(RWTValSlist<T>& s);
Creates an iterator for the singly linked list s. The iterator begins in an undefined state and must be advanced before the first element will be accessible
RWBoolean operator()();
Advances self to the next element. If the iterator has advanced past the last element in the collection, false will be returned. Otherwise, true will be returned.
RWBoolean 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 reference an undefined value distinct from the reset value and false will be returned. Otherwise, true is returned. Note: no postincrement operator is provided.
RWBoolean operator+=(size_type n);
Behaves as if the operator++ member function had been applied n times
RWBoolean 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 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 reference the last item in the list. Note: no postdecrement operator is provided.
RWBoolean operator-=(size_type n);
Behaves as if the operator-- member function had been applied n times
RWTValSlist<T>* container() const;
Returns a pointer to the collection being iterated over.
RWBoolean findNext(const_reference a);
Advances self to the first element t encountered by iterating forward, such that the expression (t == a) is true. Returns true if an element was found, returns false otherwise.
RWBoolean findNext(RWBoolean(*fn)(const_reference, 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_reference a, void* d);
Client data may be passed through parameter d. Returns true if an element was found, returns false otherwise.
void insertAfterPoint(T* p);
Inserts the pointer p into the container directly after the element referenced by self.
T key();
Returns the stored value referenced by self.
RWBoolean remove();
Removes the value referenced by self from the collection. true is returned if the removal is successful, false is returned otherwise.
RWBoolean removeNext(const T);
Removes the first element t, encountered by iterating self forward, such that the expression (t == a) is true. Returns true if an element was found and removed, returns false otherwise.
RWBoolean removeNext(RWBoolean(*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 an element was found and removed, returns false otherwise.
void reset(); void reset(RWTValSlist<T>& 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 a RWTValSlist to reset() will reset the iterator on the new container.