Fix template angle bracket syntax

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 313 matching lines @@
     inline bool HashMap<T, U, V, W, X, Y>::contains(KeyPeekInType key) const
     {
         return m_impl.contains(key);
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y>
     template<typename HashTranslator, typename TYPE>
     inline typename HashMap<T, U, V, W, X, Y>::iterator
     HashMap<T, U, V, W, X, Y>::find(const TYPE& value)
     {
-        return m_impl.template find<HashMapTranslatorAdapter<ValueTraits, HashTranslator> >(value);
+        return m_impl.template find<HashMapTranslatorAdapter<ValueTraits, HashTranslator>>(value);
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y>
     template<typename HashTranslator, typename TYPE>
     inline typename HashMap<T, U, V, W, X, Y>::const_iterator
     HashMap<T, U, V, W, X, Y>::find(const TYPE& value) const
     {
-        return m_impl.template find<HashMapTranslatorAdapter<ValueTraits, HashTranslator> >(value);
+        return m_impl.template find<HashMapTranslatorAdapter<ValueTraits, HashTranslator>>(value);
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y>
     template<typename HashTranslator, typename TYPE>
     inline bool
     HashMap<T, U, V, W, X, Y>::contains(const TYPE& value) const
     {
-        return m_impl.template contains<HashMapTranslatorAdapter<ValueTraits, HashTranslator> >(value);
+        return m_impl.template contains<HashMapTranslatorAdapter<ValueTraits, HashTranslator>>(value);
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y>
     typename HashMap<T, U, V, W, X, Y>::AddResult
     HashMap<T, U, V, W, X, Y>::inlineAdd(KeyPeekInType key, MappedPassInReferenceType mapped)
     {
-        return m_impl.template add<HashMapTranslator<ValueTraits, HashFunctions> >(key, mapped);
+        return m_impl.template add<HashMapTranslator<ValueTraits, HashFunctions>>(key, mapped);
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y>
     typename HashMap<T, U, V, W, X, Y>::AddResult
     HashMap<T, U, V, W, X, Y>::set(KeyPeekInType 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.storedValue->value);
         }
         return result;
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y>
     template<typename HashTranslator, typename TYPE>
     typename HashMap<T, U, V, W, X, Y>::AddResult
     HashMap<T, U, V, W, X, Y>::add(const TYPE& key, MappedPassInType value)
     {
-        return m_impl.template addPassingHashCode<HashMapTranslatorAdapter<ValueTraits, HashTranslator> >(key, value);
+        return m_impl.template addPassingHashCode<HashMapTranslatorAdapter<ValueTraits, HashTranslator>>(key, value);
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y>
     typename HashMap<T, U, V, W, X, Y>::AddResult
     HashMap<T, U, V, W, X, Y>::add(KeyPeekInType key, MappedPassInType mapped)
     {
         return inlineAdd(key, mapped);
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y>
@@ skipping 99 matching lines @@
         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> > {
+struct NeedsTracing<HashMap<T, U, V, W, X>> {
     static const bool value = false;
 };
 #endif
 
 } // namespace WTF
 
 using WTF::HashMap;
 
 #endif /* WTF_HashMap_h */