OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2013, Google Inc. All rights reserved. | 2 * Copyright (c) 2013, Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 12 matching lines...) Expand all Loading... |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #include "config.h" | 31 #include "config.h" |
32 | 32 |
33 #include "core/platform/animation/TimingFunctionTestHelper.h" | 33 #include "platform/animation/TimingFunctionTestHelper.h" |
34 | 34 |
35 #include <gmock/gmock.h> | 35 #include <gmock/gmock.h> |
36 #include <gtest/gtest.h> | 36 #include <gtest/gtest.h> |
37 #include <sstream> | 37 #include <sstream> |
38 #include <string> | 38 #include <string> |
39 | 39 |
40 // FIXME: Remove once https://codereview.chromium.org/50603011/ lands. | 40 // FIXME: Remove once https://codereview.chromium.org/50603011/ lands. |
41 #define EXPECT_REFV_EQ(a, b) EXPECT_EQ(*(a.get()), *(b.get())) | 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())) | 42 #define EXPECT_REFV_NE(a, b) EXPECT_NE(*(a.get()), *(b.get())) |
43 | 43 |
(...skipping 273 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
317 EXPECT_REFV_NE(chainedMixed1, chainedSingleCubic1); | 317 EXPECT_REFV_NE(chainedMixed1, chainedSingleCubic1); |
318 EXPECT_REFV_NE(chainedMixed1, chainedSingleLinear1); | 318 EXPECT_REFV_NE(chainedMixed1, chainedSingleLinear1); |
319 | 319 |
320 RefPtr<ChainedTimingFunction> chainedMixed4 = ChainedTimingFunction::create(
); | 320 RefPtr<ChainedTimingFunction> chainedMixed4 = ChainedTimingFunction::create(
); |
321 chainedMixed4->appendSegment(0.20, chainedSingleLinear1.get()); // Different
offset | 321 chainedMixed4->appendSegment(0.20, chainedSingleLinear1.get()); // Different
offset |
322 chainedMixed4->appendSegment(1.0, cubicTiming1.get()); | 322 chainedMixed4->appendSegment(1.0, cubicTiming1.get()); |
323 EXPECT_REFV_NE(chainedMixed1, chainedMixed4); | 323 EXPECT_REFV_NE(chainedMixed1, chainedMixed4); |
324 } | 324 } |
325 | 325 |
326 } // namespace | 326 } // namespace |
OLD | NEW |