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