#include <ace/Containers.h>
template<class T> class ACE_Unbounded_Set_Iterator {
public:ACE_Unbounded_Set_Iterator (ACE_Unbounded_Set<T> &s, int end = 0);int next (T *&next_item);int advance (void);int first (void);int done (void) const;void dump (void) const;ACE_Unbounded_Set_Iterator<T> operator++ (int);ACE_Unbounded_Set_Iterator<T>& operator++ (void);T& operator* (void);int operator== (const ACE_Unbounded_Set_Iterator<T> &) const;int operator!= (const ACE_Unbounded_Set_Iterator<T> &) const;ACE_ALLOC_HOOK_DECLARE;private:ACE_Node<T> *current_;ACE_Unbounded_Set<T> *set_;};
ACE_Unbounded_Set_Iterator (ACE_Unbounded_Set<T> &s, int end = 0);
int next (T *&next_item);
next_item that hasn't been seen in the Set.
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_Unbounded_Set_Iterator<T> operator++ (int);
ACE_Unbounded_Set_Iterator<T>& operator++ (void);
T& operator* (void);
this is pointing to.
int operator== (const ACE_Unbounded_Set_Iterator<T> &) const;
int operator!= (const ACE_Unbounded_Set_Iterator<T> &) const;
ACE_ALLOC_HOOK_DECLARE;