rtflann::KDTreeSingleIndex< Distance > Member List

This is the complete list of members for rtflann::KDTreeSingleIndex< Distance >, including all inherited members.

addPoints(const Matrix< ElementType > &points, float rebuild_threshold=2)rtflann::KDTreeSingleIndex< Distance >inlinevirtual
BaseClass typedefrtflann::KDTreeSingleIndex< Distance >
BoundingBox typedefrtflann::KDTreeSingleIndex< Distance >private
Branch typedefrtflann::KDTreeSingleIndex< Distance >private
BranchSt typedefrtflann::KDTreeSingleIndex< Distance >private
buildIndex()rtflann::KDTreeSingleIndex< Distance >inline
buildIndex(const Matrix< ElementType > &dataset)rtflann::KDTreeSingleIndex< Distance >inline
rtflann::NNIndex::buildIndex(const Matrix< ElementType > &dataset)rtflann::NNIndex< Distance >inlinevirtual
buildIndexImpl()rtflann::KDTreeSingleIndex< Distance >inlineprotectedvirtual
cleanRemovedPoints()rtflann::NNIndex< Distance >inlineprotected
clone() constrtflann::KDTreeSingleIndex< Distance >inlinevirtual
computeBoundingBox(BoundingBox &bbox)rtflann::KDTreeSingleIndex< Distance >inlineprivate
computeInitialDistances(const ElementType *vec, std::vector< DistanceType > &dists) constrtflann::KDTreeSingleIndex< Distance >inlineprivate
computeMinMax(int *ind, int count, int dim, ElementType &min_elem, ElementType &max_elem)rtflann::KDTreeSingleIndex< Distance >inlineprivate
copyTree(NodePtr &dst, const NodePtr &src)rtflann::KDTreeSingleIndex< Distance >inlineprivate
data_rtflann::KDTreeSingleIndex< Distance >private
data_ptr_rtflann::NNIndex< Distance >protected
distance_rtflann::NNIndex< Distance >protected
DistanceType typedefrtflann::KDTreeSingleIndex< Distance >
divideTree(int left, int right, BoundingBox &bbox)rtflann::KDTreeSingleIndex< Distance >inlineprivate
ElementType typedefrtflann::KDTreeSingleIndex< Distance >
extendDataset(const Matrix< ElementType > &new_points)rtflann::NNIndex< Distance >inlineprotected
findNeighbors(ResultSet< DistanceType > &result, const ElementType *vec, const SearchParams &searchParams) constrtflann::KDTreeSingleIndex< Distance >inlinevirtual
freeIndex()rtflann::KDTreeSingleIndex< Distance >inlineprivatevirtual
getParameters() constrtflann::NNIndex< Distance >inlinevirtual
getPoint(size_t id)rtflann::NNIndex< Distance >inlinevirtual
getType() constrtflann::KDTreeSingleIndex< Distance >inlinevirtual
id_to_index(size_t id)rtflann::NNIndex< Distance >inlineprotected
ids_rtflann::NNIndex< Distance >protected
index_params_rtflann::NNIndex< Distance >protected
indices_to_ids(const size_t *in, size_t *out, size_t size) constrtflann::NNIndex< Distance >inlineprotected
KDTreeSingleIndex(const IndexParams &params=KDTreeSingleIndexParams(), Distance d=Distance())rtflann::KDTreeSingleIndex< Distance >inline
KDTreeSingleIndex(const Matrix< ElementType > &inputData, const IndexParams &params=KDTreeSingleIndexParams(), Distance d=Distance())rtflann::KDTreeSingleIndex< Distance >inline
KDTreeSingleIndex(const KDTreeSingleIndex &other)rtflann::KDTreeSingleIndex< Distance >inline
knnSearch(const Matrix< ElementType > &queries, Matrix< size_t > &indices, Matrix< DistanceType > &dists, size_t knn, const SearchParams &params) constrtflann::NNIndex< Distance >inlinevirtual
knnSearch(const Matrix< ElementType > &queries, std::vector< std::vector< size_t > > &indices, std::vector< std::vector< DistanceType > > &dists, size_t knn, const SearchParams &params) constrtflann::NNIndex< Distance >inlinevirtual
knnSearch(const Matrix< ElementType > &queries, std::vector< std::vector< int > > &indices, std::vector< std::vector< DistanceType > > &dists, size_t knn, const SearchParams &params) constrtflann::NNIndex< Distance >inline
last_id_rtflann::NNIndex< Distance >protected
leaf_max_size_rtflann::KDTreeSingleIndex< Distance >private
loadIndex(FILE *stream)rtflann::KDTreeSingleIndex< Distance >inlinevirtual
middleSplit(int *ind, int count, int &index, int &cutfeat, DistanceType &cutval, const BoundingBox &bbox)rtflann::KDTreeSingleIndex< Distance >inlineprivate
middleSplit_(int *ind, int count, int &index, int &cutfeat, DistanceType &cutval, const BoundingBox &bbox)rtflann::KDTreeSingleIndex< Distance >inlineprivate
needs_kdtree_distance typedefrtflann::KDTreeSingleIndex< Distance >
NNIndex(Distance d)rtflann::NNIndex< Distance >inline
NNIndex(const IndexParams &params, Distance d)rtflann::NNIndex< Distance >inline
NNIndex(const NNIndex &other)rtflann::NNIndex< Distance >inline
NodePtr typedefrtflann::KDTreeSingleIndex< Distance >private
operator=(KDTreeSingleIndex other)rtflann::KDTreeSingleIndex< Distance >inline
planeSplit(int *ind, int count, int cutfeat, DistanceType cutval, int &lim1, int &lim2)rtflann::KDTreeSingleIndex< Distance >inlineprivate
points_rtflann::NNIndex< Distance >protected
pool_rtflann::KDTreeSingleIndex< Distance >private
radiusSearch(const Matrix< ElementType > &queries, Matrix< size_t > &indices, Matrix< DistanceType > &dists, float radius, const SearchParams &params) constrtflann::NNIndex< Distance >inlinevirtual
radiusSearch(const Matrix< ElementType > &queries, Matrix< int > &indices, Matrix< DistanceType > &dists, float radius, const SearchParams &params) constrtflann::NNIndex< Distance >inline
radiusSearch(const Matrix< ElementType > &queries, std::vector< std::vector< size_t > > &indices, std::vector< std::vector< DistanceType > > &dists, float radius, const SearchParams &params) constrtflann::NNIndex< Distance >inlinevirtual
radiusSearch(const Matrix< ElementType > &queries, std::vector< std::vector< int > > &indices, std::vector< std::vector< DistanceType > > &dists, float radius, const SearchParams &params) constrtflann::NNIndex< Distance >inline
removed_rtflann::NNIndex< Distance >protected
removed_count_rtflann::NNIndex< Distance >protected
removed_points_rtflann::NNIndex< Distance >protected
removedCount() constrtflann::NNIndex< Distance >inline
removePoint(size_t id)rtflann::NNIndex< Distance >inlinevirtual
reorder_rtflann::KDTreeSingleIndex< Distance >private
root_bbox_rtflann::KDTreeSingleIndex< Distance >private
root_node_rtflann::KDTreeSingleIndex< Distance >private
saveIndex(FILE *stream)rtflann::KDTreeSingleIndex< Distance >inlinevirtual
searchLevel(ResultSet< DistanceType > &result_set, const ElementType *vec, const NodePtr node, DistanceType mindistsq, std::vector< DistanceType > &dists, const float epsError) constrtflann::KDTreeSingleIndex< Distance >inlineprivate
serialize(Archive &ar)rtflann::KDTreeSingleIndex< Distance >inline
setDataset(const Matrix< ElementType > &dataset)rtflann::NNIndex< Distance >inlineprotected
size() constrtflann::NNIndex< Distance >inlinevirtual
size_rtflann::NNIndex< Distance >protected
size_at_build_rtflann::NNIndex< Distance >protected
sizeAtBuild() constrtflann::NNIndex< Distance >inline
swap(KDTreeSingleIndex &other)rtflann::KDTreeSingleIndex< Distance >inlineprivate
rtflann::NNIndex::swap(NNIndex &other)rtflann::NNIndex< Distance >inlineprotected
usedMemory() constrtflann::KDTreeSingleIndex< Distance >inlinevirtual
veclen() constrtflann::NNIndex< Distance >inlinevirtual
veclen_rtflann::NNIndex< Distance >protected
vind_rtflann::KDTreeSingleIndex< Distance >private
~IndexBase()rtflann::IndexBaseinlinevirtual
~KDTreeSingleIndex()rtflann::KDTreeSingleIndex< Distance >inlinevirtual
~NNIndex()rtflann::NNIndex< Distance >inlinevirtual


rtabmap
Author(s): Mathieu Labbe
autogenerated on Thu Jul 25 2024 02:50:29