Migrate WTF::HashMap::remove() to ::erase()

third_party/WebKit/Source/core/inspector/DOMPatchSupport.cpp

 /*
  * Copyright (C) 2012 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 197 matching lines @@
     // cloneDataFromElement() is close but not enough for this case.
     for (auto& attribute : newElement->attributesWithoutUpdate()) {
       if (!m_domEditor->setAttribute(oldElement, attribute.name().toString(),
                                      attribute.value(), exceptionState))
         return false;
     }
   }
 
   bool result = innerPatchChildren(oldElement, oldDigest->m_children,
                                    newDigest->m_children, exceptionState);
-  m_unusedNodesMap.remove(newDigest->m_sha1);
+  m_unusedNodesMap.erase(newDigest->m_sha1);
   return result;
 }
 
 std::pair<DOMPatchSupport::ResultMap, DOMPatchSupport::ResultMap>
 DOMPatchSupport::diff(const HeapVector<Member<Digest>>& oldList,
                       const HeapVector<Member<Digest>>& newList) {
   ResultMap newMap(newList.size());
   ResultMap oldMap(oldList.size());
 
   for (size_t i = 0; i < oldMap.size(); ++i) {
@@ skipping 305 matching lines @@
       return false;
   }
   return true;
 }
 
 void DOMPatchSupport::markNodeAsUsed(Digest* digest) {
   HeapDeque<Member<Digest>> queue;
   queue.append(digest);
   while (!queue.isEmpty()) {
     Digest* first = queue.takeFirst();
-    m_unusedNodesMap.remove(first->m_sha1);
+    m_unusedNodesMap.erase(first->m_sha1);
     for (size_t i = 0; i < first->m_children.size(); ++i)
       queue.append(first->m_children[i].get());
   }
 }
 
 #ifdef DEBUG_DOM_PATCH_SUPPORT
 static String nodeName(Node* node) {
   if (node->document().isXHTMLDocument())
     return node->nodeName();
   return node->nodeName().lower();
 }
 
 void DOMPatchSupport::dumpMap(const ResultMap& map, const String& name) {
   fprintf(stderr, "\n\n");
   for (size_t i = 0; i < map.size(); ++i)
     fprintf(stderr, "%s[%lu]: %s (%p) - [%lu]\n", name.utf8().data(), i,
             map[i].first ? nodeName(map[i].first->m_node).utf8().data() : "",
             map[i].first, map[i].second);
 }
 #endif
 
 DEFINE_TRACE(DOMPatchSupport::Digest) {
   visitor->trace(m_node);
   visitor->trace(m_children);
 }
 
 }  // namespace blink