| Index: third_party/WebKit/Source/core/html/HTMLSlotElement.h
|
| diff --git a/third_party/WebKit/Source/core/html/HTMLSlotElement.h b/third_party/WebKit/Source/core/html/HTMLSlotElement.h
|
| index 828099919c1145bf7ecd888e6d359ed7fa495e6e..a99d623f57d09caadac2d485ca0eedfb5d3788bf 100644
|
| --- a/third_party/WebKit/Source/core/html/HTMLSlotElement.h
|
| +++ b/third_party/WebKit/Source/core/html/HTMLSlotElement.h
|
| @@ -43,9 +43,9 @@ class CORE_EXPORT HTMLSlotElement final : public HTMLElement {
|
| public:
|
| DECLARE_NODE_FACTORY(HTMLSlotElement);
|
|
|
| - const WillBeHeapVector<RefPtrWillBeMember<Node>>& getAssignedNodes() const { ASSERT(!needsDistributionRecalc()); return m_assignedNodes; }
|
| - const WillBeHeapVector<RefPtrWillBeMember<Node>>& getDistributedNodes();
|
| - const WillBeHeapVector<RefPtrWillBeMember<Node>> getAssignedNodesForBinding(const AssignedNodesOptions&);
|
| + const HeapVector<Member<Node>>& getAssignedNodes() const { ASSERT(!needsDistributionRecalc()); return m_assignedNodes; }
|
| + const HeapVector<Member<Node>>& getDistributedNodes();
|
| + const HeapVector<Member<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(); }
|
| @@ -89,11 +89,11 @@ private:
|
| void dispatchSlotChangeEvent();
|
| bool distributionChanged();
|
|
|
| - WillBeHeapVector<RefPtrWillBeMember<Node>> m_assignedNodes;
|
| - WillBeHeapVector<RefPtrWillBeMember<Node>> m_distributedNodes;
|
| - WillBeHeapHashMap<RawPtrWillBeMember<const Node>, size_t> m_distributedIndices;
|
| + HeapVector<Member<Node>> m_assignedNodes;
|
| + HeapVector<Member<Node>> m_distributedNodes;
|
| + HeapHashMap<Member<const Node>, size_t> m_distributedIndices;
|
| // TODO(hayato): Remove m_oldDistibutedNodes and make SlotAssignment check the diffirence between old and new distributed nodes for each slot to save the memories.
|
| - WillBeHeapVector<RefPtrWillBeMember<Node>> m_oldDistributedNodes;
|
| + HeapVector<Member<Node>> m_oldDistributedNodes;
|
| DistributionState m_distributionState;
|
| };
|
|
|
|
|