Fix template angle bracket syntax

Source/wtf/LinkedHashSet.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 277 matching lines @@
     // slot and get the right answer.
     static const bool safeToCompareToEmptyOrDeleted = false;
 };
 
 template<typename Value, typename Allocator>
 struct LinkedHashSetExtractor {
     static const Value& extract(const LinkedHashSetNode<Value, Allocator>& node) { return node.m_value; }
 };
 
 template<typename Value, typename ValueTraitsArg, typename Allocator>
-struct LinkedHashSetTraits : public SimpleClassHashTraits<LinkedHashSetNode<Value, Allocator> > {
+struct LinkedHashSetTraits : public SimpleClassHashTraits<LinkedHashSetNode<Value, Allocator>> {
     typedef LinkedHashSetNode<Value, Allocator> Node;
     typedef ValueTraitsArg ValueTraits;
 
     // The slot is empty when the m_next field is zero so it's safe to zero
     // the backing.
     static const bool emptyValueIsZero = true;
 
     static const bool hasIsEmptyValueFunction = true;
     static bool isEmptyValue(const Node& node) { return !node.m_next; }
 
@@ skipping 285 matching lines @@
     const LinkedHashSet::Node* node = m_impl.template lookup<TranslatedFunctions, const T&>(value);
     if (!node)
         return end();
     return makeConstIterator(node);
 }
 
 template<typename Value, typename U, typename V, typename W>
 template<typename HashTranslator, typename T>
 inline bool LinkedHashSet<Value, U, V, W>::contains(const T& value) const
 {
-    return m_impl.template contains<LinkedHashSetTranslatorAdapter<HashTranslator> >(value);
+    return m_impl.template contains<LinkedHashSetTranslatorAdapter<HashTranslator>>(value);
 }
 
 template<typename T, typename U, typename V, typename W>
 inline bool LinkedHashSet<T, U, V, W>::contains(ValuePeekInType value) const
 {
     return m_impl.template contains<NodeHashFunctions>(value);
 }
 
 template<typename Value, typename HashFunctions, typename Traits, typename Allocator>
 typename LinkedHashSet<Value, HashFunctions, Traits, Allocator>::AddResult LinkedHashSet<Value, HashFunctions, Traits, Allocator>::add(ValuePeekInType value)
@@ skipping 107 matching lines @@
 void deleteAllValues(const LinkedHashSet<ValueType, T, U>& set)
 {
     typedef typename LinkedHashSet<ValueType, T, U>::const_iterator iterator;
     iterator end = set.end();
     for (iterator it = set.begin(); it != end; ++it)
         delete *it;
 }
 
 #if !ENABLE(OILPAN)
 template<typename T, typename U, typename V>
-struct NeedsTracing<LinkedHashSet<T, U, V> > {
+struct NeedsTracing<LinkedHashSet<T, U, V>> {
     static const bool value = false;
 };
 #endif
 
 }
 
 using WTF::LinkedHashSet;
 
 #endif /* WTF_LinkedHashSet_h */