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

third_party/WebKit/Source/platform/wtf/HashCountedSet.h

 /*
  * Copyright (C) 2005, 2006, 2008 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 68 matching lines @@
   iterator find(const ValueType& value) { return m_impl.find(value); }
   const_iterator find(const ValueType& value) const {
     return m_impl.find(value);
   }
   bool contains(const ValueType& value) const { return m_impl.contains(value); }
   unsigned count(const ValueType& value) const { return m_impl.at(value); }
 
   // Increases the count if an equal value is already present 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.
-  AddResult add(const ValueType&);
+  AddResult insert(const ValueType&);
 
   // Generalized add(), adding the value N times.
-  AddResult add(const ValueType&, unsigned);
+  AddResult insert(const ValueType&, unsigned);
 
   // Reduces the count of the value, and removes it if count goes down to
   // zero, returns true if the value is removed.
   bool remove(const ValueType& value) { return remove(find(value)); }
   bool remove(iterator);
 
   // Removes the value, regardless of its count.
   void removeAll(const ValueType& value) { removeAll(find(value)); }
   void removeAll(iterator);
 
   // Clears the whole set.
   void clear() { m_impl.clear(); }
 
   Vector<Value> asVector() const;
 
   template <typename VisitorDispatcher>
   void trace(VisitorDispatcher visitor) {
     m_impl.trace(visitor);
   }
 
  private:
   ImplType m_impl;
 };
 
 template <typename T, typename U, typename V, typename W>
 inline typename HashCountedSet<T, U, V, W>::AddResult
-HashCountedSet<T, U, V, W>::add(const ValueType& value, unsigned count) {
+HashCountedSet<T, U, V, W>::insert(const ValueType& value, unsigned count) {
   DCHECK_GT(count, 0u);
   AddResult result = m_impl.insert(value, 0);
   result.storedValue->value += count;
   return result;
 }
 
 template <typename T, typename U, typename V, typename W>
 inline typename HashCountedSet<T, U, V, W>::AddResult
-HashCountedSet<T, U, V, W>::add(const ValueType& value) {
-  return add(value, 1u);
+HashCountedSet<T, U, V, W>::insert(const ValueType& value) {
+  return insert(value, 1u);
 }
 
 template <typename T, typename U, typename V, typename W>
 inline bool HashCountedSet<T, U, V, W>::remove(iterator it) {
   if (it == end())
     return false;
 
   unsigned oldVal = it->value;
   DCHECK(oldVal);
   unsigned newVal = oldVal - 1;
@@ skipping 39 matching lines @@
   Vector<T> vector;
   copyToVector(*this, vector);
   return vector;
 }
 
 }  // namespace WTF
 
 using WTF::HashCountedSet;
 
 #endif  // WTF_HashCountedSet_h