Iterates through an unordered set. More...

#include <Containers_T.h>

Inheritance diagram for ACE_Fixed_Set_Iterator:

Collaboration diagram for ACE_Fixed_Set_Iterator:

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.
int	remove (T *&item)
T &	operator* (void)
Public Attributes
	ACE_ALLOC_HOOK_DECLARE
	Declare the dynamic allocation hooks.

Detailed Description

Iterates through an unordered set.

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

Constructor & Destructor Documentation

ACE_Fixed_Set_Iterator::ACE_Fixed_Set_Iterator ( ACE_Fixed_Set< T, ACE_SIZE > & s )

void ACE_Fixed_Set_Iterator::dump ( void ) const

Dump the state of an object.

int ACE_Fixed_Set_Iterator::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.

T & ACE_Fixed_Set_Iterator::operator* ( void )

STL-like iterator dereference operator: returns a reference to the node underneath the iterator.

int ACE_Fixed_Set_Iterator::remove ( T *& item )

Remove the item where the itearetor is located at. Returns 1 if it removes a item, else 0. Pass back the removed {item}.

Declare the dynamic allocation hooks.

The documentation for this class was generated from the following files: