/
tstQueryTreeDegenerate.cpp
405 lines (352 loc) · 16.3 KB
/
tstQueryTreeDegenerate.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
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
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
/****************************************************************************
* Copyright (c) 2017-2022 by the ArborX authors *
* All rights reserved. *
* *
* This file is part of the ArborX library. ArborX is *
* distributed under a BSD 3-clause license. For the licensing terms see *
* the LICENSE file in the top-level directory. *
* *
* SPDX-License-Identifier: BSD-3-Clause *
****************************************************************************/
#include <boost/test/unit_test.hpp>
#include <vector>
#include "Search_UnitTestHelpers.hpp"
// clang-format off
#include "ArborXTest_TreeTypeTraits.hpp"
// clang-format on
BOOST_AUTO_TEST_SUITE(Degenerate)
namespace tt = boost::test_tools;
BOOST_AUTO_TEST_CASE_TEMPLATE(empty_tree_spatial_predicate, TreeTypeTraits,
TreeTypeTraitsList)
{
using Tree = typename TreeTypeTraits::type;
using ExecutionSpace = typename TreeTypeTraits::execution_space;
using DeviceType = typename TreeTypeTraits::device_type;
// tree is empty, it has no leaves.
Tree default_initialized;
Tree value_initialized{};
for (auto const &tree : {
default_initialized, value_initialized,
make<Tree>(ExecutionSpace{},
{}), // constructed with empty view of boxes
})
{
BOOST_TEST(tree.empty());
BOOST_TEST(tree.size() == 0);
// Tree::bounds() returns an invalid box when the tree is empty.
using ArborX::Details::equals;
BOOST_TEST(equals(static_cast<ArborX::Box>(tree.bounds()), {}));
// Passing a view with no query does seem a bit silly but we still need
// to support it. And since the tag dispatching yields different tree
// traversals for nearest and spatial predicates, we do have to check
// the results for various type of queries.
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeIntersectsBoxQueries<DeviceType>({}),
make_reference_solution<int>({}, {0}));
// Now passing a couple queries of various type and checking the
// results.
ARBORX_TEST_QUERY_TREE(
ExecutionSpace{}, tree,
makeIntersectsBoxQueries<DeviceType>({
{}, // Did not bother giving a valid box here but that's fine.
{},
}),
make_reference_solution<int>({}, {0, 0, 0}));
#ifndef ARBORX_TEST_DISABLE_SPATIAL_QUERY_INTERSECTS_SPHERE
// NOTE: Admittedly testing for both intersection with a box and with a
// sphere queries might be a bit overkill but I'd rather test for all the
// queries we plan on using.
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeIntersectsSphereQueries<DeviceType>({}),
make_reference_solution<int>({}, {0}));
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeIntersectsSphereQueries<DeviceType>({
{{{0., 0., 0.}}, 1.},
{{{1., 1., 1.}}, 2.},
}),
make_reference_solution<int>({}, {0, 0, 0}));
#endif
}
}
#ifndef ARBORX_TEST_DISABLE_NEAREST_QUERY
BOOST_AUTO_TEST_CASE_TEMPLATE(empty_tree_nearest_predicate, TreeTypeTraits,
TreeTypeTraitsList)
{
using Tree = typename TreeTypeTraits::type;
using ExecutionSpace = typename TreeTypeTraits::execution_space;
using DeviceType = typename TreeTypeTraits::device_type;
// tree is empty, it has no leaves.
for (auto const &tree : {
Tree{}, // default constructed
make<Tree>(ExecutionSpace{},
{}), // constructed with empty view of boxes
})
{
BOOST_TEST(tree.empty());
BOOST_TEST(tree.size() == 0);
// Tree::bounds() returns an invalid box when the tree is empty.
using ArborX::Details::equals;
BOOST_TEST(equals(static_cast<ArborX::Box>(tree.bounds()), {}));
// Passing a view with no query does seem a bit silly but we still need
// to support it. And since the tag dispatching yields different tree
// traversals for nearest and spatial predicates, we do have to check
// the results for various type of queries.
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeNearestQueries<DeviceType>({}),
make_reference_solution<int>({}, {0}));
// Now passing a couple queries of various type and checking the
// results.
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeNearestQueries<DeviceType>({
{{{0., 0., 0.}}, 1},
{{{1., 1., 1.}}, 2},
}),
make_reference_solution<int>({}, {0, 0, 0}));
}
}
#endif
BOOST_AUTO_TEST_CASE_TEMPLATE(single_leaf_tree_spatial_predicate,
TreeTypeTraits, TreeTypeTraitsList)
{
using Tree = typename TreeTypeTraits::type;
using ExecutionSpace = typename TreeTypeTraits::execution_space;
using DeviceType = typename TreeTypeTraits::device_type;
// tree has a single leaf (unit box)
auto const tree =
make<Tree>(ExecutionSpace{}, {
{{{0., 0., 0.}}, {{1., 1., 1.}}},
});
BOOST_TEST(!tree.empty());
BOOST_TEST(tree.size() == 1);
using ArborX::Details::equals;
BOOST_TEST(equals(static_cast<ArborX::Box>(tree.bounds()),
{{{0., 0., 0.}}, {{1., 1., 1.}}}));
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeIntersectsBoxQueries<DeviceType>({}),
make_reference_solution<int>({}, {0}));
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeIntersectsBoxQueries<DeviceType>({
{{{5., 5., 5.}}, {{5., 5., 5.}}},
{{{.5, .5, .5}}, {{.5, .5, .5}}},
}),
make_reference_solution<int>({0}, {0, 0, 1}));
#ifndef ARBORX_TEST_DISABLE_SPATIAL_QUERY_INTERSECTS_SPHERE
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeIntersectsSphereQueries<DeviceType>({}),
make_reference_solution<int>({}, {0}));
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeIntersectsSphereQueries<DeviceType>({
{{{0., 0., 0.}}, 1.},
{{{1., 1., 1.}}, 3.},
{{{5., 5., 5.}}, 2.},
}),
make_reference_solution<int>({0, 0}, {0, 1, 2, 2}));
#endif
}
#ifndef ARBORX_TEST_DISABLE_NEAREST_QUERY
BOOST_AUTO_TEST_CASE_TEMPLATE(single_leaf_tree_nearest_predicate,
TreeTypeTraits, TreeTypeTraitsList)
{
using Tree = typename TreeTypeTraits::type;
using ExecutionSpace = typename TreeTypeTraits::execution_space;
using DeviceType = typename TreeTypeTraits::device_type;
// tree has a single leaf (unit box)
auto const tree =
make<Tree>(ExecutionSpace{}, {
{{{0., 0., 0.}}, {{1., 1., 1.}}},
});
BOOST_TEST(!tree.empty());
BOOST_TEST(tree.size() == 1);
using ArborX::Details::equals;
BOOST_TEST(equals(static_cast<ArborX::Box>(tree.bounds()),
{{{0., 0., 0.}}, {{1., 1., 1.}}}));
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeNearestQueries<DeviceType>({}),
make_reference_solution<int>({}, {0}));
ARBORX_TEST_QUERY_TREE(
ExecutionSpace{}, tree,
makeNearestQueries<DeviceType>({{{0., 0., 0.}, 3}, {{4., 5., 1.}, 1}}),
make_reference_solution<int>({0, 0}, {0, 1, 2}));
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeNearestQueries<DeviceType>({
{{{0., 0., 0.}}, 1},
{{{1., 1., 1.}}, 2},
{{{2., 2., 2.}}, 3},
}),
make_reference_solution<int>({0, 0, 0}, {0, 1, 2, 3}));
}
#endif
// FIXME Tree with two leaves is not "degenerated". Find a better place for it.
BOOST_AUTO_TEST_CASE_TEMPLATE(couple_leaves_tree_spatial_predicate,
TreeTypeTraits, TreeTypeTraitsList)
{
using Tree = typename TreeTypeTraits::type;
using ExecutionSpace = typename TreeTypeTraits::execution_space;
using DeviceType = typename TreeTypeTraits::device_type;
auto const tree =
make<Tree>(ExecutionSpace{}, {
{{{0., 0., 0.}}, {{0., 0., 0.}}},
{{{1., 1., 1.}}, {{1., 1., 1.}}},
});
BOOST_TEST(!tree.empty());
BOOST_TEST(tree.size() == 2);
using ArborX::Details::equals;
BOOST_TEST(equals(static_cast<ArborX::Box>(tree.bounds()),
{{{0., 0., 0.}}, {{1., 1., 1.}}}));
// single query intersects with nothing
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeIntersectsBoxQueries<DeviceType>({
{},
}),
make_reference_solution<int>({}, {0, 0}));
// single query intersects with both
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeIntersectsBoxQueries<DeviceType>({
{{{0., 0., 0.}}, {{1., 1., 1.}}},
}),
make_reference_solution<int>({1, 0}, {0, 2}));
// single query intersects with only one
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeIntersectsBoxQueries<DeviceType>({
{{{0.5, 0.5, 0.5}}, {{1.5, 1.5, 1.5}}},
}),
make_reference_solution<int>({1}, {0, 1}));
// a couple queries both intersect with nothing
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeIntersectsBoxQueries<DeviceType>({
{},
{},
}),
make_reference_solution<int>({}, {0, 0, 0}));
// a couple queries first intersects with nothing second with only one
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeIntersectsBoxQueries<DeviceType>({
{},
{{{0., 0., 0.}}, {{0., 0., 0.}}},
}),
make_reference_solution<int>({0}, {0, 0, 1}));
// no query
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeIntersectsBoxQueries<DeviceType>({}),
make_reference_solution<int>({}, {0}));
}
#ifndef ARBORX_TEST_DISABLE_NEAREST_QUERY
BOOST_AUTO_TEST_CASE_TEMPLATE(couple_leaves_tree_nearest_predicate,
TreeTypeTraits, TreeTypeTraitsList)
{
using Tree = typename TreeTypeTraits::type;
using ExecutionSpace = typename TreeTypeTraits::execution_space;
using DeviceType = typename TreeTypeTraits::device_type;
auto const tree =
make<Tree>(ExecutionSpace{}, {
{{{0., 0., 0.}}, {{0., 0., 0.}}},
{{{1., 1., 1.}}, {{1., 1., 1.}}},
});
BOOST_TEST(!tree.empty());
BOOST_TEST(tree.size() == 2);
using ArborX::Details::equals;
BOOST_TEST(equals(static_cast<ArborX::Box>(tree.bounds()),
{{{0., 0., 0.}}, {{1., 1., 1.}}}));
// no query
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeNearestQueries<DeviceType>({}),
make_reference_solution<int>({}, {0}));
ARBORX_TEST_QUERY_TREE(ExecutionSpace{}, tree,
makeNearestQueries<DeviceType>({
{{{0., 0., 0.}}, 2},
{{{1., 0., 0.}}, 4},
}),
make_reference_solution<int>({0, 1, 0, 1}, {0, 2, 4}));
}
#endif
#ifndef ARBORX_TEST_DISABLE_SPATIAL_QUERY_INTERSECTS_SPHERE
BOOST_AUTO_TEST_CASE_TEMPLATE(duplicated_leaves_spatial_predicate,
TreeTypeTraits, TreeTypeTraitsList)
{
using Tree = typename TreeTypeTraits::type;
using ExecutionSpace = typename TreeTypeTraits::execution_space;
using DeviceType = typename TreeTypeTraits::device_type;
// The tree contains multiple (more than two) leaves that will be assigned
// the same Morton code. This was able to trigger a bug that we discovered
// when building trees over ~10M indexable values. The hierarchy generated
// at construction had leaves with no parent which yielded a segfault later
// when computing bounding boxes and walking the hierarchy toward the root.
auto const tree =
make<Tree>(ExecutionSpace{}, {
{{{0., 0., 0.}}, {{0., 0., 0.}}},
{{{1., 1., 1.}}, {{1., 1., 1.}}},
{{{1., 1., 1.}}, {{1., 1., 1.}}},
{{{1., 1., 1.}}, {{1., 1., 1.}}},
});
ARBORX_TEST_QUERY_TREE(
ExecutionSpace{}, tree,
makeIntersectsSphereQueries<DeviceType>({
{{{0., 0., 0.}}, 1.},
{{{1., 1., 1.}}, 1.},
{{{.5, .5, .5}}, 1.},
}),
make_reference_solution<int>({0, 1, 2, 3, 0, 1, 2, 3}, {0, 1, 4, 8}));
}
#endif
BOOST_AUTO_TEST_SUITE_END()
BOOST_AUTO_TEST_SUITE(Miscellaneous)
BOOST_AUTO_TEST_CASE_TEMPLATE(not_exceeding_stack_capacity_spatial_predicate,
TreeTypeTraits, TreeTypeTraitsList)
{
// FIXME This unit test might make little sense for other trees than BVH
using Tree = typename TreeTypeTraits::type;
using ExecutionSpace = typename TreeTypeTraits::execution_space;
using DeviceType = typename TreeTypeTraits::device_type;
std::vector<ArborX::Box> boxes;
int const n = 4096; // exceeds stack capacity which is 64
boxes.reserve(n);
for (int i = 0; i < n; ++i)
{
double const a = i;
double const b = i + 1;
boxes.push_back({{{a, a, a}}, {{b, b, b}}});
}
ExecutionSpace space;
auto const bvh = make<Tree>(space, boxes);
Kokkos::View<int *, DeviceType> indices("indices", 0);
Kokkos::View<int *, DeviceType> offset("offset", 0);
// spatial query that is satisfied by all leaves in the tree
BOOST_CHECK_NO_THROW(ArborX::query(bvh, space,
makeIntersectsBoxQueries<DeviceType>({
{},
{{{0., 0., 0.}}, {{n, n, n}}},
}),
indices, offset));
BOOST_TEST(ArborX::Details::KokkosExt::lastElement(space, offset) == n);
}
#ifndef ARBORX_TEST_DISABLE_NEAREST_QUERY
BOOST_AUTO_TEST_CASE_TEMPLATE(not_exceeding_stack_capacity_nearest_predicate,
TreeTypeTraits, TreeTypeTraitsList)
{
// FIXME This unit test might make little sense for other trees than BVH
using Tree = typename TreeTypeTraits::type;
using ExecutionSpace = typename TreeTypeTraits::execution_space;
using DeviceType = typename TreeTypeTraits::device_type;
std::vector<ArborX::Box> boxes;
int const n = 4096; // exceed stack capacity which is 64
boxes.reserve(n);
for (int i = 0; i < n; ++i)
{
double const a = i;
double const b = i + 1;
boxes.push_back({{{a, a, a}}, {{b, b, b}}});
}
ExecutionSpace space;
auto const bvh = make<Tree>(space, boxes);
Kokkos::View<int *, DeviceType> indices("indices", 0);
Kokkos::View<int *, DeviceType> offset("offset", 0);
// nearest query asking for as many neighbors as they are leaves in the tree
BOOST_CHECK_NO_THROW(ArborX::query(bvh, space,
makeNearestQueries<DeviceType>({
{{{0., 0., 0.}}, n},
}),
indices, offset));
BOOST_TEST(ArborX::Details::KokkosExt::lastElement(space, offset) == n);
}
#endif
BOOST_AUTO_TEST_SUITE_END()