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

Source/wtf/HashMap.h

Index: Source/wtf/HashMap.h
diff --git a/Source/wtf/HashMap.h b/Source/wtf/HashMap.h
index 43484084d9706cf72e4df5850f2a05b47a0395c1..81ee8a0207b701d62b459d828954ddf392c0539f 100644
--- a/Source/wtf/HashMap.h
+++ b/Source/wtf/HashMap.h
@@ -425,7 +425,7 @@ namespace WTF {
     }
 
     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;
@@ -467,7 +467,7 @@ namespace WTF {
     }
 
     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;
 
@@ -480,7 +480,7 @@ namespace WTF {
     }
 
     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;