Rogue Wave banner
Previous fileTop of DocumentContentsIndex pageNext file
Essential Tools Module Reference Guide
Rogue Wave web site:  Home Page  |  Main Documentation Page

RWBinaryTreeIterator

Module:  Essential Tools Module   Group:  RWCollectable Classes


RWBinaryTreeIteratorRWIterator

Local Index

Members

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.

Persistence

None

Public Constructor

RWBinaryTreeIterator(const RWBinaryTree&);

Public Destructor

virtual ~RWBinaryTreeIterator();

Public Member Operator

virtual RWCollectable*
operator()();

Public Member Functions

virtual RWCollectable*
findNext(const RWCollectable* target);
virtual void
reset();
virtual RWCollectable*
key() const;


Previous fileTop of DocumentContentsIndex pageNext file

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