ACE_Unbounded_Queue_Const_Iterator< T > Class Template Reference

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

#include <Unbounded_Queue.h>

Public Member Functions
	ACE_Unbounded_Queue_Const_Iterator (const ACE_Unbounded_Queue< T > &q, int end=0)
int	next (T *&next_item)
int	advance ()
int	first ()
int	done () const
	Returns 1 when all items have been seen, else 0.
void	dump () 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.
const ACE_Unbounded_Queue< T > &	queue_
	Pointer to the queue we're iterating over.

Detailed Description

template<class T>
class ACE_Unbounded_Queue_Const_Iterator< T >

Implement an iterator over an const unbounded queue.

Constructor & Destructor Documentation

ACE_Unbounded_Queue_Const_Iterator()

template<class T >

ACE_Unbounded_Queue_Const_Iterator< T >::ACE_Unbounded_Queue_Const_Iterator	(	const ACE_Unbounded_Queue< T > &	q,
		int	end = 0 )

Member Function Documentation

advance()

template<class T >

int ACE_Unbounded_Queue_Const_Iterator< T >::advance

(

)

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

done()

template<class T >

int ACE_Unbounded_Queue_Const_Iterator< T >::done

(

)

const

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

dump()

template<class T >

void ACE_Unbounded_Queue_Const_Iterator< T >::dump

(

)

const

Dump the state of an object.

first()

template<class T >

int ACE_Unbounded_Queue_Const_Iterator< T >::first

(

)

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

next()

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.

Member Data Documentation

ACE_ALLOC_HOOK_DECLARE

template<class T >

ACE_Unbounded_Queue_Const_Iterator< T >::ACE_ALLOC_HOOK_DECLARE

Declare the dynamic allocation hooks.

current_

template<class T >

ACE_Node<T>* ACE_Unbounded_Queue_Const_Iterator< T >::current_

private

Pointer to the current node in the iteration.

queue_

template<class T >

const ACE_Unbounded_Queue<T>& ACE_Unbounded_Queue_Const_Iterator< T >::queue_

private

Pointer to the queue we're iterating over.

---

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

• Node.h
• Unbounded_Queue.h
• Unbounded_Queue.cpp