#include <Timer_Heap_T.h>
Inheritance diagram for ACE_Timer_Heap_Iterator_T:


Public Methods | |
| ACE_Timer_Heap_Iterator_T (ACE_Timer_Heap_T< TYPE, FUNCTOR, ACE_LOCK > &) | |
| Constructor. More... | |
| ~ACE_Timer_Heap_Iterator_T (void) | |
| Destructor. More... | |
| virtual void | first (void) |
| Positions the iterator at the earliest node in the Timer Queue. More... | |
| virtual void | next (void) |
| Positions the iterator at the next node in the Timer Queue. More... | |
| virtual int | isdone (void) const |
| Returns true when there are no more nodes in the sequence. More... | |
| virtual ACE_Timer_Node_T< TYPE > * | item (void) |
| Returns the node at the current position in the sequence. More... | |
Protected Attributes | |
| ACE_Timer_Heap_T< TYPE, FUNCTOR, ACE_LOCK > & | timer_heap_ |
| Pointer to the <ACE_Timer_Heap> that we are iterating over. More... | |
| size_t | position_ |
| Position in the array where the iterator is at. More... | |
This is a generic iterator that can be used to visit every node of a timer queue. Be aware that it doesn't transverse in the order of timeout values.
|
||||||||||
|
Constructor.
|
|
||||||||||
|
Destructor.
|
|
||||||||||
|
Positions the iterator at the earliest node in the Timer Queue.
Reimplemented from ACE_Timer_Queue_Iterator_T. |
|
||||||||||
|
Returns true when there are no more nodes in the sequence.
Reimplemented from ACE_Timer_Queue_Iterator_T. |
|
||||||||||
|
Returns the node at the current position in the sequence.
Reimplemented from ACE_Timer_Queue_Iterator_T. |
|
||||||||||
|
Positions the iterator at the next node in the Timer Queue.
Reimplemented from ACE_Timer_Queue_Iterator_T. |
|
|||||
|
Position in the array where the iterator is at.
|
|
|||||
|
Pointer to the <ACE_Timer_Heap> that we are iterating over.
|
1.2.13.1 written by Dimitri van Heesch,
© 1997-2001