Chromium Code Reviews| 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 196 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 207 virtual NodeType nodeType() const = 0; | 207 virtual NodeType nodeType() const = 0; |
| 208 ContainerNode* parentNode() const; | 208 ContainerNode* parentNode() const; |
| 209 Element* parentElement() const; | 209 Element* parentElement() const; |
| 210 ContainerNode* parentElementOrShadowRoot() const; | 210 ContainerNode* parentElementOrShadowRoot() const; |
| 211 ContainerNode* parentElementOrDocumentFragment() const; | 211 ContainerNode* parentElementOrDocumentFragment() const; |
| 212 Node* previousSibling() const { return m_previous; } | 212 Node* previousSibling() const { return m_previous; } |
| 213 Node* nextSibling() const { return m_next; } | 213 Node* nextSibling() const { return m_next; } |
| 214 PassRefPtrWillBeRawPtr<NodeList> childNodes(); | 214 PassRefPtrWillBeRawPtr<NodeList> childNodes(); |
| 215 Node* firstChild() const; | 215 Node* firstChild() const; |
| 216 Node* lastChild() const; | 216 Node* lastChild() const; |
| 217 Node* treeRoot(); | |
|
hayato
2016/02/01 05:48:47
This can be:
Node& treeRoot() const;
| |
| 217 | 218 |
| 218 void remove(ExceptionState& = ASSERT_NO_EXCEPTION); | 219 void remove(ExceptionState& = ASSERT_NO_EXCEPTION); |
| 219 | 220 |
| 220 Node* pseudoAwareNextSibling() const; | 221 Node* pseudoAwareNextSibling() const; |
| 221 Node* pseudoAwarePreviousSibling() const; | 222 Node* pseudoAwarePreviousSibling() const; |
| 222 Node* pseudoAwareFirstChild() const; | 223 Node* pseudoAwareFirstChild() const; |
| 223 Node* pseudoAwareLastChild() const; | 224 Node* pseudoAwareLastChild() const; |
| 224 | 225 |
| 225 const KURL& baseURI() const; | 226 const KURL& baseURI() const; |
| 226 | 227 |
| (...skipping 699 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 926 } // namespace blink | 927 } // namespace blink |
| 927 | 928 |
| 928 #ifndef NDEBUG | 929 #ifndef NDEBUG |
| 929 // Outside the WebCore namespace for ease of invocation from gdb. | 930 // Outside the WebCore namespace for ease of invocation from gdb. |
| 930 void showNode(const blink::Node*); | 931 void showNode(const blink::Node*); |
| 931 void showTree(const blink::Node*); | 932 void showTree(const blink::Node*); |
| 932 void showNodePath(const blink::Node*); | 933 void showNodePath(const blink::Node*); |
| 933 #endif | 934 #endif |
| 934 | 935 |
| 935 #endif // Node_h | 936 #endif // Node_h |
| OLD | NEW |