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 203 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
214 Node* firstChild() const; | 214 Node* firstChild() const; |
215 Node* lastChild() const; | 215 Node* lastChild() const; |
216 | 216 |
217 void remove(ExceptionState& = ASSERT_NO_EXCEPTION); | 217 void remove(ExceptionState& = ASSERT_NO_EXCEPTION); |
218 | 218 |
219 Node* pseudoAwareNextSibling() const; | 219 Node* pseudoAwareNextSibling() const; |
220 Node* pseudoAwarePreviousSibling() const; | 220 Node* pseudoAwarePreviousSibling() const; |
221 Node* pseudoAwareFirstChild() const; | 221 Node* pseudoAwareFirstChild() const; |
222 Node* pseudoAwareLastChild() const; | 222 Node* pseudoAwareLastChild() const; |
223 | 223 |
224 virtual KURL baseURI() const; | 224 const KURL& baseURI() const; |
225 | 225 |
226 PassRefPtrWillBeRawPtr<Node> insertBefore(PassRefPtrWillBeRawPtr<Node> newCh
ild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION); | 226 PassRefPtrWillBeRawPtr<Node> insertBefore(PassRefPtrWillBeRawPtr<Node> newCh
ild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
227 PassRefPtrWillBeRawPtr<Node> replaceChild(PassRefPtrWillBeRawPtr<Node> newCh
ild, PassRefPtrWillBeRawPtr<Node> oldChild, ExceptionState& = ASSERT_NO_EXCEPTIO
N); | 227 PassRefPtrWillBeRawPtr<Node> replaceChild(PassRefPtrWillBeRawPtr<Node> newCh
ild, PassRefPtrWillBeRawPtr<Node> oldChild, ExceptionState& = ASSERT_NO_EXCEPTIO
N); |
228 PassRefPtrWillBeRawPtr<Node> removeChild(PassRefPtrWillBeRawPtr<Node> child,
ExceptionState& = ASSERT_NO_EXCEPTION); | 228 PassRefPtrWillBeRawPtr<Node> removeChild(PassRefPtrWillBeRawPtr<Node> child,
ExceptionState& = ASSERT_NO_EXCEPTION); |
229 PassRefPtrWillBeRawPtr<Node> appendChild(PassRefPtrWillBeRawPtr<Node> newChi
ld, ExceptionState& = ASSERT_NO_EXCEPTION); | 229 PassRefPtrWillBeRawPtr<Node> appendChild(PassRefPtrWillBeRawPtr<Node> newChi
ld, ExceptionState& = ASSERT_NO_EXCEPTION); |
230 | 230 |
231 bool hasChildren() const { return firstChild(); } | 231 bool hasChildren() const { return firstChild(); } |
232 virtual PassRefPtrWillBeRawPtr<Node> cloneNode(bool deep) = 0; | 232 virtual PassRefPtrWillBeRawPtr<Node> cloneNode(bool deep) = 0; |
233 void normalize(); | 233 void normalize(); |
234 | 234 |
(...skipping 683 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
918 } // namespace blink | 918 } // namespace blink |
919 | 919 |
920 #ifndef NDEBUG | 920 #ifndef NDEBUG |
921 // Outside the WebCore namespace for ease of invocation from gdb. | 921 // Outside the WebCore namespace for ease of invocation from gdb. |
922 void showNode(const blink::Node*); | 922 void showNode(const blink::Node*); |
923 void showTree(const blink::Node*); | 923 void showTree(const blink::Node*); |
924 void showNodePath(const blink::Node*); | 924 void showNodePath(const blink::Node*); |
925 #endif | 925 #endif |
926 | 926 |
927 #endif // Node_h | 927 #endif // Node_h |
OLD | NEW |