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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
|
/*************************************************************************
*
* $RCSfile: discreteactivitybase.cxx,v $
*
* $Revision: 1.3 $
*
* last change: $Author: vg $ $Date: 2005-03-10 13:48:38 $
*
* The Contents of this file are made available subject to the terms of
* either of the following licenses
*
* - GNU Lesser General Public License Version 2.1
* - Sun Industry Standards Source License Version 1.1
*
* Sun Microsystems Inc., October, 2000
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2000 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
*
* Sun Industry Standards Source License Version 1.1
* =================================================
* The contents of this file are subject to the Sun Industry Standards
* Source License Version 1.1 (the "License"); You may not use this file
* except in compliance with the License. You may obtain a copy of the
* License at http://www.openoffice.org/license.html.
*
* Software provided under this License is provided on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
* WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
* MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
* See the License for the specific provisions governing your rights and
* obligations concerning the Software.
*
* The Initial Developer of the Original Code is: Sun Microsystems, Inc.
*
* Copyright: 2000 by Sun Microsystems, Inc.
*
* All Rights Reserved.
*
* Contributor(s): _______________________________________
*
*
************************************************************************/
// must be first
#include <canvas/debug.hxx>
#include <canvas/verbosetrace.hxx>
#include <discreteactivitybase.hxx>
namespace presentation
{
namespace internal
{
DiscreteActivityBase::DiscreteActivityBase( const ActivityParameters& rParms ) :
ActivityBase( rParms ),
mpWakeupEvent( rParms.mpWakeupEvent ),
maDiscreteTimes( rParms.maDiscreteTimes ),
mnSimpleDuration( rParms.mnMinDuration ),
mnCurrPerformCalls( 0 )
{
ENSURE_AND_THROW( mpWakeupEvent.get(),
"DiscreteActivityBase::DiscreteActivityBase(): Invalid wakeup event" );
ENSURE_AND_THROW( !maDiscreteTimes.empty(),
"DiscreteActivityBase::DiscreteActivityBase(): time vector is empty, why do you create me?" );
#ifdef DBG_UTIL
// check parameters: rDiscreteTimes must be sorted in
// ascending order, and contain values only from the range
// [0,1]
for( ::std::size_t i=1, len=maDiscreteTimes.size(); i<len; ++i )
{
if( maDiscreteTimes[i] < 0.0 ||
maDiscreteTimes[i] > 1.0 ||
maDiscreteTimes[i-1] < 0.0 ||
maDiscreteTimes[i-1] > 1.0 )
{
ENSURE_AND_THROW( false, "DiscreteActivityBase::DiscreteActivityBase(): time values not within [0,1] range!" );
}
if( maDiscreteTimes[i-1] > maDiscreteTimes[i] )
ENSURE_AND_THROW( false, "DiscreteActivityBase::DiscreteActivityBase(): time vector is not sorted in ascending order!" );
}
// TODO(E2): check this also in production code?
#endif
}
void DiscreteActivityBase::startAnimation()
{
// start timer on wakeup event
mpWakeupEvent->start();
}
sal_uInt32 DiscreteActivityBase::calcFrameIndex( sal_uInt32 nCurrCalls,
::std::size_t nVectorSize ) const
{
if( isAutoReverse() )
{
// every full repeat run consists of one
// forward and one backward traversal.
sal_uInt32 nFrameIndex( nCurrCalls % (2*nVectorSize) );
// nFrameIndex values >= nVectorSize belong to
// the backward traversal
if( nFrameIndex >= nVectorSize )
nFrameIndex = 2*nVectorSize - nFrameIndex; // invert sweep
return nFrameIndex;
}
else
{
return nCurrCalls % nVectorSize ;
}
}
sal_uInt32 DiscreteActivityBase::calcRepeatCount( sal_uInt32 nCurrCalls,
::std::size_t nVectorSize ) const
{
if( isAutoReverse() )
return nCurrCalls / (2*nVectorSize); // we've got 2 cycles per repeat
else
return nCurrCalls / nVectorSize;
}
bool DiscreteActivityBase::perform()
{
// call base class, for start() calls and end handling
if( !ActivityBase::perform() )
return false; // done, we're ended
const ::std::size_t nVectorSize( maDiscreteTimes.size() );
// actually perform something
// ==========================
// TODO(Q3): Refactor this mess
// call derived class with current frame index (modulo
// vector size, to cope with repeats)
perform( calcFrameIndex( mnCurrPerformCalls, nVectorSize ),
calcRepeatCount( mnCurrPerformCalls, nVectorSize ) );
// calc next index
++mnCurrPerformCalls;
// calc currently reached repeat count
double nCurrRepeat( (double)mnCurrPerformCalls / nVectorSize );
// if auto-reverse is specified, halve the
// effective repeat count, since we pass every
// repeat run twice: once forward, once backward.
if( isAutoReverse() )
nCurrRepeat /= 2.0;
// schedule next frame, if either repeat is indefinite
// (repeat forever), or we've not yet reached the requested
// repeat count
if( !isRepeatCountValid() ||
nCurrRepeat < getRepeatCount() )
{
// add wake-up event to queue (modulo
// vector size, to cope with repeats).
// repeat is handled locally, only apply acceleration/deceleration.
// Scale time vector with simple duration, offset with full repeat
// times.
//
// Somewhat condensed, the argument for setNextTimeout below could
// be written as
//
// mnSimpleDuration*(nFullRepeats + calcAcceleratedTime( currentRepeatTime )),
//
// with currentRepeatTime = maDiscreteTimes[ currentRepeatIndex ]
//
// Note that calcAcceleratedTime() is only applied to the current repeat's value,
// not to the total resulting time. This is in accordance with the SMIL spec.
//
mpWakeupEvent->setNextTimeout(
mnSimpleDuration*(
calcRepeatCount(
mnCurrPerformCalls,
nVectorSize ) +
calcAcceleratedTime(
maDiscreteTimes[
calcFrameIndex(
mnCurrPerformCalls,
nVectorSize ) ] ) ) );
getEventQueue().addEvent( mpWakeupEvent );
}
else
{
// release event reference (relation to wakeup event
// is circular!)
mpWakeupEvent.reset();
// done with this activity
endActivity();
}
return false; // remove from queue, will be added back by the wakeup event.
}
void DiscreteActivityBase::dispose()
{
// dispose event
if( mpWakeupEvent.get() )
mpWakeupEvent->dispose();
// release references
mpWakeupEvent.reset();
ActivityBase::dispose();
}
void DiscreteActivityBase::dequeued()
{
// ignored here, if we're still active. Discrete
// activities are dequeued after every perform() call,
// thus, the call is only significant when isActive() ==
// false.
if( !isActive() )
endAnimation();
}
}
}
|
