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 88 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
99 void animatedPropertyTypeForAttribute(const QualifiedName&, Vector<AnimatedP
ropertyType>&); | 99 void animatedPropertyTypeForAttribute(const QualifiedName&, Vector<AnimatedP
ropertyType>&); |
100 PassRefPtr<NewSVGAnimatedPropertyBase> propertyFromAttribute(const Qualified
Name& attributeName); | 100 PassRefPtr<NewSVGAnimatedPropertyBase> propertyFromAttribute(const Qualified
Name& attributeName); |
101 | 101 |
102 void sendSVGLoadEventIfPossible(bool sendParentLoadEvents = false); | 102 void sendSVGLoadEventIfPossible(bool sendParentLoadEvents = false); |
103 void sendSVGLoadEventIfPossibleAsynchronously(); | 103 void sendSVGLoadEventIfPossibleAsynchronously(); |
104 void svgLoadEventTimerFired(Timer<SVGElement>*); | 104 void svgLoadEventTimerFired(Timer<SVGElement>*); |
105 virtual Timer<SVGElement>* svgLoadEventTimer(); | 105 virtual Timer<SVGElement>* svgLoadEventTimer(); |
106 | 106 |
107 virtual AffineTransform* supplementalTransform() { return 0; } | 107 virtual AffineTransform* supplementalTransform() { return 0; } |
108 | 108 |
109 void invalidateSVGAttributes() { ensureUniqueElementData()->m_animatedSVGAtt
ributesAreDirty = true; } | 109 void invalidateSVGAttributes() { ensureUniqueElementData().m_animatedSVGAttr
ibutesAreDirty = true; } |
110 | 110 |
111 const HashSet<SVGElementInstance*>& instancesForElement() const; | 111 const HashSet<SVGElementInstance*>& instancesForElement() const; |
112 | 112 |
113 bool getBoundingBox(FloatRect&); | 113 bool getBoundingBox(FloatRect&); |
114 | 114 |
115 void setCursorElement(SVGCursorElement*); | 115 void setCursorElement(SVGCursorElement*); |
116 void cursorElementRemoved(); | 116 void cursorElementRemoved(); |
117 void setCursorImageValue(CSSCursorImageValue*); | 117 void setCursorImageValue(CSSCursorImageValue*); |
118 void cursorImageValueRemoved(); | 118 void cursorImageValueRemoved(); |
119 | 119 |
(...skipping 134 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
254 return DefaultHash<QualifiedName>::Hash::hash(key); | 254 return DefaultHash<QualifiedName>::Hash::hash(key); |
255 } | 255 } |
256 static bool equal(const QualifiedName& a, const QualifiedName& b) { return a
.matches(b); } | 256 static bool equal(const QualifiedName& a, const QualifiedName& b) { return a
.matches(b); } |
257 }; | 257 }; |
258 | 258 |
259 DEFINE_NODE_TYPE_CASTS(SVGElement, isSVGElement()); | 259 DEFINE_NODE_TYPE_CASTS(SVGElement, isSVGElement()); |
260 | 260 |
261 } | 261 } |
262 | 262 |
263 #endif | 263 #endif |
OLD | NEW |