#include <Timer_Queue_T.h>
Inheritance diagram for ACE_Timer_Queue_Iterator_T
Public Methods | |
ACE_Timer_Queue_Iterator_T (void) | |
Constructor. | |
virtual | ~ACE_Timer_Queue_Iterator_T (void) |
Destructor. | |
virtual void | first (void) = 0 |
Positions the iterator at the earliest node in the Timer Queue. | |
virtual void | next (void) = 0 |
Positions the iterator at the next node in the Timer Queue. | |
virtual int | isdone (void) const = 0 |
Returns true when there are no more nodes in the sequence. | |
virtual ACE_Timer_Node_T<TYPE>* | item (void) = 0 |
Returns the node at the current position in the sequence. |
This is a generic iterator that can be used to visit every node of a timer queue. Be aware that it isn't guaranteed that the transversal will be in order of timeout values.
|
Constructor.
|
|
Destructor.
|
|
Positions the iterator at the earliest node in the Timer Queue.
Reimplemented in ACE_Timer_Hash_Iterator_T, ACE_Timer_Heap_Iterator_T, ACE_Timer_List_Iterator_T, and ACE_Timer_Wheel_Iterator_T. |
|
Returns true when there are no more nodes in the sequence.
Reimplemented in ACE_Timer_Hash_Iterator_T, ACE_Timer_Heap_Iterator_T, ACE_Timer_List_Iterator_T, and ACE_Timer_Wheel_Iterator_T. |
|
Returns the node at the current position in the sequence.
Reimplemented in ACE_Timer_Hash_Iterator_T, ACE_Timer_Heap_Iterator_T, ACE_Timer_List_Iterator_T, and ACE_Timer_Wheel_Iterator_T. |
|
Positions the iterator at the next node in the Timer Queue.
Reimplemented in ACE_Timer_Hash_Iterator_T, ACE_Timer_Heap_Iterator_T, ACE_Timer_List_Iterator_T, and ACE_Timer_Wheel_Iterator_T. |