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
|
/*
* Copyright (c) 2013, Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "core/animation/TimingCalculations.h"
#include <gtest/gtest.h>
using namespace blink;
namespace {
TEST(AnimationTimingCalculationsTest, ActiveTime)
{
Timing timing;
// calculateActiveTime(activeDuration, fillMode, localTime, parentPhase, phase, timing)
// Before Phase
timing.startDelay = 10;
EXPECT_TRUE(isNull(calculateActiveTime(20, Timing::FillModeForwards, 0, AnimationNode::PhaseActive, AnimationNode::PhaseBefore, timing)));
EXPECT_TRUE(isNull(calculateActiveTime(20, Timing::FillModeNone, 0, AnimationNode::PhaseActive, AnimationNode::PhaseBefore, timing)));
EXPECT_EQ(0, calculateActiveTime(20, Timing::FillModeBackwards, 0, AnimationNode::PhaseActive, AnimationNode::PhaseBefore, timing));
EXPECT_EQ(0, calculateActiveTime(20, Timing::FillModeBoth, 0, AnimationNode::PhaseActive, AnimationNode::PhaseBefore, timing));
// Active Phase
timing.startDelay = 10;
// Active, and parent Before
EXPECT_TRUE(isNull(calculateActiveTime(20, Timing::FillModeNone, 15, AnimationNode::PhaseBefore, AnimationNode::PhaseActive, timing)));
EXPECT_TRUE(isNull(calculateActiveTime(20, Timing::FillModeForwards, 15, AnimationNode::PhaseBefore, AnimationNode::PhaseActive, timing)));
// Active, and parent After
EXPECT_TRUE(isNull(calculateActiveTime(20, Timing::FillModeNone, 15, AnimationNode::PhaseAfter, AnimationNode::PhaseActive, timing)));
EXPECT_TRUE(isNull(calculateActiveTime(20, Timing::FillModeBackwards, 15, AnimationNode::PhaseAfter, AnimationNode::PhaseActive, timing)));
// Active, and parent Active
EXPECT_EQ(5, calculateActiveTime(20, Timing::FillModeForwards, 15, AnimationNode::PhaseActive, AnimationNode::PhaseActive, timing));
// After Phase
timing.startDelay = 10;
EXPECT_EQ(21, calculateActiveTime(21, Timing::FillModeForwards, 45, AnimationNode::PhaseActive, AnimationNode::PhaseAfter, timing));
EXPECT_EQ(21, calculateActiveTime(21, Timing::FillModeBoth, 45, AnimationNode::PhaseActive, AnimationNode::PhaseAfter, timing));
EXPECT_TRUE(isNull(calculateActiveTime(21, Timing::FillModeBackwards, 45, AnimationNode::PhaseActive, AnimationNode::PhaseAfter, timing)));
EXPECT_TRUE(isNull(calculateActiveTime(21, Timing::FillModeNone, 45, AnimationNode::PhaseActive, AnimationNode::PhaseAfter, timing)));
// None
EXPECT_TRUE(isNull(calculateActiveTime(32, Timing::FillModeNone, nullValue(), AnimationNode::PhaseNone, AnimationNode::PhaseNone, timing)));
}
TEST(AnimationTimingCalculationsTest, ScaledActiveTime)
{
Timing timing;
// calculateScaledActiveTime(activeDuration, activeTime, startOffset, timing)
// if the active time is null
EXPECT_TRUE(isNull(calculateScaledActiveTime(4, nullValue(), 5, timing)));
// if the playback rate is negative
timing.playbackRate = -1;
EXPECT_EQ(35, calculateScaledActiveTime(40, 10, 5, timing));
// otherwise
timing.playbackRate = 0;
EXPECT_EQ(5, calculateScaledActiveTime(40, 10, 5, timing));
timing.playbackRate = 1;
EXPECT_EQ(15, calculateScaledActiveTime(40, 10, 5, timing));
// infinte activeTime
timing.playbackRate = 0;
EXPECT_EQ(0, calculateScaledActiveTime(std::numeric_limits<double>::infinity(), std::numeric_limits<double>::infinity(), 0, timing));
timing.playbackRate = 1;
EXPECT_EQ(std::numeric_limits<double>::infinity(), calculateScaledActiveTime(std::numeric_limits<double>::infinity(), std::numeric_limits<double>::infinity(), 0, timing));
}
TEST(AnimationTimingCalculationsTest, IterationTime)
{
Timing timing;
// calculateIterationTime(iterationDuration, repeatedDuration, scaledActiveTime, startOffset, timing)
// if the scaled active time is null
EXPECT_TRUE(isNull(calculateIterationTime(1, 1, nullValue(), 1, timing)));
// if (complex-conditions)...
EXPECT_EQ(12, calculateIterationTime(12, 12, 12, 0, timing));
// otherwise
timing.iterationCount = 10;
EXPECT_EQ(5, calculateIterationTime(10, 100, 25, 4, timing));
EXPECT_EQ(7, calculateIterationTime(11, 110, 29, 1, timing));
timing.iterationStart = 1.1;
EXPECT_EQ(8, calculateIterationTime(12, 120, 20, 7, timing));
}
TEST(AnimationTimingCalculationsTest, CurrentIteration)
{
Timing timing;
// calculateCurrentIteration(iterationDuration, iterationTime, scaledActiveTime, timing)
// if the scaled active time is null
EXPECT_TRUE(isNull(calculateCurrentIteration(1, 1, nullValue(), timing)));
// if the scaled active time is zero
EXPECT_EQ(0, calculateCurrentIteration(1, 1, 0, timing));
// if the iteration time equals the iteration duration
timing.iterationStart = 4;
timing.iterationCount = 7;
EXPECT_EQ(10, calculateCurrentIteration(5, 5, 9, timing));
// otherwise
EXPECT_EQ(3, calculateCurrentIteration(3.2, 3.1, 10, timing));
}
TEST(AnimationTimingCalculationsTest, DirectedTime)
{
Timing timing;
// calculateDirectedTime(currentIteration, iterationDuration, iterationTime, timing)
// if the iteration time is null
EXPECT_TRUE(isNull(calculateDirectedTime(1, 2, nullValue(), timing)));
// forwards
EXPECT_EQ(17, calculateDirectedTime(0, 20, 17, timing));
EXPECT_EQ(17, calculateDirectedTime(1, 20, 17, timing));
timing.direction = Timing::PlaybackDirectionAlternate;
EXPECT_EQ(17, calculateDirectedTime(0, 20, 17, timing));
EXPECT_EQ(17, calculateDirectedTime(2, 20, 17, timing));
timing.direction = Timing::PlaybackDirectionAlternateReverse;
EXPECT_EQ(17, calculateDirectedTime(1, 20, 17, timing));
EXPECT_EQ(17, calculateDirectedTime(3, 20, 17, timing));
// reverse
timing.direction = Timing::PlaybackDirectionReverse;
EXPECT_EQ(3, calculateDirectedTime(0, 20, 17, timing));
EXPECT_EQ(3, calculateDirectedTime(1, 20, 17, timing));
timing.direction = Timing::PlaybackDirectionAlternate;
EXPECT_EQ(3, calculateDirectedTime(1, 20, 17, timing));
EXPECT_EQ(3, calculateDirectedTime(3, 20, 17, timing));
timing.direction = Timing::PlaybackDirectionAlternateReverse;
EXPECT_EQ(3, calculateDirectedTime(0, 20, 17, timing));
EXPECT_EQ(3, calculateDirectedTime(2, 20, 17, timing));
}
TEST(AnimationTimingCalculationsTest, TransformedTime)
{
Timing timing;
// calculateTransformedTime(currentIteration, iterationDuration, iterationTime, timing)
// Iteration time is null
EXPECT_TRUE(isNull(calculateTransformedTime(1, 2, nullValue(), timing)));
// PlaybackDirectionForwards
EXPECT_EQ(12, calculateTransformedTime(0, 20, 12, timing));
EXPECT_EQ(12, calculateTransformedTime(1, 20, 12, timing));
// PlaybackDirectionForwards with timing function
timing.timingFunction = StepsTimingFunction::create(4, StepsTimingFunction::End);
EXPECT_EQ(10, calculateTransformedTime(0, 20, 12, timing));
EXPECT_EQ(10, calculateTransformedTime(1, 20, 12, timing));
// PlaybackDirectionReverse
timing.timingFunction = Timing::defaults().timingFunction;
timing.direction = Timing::PlaybackDirectionReverse;
EXPECT_EQ(8, calculateTransformedTime(0, 20, 12, timing));
EXPECT_EQ(8, calculateTransformedTime(1, 20, 12, timing));
// PlaybackDirectionReverse with timing function
timing.timingFunction = StepsTimingFunction::create(4, StepsTimingFunction::End);
EXPECT_EQ(5, calculateTransformedTime(0, 20, 12, timing));
EXPECT_EQ(5, calculateTransformedTime(1, 20, 12, timing));
// Timing function when directed time is null.
EXPECT_TRUE(isNull(calculateTransformedTime(1, 2, nullValue(), timing)));
// Timing function when iterationDuration is infinity
timing.direction = Timing::PlaybackDirectionNormal;
EXPECT_EQ(0, calculateTransformedTime(0, std::numeric_limits<double>::infinity(), 0, timing));
EXPECT_EQ(1, calculateTransformedTime(0, std::numeric_limits<double>::infinity(), 1, timing));
timing.direction = Timing::PlaybackDirectionReverse;
EXPECT_EQ(std::numeric_limits<double>::infinity(), calculateTransformedTime(0, std::numeric_limits<double>::infinity(), 0, timing));
EXPECT_EQ(std::numeric_limits<double>::infinity(), calculateTransformedTime(0, std::numeric_limits<double>::infinity(), 1, timing));
}
}
|
