Fix template angle bracket syntax

Source/wtf/ListHashSet.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserved.
  * Copyright (C) 2011, Benjamin Poulain <ikipou@gmail.com>
  *
  * 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,
@@ skipping 56 matching lines @@
     class ListHashSetDestructorBase<Derived, Allocator, false> {
     public:
         ~ListHashSetDestructorBase() { static_cast<Derived*>(this)->finalize(); }
     protected:
         typename Allocator::AllocatorProvider m_allocatorProvider;
     };
 
     // Note that for a ListHashSet you cannot specify the HashTraits as a
     // template argument. It uses the default hash traits for the ValueArg
     // type.
-    template<typename ValueArg, size_t inlineCapacity = 256, typename HashArg = typename DefaultHash<ValueArg>::Hash, typename AllocatorArg = ListHashSetAllocator<ValueArg, inlineCapacity> > class ListHashSet
+    template<typename ValueArg, size_t inlineCapacity = 256, typename HashArg = typename DefaultHash<ValueArg>::Hash, typename AllocatorArg = ListHashSetAllocator<ValueArg, inlineCapacity>> class ListHashSet
         : public ListHashSetDestructorBase<ListHashSet<ValueArg, inlineCapacity, HashArg, AllocatorArg>, AllocatorArg, AllocatorArg::isGarbageCollected> {
         typedef AllocatorArg Allocator;
         WTF_USE_ALLOCATOR(ListHashSet, Allocator);
 
         typedef ListHashSetNode<ValueArg, Allocator> Node;
         typedef HashTraits<Node*> NodeTraits;
         typedef ListHashSetNodeHashFunctions<HashArg> NodeHash;
         typedef ListHashSetTranslator<HashArg> BaseTranslator;
 
         typedef HashTable<Node*, Node*, IdentityExtractor, NodeHash, NodeTraits, NodeTraits, typename Allocator::TableAllocator> ImplType;
@@ skipping 676 matching lines @@
     template<typename Translator>
     struct ListHashSetTranslatorAdapter {
         template<typename T> static unsigned hash(const T& key) { return Translator::hash(key); }
         template<typename T, typename U> static bool equal(const T& a, const U& b) { return Translator::equal(a->m_value, b); }
     };
 
     template<typename ValueType, size_t inlineCapacity, typename U, typename V>
     template<typename HashTranslator, typename T>
     inline typename ListHashSet<ValueType, inlineCapacity, U, V>::iterator ListHashSet<ValueType, inlineCapacity, U, V>::find(const T& value)
     {
-        ImplTypeConstIterator it = m_impl.template find<ListHashSetTranslatorAdapter<HashTranslator> >(value);
+        ImplTypeConstIterator it = m_impl.template find<ListHashSetTranslatorAdapter<HashTranslator>>(value);
         if (it == m_impl.end())
             return end();
         return makeIterator(*it);
     }
 
     template<typename ValueType, size_t inlineCapacity, typename U, typename V>
     template<typename HashTranslator, typename T>
     inline typename ListHashSet<ValueType, inlineCapacity, U, V>::const_iterator ListHashSet<ValueType, inlineCapacity, U, V>::find(const T& value) const
     {
-        ImplTypeConstIterator it = m_impl.template find<ListHashSetTranslatorAdapter<HashTranslator> >(value);
+        ImplTypeConstIterator it = m_impl.template find<ListHashSetTranslatorAdapter<HashTranslator>>(value);
         if (it == m_impl.end())
             return end();
         return makeConstIterator(*it);
     }
 
     template<typename ValueType, size_t inlineCapacity, typename U, typename V>
     template<typename HashTranslator, typename T>
     inline bool ListHashSet<ValueType, inlineCapacity, U, V>::contains(const T& value) const
     {
-        return m_impl.template contains<ListHashSetTranslatorAdapter<HashTranslator> >(value);
+        return m_impl.template contains<ListHashSetTranslatorAdapter<HashTranslator>>(value);
     }
 
     template<typename T, size_t inlineCapacity, typename U, typename V>
     inline bool ListHashSet<T, inlineCapacity, U, V>::contains(ValuePeekInType value) const
     {
         return m_impl.template contains<BaseTranslator>(value);
     }
 
     template<typename T, size_t inlineCapacity, typename U, typename V>
     typename ListHashSet<T, inlineCapacity, U, V>::AddResult ListHashSet<T, inlineCapacity, U, V>::add(ValuePassInType value)
@@ skipping 193 matching lines @@
     {
         static_assert(HashTraits<T>::weakHandlingFlag == NoWeakHandlingInCollections, "ListHashSet does not support weakness");
         // This marks all the nodes and their contents live that can be
         // accessed through the HashTable. That includes m_head and m_tail
         // so we do not have to explicitly trace them here.
         m_impl.trace(visitor);
     }
 
 #if !ENABLE(OILPAN)
     template<typename T, size_t U, typename V>
-    struct NeedsTracing<ListHashSet<T, U, V> > {
+    struct NeedsTracing<ListHashSet<T, U, V>> {
         static const bool value = false;
     };
 #endif
 
 } // namespace WTF
 
 using WTF::ListHashSet;
 
 #endif /* WTF_ListHashSet_h */