| dim() const noexcept | clustering::KDTree< T, distanceType, LeafSize, AllocT > | inline |
| indexPermutation() const noexcept | clustering::KDTree< T, distanceType, LeafSize, AllocT > | inline |
| KDTree(const NDArray< T, 2 > &points) | clustering::KDTree< T, distanceType, LeafSize, AllocT > | inline |
| knnQuery(std::int32_t k, math::Pool pool) const | clustering::KDTree< T, distanceType, LeafSize, AllocT > | inline |
| nodeBounds(const KDTreeNode *node) const noexcept | clustering::KDTree< T, distanceType, LeafSize, AllocT > | inline |
| nodeCount() const noexcept | clustering::KDTree< T, distanceType, LeafSize, AllocT > | inline |
| query(const NDArray< T, 1 > &query_point, T radius, std::int64_t limit=-1) const | clustering::KDTree< T, distanceType, LeafSize, AllocT > | inline |
| query(T radius, math::Pool pool) const | clustering::KDTree< T, distanceType, LeafSize, AllocT > | inline |
| reorderedPoints() const noexcept | clustering::KDTree< T, distanceType, LeafSize, AllocT > | inline |
| root() const noexcept | clustering::KDTree< T, distanceType, LeafSize, AllocT > | inline |
| value_type typedef | clustering::KDTree< T, distanceType, LeafSize, AllocT > | |
| ~KDTree() | clustering::KDTree< T, distanceType, LeafSize, AllocT > | inline |