Rename slot.getDistributedNodes() to slot.getAssingedNodes({flatten: true}).

third_party/WebKit/Source/core/html/HTMLSlotElement.h

 /*
  * Copyright (C) 2015 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 16 matching lines @@
  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  */
 
 #ifndef HTMLSlotElement_h
 #define HTMLSlotElement_h
 
 #include "core/CoreExport.h"
 #include "core/html/HTMLElement.h"
 
+
+

[kochi, 2016/01/20 08:03:16]

nit: unnecessary newline.

[hayato, 2016/01/20 08:29:07]

Done.

 namespace blink {
 
+class AssignedNodesOptions;
+
 class CORE_EXPORT HTMLSlotElement final : public HTMLElement {
     DEFINE_WRAPPERTYPEINFO();
 public:
     DECLARE_NODE_FACTORY(HTMLSlotElement);
 
     const WillBeHeapVector<RefPtrWillBeMember<Node>>& getAssignedNodes() const { ASSERT(!needsDistributionRecalc()); return m_assignedNodes; }
     const WillBeHeapVector<RefPtrWillBeMember<Node>>& getDistributedNodes() const { ASSERT(!needsDistributionRecalc()); return m_distributedNodes; }
 
-    const WillBeHeapVector<RefPtrWillBeMember<Node>> getAssignedNodesForBinding() { updateDistribution(); return m_assignedNodes; }
-    const WillBeHeapVector<RefPtrWillBeMember<Node>> getDistributedNodesForBinding() { updateDistribution(); return m_distributedNodes; }
+    const WillBeHeapVector<RefPtrWillBeMember<Node>> getAssignedNodesForBinding(const AssignedNodesOptions&);
 
     Node* firstDistributedNode() const { return m_distributedNodes.isEmpty() ? nullptr : m_distributedNodes.first().get(); }
     Node* lastDistributedNode() const { return m_distributedNodes.isEmpty() ? nullptr : m_distributedNodes.last().get(); }
 
     // TODO(hayato): This takes O(N). Make it O(1) with node-to-index hash table.
     Node* distributedNodeNextTo(const Node&) const;
     Node* distributedNodePreviousTo(const Node&) const;
 
     void appendAssignedNode(Node&);
     void appendDistributedNode(Node&);
@@ skipping 18 matching lines @@
     HTMLSlotElement(Document&);
 
     WillBeHeapVector<RefPtrWillBeMember<Node>> m_assignedNodes;
     // TODO(hayato): Share code with DistributedNode class
     WillBeHeapVector<RefPtrWillBeMember<Node>> m_distributedNodes;
 };
 
 } // namespace blink
 
 #endif // HTMLSlotElement_h