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. | 6 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. |
7 * (http://www.torchmobile.com/) | 7 * (http://www.torchmobile.com/) |
8 * | 8 * |
9 * This library is free software; you can redistribute it and/or | 9 * This library is free software; you can redistribute it and/or |
10 * modify it under the terms of the GNU Library General Public | 10 * modify it under the terms of the GNU Library General Public |
(...skipping 191 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
202 ContainerNode* parentNode() const; | 202 ContainerNode* parentNode() const; |
203 Element* parentElement() const; | 203 Element* parentElement() const; |
204 ContainerNode* parentElementOrShadowRoot() const; | 204 ContainerNode* parentElementOrShadowRoot() const; |
205 ContainerNode* parentElementOrDocumentFragment() const; | 205 ContainerNode* parentElementOrDocumentFragment() const; |
206 Node* previousSibling() const { return m_previous; } | 206 Node* previousSibling() const { return m_previous; } |
207 Node* nextSibling() const { return m_next; } | 207 Node* nextSibling() const { return m_next; } |
208 NodeList* childNodes(); | 208 NodeList* childNodes(); |
209 Node* firstChild() const; | 209 Node* firstChild() const; |
210 Node* lastChild() const; | 210 Node* lastChild() const; |
211 Node* getRootNode(const GetRootNodeOptions&) const; | 211 Node* getRootNode(const GetRootNodeOptions&) const; |
212 Text* nextTextSibling() const; | |
213 Node& treeRoot() const; | 212 Node& treeRoot() const; |
214 Node& shadowIncludingRoot() const; | 213 Node& shadowIncludingRoot() const; |
215 // closed-shadow-hidden is defined at | 214 // closed-shadow-hidden is defined at |
216 // https://dom.spec.whatwg.org/#concept-closed-shadow-hidden | 215 // https://dom.spec.whatwg.org/#concept-closed-shadow-hidden |
217 bool isClosedShadowHiddenFrom(const Node&) const; | 216 bool isClosedShadowHiddenFrom(const Node&) const; |
218 | 217 |
219 void prepend(const HeapVector<NodeOrString>&, ExceptionState&); | 218 void prepend(const HeapVector<NodeOrString>&, ExceptionState&); |
220 void append(const HeapVector<NodeOrString>&, ExceptionState&); | 219 void append(const HeapVector<NodeOrString>&, ExceptionState&); |
221 void before(const HeapVector<NodeOrString>&, ExceptionState&); | 220 void before(const HeapVector<NodeOrString>&, ExceptionState&); |
222 void after(const HeapVector<NodeOrString>&, ExceptionState&); | 221 void after(const HeapVector<NodeOrString>&, ExceptionState&); |
(...skipping 199 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
422 void setHasName(bool f) { | 421 void setHasName(bool f) { |
423 DCHECK(!isTextNode()); | 422 DCHECK(!isTextNode()); |
424 setFlag(f, HasNameOrIsEditingTextFlag); | 423 setFlag(f, HasNameOrIsEditingTextFlag); |
425 } | 424 } |
426 void setChildNeedsStyleRecalc() { setFlag(ChildNeedsStyleRecalcFlag); } | 425 void setChildNeedsStyleRecalc() { setFlag(ChildNeedsStyleRecalcFlag); } |
427 void clearChildNeedsStyleRecalc() { clearFlag(ChildNeedsStyleRecalcFlag); } | 426 void clearChildNeedsStyleRecalc() { clearFlag(ChildNeedsStyleRecalcFlag); } |
428 | 427 |
429 void setNeedsStyleRecalc(StyleChangeType, const StyleChangeReasonForTracing&); | 428 void setNeedsStyleRecalc(StyleChangeType, const StyleChangeReasonForTracing&); |
430 void clearNeedsStyleRecalc(); | 429 void clearNeedsStyleRecalc(); |
431 | 430 |
432 bool needsReattachLayoutTree() { return getFlag(NeedsReattachLayoutTree); } | |
433 bool childNeedsReattachLayoutTree() { | |
434 return getFlag(ChildNeedsReattachLayoutTree); | |
435 } | |
436 | |
437 void setNeedsReattachLayoutTree(); | |
438 void setChildNeedsReattachLayoutTree() { | |
439 setFlag(ChildNeedsReattachLayoutTree); | |
440 } | |
441 | |
442 void clearNeedsReattachLayoutTree() { clearFlag(NeedsReattachLayoutTree); } | |
443 void clearChildNeedsReattachLayoutTree() { | |
444 clearFlag(ChildNeedsReattachLayoutTree); | |
445 } | |
446 | |
447 void markAncestorsWithChildNeedsReattachLayoutTree(); | |
448 | |
449 bool needsDistributionRecalc() const; | 431 bool needsDistributionRecalc() const; |
450 | 432 |
451 bool childNeedsDistributionRecalc() const { | 433 bool childNeedsDistributionRecalc() const { |
452 return getFlag(ChildNeedsDistributionRecalcFlag); | 434 return getFlag(ChildNeedsDistributionRecalcFlag); |
453 } | 435 } |
454 void setChildNeedsDistributionRecalc() { | 436 void setChildNeedsDistributionRecalc() { |
455 setFlag(ChildNeedsDistributionRecalcFlag); | 437 setFlag(ChildNeedsDistributionRecalcFlag); |
456 } | 438 } |
457 void clearChildNeedsDistributionRecalc() { | 439 void clearChildNeedsDistributionRecalc() { |
458 clearFlag(ChildNeedsDistributionRecalcFlag); | 440 clearFlag(ChildNeedsDistributionRecalcFlag); |
(...skipping 576 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1035 } // namespace blink | 1017 } // namespace blink |
1036 | 1018 |
1037 #ifndef NDEBUG | 1019 #ifndef NDEBUG |
1038 // Outside the WebCore namespace for ease of invocation from gdb. | 1020 // Outside the WebCore namespace for ease of invocation from gdb. |
1039 void showNode(const blink::Node*); | 1021 void showNode(const blink::Node*); |
1040 void showTree(const blink::Node*); | 1022 void showTree(const blink::Node*); |
1041 void showNodePath(const blink::Node*); | 1023 void showNodePath(const blink::Node*); |
1042 #endif | 1024 #endif |
1043 | 1025 |
1044 #endif // Node_h | 1026 #endif // Node_h |
OLD | NEW |