Migrate WTF::HashSet::remove() to ::erase() [part 1]

third_party/WebKit/Source/core/svg/SVGElement.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 2007, 2008 Nikolas Zimmermann
  * <zimmermann@kde.org>
  * Copyright (C) 2004, 2005, 2006, 2008 Rob Buis <buis@kde.org>
  * Copyright (C) 2008 Apple Inc. All rights reserved.
  * Copyright (C) 2008 Alp Toker <alp@atoker.com>
  * Copyright (C) 2009 Cameron McCormack <cam@mcc.id.au>
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
@@ skipping 514 matching lines @@
   for (Node& currentNode : NodeTraversal::inclusiveAncestorsOf(*this)) {
     if (!currentNode.isSVGElement())
       break;
     SVGElement& currentElement = toSVGElement(currentNode);
     ASSERT(!currentElement.m_inRelativeLengthClientsInvalidation);
 
     bool hadRelativeLengths = currentElement.hasRelativeLengths();
     if (clientHasRelativeLengths)
       currentElement.m_elementsWithRelativeLengths.insert(clientElement);
     else
-      currentElement.m_elementsWithRelativeLengths.remove(clientElement);
+      currentElement.m_elementsWithRelativeLengths.erase(clientElement);
 
     // If the relative length state hasn't changed, we can stop propagating the
     // notification.
     if (hadRelativeLengths == currentElement.hasRelativeLengths())
       return;
 
     clientElement = &currentElement;
     clientHasRelativeLengths = clientElement->hasRelativeLengths();
   }
 
@@ skipping 76 matching lines @@
 void SVGElement::removeInstanceMapping(SVGElement* instance) {
   ASSERT(instance);
   ASSERT(instance->inUseShadowTree());
 
   if (!hasSVGRareData())
     return;
 
   HeapHashSet<WeakMember<SVGElement>>& instances =
       svgRareData()->elementInstances();
 
-  instances.remove(instance);
+  instances.erase(instance);
 }
 
 static HeapHashSet<WeakMember<SVGElement>>& emptyInstances() {
   DEFINE_STATIC_LOCAL(HeapHashSet<WeakMember<SVGElement>>, emptyInstances,
                       (new HeapHashSet<WeakMember<SVGElement>>));
   return emptyInstances;
 }
 
 const HeapHashSet<WeakMember<SVGElement>>& SVGElement::instancesForElement()
     const {
@@ skipping 628 matching lines @@
   }
 }
 
 void SVGElement::removeAllIncomingReferences() {
   if (!hasSVGRareData())
     return;
 
   SVGElementSet& incomingReferences = svgRareData()->incomingReferences();
   for (SVGElement* sourceElement : incomingReferences) {
     ASSERT(sourceElement->hasSVGRareData());
-    sourceElement->ensureSVGRareData()->outgoingReferences().remove(this);
+    sourceElement->ensureSVGRareData()->outgoingReferences().erase(this);
   }
   incomingReferences.clear();
 }
 
 void SVGElement::removeAllOutgoingReferences() {
   if (!hasSVGRareData())
     return;
 
   SVGElementSet& outgoingReferences = svgRareData()->outgoingReferences();
   for (SVGElement* targetElement : outgoingReferences) {
     ASSERT(targetElement->hasSVGRareData());
-    targetElement->ensureSVGRareData()->incomingReferences().remove(this);
+    targetElement->ensureSVGRareData()->incomingReferences().erase(this);
   }
   outgoingReferences.clear();
 }
 
 DEFINE_TRACE(SVGElement) {
   visitor->trace(m_elementsWithRelativeLengths);
   visitor->trace(m_attributeToPropertyMap);
   visitor->trace(m_SVGRareData);
   visitor->trace(m_className);
   Element::trace(visitor);
 }
 
 const AtomicString& SVGElement::eventParameterName() {
   DEFINE_STATIC_LOCAL(const AtomicString, evtString, ("evt"));
   return evtString;
 }
 
 }  // namespace blink