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

ACE_Bounded_Set_Iterator< T > Class Template Reference

Iterates through an unordered set. More...

#include <Containers_T.h>

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

template<class T>
class ACE_Bounded_Set_Iterator< T >

Iterates through an unordered set.

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

Definition at line 1472 of file Containers_T.h.

Constructor & Destructor Documentation

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

Definition at line 1396 of file Containers_T.cpp.

References ACE_TRACE, and ACE_Bounded_Set_Iterator< T >::advance(). 

01397   : s_ (s),
01398     next_ (-1)
01399 {
01400   ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::ACE_Bounded_Set_Iterator");
01401   this->advance ();
01402 }

Member Function Documentation

template<class T>
int ACE_Bounded_Set_Iterator< T >::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 1405 of file Containers_T.cpp.

References ACE_TRACE.

Referenced by ACE_Bounded_Set_Iterator< T >::ACE_Bounded_Set_Iterator(), and ACE_Bounded_Set_Iterator< T >::first(). 

01406 {
01407   ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::advance");
01408 
01409   for (++this->next_;
01410        static_cast<size_t> (this->next_) < this->s_.cur_size_
01411          && this->s_.search_structure_[this->next_].is_free_;
01412        ++this->next_)
01413     continue;
01414 
01415   return static_cast<size_t> (this->next_) < this->s_.cur_size_;
01416 }

template<class T>
int ACE_Bounded_Set_Iterator< T >::done (  void   )  const
 

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

Definition at line 1428 of file Containers_T.cpp.

References ACE_TRACE. 

01429 {
01430   ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::done");
01431 
01432   return static_cast<ACE_CAST_CONST size_t> (this->next_) >=
01433     this->s_.cur_size_;
01434 }

template<class T>
void ACE_Bounded_Set_Iterator< T >::dump (  void   )  const
 

Dump the state of an object.

Definition at line 1388 of file Containers_T.cpp.

References ACE_TRACE. 

01389 {
01390 #if defined (ACE_HAS_DUMP)
01391   ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::dump");
01392 #endif /* ACE_HAS_DUMP */
01393 }

template<class T>
int ACE_Bounded_Set_Iterator< T >::first (  void   ) 
 

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

Definition at line 1419 of file Containers_T.cpp.

References ACE_TRACE, and ACE_Bounded_Set_Iterator< T >::advance(). 

01420 {
01421   ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::first");
01422 
01423   next_ = -1;
01424   return this->advance ();
01425 }

template<class T>
int ACE_Bounded_Set_Iterator< T >::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 1437 of file Containers_T.cpp.

References ACE_TRACE. 

01438 {
01439   ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::next");
01440   if (static_cast<size_t> (this->next_) < this->s_.cur_size_)
01441     {
01442       item = &this->s_.search_structure_[this->next_].item_;
01443       return 1;
01444     }
01445   else
01446     return 0;
01447 }

Member Data Documentation

template<class T>
ACE_Bounded_Set_Iterator< T >::ACE_ALLOC_HOOK_DECLARE
 

Declare the dynamic allocation hooks.

Definition at line 1499 of file Containers_T.h.

template<class T>
ssize_t ACE_Bounded_Set_Iterator< T >::next_ [private]
 

How far we've advanced over the set.

Definition at line 1506 of file Containers_T.h.

template<class T>
ACE_Bounded_Set<T>& ACE_Bounded_Set_Iterator< T >::s_ [private]
 

Set we are iterating over.

Definition at line 1503 of file Containers_T.h.

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