#include <RB_Tree.h>
Inheritance diagram for ACE_RB_Tree_Iterator:
Public Methods | |
ACE_RB_Tree_Iterator (void) | |
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) | |
Destructor. More... | |
int | advance (void) |
Move forward by one element in the tree. Returns 0 when all elements have been seen, else 1. More... | |
void | dump (void) const |
Dump the state of an object. More... | |
ACE_RB_Tree_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > & | operator++ (void) |
Prefix advance. More... | |
ACE_RB_Tree_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > | operator++ (int) |
Postfix advance. More... | |
ACE_RB_Tree_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > & | operator-- (void) |
Prefix reverse. More... | |
ACE_RB_Tree_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > | operator-- (int) |
Postfix reverse. More... | |
int | next (ACE_RB_Tree_Node< EXT_ID, INT_ID > *&next_entry) const |
EXT_ID * | key (void) |
Accessor for key of node under iterator (if any). DEPRECATED. More... | |
INT_ID * | item (void) |
Accessor for item of node under iterator (if any). DEPRECATED. More... | |
int | first (void) |
Move to the first item in the iteration (and in the tree). DEPRECATED. More... | |
int | last (void) |
Move to the last item in the iteration (and in the tree). DEPRECATED. More... | |
int | next (void) |
Move to the next item in the iteration (and in the tree). DEPRECATED. More... | |
int | previous (void) |
Move to the previous item in the iteration (and in the tree). DEPRECATED. More... | |
int | is_done (void) |
Public Attributes | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. More... |
|
Create the singular iterator. It is illegal to deference the iterator, no valid iterator is equal to a singular iterator, etc. etc. |
|
Constructor. Takes an ACE_RB_Tree over which to iterate, and an integer indicating (if non-zero) to position the iterator at the first element in the tree (if this integer is 0, the iterator is positioned at the last element in the tree). |
|
Destructor.
|
|
Move forward by one element in the tree. Returns 0 when all elements have been seen, else 1.
|
|
Dump the state of an object.
|
|
Move to the first item in the iteration (and in the tree). DEPRECATED.
|
|
Returns 0 if the iterator is positioned over a valid ACE_RB_Tree node, returns 1 if not. DEPRECATED: use the base class <done> method instead. |
|
Accessor for item of node under iterator (if any). DEPRECATED.
|
|
Accessor for key of node under iterator (if any). DEPRECATED.
|
|
Move to the last item in the iteration (and in the tree). DEPRECATED.
|
|
Move to the next item in the iteration (and in the tree). DEPRECATED.
|
|
Passes back the <entry> under the iterator. Returns 0 if the iteration has completed, otherwise 1. This method must be declared and defined in both the derived forward and reverse iterator classes rather than in the base iterator class because of a method signature resolution problem caused by the existence of the deprecated next (void) method in the derived forward iterator class. When that deprecated method is removed, this method should be removed from the derived classes and placed in the base class. |
|
Postfix advance.
|
|
Prefix advance.
|
|
Postfix reverse.
|
|
Prefix reverse.
|
|
Move to the previous item in the iteration (and in the tree). DEPRECATED.
|
|
Declare the dynamic allocation hooks.
Reimplemented from ACE_RB_Tree_Iterator_Base. |