ACE_Unbounded_Stack_Iterator< T > Class Template Reference

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

#include <Containers_T.h>

Collaboration diagram for ACE_Unbounded_Stack_Iterator< T >:
Collaboration graph
[legend]

List of all members.

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

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 > &  stack  )  [inline]

Move to the first element in the {stack}.


Member Function Documentation

template<class T >
int ACE_Unbounded_Stack_Iterator< T >::advance ( void   )  [inline]

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 [inline]

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

template<class T >
void ACE_Unbounded_Stack_Iterator< T >::dump ( void   )  const [inline]

Dump the state of an object.

template<class T >
int ACE_Unbounded_Stack_Iterator< T >::first ( void   )  [inline]

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  )  [inline]

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

Declare the dynamic allocation hooks.

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

Pointer to the current node in the iteration.

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

Pointer to the Stack we're iterating over.


The documentation for this class was generated from the following files:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines

Generated on Mon Nov 30 00:54:22 2009 for ACE by  doxygen 1.6.1