| 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. | 6 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. |
| 7 * (http://www.torchmobile.com/) | 7 * (http://www.torchmobile.com/) |
| 8 * | 8 * |
| 9 * This library is free software; you can redistribute it and/or | 9 * This library is free software; you can redistribute it and/or |
| 10 * modify it under the terms of the GNU Library General Public | 10 * modify it under the terms of the GNU Library General Public |
| (...skipping 208 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 219 Node* insertBefore(Node* newChild, | 219 Node* insertBefore(Node* newChild, |
| 220 Node* refChild, | 220 Node* refChild, |
| 221 ExceptionState& = ASSERT_NO_EXCEPTION); | 221 ExceptionState& = ASSERT_NO_EXCEPTION); |
| 222 Node* replaceChild(Node* newChild, | 222 Node* replaceChild(Node* newChild, |
| 223 Node* oldChild, | 223 Node* oldChild, |
| 224 ExceptionState& = ASSERT_NO_EXCEPTION); | 224 ExceptionState& = ASSERT_NO_EXCEPTION); |
| 225 Node* removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION); | 225 Node* removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 226 Node* appendChild(Node* newChild, ExceptionState& = ASSERT_NO_EXCEPTION); | 226 Node* appendChild(Node* newChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 227 | 227 |
| 228 bool hasChildren() const { return firstChild(); } | 228 bool hasChildren() const { return firstChild(); } |
| 229 virtual Node* cloneNode(bool deep) = 0; | 229 virtual Node* cloneNode(bool deep, ExceptionState& = ASSERT_NO_EXCEPTION) = 0; |
| 230 void normalize(); | 230 void normalize(); |
| 231 | 231 |
| 232 bool isEqualNode(Node*) const; | 232 bool isEqualNode(Node*) const; |
| 233 bool isSameNode(const Node* other) const { return this == other; } | 233 bool isSameNode(const Node* other) const { return this == other; } |
| 234 bool isDefaultNamespace(const AtomicString& namespaceURI) const; | 234 bool isDefaultNamespace(const AtomicString& namespaceURI) const; |
| 235 const AtomicString& lookupPrefix(const AtomicString& namespaceURI) const; | 235 const AtomicString& lookupPrefix(const AtomicString& namespaceURI) const; |
| 236 const AtomicString& lookupNamespaceURI(const String& prefix) const; | 236 const AtomicString& lookupNamespaceURI(const String& prefix) const; |
| 237 | 237 |
| 238 String textContent(bool convertBRsToNewlines = false) const; | 238 String textContent(bool convertBRsToNewlines = false) const; |
| 239 void setTextContent(const String&); | 239 void setTextContent(const String&); |
| (...skipping 780 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1020 } // namespace blink | 1020 } // namespace blink |
| 1021 | 1021 |
| 1022 #ifndef NDEBUG | 1022 #ifndef NDEBUG |
| 1023 // Outside the WebCore namespace for ease of invocation from gdb. | 1023 // Outside the WebCore namespace for ease of invocation from gdb. |
| 1024 void showNode(const blink::Node*); | 1024 void showNode(const blink::Node*); |
| 1025 void showTree(const blink::Node*); | 1025 void showTree(const blink::Node*); |
| 1026 void showNodePath(const blink::Node*); | 1026 void showNodePath(const blink::Node*); |
| 1027 #endif | 1027 #endif |
| 1028 | 1028 |
| 1029 #endif // Node_h | 1029 #endif // Node_h |
| OLD | NEW |