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 181 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
192 element->patternTransform()->currentValue()->concatenate(transform); | 192 element->patternTransform()->currentValue()->concatenate(transform); |
193 attributes.setPatternTransform(transform); | 193 attributes.setPatternTransform(transform); |
194 } | 194 } |
195 | 195 |
196 if (!attributes.hasPatternContentElement() && ElementTraversal::firstWithin(
*element)) | 196 if (!attributes.hasPatternContentElement() && ElementTraversal::firstWithin(
*element)) |
197 attributes.setPatternContentElement(element); | 197 attributes.setPatternContentElement(element); |
198 } | 198 } |
199 | 199 |
200 void SVGPatternElement::collectPatternAttributes(PatternAttributes& attributes)
const | 200 void SVGPatternElement::collectPatternAttributes(PatternAttributes& attributes)
const |
201 { | 201 { |
202 WillBeHeapHashSet<RawPtrWillBeMember<const SVGPatternElement> > processedPat
terns; | 202 WillBeHeapHashSet<RawPtrWillBeMember<const SVGPatternElement>> processedPatt
erns; |
203 const SVGPatternElement* current = this; | 203 const SVGPatternElement* current = this; |
204 | 204 |
205 while (true) { | 205 while (true) { |
206 setPatternAttributes(current, attributes); | 206 setPatternAttributes(current, attributes); |
207 processedPatterns.add(current); | 207 processedPatterns.add(current); |
208 | 208 |
209 // Respect xlink:href, take attributes from referenced element | 209 // Respect xlink:href, take attributes from referenced element |
210 Node* refNode = SVGURIReference::targetElementFromIRIString(current->hre
fString(), treeScope()); | 210 Node* refNode = SVGURIReference::targetElementFromIRIString(current->hre
fString(), treeScope()); |
211 if (isSVGPatternElement(refNode)) { | 211 if (isSVGPatternElement(refNode)) { |
212 current = toSVGPatternElement(refNode); | 212 current = toSVGPatternElement(refNode); |
(...skipping 18 matching lines...) Expand all Loading... |
231 | 231 |
232 bool SVGPatternElement::selfHasRelativeLengths() const | 232 bool SVGPatternElement::selfHasRelativeLengths() const |
233 { | 233 { |
234 return m_x->currentValue()->isRelative() | 234 return m_x->currentValue()->isRelative() |
235 || m_y->currentValue()->isRelative() | 235 || m_y->currentValue()->isRelative() |
236 || m_width->currentValue()->isRelative() | 236 || m_width->currentValue()->isRelative() |
237 || m_height->currentValue()->isRelative(); | 237 || m_height->currentValue()->isRelative(); |
238 } | 238 } |
239 | 239 |
240 } // namespace blink | 240 } // namespace blink |
OLD | NEW |