| 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 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
| 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights reserved. |
| 6 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) | 6 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) |
| 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 154 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 165 bool hasTagName(const QualifiedName&) const; | 165 bool hasTagName(const QualifiedName&) const; |
| 166 virtual String nodeName() const = 0; | 166 virtual String nodeName() const = 0; |
| 167 virtual String nodeValue() const; | 167 virtual String nodeValue() const; |
| 168 virtual void setNodeValue(const String&); | 168 virtual void setNodeValue(const String&); |
| 169 virtual NodeType nodeType() const = 0; | 169 virtual NodeType nodeType() const = 0; |
| 170 ContainerNode* parentNode() const; | 170 ContainerNode* parentNode() const; |
| 171 Element* parentElement() const; | 171 Element* parentElement() const; |
| 172 ContainerNode* parentElementOrShadowRoot() const; | 172 ContainerNode* parentElementOrShadowRoot() const; |
| 173 Node* previousSibling() const { return m_previous; } | 173 Node* previousSibling() const { return m_previous; } |
| 174 Node* nextSibling() const { return m_next; } | 174 Node* nextSibling() const { return m_next; } |
| 175 PassRefPtr<NodeList> childNodes(); | 175 PassRefPtrWillBeRawPtr<NodeList> childNodes(); |
| 176 Node* firstChild() const; | 176 Node* firstChild() const; |
| 177 Node* lastChild() const; | 177 Node* lastChild() const; |
| 178 | 178 |
| 179 void remove(ExceptionState&); | 179 void remove(ExceptionState&); |
| 180 | 180 |
| 181 Node* pseudoAwareNextSibling() const; | 181 Node* pseudoAwareNextSibling() const; |
| 182 Node* pseudoAwarePreviousSibling() const; | 182 Node* pseudoAwarePreviousSibling() const; |
| 183 Node* pseudoAwareFirstChild() const; | 183 Node* pseudoAwareFirstChild() const; |
| 184 Node* pseudoAwareLastChild() const; | 184 Node* pseudoAwareLastChild() const; |
| 185 | 185 |
| (...skipping 473 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 659 virtual void registerScopedHTMLStyleChild(); | 659 virtual void registerScopedHTMLStyleChild(); |
| 660 virtual void unregisterScopedHTMLStyleChild(); | 660 virtual void unregisterScopedHTMLStyleChild(); |
| 661 size_t numberOfScopedHTMLStyleChildren() const; | 661 size_t numberOfScopedHTMLStyleChildren() const; |
| 662 | 662 |
| 663 unsigned connectedSubframeCount() const; | 663 unsigned connectedSubframeCount() const; |
| 664 void incrementConnectedSubframeCount(unsigned amount = 1); | 664 void incrementConnectedSubframeCount(unsigned amount = 1); |
| 665 void decrementConnectedSubframeCount(unsigned amount = 1); | 665 void decrementConnectedSubframeCount(unsigned amount = 1); |
| 666 void updateAncestorConnectedSubframeCountForRemoval() const; | 666 void updateAncestorConnectedSubframeCountForRemoval() const; |
| 667 void updateAncestorConnectedSubframeCountForInsertion() const; | 667 void updateAncestorConnectedSubframeCountForInsertion() const; |
| 668 | 668 |
| 669 PassRefPtr<NodeList> getDestinationInsertionPoints(); | 669 PassRefPtrWillBeRawPtr<NodeList> getDestinationInsertionPoints(); |
| 670 | 670 |
| 671 void setAlreadySpellChecked(bool flag) { setFlag(flag, AlreadySpellCheckedFl
ag); } | 671 void setAlreadySpellChecked(bool flag) { setFlag(flag, AlreadySpellCheckedFl
ag); } |
| 672 bool isAlreadySpellChecked() { return getFlag(AlreadySpellCheckedFlag); } | 672 bool isAlreadySpellChecked() { return getFlag(AlreadySpellCheckedFlag); } |
| 673 | 673 |
| 674 bool isFinishedParsingChildren() const { return getFlag(IsFinishedParsingChi
ldrenFlag); } | 674 bool isFinishedParsingChildren() const { return getFlag(IsFinishedParsingChi
ldrenFlag); } |
| 675 | 675 |
| 676 virtual void trace(Visitor*); | 676 virtual void trace(Visitor*); |
| 677 | 677 |
| 678 private: | 678 private: |
| 679 enum NodeFlags { | 679 enum NodeFlags { |
| (...skipping 251 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 931 } // namespace WebCore | 931 } // namespace WebCore |
| 932 | 932 |
| 933 #ifndef NDEBUG | 933 #ifndef NDEBUG |
| 934 // Outside the WebCore namespace for ease of invocation from gdb. | 934 // Outside the WebCore namespace for ease of invocation from gdb. |
| 935 void showNode(const WebCore::Node*); | 935 void showNode(const WebCore::Node*); |
| 936 void showTree(const WebCore::Node*); | 936 void showTree(const WebCore::Node*); |
| 937 void showNodePath(const WebCore::Node*); | 937 void showNodePath(const WebCore::Node*); |
| 938 #endif | 938 #endif |
| 939 | 939 |
| 940 #endif | 940 #endif |
| OLD | NEW |