| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2004, 2005, 2006, 2008 Nikolas Zimmermann <zimmermann@kde.org> | 2 * Copyright (C) 2004, 2005, 2006, 2008 Nikolas Zimmermann <zimmermann@kde.org> |
| 3 * Copyright (C) 2004, 2005, 2006, 2007 Rob Buis <buis@kde.org> | 3 * Copyright (C) 2004, 2005, 2006, 2007 Rob Buis <buis@kde.org> |
| 4 * | 4 * |
| 5 * This library is free software; you can redistribute it and/or | 5 * This library is free software; you can redistribute it and/or |
| 6 * modify it under the terms of the GNU Library General Public | 6 * modify it under the terms of the GNU Library General Public |
| 7 * License as published by the Free Software Foundation; either | 7 * License as published by the Free Software Foundation; either |
| 8 * version 2 of the License, or (at your option) any later version. | 8 * version 2 of the License, or (at your option) any later version. |
| 9 * | 9 * |
| 10 * This library is distributed in the hope that it will be useful, | 10 * This library is distributed in the hope that it will be useful, |
| (...skipping 21 matching lines...) Expand all Loading... |
| 32 , m_y1(SVGAnimatedLength::create(this, SVGNames::y1Attr, SVGLength::create(L
engthModeHeight), AllowNegativeLengths)) | 32 , m_y1(SVGAnimatedLength::create(this, SVGNames::y1Attr, SVGLength::create(L
engthModeHeight), AllowNegativeLengths)) |
| 33 , m_x2(SVGAnimatedLength::create(this, SVGNames::x2Attr, SVGLength::create(L
engthModeWidth), AllowNegativeLengths)) | 33 , m_x2(SVGAnimatedLength::create(this, SVGNames::x2Attr, SVGLength::create(L
engthModeWidth), AllowNegativeLengths)) |
| 34 , m_y2(SVGAnimatedLength::create(this, SVGNames::y2Attr, SVGLength::create(L
engthModeHeight), AllowNegativeLengths)) | 34 , m_y2(SVGAnimatedLength::create(this, SVGNames::y2Attr, SVGLength::create(L
engthModeHeight), AllowNegativeLengths)) |
| 35 { | 35 { |
| 36 addToPropertyMap(m_x1); | 36 addToPropertyMap(m_x1); |
| 37 addToPropertyMap(m_y1); | 37 addToPropertyMap(m_y1); |
| 38 addToPropertyMap(m_x2); | 38 addToPropertyMap(m_x2); |
| 39 addToPropertyMap(m_y2); | 39 addToPropertyMap(m_y2); |
| 40 } | 40 } |
| 41 | 41 |
| 42 void SVGLineElement::trace(Visitor* visitor) |
| 43 { |
| 44 visitor->trace(m_x1); |
| 45 visitor->trace(m_y1); |
| 46 visitor->trace(m_x2); |
| 47 visitor->trace(m_y2); |
| 48 SVGGeometryElement::trace(visitor); |
| 49 } |
| 50 |
| 42 DEFINE_NODE_FACTORY(SVGLineElement) | 51 DEFINE_NODE_FACTORY(SVGLineElement) |
| 43 | 52 |
| 44 bool SVGLineElement::isSupportedAttribute(const QualifiedName& attrName) | 53 bool SVGLineElement::isSupportedAttribute(const QualifiedName& attrName) |
| 45 { | 54 { |
| 46 DEFINE_STATIC_LOCAL(HashSet<QualifiedName>, supportedAttributes, ()); | 55 DEFINE_STATIC_LOCAL(HashSet<QualifiedName>, supportedAttributes, ()); |
| 47 if (supportedAttributes.isEmpty()) { | 56 if (supportedAttributes.isEmpty()) { |
| 48 supportedAttributes.add(SVGNames::x1Attr); | 57 supportedAttributes.add(SVGNames::x1Attr); |
| 49 supportedAttributes.add(SVGNames::x2Attr); | 58 supportedAttributes.add(SVGNames::x2Attr); |
| 50 supportedAttributes.add(SVGNames::y1Attr); | 59 supportedAttributes.add(SVGNames::y1Attr); |
| 51 supportedAttributes.add(SVGNames::y2Attr); | 60 supportedAttributes.add(SVGNames::y2Attr); |
| (...skipping 38 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 90 | 99 |
| 91 bool SVGLineElement::selfHasRelativeLengths() const | 100 bool SVGLineElement::selfHasRelativeLengths() const |
| 92 { | 101 { |
| 93 return m_x1->currentValue()->isRelative() | 102 return m_x1->currentValue()->isRelative() |
| 94 || m_y1->currentValue()->isRelative() | 103 || m_y1->currentValue()->isRelative() |
| 95 || m_x2->currentValue()->isRelative() | 104 || m_x2->currentValue()->isRelative() |
| 96 || m_y2->currentValue()->isRelative(); | 105 || m_y2->currentValue()->isRelative(); |
| 97 } | 106 } |
| 98 | 107 |
| 99 } // namespace blink | 108 } // namespace blink |
| OLD | NEW |