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* pseudoAwareLastChild() const; | 221 Node* pseudoAwareLastChild() const; |
222 | 222 |
223 virtual KURL baseURI() const; | 223 virtual KURL baseURI() const; |
224 | 224 |
225 PassRefPtrWillBeRawPtr<Node> insertBefore(PassRefPtrWillBeRawPtr<Node> newCh
ild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION); | 225 PassRefPtrWillBeRawPtr<Node> insertBefore(PassRefPtrWillBeRawPtr<Node> newCh
ild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
226 PassRefPtrWillBeRawPtr<Node> replaceChild(PassRefPtrWillBeRawPtr<Node> newCh
ild, PassRefPtrWillBeRawPtr<Node> oldChild, ExceptionState& = ASSERT_NO_EXCEPTIO
N); | 226 PassRefPtrWillBeRawPtr<Node> replaceChild(PassRefPtrWillBeRawPtr<Node> newCh
ild, PassRefPtrWillBeRawPtr<Node> oldChild, ExceptionState& = ASSERT_NO_EXCEPTIO
N); |
227 PassRefPtrWillBeRawPtr<Node> removeChild(PassRefPtrWillBeRawPtr<Node> child,
ExceptionState& = ASSERT_NO_EXCEPTION); | 227 PassRefPtrWillBeRawPtr<Node> removeChild(PassRefPtrWillBeRawPtr<Node> child,
ExceptionState& = ASSERT_NO_EXCEPTION); |
228 PassRefPtrWillBeRawPtr<Node> appendChild(PassRefPtrWillBeRawPtr<Node> newChi
ld, ExceptionState& = ASSERT_NO_EXCEPTION); | 228 PassRefPtrWillBeRawPtr<Node> appendChild(PassRefPtrWillBeRawPtr<Node> newChi
ld, ExceptionState& = ASSERT_NO_EXCEPTION); |
229 | 229 |
230 bool hasChildren() const { return firstChild(); } | 230 bool hasChildren() const { return firstChild(); } |
231 virtual PassRefPtrWillBeRawPtr<Node> cloneNode(bool deep = false) = 0; | 231 virtual PassRefPtrWillBeRawPtr<Node> cloneNode(bool deep) = 0; |
232 void normalize(); | 232 void normalize(); |
233 | 233 |
234 bool isSameNode(Node* other) const { return this == other; } | 234 bool isSameNode(Node* other) const { return this == other; } |
235 bool isEqualNode(Node*) const; | 235 bool isEqualNode(Node*) const; |
236 bool isDefaultNamespace(const AtomicString& namespaceURI) const; | 236 bool isDefaultNamespace(const AtomicString& namespaceURI) const; |
237 const AtomicString& lookupPrefix(const AtomicString& namespaceURI) const; | 237 const AtomicString& lookupPrefix(const AtomicString& namespaceURI) const; |
238 const AtomicString& lookupNamespaceURI(const String& prefix) const; | 238 const AtomicString& lookupNamespaceURI(const String& prefix) const; |
239 | 239 |
240 String textContent(bool convertBRsToNewlines = false) const; | 240 String textContent(bool convertBRsToNewlines = false) const; |
241 void setTextContent(const String&); | 241 void setTextContent(const String&); |
(...skipping 673 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
915 } // namespace blink | 915 } // namespace blink |
916 | 916 |
917 #ifndef NDEBUG | 917 #ifndef NDEBUG |
918 // Outside the WebCore namespace for ease of invocation from gdb. | 918 // Outside the WebCore namespace for ease of invocation from gdb. |
919 void showNode(const blink::Node*); | 919 void showNode(const blink::Node*); |
920 void showTree(const blink::Node*); | 920 void showTree(const blink::Node*); |
921 void showNodePath(const blink::Node*); | 921 void showNodePath(const blink::Node*); |
922 #endif | 922 #endif |
923 | 923 |
924 #endif // Node_h | 924 #endif // Node_h |
OLD | NEW |