Rebuild layout tree in flat tree order.

third_party/WebKit/Source/core/dom/shadow/InsertionPoint.h

 /*
  * Copyright (C) 2012 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 40 matching lines @@
 
   bool IsShadowInsertionPoint() const;
   bool IsContentInsertionPoint() const;
 
   StaticNodeList* getDistributedNodes();
 
   virtual bool CanAffectSelector() const { return false; }
 
   void AttachLayoutTree(const AttachContext& = AttachContext()) override;
   void DetachLayoutTree(const AttachContext& = AttachContext()) override;
+  void RebuildDistributedChildrenLayoutTrees();
 
   size_t DistributedNodesSize() const { return distributed_nodes_.size(); }
   Node* DistributedNodeAt(size_t index) const {
     return distributed_nodes_.at(index);
   }
   Node* FirstDistributedNode() const {
     return distributed_nodes_.IsEmpty() ? 0 : distributed_nodes_.First();
   }
   Node* LastDistributedNode() const {
     return distributed_nodes_.IsEmpty() ? 0 : distributed_nodes_.Last();
@@ skipping 51 matching lines @@
 
 const InsertionPoint* ResolveReprojection(const Node*);
 
 void CollectDestinationInsertionPoints(
     const Node&,
     HeapVector<Member<InsertionPoint>, 8>& results);
 
 }  // namespace blink
 
 #endif  // InsertionPoint_h