Main Page   Class Hierarchy   Alphabetical List   Compound List   File List   Compound Members   File Members   Related Pages  

ACE_Unbounded_Stack_Iterator Class Template Reference

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

#include <Containers_T.h>

Collaboration diagram for ACE_Unbounded_Stack_Iterator:

Collaboration graph
[legend]
List of all members.

Public Methods

 ACE_Unbounded_Stack_Iterator (ACE_Unbounded_Stack< T > &stack)
 Move to the first element in the <stack>. More...

int 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. More...

int advance (void)
 Move forward by one element in the Stack. Returns 0 when all the items in the Stack have been seen, else 1. More...

int first (void)
 Move to the first element in the Stack. Returns 0 if the Stack is empty, else 1. More...

int done (void) const
 Returns 1 when all items have been seen, else 0. More...

void dump (void) const
 Dump the state of an object. More...


Public Attributes

 ACE_ALLOC_HOOK_DECLARE
 Declare the dynamic allocation hooks. More...


Private Attributes

ACE_Node< T > * current_
 Pointer to the current node in the iteration. More...

ACE_Unbounded_Stack< T > & stack_
 Pointer to the Stack we're iterating over. More...


Detailed Description

template<class T>
class ACE_Unbounded_Stack_Iterator< T >

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 > &    q
 

Move to the first element in the <stack>.


Member Function Documentation

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 *&    item
 

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


Member Data Documentation

template<class T>
ACE_Unbounded_Stack_Iterator::ACE_ALLOC_HOOK_DECLARE
 

Declare the dynamic allocation hooks.

template<class T>
ACE_Node<T>* ACE_Unbounded_Stack_Iterator::current_ [private]
 

Pointer to the current node in the iteration.

template<class T>
ACE_Unbounded_Stack<T>& ACE_Unbounded_Stack_Iterator::stack_ [private]
 

Pointer to the Stack we're iterating over.


The documentation for this class was generated from the following files:
Generated on Sun Feb 17 17:44:40 2002 for ACE by doxygen1.2.13.1 written by Dimitri van Heesch, © 1997-2001