| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2014 Google Inc. All rights reserved. | 2 * Copyright (C) 2014 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 11 matching lines...) Expand all Loading... |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 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 #include "core/svg/SVGStaticStringList.h" |
| 33 #include "core/svg/SVGAnimatedLength.h" | |
| 34 | 33 |
| 35 namespace WebCore { | 34 namespace WebCore { |
| 36 | 35 |
| 37 void SVGAnimatedLength::setDefaultValueAsString(const String& value) | 36 SVGStaticStringList::SVGStaticStringList(SVGElement* contextElement, const Quali
fiedName& attributeName) |
| 37 : NewSVGAnimatedPropertyBase(AnimatedStringList, contextElement, attributeNa
me) |
| 38 , m_value(SVGStringList::create()) |
| 39 , m_tearOff(SVGStringListTearOff::create(m_value, contextElement, PropertyIs
NotAnimVal, attributeName)) |
| 38 { | 40 { |
| 39 baseValue()->setValueAsString(value, ASSERT_NO_EXCEPTION); | 41 ASSERT(contextElement); |
| 40 } | 42 } |
| 41 | 43 |
| 42 void SVGAnimatedLength::setBaseValueAsString(const String& value, SVGLengthNegat
iveValuesMode mode, SVGParsingError& parseError) | 44 SVGStaticStringList::~SVGStaticStringList() |
| 45 { |
| 46 } |
| 47 |
| 48 NewSVGPropertyBase* SVGStaticStringList::currentValueBase() |
| 49 { |
| 50 return m_value.get(); |
| 51 } |
| 52 |
| 53 void SVGStaticStringList::animationStarted() |
| 54 { |
| 55 ASSERT_NOT_REACHED(); |
| 56 } |
| 57 |
| 58 PassRefPtr<NewSVGPropertyBase> SVGStaticStringList::createAnimatedValue() |
| 59 { |
| 60 ASSERT_NOT_REACHED(); |
| 61 return 0; |
| 62 } |
| 63 |
| 64 void SVGStaticStringList::setAnimatedValue(PassRefPtr<NewSVGPropertyBase>) |
| 65 { |
| 66 ASSERT_NOT_REACHED(); |
| 67 } |
| 68 |
| 69 void SVGStaticStringList::animationEnded() |
| 70 { |
| 71 ASSERT_NOT_REACHED(); |
| 72 } |
| 73 |
| 74 void SVGStaticStringList::animValWillChange() |
| 75 { |
| 76 ASSERT_NOT_REACHED(); |
| 77 } |
| 78 |
| 79 void SVGStaticStringList::animValDidChange() |
| 80 { |
| 81 ASSERT_NOT_REACHED(); |
| 82 } |
| 83 |
| 84 bool SVGStaticStringList::needsSynchronizeAttribute() |
| 85 { |
| 86 return m_tearOff; |
| 87 } |
| 88 |
| 89 void SVGStaticStringList::setBaseValueAsString(const String& value, SVGParsingEr
ror& parseError) |
| 43 { | 90 { |
| 44 TrackExceptionState es; | 91 TrackExceptionState es; |
| 45 | 92 |
| 46 baseValue()->setValueAsString(value, es); | 93 m_value->setValueAsString(value, es); |
| 47 | 94 |
| 48 if (es.hadException()) { | 95 if (es.hadException()) |
| 49 parseError = ParsingAttributeFailedError; | 96 parseError = ParsingAttributeFailedError; |
| 50 baseValue()->newValueSpecifiedUnits(LengthTypeNumber, 0); | |
| 51 } else if (mode == ForbidNegativeLengths && baseValue()->valueInSpecifiedUni
ts() < 0) { | |
| 52 parseError = NegativeValueForbiddenError; | |
| 53 } | |
| 54 } | 97 } |
| 55 | 98 |
| 56 } | 99 } |
| OLD | NEW |