i/rtabmap
1
0
Fork 0
mirror of https://github.com/introlab/rtabmap.git synced 2026-09-02 17:40:23 +08:00
Code Issues Packages Projects Releases Wiki Activity

ios first release

Browse Source
This commit is contained in:
matlabbe
2021-06-08 00:06:49 -04:00
parent 630cb6a59f
commit 289d4afd76
88 changed files with 9260 additions and 473 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
corelib/src/rtflann/algorithms/kdtree_index.h
View File

@@ -362,7 +362,7 @@ public:
size_t knn,
const SearchParams& params) const
{
assert(queries.cols == veclen());
assert(queries.cols == veclen_);
assert(indices.rows >= queries.rows);
assert(dists.rows >= queries.rows);
assert(indices.cols >= knn);
@@ -430,7 +430,7 @@ public:
size_t knn,
const SearchParams& params) const
{
assert(queries.cols == veclen());
assert(queries.cols == veclen_);
bool use_heap;
if (params.use_heap==FLANN_Undefined) {
use_heap = (knn>KNN_HEAP_THRESHOLD)?true:false;
@@ -503,7 +503,7 @@ public:
float radius,
const SearchParams& params) const
{
assert(queries.cols == veclen());
assert(queries.cols == veclen);
int count = 0;
size_t num_neighbors = std::min(indices.cols, dists.cols);
int max_neighbors = params.max_neighbors;
@@ -588,7 +588,7 @@ public:
float radius,
const SearchParams& params) const
{
assert(queries.cols == veclen());
assert(queries.cols == veclen_);
int count = 0;
Heap<BranchSt>* heap = new Heap<BranchSt>((int)size_);