NAME

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

SYNOPSIS

#include <ace/RB_Tree.h>

template<class EXT_ID, class INT_ID, class COMPARE_KEYS, class ACE_LOCK> class ACE_RB_Tree_Iterator : public ACE_RB_Tree_Iterator_Base<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> { public: ACE_RB_Tree_Iterator ( const ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> &tree, int set_first = 1 ); ~ACE_RB_Tree_Iterator (void); int advance (void); void dump (void) const; ACE_RB_Tree_Iterator<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> & operator++ ( void ); ACE_RB_Tree_Iterator<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> operator++ ( int ); ACE_RB_Tree_Iterator<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> & operator-- ( void ); ACE_RB_Tree_Iterator<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> operator-- ( int ); ACE_ALLOC_HOOK_DECLARE; int next (ACE_RB_Tree_Node<EXT_ID, INT_ID> *&next_entry) const; EXT_ID *key (void); INT_ID *item (void); int first (void); int last (void); int next (void); int previous (void); int is_done (void); };

Initialization and termination methods.

ACE_RB_Tree_Iterator (
    const ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> &tree,
    int set_first = 1
    );

~ACE_RB_Tree_Iterator (void);

ACE-style iteration methods.

int advance (void);

void dump (void) const;

STL-style iteration methods.

ACE_RB_Tree_Iterator<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> & operator++ (
    void
    );

ACE_RB_Tree_Iterator<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> operator++ (
    int
    );

ACE_RB_Tree_Iterator<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> & operator-- (
    void
    );

ACE_RB_Tree_Iterator<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> operator-- (
    int
    );

ACE_ALLOC_HOOK_DECLARE;

int next (ACE_RB_Tree_Node<EXT_ID, INT_ID> *&next_entry) const;

DEPRECATED methods. Please migrate your code to use the new methods instead

EXT_ID *key (void);

INT_ID *item (void);

int first (void);

int last (void);

int next (void);

int previous (void);

int is_done (void);

AUTHOR

Chris Gill

LIBRARY

ace