| 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, 2014 Apple Inc. All rights reserved. | 4 * Copyright (C) 2009, 2014 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 30 matching lines...) Expand all Loading... |
| 41 class SubtreeLayoutScope; | 41 class SubtreeLayoutScope; |
| 42 class SVGCursorElement; | 42 class SVGCursorElement; |
| 43 class SVGDocumentExtensions; | 43 class SVGDocumentExtensions; |
| 44 class SVGElement; | 44 class SVGElement; |
| 45 class SVGElementRareData; | 45 class SVGElementRareData; |
| 46 class SVGFitToViewBox; | 46 class SVGFitToViewBox; |
| 47 class SVGLength; | 47 class SVGLength; |
| 48 class SVGSVGElement; | 48 class SVGSVGElement; |
| 49 class SVGUseElement; | 49 class SVGUseElement; |
| 50 | 50 |
| 51 typedef WillBeHeapHashSet<RawPtrWillBeMember<SVGElement> > SVGElementSet; | 51 typedef WillBeHeapHashSet<RawPtrWillBeMember<SVGElement>> SVGElementSet; |
| 52 | 52 |
| 53 class SVGElement : public Element { | 53 class SVGElement : public Element { |
| 54 DEFINE_WRAPPERTYPEINFO(); | 54 DEFINE_WRAPPERTYPEINFO(); |
| 55 public: | 55 public: |
| 56 virtual ~SVGElement(); | 56 virtual ~SVGElement(); |
| 57 virtual void attach(const AttachContext&) override; | 57 virtual void attach(const AttachContext&) override; |
| 58 virtual void detach(const AttachContext&) override; | 58 virtual void detach(const AttachContext&) override; |
| 59 | 59 |
| 60 virtual short tabIndex() const override; | 60 virtual short tabIndex() const override; |
| 61 virtual bool supportsFocus() const override { return false; } | 61 virtual bool supportsFocus() const override { return false; } |
| (...skipping 42 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 104 void sendSVGLoadEventIfPossibleAsynchronously(); | 104 void sendSVGLoadEventIfPossibleAsynchronously(); |
| 105 void svgLoadEventTimerFired(Timer<SVGElement>*); | 105 void svgLoadEventTimerFired(Timer<SVGElement>*); |
| 106 virtual Timer<SVGElement>* svgLoadEventTimer(); | 106 virtual Timer<SVGElement>* svgLoadEventTimer(); |
| 107 | 107 |
| 108 virtual AffineTransform* animateMotionTransform() { return 0; } | 108 virtual AffineTransform* animateMotionTransform() { return 0; } |
| 109 | 109 |
| 110 void invalidateSVGAttributes() { ensureUniqueElementData().m_animatedSVGAttr
ibutesAreDirty = true; } | 110 void invalidateSVGAttributes() { ensureUniqueElementData().m_animatedSVGAttr
ibutesAreDirty = true; } |
| 111 void invalidateSVGPresentationAttributeStyle() { ensureUniqueElementData().m
_presentationAttributeStyleIsDirty = true; } | 111 void invalidateSVGPresentationAttributeStyle() { ensureUniqueElementData().m
_presentationAttributeStyleIsDirty = true; } |
| 112 void addSVGLengthPropertyToPresentationAttributeStyle(MutableStylePropertySe
t*, CSSPropertyID, SVGLength&); | 112 void addSVGLengthPropertyToPresentationAttributeStyle(MutableStylePropertySe
t*, CSSPropertyID, SVGLength&); |
| 113 | 113 |
| 114 const WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement> >& instancesForEl
ement() const; | 114 const WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement>>& instancesForEle
ment() const; |
| 115 void mapInstanceToElement(SVGElement*); | 115 void mapInstanceToElement(SVGElement*); |
| 116 void removeInstanceMapping(SVGElement*); | 116 void removeInstanceMapping(SVGElement*); |
| 117 | 117 |
| 118 bool getBoundingBox(FloatRect&); | 118 bool getBoundingBox(FloatRect&); |
| 119 | 119 |
| 120 void setCursorElement(SVGCursorElement*); | 120 void setCursorElement(SVGCursorElement*); |
| 121 void setCursorImageValue(CSSCursorImageValue*); | 121 void setCursorImageValue(CSSCursorImageValue*); |
| 122 | 122 |
| 123 #if !ENABLE(OILPAN) | 123 #if !ENABLE(OILPAN) |
| 124 void cursorElementRemoved(); | 124 void cursorElementRemoved(); |
| (...skipping 110 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 235 private: | 235 private: |
| 236 bool isSVGElement() const = delete; // This will catch anyone doing an unnec
essary check. | 236 bool isSVGElement() const = delete; // This will catch anyone doing an unnec
essary check. |
| 237 bool isStyledElement() const = delete; // This will catch anyone doing an un
necessary check. | 237 bool isStyledElement() const = delete; // This will catch anyone doing an un
necessary check. |
| 238 | 238 |
| 239 LayoutStyle* computedStyle(PseudoId = NOPSEUDO); | 239 LayoutStyle* computedStyle(PseudoId = NOPSEUDO); |
| 240 virtual LayoutStyle* virtualComputedStyle(PseudoId pseudoElementSpecifier =
NOPSEUDO) override final { return computedStyle(pseudoElementSpecifier); } | 240 virtual LayoutStyle* virtualComputedStyle(PseudoId pseudoElementSpecifier =
NOPSEUDO) override final { return computedStyle(pseudoElementSpecifier); } |
| 241 virtual void willRecalcStyle(StyleRecalcChange) override; | 241 virtual void willRecalcStyle(StyleRecalcChange) override; |
| 242 | 242 |
| 243 void buildPendingResourcesIfNeeded(); | 243 void buildPendingResourcesIfNeeded(); |
| 244 | 244 |
| 245 WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement> > m_elementsWithRelativ
eLengths; | 245 WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement>> m_elementsWithRelative
Lengths; |
| 246 | 246 |
| 247 typedef WillBeHeapHashMap<QualifiedName, RefPtrWillBeMember<SVGAnimatedPrope
rtyBase> > AttributeToPropertyMap; | 247 typedef WillBeHeapHashMap<QualifiedName, RefPtrWillBeMember<SVGAnimatedPrope
rtyBase>> AttributeToPropertyMap; |
| 248 AttributeToPropertyMap m_attributeToPropertyMap; | 248 AttributeToPropertyMap m_attributeToPropertyMap; |
| 249 | 249 |
| 250 #if ENABLE(ASSERT) | 250 #if ENABLE(ASSERT) |
| 251 bool m_inRelativeLengthClientsInvalidation; | 251 bool m_inRelativeLengthClientsInvalidation; |
| 252 #endif | 252 #endif |
| 253 | 253 |
| 254 OwnPtrWillBeMember<SVGElementRareData> m_SVGRareData; | 254 OwnPtrWillBeMember<SVGElementRareData> m_SVGRareData; |
| 255 RefPtrWillBeMember<SVGAnimatedString> m_className; | 255 RefPtrWillBeMember<SVGAnimatedString> m_className; |
| 256 }; | 256 }; |
| 257 | 257 |
| (...skipping 29 matching lines...) Expand all Loading... |
| 287 template<typename T> inline bool is##thisType(const PassRefPtrWillBeRawPtr<T
>& node) { return is##thisType(node.get()); } \ | 287 template<typename T> inline bool is##thisType(const PassRefPtrWillBeRawPtr<T
>& node) { return is##thisType(node.get()); } \ |
| 288 template<typename T> inline bool is##thisType(const RefPtrWillBeMember<T>& n
ode) { return is##thisType(node.get()); } \ | 288 template<typename T> inline bool is##thisType(const RefPtrWillBeMember<T>& n
ode) { return is##thisType(node.get()); } \ |
| 289 template <> inline bool isElementOfType<const thisType>(const SVGElement& el
ement) { return is##thisType(element); } \ | 289 template <> inline bool isElementOfType<const thisType>(const SVGElement& el
ement) { return is##thisType(element); } \ |
| 290 DEFINE_ELEMENT_TYPE_CASTS_WITH_FUNCTION(thisType) | 290 DEFINE_ELEMENT_TYPE_CASTS_WITH_FUNCTION(thisType) |
| 291 | 291 |
| 292 } // namespace blink | 292 } // namespace blink |
| 293 | 293 |
| 294 #include "core/SVGElementTypeHelpers.h" | 294 #include "core/SVGElementTypeHelpers.h" |
| 295 | 295 |
| 296 #endif // SVGElement_h | 296 #endif // SVGElement_h |
| OLD | NEW |