| 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 132 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 143 element->patternTransform()->currentValue()->concatenate(transform); | 143 element->patternTransform()->currentValue()->concatenate(transform); |
| 144 attributes.setPatternTransform(transform); | 144 attributes.setPatternTransform(transform); |
| 145 } | 145 } |
| 146 | 146 |
| 147 if (!attributes.hasPatternContentElement() && ElementTraversal::firstWithin(
*element)) | 147 if (!attributes.hasPatternContentElement() && ElementTraversal::firstWithin(
*element)) |
| 148 attributes.setPatternContentElement(element); | 148 attributes.setPatternContentElement(element); |
| 149 } | 149 } |
| 150 | 150 |
| 151 void SVGPatternElement::collectPatternAttributes(PatternAttributes& attributes)
const | 151 void SVGPatternElement::collectPatternAttributes(PatternAttributes& attributes)
const |
| 152 { | 152 { |
| 153 WillBeHeapHashSet<RawPtrWillBeMember<const SVGPatternElement>> processedPatt
erns; | 153 HeapHashSet<Member<const SVGPatternElement>> processedPatterns; |
| 154 const SVGPatternElement* current = this; | 154 const SVGPatternElement* current = this; |
| 155 | 155 |
| 156 while (true) { | 156 while (true) { |
| 157 setPatternAttributes(current, attributes); | 157 setPatternAttributes(current, attributes); |
| 158 processedPatterns.add(current); | 158 processedPatterns.add(current); |
| 159 | 159 |
| 160 // Respect xlink:href, take attributes from referenced element | 160 // Respect xlink:href, take attributes from referenced element |
| 161 Node* refNode = SVGURIReference::targetElementFromIRIString(current->hre
fString(), treeScope()); | 161 Node* refNode = SVGURIReference::targetElementFromIRIString(current->hre
fString(), treeScope()); |
| 162 | 162 |
| 163 // Only consider attached SVG pattern elements. | 163 // Only consider attached SVG pattern elements. |
| (...skipping 17 matching lines...) Expand all Loading... |
| 181 | 181 |
| 182 bool SVGPatternElement::selfHasRelativeLengths() const | 182 bool SVGPatternElement::selfHasRelativeLengths() const |
| 183 { | 183 { |
| 184 return m_x->currentValue()->isRelative() | 184 return m_x->currentValue()->isRelative() |
| 185 || m_y->currentValue()->isRelative() | 185 || m_y->currentValue()->isRelative() |
| 186 || m_width->currentValue()->isRelative() | 186 || m_width->currentValue()->isRelative() |
| 187 || m_height->currentValue()->isRelative(); | 187 || m_height->currentValue()->isRelative(); |
| 188 } | 188 } |
| 189 | 189 |
| 190 } // namespace blink | 190 } // namespace blink |
| OLD | NEW |