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

Source/wtf/HashMap.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 407 matching lines @@
     {
         iterator it = find(key);
         if (it == end())
             return MappedTraits::passOut(MappedTraits::emptyValue());
         MappedPassOutType result = MappedTraits::passOut(it->value);
         remove(it);
         return result;
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y>
-    inline bool HashMap<T, U, V, W, X, Y>::isValidKey(KeyPeekInType key)
+    bool HashMap<T, U, V, W, X, Y>::isValidKey(KeyPeekInType key)
     {
         if (KeyTraits::isDeletedValue(key))
             return false;
 
         if (HashFunctions::safeToCompareToEmptyOrDeleted) {
             if (key == KeyTraits::emptyValue())
                 return false;
         } else {
             if (isHashTraitsEmptyValue<KeyTraits>(key))
                 return false;
@@ skipping 21 matching lines @@
         return true;
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y>
     inline bool operator!=(const HashMap<T, U, V, W, X, Y>& a, const HashMap<T, U, V, W, X, Y>& b)
     {
         return !(a == b);
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y, typename Z>
-    inline void copyKeysToVector(const HashMap<T, U, V, W, X, Y>& collection, Z& vector)
+    void copyKeysToVector(const HashMap<T, U, V, W, X, Y>& collection, Z& vector)
     {
         typedef typename HashMap<T, U, V, W, X, Y>::const_iterator::Keys iterator;
 
         vector.resize(collection.size());
 
         iterator it = collection.begin().keys();
         iterator end = collection.end().keys();
         for (unsigned i = 0; it != end; ++it, ++i)
             vector[i] = *it;
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y, typename Z>
-    inline void copyValuesToVector(const HashMap<T, U, V, W, X, Y>& collection, Z& vector)
+    void copyValuesToVector(const HashMap<T, U, V, W, X, Y>& collection, Z& vector)
     {
         typedef typename HashMap<T, U, V, W, X, Y>::const_iterator::Values iterator;
 
         vector.resize(collection.size());
 
         iterator it = collection.begin().values();
         iterator end = collection.end().values();
         for (unsigned i = 0; it != end; ++it, ++i)
             vector[i] = *it;
     }
 
 #if !ENABLE(OILPAN)
 template<typename T, typename U, typename V, typename W, typename X>
 struct NeedsTracing<HashMap<T, U, V, W, X> > {
     static const bool value = false;
 };
 #endif
 
 } // namespace WTF
 
 using WTF::HashMap;
 
 #endif /* WTF_HashMap_h */