NAME
ACE_Fixed_Set_Iterator -
Interates through an unordered set.
SYNOPSIS
#include <ace/Set.h>
template<class T, size_t SIZE>
class ACE_Fixed_Set_Iterator
{
public:
ACE_Fixed_Set_Iterator (ACE_Fixed_Set<T, SIZE> &s);
int next (T *&next_item);
int advance (void);
void dump (void) const;
ACE_ALLOC_HOOK_DECLARE;
private:
ACE_Fixed_Set<T, SIZE> &s_;
ssize_t next_;
};
DESCRIPTION
This implementation of an unordered set uses a fixed array.
Allows deletions while iteration is occurring.
Initialization method.
ACE_Fixed_Set_Iterator (ACE_Fixed_Set<T, SIZE> &s);
Iteration methods.
int next (T *&next_item);
Pass back the next_item that hasn't been seen in the Set.
Returns 0 when all items have been seen, else 1.
int advance (void);
Move forward by one element in the set.
void dump (void) const;
Dump the state of an object.
ACE_ALLOC_HOOK_DECLARE;
Declare the dynamic allocation hooks.
AUTHOR
Doug Schmidt
LIBRARY
ace