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

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

  : s_ (s),
    next_ (-1)
{
  ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::ACE_Bounded_Set_Iterator");
  this->advance ();
}

---

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

References ACE_TRACE, and ACE_Bounded_Set_Iterator< T >::next_.

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

{
  ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::advance");

  for (++this->next_;
       static_cast<size_t> (this->next_) < this->s_.cur_size_
         && this->s_.search_structure_[this->next_].is_free_;
       ++this->next_)
    continue;

  return static_cast<size_t> (this->next_) < this->s_.cur_size_;
}

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

References ACE_TRACE, and ACE_Bounded_Set_Iterator< T >::next_.

{
  ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::done");

  return static_cast<ACE_CAST_CONST size_t> (this->next_) >=
    this->s_.cur_size_;
}

template<class T>

void ACE_Bounded_Set_Iterator< T >::dump

(

void

)

const

Dump the state of an object.

Definition at line 1384 of file Containers_T.cpp.

References ACE_TRACE.

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

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

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

{
  ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::first");

  next_ = -1;
  return this->advance ();
}

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

References ACE_TRACE, ACE_Bounded_Set_Iterator< T >::next_, and ACE_Bounded_Set_Iterator< T >::s_.

{
  ACE_TRACE ("ACE_Bounded_Set_Iterator<T>::next");
  if (static_cast<size_t> (this->next_) < this->s_.cur_size_)
    {
      item = &this->s_.search_structure_[this->next_].item_;
      return 1;
    }
  else
    return 0;
}

---

Member Data Documentation

template<class T>

ACE_Bounded_Set_Iterator< T >::ACE_ALLOC_HOOK_DECLARE

Declare the dynamic allocation hooks.

Definition at line 1497 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 1504 of file Containers_T.h.

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

template<class T>

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

Set we are iterating over.

Definition at line 1501 of file Containers_T.h.

Referenced by ACE_Bounded_Set_Iterator< T >::next().

---

The documentation for this class was generated from the following files:

• Containers_T.h
• Containers_T.cpp

---