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 * |
11 * This library is distributed in the hope that it will be useful, | 11 * This library is distributed in the hope that it will be useful, |
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
14 * Library General Public License for more details. | 14 * Library General Public License for more details. |
15 * | 15 * |
16 * You should have received a copy of the GNU Library General Public License | 16 * You should have received a copy of the GNU Library General Public License |
17 * along with this library; see the file COPYING.LIB. If not, write to | 17 * along with this library; see the file COPYING.LIB. If not, write to |
18 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 18 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
19 * Boston, MA 02110-1301, USA. | 19 * Boston, MA 02110-1301, USA. |
20 */ | 20 */ |
21 | 21 |
22 #ifndef SVGElement_h | 22 #ifndef SVGElement_h |
23 #define SVGElement_h | 23 #define SVGElement_h |
24 | 24 |
25 #include "core/dom/Element.h" | 25 #include "core/dom/Element.h" |
26 #include "core/svg/SVGAnimatedString.h" | 26 #include "core/svg/SVGAnimatedString.h" |
27 #include "core/svg/SVGParsingError.h" | 27 #include "core/svg/SVGParsingError.h" |
28 #include "core/svg/properties/SVGAnimatedPropertyMacros.h" | |
29 #include "core/svg/properties/SVGPropertyInfo.h" | 28 #include "core/svg/properties/SVGPropertyInfo.h" |
30 #include "platform/Timer.h" | 29 #include "platform/Timer.h" |
31 #include "wtf/HashMap.h" | 30 #include "wtf/HashMap.h" |
32 #include "wtf/OwnPtr.h" | 31 #include "wtf/OwnPtr.h" |
33 | 32 |
34 namespace WebCore { | 33 namespace WebCore { |
35 | 34 |
36 class AffineTransform; | 35 class AffineTransform; |
37 class CSSCursorImageValue; | 36 class CSSCursorImageValue; |
38 class Document; | 37 class Document; |
(...skipping 170 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
209 typedef HashMap<QualifiedName, RefPtr<NewSVGAnimatedPropertyBase> > Attribut
eToPropertyMap; | 208 typedef HashMap<QualifiedName, RefPtr<NewSVGAnimatedPropertyBase> > Attribut
eToPropertyMap; |
210 AttributeToPropertyMap m_newAttributeToPropertyMap; | 209 AttributeToPropertyMap m_newAttributeToPropertyMap; |
211 | 210 |
212 #if !ASSERT_DISABLED | 211 #if !ASSERT_DISABLED |
213 bool m_inRelativeLengthClientsInvalidation; | 212 bool m_inRelativeLengthClientsInvalidation; |
214 #endif | 213 #endif |
215 unsigned m_isContextElement : 1; | 214 unsigned m_isContextElement : 1; |
216 unsigned m_hasSVGRareData : 1; | 215 unsigned m_hasSVGRareData : 1; |
217 | 216 |
218 RefPtr<SVGAnimatedString> m_className; | 217 RefPtr<SVGAnimatedString> m_className; |
219 BEGIN_DECLARE_ANIMATED_PROPERTIES(SVGElement) | |
220 END_DECLARE_ANIMATED_PROPERTIES | |
221 }; | 218 }; |
222 | 219 |
223 struct SVGAttributeHashTranslator { | 220 struct SVGAttributeHashTranslator { |
224 static unsigned hash(const QualifiedName& key) | 221 static unsigned hash(const QualifiedName& key) |
225 { | 222 { |
226 if (key.hasPrefix()) { | 223 if (key.hasPrefix()) { |
227 QualifiedNameComponents components = { nullAtom.impl(), key.localNam
e().impl(), key.namespaceURI().impl() }; | 224 QualifiedNameComponents components = { nullAtom.impl(), key.localNam
e().impl(), key.namespaceURI().impl() }; |
228 return hashComponents(components); | 225 return hashComponents(components); |
229 } | 226 } |
230 return DefaultHash<QualifiedName>::Hash::hash(key); | 227 return DefaultHash<QualifiedName>::Hash::hash(key); |
231 } | 228 } |
232 static bool equal(const QualifiedName& a, const QualifiedName& b) { return a
.matches(b); } | 229 static bool equal(const QualifiedName& a, const QualifiedName& b) { return a
.matches(b); } |
233 }; | 230 }; |
234 | 231 |
235 DEFINE_NODE_TYPE_CASTS(SVGElement, isSVGElement()); | 232 DEFINE_NODE_TYPE_CASTS(SVGElement, isSVGElement()); |
236 | 233 |
237 } | 234 } |
238 | 235 |
239 #endif | 236 #endif |
OLD | NEW |