Alexandria 2.31.2
SDC-CH common library for the Euclid project
Loading...
Searching...
No Matches
KdTree::KdTree< T, DistanceMethod >::Node< T, DistanceMethod > Class Template Referenceabstract
Inheritance diagram for KdTree::KdTree< T, DistanceMethod >::Node< T, DistanceMethod >:

Public Member Functions

virtual void findPointsWithinRadius (const T &coord, double radius, std::vector< T > &selection) const =0
 
virtual std::size_t countPointsWithinRadius (const T &coord, double radius) const =0
 
virtual ~Node ()=default
 

Detailed Description

template<typename T, typename DistanceMethod = EuclideanDistance<T>>
template<typename T, typename DistanceMethod>
class KdTree::KdTree< T, DistanceMethod >::Node< T, DistanceMethod >

Definition at line 23 of file KdTree.icpp.

Constructor & Destructor Documentation

◆ ~Node()

template<typename T , typename DistanceMethod = EuclideanDistance<T>>
template<typename T , typename DistanceMethod >
virtual KdTree::KdTree< T, DistanceMethod >::Node< T, DistanceMethod >::~Node ( )
virtualdefault

Member Function Documentation

◆ countPointsWithinRadius()

template<typename T , typename DistanceMethod = EuclideanDistance<T>>
template<typename T , typename DistanceMethod >
virtual std::size_t KdTree::KdTree< T, DistanceMethod >::Node< T, DistanceMethod >::countPointsWithinRadius ( const T & coord,
double radius ) const
pure virtual

◆ findPointsWithinRadius()

template<typename T , typename DistanceMethod = EuclideanDistance<T>>
template<typename T , typename DistanceMethod >
virtual void KdTree::KdTree< T, DistanceMethod >::Node< T, DistanceMethod >::findPointsWithinRadius ( const T & coord,
double radius,
std::vector< T > & selection ) const
pure virtual

The documentation for this class was generated from the following file: