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 "core/animation/animatable/AnimatableStrokeDasharrayList.h" | |
32 | |
33 #include "core/style/SVGComputedStyleDefs.h" | |
34 #include "testing/gtest/include/gtest/gtest.h" | |
35 | |
36 namespace blink { | |
37 | |
38 PassRefPtr<SVGDashArray> createSVGDashArray(size_t length) { | |
39 RefPtr<SVGDashArray> list = SVGDashArray::create(); | |
40 for (size_t i = 0; i < length; ++i) | |
41 list->append(Length(Fixed)); | |
42 return list.release(); | |
43 } | |
44 | |
45 TEST(AnimationAnimatableStrokeDasharrayListTest, EqualTo) { | |
46 RefPtr<SVGDashArray> svgListA = createSVGDashArray(4); | |
47 RefPtr<SVGDashArray> svgListB = createSVGDashArray(4); | |
48 RefPtr<AnimatableStrokeDasharrayList> listA = | |
49 AnimatableStrokeDasharrayList::create(svgListA, 1); | |
50 RefPtr<AnimatableStrokeDasharrayList> listB = | |
51 AnimatableStrokeDasharrayList::create(svgListB, 1); | |
52 EXPECT_TRUE(listA->equals(listB.get())); | |
53 | |
54 svgListB->at(3) = Length(50, Fixed); | |
55 listB = AnimatableStrokeDasharrayList::create(svgListB, 1); | |
56 EXPECT_FALSE(listA->equals(listB.get())); | |
57 | |
58 svgListB = createSVGDashArray(5); | |
59 listB = AnimatableStrokeDasharrayList::create(svgListB, 1); | |
60 EXPECT_FALSE(listA->equals(listB.get())); | |
61 } | |
62 | |
63 } // namespace blink | |
OLD | NEW |