ACE  6.0.6
Public Member Functions | Public Attributes
ACE_Fixed_Set_Const_Iterator Class Reference

Iterates through a const unordered set. More...

#include <Containers_T.h>

Inheritance diagram for ACE_Fixed_Set_Const_Iterator:
Inheritance graph
Collaboration diagram for ACE_Fixed_Set_Const_Iterator:
Collaboration graph

List of all members.

Public Member Functions

 ACE_Fixed_Set_Const_Iterator (const ACE_Fixed_Set< T, ACE_SIZE > &s)
int next (const T *&next_item)
void dump (void) const
 Dump the state of an object.
const T & operator* (void) const

Public Attributes

 Declare the dynamic allocation hooks.

Detailed Description

Iterates through a const unordered set.

This implementation of an unordered set uses a fixed array.

Constructor & Destructor Documentation

ACE_Fixed_Set_Const_Iterator::ACE_Fixed_Set_Const_Iterator ( const ACE_Fixed_Set< T, ACE_SIZE > &  s)

Member Function Documentation

void ACE_Fixed_Set_Const_Iterator::dump ( void  ) const

Dump the state of an object.

int ACE_Fixed_Set_Const_Iterator::next ( const 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.

const T & ACE_Fixed_Set_Const_Iterator::operator* ( void  ) const

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

Member Data Documentation

Declare the dynamic allocation hooks.

Reimplemented from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >.

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