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

ACE_Bounded_Set_Iterator Class Template Reference

Iterates through an unordered set. More...

#include <Containers_T.h>

Collaboration diagram for ACE_Bounded_Set_Iterator:

Collaboration graph
[legend]
List of all members.

Public Methods

 ACE_Bounded_Set_Iterator (ACE_Bounded_Set< T > &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

ACE_Bounded_Set< T > & s_
 Set we are iterating over. More...

ssize_t next_
 How far we've advanced over the set. More...

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

References ACE_TRACE, and advance. 

01342   : s_ (s),
01343     next_ (-1)
01344 {
01345   ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::ACE_Bounded_Set_Iterator");
01346   this->advance ();
01347 }

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

References ACE_TRACE, next_, and s_.

Referenced by ACE_Bounded_Set_Iterator, and first. 

01351 {
01352   ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::advance");
01353 
01354   for (++this->next_;
01355        ACE_static_cast(size_t, this->next_) < this->s_.cur_size_
01356          && this->s_.search_structure_[this->next_].is_free_;
01357        ++this->next_)
01358     continue;
01359 
01360   return ACE_static_cast(size_t, this->next_) < this->s_.cur_size_;
01361 }

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

References ACE_TRACE, and s_. 

01374 {
01375   ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::done");
01376 
01377   return ACE_static_cast (ACE_CAST_CONST size_t, this->next_) >=
01378     this->s_.cur_size_;
01379 }

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

Dump the state of an object.

Definition at line 1335 of file Containers_T.cpp.

References ACE_TRACE. 

01336 {
01337   ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::dump");
01338 }

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

References ACE_TRACE, advance, and next_. 

01365 {
01366   ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::first");
01367 
01368   next_ = -1;
01369   return this->advance ();
01370 }

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

References ACE_TRACE, next_, and s_. 

01383 {
01384   ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::next");
01385   if (ACE_static_cast(size_t, this->next_) < this->s_.cur_size_)
01386     {
01387       item = &this->s_.search_structure_[this->next_].item_;
01388       return 1;
01389     }
01390   else
01391     return 0;
01392 }

Member Data Documentation

template<class T>
ACE_Bounded_Set_Iterator::ACE_ALLOC_HOOK_DECLARE
 

Declare the dynamic allocation hooks.

Definition at line 1470 of file Containers_T.h.

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

How far we've advanced over the set.

Definition at line 1477 of file Containers_T.h.

Referenced by advance, first, and next.

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

Set we are iterating over.

Definition at line 1474 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:46:14 2003 for ACE by doxygen1.2.14 written by Dimitri van Heesch, © 1997-2002