| 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 Rob Buis <buis@kde.org> | 3 * Copyright (C) 2004, 2005, 2006 Rob Buis <buis@kde.org> |
| 4 * Copyright (C) 2009 Apple Inc. All rights reserved. | 4 * Copyright (C) 2009 Apple Inc. 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 142 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 153 | 153 |
| 154 SVGAnimatedString* className() { return m_className.get(); } | 154 SVGAnimatedString* className() { return m_className.get(); } |
| 155 | 155 |
| 156 bool inUseShadowTree() const; | 156 bool inUseShadowTree() const; |
| 157 | 157 |
| 158 protected: | 158 protected: |
| 159 SVGElement(const QualifiedName&, Document&, ConstructionType = CreateSVGElem
ent); | 159 SVGElement(const QualifiedName&, Document&, ConstructionType = CreateSVGElem
ent); |
| 160 | 160 |
| 161 virtual void parseAttribute(const QualifiedName&, const AtomicString&) OVERR
IDE; | 161 virtual void parseAttribute(const QualifiedName&, const AtomicString&) OVERR
IDE; |
| 162 | 162 |
| 163 virtual void finishParsingChildren() OVERRIDE; | |
| 164 virtual void attributeChanged(const QualifiedName&, const AtomicString&, Att
ributeModificationReason = ModifiedDirectly) OVERRIDE; | 163 virtual void attributeChanged(const QualifiedName&, const AtomicString&, Att
ributeModificationReason = ModifiedDirectly) OVERRIDE; |
| 165 | 164 |
| 166 virtual bool isPresentationAttribute(const QualifiedName&) const OVERRIDE; | 165 virtual bool isPresentationAttribute(const QualifiedName&) const OVERRIDE; |
| 167 virtual void collectStyleForPresentationAttribute(const QualifiedName&, cons
t AtomicString&, MutableStylePropertySet*) OVERRIDE; | 166 virtual void collectStyleForPresentationAttribute(const QualifiedName&, cons
t AtomicString&, MutableStylePropertySet*) OVERRIDE; |
| 168 virtual bool rendererIsNeeded(const RenderStyle&) OVERRIDE; | 167 virtual bool rendererIsNeeded(const RenderStyle&) OVERRIDE; |
| 169 | 168 |
| 170 virtual InsertionNotificationRequest insertedInto(ContainerNode*) OVERRIDE; | 169 virtual InsertionNotificationRequest insertedInto(ContainerNode*) OVERRIDE; |
| 171 virtual void removedFrom(ContainerNode*) OVERRIDE; | 170 virtual void removedFrom(ContainerNode*) OVERRIDE; |
| 172 virtual void childrenChanged(bool changedByParser = false, Node* beforeChang
e = 0, Node* afterChange = 0, int childCountDelta = 0) OVERRIDE; | 171 virtual void childrenChanged(bool changedByParser = false, Node* beforeChang
e = 0, Node* afterChange = 0, int childCountDelta = 0) OVERRIDE; |
| 173 | 172 |
| (...skipping 59 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 233 static bool equal(const QualifiedName& a, const QualifiedName& b) { return a
.matches(b); } | 232 static bool equal(const QualifiedName& a, const QualifiedName& b) { return a
.matches(b); } |
| 234 }; | 233 }; |
| 235 | 234 |
| 236 DEFINE_ELEMENT_TYPE_CASTS(SVGElement, isSVGElement()); | 235 DEFINE_ELEMENT_TYPE_CASTS(SVGElement, isSVGElement()); |
| 237 | 236 |
| 238 template <> inline bool isElementOfType<const SVGElement>(const Node& node) { re
turn node.isSVGElement(); } | 237 template <> inline bool isElementOfType<const SVGElement>(const Node& node) { re
turn node.isSVGElement(); } |
| 239 | 238 |
| 240 } | 239 } |
| 241 | 240 |
| 242 #endif | 241 #endif |
| OLD | NEW |