#include <Containers_T.h>
Collaboration diagram for ACE_Unbounded_Stack_Iterator:

Public Methods | |
| ACE_Unbounded_Stack_Iterator (ACE_Unbounded_Stack<T> &stack) | |
| Move to the first element in the <stack>. | |
| 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. | |
| 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. | |
| int | first (void) |
| Move to the first element in the Stack. Returns 0 if the Stack is empty, else 1. | |
| 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. | |
|
||||
|
Move to the first element in the <stack>.
|
|
||||
|
Move forward by one element in the Stack. Returns 0 when all the items in the Stack have been seen, else 1.
|
|
||||
|
Returns 1 when all items have been seen, else 0.
|
|
||||
|
Dump the state of an object.
|
|
||||
|
Move to the first element in the Stack. Returns 0 if the Stack is empty, else 1.
|
|
||||
|
Pass back the <next_item> that hasn't been seen in the Stack. Returns 0 when all items have been seen, else 1.
|
|
|||
|
Declare the dynamic allocation hooks.
|
|
|||
|
Pointer to the current node in the iteration.
|
|
|||
|
Pointer to the Stack we're iterating over.
|
1.2.3 written by Dimitri van Heesch,
© 1997-2000