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

third_party/WebKit/Source/platform/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 696 matching lines @@
 
 template <typename T, typename U, typename V, typename W>
 inline const T& LinkedHashSet<T, U, V, W>::front() const {
   DCHECK(!isEmpty());
   return firstNode()->m_value;
 }
 
 template <typename T, typename U, typename V, typename W>
 inline void LinkedHashSet<T, U, V, W>::removeFirst() {
   DCHECK(!isEmpty());
-  m_impl.remove(static_cast<Node*>(m_anchor.m_next));
+  m_impl.erase(static_cast<Node*>(m_anchor.m_next));
 }
 
 template <typename T, typename U, typename V, typename W>
 inline T& LinkedHashSet<T, U, V, W>::back() {
   DCHECK(!isEmpty());
   return lastNode()->m_value;
 }
 
 template <typename T, typename U, typename V, typename W>
 inline const T& LinkedHashSet<T, U, V, W>::back() const {
   DCHECK(!isEmpty());
   return lastNode()->m_value;
 }
 
 template <typename T, typename U, typename V, typename W>
 inline void LinkedHashSet<T, U, V, W>::pop_back() {
   DCHECK(!isEmpty());
-  m_impl.remove(static_cast<Node*>(m_anchor.m_prev));
+  m_impl.erase(static_cast<Node*>(m_anchor.m_prev));
 }
 
 template <typename T, typename U, typename V, typename W>
 inline typename LinkedHashSet<T, U, V, W>::iterator
 LinkedHashSet<T, U, V, W>::find(ValuePeekInType value) {
   LinkedHashSet::Node* node =
       m_impl.template lookup<LinkedHashSet::NodeHashFunctions, ValuePeekInType>(
           value);
   if (!node)
     return end();
@@ skipping 115 matching lines @@
 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>::erase(iterator it) {
   if (it == end())
     return;
-  m_impl.remove(it.getNode());
+  m_impl.erase(it.getNode());
 }
 
 template <typename T, typename U, typename V, typename W>
 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);
@@ skipping 47 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 */