Save 100-300 KB footprint by not force inlining HashTable functions

Source/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 69 matching lines @@
         // Clears the whole set.
         void clear() { m_impl.clear(); }
 
         void trace(typename Allocator::Visitor* 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)
+    typename HashCountedSet<T, U, V, W>::AddResult HashCountedSet<T, U, V, W>::add(const ValueType& value)
     {
         AddResult result = m_impl.add(value, 0);
         ++result.storedValue->value;
         return result;
     }
 
     template<typename T, typename U, typename V, typename W>
-    inline bool HashCountedSet<T, U, V, W>::remove(iterator it)
+    bool HashCountedSet<T, U, V, W>::remove(iterator it)
     {
         if (it == end())
             return false;
 
         unsigned oldVal = it->value;
         ASSERT(oldVal);
         unsigned newVal = oldVal - 1;
         if (newVal) {
             it->value = newVal;
             return false;
         }
 
         m_impl.remove(it);
         return true;
     }
 
     template<typename T, typename U, typename V, typename W>
-    inline void HashCountedSet<T, U, V, W>::removeAll(iterator it)
+    void HashCountedSet<T, U, V, W>::removeAll(iterator it)
     {
         if (it == end())
             return;
 
         m_impl.remove(it);
     }
 
     template<typename T, typename U, typename V, typename W, typename VectorType>
-    inline void copyToVector(const HashCountedSet<T, U, V, W>& collection, VectorType& vector)
+    void copyToVector(const HashCountedSet<T, U, V, W>& collection, VectorType& vector)
     {
         typedef typename HashCountedSet<T, U, V, W>::const_iterator iterator;
 
         vector.resize(collection.size());
 
         iterator it = collection.begin();
         iterator end = collection.end();
         for (unsigned i = 0; it != end; ++it, ++i)
             vector[i] = *it;
     }
 
     template<typename Value, typename HashFunctions, typename Traits, typename Allocator, size_t inlineCapacity, typename VectorAllocator>
-    inline void copyToVector(const HashCountedSet<Value, HashFunctions, Traits, Allocator>& collection, Vector<Value, inlineCapacity, VectorAllocator>& vector)
+    void copyToVector(const HashCountedSet<Value, HashFunctions, Traits, Allocator>& collection, Vector<Value, inlineCapacity, VectorAllocator>& vector)
     {
         typedef typename HashCountedSet<Value, HashFunctions, Traits, Allocator>::const_iterator iterator;
 
         vector.resize(collection.size());
 
         iterator it = collection.begin();
         iterator end = collection.end();
         for (unsigned i = 0; it != end; ++it, ++i)
             vector[i] = (*it).key;
     }
 
 #if !ENABLE(OILPAN)
     template<typename T, typename U, typename V>
     struct NeedsTracing<HashCountedSet<T, U, V> > {
         static const bool value = false;
     };
 #endif
 
 } // namespace WTF
 
 using WTF::HashCountedSet;
 
 #endif /* WTF_HashCountedSet_h */