#include <Timer_Hash_T.h>
Inheritance diagram for ACE_Timer_Hash_Iterator_T< TYPE, FUNCTOR, ACE_LOCK, BUCKET >:


Public Member Functions | |
| ACE_Timer_Hash_Iterator_T (ACE_Timer_Hash_T< TYPE, FUNCTOR, ACE_LOCK, BUCKET > &) | |
| Constructor. | |
| 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_Hash_T< TYPE, FUNCTOR, ACE_LOCK, BUCKET > & | timer_hash_ |
| Pointer to the ACE_Timer_Hash that we are iterating over. | |
| size_t | position_ |
| Current position in <timer_hash_>'s table. | |
| ACE_Timer_Queue_Iterator_T< TYPE, ACE_Timer_Hash_Upcall< TYPE, FUNCTOR, ACE_LOCK >, ACE_Null_Mutex > * | iter_ |
| Current iterator used on <position>'s bucket. | |
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.
|
|
||||||||||
|
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 >. |
|
|||||
|
Current iterator used on <position>'s bucket.
|
|
|||||
|
Current position in <timer_hash_>'s table.
|
|
|||||
|
Pointer to the ACE_Timer_Hash that we are iterating over.
|
1.3.9.1