SourcePro® 2024.1 |
SourcePro® API Reference Guide |
Iterator for class RWBinaryTree. More...
#include <rw/bintree.h>
Public Member Functions | |
RWBinaryTreeIterator (const RWBinaryTree &) | |
virtual | ~RWBinaryTreeIterator () |
virtual RWCollectable * | findNext (const RWCollectable *target) |
virtual RWCollectable * | key () const |
virtual RWCollectable * | operator() () |
virtual void | reset () |
Friends | |
class | RWBinaryTreeConstIterator |
Iterator for class RWBinaryTree. Traverses the tree from the smallest to largest element, where "smallest" and "largest" are defined by the virtual function RWBinaryTree::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 leads to undefined results.
RWBinaryTreeIterator::RWBinaryTreeIterator | ( | const RWBinaryTree & | ) |
Constructs an iterator for an RWBinaryTree. Immediately after construction, the position of the iterator is undefined until positioned.
|
virtual |
Empty destructor.
|
virtual |
Moves iterator to the next item that compares equal to the object pointed to by target and returns it. If no item is found, returns rwnil and the position of the iterator is undefined.
Implements RWIterator.
|
virtual |
Returns the item at the current iterator position.
Implements RWIterator.
|
virtual |
Advances the iterator and returns the next item, or rwnil if the end of the collection has been reached.
Implements RWIterator.
|
virtual |
Resets the iterator to the state it had immediately after construction.
Implements RWIterator.
Copyright © 2024 Rogue Wave Software, Inc., a Perforce company. All Rights Reserved. |