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 219 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
230 | 230 |
231 void buildPendingResourcesIfNeeded(); | 231 void buildPendingResourcesIfNeeded(); |
232 | 232 |
233 bool supportsSpatialNavigationFocus() const; | 233 bool supportsSpatialNavigationFocus() const; |
234 | 234 |
235 WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement> > m_elementsWithRelativ
eLengths; | 235 WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement> > m_elementsWithRelativ
eLengths; |
236 | 236 |
237 typedef HashMap<QualifiedName, RefPtr<SVGAnimatedPropertyBase> > AttributeTo
PropertyMap; | 237 typedef HashMap<QualifiedName, RefPtr<SVGAnimatedPropertyBase> > AttributeTo
PropertyMap; |
238 AttributeToPropertyMap m_newAttributeToPropertyMap; | 238 AttributeToPropertyMap m_newAttributeToPropertyMap; |
239 | 239 |
240 #if !ASSERT_DISABLED | 240 #if ASSERT_ENABLED |
241 bool m_inRelativeLengthClientsInvalidation; | 241 bool m_inRelativeLengthClientsInvalidation; |
242 #endif | 242 #endif |
243 unsigned m_isContextElement : 1; | 243 unsigned m_isContextElement : 1; |
244 | 244 |
245 OwnPtrWillBeMember<SVGElementRareData> m_SVGRareData; | 245 OwnPtrWillBeMember<SVGElementRareData> m_SVGRareData; |
246 RefPtr<SVGAnimatedString> m_className; | 246 RefPtr<SVGAnimatedString> m_className; |
247 }; | 247 }; |
248 | 248 |
249 struct SVGAttributeHashTranslator { | 249 struct SVGAttributeHashTranslator { |
250 static unsigned hash(const QualifiedName& key) | 250 static unsigned hash(const QualifiedName& key) |
251 { | 251 { |
252 if (key.hasPrefix()) { | 252 if (key.hasPrefix()) { |
253 QualifiedNameComponents components = { nullAtom.impl(), key.localNam
e().impl(), key.namespaceURI().impl() }; | 253 QualifiedNameComponents components = { nullAtom.impl(), key.localNam
e().impl(), key.namespaceURI().impl() }; |
254 return hashComponents(components); | 254 return hashComponents(components); |
255 } | 255 } |
256 return DefaultHash<QualifiedName>::Hash::hash(key); | 256 return DefaultHash<QualifiedName>::Hash::hash(key); |
257 } | 257 } |
258 static bool equal(const QualifiedName& a, const QualifiedName& b) { return a
.matches(b); } | 258 static bool equal(const QualifiedName& a, const QualifiedName& b) { return a
.matches(b); } |
259 }; | 259 }; |
260 | 260 |
261 DEFINE_ELEMENT_TYPE_CASTS(SVGElement, isSVGElement()); | 261 DEFINE_ELEMENT_TYPE_CASTS(SVGElement, isSVGElement()); |
262 | 262 |
263 template <> inline bool isElementOfType<const SVGElement>(const Node& node) { re
turn node.isSVGElement(); } | 263 template <> inline bool isElementOfType<const SVGElement>(const Node& node) { re
turn node.isSVGElement(); } |
264 | 264 |
265 } | 265 } |
266 | 266 |
267 #endif | 267 #endif |
OLD | NEW |