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

third_party/WebKit/Source/platform/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 799 matching lines @@
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 inline T& ListHashSet<T, inlineCapacity, U, V>::front() {
   DCHECK(!isEmpty());
   return m_head->m_value;
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 inline void ListHashSet<T, inlineCapacity, U, V>::removeFirst() {
   DCHECK(!isEmpty());
-  m_impl.remove(m_head);
+  m_impl.erase(m_head);
   unlinkAndDelete(m_head);
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 inline const T& ListHashSet<T, inlineCapacity, U, V>::front() const {
   DCHECK(!isEmpty());
   return m_head->m_value;
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 inline T& ListHashSet<T, inlineCapacity, U, V>::back() {
   DCHECK(!isEmpty());
   return m_tail->m_value;
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 inline const T& ListHashSet<T, inlineCapacity, U, V>::back() const {
   DCHECK(!isEmpty());
   return m_tail->m_value;
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 inline void ListHashSet<T, inlineCapacity, U, V>::pop_back() {
   DCHECK(!isEmpty());
-  m_impl.remove(m_tail);
+  m_impl.erase(m_tail);
   unlinkAndDelete(m_tail);
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 inline typename ListHashSet<T, inlineCapacity, U, V>::iterator
 ListHashSet<T, inlineCapacity, U, V>::find(ValuePeekInType value) {
   ImplTypeIterator it = m_impl.template find<BaseTranslator>(value);
   if (it == m_impl.end())
     return end();
   return makeIterator(*it);
@@ skipping 133 matching lines @@
     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>::erase(iterator it) {
   if (it == end())
     return;
-  m_impl.remove(it.getNode());
+  m_impl.erase(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();
   m_head = nullptr;
   m_tail = nullptr;
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 auto ListHashSet<T, inlineCapacity, U, V>::take(iterator it) -> ValueType {
   if (it == end())
     return ValueTraits::emptyValue();
 
-  m_impl.remove(it.getNode());
+  m_impl.erase(it.getNode());
   ValueType result = std::move(it.getNode()->m_value);
   unlinkAndDelete(it.getNode());
 
   return result;
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 auto ListHashSet<T, inlineCapacity, U, V>::take(ValuePeekInType value)
     -> ValueType {
   return take(find(value));
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 auto ListHashSet<T, inlineCapacity, U, V>::takeFirst() -> ValueType {
   DCHECK(!isEmpty());
-  m_impl.remove(m_head);
+  m_impl.erase(m_head);
   ValueType result = std::move(m_head->m_value);
   unlinkAndDelete(m_head);
 
   return result;
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename Allocator>
 void ListHashSet<T, inlineCapacity, U, Allocator>::unlink(Node* node) {
   if (!node->m_prev) {
     DCHECK_EQ(node, m_head);
@@ skipping 83 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