NAME

ACE_Ordered_MultiSet_Iterator - Implement a bidirectional iterator over an ordered multiset. This class template requires that operator semantics be defined for the parameterized type T, but does not impose any restriction on how that ordering operator is implemented.

SYNOPSIS

#include <ace/Containers.h>

template<class T> class ACE_Ordered_MultiSet_Iterator { public: friend class ACE_Ordered_MultiSet<T>; ACE_Ordered_MultiSet_Iterator (ACE_Ordered_MultiSet<T> &s); int next (T *&next_item) const; int first (void); int last (void); int advance (void); int retreat (void); int done (void) const; void dump (void) const; ACE_ALLOC_HOOK_DECLARE; private: ACE_DNode<T> *current_; ACE_Ordered_MultiSet<T> &set_; };

DESCRIPTION

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

Initialization method.

ACE_Ordered_MultiSet_Iterator (ACE_Ordered_MultiSet<T> &s);

Iteration methods.

int next (T *&next_item) const;

int first (void);

int last (void);

int advance (void);

int retreat (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