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
|
/* This file is part of the Spring engine (GPL v2 or later), see LICENSE.html */
#include "System/Misc/RectangleOptimizer.h"
#include "System/Log/ILog.h"
#include <vector>
#include <stdlib.h>
#include <time.h>
#define BOOST_TEST_MODULE RectangleOptimizer
#include <boost/test/unit_test.hpp>
static inline float randf()
{
return rand() / float(RAND_MAX);
}
static const int testRuns = 1000;
static const int size = 100;
static const int count_rects = 15;
int Test(std::vector<int>& testMap, CRectangleOptimizer& ro)
{
//! clear testMap
testMap.resize(size * size, 0);
//! create random rectangles
ro.clear();
for (int i=0; i<count_rects; ++i) {
SRectangle r(0,0,0,0);
r.x1 = randf() * (size-1);
r.z1 = randf() * (size-1);
r.x2 = randf() * (size-1);
r.z2 = randf() * (size-1);
if (r.x1 > r.x2) std::swap(r.x1, r.x2);
if (r.z1 > r.z2) std::swap(r.z1, r.z2);
ro.push_back(r);
}
//! fill testMap with original areas
for (CRectangleOptimizer::iterator it = ro.begin(); it != ro.end(); ++it) {
const SRectangle& rect = *it;
for (int z=rect.z1; z<rect.z2; ++z) { //FIXME <=
for (int x=rect.x1; x<rect.x2; ++x) { //FIXME <=
testMap[z * size + x] = 1;
}
}
}
//! optimize
ro.Optimize();
//! fill testMap with optimized
for (CRectangleOptimizer::iterator it = ro.begin(); it != ro.end(); ++it) {
const SRectangle& rect = *it;
for (int z=rect.z1; z<rect.z2; ++z) { //FIXME <=
for (int x=rect.x1; x<rect.x2; ++x) { //FIXME <=
testMap[z * size + x] -= 1;
}
}
}
//! check if we have overlapping or missing areas
int sum = 0;
for (int y=0; y<size; ++y) {
for (int x=0; x<size; ++x) {
sum += testMap[y * size + x];
}
}
//! sum should be zero
//! in case of <0: the optimized rectangles still overlap
//! in case of >0: the optimized rectangles don't cover the same area as the unoptimized did
return sum;
}
static inline bool TestArea(std::vector<int>& testMap, CRectangleOptimizer& ro)
{
for (int i=0; i<testRuns; ++i) {
if (Test(testMap, ro) > 0)
return false;
}
return true;
}
static inline bool TestOverlapping(std::vector<int>& testMap, CRectangleOptimizer& ro)
{
for (int i=0; i<testRuns; ++i) {
if (Test(testMap, ro) < 0)
return false;
}
return true;
}
BOOST_AUTO_TEST_CASE( RectangleOptimizer )
{
srand( time(NULL) );
std::vector<int> testMap(size * size, 0);
CRectangleOptimizer ro;
BOOST_CHECK_MESSAGE(TestArea(testMap, ro),
"Optimized rectangles don't cover the same area!");
BOOST_CHECK_MESSAGE(TestOverlapping(testMap, ro),
"Optimized rectangles still overlap!");
}
|
