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

third_party/WebKit/Source/wtf/LinkedHashSet.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 270 matching lines @@
 
   template <typename IncomingValueType>
   AddResult insertBefore(ValuePeekInType beforeValue,
                          IncomingValueType&& newValue);
   template <typename IncomingValueType>
   AddResult insertBefore(iterator it, IncomingValueType&& newValue) {
     return m_impl.template add<NodeHashFunctions>(
         std::forward<IncomingValueType>(newValue), it.getNode());
   }
 
-  void remove(ValuePeekInType);
-  void remove(iterator);
+  void erase(ValuePeekInType);
+  void erase(iterator);
   void clear() { m_impl.clear(); }
   template <typename Collection>
   void removeAll(const Collection& other) {
     WTF::removeAll(*this, other);
   }
 
   template <typename VisitorDispatcher>
   void trace(VisitorDispatcher visitor) {
     m_impl.trace(visitor);
     // Should the underlying table be moved by GC, register a callback
@@ skipping 555 matching lines @@
 template <typename T, typename U, typename V, typename W>
 template <typename IncomingValueType>
 typename LinkedHashSet<T, U, V, W>::AddResult
 LinkedHashSet<T, U, V, W>::insertBefore(ValuePeekInType beforeValue,
                                         IncomingValueType&& newValue) {
   return insertBefore(find(beforeValue),
                       std::forward<IncomingValueType>(newValue));
 }
 
 template <typename T, typename U, typename V, typename W>
-inline void LinkedHashSet<T, U, V, W>::remove(iterator it) {
+inline void LinkedHashSet<T, U, V, W>::erase(iterator it) {
   if (it == end())
     return;
   m_impl.remove(it.getNode());
 }
 
 template <typename T, typename U, typename V, typename W>
-inline void LinkedHashSet<T, U, V, W>::remove(ValuePeekInType value) {
-  remove(find(value));
+inline void LinkedHashSet<T, U, V, W>::erase(ValuePeekInType value) {
+  erase(find(value));
 }
 
 inline void swapAnchor(LinkedHashSetNodeBase& a, LinkedHashSetNodeBase& b) {
   DCHECK(a.m_prev);
   DCHECK(a.m_next);
   DCHECK(b.m_prev);
   DCHECK(b.m_next);
   swap(a.m_prev, b.m_prev);
   swap(a.m_next, b.m_next);
   if (b.m_next == &a) {
@@ skipping 42 matching lines @@
   swap(static_cast<Base&>(a), static_cast<Base&>(b));
   swap(a.m_value, b.m_value);
   Allocator::leaveGCForbiddenScope();
 }
 
 }  // namespace WTF
 
 using WTF::LinkedHashSet;
 
 #endif /* WTF_LinkedHashSet_h */