Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(790)

Unified Diff: net/base/priority_queue_unittest.cc

Issue 266243004: Clang format slam. Base URL: svn://svn.chromium.org/chrome/trunk/src
Patch Set: Created 6 years, 7 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
Index: net/base/priority_queue_unittest.cc
diff --git a/net/base/priority_queue_unittest.cc b/net/base/priority_queue_unittest.cc
index 8093319fddbd493b6beefe8726706e360c3d9a22..bea979eca32a86ac301357838edbfe652df6b6b1 100644
--- a/net/base/priority_queue_unittest.cc
+++ b/net/base/priority_queue_unittest.cc
@@ -13,13 +13,13 @@ namespace net {
namespace {
typedef PriorityQueue<int>::Priority Priority;
-const Priority kPriorities[] = { 2, 1, 2, 0, 4, 3, 1, 4, 0 };
+const Priority kPriorities[] = {2, 1, 2, 0, 4, 3, 1, 4, 0};
const Priority kNumPriorities = 5; // max(kPriorities) + 1
const size_t kNumElements = arraysize(kPriorities);
-const int kFirstMinOrder[kNumElements] = { 3, 8, 1, 6, 0, 2, 5, 4, 7 };
-const int kLastMaxOrderErase[kNumElements] = { 7, 4, 5, 2, 0, 6, 1, 8, 3 };
-const int kFirstMaxOrder[kNumElements] = { 4, 7, 5, 0, 2, 1, 6, 3, 8 };
-const int kLastMinOrder[kNumElements] = { 8, 3, 6, 1, 2, 0, 5, 7, 4 };
+const int kFirstMinOrder[kNumElements] = {3, 8, 1, 6, 0, 2, 5, 4, 7};
+const int kLastMaxOrderErase[kNumElements] = {7, 4, 5, 2, 0, 6, 1, 8, 3};
+const int kFirstMaxOrder[kNumElements] = {4, 7, 5, 0, 2, 1, 6, 3, 8};
+const int kLastMinOrder[kNumElements] = {8, 3, 6, 1, 2, 0, 5, 7, 4};
class PriorityQueueTest : public testing::Test {
protected:
@@ -122,7 +122,7 @@ TEST_F(PriorityQueueTest, EraseFromMiddle) {
queue_.Erase(pointers_[2]);
queue_.Erase(pointers_[3]);
- const int expected_order[] = { 8, 1, 6, 0, 5, 4, 7 };
+ const int expected_order[] = {8, 1, 6, 0, 5, 4, 7};
for (size_t i = 0; i < arraysize(expected_order); ++i) {
EXPECT_EQ(expected_order[i], queue_.FirstMin().value());
@@ -137,7 +137,7 @@ TEST_F(PriorityQueueTest, InsertAtFront) {
queue_.InsertAtFront(11, 1);
queue_.InsertAtFront(12, 1);
- const int expected_order[] = { 10, 3, 8, 12, 11, 1, 6, 9, 0, 2, 5, 4, 7 };
+ const int expected_order[] = {10, 3, 8, 12, 11, 1, 6, 9, 0, 2, 5, 4, 7};
for (size_t i = 0; i < arraysize(expected_order); ++i) {
EXPECT_EQ(expected_order[i], queue_.FirstMin().value());

Powered by Google App Engine
This is Rietveld 408576698