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 |
(...skipping 191 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
202 ContainerNode* parentNode() const; | 202 ContainerNode* parentNode() const; |
203 Element* parentElement() const; | 203 Element* parentElement() const; |
204 ContainerNode* parentElementOrShadowRoot() const; | 204 ContainerNode* parentElementOrShadowRoot() const; |
205 ContainerNode* parentElementOrDocumentFragment() const; | 205 ContainerNode* parentElementOrDocumentFragment() const; |
206 Node* previousSibling() const { return m_previous; } | 206 Node* previousSibling() const { return m_previous; } |
207 Node* nextSibling() const { return m_next; } | 207 Node* nextSibling() const { return m_next; } |
208 PassRefPtrWillBeRawPtr<NodeList> childNodes(); | 208 PassRefPtrWillBeRawPtr<NodeList> childNodes(); |
209 Node* firstChild() const; | 209 Node* firstChild() const; |
210 Node* lastChild() const; | 210 Node* lastChild() const; |
211 | 211 |
212 void remove(ExceptionState&); | 212 void remove(ExceptionState& = ASSERT_NO_EXCEPTION); |
213 | 213 |
214 Node* pseudoAwareNextSibling() const; | 214 Node* pseudoAwareNextSibling() const; |
215 Node* pseudoAwarePreviousSibling() const; | 215 Node* pseudoAwarePreviousSibling() const; |
216 Node* pseudoAwareFirstChild() const; | 216 Node* pseudoAwareFirstChild() const; |
217 Node* pseudoAwareLastChild() const; | 217 Node* pseudoAwareLastChild() const; |
218 | 218 |
219 virtual KURL baseURI() const; | 219 virtual KURL baseURI() const; |
220 | 220 |
221 PassRefPtrWillBeRawPtr<Node> insertBefore(PassRefPtrWillBeRawPtr<Node> newCh
ild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION); | 221 PassRefPtrWillBeRawPtr<Node> insertBefore(PassRefPtrWillBeRawPtr<Node> newCh
ild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
222 PassRefPtrWillBeRawPtr<Node> replaceChild(PassRefPtrWillBeRawPtr<Node> newCh
ild, PassRefPtrWillBeRawPtr<Node> oldChild, ExceptionState& = ASSERT_NO_EXCEPTIO
N); | 222 PassRefPtrWillBeRawPtr<Node> replaceChild(PassRefPtrWillBeRawPtr<Node> newCh
ild, PassRefPtrWillBeRawPtr<Node> oldChild, ExceptionState& = ASSERT_NO_EXCEPTIO
N); |
(...skipping 677 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
900 } // namespace blink | 900 } // namespace blink |
901 | 901 |
902 #ifndef NDEBUG | 902 #ifndef NDEBUG |
903 // Outside the WebCore namespace for ease of invocation from gdb. | 903 // Outside the WebCore namespace for ease of invocation from gdb. |
904 void showNode(const blink::Node*); | 904 void showNode(const blink::Node*); |
905 void showTree(const blink::Node*); | 905 void showTree(const blink::Node*); |
906 void showNodePath(const blink::Node*); | 906 void showNodePath(const blink::Node*); |
907 #endif | 907 #endif |
908 | 908 |
909 #endif // Node_h | 909 #endif // Node_h |
OLD | NEW |