| 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 #include "core/animation/AnimatableStrokeDasharrayList.h" | |
| 33 | |
| 34 #include "core/svg/SVGLength.h" | |
| 35 | |
| 36 #include <gtest/gtest.h> | |
| 37 | |
| 38 using namespace WebCore; | |
| 39 | |
| 40 namespace { | |
| 41 | |
| 42 PassRefPtr<SVGLengthList> createSVGLengthList(size_t length) | |
| 43 { | |
| 44 RefPtr<SVGLengthList> list = SVGLengthList::create(); | |
| 45 for (size_t i = 0; i < length; ++i) | |
| 46 list->append(SVGLength::create()); | |
| 47 return list.release(); | |
| 48 } | |
| 49 | |
| 50 TEST(AnimationAnimatableStrokeDasharrayListTest, EqualTo) | |
| 51 { | |
| 52 RefPtr<SVGLengthList> svgListA = createSVGLengthList(4); | |
| 53 RefPtr<SVGLengthList> svgListB = createSVGLengthList(4); | |
| 54 RefPtrWillBeRawPtr<AnimatableStrokeDasharrayList> listA = AnimatableStrokeDa
sharrayList::create(svgListA); | |
| 55 RefPtrWillBeRawPtr<AnimatableStrokeDasharrayList> listB = AnimatableStrokeDa
sharrayList::create(svgListB); | |
| 56 EXPECT_TRUE(listA->equals(listB.get())); | |
| 57 | |
| 58 TrackExceptionState exceptionState; | |
| 59 svgListB->at(3)->newValueSpecifiedUnits(LengthTypePX, 50); | |
| 60 listB = AnimatableStrokeDasharrayList::create(svgListB); | |
| 61 EXPECT_FALSE(listA->equals(listB.get())); | |
| 62 | |
| 63 svgListB = createSVGLengthList(5); | |
| 64 listB = AnimatableStrokeDasharrayList::create(svgListB); | |
| 65 EXPECT_FALSE(listA->equals(listB.get())); | |
| 66 } | |
| 67 | |
| 68 } // namespace | |
| OLD | NEW |