Oilpan: Remove most WillBe types from the code base

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 34 matching lines @@
 
     bool hasDistribution() const { return !m_distributedNodes.isEmpty(); }
     void setDistributedNodes(DistributedNodes&);
     void clearDistribution() { m_distributedNodes.clear(); }
     bool isActive() const;
     bool canBeActive() const;
 
     bool isShadowInsertionPoint() const;
     bool isContentInsertionPoint() const;
 
-    PassRefPtrWillBeRawPtr<StaticNodeList> getDistributedNodes();
+    RawPtr<StaticNodeList> getDistributedNodes();
 
     virtual bool canAffectSelector() const { return false; }
 
     void attach(const AttachContext& = AttachContext()) override;
     void detach(const AttachContext& = AttachContext()) override;
 
     size_t distributedNodesSize() const { return m_distributedNodes.size(); }
     Node* distributedNodeAt(size_t index)  const { return m_distributedNodes.at(index).get(); }
     Node* firstDistributedNode() const { return m_distributedNodes.isEmpty() ? 0 : m_distributedNodes.first().get(); }
     Node* lastDistributedNode() const { return m_distributedNodes.isEmpty() ? 0 : m_distributedNodes.last().get(); }
@@ skipping 10 matching lines @@
     void removedFrom(ContainerNode*) override;
     void willRecalcStyle(StyleRecalcChange) override;
 
 private:
     bool isInsertionPoint() const = delete; // This will catch anyone doing an unnecessary check.
 
     DistributedNodes m_distributedNodes;
     bool m_registeredWithShadowRoot;
 };
 
-typedef WillBeHeapVector<RefPtrWillBeMember<InsertionPoint>, 1> DestinationInsertionPoints;
+typedef HeapVector<Member<InsertionPoint>, 1> DestinationInsertionPoints;
 
 DEFINE_ELEMENT_TYPE_CASTS(InsertionPoint, isInsertionPoint());
 
 inline bool isActiveInsertionPoint(const Node& node)
 {
     return node.isInsertionPoint() && toInsertionPoint(node).isActive();
 }
 
 inline bool isActiveShadowInsertionPoint(const Node& node)
 {
@@ skipping 10 matching lines @@
         return node.shadowHost()->shadow();
     if (isActiveInsertionPoint(*parent))
         return node.shadowHost()->shadow();
     if (parent->isElementNode())
         return toElement(parent)->shadow();
     return 0;
 }
 
 const InsertionPoint* resolveReprojection(const Node*);
 
-void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8>& results);
+void collectDestinationInsertionPoints(const Node&, HeapVector<Member<InsertionPoint>, 8>& results);
 
 } // namespace blink
 
 #endif // InsertionPoint_h