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
|
/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: continuouskeytimeactivitybase.cxx,v $
*
* $Revision: 1.6 $
*
* last change: $Author: obo $ $Date: 2006-09-17 08:32:19 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 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
*
************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_slideshow.hxx"
// must be first
#include <canvas/debug.hxx>
#include <canvas/verbosetrace.hxx>
#include <continuouskeytimeactivitybase.hxx>
#include <algorithm>
#include <iterator>
namespace presentation
{
namespace internal
{
ContinuousKeyTimeActivityBase::ContinuousKeyTimeActivityBase( const ActivityParameters& rParms ) :
SimpleContinuousActivityBase( rParms ),
maKeyTimes( rParms.maDiscreteTimes ),
mnLastIndex( 0 )
{
ENSURE_AND_THROW( maKeyTimes.size() > 1,
"ContinuousKeyTimeActivityBase::ContinuousKeyTimeActivityBase(): key times vector must have two entries or more" );
#ifdef DBG_UTIL
// check parameters: rKeyTimes must be sorted in
// ascending order, and contain values only from the range
// [0,1]
for( ::std::size_t i=1, len=maKeyTimes.size(); i<len; ++i )
{
if( maKeyTimes[i] < 0.0 ||
maKeyTimes[i] > 1.0 ||
maKeyTimes[i-1] < 0.0 ||
maKeyTimes[i-1] > 1.0 )
{
ENSURE_AND_THROW( false, "ContinuousKeyTimeActivityBase::ContinuousKeyTimeActivityBase(): time values not within [0,1] range!" );
}
if( maKeyTimes[i-1] > maKeyTimes[i] )
{
ENSURE_AND_THROW( false, "ContinuousKeyTimeActivityBase::ContinuousKeyTimeActivityBase(): time vector is not sorted in ascending order!" );
}
}
// TODO(E2): check this also in production code?
#endif
}
void ContinuousKeyTimeActivityBase::simplePerform( double nSimpleTime,
sal_uInt32 nRepeatCount ) const
{
// calc simple time from global time - sweep through the
// array multiple times for repeated animations (according to
// SMIL spec).
const double nT( calcAcceleratedTime( nSimpleTime ) );
// determine position within key times vector from
// current simple time
// shortcut: cached value still okay?
if( maKeyTimes[ mnLastIndex ] < nT ||
maKeyTimes[ mnLastIndex+1 ] >= nT )
{
// nope, find new index
mnLastIndex = ::std::min< ::std::ptrdiff_t >(
maKeyTimes.size()-2,
// range is ensured by max below
::std::max< ::std::ptrdiff_t >(
0,
::std::distance( maKeyTimes.begin(),
::std::lower_bound( maKeyTimes.begin(),
maKeyTimes.end(),
nT ) ) - 1 ) );
}
OSL_ENSURE( mnLastIndex+1 < maKeyTimes.size(),
"ContinuousKeyTimeActivityBase::simplePerform(): index out of range" );
// mnLastIndex is now valid and up-to-date
// calc current simple time, as a fractional value ([0,1] range).
// I.e. the relative position between the two index times.
const double nCurrFractionalSimplTime( (nT - maKeyTimes[ mnLastIndex ]) /
(maKeyTimes[ mnLastIndex+1 ] - maKeyTimes[ mnLastIndex ]) );
perform(
mnLastIndex,
nCurrFractionalSimplTime,
nRepeatCount );
}
}
}
|
