Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members | Related Pages | Search for 

ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE > Class Template Reference

Iterates through a const unordered set. More...

#include <Containers_T.h>

Inheritance diagram for ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >:

Inheritance graph
[legend]
Collaboration diagram for ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >:

Collaboration graph
[legend]
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

 ACE_ALLOC_HOOK_DECLARE
 Declare the dynamic allocation hooks.

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 1298 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 1193 of file Containers_T.cpp.

References ACE_TRACE. 

01194   : ACE_Fixed_Set_Iterator_Base<T, ACE_SIZE> (s)
01195 {
01196   ACE_TRACE ("ACE_Fixed_Set_Const_Iterator<T, ACE_SIZE>::ACE_Fixed_Set_Const_Iterator");
01197 }

Member Function Documentation

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 1185 of file Containers_T.cpp.

References ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::dump_i(). 

01186 {
01187 #if defined (ACE_HAS_DUMP)
01188   this->dump_i ();
01189 #endif /* ACE_HAS_DUMP */
01190 }

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

Definition at line 1200 of file Containers_T.cpp.

References ACE_TRACE, and ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::next_i(). 

01201 {
01202   ACE_TRACE ("ACE_Fixed_Set_Const_Iterator<T, ACE_SIZE>::next");
01203 
01204   return this->next_i (item);
01205 }

template<class T, size_t ACE_SIZE>
const T & ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::operator * (  void   )  const
 

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

Definition at line 1208 of file Containers_T.cpp.

References ACE_ASSERT. 

01209 {
01210   const T *retv = 0;
01211 
01212   if (this->s_.search_structure_[this->next_].is_free_ == 0)
01213     retv = &this->s_.search_structure_[this->next_].item_;
01214 
01215   ACE_ASSERT (retv != 0);
01216 
01217   return *retv;
01218 }

Member Data Documentation

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

Declare the dynamic allocation hooks.

Reimplemented from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >.

Definition at line 1318 of file Containers_T.h.

The documentation for this class was generated from the following files:
Generated on Thu Nov 9 11:22:20 2006 for ACE by doxygen 1.3.6