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 171 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
210 typedef HashMap<QualifiedName, RefPtr<NewSVGAnimatedPropertyBase> > Attribut
eToPropertyMap; | 209 typedef HashMap<QualifiedName, RefPtr<NewSVGAnimatedPropertyBase> > Attribut
eToPropertyMap; |
211 AttributeToPropertyMap m_newAttributeToPropertyMap; | 210 AttributeToPropertyMap m_newAttributeToPropertyMap; |
212 | 211 |
213 #if !ASSERT_DISABLED | 212 #if !ASSERT_DISABLED |
214 bool m_inRelativeLengthClientsInvalidation; | 213 bool m_inRelativeLengthClientsInvalidation; |
215 #endif | 214 #endif |
216 unsigned m_isContextElement : 1; | 215 unsigned m_isContextElement : 1; |
217 unsigned m_hasSVGRareData : 1; | 216 unsigned m_hasSVGRareData : 1; |
218 | 217 |
219 RefPtr<SVGAnimatedString> m_className; | 218 RefPtr<SVGAnimatedString> m_className; |
220 BEGIN_DECLARE_ANIMATED_PROPERTIES(SVGElement) | |
221 END_DECLARE_ANIMATED_PROPERTIES | |
222 }; | 219 }; |
223 | 220 |
224 struct SVGAttributeHashTranslator { | 221 struct SVGAttributeHashTranslator { |
225 static unsigned hash(const QualifiedName& key) | 222 static unsigned hash(const QualifiedName& key) |
226 { | 223 { |
227 if (key.hasPrefix()) { | 224 if (key.hasPrefix()) { |
228 QualifiedNameComponents components = { nullAtom.impl(), key.localNam
e().impl(), key.namespaceURI().impl() }; | 225 QualifiedNameComponents components = { nullAtom.impl(), key.localNam
e().impl(), key.namespaceURI().impl() }; |
229 return hashComponents(components); | 226 return hashComponents(components); |
230 } | 227 } |
231 return DefaultHash<QualifiedName>::Hash::hash(key); | 228 return DefaultHash<QualifiedName>::Hash::hash(key); |
232 } | 229 } |
233 static bool equal(const QualifiedName& a, const QualifiedName& b) { return a
.matches(b); } | 230 static bool equal(const QualifiedName& a, const QualifiedName& b) { return a
.matches(b); } |
234 }; | 231 }; |
235 | 232 |
236 DEFINE_NODE_TYPE_CASTS(SVGElement, isSVGElement()); | 233 DEFINE_NODE_TYPE_CASTS(SVGElement, isSVGElement()); |
237 | 234 |
238 } | 235 } |
239 | 236 |
240 #endif | 237 #endif |
OLD | NEW |