Chromium Code Reviews| Index: third_party/WebKit/Source/core/dom/shadow/FlatTreeTraversal.cpp |
| diff --git a/third_party/WebKit/Source/core/dom/shadow/FlatTreeTraversal.cpp b/third_party/WebKit/Source/core/dom/shadow/FlatTreeTraversal.cpp |
| index de750fbb3a57b4ec1a9ca5ee39176e8f98de7165..7c81459e95f3ffcdedf39a13f42b66b0f4c1f5f8 100644 |
| --- a/third_party/WebKit/Source/core/dom/shadow/FlatTreeTraversal.cpp |
| +++ b/third_party/WebKit/Source/core/dom/shadow/FlatTreeTraversal.cpp |
| @@ -68,6 +68,10 @@ Node* FlatTreeTraversal::resolveDistributionStartingAt( |
| : sibling->previousSibling())) { |
| if (isHTMLSlotElement(*sibling)) { |
| const HTMLSlotElement& slot = toHTMLSlotElement(*sibling); |
| + if (slot.isInDocumentTree()) { |
| + const_cast<HTMLSlotElement&>(slot) |
|
yosin_UTC9
2016/10/14 01:44:40
Can we integrate collecting distributed nodes into
hayato
2016/10/14 03:05:35
Yeah, that is one of TODO items. That could not be
|
| + .updateDistributedNodesInDocumentTree(); |
|
yosin_UTC9
2016/10/14 01:44:40
It is better that using |collectDistributionNodesI
hayato
2016/10/14 03:05:35
I think using *update* is consistent within this f
|
| + } |
| if (Node* found = (direction == TraversalDirectionForward |
| ? slot.firstDistributedNode() |
| : slot.lastDistributedNode())) |