NAME

ACE_Bounded_Set_Iterator - Interates through an unordered set.

SYNOPSIS

#include <ace/Containers.h>

template<class T> class ACE_Bounded_Set_Iterator { public: ACE_Bounded_Set_Iterator (ACE_Bounded_Set<T> &s); 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_Bounded_Set<T> &s_; ssize_t next_; };

DESCRIPTION

This implementation of an unordered set uses a fixed array. This implementation does not allow duplicates...

Initialization method.

ACE_Bounded_Set_Iterator (ACE_Bounded_Set<T> &s);

Iteration methods.

int next (T *&next_item);

int advance (void);

int first (void);

int done (void) const;

void dump (void) const;

ACE_ALLOC_HOOK_DECLARE;

AUTHOR

Doug Schmidt

Initialization and termination methods.

Check boundary conditions.

Classic unordered set operations.

LIBRARY

ace