OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2004, 2005, 2006, 2007, 2008 Nikolas Zimmermann <zimmermann@kde
.org> | 2 * Copyright (C) 2004, 2005, 2006, 2007, 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 * Copyright (C) Research In Motion Limited 2010. All rights reserved. | 4 * Copyright (C) Research In Motion Limited 2010. All rights reserved. |
5 * | 5 * |
6 * This library is free software; you can redistribute it and/or | 6 * This library is free software; you can redistribute it and/or |
7 * modify it under the terms of the GNU Library General Public | 7 * modify it under the terms of the GNU Library General Public |
8 * License as published by the Free Software Foundation; either | 8 * License as published by the Free Software Foundation; either |
9 * version 2 of the License, or (at your option) any later version. | 9 * version 2 of the License, or (at your option) any later version. |
10 * | 10 * |
(...skipping 35 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
46 { | 46 { |
47 addToPropertyMap(m_x); | 47 addToPropertyMap(m_x); |
48 addToPropertyMap(m_y); | 48 addToPropertyMap(m_y); |
49 addToPropertyMap(m_width); | 49 addToPropertyMap(m_width); |
50 addToPropertyMap(m_height); | 50 addToPropertyMap(m_height); |
51 addToPropertyMap(m_patternTransform); | 51 addToPropertyMap(m_patternTransform); |
52 addToPropertyMap(m_patternUnits); | 52 addToPropertyMap(m_patternUnits); |
53 addToPropertyMap(m_patternContentUnits); | 53 addToPropertyMap(m_patternContentUnits); |
54 } | 54 } |
55 | 55 |
| 56 void SVGPatternElement::trace(Visitor* visitor) |
| 57 { |
| 58 visitor->trace(m_x); |
| 59 visitor->trace(m_y); |
| 60 visitor->trace(m_width); |
| 61 visitor->trace(m_height); |
| 62 visitor->trace(m_patternTransform); |
| 63 visitor->trace(m_patternUnits); |
| 64 visitor->trace(m_patternContentUnits); |
| 65 SVGElement::trace(visitor); |
| 66 SVGURIReference::trace(visitor); |
| 67 SVGTests::trace(visitor); |
| 68 SVGFitToViewBox::trace(visitor); |
| 69 } |
| 70 |
56 DEFINE_NODE_FACTORY(SVGPatternElement) | 71 DEFINE_NODE_FACTORY(SVGPatternElement) |
57 | 72 |
58 bool SVGPatternElement::isSupportedAttribute(const QualifiedName& attrName) | 73 bool SVGPatternElement::isSupportedAttribute(const QualifiedName& attrName) |
59 { | 74 { |
60 DEFINE_STATIC_LOCAL(HashSet<QualifiedName>, supportedAttributes, ()); | 75 DEFINE_STATIC_LOCAL(HashSet<QualifiedName>, supportedAttributes, ()); |
61 if (supportedAttributes.isEmpty()) { | 76 if (supportedAttributes.isEmpty()) { |
62 SVGURIReference::addSupportedAttributes(supportedAttributes); | 77 SVGURIReference::addSupportedAttributes(supportedAttributes); |
63 SVGTests::addSupportedAttributes(supportedAttributes); | 78 SVGTests::addSupportedAttributes(supportedAttributes); |
64 SVGFitToViewBox::addSupportedAttributes(supportedAttributes); | 79 SVGFitToViewBox::addSupportedAttributes(supportedAttributes); |
65 supportedAttributes.add(SVGNames::patternUnitsAttr); | 80 supportedAttributes.add(SVGNames::patternUnitsAttr); |
(...skipping 118 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
184 | 199 |
185 bool SVGPatternElement::selfHasRelativeLengths() const | 200 bool SVGPatternElement::selfHasRelativeLengths() const |
186 { | 201 { |
187 return m_x->currentValue()->isRelative() | 202 return m_x->currentValue()->isRelative() |
188 || m_y->currentValue()->isRelative() | 203 || m_y->currentValue()->isRelative() |
189 || m_width->currentValue()->isRelative() | 204 || m_width->currentValue()->isRelative() |
190 || m_height->currentValue()->isRelative(); | 205 || m_height->currentValue()->isRelative(); |
191 } | 206 } |
192 | 207 |
193 } // namespace blink | 208 } // namespace blink |
OLD | NEW |