#include <ace/Containers.h>
template<class T> class ACE_Unbounded_Queue_Iterator {
public:ACE_Unbounded_Queue_Iterator ( ACE_Unbounded_Queue<T> &q, int end = 0 );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_Queue<T> &queue_;};
ACE_Unbounded_Queue_Iterator (ACE_Unbounded_Queue<T> &q, int end = 0);
int next (T *&next_item);
next_item that hasn't been seen in the queue.
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;