#include <ace/Containers.h>
template<class T> class ACE_Unbounded_Stack_Iterator {
public:
ACE_Unbounded_Stack_Iterator (ACE_Unbounded_Stack<T> &);
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_;
};
ACE_Unbounded_Stack_Iterator (ACE_Unbounded_Stack<T> &);
int next (T *&next_item);
next_item
that hasn't been seen in the Stack.
Returns 0 when all items have been seen, else 1.
int advance (void);
int first (void);
int done (void) const;
void dump (void) const;
ACE_ALLOC_HOOK_DECLARE;