软件工程实验五 单元测试

  1 #include "stdio.h"
  2 #include "time.h"
  3 #include "windows.h"
  4 #include "windowsx.h"
  5 #include "iostream"
  6 using namespace std;
  7 
  8 #define WINDOW_WIDTH  820
  9 #define WINDOW_HEIGHT 600
 10 #define WORLD_WIDTH 40
 11 #define WORLD_HEIGHT 20
 12 #define CELL_SIZE 20
 13 #define WIDTH 40
 14 #define HEIGHT 20
 15 
 16 class CWorld *g_world = NULL;   //全局世界指针
 17 
 18 typedef struct _SCell              //细胞生存状态
 19 {
 20     int Alive;
 21 } 
 22 SCell;
 23 
 24 class CWorld
 25 {
 26 private:
 27     int width;
 28     int height;
 29     SCell* current_map;   //当前地图
 30     SCell* new_map;   //下一轮使用的地图
 31     void setCurCell(int x, int y, int Alive);
 32     void setNewCell(int x, int y, int Alive);
 33     int getAroundCellNum(int x, int y); //获得某个位置周围存活的细胞数量
 34     int locValid(int x, int y);   //判定输入位置是否有效, 1-有效 0-无效
 35     void swapMap(void) ;    //交换地图
 36     SCell* getCell(SCell* buf, int x, int y); //从地图buffer中获取某坐标的细胞指针
 37 public:
 38     CWorld(int Width, int Height);
 39     ~CWorld();
 40     void InitMap(void);  //随机初始化地图
 41     void killAll(void);     //杀死所有细胞
 42     void nextStep(void);    //进入下一回合
 43     int getCellAlive(int x, int y); //获取细胞存活状态 , 返回值:1-存活, 0-死亡 -1-出错
 44     int setCellAlive(int x, int y, int Alive);    //设置细胞存活状态 , 返回值:0-成功 负值-失败
 45     int getWidth() { return width; }      //获得当前地图宽度
 46     int getHeight() { return height; }    //获得当前地图高度
 47 };
 48 
 49 
 50 SCell* current_map = (SCell *) new SCell[WIDTH * HEIGHT];
 51 SCell* new_map = (SCell *) new SCell[WIDTH * HEIGHT];
 52 
 53 void CWorld::killAll(void)                //清屏
 54 {
 55     if (current_map != NULL && new_map != NULL)
 56     {
 57         for (int i = 0; i < WIDTH; ++i)
 58         {
 59             for (int j = 0; j < HEIGHT; ++j)
 60             {
 61                 setCurCell(i, j, 0);
 62                 setNewCell(i, j, 0);
 63             }
 64         }
 65     }
 66 
 67 }
 68 
 69 void CWorld::InitMap()        //初始化细胞矩阵
 70 {
 71     killAll();
 72 
 73     srand((unsigned)time(NULL)); //用时间做种，每次产生随机数不一样
 74 
 75     for (int i = 0; i < WIDTH; ++i)
 76     {
 77         for (int j = 0; j < HEIGHT; ++j)
 78         {
 79             int Alive = rand() % 2;  //产生0或1的随机数
 80             setCurCell(i, j, Alive);
 81         }
 82 
 83     }
 84 }
 85 
 86 void CWorld::setCurCell(int x, int y, int Alive)  //设置当前细胞矩阵细胞存活状态
 87 {
 88     if (locValid(x, y) == 0)
 89     {
 90         return;
 91     }
 92     else
 93     {
 94         SCell* cell = getCell(current_map, x, y);
 95         if (cell - current_map >= WIDTH * HEIGHT)
 96         {
 97             return;
 98         }
 99         cell->Alive = Alive;
100     }
101 }
102 
103 void CWorld::setNewCell(int x, int y, int Alive)  //设置下一时刻细胞矩阵存活状态
104 {
105     if (locValid(x, y) == 0)
106     {
107         return;
108     }
109     else
110     {
111         SCell* cell = getCell(new_map, x, y);
112         if (cell - new_map >= WIDTH * HEIGHT)
113         {
114             return;
115         }
116         cell->Alive = Alive;
117     }
118 }
119 
120 int CWorld::getAroundCellNum(int x, int y)   //计算周围存活细胞数量
121 {
122     int count = 0;
123 
124     if (locValid(x, y) == 0)  //边界判断
125     {   
126         return -1;
127     }
128     //测试目标位置周围的八个相邻位置
129     for (int i = x - 1; i <= x + 1; ++i)
130     {
131         for (int j = y - 1; j <= y + 1; ++j)
132         {
133             if (i == x && j == y)
134             {
135                 continue;
136             }
137             if (locValid(i, j) == 1)
138             {
139                 if (getCellAlive(i, j) == 1)
140                 {
141                     count++;
142                 }
143             }
144         }
145     }
146 
147     return count;
148 }
149 
150 int CWorld::locValid(int x, int y) //边界判断
151 {
152     if (x >= WIDTH || x < 0 || y >= HEIGHT || y < 0)
153     {
154         return 0;
155     }
156     return 1;
157 }
158 
159 
160 
161 
162 /*
163 每个细胞的生死遵循下面的原则：
164 1． 如果一个细胞周围有3个细胞为生（一个细胞周围共有8个细胞），则该细胞为生（即该细胞若原先为死，则转为生，若原先为生，则保持不变） 。
165 2． 如果一个细胞周围有2个细胞为生，则该细胞的生死状态保持不变；
166 3． 在其它情况下，该细胞为死
167 */
168 void CWorld::nextStep(void)     //根据规则计算下一时刻细胞矩阵
169 {
170     int aroundNum = 0;
171     for (int i = 0; i < WIDTH; ++i)
172     {
173         for (int j = 0; j < HEIGHT; ++j)
174         {
175             aroundNum = getAroundCellNum(i, j);
176             if (aroundNum == 2)
177             {
178                 setNewCell(i, j, getCellAlive(i, j));
179             }
180             else if (aroundNum == 3)
181             {
182                 setNewCell(i, j, 1);
183             }
184             else
185             {
186                 setNewCell(i, j, 0);
187             }
188         }
189     }
190     swapMap();
191 }
192 
193 int CWorld::getCellAlive(int x, int y)     //获取细胞存活状态
194 {
195     if (locValid(x, y) == 0)
196     {
197         return -1;
198     }
199     SCell* cell = getCell(current_map, x, y);
200     return cell->Alive;
201 }
202 
203 
204 void CWorld::swapMap(void) //交换地图
205 { 
206     SCell* temp = current_map; 
207     current_map = new_map; 
208     new_map = temp; 
209 }    
210 
211 SCell* CWorld::getCell(SCell* buf, int x, int y) //从地图中获取某坐标的细胞指针
212 { 
213     return buf + y * WIDTH + x; 
214 }
215 
216 CWorld::CWorld(int Width, int Height)
217 {
218     width = Width;
219     height = Height;
220     current_map =(SCell *) new SCell[width * height];
221     new_map = (SCell *) new SCell[width * height];
222     killAll();
223 }
224 
225 
226 CWorld::~CWorld()
227 {
228     delete[] current_map;
229     delete[] new_map;
230 }

 1 //test.h
 2 
 3 #pragma once
 4 
 5 #include <cppunit/extensions/HelperMacros.h>
 6 
 7 class Test : public CPPUNIT_NS::TestFixture
 8 {
 9     CPPUNIT_TEST_SUITE(Test);
10     CPPUNIT_TEST(testSolution1);
11     CPPUNIT_TEST(testSolution2);
12     CPPUNIT_TEST(testSolution3);
13     CPPUNIT_TEST(testSolution4);
14     CPPUNIT_TEST(testSolution5);
15     CPPUNIT_TEST_SUITE_END();
16 
17 public:
18     void testSolution1();
19     void testSolution2();
20     void testSolution3();
21     void testSolution4();
22     void testSolution5();
23 };

 1 //main.cpp
 2 //
 3 
 4 #include "stdafx.h"
 5 #include <cppunit/BriefTestProgressListener.h>
 6 #include <cppunit/CompilerOutputter.h>
 7 #include <cppunit/extensions/TestFactoryRegistry.h>
 8 #include <cppunit/TestResult.h>
 9 #include <cppunit/TestResultCollector.h>
10 #include <cppunit/TestRunner.h>
11 
12 #pragma comment(lib, "cppunitd.lib")
13 
14 int _tmain(int argc, _TCHAR* argv[])
15 {
16     CPPUNIT_NS::TestResult controller;
17     CPPUNIT_NS::TestResultCollector result;
18     controller.addListener(&result);
19 
20     CPPUNIT_NS::BriefTestProgressListener progress;
21     controller.addListener(&progress);
22 
23     CPPUNIT_NS::TestRunner runner;
24     runner.addTest(CPPUNIT_NS::TestFactoryRegistry::getRegistry().makeTest());
25     runner.run(controller);
26 
27     CPPUNIT_NS::CompilerOutputter outputter(&result, CPPUNIT_NS::stdCOut());
28     outputter.write();
29 
30     getchar();
31 
32     return 0;
33 }

 1 //test1.cpp
 2 
 3 #include "stdafx.h"
 4 
 5 #include <cppunit/config/SourcePrefix.h>
 6 #include "Test.h"
 7 #include "solution.h"
 8 
 9 CPPUNIT_TEST_SUITE_REGISTRATION(Test);
10 
11 void Test::testSolution1()
12 {
13     Solution tf; //新建一个Fibonacci实例
14     CPPUNIT_ASSERT(tf.InitMap(40,20)==800);
15 }
16 void Test::testSolution2()
17 {
18     Solution tf; //新建一个Fibonacci实例
19     CPPUNIT_ASSERT(tf.InitMap(50,30)==1500);
20 }
21 void Test::testSolution3()
22 {
23     Solution tf; //新建一个Fibonacci实例
24     CPPUNIT_ASSERT(tf.InitMap(51,31)==1581);
25 }
26 void Test::testSolution4()
27 {
28     Solution tf; //新建一个Fibonacci实例
29     CPPUNIT_ASSERT(tf.InitMap(-1,-1)==1);
30 }
31 void Test::testSolution5()
32 {
33     Solution tf; //新建一个Fibonacci实例
34     CPPUNIT_ASSERT(tf.InitMap(0,0)==0);
35 }

 1 //test2.cpp
 2 
 3 #include "stdafx.h"
 4 
 5 #include <cppunit/config/SourcePrefix.h>
 6 #include "Test.h"
 7 #include "Solution.h"
 8 
 9 CPPUNIT_TEST_SUITE_REGISTRATION(Test);
10 
11 void Test::testSolution1()
12 {
13     Solution tf; //新建一个Fibonacci实例
14     int num=tf.getAroundCellNum(18,10);
15     CPPUNIT_ASSERT(num>=0&&num<=8);
16 }
17 void Test::testSolution2()
18 {
19     Solution tf; //新建一个Fibonacci实例
20     int num=tf.getAroundCellNum(39,19);
21     CPPUNIT_ASSERT(num>=0&&num<=3);
22 }
23 void Test::testSolution3()
24 {
25     Solution tf; //新建一个Fibonacci实例
26     int num=tf.getAroundCellNum(0,0);
27     CPPUNIT_ASSERT(num==-1);
28 }
29 void Test::testSolution4()
30 {
31     Solution tf; //新建一个Fibonacci实例
32     int num=tf.getAroundCellNum(-1,-1);
33     CPPUNIT_ASSERT(num==-1);
34 }
35 void Test::testSolution5()
36 {
37     Solution tf; //新建一个Fibonacci实例
38     int num=tf.getAroundCellNum(41,21);
39     CPPUNIT_ASSERT(num==-1);
40 }

 1 //test3.cpp
 2 
 3 #include "stdafx.h"
 4 #include <cppunit/config/SourcePrefix.h>
 5 #include "Test.h"
 6 #include "Solution.h"
 7 
 8 CPPUNIT_TEST_SUITE_REGISTRATION(Test);
 9 
10 void Test::testSolution1()
11 {
12     Solution tf; //新建一个Fibonacci实例
13     int num=tf.nextStep(8,9,3,0);
14     CPPUNIT_ASSERT(num==1);
15 }
16 void Test::testSolution2()
17 {
18     Solution tf; //新建一个Fibonacci实例
19     int num=tf.nextStep(39,19,2,0);
20     CPPUNIT_ASSERT(num==0);
21 }
22 void Test::testSolution3()
23 {
24     Solution tf; //新建一个Fibonacci实例
25     int num=tf.nextStep(-1,-1,4,1);
26     CPPUNIT_ASSERT(num==-1);
27 }
28 void Test::testSolution4()
29 {
30     Solution tf; //新建一个Fibonacci实例
31     int num=tf.nextStep(5,9,9,1);
32     CPPUNIT_ASSERT(num==-1);
33 }