forked from ChicoState/cpp-gtest
-
Notifications
You must be signed in to change notification settings - Fork 0
/
randoTest.cpp
147 lines (135 loc) · 3.44 KB
/
randoTest.cpp
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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
/**
* Unit Tests for Rando Test
**/
#include <gtest/gtest.h>
#include "rando.h"
/*
FUNCTIONS WE NEED TO TEST:
bool shouldWorry(bool,bool,bool);
bool isDivisbleBy(int,int);
bool isPrime(int);
int nearestToZero(int,int);
*/
class RandoTest : public ::testing::Test
{
protected:
RandoTest(){} //constructor runs before each test
virtual ~RandoTest(){} //destructor cleans up after tests
virtual void SetUp(){} //sets up before each test (after constructor)
virtual void TearDown(){}//clean up after each test,(before destructor)
};
TEST(RandoTest, allChildrenSmile)
{
Rando rando;
ASSERT_TRUE( rando.shouldWorry(true,true,true) );
}
TEST(RandoTest, isDivisibleBy)
{
Rando rando;
ASSERT_FALSE( rando.isDivisibleBy( 0, 0 ) );
for( int a = -3; a < 4; a++ )
{
if ( a == 0 ) // Skip zero, already checked.
{
a++;
}
ASSERT_TRUE( rando.isDivisibleBy( 0, a ) );
ASSERT_FALSE( rando.isDivisibleBy( a, 0 ) );
}
for( int a = 1; a < 5; a++ )
{
ASSERT_TRUE( rando.isDivisibleBy( 5 * a, 5 ) );
}
for( int a = 3; a < 8; a++ )
{
ASSERT_FALSE( rando.isDivisibleBy( 2, a ) );
}
}
TEST(RandoTest, isPrime)
{
Rando rando;
for( int n = 100; n >= -1; n--)
{
switch( n )
{
default: // negative or composite numbers are default.
ASSERT_FALSE( rando.isPrime( n ) );
break;
// cases are all prime numbers between 2 and 100.
case 2: // Fallthroughts...
case 3:
case 5:
case 7:
case 11:
case 13:
case 17:
case 19:
case 23:
case 29:
case 31:
case 37:
case 41:
case 43:
case 47:
case 53:
case 59:
case 61:
case 67:
case 71:
case 73:
case 79:
case 83:
case 89:
case 97:
// x == true used for clarity in gtest output.
ASSERT_TRUE( rando.isPrime( n ) );
}
}
}
TEST(RandoTest, nearestToZero)
{
Rando rando;
for( int a = 2; a < 5; a++ )
{
ASSERT_TRUE( rando.nearestToZero( a, 1 ) == 1 );
}
for( int a = 2; a < 5; a++ )
{
ASSERT_TRUE( rando.nearestToZero( a, -1 ) == -1 );
}
for( int a = 1; a < 5; a++ )
{
ASSERT_TRUE( rando.nearestToZero( a, 30 ) == a );
}
for( int a = 1; a < 5; a++ )
{
ASSERT_TRUE( rando.nearestToZero( a, -30 ) == a );
}
for( int a = 2; a < 5; a++ )
{
ASSERT_TRUE( rando.nearestToZero( 1, a ) == 1 );
}
for( int a = 2; a < 5; a++ )
{
ASSERT_TRUE( rando.nearestToZero( -1, a ) == -1 );
}
for( int a = 2; a < 5; a++ )
{
ASSERT_TRUE( rando.nearestToZero( 30, a ) == a );
}
for( int a = 1; a < 5; a++ )
{
ASSERT_TRUE( rando.nearestToZero( -30, a ) == a );
}
for( int a = 1, b = -1; a > -5; a--, b++ )
{
ASSERT_TRUE( rando.nearestToZero( a, b ) == a );
ASSERT_TRUE( rando.nearestToZero( b, a ) == b );
}
ASSERT_TRUE( rando.nearestToZero( 0, 0 ) == 0 );
for( int a = 1; a < 5; a++ )
{
ASSERT_TRUE( rando.nearestToZero( 0, a ) != 0 );
ASSERT_TRUE( rando.nearestToZero( a, 0 ) != 0 );
}
}