Migrate WTF::HashSet::add() to ::insert() [part 1 of N]

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 277 matching lines @@
       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;
              visitedNode = parentShadowHostOrOwner(visitedNode)) {
           HeapHashSet<Member<Node>>::AddResult addResult =
-              ancestorsToRespondersSet.add(visitedNode);
+              ancestorsToRespondersSet.insert(visitedNode);
           if (!addResult.isNewEntry)
             break;
         }
         break;
       }
     }
     // Insert the detected responder for all the visited nodes.
     for (unsigned j = 0; j < visitedNodes.size(); j++)
       responderMap.add(visitedNodes[j], respondingNode);
 
@@ skipping 20 matching lines @@
     candidate->document().updateStyleAndLayoutTree();
     if (hasEditableStyle(*candidate)) {
       Node* replacement = candidate;
       Node* parent = candidate->parentOrShadowHostNode();
       while (parent && hasEditableStyle(*parent)) {
         replacement = parent;
         if (editableAncestors.contains(replacement)) {
           replacement = nullptr;
           break;
         }
-        editableAncestors.add(replacement);
+        editableAncestors.insert(replacement);
         parent = parent->parentOrShadowHostNode();
       }
       candidate = replacement;
     }
     if (candidate)
       appendSubtargetsForNode(candidate, subtargets);
   }
 }
 
 // Compiles a list of zoomable subtargets.
@@ skipping 212 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