#include <vdkbtrees.h>
Iterator is implementes as a member of AbstractBinaryTree rather than an external object.
AbstractBinaryTree< T, Node >::Iterator::Iterator | ( | AbstractBinaryTree< T, Node > & | _tree, | |
enum BtreeIteratorMode | start = BtMinKey | |||
) | [inline] |
ructor
tree | tree reference | |
start | where the iterator starts, can be:
|
virtual AbstractBinaryTree< T, Node >::Iterator::~Iterator | ( | ) | [inline, virtual] |
Destructor
void AbstractBinaryTree< T, Node >::Iterator::StartAt | ( | enum BtreeIteratorMode | start | ) | [inline] |
Starts iterator over at the minimum, maximum or root node of the binary tree.
virtual void AbstractBinaryTree< T, Node >::Iterator::Previous | ( | ) | [inline, virtual] |
Move iterator to prev key
virtual void AbstractBinaryTree< T, Node >::Iterator::Next | ( | ) | [inline, virtual] |
Move iterator to next key
virtual void AbstractBinaryTree< T, Node >::Iterator::Parent | ( | ) | [inline, virtual] |
Move iterator to parent node
virtual AbstractBinaryTree< T, Node >::Iterator::operator int | ( | ) | [inline, virtual] |
Returns o if iterator points a non valid node. ie: was moved behind the lowest/highest key
virtual T AbstractBinaryTree< T, Node >::Iterator::operator* | ( | ) | [inline, virtual] |
Dereferencing operator returns the object of the node currently pointed to by the iterator.
virtual T AbstractBinaryTree< T, Node >::Iterator::current | ( | ) | [inline, virtual] |
Dereferencing operator returns the object of the node currently pointed to by the iterator.
virtual T* AbstractBinaryTree< T, Node >::Iterator::RefObject | ( | ) | [inline, virtual] |
returns a pointer to the object of the node currently pointed to (as opposed to returning a copy of the node, as the dereferencing operator does).
virtual T* AbstractBinaryTree< T, Node >::Iterator::Object | ( | ) | [inline, virtual] |
returns a pointer to the object of the node currently pointed to (as opposed to returning a copy of the node, as the dereferencing operator does).
virtual void AbstractBinaryTree< T, Node >::Iterator::operator++ | ( | ) | [inline, virtual] |
Move iterator to next key
virtual void AbstractBinaryTree< T, Node >::Iterator::operator++ | ( | int | ) | [inline, virtual] |
Move iterator to next key
virtual void AbstractBinaryTree< T, Node >::Iterator::operator-- | ( | ) | [inline, virtual] |
Move iterator to prev key
virtual void AbstractBinaryTree< T, Node >::Iterator::operator-- | ( | int | ) | [inline, virtual] |
Move iterator to prev key