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

third_party/WebKit/Source/core/layout/svg/SVGResourcesCycleSolver.cpp

 /*
  * Copyright (C) Research In Motion Limited 2010. All rights reserved.
  *
  * 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 28 matching lines @@
   ASSERT(m_resources);
 }
 
 SVGResourcesCycleSolver::~SVGResourcesCycleSolver() {}
 
 struct ActiveFrame {
   typedef SVGResourcesCycleSolver::ResourceSet ResourceSet;
 
   ActiveFrame(ResourceSet& activeSet, LayoutSVGResourceContainer* resource)
       : m_activeSet(activeSet), m_resource(resource) {
-    m_activeSet.add(m_resource);
+    m_activeSet.insert(m_resource);
   }
   ~ActiveFrame() { m_activeSet.remove(m_resource); }
 
   ResourceSet& m_activeSet;
   LayoutSVGResourceContainer* m_resource;
 };
 
 bool SVGResourcesCycleSolver::resourceContainsCycles(
     LayoutSVGResourceContainer* resource) {
   // If we've traversed this sub-graph before and no cycles were observed, then
@@ skipping 20 matching lines @@
       // Iterate resources referenced by |node|.
       for (auto* node : nodeSet) {
         if (m_activeResources.contains(node) || resourceContainsCycles(node))
           return true;
       }
     }
     node = node->nextInPreOrder(resource);
   }
 
   // No cycles found in (or from) this resource. Add it to the "DAG cache".
-  m_dagCache.add(resource);
+  m_dagCache.insert(resource);
   return false;
 }
 
 void SVGResourcesCycleSolver::resolveCycles() {
   ASSERT(m_activeResources.isEmpty());
 
   // If the starting LayoutObject is a resource container itself, then add it
   // to the active set (to break direct self-references.)
   if (m_layoutObject->isSVGResourceContainer())
-    m_activeResources.add(toLayoutSVGResourceContainer(m_layoutObject));
+    m_activeResources.insert(toLayoutSVGResourceContainer(m_layoutObject));
 
   ResourceSet localResources;
   m_resources->buildSetOfResources(localResources);
 
   // This performs a depth-first search for a back-edge in all the
   // (potentially disjoint) graphs formed by the resources referenced by
   // |m_layoutObject|.
   for (auto* localResource : localResources) {
     if (m_activeResources.contains(localResource) ||
         resourceContainsCycles(localResource))
@@ skipping 45 matching lines @@
       ASSERT(resourceLeadingToCycle == m_resources->clipper());
       m_resources->resetClipper();
       break;
     default:
       ASSERT_NOT_REACHED();
       break;
   }
 }
 
 }  // namespace blink