#include <Timer_Wheel_T.h>
Inheritance diagram for ACE_Timer_Wheel_Iterator_T:
Public Methods | |
ACE_Timer_Wheel_Iterator_T (ACE_Timer_Wheel_T< TYPE, FUNCTOR, ACE_LOCK > &) | |
Constructor. More... | |
~ACE_Timer_Wheel_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_Wheel_T< TYPE, FUNCTOR, ACE_LOCK > & | timer_wheel_ |
Pointer to the <ACE_Timer_List> that we are iterating over. More... | |
size_t | pos_ |
Current position in the timing wheel. More... | |
ACE_Timer_Node_T< TYPE > * | list_item_ |
Pointer to the position in the the <pos_>th list. 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. pos_ will be set to the position of this entry and list_item_ will point to the first entry in that position. Since this is an iterator, If the wheel is empty, pos_ will be equal timer_wheel_.wheel_size_ and list_item_ would be 0. 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. |
|
Pointer to the position in the the <pos_>th list.
|
|
Current position in the timing wheel.
|
|
Pointer to the <ACE_Timer_List> that we are iterating over.
|