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 185 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
196 Element* parentElement() const; | 196 Element* parentElement() const; |
197 ContainerNode* parentElementOrShadowRoot() const; | 197 ContainerNode* parentElementOrShadowRoot() const; |
198 ContainerNode* parentElementOrDocumentFragment() const; | 198 ContainerNode* parentElementOrDocumentFragment() const; |
199 Node* previousSibling() const { return m_previous; } | 199 Node* previousSibling() const { return m_previous; } |
200 Node* nextSibling() const { return m_next; } | 200 Node* nextSibling() const { return m_next; } |
201 NodeList* childNodes(); | 201 NodeList* childNodes(); |
202 Node* firstChild() const; | 202 Node* firstChild() const; |
203 Node* lastChild() const; | 203 Node* lastChild() const; |
204 Node& treeRoot() const; | 204 Node& treeRoot() const; |
205 Node& shadowIncludingRoot() const; | 205 Node& shadowIncludingRoot() const; |
| 206 bool isUnclosedNodeOf(const Node&) const; |
206 | 207 |
207 void prepend(const HeapVector<NodeOrString>&, ExceptionState&); | 208 void prepend(const HeapVector<NodeOrString>&, ExceptionState&); |
208 void append(const HeapVector<NodeOrString>&, ExceptionState&); | 209 void append(const HeapVector<NodeOrString>&, ExceptionState&); |
209 void before(const HeapVector<NodeOrString>&, ExceptionState&); | 210 void before(const HeapVector<NodeOrString>&, ExceptionState&); |
210 void after(const HeapVector<NodeOrString>&, ExceptionState&); | 211 void after(const HeapVector<NodeOrString>&, ExceptionState&); |
211 void replaceWith(const HeapVector<NodeOrString>&, ExceptionState&); | 212 void replaceWith(const HeapVector<NodeOrString>&, ExceptionState&); |
212 void remove(ExceptionState& = ASSERT_NO_EXCEPTION); | 213 void remove(ExceptionState& = ASSERT_NO_EXCEPTION); |
213 | 214 |
214 Node* pseudoAwareNextSibling() const; | 215 Node* pseudoAwareNextSibling() const; |
215 Node* pseudoAwarePreviousSibling() const; | 216 Node* pseudoAwarePreviousSibling() const; |
(...skipping 704 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
920 } // namespace blink | 921 } // namespace blink |
921 | 922 |
922 #ifndef NDEBUG | 923 #ifndef NDEBUG |
923 // Outside the WebCore namespace for ease of invocation from gdb. | 924 // Outside the WebCore namespace for ease of invocation from gdb. |
924 void showNode(const blink::Node*); | 925 void showNode(const blink::Node*); |
925 void showTree(const blink::Node*); | 926 void showTree(const blink::Node*); |
926 void showNodePath(const blink::Node*); | 927 void showNodePath(const blink::Node*); |
927 #endif | 928 #endif |
928 | 929 |
929 #endif // Node_h | 930 #endif // Node_h |
OLD | NEW |