1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
.TH ACE_Timer_List_Iterator_T 3 "1 Dec 2001" "ACE" \" -*- nroff -*-
.ad l
.nh
.SH NAME
ACE_Timer_List_Iterator_T \- Iterates over an .
.SH SYNOPSIS
.br
.PP
\fC#include <Timer_List_T.h>\fR
.PP
Inherits \fBACE_Timer_Queue_Iterator_T< TYPE,FUNCTOR,ACE_LOCK >\fR.
.PP
.SS Public Methods
.in +1c
.ti -1c
.RI "\fBACE_Timer_List_Iterator_T\fR (\fBACE_Timer_List_T\fR<TYPE, FUNCTOR, ACE_LOCK> &)"
.br
.RI "\fIConstructor.\fR"
.ti -1c
.RI "\fB~ACE_Timer_List_Iterator_T\fR (void)"
.br
.RI "\fIDestructor.\fR"
.ti -1c
.RI "virtual void \fBfirst\fR (void)"
.br
.RI "\fIPositions the iterator at the earliest node in the Timer Queue.\fR"
.ti -1c
.RI "virtual void \fBnext\fR (void)"
.br
.RI "\fIPositions the iterator at the next node in the Timer Queue.\fR"
.ti -1c
.RI "virtual int \fBisdone\fR (void) const"
.br
.RI "\fIReturns true when there are no more nodes in the sequence.\fR"
.ti -1c
.RI "virtual \fBACE_Timer_Node_T\fR<TYPE>* \fBitem\fR (void)"
.br
.RI "\fIReturns the node at the current position in the sequence.\fR"
.in -1c
.SS Protected Attributes
.in +1c
.ti -1c
.RI "\fBACE_Timer_List_T\fR<TYPE, FUNCTOR, ACE_LOCK>& \fBtimer_list_\fR"
.br
.RI "\fIPointer to the that we are iterating over.\fR"
.ti -1c
.RI "\fBACE_Timer_Node_T\fR<TYPE>* \fBposition_\fR"
.br
.in -1c
.SH DETAILED DESCRIPTION
.PP
.SS template<class TYPE, class FUNCTOR, class ACE_LOCK> template class ACE_Timer_List_Iterator_T
Iterates over an .
.PP
.PP
This is a generic iterator that can be used to visit every node of a timer queue.
.PP
.SH CONSTRUCTOR & DESTRUCTOR DOCUMENTATION
.PP
.SS template<classTYPE, classFUNCTOR, classACE_LOCK> ACE_Timer_List_Iterator_T<TYPE, FUNCTOR, ACE_LOCK>::ACE_Timer_List_Iterator_T<TYPE, FUNCTOR, ACE_LOCK> (\fBACE_Timer_List_T\fR< TYPE,FUNCTOR,ACE_LOCK >&)
.PP
Constructor.
.PP
.SS template<classTYPE, classFUNCTOR, classACE_LOCK> ACE_Timer_List_Iterator_T<TYPE, FUNCTOR, ACE_LOCK>::~ACE_Timer_List_Iterator_T<TYPE, FUNCTOR, ACE_LOCK> (void)
.PP
Destructor.
.PP
.SH MEMBER FUNCTION DOCUMENTATION
.PP
.SS template<classTYPE, classFUNCTOR, classACE_LOCK> void ACE_Timer_List_Iterator_T<TYPE, FUNCTOR, ACE_LOCK>::first (void)\fC [virtual]\fR
.PP
Positions the iterator at the earliest node in the Timer Queue.
.PP
Reimplemented from \fBACE_Timer_Queue_Iterator_T\fR.
.SS template<classTYPE, classFUNCTOR, classACE_LOCK> int ACE_Timer_List_Iterator_T<TYPE, FUNCTOR, ACE_LOCK>::isdone (void) const\fC [virtual]\fR
.PP
Returns true when there are no more nodes in the sequence.
.PP
Reimplemented from \fBACE_Timer_Queue_Iterator_T\fR.
.SS template<classTYPE, classFUNCTOR, classACE_LOCK> \fBACE_Timer_Node_T\fR< TYPE >* ACE_Timer_List_Iterator_T<TYPE, FUNCTOR, ACE_LOCK>::item (void)\fC [virtual]\fR
.PP
Returns the node at the current position in the sequence.
.PP
Reimplemented from \fBACE_Timer_Queue_Iterator_T\fR.
.SS template<classTYPE, classFUNCTOR, classACE_LOCK> void ACE_Timer_List_Iterator_T<TYPE, FUNCTOR, ACE_LOCK>::next (void)\fC [virtual]\fR
.PP
Positions the iterator at the next node in the Timer Queue.
.PP
Reimplemented from \fBACE_Timer_Queue_Iterator_T\fR.
.SH MEMBER DATA DOCUMENTATION
.PP
.SS template<classTYPE, classFUNCTOR, classACE_LOCK> \fBACE_Timer_Node_T\fR< TYPE >* ACE_Timer_List_Iterator_T<TYPE, FUNCTOR, ACE_LOCK>::position_\fC [protected]\fR
.PP
.SS template<classTYPE, classFUNCTOR, classACE_LOCK> \fBACE_Timer_List_T\fR< TYPE,FUNCTOR,ACE_LOCK >& ACE_Timer_List_Iterator_T<TYPE, FUNCTOR, ACE_LOCK>::timer_list_\fC [protected]\fR
.PP
Pointer to the that we are iterating over.
.PP
.SH AUTHOR
.PP
Generated automatically by Doxygen for ACE from the source code.
|
