ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > Class Template Reference

Implements a reverse iterator for a Red-Black Tree ADT. More...

#include <RB_Tree.h>

Inheritance diagram for ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >:

Collaboration diagram for ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >:

Public Member Functions
	ACE_RB_Tree_Reverse_Iterator ()
	ACE_RB_Tree_Reverse_Iterator (const ACE_RB_Tree< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &tree, int set_last=1)
	ACE_RB_Tree_Reverse_Iterator (const ACE_RB_Tree< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &tree, ACE_RB_Tree_Node< EXT_ID, INT_ID > *entry)
	ACE_RB_Tree_Reverse_Iterator (const EXT_ID &key, ACE_RB_Tree< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &tree)
	~ACE_RB_Tree_Reverse_Iterator ()
	Destructor.
int	advance ()
void	dump () const
	Dump the state of an object.
ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &	operator++ ()
	Prefix advance.
ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >	operator++ (int)
	Postfix advance.
ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &	operator-- ()
	Prefix reverse.
ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >	operator-- (int)
	Postfix reverse.
int	next (ACE_RB_Tree_Node< EXT_ID, INT_ID > *&next_entry) const
Public Member Functions inherited from ACE_RB_Tree_Iterator_Base< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >
	ACE_RB_Tree_Iterator_Base (const ACE_RB_Tree_Iterator_Base< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &iter)
	Copy constructor.
void	operator= (const ACE_RB_Tree_Iterator_Base< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &iter)
	Assignment operator: copies both the tree reference and the position in the tree.
int	done () const
	Returns 1 when the iteration has completed, otherwise 0.
ACE_RB_Tree_Node< EXT_ID, INT_ID > &	operator* () const
ACE_RB_Tree_Node< EXT_ID, INT_ID > *	operator-> () const
const ACE_RB_Tree< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &	tree ()
	Returns a const reference to the tree over which we're iterating.
bool	operator== (const ACE_RB_Tree_Iterator_Base< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &) const
	Comparison operator: returns 1 if both iterators point to the same position, otherwise 0.
bool	operator!= (const ACE_RB_Tree_Iterator_Base< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &) const
	Comparison operator: returns 1 if the iterators point to different positions, otherwise 0.

Public Attributes
	ACE_ALLOC_HOOK_DECLARE
	Declare the dynamic allocation hooks.
Public Attributes inherited from ACE_RB_Tree_Iterator_Base< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >
	ACE_ALLOC_HOOK_DECLARE
	Declare the dynamic allocation hooks.

Additional Inherited Members
Protected Member Functions inherited from ACE_RB_Tree_Iterator_Base< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >
	ACE_RB_Tree_Iterator_Base ()
	ACE_RB_Tree_Iterator_Base (const ACE_RB_Tree< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &tree, int set_first)
	ACE_RB_Tree_Iterator_Base (const ACE_RB_Tree< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &tree, ACE_RB_Tree_Node< EXT_ID, INT_ID > *entry)
	ACE_RB_Tree_Iterator_Base (const EXT_ID &key, ACE_RB_Tree< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &tree)
	~ACE_RB_Tree_Iterator_Base ()
	Destructor.
int	forward_i ()
int	reverse_i ()
void	dump_i () const
	Dump the state of an object.
Protected Attributes inherited from ACE_RB_Tree_Iterator_Base< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >
const ACE_RB_Tree< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > *	tree_
	Reference to the ACE_RB_Tree over which we're iterating.
ACE_RB_Tree_Node< EXT_ID, INT_ID > *	node_
	Pointer to the node currently under the iterator.

Detailed Description

template<class EXT_ID, class INT_ID, class COMPARE_KEYS, class ACE_LOCK>
class ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >

Implements a reverse iterator for a Red-Black Tree ADT.

Constructor & Destructor Documentation

ACE_RB_Tree_Reverse_Iterator() [1/4]

template<class EXT_ID , class INT_ID , class COMPARE_KEYS , class ACE_LOCK >

ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >::ACE_RB_Tree_Reverse_Iterator ( )

inline

Create the singular iterator. It is illegal to deference the iterator, no valid iterator is equal to a singular iterator, etc. etc.

ACE_RB_Tree_Reverse_Iterator() [2/4]

template<class EXT_ID , class INT_ID , class COMPARE_KEYS , class ACE_LOCK >

ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >::ACE_RB_Tree_Reverse_Iterator	(	const ACE_RB_Tree< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &	tree,
		int	set_last = 1 )

Constructor. Takes an ACE_RB_Tree over which to iterate, and an integer indicating (if non-zero) to position the iterator at the last element in the tree (if this integer is 0, the iterator is positioned at the first element in the tree).

ACE_RB_Tree_Reverse_Iterator() [3/4]

template<class EXT_ID , class INT_ID , class COMPARE_KEYS , class ACE_LOCK >

ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >::ACE_RB_Tree_Reverse_Iterator	(	const ACE_RB_Tree< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &	tree,
		ACE_RB_Tree_Node< EXT_ID, INT_ID > *	entry )

Constructor. Takes an ACE_RB_Tree over which to iterate, and a point to a node in the tree.

ACE_RB_Tree_Reverse_Iterator() [4/4]

template<class EXT_ID , class INT_ID , class COMPARE_KEYS , class ACE_LOCK >

ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >::ACE_RB_Tree_Reverse_Iterator	(	const EXT_ID &	key,
		ACE_RB_Tree< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > &	tree )

Constructor. Takes an ACE_RB_Tree over which to iterate, and a key; the key comes first in order to distinguish the case of EXT_ID == int.

~ACE_RB_Tree_Reverse_Iterator()

template<class EXT_ID , class INT_ID , class COMPARE_KEYS , class ACE_LOCK >

ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >::~ACE_RB_Tree_Reverse_Iterator

(

)

Destructor.

Member Function Documentation

advance()

template<class EXT_ID , class INT_ID , class COMPARE_KEYS , class ACE_LOCK >

int ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >::advance ( )

inline

Move forward by one element in the tree. Returns 0 when all elements have been seen, else 1.

dump()

template<class EXT_ID , class INT_ID , class COMPARE_KEYS , class ACE_LOCK >

void ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >::dump ( ) const

inline

Dump the state of an object.

next()

template<class EXT_ID , class INT_ID , class COMPARE_KEYS , class ACE_LOCK >

int ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >::next ( ACE_RB_Tree_Node< EXT_ID, INT_ID > *& next_entry ) const

inline

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 () 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.

operator++() [1/2]

template<class EXT_ID , class INT_ID , class COMPARE_KEYS , class ACE_LOCK >

ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > & ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >::operator++ ( )

inline

Prefix advance.

operator++() [2/2]

template<class EXT_ID , class INT_ID , class COMPARE_KEYS , class ACE_LOCK >

ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >::operator++ ( int )

inline

Postfix advance.

operator--() [1/2]

template<class EXT_ID , class INT_ID , class COMPARE_KEYS , class ACE_LOCK >

ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > & ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >::operator-- ( )

inline

Prefix reverse.

operator--() [2/2]

template<class EXT_ID , class INT_ID , class COMPARE_KEYS , class ACE_LOCK >

ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK > ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >::operator-- ( int )

inline

Postfix reverse.

Member Data Documentation

ACE_ALLOC_HOOK_DECLARE

template<class EXT_ID , class INT_ID , class COMPARE_KEYS , class ACE_LOCK >

ACE_RB_Tree_Reverse_Iterator< EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK >::ACE_ALLOC_HOOK_DECLARE

Declare the dynamic allocation hooks.

---

The documentation for this class was generated from the following files:

• RB_Tree.h
• RB_Tree.cpp
• RB_Tree.inl