| 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 204 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 215 Node& treeRoot() const; | 215 Node& treeRoot() const; |
| 216 Node& shadowIncludingRoot() const; | 216 Node& shadowIncludingRoot() const; |
| 217 | 217 |
| 218 void remove(ExceptionState& = ASSERT_NO_EXCEPTION); | 218 void remove(ExceptionState& = ASSERT_NO_EXCEPTION); |
| 219 | 219 |
| 220 Node* pseudoAwareNextSibling() const; | 220 Node* pseudoAwareNextSibling() const; |
| 221 Node* pseudoAwarePreviousSibling() const; | 221 Node* pseudoAwarePreviousSibling() const; |
| 222 Node* pseudoAwareFirstChild() const; | 222 Node* pseudoAwareFirstChild() const; |
| 223 Node* pseudoAwareLastChild() const; | 223 Node* pseudoAwareLastChild() const; |
| 224 | 224 |
| 225 Node* retarget(const Node& target) const; | |
| 226 | |
| 227 const KURL& baseURI() const; | 225 const KURL& baseURI() const; |
| 228 | 226 |
| 229 Node* insertBefore(Node* newChild, Node* refChild, ExceptionState& = ASSERT_
NO_EXCEPTION); | 227 Node* insertBefore(Node* newChild, Node* refChild, ExceptionState& = ASSERT_
NO_EXCEPTION); |
| 230 Node* replaceChild(Node* newChild, Node* oldChild, ExceptionState& = ASSERT_
NO_EXCEPTION); | 228 Node* replaceChild(Node* newChild, Node* oldChild, ExceptionState& = ASSERT_
NO_EXCEPTION); |
| 231 Node* removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION); | 229 Node* removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 232 Node* appendChild(Node* newChild, ExceptionState& = ASSERT_NO_EXCEPTION); | 230 Node* appendChild(Node* newChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 233 | 231 |
| 234 bool hasChildren() const { return firstChild(); } | 232 bool hasChildren() const { return firstChild(); } |
| 235 virtual Node* cloneNode(bool deep) = 0; | 233 virtual Node* cloneNode(bool deep) = 0; |
| 236 void normalize(); | 234 void normalize(); |
| (...skipping 693 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 930 } // namespace blink | 928 } // namespace blink |
| 931 | 929 |
| 932 #ifndef NDEBUG | 930 #ifndef NDEBUG |
| 933 // Outside the WebCore namespace for ease of invocation from gdb. | 931 // Outside the WebCore namespace for ease of invocation from gdb. |
| 934 void showNode(const blink::Node*); | 932 void showNode(const blink::Node*); |
| 935 void showTree(const blink::Node*); | 933 void showTree(const blink::Node*); |
| 936 void showNodePath(const blink::Node*); | 934 void showNodePath(const blink::Node*); |
| 937 #endif | 935 #endif |
| 938 | 936 |
| 939 #endif // Node_h | 937 #endif // Node_h |
| OLD | NEW |