Main Page   Class Hierarchy   Alphabetical List   Compound List   File List   Compound Members   File Members   Related Pages  

ACE_Timer_Queue_Iterator_T Class Template Reference

Generic interface for iterating over a subclass of <ACE_Timer_Queue>. More...

#include <Timer_Queue_T.h>

Inheritance diagram for ACE_Timer_Queue_Iterator_T:

Inheritance graph
[legend]
List of all members.

Public Methods

 ACE_Timer_Queue_Iterator_T (void)
 Constructor. More...

virtual ~ACE_Timer_Queue_Iterator_T (void)
 Destructor. More...

virtual void first (void)=0
 Positions the iterator at the earliest node in the Timer Queue. More...

virtual void next (void)=0
 Positions the iterator at the next node in the Timer Queue. More...

virtual int isdone (void) const=0
 Returns true when there are no more nodes in the sequence. More...

virtual ACE_Timer_Node_T<
TYPE > * 
item (void)=0
 Returns the node at the current position in the sequence. More...


Detailed Description

template<class TYPE, class FUNCTOR, class ACE_LOCK>
class ACE_Timer_Queue_Iterator_T< TYPE, FUNCTOR, ACE_LOCK >

Generic interface for iterating over a subclass of <ACE_Timer_Queue>.

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.

Definition at line 168 of file Timer_Queue_T.h.


Constructor & Destructor Documentation

template<class TYPE, class FUNCTOR, class ACE_LOCK>
ACE_Timer_Queue_Iterator_T< TYPE, FUNCTOR, ACE_LOCK >::ACE_Timer_Queue_Iterator_T void   
 

Constructor.

Definition at line 51 of file Timer_Queue_T.cpp.

00052 {
00053 }

template<class TYPE, class FUNCTOR, class ACE_LOCK>
ACE_Timer_Queue_Iterator_T< TYPE, FUNCTOR, ACE_LOCK >::~ACE_Timer_Queue_Iterator_T void    [virtual]
 

Destructor.

Definition at line 56 of file Timer_Queue_T.cpp.

00057 {
00058 }


Member Function Documentation

template<class TYPE, class FUNCTOR, class ACE_LOCK>
virtual void ACE_Timer_Queue_Iterator_T< TYPE, FUNCTOR, ACE_LOCK >::first void    [pure virtual]
 

Positions the iterator at the earliest node in the Timer Queue.

Implemented in ACE_Timer_Hash_Iterator_T.

template<class TYPE, class FUNCTOR, class ACE_LOCK>
virtual int ACE_Timer_Queue_Iterator_T< TYPE, FUNCTOR, ACE_LOCK >::isdone void    const [pure virtual]
 

Returns true when there are no more nodes in the sequence.

Implemented in ACE_Timer_Hash_Iterator_T.

template<class TYPE, class FUNCTOR, class ACE_LOCK>
virtual ACE_Timer_Node_T<TYPE>* ACE_Timer_Queue_Iterator_T< TYPE, FUNCTOR, ACE_LOCK >::item void    [pure virtual]
 

Returns the node at the current position in the sequence.

Implemented in ACE_Timer_Hash_Iterator_T.

template<class TYPE, class FUNCTOR, class ACE_LOCK>
virtual void ACE_Timer_Queue_Iterator_T< TYPE, FUNCTOR, ACE_LOCK >::next void    [pure virtual]
 

Positions the iterator at the next node in the Timer Queue.

Implemented in ACE_Timer_Hash_Iterator_T.


The documentation for this class was generated from the following files:
Generated on Mon Jun 16 12:58:05 2003 for ACE by doxygen1.2.14 written by Dimitri van Heesch, © 1997-2002