Fix template angle bracket syntax in xml

Source/core/xml/XPathFunctions.cpp

 /*
  * Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
  * Copyright (C) 2006, 2009 Apple Inc.
  * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org>
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1. Redistributions of source code must retain the above copyright
@@ skipping 273 matching lines @@
 
     if (m_min == Inf)
         return value <= m_max;
 
     if (m_max == Inf)
         return value >= m_min;
 
     return value >= m_min && value <= m_max;
 }
 
-void Function::setArguments(WillBeHeapVector<OwnPtrWillBeMember<Expression> >& args)
+void Function::setArguments(WillBeHeapVector<OwnPtrWillBeMember<Expression>>& args)
 {
     ASSERT(!subExprCount());
 
     // Some functions use context node as implicit argument, so when explicit arguments are added, they may no longer be context node sensitive.
     if (m_name != "lang" && !args.isEmpty())
         setIsContextNodeSensitive(false);
 
-    WillBeHeapVector<OwnPtrWillBeMember<Expression> >::iterator end = args.end();
-    for (WillBeHeapVector<OwnPtrWillBeMember<Expression> >::iterator it = args.begin(); it != end; ++it)
+    WillBeHeapVector<OwnPtrWillBeMember<Expression>>::iterator end = args.end();
+    for (WillBeHeapVector<OwnPtrWillBeMember<Expression>>::iterator it = args.begin(); it != end; ++it)
         addSubExpression(it->release());
 }
 
 Value FunLast::evaluate(EvaluationContext& context) const
 {
     return context.size;
 }
 
 Value FunPosition::evaluate(EvaluationContext& context) const
 {
@@ skipping 12 matching lines @@
             idList.append(str);
             idList.append(' ');
         }
     } else {
         String str = a.toString();
         idList.append(str);
     }
 
     TreeScope& contextScope = context.node->treeScope();
     OwnPtrWillBeRawPtr<NodeSet> result(NodeSet::create());
-    WillBeHeapHashSet<RawPtrWillBeMember<Node> > resultSet;
+    WillBeHeapHashSet<RawPtrWillBeMember<Node>> resultSet;
 
     unsigned startPos = 0;
     unsigned length = idList.length();
     while (true) {
         while (startPos < length && isWhitespace(idList[startPos]))
             ++startPos;
 
         if (startPos == length)
             break;
 
@@ skipping 373 matching lines @@
     };
 
     functionMap = new HashMap<String, FunctionRec>;
     for (size_t i = 0; i < WTF_ARRAY_LENGTH(functions); ++i)
         functionMap->set(functions[i].name, functions[i].function);
 }
 
 
 Function* createFunction(const String& name)
 {
-    WillBeHeapVector<OwnPtrWillBeMember<Expression> > args;
+    WillBeHeapVector<OwnPtrWillBeMember<Expression>> args;
     return createFunction(name, args);
 }
 
-Function* createFunction(const String& name, WillBeHeapVector<OwnPtrWillBeMember<Expression> >& args)
+Function* createFunction(const String& name, WillBeHeapVector<OwnPtrWillBeMember<Expression>>& args)
 {
     if (!functionMap)
         createFunctionMap();
 
     HashMap<String, FunctionRec>::iterator functionMapIter = functionMap->find(name);
     FunctionRec* functionRec = 0;
 
     if (functionMapIter == functionMap->end() || !(functionRec = &functionMapIter->value)->args.contains(args.size()))
         return 0;
 
     Function* function = functionRec->factoryFn();
     function->setArguments(args);
     function->setName(name);
     return function;
 }
 
 }
 }