ACE  6.0.6
Public Member Functions | Public Attributes | Protected Member Functions | Protected Attributes
ACE_Fixed_Set_Iterator_Base Class Reference

Implements a common base class for iterators for a unordered set. More...

#include <Containers_T.h>

Collaboration diagram for ACE_Fixed_Set_Iterator_Base:
Collaboration graph
[legend]

List of all members.

Public Member Functions

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.

Public Attributes

 ACE_ALLOC_HOOK_DECLARE
 Declare the dynamic allocation hooks.

Protected Member Functions

 ACE_Fixed_Set_Iterator_Base (ACE_Fixed_Set< T, ACE_SIZE > &s)
void dump_i (void) const
 Dump the state of an object.
int next_i (T *&next_item)

Protected Attributes

ACE_Fixed_Set< T, ACE_SIZE > & s_
 Set we are iterating over.
ssize_t next_
 How far we've advanced over the set.
size_t iterated_items_
 The number of non free items that the iterator had pointed at.

Detailed Description

Implements a common base class for iterators for a unordered set.


Constructor & Destructor Documentation

ACE_Fixed_Set_Iterator_Base::ACE_Fixed_Set_Iterator_Base ( ACE_Fixed_Set< T, ACE_SIZE > &  s) [protected]

Member Function Documentation

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

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

void ACE_Fixed_Set_Iterator_Base::dump_i ( void  ) const [protected]

Dump the state of an object.

int ACE_Fixed_Set_Iterator_Base::first ( void  )

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

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

Reimplemented in ACE_Fixed_Set_Iterator.

int ACE_Fixed_Set_Iterator_Base::next_i ( T *&  next_item) [protected]

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.

Reimplemented in ACE_Fixed_Set_Const_Iterator, and ACE_Fixed_Set_Iterator.

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

How far we've advanced over the set.

Set we are iterating over.


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