DO NOT COMMIT: Results of running new (proposed) clang-format on Blink

third_party/WebKit/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 107 matching lines @@
   float a;
   int b;
 };
 
 }  // anonymous namespace
 
 #ifndef NDEBUG
 template <>
 struct ValueToString<UserData1> {
   static String toString(const UserData1& value) {
-    return String("[UserData1 a=") + String::number(value.a) + " b=" +
-           String::number(value.b) + "]";
+    return String("[UserData1 a=") + String::number(value.a) +
+           " b=" + String::number(value.b) + "]";
   }
 };
 #endif
 
 TEST(PODIntervalTreeTest, TestInsertionOfComplexUserData) {
   PODIntervalTree<float, UserData1> tree;
   UserData1 data1;
   data1.a = 5;
   data1.b = 6;
   tree.add(tree.createInterval(2, 4, data1));
@@ skipping 89 matching lines @@
   }
   // 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
     DLOG(ERROR) << "*** Removing element "
                 << ValueToString<PODInterval<int>>::string(
                        addedElements[index]);
 #endif
-    ASSERT_TRUE(tree.contains(addedElements[index])) << "Test failed for seed "
-                                                     << seed;
+    ASSERT_TRUE(tree.contains(addedElements[index]))
+        << "Test failed for seed " << seed;
     tree.remove(addedElements[index]);
     removedElements.push_back(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;
@@ skipping 13 matching lines @@
       removedElements.remove(index);
     } else {
       int index = nextRandom(addedElements.size());
 #ifdef DEBUG_INSERTION_AND_DELETION_TEST
       DLOG(ERROR) << "*** Removing element "
                   << ValueToString<PODInterval<int>>::string(
                          addedElements[index]);
 #endif
       ASSERT_TRUE(tree.contains(addedElements[index]))
           << "Test failed for seed " << seed;
-      ASSERT_TRUE(tree.remove(addedElements[index])) << "Test failed for seed "
-                                                     << seed;
+      ASSERT_TRUE(tree.remove(addedElements[index]))
+          << "Test failed for seed " << seed;
       removedElements.push_back(addedElements[index]);
       addedElements.remove(index);
     }
     ASSERT_TRUE(tree.checkInvariants()) << "Test failed for seed " << seed;
   }
 }
 
 }  // anonymous namespace
 
 TEST(PODIntervalTreeTest, RandomDeletionAndInsertionRegressionTest1) {
@@ skipping 54 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