Migrate WTF::HashSet::add() to ::insert() [part 1 of N]

third_party/WebKit/Source/wtf/HashSet.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011 Apple Inc. All rights reserved.
  *
  * 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.
  *
  * This library is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ skipping 88 matching lines @@
   //   static unsigned hash(const T&);
   //   static bool equal(const ValueType&, const T&);
   template <typename HashTranslator, typename T>
   iterator find(const T&) const;
   template <typename HashTranslator, typename T>
   bool contains(const T&) const;
 
   // The return value is a pair of an iterator to the new value's location,
   // and a bool that is true if an new entry was added.
   template <typename IncomingValueType>
+  AddResult insert(IncomingValueType&&);
+  template <typename IncomingValueType>
   AddResult add(IncomingValueType&&);
 
   // An alternate version of add() that finds the object by hashing and
   // comparing with some other type, to avoid the cost of type conversion if
   // the object is already in the table. HashTranslator must have the
   // following function members:
   //   static unsigned hash(const T&);
   //   static bool equal(const ValueType&, const T&);
   //   static translate(ValueType&, T&&, unsigned hashCode);
   template <typename HashTranslator, typename T>
@@ skipping 47 matching lines @@
 
 template <typename Value,
           typename HashFunctions,
           typename Traits,
           typename Allocator>
 HashSet<Value, HashFunctions, Traits, Allocator>::HashSet(
     std::initializer_list<ValueType> elements) {
   if (elements.size())
     m_impl.reserveCapacityForSize(elements.size());
   for (const ValueType& element : elements)
-    add(element);
+    insert(element);
 }
 
 template <typename Value,
           typename HashFunctions,
           typename Traits,
           typename Allocator>
 auto HashSet<Value, HashFunctions, Traits, Allocator>::operator=(
     std::initializer_list<ValueType> elements) -> HashSet& {
   *this = HashSet(std::move(elements));
   return *this;
@@ skipping 57 matching lines @@
           typename Allocator>
 template <typename HashTranslator, typename T>
 inline bool HashSet<Value, HashFunctions, Traits, Allocator>::contains(
     const T& value) const {
   return m_impl.template contains<HashSetTranslatorAdapter<HashTranslator>>(
       value);
 }
 
 template <typename T, typename U, typename V, typename W>
 template <typename IncomingValueType>
+inline typename HashSet<T, U, V, W>::AddResult HashSet<T, U, V, W>::insert(
+    IncomingValueType&& value) {
+  return m_impl.add(std::forward<IncomingValueType>(value));
+}
+
+// TODO(pilgrim) remove this method once all references and subclasses
+// have been migrated to insert() method
+template <typename T, typename U, typename V, typename W>
+template <typename IncomingValueType>
 inline typename HashSet<T, U, V, W>::AddResult HashSet<T, U, V, W>::add(
     IncomingValueType&& value) {
   return m_impl.add(std::forward<IncomingValueType>(value));
 }
 
 template <typename Value,
           typename HashFunctions,
           typename Traits,
           typename Allocator>
 template <typename HashTranslator, typename T>
@@ skipping 56 matching lines @@
   iterator end = collection.end();
   for (unsigned i = 0; it != end; ++it, ++i)
     vector[i] = *it;
 }
 
 }  // namespace WTF
 
 using WTF::HashSet;
 
 #endif  // WTF_HashSet_h