| 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 210 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 221 Node* insertBefore(Node* newChild, Node* refChild, ExceptionState& = ASSERT_
NO_EXCEPTION); | 221 Node* insertBefore(Node* newChild, Node* refChild, ExceptionState& = ASSERT_
NO_EXCEPTION); |
| 222 Node* replaceChild(Node* newChild, Node* oldChild, ExceptionState& = ASSERT_
NO_EXCEPTION); | 222 Node* replaceChild(Node* newChild, Node* oldChild, ExceptionState& = ASSERT_
NO_EXCEPTION); |
| 223 Node* removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION); | 223 Node* removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 224 Node* appendChild(Node* newChild, ExceptionState& = ASSERT_NO_EXCEPTION); | 224 Node* appendChild(Node* newChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 225 | 225 |
| 226 bool hasChildren() const { return firstChild(); } | 226 bool hasChildren() const { return firstChild(); } |
| 227 virtual Node* cloneNode(bool deep) = 0; | 227 virtual Node* cloneNode(bool deep) = 0; |
| 228 void normalize(); | 228 void normalize(); |
| 229 | 229 |
| 230 bool isEqualNode(Node*) const; | 230 bool isEqualNode(Node*) const; |
| 231 bool isSameNode(Node* other) const { return this == other; } | 231 bool isSameNode(const Node* other) const { return this == other; } |
| 232 bool isDefaultNamespace(const AtomicString& namespaceURI) const; | 232 bool isDefaultNamespace(const AtomicString& namespaceURI) const; |
| 233 const AtomicString& lookupPrefix(const AtomicString& namespaceURI) const; | 233 const AtomicString& lookupPrefix(const AtomicString& namespaceURI) const; |
| 234 const AtomicString& lookupNamespaceURI(const String& prefix) const; | 234 const AtomicString& lookupNamespaceURI(const String& prefix) const; |
| 235 | 235 |
| 236 String textContent(bool convertBRsToNewlines = false) const; | 236 String textContent(bool convertBRsToNewlines = false) const; |
| 237 void setTextContent(const String&); | 237 void setTextContent(const String&); |
| 238 | 238 |
| 239 bool supportsAltText(); | 239 bool supportsAltText(); |
| 240 | 240 |
| 241 // Other methods (not part of DOM) | 241 // Other methods (not part of DOM) |
| (...skipping 678 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 920 } // namespace blink | 920 } // namespace blink |
| 921 | 921 |
| 922 #ifndef NDEBUG | 922 #ifndef NDEBUG |
| 923 // Outside the WebCore namespace for ease of invocation from gdb. | 923 // Outside the WebCore namespace for ease of invocation from gdb. |
| 924 void showNode(const blink::Node*); | 924 void showNode(const blink::Node*); |
| 925 void showTree(const blink::Node*); | 925 void showTree(const blink::Node*); |
| 926 void showNodePath(const blink::Node*); | 926 void showNodePath(const blink::Node*); |
| 927 #endif | 927 #endif |
| 928 | 928 |
| 929 #endif // Node_h | 929 #endif // Node_h |
| OLD | NEW |