ACE_Unbounded_Stack_Iterator3
Implement an iterator over an unbounded stack.
Usage
#include <ace/Containers.h>
template<class T>
class ACE_Unbounded_Stack_Iterator
{
public:
ACE_Unbounded_Stack_Iterator (ACE_Unbounded_Stack<T> &stack);
int next (T *&next_item);
int advance (void);
int first (void);
int done (void) const;
void dump (void) const;
ACE_ALLOC_HOOK_DECLARE;
private:
ACE_Node<T> *current_;
ACE_Unbounded_Stack<T> &stack_;
};
Overview
This implementation of an unordered set uses a fixed array. This implementation does not allow duplicates...
Initialization method.
ACE_Unbounded_Stack_Iterator (ACE_Unbounded_Stack<T> &stack);
Move to the first element in the stack.
Iteration methods.
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.
ACE_ALLOC_HOOK_DECLARE;
Declare the dynamic allocation hooks.
Initialization and termination methods.
Check boundary conditions.
Classic unordered set operations.
Library
ace