Skip to content

Commit

Permalink
WIP: Test query mutation
Browse files Browse the repository at this point in the history
  • Loading branch information
nmellado committed Oct 3, 2023
1 parent b76a843 commit 52aaf0e
Showing 1 changed file with 26 additions and 14 deletions.
40 changes: 26 additions & 14 deletions tests/src/queries_range.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -47,21 +47,33 @@ void testKdTreeRangeIndex(bool quick = true)


#pragma omp parallel for
for (int i = 0; i < N; ++i)
{
Scalar r = Eigen::internal::random<Scalar>(0., 0.5);
std::vector<int> resultsTree;
for (int i = 0; i < N; ++i) {

for (int j : kdtree->range_neighbors(i, r)) {
resultsTree.push_back(j);
}
if( SampleKdTree ) {
bool resTree = check_range_neighbors<Scalar, VectorContainer>(points, sampling, i, r, resultsTree);
VERIFY(resTree);
}
else {
bool resTree = check_range_neighbors<Scalar, VectorContainer>(points, sampling, i, r, resultsTree);
VERIFY(resTree);
// auto query = KdTreeRangeIndexQuery<KdTreeDefaultTraits<DataPoint>>(kdtree, 0, 0.);
auto query = kdtree->range_neighbors(0, 0);

for (int repeatRadius = 0; repeatRadius != 10; ++repeatRadius) {
std::vector<int> resultsTree, resultsMutable;
Scalar r = Eigen::internal::random<Scalar>(0.01, 0.5);

for (int j: kdtree->range_neighbors(i, r)) {
resultsTree.push_back(j);
}
// for (int j : kdtree->range_neighbors(i, r)) {
for (int j: query(i, r)) {
resultsMutable.push_back(j);
}
if (SampleKdTree) {
bool resTree = check_range_neighbors<Scalar, VectorContainer>(points, sampling, i, r, resultsTree);
bool resMutable = check_range_neighbors<Scalar, VectorContainer>(points, sampling, i, r, resultsMutable);
VERIFY(resTree);
VERIFY(resMutable);
} else {
bool resTree = check_range_neighbors<Scalar, VectorContainer>(points, sampling, i, r, resultsTree);
bool resMutable = check_range_neighbors<Scalar, VectorContainer>(points, sampling, i, r, resultsMutable);
VERIFY(resTree);
VERIFY(resMutable);
}
}
}

Expand Down

0 comments on commit 52aaf0e

Please sign in to comment.