| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2004, 2005, 2008 Nikolas Zimmermann <zimmermann@kde.org> | 2 * Copyright (C) 2004, 2005, 2008 Nikolas Zimmermann <zimmermann@kde.org> |
| 3 * Copyright (C) 2004, 2005, 2006 Rob Buis <buis@kde.org> | 3 * Copyright (C) 2004, 2005, 2006 Rob Buis <buis@kde.org> |
| 4 * Copyright (C) 2014 Google, Inc. | 4 * Copyright (C) 2014 Google, Inc. |
| 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 199 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 210 SVGElement::svgAttributeChanged(attrName); | 210 SVGElement::svgAttributeChanged(attrName); |
| 211 } | 211 } |
| 212 | 212 |
| 213 SVGElement* SVGGraphicsElement::nearestViewportElement() const | 213 SVGElement* SVGGraphicsElement::nearestViewportElement() const |
| 214 { | 214 { |
| 215 for (Element* current = parentOrShadowHostElement(); current; current = curr
ent->parentOrShadowHostElement()) { | 215 for (Element* current = parentOrShadowHostElement(); current; current = curr
ent->parentOrShadowHostElement()) { |
| 216 if (isViewportElement(*current)) | 216 if (isViewportElement(*current)) |
| 217 return toSVGElement(current); | 217 return toSVGElement(current); |
| 218 } | 218 } |
| 219 | 219 |
| 220 return 0; | 220 return nullptr; |
| 221 } | 221 } |
| 222 | 222 |
| 223 SVGElement* SVGGraphicsElement::farthestViewportElement() const | 223 SVGElement* SVGGraphicsElement::farthestViewportElement() const |
| 224 { | 224 { |
| 225 SVGElement* farthest = 0; | 225 SVGElement* farthest = 0; |
| 226 for (Element* current = parentOrShadowHostElement(); current; current = curr
ent->parentOrShadowHostElement()) { | 226 for (Element* current = parentOrShadowHostElement(); current; current = curr
ent->parentOrShadowHostElement()) { |
| 227 if (isViewportElement(*current)) | 227 if (isViewportElement(*current)) |
| 228 farthest = toSVGElement(current); | 228 farthest = toSVGElement(current); |
| 229 } | 229 } |
| 230 return farthest; | 230 return farthest; |
| (...skipping 21 matching lines...) Expand all Loading... |
| 252 return new LayoutSVGPath(this); | 252 return new LayoutSVGPath(this); |
| 253 } | 253 } |
| 254 | 254 |
| 255 void SVGGraphicsElement::toClipPath(Path& path) | 255 void SVGGraphicsElement::toClipPath(Path& path) |
| 256 { | 256 { |
| 257 updatePathFromGraphicsElement(this, path); | 257 updatePathFromGraphicsElement(this, path); |
| 258 path.transform(calculateAnimatedLocalTransform()); | 258 path.transform(calculateAnimatedLocalTransform()); |
| 259 } | 259 } |
| 260 | 260 |
| 261 } | 261 } |
| OLD | NEW |