NAME

RB_Tree_Iterator - Implements an iterator for a Red-Black Tree ADT.

SYNOPSIS

#include <ace/RB_Tree.h>

template<class KEY, class T> class RB_Tree_Iterator { public: RB_Tree_Iterator (const RB_Tree<KEY, T> &tree); ~RB_Tree_Iterator (void); KEY *key (void); T *item (void); int first (void); int last (void); int next (void); int previous (void); int is_done (void); private: inline ACE_UNIMPLEMENTED_FUNC ( RB_Tree_Iterator (const RB_Tree_Iterator<KEY, T> &) ); const RB_Tree<KEY, T> &tree_; RB_Tree_Node <KEY, T> *node_; };

Initialization and termination methods.

RB_Tree_Iterator (const RB_Tree<KEY, T> &tree);

~RB_Tree_Iterator (void);

KEY *key (void);

T *item (void);

int first (void);

int last (void);

int next (void);

int previous (void);

int is_done (void);

Declare private and do not define.

Explicitly prevent assignment and copy construction of iterators
inline ACE_UNIMPLEMENTED_FUNC (
    RB_Tree_Iterator (const RB_Tree_Iterator<KEY, T> &)
    );

Private members.

const RB_Tree<KEY, T> &tree_;

RB_Tree_Node <KEY, T> *node_;

AUTHOR

Chris Gill

LIBRARY

ace