Migrate WTF::HashTable::add() to ::insert()

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 904 matching lines @@
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 template <typename IncomingValueType>
 typename ListHashSet<T, inlineCapacity, U, V>::AddResult
 ListHashSet<T, inlineCapacity, U, V>::insert(IncomingValueType&& value) {
   createAllocatorIfNeeded();
   // The second argument is a const ref. This is useful for the HashTable
   // because it lets it take lvalues by reference, but for our purposes it's
   // inconvenient, since it constrains us to be const, whereas the allocator
   // actually changes when it does allocations.
-  auto result = m_impl.template add<BaseTranslator>(
+  auto result = m_impl.template insert<BaseTranslator>(
       std::forward<IncomingValueType>(value), *this->getAllocator());
   if (result.isNewEntry)
     appendNode(*result.storedValue);
   return AddResult(*result.storedValue, result.isNewEntry);
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 template <typename IncomingValueType>
 typename ListHashSet<T, inlineCapacity, U, V>::iterator
 ListHashSet<T, inlineCapacity, U, V>::addReturnIterator(
     IncomingValueType&& value) {
   return makeIterator(insert(std::forward<IncomingValueType>(value)).m_node);
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 template <typename IncomingValueType>
 typename ListHashSet<T, inlineCapacity, U, V>::AddResult
 ListHashSet<T, inlineCapacity, U, V>::appendOrMoveToLast(
     IncomingValueType&& value) {
   createAllocatorIfNeeded();
-  auto result = m_impl.template add<BaseTranslator>(
+  auto result = m_impl.template insert<BaseTranslator>(
       std::forward<IncomingValueType>(value), *this->getAllocator());
   Node* node = *result.storedValue;
   if (!result.isNewEntry)
     unlink(node);
   appendNode(node);
   return AddResult(*result.storedValue, result.isNewEntry);
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 template <typename IncomingValueType>
 typename ListHashSet<T, inlineCapacity, U, V>::AddResult
 ListHashSet<T, inlineCapacity, U, V>::prependOrMoveToFirst(
     IncomingValueType&& value) {
   createAllocatorIfNeeded();
-  auto result = m_impl.template add<BaseTranslator>(
+  auto result = m_impl.template insert<BaseTranslator>(
       std::forward<IncomingValueType>(value), *this->getAllocator());
   Node* node = *result.storedValue;
   if (!result.isNewEntry)
     unlink(node);
   prependNode(node);
   return AddResult(*result.storedValue, result.isNewEntry);
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 template <typename IncomingValueType>
 typename ListHashSet<T, inlineCapacity, U, V>::AddResult
 ListHashSet<T, inlineCapacity, U, V>::insertBefore(
     iterator it,
     IncomingValueType&& newValue) {
   createAllocatorIfNeeded();
-  auto result = m_impl.template add<BaseTranslator>(
+  auto result = m_impl.template insert<BaseTranslator>(
       std::forward<IncomingValueType>(newValue), *this->getAllocator());
   if (result.isNewEntry)
     insertNodeBefore(it.getNode(), *result.storedValue);
   return AddResult(*result.storedValue, result.isNewEntry);
 }
 
 template <typename T, size_t inlineCapacity, typename U, typename V>
 template <typename IncomingValueType>
 typename ListHashSet<T, inlineCapacity, U, V>::AddResult
 ListHashSet<T, inlineCapacity, U, V>::insertBefore(
@@ skipping 138 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