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

ACE_Unbounded_Queue_Const_Iterator Class Template Reference

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

#include <Unbounded_Queue.h>

Collaboration diagram for ACE_Unbounded_Queue_Const_Iterator:

Collaboration graph
[legend]
List of all members.

Public Methods

 ACE_Unbounded_Queue_Const_Iterator (const 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. More...

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. More...

int first (void)
 Move to the first element in the queue. Returns 0 if the queue 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_Node< T > * current_
 Pointer to the current node in the iteration. More...

const ACE_Unbounded_Queue<
T > & 
queue_
 Pointer to the queue we're iterating over. More...


Detailed Description

template<class T>
class ACE_Unbounded_Queue_Const_Iterator< T >

Implement an iterator over an const unbounded queue.

Definition at line 80 of file Unbounded_Queue.h.


Constructor & Destructor Documentation

template<class T>
ACE_Unbounded_Queue_Const_Iterator< T >::ACE_Unbounded_Queue_Const_Iterator const ACE_Unbounded_Queue< T > &    q,
int    end = 0
 

Definition at line 329 of file Unbounded_Queue.cpp.

00330   : current_ (end == 0 ? q.head_->next_ : q.head_ ),
00331     queue_ (q)
00332 {
00333   // ACE_TRACE ("ACE_Unbounded_Queue_Const_Iterator<T>::ACE_Unbounded_Queue_Const_Iterator");
00334 }


Member Function Documentation

template<class T>
int ACE_Unbounded_Queue_Const_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.

Definition at line 337 of file Unbounded_Queue.cpp.

References current_, and queue_.

00338 {
00339   // ACE_TRACE ("ACE_Unbounded_Queue_Const_Iterator<T>::advance");
00340   this->current_ = this->current_->next_;
00341   return this->current_ != this->queue_.head_;
00342 }

template<class T>
int ACE_Unbounded_Queue_Const_Iterator< T >::done void    const
 

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

Definition at line 353 of file Unbounded_Queue.cpp.

References ACE_TRACE, current_, and queue_.

00354 {
00355   ACE_TRACE ("ACE_Unbounded_Queue_Const_Iterator<T>::done");
00356 
00357   return this->current_ == this->queue_.head_;
00358 }

template<class T>
void ACE_Unbounded_Queue_Const_Iterator< T >::dump void    const
 

Dump the state of an object.

Definition at line 323 of file Unbounded_Queue.cpp.

00324 {
00325   // ACE_TRACE ("ACE_Unbounded_Queue_Const_Iterator<T>::dump");
00326 }

template<class T>
int ACE_Unbounded_Queue_Const_Iterator< T >::first void   
 

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

Definition at line 345 of file Unbounded_Queue.cpp.

References current_, and queue_.

00346 {
00347   // ACE_TRACE ("ACE_Unbounded_Queue_Const_Iterator<T>::first");
00348   this->current_ = this->queue_.head_->next_;
00349   return this->current_ != this->queue_.head_;
00350 }

template<class T>
int ACE_Unbounded_Queue_Const_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.

Definition at line 361 of file Unbounded_Queue.cpp.

References current_, and queue_.

00362 {
00363   // ACE_TRACE ("ACE_Unbounded_Queue_Const_Iterator<T>::next");
00364   if (this->current_ == this->queue_.head_)
00365     return 0;
00366   else
00367     {
00368       item = &this->current_->item_;
00369       return 1;
00370     }
00371 }


Member Data Documentation

template<class T>
ACE_Unbounded_Queue_Const_Iterator::ACE_ALLOC_HOOK_DECLARE
 

Declare the dynamic allocation hooks.

Definition at line 107 of file Unbounded_Queue.h.

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

Pointer to the current node in the iteration.

Definition at line 111 of file Unbounded_Queue.h.

Referenced by advance, done, first, and next.

template<class T>
const ACE_Unbounded_Queue<T>& ACE_Unbounded_Queue_Const_Iterator::queue_ [private]
 

Pointer to the queue we're iterating over.

Definition at line 114 of file Unbounded_Queue.h.

Referenced by advance, done, first, and next.


The documentation for this class was generated from the following files:
Generated on Mon Jun 16 12:58:51 2003 for ACE by doxygen1.2.14 written by Dimitri van Heesch, © 1997-2002