Mercurial > fife-parpg

comparison tests/core_tests/test_rect.cpp @ 0:4a0efb7baf70

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
* Datasets becomes the new trunk and retires after that :-)
author mvbarracuda@33b003aa-7bff-0310-803a-e67f0ece8222
date Sun, 29 Jun 2008 18:44:17 +0000
parents
children
comparison
equal deleted inserted replaced
-1:000000000000 0:4a0efb7baf70
1 /***************************************************************************
2 * Copyright (C) 2005-2008 by the FIFE team *
3 * http://www.fifengine.de *
4 * This file is part of FIFE. *
5 * *
6 * FIFE is free software; you can redistribute it and/or modify *
7 * it under the terms of the GNU General Public License as published by *
8 * the Free Software Foundation; either version 2 of the License, or *
9 * (at your option) any later version. *
10 * *
11 * This program is distributed in the hope that it will be useful, *
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
14 * GNU General Public License for more details. *
15 * *
16 * You should have received a copy of the GNU General Public License *
17 * along with this program; if not, write to the *
18 * Free Software Foundation, Inc., *
19 * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA *
20 ***************************************************************************/
21
22 // Standard C++ library includes
23 #include <ctime>
24 #include <vector>
25
26 // Platform specific includes
27
28 // 3rd party library includes
29
30 // FIFE includes
31 // These includes are split up in two parts, separated by one empty line
32 // First block: files included from the FIFE root src directory
33 // Second block: files included from the same folder
34 #include "util/structures/rect.h"
35
36 #include "fife_unit_test.h"
37
38 using boost::unit_test::test_suite;
39 using namespace FIFE;
40
41 #ifdef FIFE_BOOST_VERSION_103300
42 void rectangle_intersection() {
43 #else
44 BOOST_AUTO_TEST_CASE( Rectangle_test ) {
45 #endif
46 Rect a(0,0,10,10);
47
48 std::vector<Rect> do_intersect;
49 #define ADD_RECT(x,y,w,h) do_intersect.push_back( Rect(x,y,w,h) )
50
51 ADD_RECT(5,5,10,10);
52 ADD_RECT(-5,5,10,10);
53 ADD_RECT(-5,-5,10,10);
54 ADD_RECT(5,-5,10,10);
55
56 ADD_RECT(-5,5,20,1);
57 ADD_RECT(-5,5,10,1);
58
59 ADD_RECT(5,-5,1,20);
60 ADD_RECT(5,-5,1,10);
61
62 ADD_RECT(5,5,3,3);
63
64 ADD_RECT(-5,-5,30,30);
65
66 for(size_t i=0; i<do_intersect.size(); ++i) {
67 BOOST_CHECK(a.intersects(do_intersect[i]));
68 BOOST_CHECK(do_intersect[i].intersects(a));
69 }
70
71 std::vector<Rect> dont_intersect;
72
73 #undef ADD_RECT
74 #define ADD_RECT(x,y,w,h) dont_intersect.push_back( Rect(x,y,w,h) )
75
76 ADD_RECT(-5,-5,4,4);
77 ADD_RECT(-5,-5,40,4);
78 ADD_RECT(-5,-5,4,40);
79 ADD_RECT(-5,-5,4,4);
80
81 ADD_RECT(15,15,4,4);
82 ADD_RECT(15,15,40,4);
83 ADD_RECT(15,15,4,40);
84
85 for(size_t i=0; i<dont_intersect.size(); ++i) {
86 BOOST_CHECK(!a.intersects(dont_intersect[i]));
87 BOOST_CHECK(!dont_intersect[i].intersects(a));
88 }
89
90 }
91
92 #ifdef FIFE_BOOST_VERSION_103300
93 test_suite* init_unit_test_suite(int argc, char** const argv) {
94 test_suite* test = BOOST_TEST_SUITE("Rectangle Tests");
95
96 test->add( BOOST_TEST_CASE( &rectangle_intersection ),0 );
97
98 return test;
99 }
100 #endif