Clang format slam.

net/quic/quic_sent_entropy_manager_test.cc

 // Copyright 2013 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "net/quic/quic_sent_entropy_manager.h"
 
 #include <algorithm>
 #include <vector>
 
 #include "testing/gmock/include/gmock/gmock.h"
@@ skipping 27 matching lines @@
   }
 
   QuicPacketEntropyHash hash = 0;
   for (size_t i = 0; i < entropies.size(); ++i) {
     hash ^= entropies[i].second;
     EXPECT_EQ(hash, entropy_manager_.EntropyHash(i + 1));
   }
 }
 
 TEST_F(QuicSentEntropyManagerTest, IsValidEntropy) {
-  QuicPacketEntropyHash entropies[10] =
-      {12, 1, 33, 3, 32, 100, 28, 42, 22, 255};
+  QuicPacketEntropyHash entropies[10] = {12,  1,  33, 3,  32,
+                                         100, 28, 42, 22, 255};
   for (size_t i = 0; i < 10; ++i) {
     entropy_manager_.RecordPacketEntropyHash(i + 1, entropies[i]);
   }
 
   SequenceNumberSet missing_packets;
   missing_packets.insert(1);
   missing_packets.insert(4);
   missing_packets.insert(7);
   missing_packets.insert(8);
 
   QuicPacketEntropyHash entropy_hash = 0;
   for (size_t i = 0; i < 10; ++i) {
     if (missing_packets.find(i + 1) == missing_packets.end()) {
       entropy_hash ^= entropies[i];
     }
   }
 
-  EXPECT_TRUE(entropy_manager_.IsValidEntropy(10, missing_packets,
-                                              entropy_hash));
+  EXPECT_TRUE(
+      entropy_manager_.IsValidEntropy(10, missing_packets, entropy_hash));
 }
 
 }  // namespace
 }  // namespace test
 }  // namespace net