#include <Unbounded_Queue.h>
Public Methods | |
| ACE_Unbounded_Queue_Const_Iterator (const 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. | |
| 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. | |
| const ACE_Unbounded_Queue< T > & | queue_ |
| Pointer to the queue we're iterating over. | |
|
||||||||||||||||
|
|
|
||||||||||
|
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.18