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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
|
/*****************************************************************************
*
* MODULE: Grass PDE Numerical Library
* AUTHOR(S): Soeren Gebbert, Berlin (GER) Dec 2006
* soerengebbert <at> gmx <dot> de
*
* PURPOSE: Unit tests for les solving
*
* COPYRIGHT: (C) 2000 by the GRASS Development Team
*
* This program is free software under the GNU General Public
* License (>=v2). Read the file COPYING that comes with GRASS
* for details.
*
*****************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <grass/glocale.h>
#include <grass/gis.h>
#include <grass/rtree.h>
#include <grass/vector.h>
#include "test_rtree_lib.h"
/* prototypes */
static int test_basics_1d(void);
static int test_basics_2d(void);
static int test_basics_3d(void);
static int test_basics_4d(void);
/* ************************************************************************* */
/* Perform the solver unit tests ****************************************** */
/* ************************************************************************* */
int unit_test_basics(void)
{
int sum = 0;
G_message(_("\n++ Running basic unit tests ++"));
sum += test_basics_1d();
sum += test_basics_2d();
sum += test_basics_3d();
sum += test_basics_4d();
if (sum > 0)
G_warning(_("\n-- Basic rtree unit tests failure --"));
else
G_message(_("\n-- Basic rtree unit tests finished successfully --"));
return sum;
}
/* *************************************************************** */
/* *************************************************************** */
/* *************************************************************** */
int test_basics_1d(void)
{
int sum = 0, num, i;
struct RTree *tree = RTreeCreateTree(-1, 0, 1);
struct ilist *list = G_new_ilist();
for (i = 0; i < 10; i++) {
struct RTree_Rect *rect1 = RTreeAllocRect(tree);
RTreeSetRect1D(rect1, tree, (i - 2), (i + 2));
RTreeInsertRect(rect1, i + 1, tree);
struct RTree_Rect *rect2 = RTreeAllocRect(tree);
RTreeSetRect1D(rect2, tree, 2.0, 7.0);
num = RTreeSearch2(tree, rect2, list);
printf("Found %i neighbors\n", num);
if (num != i + 1)
sum++;
RTreeFreeRect(rect1);
RTreeFreeRect(rect2);
}
RTreeDestroyTree(tree);
G_free_ilist(list);
return sum;
}
/* *************************************************************** */
/* *************************************************************** */
/* *************************************************************** */
int test_basics_2d(void)
{
int sum = 0, num, i;
struct RTree *tree = RTreeCreateTree(-1, 0, 2);
struct ilist *list = G_new_ilist();
for (i = 0; i < 10; i++) {
struct RTree_Rect *rect1 = RTreeAllocRect(tree);
RTreeSetRect2D(rect1, tree, (i - 2), (i + 2), (i - 2), (i + 2));
RTreeInsertRect(rect1, i + 1, tree);
struct RTree_Rect *rect2 = RTreeAllocRect(tree);
RTreeSetRect2D(rect2, tree, 2.0, 7.0, 2.0, 7.0);
num = RTreeSearch2(tree, rect2, list);
printf("Found %i neighbors\n", num);
if (num != i + 1)
sum++;
RTreeFreeRect(rect1);
RTreeFreeRect(rect2);
}
RTreeDestroyTree(tree);
G_free_ilist(list);
return sum;
}
/* *************************************************************** */
/* *************************************************************** */
/* *************************************************************** */
int test_basics_3d(void)
{
int sum = 0, num, i;
struct RTree *tree = RTreeCreateTree(-1, 0, 3);
struct ilist *list = G_new_ilist();
for (i = 0; i < 10; i++) {
struct RTree_Rect *rect1 = RTreeAllocRect(tree);
RTreeSetRect3D(rect1, tree, (i - 2), (i + 2), (i - 2), (i + 2), (i - 2),
(i + 2));
RTreeInsertRect(rect1, i + 1, tree);
struct RTree_Rect *rect2 = RTreeAllocRect(tree);
RTreeSetRect3D(rect2, tree, 2.0, 7.0, 2.0, 7.0, 2.0, 7.0);
num = RTreeSearch2(tree, rect2, list);
printf("Found %i neighbors\n", num);
if (num != i + 1)
sum++;
RTreeFreeRect(rect1);
RTreeFreeRect(rect2);
}
RTreeDestroyTree(tree);
G_free_ilist(list);
return sum;
}
/* *************************************************************** */
/* *************************************************************** */
/* *************************************************************** */
int test_basics_4d(void)
{
int sum = 0, num, i;
struct RTree *tree = RTreeCreateTree(-1, 0, 4);
struct ilist *list = G_new_ilist();
for (i = 0; i < 10; i++) {
struct RTree_Rect *rect1 = RTreeAllocRect(tree);
RTreeSetRect4D(rect1, tree, (i - 2), (i + 2), (i - 2), (i + 2), (i - 2),
(i + 2), (i - 2), (i + 2));
RTreeInsertRect(rect1, i + 1, tree);
struct RTree_Rect *rect2 = RTreeAllocRect(tree);
RTreeSetRect4D(rect2, tree, 2.0, 7.0, 2.0, 7.0, 2.0, 7.0, 2.0, 7.0);
num = RTreeSearch2(tree, rect2, list);
printf("Found %i neighbors\n", num);
if (num != i + 1)
sum++;
RTreeFreeRect(rect1);
RTreeFreeRect(rect2);
}
RTreeDestroyTree(tree);
G_free_ilist(list);
return sum;
}
|
