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 ContainerNode* parentNode() const; | 207 ContainerNode* parentNode() const; |
208 Element* parentElement() const; | 208 Element* parentElement() const; |
209 ContainerNode* parentElementOrShadowRoot() const; | 209 ContainerNode* parentElementOrShadowRoot() const; |
210 ContainerNode* parentElementOrDocumentFragment() const; | 210 ContainerNode* parentElementOrDocumentFragment() const; |
211 Node* previousSibling() const { return m_previous; } | 211 Node* previousSibling() const { return m_previous; } |
212 Node* nextSibling() const { return m_next; } | 212 Node* nextSibling() const { return m_next; } |
213 RawPtr<NodeList> childNodes(); | 213 RawPtr<NodeList> childNodes(); |
214 Node* firstChild() const; | 214 Node* firstChild() const; |
215 Node* lastChild() const; | 215 Node* lastChild() const; |
216 Node& treeRoot() const; | 216 Node& treeRoot() const; |
217 Node& shadowIncludingRoot() const; | |
kochi
2016/04/06 08:56:29
Do you use this in the future CL? (probably yes?)
| |
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 263 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
490 bool isChildOfV1ShadowHost() const; | 491 bool isChildOfV1ShadowHost() const; |
491 bool isChildOfV0ShadowHost() const; | 492 bool isChildOfV0ShadowHost() const; |
492 bool isSlotAssignable() const { return isTextNode() || isElementNode(); } | 493 bool isSlotAssignable() const { return isTextNode() || isElementNode(); } |
493 | 494 |
494 bool isDocumentTypeNode() const { return getNodeType() == DOCUMENT_TYPE_NODE ; } | 495 bool isDocumentTypeNode() const { return getNodeType() == DOCUMENT_TYPE_NODE ; } |
495 virtual bool childTypeAllowed(NodeType) const { return false; } | 496 virtual bool childTypeAllowed(NodeType) const { return false; } |
496 unsigned countChildren() const; | 497 unsigned countChildren() const; |
497 | 498 |
498 bool isDescendantOf(const Node*) const; | 499 bool isDescendantOf(const Node*) const; |
499 bool contains(const Node*) const; | 500 bool contains(const Node*) const; |
500 bool containsIncludingShadowDOM(const Node*) const; | 501 bool isShadowIncludingInclusiveAncestorOf(const Node*) const; |
501 bool containsIncludingHostElements(const Node&) const; | 502 bool containsIncludingHostElements(const Node&) const; |
502 Node* commonAncestor(const Node&, ContainerNode* (*parent)(const Node&)) con st; | 503 Node* commonAncestor(const Node&, ContainerNode* (*parent)(const Node&)) con st; |
503 | 504 |
504 // Used to determine whether range offsets use characters or node indices. | 505 // Used to determine whether range offsets use characters or node indices. |
505 bool offsetInCharacters() const; | 506 bool offsetInCharacters() const; |
506 // Number of DOM 16-bit units contained in node. Note that laid out text len gth can be different - e.g. because of | 507 // Number of DOM 16-bit units contained in node. Note that laid out text len gth can be different - e.g. because of |
507 // css-transform:capitalize breaking up precomposed characters and ligatures . | 508 // css-transform:capitalize breaking up precomposed characters and ligatures . |
508 virtual int maxCharacterOffset() const; | 509 virtual int maxCharacterOffset() const; |
509 | 510 |
510 // Whether or not a selection can be started in this object | 511 // Whether or not a selection can be started in this object |
(...skipping 413 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
924 } // namespace blink | 925 } // namespace blink |
925 | 926 |
926 #ifndef NDEBUG | 927 #ifndef NDEBUG |
927 // Outside the WebCore namespace for ease of invocation from gdb. | 928 // Outside the WebCore namespace for ease of invocation from gdb. |
928 void showNode(const blink::Node*); | 929 void showNode(const blink::Node*); |
929 void showTree(const blink::Node*); | 930 void showTree(const blink::Node*); |
930 void showNodePath(const blink::Node*); | 931 void showNodePath(const blink::Node*); |
931 #endif | 932 #endif |
932 | 933 |
933 #endif // Node_h | 934 #endif // Node_h |
OLD | NEW |