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

ACE_Unbounded_Queue_Iterator Class Template Reference

Implement an iterator over an unbounded queue. More...

#include <Unbounded_Queue.h>

Collaboration diagram for ACE_Unbounded_Queue_Iterator:

Collaboration graph
[legend]
List of all members.

Public Methods

 ACE_Unbounded_Queue_Iterator (ACE_Unbounded_Queue<T> &q, int end = 0)
int next (T *&next_item)
 Pass back the <next_item> that hasn't been seen in the queue. Returns 0 when all items have been seen, else 1.

int advance (void)
 Move forward by one element in the set. Returns 0 when all the items in the queue have been seen, else 1.

int first (void)
 Move to the first element in the queue. Returns 0 if the queue is empty, else 1.

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_Queue<T>& queue_
 Pointer to the queue we're iterating over.


Detailed Description

template<class T> template class ACE_Unbounded_Queue_Iterator

Implement an iterator over an unbounded queue.


Constructor & Destructor Documentation

template<classT>
ACE_Unbounded_Queue_Iterator< T >::ACE_Unbounded_Queue_Iterator<T> ( ACE_Unbounded_Queue< T >& q,
int end = 0 )
 


Member Function Documentation

template<classT>
int ACE_Unbounded_Queue_Iterator<T>::advance ( void )
 

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

template<classT>
int ACE_Unbounded_Queue_Iterator<T>::done ( void ) const
 

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

template<classT>
void ACE_Unbounded_Queue_Iterator<T>::dump ( void ) const
 

Dump the state of an object.

template<classT>
int ACE_Unbounded_Queue_Iterator<T>::first ( void )
 

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

template<classT>
int ACE_Unbounded_Queue_Iterator<T>::next ( T *& next_item )
 

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


Member Data Documentation

template<classT>
ACE_Unbounded_Queue_Iterator<T>::ACE_ALLOC_HOOK_DECLARE
 

Declare the dynamic allocation hooks.

template<classT>
ACE_Node< T >* ACE_Unbounded_Queue_Iterator<T>::current_ [private]
 

Pointer to the current node in the iteration.

template<classT>
ACE_Unbounded_Queue< T >& ACE_Unbounded_Queue_Iterator<T>::queue_ [private]
 

Pointer to the queue we're iterating over.


The documentation for this class was generated from the following files:
Generated at Wed Nov 21 10:34:36 2001 for ACE by doxygen1.2.3 written by Dimitri van Heesch, © 1997-2000