This is the complete list of members for rtflann::KDTreeIndex< Distance >, including all inherited members.
| addPoints(const Matrix< ElementType > &points, float rebuild_threshold=2) | rtflann::KDTreeIndex< Distance > | inlinevirtual |
| addPointToTree(NodePtr node, int ind) | rtflann::KDTreeIndex< Distance > | inlineprivate |
| BaseClass typedef | rtflann::KDTreeIndex< Distance > | |
| Branch typedef | rtflann::KDTreeIndex< Distance > | private |
| BranchSt typedef | rtflann::KDTreeIndex< Distance > | private |
| buildIndex() | rtflann::NNIndex< Distance > | inlinevirtual |
| buildIndex(const Matrix< ElementType > &dataset) | rtflann::NNIndex< Distance > | inlinevirtual |
| buildIndexImpl() | rtflann::KDTreeIndex< Distance > | inlineprotectedvirtual |
| cleanRemovedPoints() | rtflann::NNIndex< Distance > | inlineprotected |
| clone() const | rtflann::KDTreeIndex< Distance > | inlinevirtual |
| copyTree(NodePtr &dst, const NodePtr &src) | rtflann::KDTreeIndex< Distance > | inlineprivate |
| data_ptr_ | rtflann::NNIndex< Distance > | protected |
| distance_ | rtflann::NNIndex< Distance > | protected |
| DistanceType typedef | rtflann::KDTreeIndex< Distance > | |
| divideTree(int *ind, int count) | rtflann::KDTreeIndex< Distance > | inlineprivate |
| ElementType typedef | rtflann::KDTreeIndex< Distance > | |
| extendDataset(const Matrix< ElementType > &new_points) | rtflann::NNIndex< Distance > | inlineprotected |
| findNeighbors(ResultSet< DistanceType > &result, const ElementType *vec, const SearchParams &searchParams) const | rtflann::KDTreeIndex< Distance > | inlinevirtual |
| freeIndex() | rtflann::KDTreeIndex< Distance > | inlineprotectedvirtual |
| getExactNeighbors(ResultSet< DistanceType > &result, const ElementType *vec, float epsError) const | rtflann::KDTreeIndex< Distance > | inlineprivate |
| getNeighbors(ResultSet< DistanceType > &result, const ElementType *vec, int maxCheck, float epsError) const | rtflann::KDTreeIndex< Distance > | inlineprivate |
| getParameters() const | rtflann::NNIndex< Distance > | inlinevirtual |
| getPoint(size_t id) | rtflann::NNIndex< Distance > | inlinevirtual |
| getType() const | rtflann::KDTreeIndex< 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 |
| KDTreeIndex(const IndexParams ¶ms=KDTreeIndexParams(), Distance d=Distance()) | rtflann::KDTreeIndex< Distance > | inline |
| KDTreeIndex(const Matrix< ElementType > &dataset, const IndexParams ¶ms=KDTreeIndexParams(), Distance d=Distance()) | rtflann::KDTreeIndex< Distance > | inline |
| KDTreeIndex(const KDTreeIndex &other) | rtflann::KDTreeIndex< 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 |
| loadIndex(FILE *stream) | rtflann::KDTreeIndex< Distance > | inlinevirtual |
| mean_ | rtflann::KDTreeIndex< Distance > | private |
| meanSplit(int *ind, int count, int &index, int &cutfeat, DistanceType &cutval) | rtflann::KDTreeIndex< Distance > | inlineprivate |
| needs_kdtree_distance typedef | rtflann::KDTreeIndex< 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::KDTreeIndex< Distance > | private |
| operator=(KDTreeIndex other) | rtflann::KDTreeIndex< Distance > | inline |
| planeSplit(int *ind, int count, int cutfeat, DistanceType cutval, int &lim1, int &lim2) | rtflann::KDTreeIndex< Distance > | inlineprivate |
| points_ | rtflann::NNIndex< Distance > | protected |
| pool_ | rtflann::KDTreeIndex< 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 |
| RAND_DIM enum value | rtflann::KDTreeIndex< Distance > | private |
| 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 |
| SAMPLE_MEAN enum value | rtflann::KDTreeIndex< Distance > | private |
| saveIndex(FILE *stream) | rtflann::KDTreeIndex< Distance > | inlinevirtual |
| searchLevel(ResultSet< DistanceType > &result_set, const ElementType *vec, NodePtr node, DistanceType mindist, int &checkCount, int maxCheck, float epsError, Heap< BranchSt > *heap, DynamicBitset &checked) const | rtflann::KDTreeIndex< Distance > | inlineprivate |
| searchLevelExact(ResultSet< DistanceType > &result_set, const ElementType *vec, const NodePtr node, DistanceType mindist, const float epsError) const | rtflann::KDTreeIndex< Distance > | inlineprivate |
| selectDivision(DistanceType *v) | rtflann::KDTreeIndex< Distance > | inlineprivate |
| serialize(Archive &ar) | rtflann::KDTreeIndex< 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(KDTreeIndex &other) | rtflann::KDTreeIndex< Distance > | inlineprivate |
| rtflann::NNIndex::swap(NNIndex &other) | rtflann::NNIndex< Distance > | inlineprotected |
| tree_roots_ | rtflann::KDTreeIndex< Distance > | private |
| trees_ | rtflann::KDTreeIndex< Distance > | private |
| usedMemory() const | rtflann::KDTreeIndex< Distance > | inlinevirtual |
| var_ | rtflann::KDTreeIndex< Distance > | private |
| veclen() const | rtflann::NNIndex< Distance > | inlinevirtual |
| veclen_ | rtflann::NNIndex< Distance > | protected |
| ~IndexBase() | rtflann::IndexBase | inlinevirtual |
| ~KDTreeIndex() | rtflann::KDTreeIndex< Distance > | inlinevirtual |
| ~NNIndex() | rtflann::NNIndex< Distance > | inlinevirtual |