Migrate WTF::HashMap::get() to ::at()

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

 /*
  * Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies)
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ skipping 264 matching lines @@
   // either be a responder or have an ancestor that is a responder.  This
   // iteration tests all ancestors at most once by caching earlier results.
   for (unsigned i = 0; i < intersectedNodes.size(); ++i) {
     Node* node = intersectedNodes[i].get();
     HeapVector<Member<Node>> visitedNodes;
     Node* respondingNode = nullptr;
     for (Node* visitedNode = node; visitedNode;
          visitedNode = visitedNode->parentOrShadowHostNode()) {
       // Check if we already have a result for a common ancestor from another
       // candidate.
-      respondingNode = responderMap.get(visitedNode);
+      respondingNode = responderMap.at(visitedNode);
       if (respondingNode)
         break;
       visitedNodes.push_back(visitedNode);
       // Check if the node filter applies, which would mean we have found a
       // responding node.
       if (nodeFilter(visitedNode)) {
         respondingNode = visitedNode;
         // Continue the iteration to collect the ancestors of the responder,
         // which we will need later.
         for (visitedNode = parentShadowHostOrOwner(visitedNode); visitedNode;
@@ skipping 16 matching lines @@
 
   // We compile the list of component absolute quads instead of using the
   // bounding rect to be able to perform better hit-testing on inline links on
   // line-breaks.
   for (unsigned i = 0; i < candidates.size(); i++) {
     Node* candidate = candidates[i];
     // Skip nodes who's responders are ancestors of other responders. This gives
     // preference to the inner-most event-handlers. So that a link is always
     // preferred even when contained in an element that monitors all
     // click-events.
-    Node* respondingNode = responderMap.get(candidate);
+    Node* respondingNode = responderMap.at(candidate);
     ASSERT(respondingNode);
     if (ancestorsToRespondersSet.contains(respondingNode))
       continue;
     // Consolidate bounds for editable content.
     if (editableAncestors.contains(candidate))
       continue;
     candidate->document().updateStyleAndLayoutTree();
     if (hasEditableStyle(*candidate)) {
       Node* replacement = candidate;
       Node* parent = candidate->parentOrShadowHostNode();
@@ skipping 229 matching lines @@
                           const HeapVector<Member<Node>>& nodes) {
   IntPoint targetPoint;
   TouchAdjustment::SubtargetGeometryList subtargets;
   TouchAdjustment::compileZoomableSubtargets(nodes, subtargets);
   return TouchAdjustment::findNodeWithLowestDistanceMetric(
       targetNode, targetPoint, targetArea, touchHotspot, touchArea, subtargets,
       TouchAdjustment::zoomableIntersectionQuotient);
 }
 
 }  // namespace blink