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

#include <Unbounded_Queue.h>

Collaboration diagram for ACE_Unbounded_Queue_Iterator:

[legend]

Public Member Functions
	ACE_Unbounded_Queue_Iterator (ACE_Unbounded_Queue< T > &q, 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. 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...

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

Detailed Description

Implement an iterator over an unbounded queue.

Constructor & Destructor Documentation

◆ ACE_Unbounded_Queue_Iterator()

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

Member Function Documentation

◆ advance()

int ACE_Unbounded_Queue_Iterator::advance ( void )

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

◆ done()

int ACE_Unbounded_Queue_Iterator::done ( void ) const

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

◆ dump()

void ACE_Unbounded_Queue_Iterator::dump ( void ) const

Dump the state of an object.

◆ first()

int ACE_Unbounded_Queue_Iterator::first ( void )

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

◆ next()

int ACE_Unbounded_Queue_Iterator::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

ACE_Unbounded_Queue_Iterator::ACE_ALLOC_HOOK_DECLARE

Declare the dynamic allocation hooks.

◆ current_

ACE_Node<T>* ACE_Unbounded_Queue_Iterator::current_

private

Pointer to the current node in the iteration.

◆ queue_

ACE_Unbounded_Queue<T>& ACE_Unbounded_Queue_Iterator::queue_