NAME

ACE_Unbounded_Set_Iterator - Implement an iterator over an unbounded set.

SYNOPSIS

#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++ (void); ACE_Unbounded_Set_Iterator<T>& operator++ (int); 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_; };

Initialization method.

ACE_Unbounded_Set_Iterator (ACE_Unbounded_Set<T> &s, int end = 0);

Iteration methods.

int next (T *&next_item);

int advance (void);

int first (void);

int done (void) const;

void dump (void) const;

STL styled iteration, compare, and reference functions.

ACE_Unbounded_Set_Iterator<T> operator++ (void);

ACE_Unbounded_Set_Iterator<T>& operator++ (int);

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;

AUTHOR

Doug Schmidt

LIBRARY

ace