-
Notifications
You must be signed in to change notification settings - Fork 529
Expand file tree
/
Copy pathGTest2ConvertorTest.cpp
More file actions
109 lines (89 loc) · 3.64 KB
/
Copy pathGTest2ConvertorTest.cpp
File metadata and controls
109 lines (89 loc) · 3.64 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
/*
* Copyright (c) 2011, Michael Feathers, James Grenning and Bas Vodde
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the <organization> nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE EARLIER MENTIONED AUTHORS ''AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL <copyright holder> BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifdef CPPUTEST_INCLUDE_GTEST_TESTS
#include "CppUTestExt/GTestConvertor.h"
class GTestTestingFixtureTest : public testing::Test {
protected:
bool setup_was_called;
char* freed_during_teardown;
void SetUp() CPPUTEST_OVERRIDE
{
setup_was_called = true;
freed_during_teardown = NULL;
}
void TearDown() CPPUTEST_OVERRIDE
{
delete [] freed_during_teardown;
}
};
TEST_F(GTestTestingFixtureTest, setupBeenCalled)
{
EXPECT_TRUE(setup_was_called);
}
TEST_F(GTestTestingFixtureTest, teardownMustBeCalledOrElseThisWillLeak)
{
freed_during_teardown = new char[100];
}
#endif
#undef TEST
#include "CppUTest/TestHarness.h"
#include "CppUTest/TestRegistry.h"
#include "CppUTest/TestTestingFixture.h"
TEST_GROUP(GTestConvertor)
{
};
#ifdef CPPUTEST_INCLUDE_GTEST_TESTS
/*
* These tests depend on the amount of GTests that are actually added (also in other files).
* This is due to the singleton in gtest.
*
*/
TEST(GTestConvertor, correctNumberOfTestCases)
{
LONGS_EQUAL(2, ::testing::UnitTest::GetInstance()->total_test_case_count());
CHECK(::testing::UnitTest::GetInstance()->GetTestCase(0));
CHECK(::testing::UnitTest::GetInstance()->GetTestCase(1));
CHECK(::testing::UnitTest::GetInstance()->GetTestCase(2) == NULL);
}
TEST(GTestConvertor, correctNumberOfTestsInTheTestCases)
{
const ::testing::TestCase* firstTestCase = ::testing::UnitTest::GetInstance()->GetTestCase(0);
const ::testing::TestCase* secondTestCase = ::testing::UnitTest::GetInstance()->GetTestCase(1);
STRCMP_EQUAL("GTestSimpleTest", firstTestCase->name());
STRCMP_EQUAL("GTestTestingFixtureTest", secondTestCase->name());
LONGS_EQUAL(7, firstTestCase->total_test_count());
LONGS_EQUAL(2, secondTestCase->total_test_count());
}
TEST(GTestConvertor, testsGetAddedToCurrentTestRegistry)
{
TestTestingFixture fixture;
TestRegistry::getCurrentRegistry()->unDoLastAddTest();
GTestConvertor convertor(false);
convertor.addAllGTestToTestRegistry();
LONGS_EQUAL(9, TestRegistry::getCurrentRegistry()->countTests());
}
#endif