#include <Timer_Heap_T.h>
Inheritance diagram for ACE_Timer_Heap_Iterator_T< TYPE, FUNCTOR, ACE_LOCK >:
Public Methods | |
ACE_Timer_Heap_Iterator_T (ACE_Timer_Heap_T< TYPE, FUNCTOR, ACE_LOCK > &) | |
Constructor. | |
~ACE_Timer_Heap_Iterator_T (void) | |
Destructor. | |
virtual void | first (void) |
Positions the iterator at the earliest node in the Timer Queue. | |
virtual void | next (void) |
Positions the iterator at the next node in the Timer Queue. | |
virtual int | isdone (void) const |
Returns true when there are no more nodes in the sequence. | |
virtual ACE_Timer_Node_T< TYPE > * | item (void) |
Returns the node at the current position in the sequence. | |
Protected Attributes | |
ACE_Timer_Heap_T< TYPE, FUNCTOR, ACE_LOCK > & | timer_heap_ |
Pointer to the <ACE_Timer_Heap> that we are iterating over. | |
size_t | position_ |
Position in the array where the iterator is at. |
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.
Implements ACE_Timer_Queue_Iterator_T< TYPE, FUNCTOR, ACE_LOCK >. |
|
Returns true when there are no more nodes in the sequence.
Implements ACE_Timer_Queue_Iterator_T< TYPE, FUNCTOR, ACE_LOCK >. |
|
Returns the node at the current position in the sequence.
Implements ACE_Timer_Queue_Iterator_T< TYPE, FUNCTOR, ACE_LOCK >. |
|
Positions the iterator at the next node in the Timer Queue.
Implements ACE_Timer_Queue_Iterator_T< TYPE, FUNCTOR, ACE_LOCK >. |
|
Position in the array where the iterator is at.
|
|
Pointer to the <ACE_Timer_Heap> that we are iterating over.
|