ACE  6.0.6
Public Member Functions | Public Attributes | Private Attributes
ACE_Bounded_Set_Iterator Class Reference

Iterates through an unordered set. More...

#include <Containers_T.h>

Collaboration diagram for ACE_Bounded_Set_Iterator:
Collaboration graph
[legend]

List of all members.

Public Member Functions

 ACE_Bounded_Set_Iterator (ACE_Bounded_Set< T > &s)
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.
void dump (void) const
 Dump the state of an object.

Public Attributes

 ACE_ALLOC_HOOK_DECLARE
 Declare the dynamic allocation hooks.

Private Attributes

ACE_Bounded_Set< T > & s_
 Set we are iterating over.
ssize_t next_
 How far we've advanced over the set.

Detailed Description

Iterates through an unordered set.

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


Constructor & Destructor Documentation

ACE_Bounded_Set_Iterator::ACE_Bounded_Set_Iterator ( ACE_Bounded_Set< T > &  s)

Member Function Documentation

int ACE_Bounded_Set_Iterator::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 ACE_Bounded_Set_Iterator::done ( void  ) const

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

void ACE_Bounded_Set_Iterator::dump ( void  ) const

Dump the state of an object.

int ACE_Bounded_Set_Iterator::first ( void  )

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

int ACE_Bounded_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.


Member Data Documentation

Declare the dynamic allocation hooks.

How far we've advanced over the set.

Set we are iterating over.


The documentation for this class was generated from the following files:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines