summaryrefslogtreecommitdiffstats
path: root/src/build_test.cc
diff options
context:
space:
mode:
authorRobert Iannucci <robbie@rail.com>2012-11-30 01:47:22 (GMT)
committerRobert Iannucci <robbie@rail.com>2012-11-30 01:47:22 (GMT)
commitcc531200853eea49b4b7e70cbabf394a9c864c79 (patch)
tree5389a9c5895e2d0949c76059b9d0ba38305d5eb9 /src/build_test.cc
parent14b3e108edc4a5476a1c2a6b8ae69f6416bca0de (diff)
downloadNinja-cc531200853eea49b4b7e70cbabf394a9c864c79.zip
Ninja-cc531200853eea49b4b7e70cbabf394a9c864c79.tar.gz
Ninja-cc531200853eea49b4b7e70cbabf394a9c864c79.tar.bz2
Fix formatting
Diffstat (limited to 'src/build_test.cc')
-rw-r--r--src/build_test.cc12
1 files changed, 6 insertions, 6 deletions
diff --git a/src/build_test.cc b/src/build_test.cc
index 34db237..17e433b 100644
--- a/src/build_test.cc
+++ b/src/build_test.cc
@@ -240,9 +240,9 @@ TEST_F(PlanTest, PoolsWithDepthTwo) {
"build allTheThings: cat out1 out2 out3 outb1 outb2 outb3\n"
));
// Mark all the out* nodes dirty
- for(int i = 0; i < 3; ++i) {
- GetNode("out"+string(1, '1'+i))->MarkDirty();
- GetNode("outb"+string(1, '1'+i))->MarkDirty();
+ for (int i = 0; i < 3; ++i) {
+ GetNode("out" + string(1, '1' + i))->MarkDirty();
+ GetNode("outb" + string(1, '1' + i))->MarkDirty();
}
GetNode("allTheThings")->MarkDirty();
@@ -252,13 +252,13 @@ TEST_F(PlanTest, PoolsWithDepthTwo) {
// Grab the first 4 edges, out1 out2 outb1 outb2
deque<Edge*> edges;
- for(int i = 0; i < 4; ++i) {
+ for (int i = 0; i < 4; ++i) {
ASSERT_TRUE(plan_.more_to_do());
Edge* edge = plan_.FindWork();
ASSERT_TRUE(edge);
ASSERT_EQ("in", edge->inputs_[0]->path());
string base_name(i < 2 ? "out" : "outb");
- ASSERT_EQ(base_name+string(1, '1'+(i%2)), edge->outputs_[0]->path());
+ ASSERT_EQ(base_name + string(1, '1' + (i % 2)), edge->outputs_[0]->path());
edges.push_back(edge);
}
@@ -288,7 +288,7 @@ TEST_F(PlanTest, PoolsWithDepthTwo) {
ASSERT_FALSE(plan_.FindWork());
- for(deque<Edge*>::iterator it = edges.begin(); it != edges.end(); ++it) {
+ for (deque<Edge*>::iterator it = edges.begin(); it != edges.end(); ++it) {
plan_.EdgeFinished(*it);
}