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

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

 /*
  * Copyright (C) 2011 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 349 matching lines @@
         (mask | (mask >> domBreakpointDerivedTypeShift)) &
         inheritableDOMBreakpointTypesMask;
     if (inheritableTypesMask)
       updateSubtreeBreakpoints(node, inheritableTypesMask, true);
   }
 }
 
 void InspectorDOMDebuggerAgent::didRemoveDOMNode(Node* node) {
   if (m_domBreakpoints.size()) {
     // Remove subtree breakpoints.
-    m_domBreakpoints.remove(node);
+    m_domBreakpoints.erase(node);
     HeapVector<Member<Node>> stack(1, InspectorDOMAgent::innerFirstChild(node));
     do {
       Node* node = stack.back();
       stack.pop_back();
       if (!node)
         continue;
-      m_domBreakpoints.remove(node);
+      m_domBreakpoints.erase(node);
       stack.push_back(InspectorDOMAgent::innerFirstChild(node));
       stack.push_back(InspectorDOMAgent::innerNextSibling(node));
     } while (!stack.isEmpty());
   }
 }
 
 static Response domTypeForName(const String& typeString, int& type) {
   if (typeString == "subtree-modified") {
     type = SubtreeModified;
     return Response::OK();
@@ skipping 57 matching lines @@
   int type = -1;
   response = domTypeForName(typeString, type);
   if (!response.isSuccess())
     return response;
 
   uint32_t rootBit = 1 << type;
   uint32_t mask = m_domBreakpoints.get(node) & ~rootBit;
   if (mask)
     m_domBreakpoints.set(node, mask);
   else
-    m_domBreakpoints.remove(node);
+    m_domBreakpoints.erase(node);
 
   if ((rootBit & inheritableDOMBreakpointTypesMask) &&
       !(mask & (rootBit << domBreakpointDerivedTypeShift))) {
     for (Node* child = InspectorDOMAgent::innerFirstChild(node); child;
          child = InspectorDOMAgent::innerNextSibling(child))
       updateSubtreeBreakpoints(child, rootBit, false);
   }
   didRemoveBreakpoint();
   return Response::OK();
 }
@@ skipping 158 matching lines @@
 
 void InspectorDOMDebuggerAgent::updateSubtreeBreakpoints(Node* node,
                                                          uint32_t rootMask,
                                                          bool set) {
   uint32_t oldMask = m_domBreakpoints.get(node);
   uint32_t derivedMask = rootMask << domBreakpointDerivedTypeShift;
   uint32_t newMask = set ? oldMask | derivedMask : oldMask & ~derivedMask;
   if (newMask)
     m_domBreakpoints.set(node, newMask);
   else
-    m_domBreakpoints.remove(node);
+    m_domBreakpoints.erase(node);
 
   uint32_t newRootMask = rootMask & ~newMask;
   if (!newRootMask)
     return;
 
   for (Node* child = InspectorDOMAgent::innerFirstChild(node); child;
        child = InspectorDOMAgent::innerNextSibling(child))
     updateSubtreeBreakpoints(child, newRootMask, set);
 }
 
@@ skipping 155 matching lines @@
     m_state->remove(DOMDebuggerAgentState::enabled);
     m_instrumentingAgents->removeInspectorDOMDebuggerAgent(this);
   }
 }
 
 void InspectorDOMDebuggerAgent::didCommitLoadForLocalFrame(LocalFrame*) {
   m_domBreakpoints.clear();
 }
 
 }  // namespace blink