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 > [inline, virtual]
BaseClass typedefrtflann::KDTreeSingleIndex< Distance >
BoundingBox typedefrtflann::KDTreeSingleIndex< Distance > [private]
Branch typedefrtflann::KDTreeSingleIndex< Distance > [private]
BranchSt typedefrtflann::KDTreeSingleIndex< Distance > [private]
buildIndex()rtflann::NNIndex< Distance > [inline, virtual]
buildIndex(const Matrix< ElementType > &dataset)rtflann::NNIndex< Distance > [inline, virtual]
buildIndexImpl()rtflann::KDTreeSingleIndex< Distance > [inline, protected, virtual]
cleanRemovedPoints()rtflann::NNIndex< Distance > [inline, protected]
clone() const rtflann::KDTreeSingleIndex< Distance > [inline, virtual]
computeBoundingBox(BoundingBox &bbox)rtflann::KDTreeSingleIndex< Distance > [inline, private]
computeInitialDistances(const ElementType *vec, std::vector< DistanceType > &dists) const rtflann::KDTreeSingleIndex< Distance > [inline, private]
computeMinMax(int *ind, int count, int dim, ElementType &min_elem, ElementType &max_elem)rtflann::KDTreeSingleIndex< Distance > [inline, private]
copyTree(NodePtr &dst, const NodePtr &src)rtflann::KDTreeSingleIndex< Distance > [inline, private]
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 > [inline, private]
ElementType typedefrtflann::KDTreeSingleIndex< Distance >
extendDataset(const Matrix< ElementType > &new_points)rtflann::NNIndex< Distance > [inline, protected]
findNeighbors(ResultSet< DistanceType > &result, const ElementType *vec, const SearchParams &searchParams) const rtflann::KDTreeSingleIndex< Distance > [inline, virtual]
freeIndex()rtflann::KDTreeSingleIndex< Distance > [inline, private, virtual]
getParameters() const rtflann::NNIndex< Distance > [inline, virtual]
getPoint(size_t id)rtflann::NNIndex< Distance > [inline, virtual]
getType() const rtflann::KDTreeSingleIndex< Distance > [inline, virtual]
id_to_index(size_t id)rtflann::NNIndex< Distance > [inline, protected]
ids_rtflann::NNIndex< Distance > [protected]
index_params_rtflann::NNIndex< Distance > [protected]
indices_to_ids(const size_t *in, size_t *out, size_t size) const rtflann::NNIndex< Distance > [inline, protected]
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) const rtflann::NNIndex< Distance > [inline, virtual]
knnSearch(const Matrix< ElementType > &queries, Matrix< int > &indices, Matrix< DistanceType > &dists, size_t knn, const SearchParams &params) const rtflann::NNIndex< Distance > [inline]
knnSearch(const Matrix< ElementType > &queries, std::vector< std::vector< size_t > > &indices, std::vector< std::vector< DistanceType > > &dists, size_t knn, const SearchParams &params) const rtflann::NNIndex< Distance > [inline]
knnSearch(const Matrix< ElementType > &queries, std::vector< std::vector< int > > &indices, std::vector< std::vector< DistanceType > > &dists, size_t knn, const SearchParams &params) const rtflann::NNIndex< Distance > [inline]
last_id_rtflann::NNIndex< Distance > [protected]
leaf_max_size_rtflann::KDTreeSingleIndex< Distance > [private]
loadIndex(FILE *stream)rtflann::KDTreeSingleIndex< Distance > [inline, virtual]
middleSplit(int *ind, int count, int &index, int &cutfeat, DistanceType &cutval, const BoundingBox &bbox)rtflann::KDTreeSingleIndex< Distance > [inline, private]
middleSplit_(int *ind, int count, int &index, int &cutfeat, DistanceType &cutval, const BoundingBox &bbox)rtflann::KDTreeSingleIndex< Distance > [inline, private]
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 > [inline, private]
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) const rtflann::NNIndex< Distance > [inline]
radiusSearch(const Matrix< ElementType > &queries, Matrix< int > &indices, Matrix< DistanceType > &dists, float radius, const SearchParams &params) const rtflann::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) const rtflann::NNIndex< Distance > [inline]
radiusSearch(const Matrix< ElementType > &queries, std::vector< std::vector< int > > &indices, std::vector< std::vector< DistanceType > > &dists, float radius, const SearchParams &params) const rtflann::NNIndex< Distance > [inline]
removed_rtflann::NNIndex< Distance > [protected]
removed_count_rtflann::NNIndex< Distance > [protected]
removed_points_rtflann::NNIndex< Distance > [protected]
removedCount() const rtflann::NNIndex< Distance > [inline]
removePoint(size_t id)rtflann::NNIndex< Distance > [inline, virtual]
reorder_rtflann::KDTreeSingleIndex< Distance > [private]
root_bbox_rtflann::KDTreeSingleIndex< Distance > [private]
root_node_rtflann::KDTreeSingleIndex< Distance > [private]
saveIndex(FILE *stream)rtflann::KDTreeSingleIndex< Distance > [inline, virtual]
searchLevel(ResultSet< DistanceType > &result_set, const ElementType *vec, const NodePtr node, DistanceType mindistsq, std::vector< DistanceType > &dists, const float epsError) const rtflann::KDTreeSingleIndex< Distance > [inline, private]
serialize(Archive &ar)rtflann::KDTreeSingleIndex< Distance > [inline]
setDataset(const Matrix< ElementType > &dataset)rtflann::NNIndex< Distance > [inline, protected]
size() const rtflann::NNIndex< Distance > [inline, virtual]
size_rtflann::NNIndex< Distance > [protected]
size_at_build_rtflann::NNIndex< Distance > [protected]
sizeAtBuild() const rtflann::NNIndex< Distance > [inline]
swap(KDTreeSingleIndex &other)rtflann::KDTreeSingleIndex< Distance > [inline, private]
rtflann::NNIndex::swap(NNIndex &other)rtflann::NNIndex< Distance > [inline, protected]
usedMemory() const rtflann::KDTreeSingleIndex< Distance > [inline, virtual]
veclen() const rtflann::NNIndex< Distance > [inline, virtual]
veclen_rtflann::NNIndex< Distance > [protected]
vind_rtflann::KDTreeSingleIndex< Distance > [private]
~IndexBase()rtflann::IndexBase [inline, virtual]
~KDTreeSingleIndex()rtflann::KDTreeSingleIndex< Distance > [inline, virtual]
~NNIndex()rtflann::NNIndex< Distance > [inline, virtual]

rtabmap
Author(s): Mathieu Labbe
autogenerated on Sat Jul 23 2016 11:44:32