Fix trailing whitespace in .cpp, .h, and .idl files (ex. Source/core)

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 79 matching lines @@
 
         HashMapValuesProxy& values() { return static_cast<HashMapValuesProxy&>(*this); }
         const HashMapValuesProxy& values() const { return static_cast<const HashMapValuesProxy&>(*this); }
 
         iterator find(const KeyType&);
         const_iterator find(const KeyType&) const;
         bool contains(const KeyType&) const;
         MappedPeekType get(const KeyType&) const;
 
         // replaces value but not key if key is already present
-        // return value is a pair of the iterator to the key location, 
+        // return value is a pair of the iterator to the key location,
         // and a boolean that's true if a new value was actually added
         AddResult set(const KeyType&, MappedPassInType);
 
         // does nothing if key is already present
-        // return value is a pair of the iterator to the key location, 
+        // return value is a pair of the iterator to the key location,
         // and a boolean that's true if a new value was actually added
         AddResult add(const KeyType&, MappedPassInType);
 
         void remove(const KeyType&);
         void remove(iterator);
         void clear();
 
         MappedPassOutType take(const KeyType&); // efficient combination of get with remove
 
         // An alternate version of find() that finds the object by hashing and comparing
@@ skipping 17 matching lines @@
 
         static bool isValidKey(const KeyType&);
 
     private:
         AddResult inlineAdd(const KeyType&, MappedPassInReferenceType);
 
         HashTableType m_impl;
     };
 
     template<typename KeyArg, typename MappedArg, typename HashArg, typename KeyTraitsArg, typename MappedTraitsArg>
-    class HashMap<KeyArg, MappedArg, HashArg, KeyTraitsArg, MappedTraitsArg>::HashMapKeysProxy : 
+    class HashMap<KeyArg, MappedArg, HashArg, KeyTraitsArg, MappedTraitsArg>::HashMapKeysProxy :
         private HashMap<KeyArg, MappedArg, HashArg, KeyTraitsArg, MappedTraitsArg> {
         public:
             typedef HashMap<KeyArg, MappedArg, HashArg, KeyTraitsArg, MappedTraitsArg> HashMapType;
             typedef typename HashMapType::iterator::Keys iterator;
             typedef typename HashMapType::const_iterator::Keys const_iterator;
 
             iterator begin()
             {
                 return HashMapType::begin().keys();
             }
@@ skipping 17 matching lines @@
             friend class HashMap;
 
             // These are intentionally not implemented.
             HashMapKeysProxy();
             HashMapKeysProxy(const HashMapKeysProxy&);
             HashMapKeysProxy& operator=(const HashMapKeysProxy&);
             ~HashMapKeysProxy();
     };
 
     template<typename KeyArg, typename MappedArg, typename HashArg,  typename KeyTraitsArg, typename MappedTraitsArg>
-    class HashMap<KeyArg, MappedArg, HashArg, KeyTraitsArg, MappedTraitsArg>::HashMapValuesProxy : 
+    class HashMap<KeyArg, MappedArg, HashArg, KeyTraitsArg, MappedTraitsArg>::HashMapValuesProxy :
         private HashMap<KeyArg, MappedArg, HashArg, KeyTraitsArg, MappedTraitsArg> {
         public:
             typedef HashMap<KeyArg, MappedArg, HashArg, KeyTraitsArg, MappedTraitsArg> HashMapType;
             typedef typename HashMapType::iterator::Values iterator;
             typedef typename HashMapType::const_iterator::Values const_iterator;
 
             iterator begin()
             {
                 return HashMapType::begin().values();
             }
@@ skipping 49 matching lines @@
         template<typename T, typename U, typename V> static void translate(T& location, const U& key, const V& mapped, unsigned hashCode)
         {
             Translator::translate(location.key, key, hashCode);
             ValueTraits::ValueTraits::store(mapped, location.value);
         }
     };
 
     template<typename T, typename U, typename V, typename W, typename X>
     inline void HashMap<T, U, V, W, X>::swap(HashMap& other)
     {
-        m_impl.swap(other.m_impl); 
+        m_impl.swap(other.m_impl);
     }
 
     template<typename T, typename U, typename V, typename W, typename X>
     inline int HashMap<T, U, V, W, X>::size() const
     {
-        return m_impl.size(); 
+        return m_impl.size();
     }
 
     template<typename T, typename U, typename V, typename W, typename X>
     inline int HashMap<T, U, V, W, X>::capacity() const
-    { 
-        return m_impl.capacity(); 
+    {
+        return m_impl.capacity();
     }
 
     template<typename T, typename U, typename V, typename W, typename X>
     inline bool HashMap<T, U, V, W, X>::isEmpty() const
     {
         return m_impl.isEmpty();
     }
 
     template<typename T, typename U, typename V, typename W, typename X>
     inline typename HashMap<T, U, V, W, X>::iterator HashMap<T, U, V, W, X>::begin()
@@ skipping 40 matching lines @@
     template<typename T, typename U, typename V, typename W, typename X>
     template<typename HashTranslator, typename TYPE>
     inline typename HashMap<T, U, V, W, X>::iterator
     HashMap<T, U, V, W, X>::find(const TYPE& value)
     {
         return m_impl.template find<HashMapTranslatorAdapter<ValueTraits, HashTranslator> >(value);
     }
 
     template<typename T, typename U, typename V, typename W, typename X>
     template<typename HashTranslator, typename TYPE>
-    inline typename HashMap<T, U, V, W, X>::const_iterator 
+    inline typename HashMap<T, U, V, W, X>::const_iterator
     HashMap<T, U, V, W, X>::find(const TYPE& value) const
     {
         return m_impl.template find<HashMapTranslatorAdapter<ValueTraits, HashTranslator> >(value);
     }
 
     template<typename T, typename U, typename V, typename W, typename X>
     template<typename HashTranslator, typename TYPE>
     inline bool
     HashMap<T, U, V, W, X>::contains(const TYPE& value) const
     {
         return m_impl.template contains<HashMapTranslatorAdapter<ValueTraits, HashTranslator> >(value);
     }
 
     template<typename T, typename U, typename V, typename W, typename X>
     typename HashMap<T, U, V, W, X>::AddResult
-    HashMap<T, U, V, W, X>::inlineAdd(const KeyType& key, MappedPassInReferenceType mapped) 
+    HashMap<T, U, V, W, X>::inlineAdd(const KeyType& key, MappedPassInReferenceType mapped)
     {
         return m_impl.template add<HashMapTranslator<ValueTraits, HashFunctions> >(key, mapped);
     }
 
     template<typename T, typename U, typename V, typename W, typename X>
     typename HashMap<T, U, V, W, X>::AddResult
-    HashMap<T, U, V, W, X>::set(const KeyType& key, MappedPassInType mapped) 
+    HashMap<T, U, V, W, X>::set(const KeyType& key, MappedPassInType mapped)
     {
         AddResult result = inlineAdd(key, mapped);
         if (!result.isNewEntry) {
             // The inlineAdd call above found an existing hash table entry; we need to set the mapped value.
             MappedTraits::store(mapped, result.iterator->value);
         }
         return result;
     }
 
     template<typename T, typename U, typename V, typename W, typename X>
@@ skipping 112 matching lines @@
     }
 
     template<typename T, typename U, typename V, typename W, typename X>
     inline void deleteAllKeys(const HashMap<T, U, V, W, X>& collection)
     {
         typedef typename HashMap<T, U, V, W, X>::const_iterator iterator;
         iterator end = collection.end();
         for (iterator it = collection.begin(); it != end; ++it)
             delete it->key;
     }
-    
+
     template<typename T, typename U, typename V, typename W, typename X, typename Y>
     inline void copyKeysToVector(const HashMap<T, U, V, W, X>& collection, Y& vector)
     {
         typedef typename HashMap<T, U, V, W, X>::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>
     inline void copyValuesToVector(const HashMap<T, U, V, W, X>& collection, Y& vector)
     {
         typedef typename HashMap<T, U, V, W, X>::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;
-    }   
+    }
 
 } // namespace WTF
 
 using WTF::HashMap;
 
 #include "wtf/RefPtrHashMap.h"
 
 #endif /* WTF_HashMap_h */