Tools.h++ Class Reference

Click on the banner to return to the Class Reference home page.
©Copyright 1996 Rogue Wave Software
RWBinaryTreeIterator
RWBinaryTreeIterator RWIterator
Synopsis●
Description●
Persistence●
Public Constructor●
Public Member Operator●
Public Member Functions●
Synopsis
// Smalltalk typedef:
typedef RWBinaryTreeIterator SortedCollectionIterator;
#include <rw/bintree.h>
RWBinaryTree bt;
RWBinaryTreeIterator iterate(bt);
Description
Iterator for class RWBinaryTree. Traverses the tree from the "smallest" to "largest" element,
where "smallest" and "largest" are defined by the virtual function compareTo(). Note that this
approach is generally less efficient than using the member function RWBinaryTree::apply().
Like all Rogue Wave iterators, the "current item" is undefined immediately after construction --
you must define it by using operator() or some other (valid) operation.
Once the iterator has advanced beyond the end of the collection it is no longer valid --
continuing to use it will bring undefined results.