summaryrefslogtreecommitdiff
path: root/gtests/google_test/gtest/samples/sample3_unittest.cc
diff options
context:
space:
mode:
Diffstat (limited to 'gtests/google_test/gtest/samples/sample3_unittest.cc')
-rw-r--r--gtests/google_test/gtest/samples/sample3_unittest.cc12
1 files changed, 7 insertions, 5 deletions
diff --git a/gtests/google_test/gtest/samples/sample3_unittest.cc b/gtests/google_test/gtest/samples/sample3_unittest.cc
index 466bb126a..b19416d53 100644
--- a/gtests/google_test/gtest/samples/sample3_unittest.cc
+++ b/gtests/google_test/gtest/samples/sample3_unittest.cc
@@ -85,19 +85,21 @@ class QueueTestSmpl3 : public testing::Test {
// }
// A helper function that some test uses.
- static int Double(int n) { return 2 * n; }
+ static int Double(int n) {
+ return 2*n;
+ }
// A helper function for testing Queue::Map().
- void MapTester(const Queue<int>* q) {
+ void MapTester(const Queue<int> * q) {
// Creates a new queue, where each element is twice as big as the
// corresponding one in q.
- const Queue<int>* const new_q = q->Map(Double);
+ const Queue<int> * const new_q = q->Map(Double);
// Verifies that the new queue has the same size as q.
ASSERT_EQ(q->Size(), new_q->Size());
// Verifies the relationship between the elements of the two queues.
- for (const QueueNode<int> *n1 = q->Head(), *n2 = new_q->Head();
+ for (const QueueNode<int>*n1 = q->Head(), *n2 = new_q->Head();
n1 != nullptr; n1 = n1->next(), n2 = n2->next()) {
EXPECT_EQ(2 * n1->element(), n2->element());
}
@@ -122,7 +124,7 @@ TEST_F(QueueTestSmpl3, DefaultConstructor) {
// Tests Dequeue().
TEST_F(QueueTestSmpl3, Dequeue) {
- int* n = q0_.Dequeue();
+ int * n = q0_.Dequeue();
EXPECT_TRUE(n == nullptr);
n = q1_.Dequeue();