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, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights 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 187 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
198 Element* previousElementSibling() const; | 198 Element* previousElementSibling() const; |
199 Element* nextElementSibling() const; | 199 Element* nextElementSibling() const; |
200 void remove(ExceptionCode&); | 200 void remove(ExceptionCode&); |
201 | 201 |
202 Node* pseudoAwareNextSibling() const; | 202 Node* pseudoAwareNextSibling() const; |
203 Node* pseudoAwarePreviousSibling() const; | 203 Node* pseudoAwarePreviousSibling() const; |
204 Node* pseudoAwareFirstChild() const; | 204 Node* pseudoAwareFirstChild() const; |
205 Node* pseudoAwareLastChild() const; | 205 Node* pseudoAwareLastChild() const; |
206 | 206 |
207 virtual KURL baseURI() const; | 207 virtual KURL baseURI() const; |
208 | |
209 void getSubresourceURLs(ListHashSet<KURL>&) const; | |
210 | 208 |
211 // These should all actually return a node, but this is only important for l
anguage bindings, | 209 // These should all actually return a node, but this is only important for l
anguage bindings, |
212 // which will already know and hold a ref on the right node to return. Retur
ning bool allows | 210 // which will already know and hold a ref on the right node to return. Retur
ning bool allows |
213 // these methods to be more efficient since they don't need to return a ref | 211 // these methods to be more efficient since they don't need to return a ref |
214 void insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionCode&,
AttachBehavior = AttachNow); | 212 void insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionCode&,
AttachBehavior = AttachNow); |
215 void replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionCode&,
AttachBehavior = AttachNow); | 213 void replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionCode&,
AttachBehavior = AttachNow); |
216 void removeChild(Node* child, ExceptionCode&); | 214 void removeChild(Node* child, ExceptionCode&); |
217 void appendChild(PassRefPtr<Node> newChild, ExceptionCode&, AttachBehavior =
AttachNow); | 215 void appendChild(PassRefPtr<Node> newChild, ExceptionCode&, AttachBehavior =
AttachNow); |
218 | 216 |
219 bool hasChildNodes() const { return firstChild(); } | 217 bool hasChildNodes() const { return firstChild(); } |
(...skipping 725 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
945 | 943 |
946 } //namespace | 944 } //namespace |
947 | 945 |
948 #ifndef NDEBUG | 946 #ifndef NDEBUG |
949 // Outside the WebCore namespace for ease of invocation from gdb. | 947 // Outside the WebCore namespace for ease of invocation from gdb. |
950 void showTree(const WebCore::Node*); | 948 void showTree(const WebCore::Node*); |
951 void showNodePath(const WebCore::Node*); | 949 void showNodePath(const WebCore::Node*); |
952 #endif | 950 #endif |
953 | 951 |
954 #endif | 952 #endif |
OLD | NEW |