OLD | NEW |
| (Empty) |
1 /* | |
2 * Copyright (c) 2013, Google Inc. All rights reserved. | |
3 * | |
4 * Redistribution and use in source and binary forms, with or without | |
5 * modification, are permitted provided that the following conditions are | |
6 * met: | |
7 * | |
8 * * Redistributions of source code must retain the above copyright | |
9 * notice, this list of conditions and the following disclaimer. | |
10 * * Redistributions in binary form must reproduce the above | |
11 * copyright notice, this list of conditions and the following disclaimer | |
12 * in the documentation and/or other materials provided with the | |
13 * distribution. | |
14 * * Neither the name of Google Inc. nor the names of its | |
15 * contributors may be used to endorse or promote products derived from | |
16 * this software without specific prior written permission. | |
17 * | |
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
29 */ | |
30 | |
31 #include "config.h" | |
32 | |
33 #include "core/platform/animation/TimingFunctionTestHelper.h" | |
34 | |
35 #include <gmock/gmock.h> | |
36 #include <gtest/gtest.h> | |
37 #include <sstream> | |
38 #include <string> | |
39 | |
40 // FIXME: Remove once https://codereview.chromium.org/50603011/ lands. | |
41 #define EXPECT_REFV_EQ(a, b) EXPECT_EQ(*(a.get()), *(b.get())) | |
42 #define EXPECT_REFV_NE(a, b) EXPECT_NE(*(a.get()), *(b.get())) | |
43 | |
44 // Couple of macros to quickly assert a bunch of timing functions are not | |
45 // equal. | |
46 #define NE_STRINGIZE(x) NE_STRINGIZE2(x) | |
47 #define NE_STRINGIZE2(x) #x | |
48 #define NE_HELPER(v) \ | |
49 Vector<std::pair<std::string, RefPtr<TimingFunction> > > v; | |
50 #define NE_HELPER_APPEND(v, x) \ | |
51 v.append(std::make_pair(std::string("Line " NE_STRINGIZE(__LINE__) ":" # x),
x)) | |
52 #define NE_HELPER_LOOP(v) \ | |
53 for (size_t i = 0; i != v.size(); ++i) { \ | |
54 for (size_t j = 0; j != v.size(); ++j) { \ | |
55 if (i == j) \ | |
56 continue; \ | |
57 EXPECT_REFV_NE(v[i].second, v[j].second) \ | |
58 << v[i].first \ | |
59 << " (" << ::testing::PrintToString(*v[i].second.get()) << ")" \ | |
60 << " == " \ | |
61 << v[j].first \ | |
62 << " (" << ::testing::PrintToString(*v[j].second.get()) << ")" \ | |
63 << "\n"; \ | |
64 } \ | |
65 } | |
66 | |
67 namespace { | |
68 | |
69 using namespace WebCore; | |
70 | |
71 class TimingFunctionTestHelperTest : public ::testing::Test { | |
72 | |
73 public: | |
74 // Make sure that the CubicBezierTimingFunction call goes via the generic | |
75 // TimingFunction PrintTo. | |
76 ::std::string PrintToString(RefPtr<CubicBezierTimingFunction> timing) | |
77 { | |
78 RefPtr<TimingFunction> generic = timing; | |
79 return PrintToString(generic.get()); | |
80 } | |
81 | |
82 ::std::string PrintToString(RefPtr<TimingFunction> timing) | |
83 { | |
84 return PrintToString(timing.get()); | |
85 } | |
86 | |
87 ::std::string PrintToString(const TimingFunction* timing) | |
88 { | |
89 return ::testing::PrintToString(*timing); | |
90 } | |
91 }; | |
92 | |
93 TEST_F(TimingFunctionTestHelperTest, LinearPrintTo) | |
94 { | |
95 RefPtr<TimingFunction> linearTiming = LinearTimingFunction::create(); | |
96 EXPECT_THAT( | |
97 PrintToString(linearTiming), | |
98 ::testing::MatchesRegex("LinearTimingFunction@.*")); | |
99 } | |
100 | |
101 TEST_F(TimingFunctionTestHelperTest, CubicPrintTo) | |
102 { | |
103 RefPtr<TimingFunction> cubicEaseTiming = CubicBezierTimingFunction::preset(C
ubicBezierTimingFunction::EaseIn); | |
104 EXPECT_THAT( | |
105 PrintToString(cubicEaseTiming), | |
106 ::testing::MatchesRegex("CubicBezierTimingFunction@.*\\(EaseIn, 0.42, 0,
1, 1\\)")); | |
107 | |
108 RefPtr<TimingFunction> cubicCustomTiming = CubicBezierTimingFunction::create
(0.17, 0.67, 1, -1.73); | |
109 EXPECT_THAT( | |
110 PrintToString(cubicCustomTiming), | |
111 ::testing::MatchesRegex("CubicBezierTimingFunction@.*\\(Custom, 0.17, 0.
67, 1, -1.73\\)")); | |
112 } | |
113 | |
114 TEST_F(TimingFunctionTestHelperTest, StepPrintTo) | |
115 { | |
116 RefPtr<TimingFunction> stepTimingStart = StepsTimingFunction::preset(StepsTi
mingFunction::Start); | |
117 EXPECT_THAT( | |
118 PrintToString(stepTimingStart), | |
119 ::testing::MatchesRegex("StepsTimingFunction@.*\\(Start, 1, true\\)")); | |
120 | |
121 RefPtr<TimingFunction> stepTimingCustom = StepsTimingFunction::create(5, fal
se); | |
122 EXPECT_THAT( | |
123 PrintToString(stepTimingCustom), | |
124 ::testing::MatchesRegex("StepsTimingFunction@.*\\(Custom, 5, false\\)"))
; | |
125 } | |
126 | |
127 TEST_F(TimingFunctionTestHelperTest, ChainedPrintTo) | |
128 { | |
129 RefPtr<TimingFunction> linearTiming = LinearTimingFunction::create(); | |
130 RefPtr<ChainedTimingFunction> chainedLinearSingle = ChainedTimingFunction::c
reate(); | |
131 chainedLinearSingle->appendSegment(1.0, linearTiming.get()); | |
132 EXPECT_THAT( | |
133 PrintToString(chainedLinearSingle), | |
134 ::testing::MatchesRegex( | |
135 "ChainedTimingFunction@.*\\(" | |
136 "LinearTimingFunction@.*\\[0 -> 1\\]" | |
137 "\\)")); | |
138 | |
139 RefPtr<TimingFunction> cubicCustomTiming = CubicBezierTimingFunction::create
(1.0, 0.0, 1, -1); | |
140 | |
141 RefPtr<ChainedTimingFunction> chainedMixed = ChainedTimingFunction::create()
; | |
142 chainedMixed->appendSegment(0.75, chainedLinearSingle.get()); | |
143 chainedMixed->appendSegment(1.0, cubicCustomTiming.get()); | |
144 EXPECT_THAT( | |
145 PrintToString(chainedMixed), | |
146 ::testing::MatchesRegex( | |
147 "ChainedTimingFunction@.*\\(" | |
148 "ChainedTimingFunction@.*\\(" | |
149 "LinearTimingFunction@.*\\[0 -> 1\\]" | |
150 "\\)\\[0 -> 0.75\\], " | |
151 "CubicBezierTimingFunction@.*\\(Custom, 1, 0, 1, -1\\)\\[0.75 ->
1\\]" | |
152 "\\)")); | |
153 } | |
154 | |
155 TEST_F(TimingFunctionTestHelperTest, BaseOperatorEq) | |
156 { | |
157 RefPtr<TimingFunction> linearTiming = LinearTimingFunction::create(); | |
158 RefPtr<TimingFunction> cubicTiming1 = CubicBezierTimingFunction::preset(Cubi
cBezierTimingFunction::EaseIn); | |
159 RefPtr<TimingFunction> cubicTiming2 = CubicBezierTimingFunction::create(0.17
, 0.67, 1, -1.73); | |
160 RefPtr<TimingFunction> stepsTiming1 = StepsTimingFunction::preset(StepsTimin
gFunction::End); | |
161 RefPtr<TimingFunction> stepsTiming2 = StepsTimingFunction::create(5, true); | |
162 | |
163 RefPtr<ChainedTimingFunction> chainedTiming1 = ChainedTimingFunction::create
(); | |
164 chainedTiming1->appendSegment(1.0, linearTiming.get()); | |
165 | |
166 RefPtr<ChainedTimingFunction> chainedTiming2 = ChainedTimingFunction::create
(); | |
167 chainedTiming2->appendSegment(0.5, cubicTiming1.get()); | |
168 chainedTiming2->appendSegment(1.0, cubicTiming2.get()); | |
169 | |
170 NE_HELPER(v); | |
171 NE_HELPER_APPEND(v, linearTiming); | |
172 NE_HELPER_APPEND(v, cubicTiming1); | |
173 NE_HELPER_APPEND(v, cubicTiming2); | |
174 NE_HELPER_APPEND(v, stepsTiming1); | |
175 NE_HELPER_APPEND(v, stepsTiming2); | |
176 NE_HELPER_APPEND(v, chainedTiming1); | |
177 NE_HELPER_APPEND(v, chainedTiming2); | |
178 NE_HELPER_LOOP(v); | |
179 } | |
180 | |
181 TEST_F(TimingFunctionTestHelperTest, LinearOperatorEq) | |
182 { | |
183 RefPtr<TimingFunction> linearTiming1 = LinearTimingFunction::create(); | |
184 RefPtr<TimingFunction> linearTiming2 = LinearTimingFunction::create(); | |
185 EXPECT_REFV_EQ(linearTiming1, linearTiming1); | |
186 EXPECT_REFV_EQ(linearTiming1, linearTiming2); | |
187 } | |
188 | |
189 TEST_F(TimingFunctionTestHelperTest, CubicOperatorEq) | |
190 { | |
191 RefPtr<TimingFunction> cubicEaseInTiming1 = CubicBezierTimingFunction::prese
t(CubicBezierTimingFunction::EaseIn); | |
192 RefPtr<TimingFunction> cubicEaseInTiming2 = CubicBezierTimingFunction::prese
t(CubicBezierTimingFunction::EaseIn); | |
193 EXPECT_REFV_EQ(cubicEaseInTiming1, cubicEaseInTiming1); | |
194 EXPECT_REFV_EQ(cubicEaseInTiming1, cubicEaseInTiming2); | |
195 | |
196 RefPtr<TimingFunction> cubicEaseOutTiming1 = CubicBezierTimingFunction::pres
et(CubicBezierTimingFunction::EaseOut); | |
197 RefPtr<TimingFunction> cubicEaseOutTiming2 = CubicBezierTimingFunction::pres
et(CubicBezierTimingFunction::EaseOut); | |
198 EXPECT_REFV_EQ(cubicEaseOutTiming1, cubicEaseOutTiming2); | |
199 | |
200 RefPtr<TimingFunction> cubicEaseInOutTiming1 = CubicBezierTimingFunction::pr
eset(CubicBezierTimingFunction::EaseInOut); | |
201 RefPtr<TimingFunction> cubicEaseInOutTiming2 = CubicBezierTimingFunction::pr
eset(CubicBezierTimingFunction::EaseInOut); | |
202 EXPECT_REFV_EQ(cubicEaseInOutTiming1, cubicEaseInOutTiming2); | |
203 | |
204 RefPtr<TimingFunction> cubicCustomTiming1 = CubicBezierTimingFunction::creat
e(0.17, 0.67, 1, -1.73); | |
205 RefPtr<TimingFunction> cubicCustomTiming2 = CubicBezierTimingFunction::creat
e(0.17, 0.67, 1, -1.73); | |
206 EXPECT_REFV_EQ(cubicCustomTiming1, cubicCustomTiming2); | |
207 | |
208 NE_HELPER(v); | |
209 NE_HELPER_APPEND(v, cubicEaseInTiming1); | |
210 NE_HELPER_APPEND(v, cubicEaseOutTiming1); | |
211 NE_HELPER_APPEND(v, cubicEaseInOutTiming1); | |
212 NE_HELPER_APPEND(v, cubicCustomTiming1); | |
213 NE_HELPER_LOOP(v); | |
214 } | |
215 | |
216 TEST_F(TimingFunctionTestHelperTest, CubicOperatorEqReflectivity) | |
217 { | |
218 RefPtr<TimingFunction> cubicA = CubicBezierTimingFunction::preset(CubicBezie
rTimingFunction::EaseIn); | |
219 RefPtr<TimingFunction> cubicB = CubicBezierTimingFunction::create(0.42, 0.0,
1.0, 1.0); | |
220 EXPECT_REFV_NE(cubicA, cubicB); | |
221 EXPECT_REFV_NE(cubicB, cubicA); | |
222 } | |
223 | |
224 TEST_F(TimingFunctionTestHelperTest, StepsOperatorEq) | |
225 { | |
226 RefPtr<TimingFunction> stepsTimingStart1 = StepsTimingFunction::preset(Steps
TimingFunction::Start); | |
227 RefPtr<TimingFunction> stepsTimingStart2 = StepsTimingFunction::preset(Steps
TimingFunction::Start); | |
228 EXPECT_REFV_EQ(stepsTimingStart1, stepsTimingStart1); | |
229 EXPECT_REFV_EQ(stepsTimingStart1, stepsTimingStart2); | |
230 | |
231 RefPtr<TimingFunction> stepsTimingEnd1 = StepsTimingFunction::preset(StepsTi
mingFunction::End); | |
232 RefPtr<TimingFunction> stepsTimingEnd2 = StepsTimingFunction::preset(StepsTi
mingFunction::End); | |
233 EXPECT_REFV_EQ(stepsTimingEnd1, stepsTimingEnd2); | |
234 | |
235 RefPtr<TimingFunction> stepsTimingCustom1 = StepsTimingFunction::create(5, t
rue); | |
236 RefPtr<TimingFunction> stepsTimingCustom2 = StepsTimingFunction::create(5, f
alse); | |
237 RefPtr<TimingFunction> stepsTimingCustom3 = StepsTimingFunction::create(7, t
rue); | |
238 RefPtr<TimingFunction> stepsTimingCustom4 = StepsTimingFunction::create(7, f
alse); | |
239 | |
240 EXPECT_REFV_EQ(stepsTimingCustom1, StepsTimingFunction::create(5, true)); | |
241 EXPECT_REFV_EQ(stepsTimingCustom2, StepsTimingFunction::create(5, false)); | |
242 EXPECT_REFV_EQ(stepsTimingCustom3, StepsTimingFunction::create(7, true)); | |
243 EXPECT_REFV_EQ(stepsTimingCustom4, StepsTimingFunction::create(7, false)); | |
244 | |
245 NE_HELPER(v); | |
246 NE_HELPER_APPEND(v, stepsTimingStart1); | |
247 NE_HELPER_APPEND(v, stepsTimingEnd1); | |
248 NE_HELPER_APPEND(v, stepsTimingCustom1); | |
249 NE_HELPER_APPEND(v, stepsTimingCustom2); | |
250 NE_HELPER_APPEND(v, stepsTimingCustom3); | |
251 NE_HELPER_APPEND(v, stepsTimingCustom4); | |
252 NE_HELPER_LOOP(v); | |
253 } | |
254 | |
255 TEST_F(TimingFunctionTestHelperTest, StepsOperatorEqReflectivity) | |
256 { | |
257 RefPtr<TimingFunction> stepsA = StepsTimingFunction::preset(StepsTimingFunct
ion::Start); | |
258 RefPtr<TimingFunction> stepsB = StepsTimingFunction::create(1, true); | |
259 EXPECT_REFV_NE(stepsA, stepsB); | |
260 EXPECT_REFV_NE(stepsB, stepsA); | |
261 } | |
262 | |
263 TEST_F(TimingFunctionTestHelperTest, ChainedEq) | |
264 { | |
265 // Single item in chain | |
266 RefPtr<TimingFunction> cubicTiming1 = CubicBezierTimingFunction::create(0.25
, 0.1, 0.25, 1.0); | |
267 RefPtr<TimingFunction> cubicTiming2 = CubicBezierTimingFunction::create(0.25
, 0.1, 0.25, 1.0); | |
268 RefPtr<TimingFunction> cubicTiming3 = CubicBezierTimingFunction::preset(Cubi
cBezierTimingFunction::EaseOut); | |
269 | |
270 RefPtr<ChainedTimingFunction> chainedSingleCubic1 = ChainedTimingFunction::c
reate(); | |
271 chainedSingleCubic1->appendSegment(1.0, cubicTiming1.get()); | |
272 EXPECT_REFV_EQ(chainedSingleCubic1, chainedSingleCubic1); | |
273 | |
274 RefPtr<ChainedTimingFunction> chainedSingleCubic2 = ChainedTimingFunction::c
reate(); | |
275 chainedSingleCubic2->appendSegment(1.0, cubicTiming1.get()); // Same inner t
iming function | |
276 EXPECT_REFV_EQ(chainedSingleCubic1, chainedSingleCubic2); | |
277 | |
278 RefPtr<ChainedTimingFunction> chainedSingleCubic3 = ChainedTimingFunction::c
reate(); | |
279 chainedSingleCubic3->appendSegment(1.0, cubicTiming2.get()); // == inner tim
ing function | |
280 EXPECT_REFV_EQ(chainedSingleCubic1, chainedSingleCubic3); | |
281 | |
282 RefPtr<ChainedTimingFunction> chainedSingleCubic4 = ChainedTimingFunction::c
reate(); | |
283 chainedSingleCubic4->appendSegment(0.5, cubicTiming1.get()); // Different of
fset | |
284 EXPECT_REFV_NE(chainedSingleCubic1, chainedSingleCubic4); | |
285 EXPECT_REFV_NE(chainedSingleCubic3, chainedSingleCubic4); | |
286 | |
287 RefPtr<ChainedTimingFunction> chainedSingleCubic5 = ChainedTimingFunction::c
reate(); | |
288 chainedSingleCubic5->appendSegment(1.0, cubicTiming3.get()); // != inner tim
ing function (same type) | |
289 EXPECT_REFV_NE(chainedSingleCubic1, chainedSingleCubic5); | |
290 EXPECT_REFV_NE(chainedSingleCubic2, chainedSingleCubic5); | |
291 EXPECT_REFV_NE(chainedSingleCubic3, chainedSingleCubic5); | |
292 EXPECT_REFV_NE(chainedSingleCubic4, chainedSingleCubic5); | |
293 | |
294 RefPtr<TimingFunction> linearTiming1 = LinearTimingFunction::create(); | |
295 RefPtr<ChainedTimingFunction> chainedSingleLinear1 = ChainedTimingFunction::
create(); | |
296 chainedSingleLinear1->appendSegment(1.0, linearTiming1.get()); // != inner t
iming function (different type) | |
297 EXPECT_REFV_NE(chainedSingleLinear1, chainedSingleCubic1); | |
298 EXPECT_REFV_NE(chainedSingleLinear1, chainedSingleCubic2); | |
299 EXPECT_REFV_NE(chainedSingleLinear1, chainedSingleCubic3); | |
300 EXPECT_REFV_NE(chainedSingleLinear1, chainedSingleCubic4); | |
301 | |
302 // Multiple items in chain | |
303 RefPtr<ChainedTimingFunction> chainedMixed1 = ChainedTimingFunction::create(
); | |
304 chainedMixed1->appendSegment(0.25, chainedSingleLinear1.get()); | |
305 chainedMixed1->appendSegment(1.0, cubicTiming1.get()); | |
306 | |
307 RefPtr<ChainedTimingFunction> chainedMixed2 = ChainedTimingFunction::create(
); | |
308 chainedMixed2->appendSegment(0.25, chainedSingleLinear1.get()); | |
309 chainedMixed2->appendSegment(1.0, cubicTiming1.get()); | |
310 | |
311 RefPtr<ChainedTimingFunction> chainedMixed3 = ChainedTimingFunction::create(
); | |
312 chainedMixed3->appendSegment(0.25, chainedSingleLinear1.get()); | |
313 chainedMixed3->appendSegment(1.0, cubicTiming2.get()); | |
314 | |
315 EXPECT_REFV_EQ(chainedMixed1, chainedMixed2); | |
316 EXPECT_REFV_EQ(chainedMixed1, chainedMixed3); | |
317 EXPECT_REFV_NE(chainedMixed1, chainedSingleCubic1); | |
318 EXPECT_REFV_NE(chainedMixed1, chainedSingleLinear1); | |
319 | |
320 RefPtr<ChainedTimingFunction> chainedMixed4 = ChainedTimingFunction::create(
); | |
321 chainedMixed4->appendSegment(0.20, chainedSingleLinear1.get()); // Different
offset | |
322 chainedMixed4->appendSegment(1.0, cubicTiming1.get()); | |
323 EXPECT_REFV_NE(chainedMixed1, chainedMixed4); | |
324 } | |
325 | |
326 } // namespace | |
OLD | NEW |