Iterates through an unordered set. More...

#include <Containers_T.h>

Inheritance diagram for ACE_Fixed_Set_Iterator< T, ACE_SIZE >:

Collaboration diagram for ACE_Fixed_Set_Iterator< T, ACE_SIZE >:

Public Member Functions
	ACE_Fixed_Set_Iterator (ACE_Fixed_Set< T, ACE_SIZE > &s)

int	next (T *&next_item)

void	dump (void) const
	Dump the state of an object. More...

int	remove (T *&item)

T &	operator* (void)

Public Member Functions inherited from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >
int	next (T *&next_item)

int	advance (void)

int	first (void)

int	done (void) const
	Returns 1 when all items have been seen, else 0. More...

Public Attributes
	ACE_ALLOC_HOOK_DECLARE
	Declare the dynamic allocation hooks. More...

Public Attributes inherited from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >
	ACE_ALLOC_HOOK_DECLARE
	Declare the dynamic allocation hooks. More...

Additional Inherited Members
Protected Member Functions inherited from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >
	ACE_Fixed_Set_Iterator_Base (ACE_Fixed_Set< T, ACE_SIZE > &s)

void	dump_i (void) const
	Dump the state of an object. More...

int	next_i (T *&next_item)

Protected Attributes inherited from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >
ACE_Fixed_Set< T, ACE_SIZE > &	s_
	Set we are iterating over. More...

ssize_t	next_
	How far we've advanced over the set. More...

size_t	iterated_items_
	The number of non free items that the iterator had pointed at. More...

Detailed Description

Iterates through an unordered set.

This implementation of an unordered set uses a fixed array. Allows deletions while iteration is occurring.