Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 // Copyright (c) 2013 The Chromium Authors. All rights reserved. | |
| 2 // Use of this source code is governed by a BSD-style license that can be | |
| 3 // found in the LICENSE file. | |
| 4 | |
| 5 #include "base/barrier_closure.h" | |
| 6 | |
| 7 #include "base/bind.h" | |
| 8 #include "testing/gtest/include/gtest/gtest.h" | |
| 9 | |
| 10 void Increment(int* count) { (*count)++; } | |
| 11 | |
| 12 TEST(BarrierClosureTest, RunImmediatelyForZeroClosures) { | |
| 13 int count = 0; | |
| 14 base::Closure doneClosure(base::Bind(&Increment, base::Unretained(&count))); | |
| 15 | |
| 16 base::Closure barrierClosure=base::BarrierClosure(0, doneClosure); | |
|
awong
2013/08/22 21:28:33
spaces around = please.
groby-ooo-7-16
2013/08/22 21:59:45
Done.
| |
| 17 EXPECT_EQ(1, count); | |
| 18 } | |
| 19 | |
| 20 TEST(BarrierClosureTest, RunAfterNumClosures) { | |
| 21 int count = 0; | |
| 22 base::Closure doneClosure(base::Bind(&Increment, base::Unretained(&count))); | |
| 23 | |
| 24 base::Closure barrierClosure=base::BarrierClosure(2, doneClosure); | |
|
awong
2013/08/22 21:28:33
spaces around = please.
groby-ooo-7-16
2013/08/22 21:59:45
Done.
| |
| 25 EXPECT_EQ(0, count); | |
| 26 | |
| 27 barrierClosure.Run(); | |
| 28 EXPECT_EQ(0, count); | |
| 29 | |
| 30 barrierClosure.Run(); | |
| 31 EXPECT_EQ(1, count); | |
| 32 } | |
| OLD | NEW |