#include <Unbounded_Queue.h>
Collaboration diagram for ACE_Unbounded_Queue_Iterator:

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. 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... | |
| ACE_Unbounded_Queue< T > & | queue_ |
| Pointer to the queue we're iterating over. More... | |
|
||||||||||||||||
|
|
|
||||||||||
|
Move forward by one element in the set. Returns 0 when all the items in the queue have been seen, else 1.
|
|
||||||||||
|
Returns 1 when all items have been seen, else 0.
|
|
||||||||||
|
Dump the state of an object.
|
|
||||||||||
|
Move to the first element in the queue. Returns 0 if the queue is empty, else 1.
|
|
||||||||||
|
Pass back the <next_item> that hasn't been seen in the queue. Returns 0 when all items have been seen, else 1.
|
|
|||||
|
Declare the dynamic allocation hooks.
|
|
|||||
|
Pointer to the current node in the iteration.
|
|
|||||
|
Pointer to the queue we're iterating over.
|
1.2.13.1 written by Dimitri van Heesch,
© 1997-2001