Oilpan: Remove most WillBe types from the code base

third_party/WebKit/Source/core/page/TouchDisambiguation.cpp

 /*
  * 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 66 matching lines @@
     score *= std::max((padding - abs(distance.height())) * reciprocalPadding, 0.f);
 
     return score;
 }
 
 struct TouchTargetData {
     IntRect windowBoundingBox;
     float score;
 };
 
-void findGoodTouchTargets(const IntRect& touchBoxInRootFrame, LocalFrame* mainFrame, Vector<IntRect>& goodTargets, WillBeHeapVector<RawPtrWillBeMember<Node>>& highlightNodes)
+void findGoodTouchTargets(const IntRect& touchBoxInRootFrame, LocalFrame* mainFrame, Vector<IntRect>& goodTargets, HeapVector<Member<Node>>& highlightNodes)
 {
     goodTargets.clear();
 
     int touchPointPadding = ceil(std::max(touchBoxInRootFrame.width(), touchBoxInRootFrame.height()) * 0.5);
 
     IntPoint touchPoint = touchBoxInRootFrame.center();
     IntPoint contentsPoint = mainFrame->view()->rootFrameToContents(touchPoint);
 
     HitTestResult result = mainFrame->eventHandler().hitTestResultAtPoint(contentsPoint, HitTestRequest::ReadOnly | HitTestRequest::Active | HitTestRequest::ListBased, LayoutSize(touchPointPadding, touchPointPadding));
-    const WillBeHeapListHashSet<RefPtrWillBeMember<Node>>& hitResults = result.listBasedTestResult();
+    const HeapListHashSet<Member<Node>>& hitResults = result.listBasedTestResult();
 
     // Blacklist nodes that are container of disambiguated nodes.
     // It is not uncommon to have a clickable <div> that contains other clickable objects.
     // This heuristic avoids excessive disambiguation in that case.
-    WillBeHeapHashSet<RawPtrWillBeMember<Node>> blackList;
+    HeapHashSet<Member<Node>> blackList;
     for (const auto& hitResult : hitResults) {
         // Ignore any Nodes that can't be clicked on.
         LayoutObject* layoutObject = hitResult.get()->layoutObject();
         if (!layoutObject || !hitResult.get()->willRespondToMouseClickEvents())
             continue;
 
         // Blacklist all of the Node's containers.
         for (LayoutBlock* container = layoutObject->containingBlock(); container; container = container->containingBlock()) {
             Node* containerNode = container->node();
             if (!containerNode)
                 continue;
             if (!blackList.add(containerNode).isNewEntry)
                 break;
         }
     }
 
-    WillBeHeapHashMap<RawPtrWillBeMember<Node>, TouchTargetData> touchTargets;
+    HeapHashMap<Member<Node>, TouchTargetData> touchTargets;
     float bestScore = 0;
     for (const auto& hitResult : hitResults) {
         for (Node* node = hitResult.get(); node; node = node->parentNode()) {
             if (blackList.contains(node))
                 continue;
             if (node->isDocumentNode() || isHTMLHtmlElement(*node) || isHTMLBodyElement(*node))
                 break;
             if (node->willRespondToMouseClickEvents()) {
                 TouchTargetData& targetData = touchTargets.add(node, TouchTargetData()).storedValue->value;
                 targetData.windowBoundingBox = boundingBoxForEventNodes(node);
                 targetData.score = scoreTouchTarget(touchPoint, touchPointPadding, targetData.windowBoundingBox);
                 bestScore = std::max(bestScore, targetData.score);
                 break;
             }
         }
     }
 
     for (const auto& touchTarget : touchTargets) {
         // Currently the scoring function uses the overlap area with the fat point as the score.
         // We ignore the candidates that has less than 1/2 overlap (we consider not really ambiguous enough) than the best candidate to avoid excessive popups.
         if (touchTarget.value.score < bestScore * 0.5)
             continue;
         goodTargets.append(touchTarget.value.windowBoundingBox);
         highlightNodes.append(touchTarget.key);
     }
 }
 
 } // namespace blink