Migrate WTF::LinkedHashSet/ListHashSet/HashTable::remove() to ::erase()

third_party/WebKit/Source/wtf/ListHashSet.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights
  * reserved.
  * Copyright (C) 2011, Benjamin Poulain <ikipou@gmail.com>
  *
  * 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.
  *
@@ skipping 194 matching lines @@
   // already in the list, it is moved to the beginning.
   template <typename IncomingValueType>
   AddResult prependOrMoveToFirst(IncomingValueType&&);
 
   template <typename IncomingValueType>
   AddResult insertBefore(ValuePeekInType beforeValue,
                          IncomingValueType&& newValue);
   template <typename IncomingValueType>
   AddResult insertBefore(iterator, IncomingValueType&&);
 
-  void remove(ValuePeekInType value) { return remove(find(value)); }
-  void remove(iterator);
+  void erase(ValuePeekInType value) { return erase(find(value)); }
+  void erase(iterator);
   void clear();
   template <typename Collection>
   void removeAll(const Collection& other) {
     WTF::removeAll(*this, other);
   }
 
   ValueType take(iterator);
   ValueType take(ValuePeekInType);
   ValueType takeFirst();
 
@@ skipping 759 matching lines @@
 typename ListHashSet<T, inlineCapacity, U, V>::AddResult
 ListHashSet<T, inlineCapacity, U, V>::insertBefore(
     ValuePeekInType beforeValue,
     IncomingValueType&& newValue) {
   createAllocatorIfNeeded();
   return insertBefore(find(beforeValue),
                       std::forward<IncomingValueType>(newValue));
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
-inline void ListHashSet<T, inlineCapacity, U, V>::remove(iterator it) {
+inline void ListHashSet<T, inlineCapacity, U, V>::erase(iterator it) {
   if (it == end())
     return;
   m_impl.remove(it.getNode());
   unlinkAndDelete(it.getNode());
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 inline void ListHashSet<T, inlineCapacity, U, V>::clear() {
   deleteAllNodes();
   m_impl.clear();
@@ skipping 119 matching lines @@
   // through the HashTable. That includes m_head and m_tail so we do not have
   // to explicitly trace them here.
   m_impl.trace(visitor);
 }
 
 }  // namespace WTF
 
 using WTF::ListHashSet;
 
 #endif  // WTF_ListHashSet_h