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

third_party/WebKit/Source/platform/wtf/HashCountedSet.h

 /*
  * Copyright (C) 2005, 2006, 2008 Apple Inc. 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 75 matching lines @@
   // Increases the count if an equal value is already present the return value
   // is a pair of an iterator to the new value's location, and a bool that is
   // true if an new entry was added.
   AddResult insert(const ValueType&);
 
   // Generalized add(), adding the value N times.
   AddResult insert(const ValueType&, unsigned);
 
   // Reduces the count of the value, and removes it if count goes down to
   // zero, returns true if the value is removed.
-  bool remove(const ValueType& value) { return remove(find(value)); }
-  bool remove(iterator);
+  bool erase(const ValueType& value) { return erase(find(value)); }
+  bool erase(iterator);
 
   // Removes the value, regardless of its count.
   void removeAll(const ValueType& value) { removeAll(find(value)); }
   void removeAll(iterator);
 
   // Clears the whole set.
   void clear() { m_impl.clear(); }
 
   Vector<Value> asVector() const;
 
@@ skipping 15 matching lines @@
   return result;
 }
 
 template <typename T, typename U, typename V, typename W>
 inline typename HashCountedSet<T, U, V, W>::AddResult
 HashCountedSet<T, U, V, W>::insert(const ValueType& value) {
   return insert(value, 1u);
 }
 
 template <typename T, typename U, typename V, typename W>
-inline bool HashCountedSet<T, U, V, W>::remove(iterator it) {
+inline bool HashCountedSet<T, U, V, W>::erase(iterator it) {
   if (it == end())
     return false;
 
   unsigned oldVal = it->value;
   DCHECK(oldVal);
   unsigned newVal = oldVal - 1;
   if (newVal) {
     it->value = newVal;
     return false;
   }
@@ skipping 35 matching lines @@
   Vector<T> vector;
   copyToVector(*this, vector);
   return vector;
 }
 
 }  // namespace WTF
 
 using WTF::HashCountedSet;
 
 #endif  // WTF_HashCountedSet_h