Implement an iterator over an unbounded Stack. More...

#include <Containers_T.h>

Collaboration diagram for ACE_Unbounded_Stack_Iterator< T >:

Public Member Functions
	ACE_Unbounded_Stack_Iterator (ACE_Unbounded_Stack< T > &stack)
	Move to the first element in the {stack}.
int	next (T *&next_item)
int	advance (void)
int	first (void)
int	done (void) const
	Returns 1 when all items have been seen, else 0.
void	dump (void) const
	Dump the state of an object.
Public Attributes
	ACE_ALLOC_HOOK_DECLARE
	Declare the dynamic allocation hooks.
Private Attributes
ACE_Node< T > *	current_
	Pointer to the current node in the iteration.
ACE_Unbounded_Stack< T > &	stack_
	Pointer to the Stack we're iterating over.

Detailed Description

Implement an iterator over an unbounded Stack.

Constructor & Destructor Documentation

template<class T >

ACE_Unbounded_Stack_Iterator< T >::ACE_Unbounded_Stack_Iterator ( ACE_Unbounded_Stack< T > & stack )

Move to the first element in the {stack}.

template<class T >

int ACE_Unbounded_Stack_Iterator< T >::advance ( void )

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

template<class T >

int ACE_Unbounded_Stack_Iterator< T >::done ( void ) const

Returns 1 when all items have been seen, else 0.

template<class T >

void ACE_Unbounded_Stack_Iterator< T >::dump ( void ) const

Dump the state of an object.

template<class T >

int ACE_Unbounded_Stack_Iterator< T >::first ( void )

Move to the first element in the Stack. Returns 0 if the Stack is empty, else 1.

template<class T >

int ACE_Unbounded_Stack_Iterator< T >::next ( T *& next_item )

Pass back the next_item that hasn't been seen in the Stack. Returns 0 when all items have been seen, else 1.

template<class T >

Declare the dynamic allocation hooks.

template<class T >

Pointer to the current node in the iteration.

template<class T >

Pointer to the Stack we're iterating over.

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