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 typedef | rtflann::KDTreeSingleIndex< Distance > | |
BoundingBox typedef | rtflann::KDTreeSingleIndex< Distance > | private |
Branch typedef | rtflann::KDTreeSingleIndex< Distance > | private |
BranchSt typedef | rtflann::KDTreeSingleIndex< Distance > | private |
buildIndex() | rtflann::NNIndex< Distance > | inlinevirtual |
buildIndex(const Matrix< ElementType > &dataset) | rtflann::NNIndex< Distance > | inlinevirtual |
buildIndexImpl() | rtflann::KDTreeSingleIndex< Distance > | inlineprotectedvirtual |
cleanRemovedPoints() | rtflann::NNIndex< Distance > | inlineprotected |
clone() const | rtflann::KDTreeSingleIndex< Distance > | inlinevirtual |
computeBoundingBox(BoundingBox &bbox) | rtflann::KDTreeSingleIndex< Distance > | inlineprivate |
computeInitialDistances(const ElementType *vec, std::vector< DistanceType > &dists) const | rtflann::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 typedef | rtflann::KDTreeSingleIndex< Distance > | |
divideTree(int left, int right, BoundingBox &bbox) | rtflann::KDTreeSingleIndex< Distance > | inlineprivate |
ElementType typedef | rtflann::KDTreeSingleIndex< Distance > | |
extendDataset(const Matrix< ElementType > &new_points) | rtflann::NNIndex< Distance > | inlineprotected |
findNeighbors(ResultSet< DistanceType > &result, const ElementType *vec, const SearchParams &searchParams) const | rtflann::KDTreeSingleIndex< Distance > | inlinevirtual |
freeIndex() | rtflann::KDTreeSingleIndex< Distance > | inlineprivatevirtual |
getParameters() const | rtflann::NNIndex< Distance > | inlinevirtual |
getPoint(size_t id) | rtflann::NNIndex< Distance > | inlinevirtual |
getType() const | rtflann::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) const | rtflann::NNIndex< Distance > | inlineprotected |
KDTreeSingleIndex(const IndexParams ¶ms=KDTreeSingleIndexParams(), Distance d=Distance()) | rtflann::KDTreeSingleIndex< Distance > | inline |
KDTreeSingleIndex(const Matrix< ElementType > &inputData, const IndexParams ¶ms=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 ¶ms) const | rtflann::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 ¶ms) const | rtflann::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 ¶ms) const | rtflann::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 typedef | rtflann::KDTreeSingleIndex< Distance > | |
NNIndex(Distance d) | rtflann::NNIndex< Distance > | inline |
NNIndex(const IndexParams ¶ms, Distance d) | rtflann::NNIndex< Distance > | inline |
NNIndex(const NNIndex &other) | rtflann::NNIndex< Distance > | inline |
NodePtr typedef | rtflann::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 ¶ms) const | rtflann::NNIndex< Distance > | inlinevirtual |
radiusSearch(const Matrix< ElementType > &queries, Matrix< int > &indices, Matrix< DistanceType > &dists, float radius, const SearchParams ¶ms) 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 ¶ms) const | rtflann::NNIndex< Distance > | inlinevirtual |
radiusSearch(const Matrix< ElementType > &queries, std::vector< std::vector< int > > &indices, std::vector< std::vector< DistanceType > > &dists, float radius, const SearchParams ¶ms) 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 > | 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) const | rtflann::KDTreeSingleIndex< Distance > | inlineprivate |
serialize(Archive &ar) | rtflann::KDTreeSingleIndex< Distance > | inline |
setDataset(const Matrix< ElementType > &dataset) | rtflann::NNIndex< Distance > | inlineprotected |
size() const | rtflann::NNIndex< Distance > | inlinevirtual |
size_ | rtflann::NNIndex< Distance > | protected |
size_at_build_ | rtflann::NNIndex< Distance > | protected |
sizeAtBuild() const | rtflann::NNIndex< Distance > | inline |
swap(KDTreeSingleIndex &other) | rtflann::KDTreeSingleIndex< Distance > | inlineprivate |
rtflann::NNIndex::swap(NNIndex &other) | rtflann::NNIndex< Distance > | inlineprotected |
usedMemory() const | rtflann::KDTreeSingleIndex< Distance > | inlinevirtual |
veclen() const | rtflann::NNIndex< Distance > | inlinevirtual |
veclen_ | rtflann::NNIndex< Distance > | protected |
vind_ | rtflann::KDTreeSingleIndex< Distance > | private |
~IndexBase() | rtflann::IndexBase | inlinevirtual |
~KDTreeSingleIndex() | rtflann::KDTreeSingleIndex< Distance > | inlinevirtual |
~NNIndex() | rtflann::NNIndex< Distance > | inlinevirtual |