Fix template angle bracket syntax in platform

Source/platform/PODIntervalTreeTest.cpp

 /*
  * Copyright (C) 2010 Google Inc. All rights reserved.
  *
  * 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
  *     notice, this list of conditions and the following disclaimer.
  * 2.  Redistributions in binary form must reproduce the above copyright
@@ skipping 49 matching lines @@
     PODIntervalTree<float> tree;
     tree.add(PODInterval<float>(2, 4));
     ASSERT_TRUE(tree.checkInvariants());
 }
 
 TEST(PODIntervalTreeTest, TestInsertionAndQuery)
 {
     PODIntervalTree<float> tree;
     tree.add(PODInterval<float>(2, 4));
     ASSERT_TRUE(tree.checkInvariants());
-    Vector<PODInterval<float> > result = tree.allOverlaps(PODInterval<float>(1, 3));
+    Vector<PODInterval<float>> result = tree.allOverlaps(PODInterval<float>(1, 3));
     EXPECT_EQ(1U, result.size());
     EXPECT_EQ(2, result[0].low());
     EXPECT_EQ(4, result[0].high());
 }
 
 TEST(PODIntervalTreeTest, TestQueryAgainstZeroSizeInterval)
 {
     PODIntervalTree<float> tree;
     tree.add(PODInterval<float>(1, 2.5));
     tree.add(PODInterval<float>(3.5, 5));
     tree.add(PODInterval<float>(2, 4));
     ASSERT_TRUE(tree.checkInvariants());
-    Vector<PODInterval<float> > result = tree.allOverlaps(PODInterval<float>(3, 3));
+    Vector<PODInterval<float>> result = tree.allOverlaps(PODInterval<float>(3, 3));
     EXPECT_EQ(1U, result.size());
     EXPECT_EQ(2, result[0].low());
     EXPECT_EQ(4, result[0].high());
 }
 
 #ifndef NDEBUG
 template<>
 struct ValueToString<int*> {
     static String string(int* const& value)
     {
@@ skipping 56 matching lines @@
 }
 
 TEST(PODIntervalTreeTest, TestQueryingOfComplexUserData)
 {
     PODIntervalTree<float, UserData1> tree;
     UserData1 data1;
     data1.a = 5;
     data1.b = 6;
     tree.add(tree.createInterval(2, 4, data1));
     ASSERT_TRUE(tree.checkInvariants());
-    Vector<PODInterval<float, UserData1> > overlaps = tree.allOverlaps(tree.createInterval(3, 5, data1));
+    Vector<PODInterval<float, UserData1>> overlaps = tree.allOverlaps(tree.createInterval(3, 5, data1));
     EXPECT_EQ(1U, overlaps.size());
     EXPECT_EQ(5, overlaps[0].data().a);
     EXPECT_EQ(6, overlaps[0].data().b);
 }
 
 namespace {
 
 class EndpointType1 {
 public:
     explicit EndpointType1(int value)
@@ skipping 44 matching lines @@
 #endif
 
 namespace {
 
 void InsertionAndDeletionTest(int32_t seed, int treeSize)
 {
     initRandom(seed);
     int maximumValue = treeSize;
     // Build the tree
     PODIntervalTree<int> tree;
-    Vector<PODInterval<int> > addedElements;
-    Vector<PODInterval<int> > removedElements;
+    Vector<PODInterval<int>> addedElements;
+    Vector<PODInterval<int>> removedElements;
     for (int i = 0; i < treeSize; i++) {
         int left = nextRandom(maximumValue);
         int length = nextRandom(maximumValue);
         PODInterval<int> interval(left, left + length);
         tree.add(interval);
 #ifdef DEBUG_INSERTION_AND_DELETION_TEST
-        WTF_LOG_ERROR("*** Adding element %s", ValueToString<PODInterval<int> >::string(interval).ascii().data());
+        WTF_LOG_ERROR("*** Adding element %s", ValueToString<PODInterval<int>>::string(interval).ascii().data());
 #endif
         addedElements.append(interval);
     }
     // Churn the tree's contents.
     // First remove half of the elements in random order.
     for (int i = 0; i < treeSize / 2; i++) {
         int index = nextRandom(addedElements.size());
 #ifdef DEBUG_INSERTION_AND_DELETION_TEST
-        WTF_LOG_ERROR("*** Removing element %s", ValueToString<PODInterval<int> >::string(addedElements[index]).ascii().data());
+        WTF_LOG_ERROR("*** Removing element %s", ValueToString<PODInterval<int>>::string(addedElements[index]).ascii().data());
 #endif
         ASSERT_TRUE(tree.contains(addedElements[index])) << "Test failed for seed " << seed;
         tree.remove(addedElements[index]);
         removedElements.append(addedElements[index]);
         addedElements.remove(index);
         ASSERT_TRUE(tree.checkInvariants()) << "Test failed for seed " << seed;
     }
     // Now randomly add or remove elements.
     for (int i = 0; i < 2 * treeSize; i++) {
         bool add = false;
         if (!addedElements.size())
             add = true;
         else if (!removedElements.size())
             add = false;
         else
             add = (nextRandom(2) == 1);
         if (add) {
             int index = nextRandom(removedElements.size());
 #ifdef DEBUG_INSERTION_AND_DELETION_TEST
-            WTF_LOG_ERROR("*** Adding element %s", ValueToString<PODInterval<int> >::string(removedElements[index]).ascii().data());
+            WTF_LOG_ERROR("*** Adding element %s", ValueToString<PODInterval<int>>::string(removedElements[index]).ascii().data());
 #endif
             tree.add(removedElements[index]);
             addedElements.append(removedElements[index]);
             removedElements.remove(index);
         } else {
             int index = nextRandom(addedElements.size());
 #ifdef DEBUG_INSERTION_AND_DELETION_TEST
-            WTF_LOG_ERROR("*** Removing element %s", ValueToString<PODInterval<int> >::string(addedElements[index]).ascii().data());
+            WTF_LOG_ERROR("*** Removing element %s", ValueToString<PODInterval<int>>::string(addedElements[index]).ascii().data());
 #endif
             ASSERT_TRUE(tree.contains(addedElements[index])) << "Test failed for seed " << seed;
             ASSERT_TRUE(tree.remove(addedElements[index])) << "Test failed for seed " << seed;
             removedElements.append(addedElements[index]);
             addedElements.remove(index);
         }
         ASSERT_TRUE(tree.checkInvariants()) << "Test failed for seed " << seed;
     }
 }
 
@@ skipping 60 matching lines @@
     ASSERT_TRUE(tree.checkInvariants());
     tree.add(tree.createInterval(3, 5));
     ASSERT_TRUE(tree.checkInvariants());
     tree.add(tree.createInterval(4, 12));
     ASSERT_TRUE(tree.checkInvariants());
     tree.remove(tree.createInterval(4, 12));
     ASSERT_TRUE(tree.checkInvariants());
 }
 
 } // namespace blink