Fix template angle bracket syntax

Source/wtf/HashSet.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 158 matching lines @@
     inline bool HashSet<Value, HashFunctions, Traits, Allocator>::contains(ValuePeekInType value) const
     {
         return m_impl.contains(value);
     }
 
     template<typename Value, typename HashFunctions, typename Traits, typename Allocator>
     template<typename HashTranslator, typename T>
     typename HashSet<Value, HashFunctions, Traits, Allocator>::iterator
     inline HashSet<Value, HashFunctions, Traits, Allocator>::find(const T& value) const
     {
-        return m_impl.template find<HashSetTranslatorAdapter<HashTranslator> >(value);
+        return m_impl.template find<HashSetTranslatorAdapter<HashTranslator>>(value);
     }
 
     template<typename Value, typename HashFunctions, typename Traits, typename Allocator>
     template<typename HashTranslator, typename T>
     inline bool HashSet<Value, HashFunctions, Traits, Allocator>::contains(const T& value) const
     {
-        return m_impl.template contains<HashSetTranslatorAdapter<HashTranslator> >(value);
+        return m_impl.template contains<HashSetTranslatorAdapter<HashTranslator>>(value);
     }
 
     template<typename T, typename U, typename V, typename W>
     inline typename HashSet<T, U, V, W>::AddResult HashSet<T, U, V, W>::add(ValuePassInType value)
     {
         return m_impl.add(value);
     }
 
     template<typename Value, typename HashFunctions, typename Traits, typename Allocator>
     template<typename HashTranslator, typename T>
     inline typename HashSet<Value, HashFunctions, Traits, Allocator>::AddResult
     HashSet<Value, HashFunctions, Traits, Allocator>::add(const T& value)
     {
-        return m_impl.template addPassingHashCode<HashSetTranslatorAdapter<HashTranslator> >(value, value);
+        return m_impl.template addPassingHashCode<HashSetTranslatorAdapter<HashTranslator>>(value, value);
     }
 
     template<typename T, typename U, typename V, typename W>
     inline void HashSet<T, U, V, W>::remove(iterator it)
     {
         m_impl.remove(it.m_impl);
     }
 
     template<typename T, typename U, typename V, typename W>
     inline void HashSet<T, U, V, W>::remove(ValuePeekInType value)
@@ skipping 56 matching lines @@
         vector.resize(collection.size());
 
         iterator it = collection.begin();
         iterator end = collection.end();
         for (unsigned i = 0; it != end; ++it, ++i)
             vector[i] = *it;
     }
 
 #if !ENABLE(OILPAN)
     template<typename T, typename U, typename V>
-    struct NeedsTracing<HashSet<T, U, V> > {
+    struct NeedsTracing<HashSet<T, U, V>> {
         static const bool value = false;
     };
 #endif
 
 } // namespace WTF
 
 using WTF::HashSet;
 
 #endif /* WTF_HashSet_h */