Reference

ACE_Fixed_Set_Iterator(3)

Interates through an unordered set.

NAME

ACE_Fixed_Set_Iterator - Interates through an unordered set.

SYNOPSIS

#include <ace/Containers.h>
template<class T, size_t ACE_SIZE>
class ACE_Fixed_Set_Iterator
{
  public:
    ACE_Fixed_Set_Iterator (ACE_Fixed_Set<T, ACE_SIZE> &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_Fixed_Set<T, ACE_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, ACE_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. Returns 0 when all the items in the set have been seen, else 1.

int first (void);

Move to the first element in the set. Returns 0 if the set is empty, else 1.

int done (void) const;

Returns 1 when all items have been seen, else 0.

void dump (void) const;

Dump the state of an object.

ACE_ALLOC_HOOK_DECLARE;

Declare the dynamic allocation hooks.

AUTHOR

Doug Schmidt

Initialization and termination methods.

Check boundary conditions.

Classic unordered set operations.

LIBRARY

ace