| 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-2011, 2014 Apple Inc. All rights reserved. | 5 * Copyright (C) 2004-2011, 2014 Apple Inc. All rights 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 |
| 11 * version 2 of the License, or (at your option) any later version. | 11 * version 2 of the License, or (at your option) any later version. |
| 12 * | 12 * |
| 13 * This library is distributed in the hope that it will be useful, | 13 * This library is distributed in the hope that it will be useful, |
| 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 16 * Library General Public License for more details. | 16 * Library General Public License for more details. |
| 17 * | 17 * |
| 18 * You should have received a copy of the GNU Library General Public License | 18 * You should have received a copy of the GNU Library General Public License |
| 19 * along with this library; see the file COPYING.LIB. If not, write to | 19 * along with this library; see the file COPYING.LIB. If not, write to |
| 20 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 20 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
| 21 * Boston, MA 02110-1301, USA. | 21 * Boston, MA 02110-1301, USA. |
| 22 * | 22 * |
| 23 */ | 23 */ |
| 24 | 24 |
| 25 #ifndef Node_h | 25 #ifndef Node_h |
| 26 #define Node_h | 26 #define Node_h |
| 27 | 27 |
| 28 #include "bindings/core/v8/ExceptionStatePlaceholder.h" | 28 #include "bindings/core/v8/ExceptionStatePlaceholder.h" |
| 29 #include "bindings/core/v8/UnionTypesCore.h" |
| 29 #include "core/CoreExport.h" | 30 #include "core/CoreExport.h" |
| 30 #include "core/dom/MutationObserver.h" | 31 #include "core/dom/MutationObserver.h" |
| 31 #include "core/dom/SimulatedClickOptions.h" | 32 #include "core/dom/SimulatedClickOptions.h" |
| 32 #include "core/dom/StyleChangeReason.h" | 33 #include "core/dom/StyleChangeReason.h" |
| 33 #include "core/dom/TreeScope.h" | 34 #include "core/dom/TreeScope.h" |
| 34 #include "core/dom/TreeShared.h" | 35 #include "core/dom/TreeShared.h" |
| 35 #include "core/editing/EditingBoundary.h" | 36 #include "core/editing/EditingBoundary.h" |
| 36 #include "core/events/EventTarget.h" | 37 #include "core/events/EventTarget.h" |
| 37 #include "core/inspector/InspectorCounters.h" | 38 #include "core/inspector/InspectorCounters.h" |
| 38 #include "core/style/ComputedStyleConstants.h" | 39 #include "core/style/ComputedStyleConstants.h" |
| (...skipping 160 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 199 ContainerNode* parentNode() const; | 200 ContainerNode* parentNode() const; |
| 200 Element* parentElement() const; | 201 Element* parentElement() const; |
| 201 ContainerNode* parentElementOrShadowRoot() const; | 202 ContainerNode* parentElementOrShadowRoot() const; |
| 202 ContainerNode* parentElementOrDocumentFragment() const; | 203 ContainerNode* parentElementOrDocumentFragment() const; |
| 203 Node* previousSibling() const { return m_previous; } | 204 Node* previousSibling() const { return m_previous; } |
| 204 Node* nextSibling() const { return m_next; } | 205 Node* nextSibling() const { return m_next; } |
| 205 PassRefPtrWillBeRawPtr<NodeList> childNodes(); | 206 PassRefPtrWillBeRawPtr<NodeList> childNodes(); |
| 206 Node* firstChild() const; | 207 Node* firstChild() const; |
| 207 Node* lastChild() const; | 208 Node* lastChild() const; |
| 208 | 209 |
| 210 void prepend(const HeapVector<NodeOrString>&, ExceptionState&); |
| 211 void append(const HeapVector<NodeOrString>&, ExceptionState&); |
| 212 void before(const HeapVector<NodeOrString>&, ExceptionState&); |
| 213 void after(const HeapVector<NodeOrString>&, ExceptionState&); |
| 214 void replaceWith(const HeapVector<NodeOrString>&, ExceptionState&); |
| 209 void remove(ExceptionState&); | 215 void remove(ExceptionState&); |
| 216 PassRefPtrWillBeRawPtr<Node> nodeOrStringToNode(const NodeOrString&); |
| 217 Node* viablePreviosOrNextSibling(const HeapVector<NodeOrString>&, bool); |
| 218 PassRefPtrWillBeRawPtr<Node> convertNodesIntoNode(const HeapVector<NodeOrStr
ing>&); |
| 210 | 219 |
| 211 Node* pseudoAwareNextSibling() const; | 220 Node* pseudoAwareNextSibling() const; |
| 212 Node* pseudoAwarePreviousSibling() const; | 221 Node* pseudoAwarePreviousSibling() const; |
| 213 Node* pseudoAwareFirstChild() const; | 222 Node* pseudoAwareFirstChild() const; |
| 214 Node* pseudoAwareLastChild() const; | 223 Node* pseudoAwareLastChild() const; |
| 215 | 224 |
| 216 virtual KURL baseURI() const; | 225 virtual KURL baseURI() const; |
| 217 | 226 |
| 218 PassRefPtrWillBeRawPtr<Node> insertBefore(PassRefPtrWillBeRawPtr<Node> newCh
ild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION); | 227 PassRefPtrWillBeRawPtr<Node> insertBefore(PassRefPtrWillBeRawPtr<Node> newCh
ild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 219 PassRefPtrWillBeRawPtr<Node> replaceChild(PassRefPtrWillBeRawPtr<Node> newCh
ild, PassRefPtrWillBeRawPtr<Node> oldChild, ExceptionState& = ASSERT_NO_EXCEPTIO
N); | 228 PassRefPtrWillBeRawPtr<Node> replaceChild(PassRefPtrWillBeRawPtr<Node> newCh
ild, PassRefPtrWillBeRawPtr<Node> oldChild, ExceptionState& = ASSERT_NO_EXCEPTIO
N); |
| (...skipping 697 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 917 } // namespace blink | 926 } // namespace blink |
| 918 | 927 |
| 919 #ifndef NDEBUG | 928 #ifndef NDEBUG |
| 920 // Outside the WebCore namespace for ease of invocation from gdb. | 929 // Outside the WebCore namespace for ease of invocation from gdb. |
| 921 void showNode(const blink::Node*); | 930 void showNode(const blink::Node*); |
| 922 void showTree(const blink::Node*); | 931 void showTree(const blink::Node*); |
| 923 void showNodePath(const blink::Node*); | 932 void showNodePath(const blink::Node*); |
| 924 #endif | 933 #endif |
| 925 | 934 |
| 926 #endif // Node_h | 935 #endif // Node_h |
| OLD | NEW |