Oilpan: Remove most WillBe types from the code base

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 25 matching lines @@
 
 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 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(); }
 
     Node* distributedNodeNextTo(const Node&) const;
     Node* distributedNodePreviousTo(const Node&) const;
 
     void appendAssignedNode(Node&);
     void appendDistributedNode(Node&);
     void appendDistributedNodesFrom(const HTMLSlotElement& other);
@@ skipping 23 matching lines @@
 
     void clearDistribution();
     void childrenChanged(const ChildrenChange&) final;
     InsertionNotificationRequest insertedInto(ContainerNode*) final;
     void removedFrom(ContainerNode*) final;
     void willRecalcStyle(StyleRecalcChange) final;
 
     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;
 };
 
 } // namespace blink
 
 #endif // HTMLSlotElement_h