| 
    ACE
    6.1.7
    
   | 
 
Implement an iterator over an unbounded Stack. More...
#include <Containers_T.h>

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.   | |
Implement an iterator over an unbounded Stack.
| ACE_Unbounded_Stack_Iterator< T >::ACE_Unbounded_Stack_Iterator | ( | ACE_Unbounded_Stack< T > & | stack | ) | 
Move to the first element in the {stack}.
| 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.
| int ACE_Unbounded_Stack_Iterator< T >::done | ( | void | ) | const | 
Returns 1 when all items have been seen, else 0.
| void ACE_Unbounded_Stack_Iterator< T >::dump | ( | void | ) | const | 
Dump the state of an object.
| 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.
| 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.
| ACE_Unbounded_Stack_Iterator< T >::ACE_ALLOC_HOOK_DECLARE | 
Declare the dynamic allocation hooks.
      
  | 
  private | 
Pointer to the current node in the iteration.
      
  | 
  private | 
Pointer to the Stack we're iterating over.
 1.8.1.1