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

third_party/WebKit/Source/core/xml/XPathNodeSet.cpp

 /*
  * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org>
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
@@ skipping 109 matching lines @@
         sortBlock(sortedEnd, to, parentMatrix, mayContainAttributeNodes);
       return;
     }
   }
 
   // Children nodes of the common ancestor induce a subdivision of our
   // node-set. Sort it according to this subdivision, and recursively sort
   // each group.
   HeapHashSet<Member<Node>> parentNodes;
   for (unsigned i = from; i < to; ++i)
-    parentNodes.add(parentWithDepth(commonAncestorDepth + 1, parentMatrix[i]));
+    parentNodes.insert(
+        parentWithDepth(commonAncestorDepth + 1, parentMatrix[i]));
 
   unsigned previousGroupEnd = from;
   unsigned groupEnd = from;
   for (Node* n = commonAncestor->firstChild(); n; n = n->nextSibling()) {
     // If parentNodes contains the node, perform a linear search to move its
     // children in the node-set to the beginning.
     if (parentNodes.contains(n)) {
       for (unsigned i = groupEnd; i < to; ++i) {
         if (parentWithDepth(commonAncestorDepth + 1, parentMatrix[i]) == n)
           parentMatrix[i].swap(parentMatrix[groupEnd++]);
@@ skipping 69 matching lines @@
 }
 
 void NodeSet::traversalSort() const {
   HeapHashSet<Member<Node>> nodes;
   bool containsAttributeNodes = false;
 
   unsigned nodeCount = m_nodes.size();
   DCHECK_GT(nodeCount, 1u);
   for (unsigned i = 0; i < nodeCount; ++i) {
     Node* node = m_nodes[i].get();
-    nodes.add(node);
+    nodes.insert(node);
     if (node->isAttributeNode())
       containsAttributeNodes = true;
   }
 
   HeapVector<Member<Node>> sortedNodes;
   sortedNodes.reserveInitialCapacity(nodeCount);
 
   for (Node& n : NodeTraversal::startsAt(*findRootNode(m_nodes.front()))) {
     if (nodes.contains(&n))
       sortedNodes.push_back(&n);
@@ skipping 39 matching lines @@
 
 Node* NodeSet::anyNode() const {
   if (isEmpty())
     return nullptr;
 
   return m_nodes.at(0).get();
 }
 
 }  // namespace XPath
 }  // namespace blink