ACE_Unbounded_List_Iterator< T > Class Template Reference

Implement an iterator over an unbounded List. More...

#include <Naming_Service_Container.h>

List of all members.

Public Member Functions
	ACE_Unbounded_List_Iterator (ACE_Unbounded_List< T > &s, int end=0)
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.
ACE_Unbounded_List_Iterator< T >	operator++ (int)
	Postfix advance.
ACE_Unbounded_List_Iterator< T > &	operator++ (void)
	Prefix advance.
T &	operator * (void)
	Returns a reference to the interal element <this> is pointing to.
bool	operator== (const ACE_Unbounded_List_Iterator< T > &) const
	Check if two iterators point to the same position.
bool	operator!= (const ACE_Unbounded_List_Iterator< T > &) const
Public Attributes
	ACE_ALLOC_HOOK_DECLARE
	Declare the dynamic allocation hooks.
Private Attributes
ACE_NS_Node< T > *	current_
	Pointer to the current node in the iteration.
ACE_Unbounded_List< T > *	set_
	Pointer to the set we're iterating over.

---

Detailed Description

template<class T>
class ACE_Unbounded_List_Iterator< T >

Implement an iterator over an unbounded List.

Definition at line 76 of file Naming_Service_Container.h.

---

Constructor & Destructor Documentation

template<class T>

ACE_Unbounded_List_Iterator< T >::ACE_Unbounded_List_Iterator	(	ACE_Unbounded_List< T > &	s,
		int	end = 0
	)

Definition at line 276 of file Naming_Service_Container.cpp.

  : current_ (end == 0 ? s.head_->next_ : s.head_ ),
    set_ (&s)
{
  // ACE_TRACE ("ACE_Unbounded_List_Iterator<T>::ACE_Unbounded_List_Iterator");
}

---

Member Function Documentation

template<class T>

int ACE_Unbounded_List_Iterator< T >::advance

(

void

)

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

Definition at line 284 of file Naming_Service_Container.cpp.

References ACE_Unbounded_List_Iterator< T >::current_, and ACE_Unbounded_List_Iterator< T >::set_.

Referenced by ACE_Unbounded_List_Iterator< T >::operator++().

{
  // ACE_TRACE ("ACE_Unbounded_List_Iterator<T>::advance");
  this->current_ = this->current_->next_;
  return this->current_ != this->set_->head_;
}

template<class T>

int ACE_Unbounded_List_Iterator< T >::done

(

void

)

const

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

Definition at line 300 of file Naming_Service_Container.cpp.

References ACE_TRACE, ACE_Unbounded_List_Iterator< T >::current_, and ACE_Unbounded_List_Iterator< T >::set_.

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

  return this->current_ == this->set_->head_;
}

template<class T>

void ACE_Unbounded_List_Iterator< T >::dump

(

void

)

const

Dump the state of an object.

Definition at line 270 of file Naming_Service_Container.cpp.

{
  // ACE_TRACE ("ACE_Unbounded_List_Iterator<T>::dump");
}

template<class T>

int ACE_Unbounded_List_Iterator< T >::first

(

void

)

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

Definition at line 292 of file Naming_Service_Container.cpp.

References ACE_Unbounded_List_Iterator< T >::current_, and ACE_Unbounded_List_Iterator< T >::set_.

{
  // ACE_TRACE ("ACE_Unbounded_List_Iterator<T>::first");
  this->current_ = this->set_->head_->next_;
  return this->current_ != this->set_->head_;
}

template<class T>

int ACE_Unbounded_List_Iterator< T >::next

(

T *&

next_item

)

Pass back the <next_item> that hasn't been seen in the List. Returns 0 when all items have been seen, else 1.

Definition at line 308 of file Naming_Service_Container.cpp.

References ACE_Unbounded_List_Iterator< T >::current_.

Referenced by ACE_Unbounded_List_Iterator< T >::operator *().

{
  // ACE_TRACE ("ACE_Unbounded_List_Iterator<T>::next");
  if (this->current_ == this->set_->head_)
    return 0;
  else
    {
      item = &this->current_->item_;
      return 1;
    }
}

template<class T>

T & ACE_Unbounded_List_Iterator< T >::operator *

(

void

)

Returns a reference to the interal element <this> is pointing to.

Definition at line 344 of file Naming_Service_Container.cpp.

References ACE_ASSERT, and ACE_Unbounded_List_Iterator< T >::next().

{
  //ACE_TRACE ("ACE_Unbounded_List_Iterator<T>::operator*");
  T *retv = 0;

  int result = this->next (retv);
  ACE_ASSERT (result != 0);
  ACE_UNUSED_ARG (result);

  return *retv;
}

template<class T>

bool ACE_Unbounded_List_Iterator< T >::operator!=

(

const ACE_Unbounded_List_Iterator< T > &

)

const

Definition at line 364 of file Naming_Service_Container.cpp.

References ACE_Unbounded_List_Iterator< T >::current_, and ACE_Unbounded_List_Iterator< T >::set_.

{
  //ACE_TRACE ("ACE_Unbounded_List_Iterator<T>::operator!=");
  return (this->set_ != rhs.set_ || this->current_ != rhs.current_);
}

template<class T>

ACE_Unbounded_List_Iterator< T > & ACE_Unbounded_List_Iterator< T >::operator++

(

void

)

Prefix advance.

Definition at line 333 of file Naming_Service_Container.cpp.

References ACE_Unbounded_List_Iterator< T >::advance().

{
  // ACE_TRACE ("ACE_Unbounded_List_Iterator<T>::operator++ (void)");

  // prefix operator

  this->advance ();
  return *this;
}

template<class T>

ACE_Unbounded_List_Iterator< T > ACE_Unbounded_List_Iterator< T >::operator++

(

int

)

Postfix advance.

Definition at line 321 of file Naming_Service_Container.cpp.

References ACE_Unbounded_List_Iterator< T >::advance().

{
  //ACE_TRACE ("ACE_Unbounded_List_Iterator<T>::operator++ (int)");
  ACE_Unbounded_List_Iterator<T> retv (*this);

  // postfix operator

  this->advance ();
  return retv;
}

template<class T>

bool ACE_Unbounded_List_Iterator< T >::operator==

(

const ACE_Unbounded_List_Iterator< T > &

)

const

Check if two iterators point to the same position.

Definition at line 357 of file Naming_Service_Container.cpp.

References ACE_Unbounded_List_Iterator< T >::current_, and ACE_Unbounded_List_Iterator< T >::set_.

{
  //ACE_TRACE ("ACE_Unbounded_List_Iterator<T>::operator==");
  return (this->set_ == rhs.set_ && this->current_ == rhs.current_);
}

---

Member Data Documentation

template<class T>

ACE_Unbounded_List_Iterator< T >::ACE_ALLOC_HOOK_DECLARE

Declare the dynamic allocation hooks.

Definition at line 118 of file Naming_Service_Container.h.

template<class T>

ACE_NS_Node<T>* ACE_Unbounded_List_Iterator< T >::current_ [private]

Pointer to the current node in the iteration.

Definition at line 123 of file Naming_Service_Container.h.

Referenced by ACE_Unbounded_List_Iterator< T >::advance(), ACE_Unbounded_List_Iterator< T >::done(), ACE_Unbounded_List_Iterator< T >::first(), ACE_Unbounded_List_Iterator< T >::next(), ACE_Unbounded_List_Iterator< T >::operator!=(), and ACE_Unbounded_List_Iterator< T >::operator==().

template<class T>

ACE_Unbounded_List<T>* ACE_Unbounded_List_Iterator< T >::set_ [private]

Pointer to the set we're iterating over.

Definition at line 126 of file Naming_Service_Container.h.

Referenced by ACE_Unbounded_List_Iterator< T >::advance(), ACE_Unbounded_List_Iterator< T >::done(), ACE_Unbounded_List_Iterator< T >::first(), ACE_Unbounded_List_Iterator< T >::operator!=(), and ACE_Unbounded_List_Iterator< T >::operator==().

---

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

• Naming_Service_Container.h
• Naming_Service_Container.cpp

---