ACE_Unbounded_Stack_Iterator< T > Class Template Reference

Implement an iterator over an unbounded Stack. More...

#include <Containers_T.h>

List of all members.

Public Member Functions
	ACE_Unbounded_Stack_Iterator (ACE_Unbounded_Stack< T > &stack)
	Move to the first element in the {stack}.
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_Node< T > *	current_
	Pointer to the current node in the iteration.
ACE_Unbounded_Stack< T > &	stack_
	Pointer to the Stack we're iterating over.

---

Detailed Description

template<class T>
class ACE_Unbounded_Stack_Iterator< T >

Implement an iterator over an unbounded Stack.

Definition at line 508 of file Containers_T.h.

---

Constructor & Destructor Documentation

template<class T> ACE_Unbounded_Stack_Iterator< T >::ACE_Unbounded_Stack_Iterator (  ACE_Unbounded_Stack< T > &  stack  )

Move to the first element in the {stack}. Definition at line 1469 of file Containers_T.cpp. : current_ (q.head_->next_), stack_ (q) { // ACE_TRACE ("ACE_Unbounded_Stack_Iterator<T>::ACE_Unbounded_Stack_Iterator"); }

---

Member Function Documentation

template<class T> int ACE_Unbounded_Stack_Iterator< T >::advance (  void   )

Move forward by one element in the Stack. Returns 0 when all the items in the Stack have been seen, else 1. Definition at line 1477 of file Containers_T.cpp. { // ACE_TRACE ("ACE_Unbounded_Stack_Iterator<T>::advance"); this->current_ = this->current_->next_; return this->current_ != this->stack_.head_; }

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

Returns 1 when all items have been seen, else 0. Definition at line 1493 of file Containers_T.cpp. References ACE_TRACE. { ACE_TRACE ("ACE_Unbounded_Stack_Iterator<T>::done"); return this->current_ == this->stack_.head_; }

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

Dump the state of an object. Definition at line 1461 of file Containers_T.cpp. { #if defined (ACE_HAS_DUMP) // ACE_TRACE ("ACE_Unbounded_Stack_Iterator<T>::dump"); #endif /* ACE_HAS_DUMP */ }

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

Move to the first element in the Stack. Returns 0 if the Stack is empty, else 1. Definition at line 1485 of file Containers_T.cpp. { // ACE_TRACE ("ACE_Unbounded_Stack_Iterator<T>::first"); this->current_ = this->stack_.head_->next_; return this->current_ != this->stack_.head_; }

template<class T> int ACE_Unbounded_Stack_Iterator< T >::next (  T *&  next_item  )

Pass back the next_item that hasn't been seen in the Stack. Returns 0 when all items have been seen, else 1. Definition at line 1501 of file Containers_T.cpp. { // ACE_TRACE ("ACE_Unbounded_Stack_Iterator<T>::next"); if (this->current_ == this->stack_.head_) return 0; else { item = &this->current_->item_; return 1; } }

---

Member Data Documentation

template<class T> ACE_Unbounded_Stack_Iterator< T >::ACE_ALLOC_HOOK_DECLARE

Declare the dynamic allocation hooks. Definition at line 536 of file Containers_T.h.

template<class T> ACE_Node<T>* ACE_Unbounded_Stack_Iterator< T >::current_ [private]

Pointer to the current node in the iteration. Definition at line 540 of file Containers_T.h.

template<class T> ACE_Unbounded_Stack<T>& ACE_Unbounded_Stack_Iterator< T >::stack_ [private]

Pointer to the Stack we're iterating over. Definition at line 543 of file Containers_T.h.

---

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

• Containers_T.h
• Containers_T.cpp

---