Oilpan: Remove most WillBe types from the code base

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

 /*
  * Copyright (C) 2013 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 24 matching lines @@
 #include "wtf/HashMap.h"
 #include "wtf/Vector.h"
 
 namespace blink {
 
 class DistributedNodes final {
     DISALLOW_NEW();
 public:
     DistributedNodes() { }
 
-    PassRefPtrWillBeRawPtr<Node> first() const { return m_nodes.first(); }
-    PassRefPtrWillBeRawPtr<Node> last() const { return m_nodes.last(); }
-    PassRefPtrWillBeRawPtr<Node> at(size_t index) const { return m_nodes.at(index); }
+    RawPtr<Node> first() const { return m_nodes.first(); }
+    RawPtr<Node> last() const { return m_nodes.last(); }
+    RawPtr<Node> at(size_t index) const { return m_nodes.at(index); }
 
     size_t size() const { return m_nodes.size(); }
     bool isEmpty() const { return m_nodes.isEmpty(); }
 
-    void append(PassRefPtrWillBeRawPtr<Node>);
+    void append(RawPtr<Node>);
     void clear() { m_nodes.clear(); m_indices.clear(); }
     void shrinkToFit() { m_nodes.shrinkToFit(); }
 
     bool contains(const Node* node) const { return m_indices.contains(node); }
     size_t find(const Node*) const;
     Node* nextTo(const Node*) const;
     Node* previousTo(const Node*) const;
 
     void swap(DistributedNodes& other);
 
     DECLARE_TRACE();
 
 private:
-    WillBeHeapVector<RefPtrWillBeMember<Node>> m_nodes;
-    WillBeHeapHashMap<RawPtrWillBeMember<const Node>, size_t> m_indices;
+    HeapVector<Member<Node>> m_nodes;
+    HeapHashMap<Member<const Node>, size_t> m_indices;
 };
 
 } // namespace blink
 
 #endif