| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
| 4 * (C) 2001 Peter Kelly (pmk@post.com) | 4 * (C) 2001 Peter Kelly (pmk@post.com) |
| 5 * (C) 2001 Dirk Mueller (mueller@kde.org) | 5 * (C) 2001 Dirk Mueller (mueller@kde.org) |
| 6 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2013 Appl
e Inc. All rights reserved. | 6 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2013 Appl
e Inc. All rights reserved. |
| 7 * | 7 * |
| 8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
| 9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
| 10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
| (...skipping 634 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 645 ElementRareData& ensureElementRareData(); | 645 ElementRareData& ensureElementRareData(); |
| 646 | 646 |
| 647 WillBeHeapVector<RefPtrWillBeMember<Attr> >& ensureAttrNodeList(); | 647 WillBeHeapVector<RefPtrWillBeMember<Attr> >& ensureAttrNodeList(); |
| 648 void removeAttrNodeList(); | 648 void removeAttrNodeList(); |
| 649 void detachAllAttrNodesFromElement(); | 649 void detachAllAttrNodesFromElement(); |
| 650 void detachAttrNodeFromElementWithValue(Attr*, const AtomicString& value); | 650 void detachAttrNodeFromElementWithValue(Attr*, const AtomicString& value); |
| 651 void detachAttrNodeAtIndex(Attr*, size_t index); | 651 void detachAttrNodeAtIndex(Attr*, size_t index); |
| 652 | 652 |
| 653 bool isJavaScriptURLAttribute(const Attribute&) const; | 653 bool isJavaScriptURLAttribute(const Attribute&) const; |
| 654 | 654 |
| 655 RefPtr<ElementData> m_elementData; | 655 RefPtrWillBeMember<ElementData> m_elementData; |
| 656 }; | 656 }; |
| 657 | 657 |
| 658 DEFINE_NODE_TYPE_CASTS(Element, isElementNode()); | 658 DEFINE_NODE_TYPE_CASTS(Element, isElementNode()); |
| 659 template <typename T> bool isElementOfType(const Element&); | 659 template <typename T> bool isElementOfType(const Element&); |
| 660 template <typename T> inline bool isElementOfType(const Node& node) { return nod
e.isElementNode() && isElementOfType<const T>(toElement(node)); } | 660 template <typename T> inline bool isElementOfType(const Node& node) { return nod
e.isElementNode() && isElementOfType<const T>(toElement(node)); } |
| 661 template <> inline bool isElementOfType<const Element>(const Element&) { return
true; } | 661 template <> inline bool isElementOfType<const Element>(const Element&) { return
true; } |
| 662 | 662 |
| 663 // Type casting. | 663 // Type casting. |
| 664 template<typename T> inline T& toElement(Node& node) | 664 template<typename T> inline T& toElement(Node& node) |
| 665 { | 665 { |
| (...skipping 218 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 884 static PassRefPtrWillBeRawPtr<T> create(const QualifiedName&, Document&) | 884 static PassRefPtrWillBeRawPtr<T> create(const QualifiedName&, Document&) |
| 885 #define DEFINE_ELEMENT_FACTORY_WITH_TAGNAME(T) \ | 885 #define DEFINE_ELEMENT_FACTORY_WITH_TAGNAME(T) \ |
| 886 PassRefPtrWillBeRawPtr<T> T::create(const QualifiedName& tagName, Document&
document) \ | 886 PassRefPtrWillBeRawPtr<T> T::create(const QualifiedName& tagName, Document&
document) \ |
| 887 { \ | 887 { \ |
| 888 return adoptRefWillBeNoop(new T(tagName, document)); \ | 888 return adoptRefWillBeNoop(new T(tagName, document)); \ |
| 889 } | 889 } |
| 890 | 890 |
| 891 } // namespace | 891 } // namespace |
| 892 | 892 |
| 893 #endif | 893 #endif |
| OLD | NEW |