SourceXtractorPlusPlus
0.15
Please provide a description of the project.
|
A simple N-dimensional KdTree for speeding-up elements within range types of queries. More...
#include <KdTree.h>
Classes | |
struct | Coord |
class | Leaf |
class | Node |
class | Split |
Public Types | |
using | Traits = KdTreeTraits< T > |
Public Member Functions | |
KdTree (const std::vector< T > &data) | |
std::vector< T > | findPointsWithinRadius (Coord coord, double radius) const |
Private Attributes | |
std::shared_ptr< Node > | m_root |
A simple N-dimensional KdTree for speeding-up elements within range types of queries.
template arguments: T type, a traits implemetation to access coordinates must be provided N number of dimensions S maximum number of elements in leaf nodes (must be >= 4, in practice we want larger anyway)
using SourceXtractor::KdTree< T, N, S >::Traits = KdTreeTraits<T> |
|
explicit |
Definition at line 113 of file KdTree.icpp.
References std::move(), SourceXtractor::S, and std::vector< T >::size().
std::vector< T > KdTree::findPointsWithinRadius | ( | Coord | coord, |
double | radius | ||
) | const |
Definition at line 123 of file KdTree.icpp.
|
private |