Main Page   Class Hierarchy   Alphabetical List   Compound List   File List   Compound Members   File Members   Related Pages  

ACE_Fixed_Set_Const_Iterator Class Template Reference

Iterates through a const unordered set. More...

#include <Containers_T.h>

Collaboration diagram for ACE_Fixed_Set_Const_Iterator:

Collaboration graph
[legend]
List of all members.

Public Methods

 ACE_Fixed_Set_Const_Iterator (const ACE_Fixed_Set< T, ACE_SIZE > &s)
int 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. More...

int advance (void)
 Move forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1. More...

int first (void)
 Move to the first element in the set. Returns 0 if the set is empty, else 1. More...

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

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


Public Attributes

 ACE_ALLOC_HOOK_DECLARE
 Declare the dynamic allocation hooks. More...


Private Attributes

const 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...

Detailed Description

template<class T, size_t ACE_SIZE>
class ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >

Iterates through a const unordered set.

This implementation of an unordered set uses a fixed array.

Definition at line 1255 of file Containers_T.h.

Constructor & Destructor Documentation

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

Definition at line 1114 of file Containers_T.cpp.

References ACE_TRACE, and advance. 

01115   : s_ (s),
01116     next_ (-1)
01117 {
01118   ACE_TRACE ("ACE_Fixed_Set_Const_Iterator<T, ACE_SIZE>::ACE_Fixed_Set_Const_Iterator");
01119   this->advance ();
01120 }

Member Function Documentation

template<class T, size_t ACE_SIZE>
int ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::advance (  void    ) 
 

Move forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1.

Definition at line 1123 of file Containers_T.cpp.

References ACE_TRACE, next_, and s_.

Referenced by ACE_Fixed_Set_Const_Iterator, and first. 

01124 {
01125   ACE_TRACE ("ACE_Fixed_Set_Const_Iterator<T, ACE_SIZE>::advance");
01126 
01127   for (++this->next_;
01128        ACE_static_cast(size_t, this->next_) < this->s_.cur_size_
01129          && this->s_.search_structure_[this->next_].is_free_;
01130        ++this->next_)
01131     continue;
01132 
01133   return ACE_static_cast(size_t, this->next_) < this->s_.cur_size_;
01134 }

template<class T, size_t ACE_SIZE>
int ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::done (  void    )  const
 

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

Definition at line 1146 of file Containers_T.cpp.

References ACE_TRACE, and s_. 

01147 {
01148   ACE_TRACE ("ACE_Fixed_Set_Const_Iterator<T, ACE_SIZE>::done");
01149 
01150   return ACE_static_cast (ACE_CAST_CONST size_t, this->next_) >=
01151     this->s_.cur_size_;
01152 }

template<class T, size_t ACE_SIZE>
void ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::dump (  void    )  const
 

Dump the state of an object.

Definition at line 1108 of file Containers_T.cpp.

References ACE_TRACE. 

01109 {
01110   ACE_TRACE ("ACE_Fixed_Set_Const_Iterator<T, ACE_SIZE>::dump");
01111 }

template<class T, size_t ACE_SIZE>
int ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::first (  void    ) 
 

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

Definition at line 1137 of file Containers_T.cpp.

References ACE_TRACE, advance, and next_. 

01138 {
01139   ACE_TRACE ("ACE_Fixed_Set_Const_Iterator<T, ACE_SIZE>::first");
01140 
01141   next_ = -1;
01142   return this->advance ();
01143 }

template<class T, size_t ACE_SIZE>
int ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::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.

Definition at line 1155 of file Containers_T.cpp.

References ACE_TRACE, next_, and s_. 

01156 {
01157   ACE_TRACE ("ACE_Fixed_Set_Const_Iterator<T, ACE_SIZE>::next");
01158   if (ACE_static_cast (size_t, this->next_) < this->s_.cur_size_)
01159     {
01160       item = &this->s_.search_structure_[this->next_].item_;
01161       return 1;
01162     }
01163   else
01164     return 0;
01165 }

Member Data Documentation

template<class T, size_t ACE_SIZE>
ACE_Fixed_Set_Const_Iterator::ACE_ALLOC_HOOK_DECLARE
 

Declare the dynamic allocation hooks.

Definition at line 1282 of file Containers_T.h.

template<class T, size_t ACE_SIZE>
ssize_t ACE_Fixed_Set_Const_Iterator::next_ [private]
 

How far we've advanced over the set.

Definition at line 1289 of file Containers_T.h.

Referenced by advance, first, and next.

template<class T, size_t ACE_SIZE>
const ACE_Fixed_Set<T, ACE_SIZE>& ACE_Fixed_Set_Const_Iterator::s_ [private]
 

Set we are iterating over.

Definition at line 1286 of file Containers_T.h.

Referenced by advance, done, and next.

The documentation for this class was generated from the following files:
Generated on Mon Jun 16 12:48:00 2003 for ACE by doxygen1.2.14 written by Dimitri van Heesch, © 1997-2002