Alexandria  2.25.0
SDC-CH common library for the Euclid project
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Public Member Functions | Private Attributes | List of all members
KdTree::KdTree< T, DistanceMethod >::Leaf< T, DistanceMethod > Class Template Reference
Inheritance diagram for KdTree::KdTree< T, DistanceMethod >::Leaf< T, DistanceMethod >:
Inheritance graph
[legend]
Collaboration diagram for KdTree::KdTree< T, DistanceMethod >::Leaf< T, DistanceMethod >:
Collaboration graph
[legend]

Public Member Functions

 Leaf (const std::vector< T > &&data)
 
virtual ~Leaf ()=default
 
void findPointsWithinRadius (const T &coord, double radius, std::vector< T > &selection) const override
 
std::size_t countPointsWithinRadius (const T &coord, double radius) const override
 
- Public Member Functions inherited from KdTree::KdTree< T, DistanceMethod >::Node< T, DistanceMethod >
virtual ~Node ()=default
 

Private Attributes

const std::vector< T > m_data
 

Detailed Description

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

Definition at line 31 of file KdTree.icpp.

Constructor & Destructor Documentation

template<typename T , typename DistanceMethod = EuclideanDistance<T>>
template<typename T , typename DistanceMethod >
KdTree::KdTree< T, DistanceMethod >::Leaf< T, DistanceMethod >::Leaf ( const std::vector< T > &&  data)
inlineexplicit

Definition at line 33 of file KdTree.icpp.

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

Member Function Documentation

template<typename T , typename DistanceMethod = EuclideanDistance<T>>
template<typename T , typename DistanceMethod >
std::size_t KdTree::KdTree< T, DistanceMethod >::Leaf< T, DistanceMethod >::countPointsWithinRadius ( const T &  coord,
double  radius 
) const
inlineoverridevirtual
template<typename T , typename DistanceMethod = EuclideanDistance<T>>
template<typename T , typename DistanceMethod >
void KdTree::KdTree< T, DistanceMethod >::Leaf< T, DistanceMethod >::findPointsWithinRadius ( const T &  coord,
double  radius,
std::vector< T > &  selection 
) const
inlineoverridevirtual

Implements KdTree::KdTree< T, DistanceMethod >::Node< T, DistanceMethod >.

Definition at line 36 of file KdTree.icpp.

References std::vector< T >::emplace_back(), std::vector< T >::reserve(), and std::vector< T >::size().

Here is the call graph for this function:

Member Data Documentation

template<typename T , typename DistanceMethod = EuclideanDistance<T>>
template<typename T , typename DistanceMethod >
const std::vector<T> KdTree::KdTree< T, DistanceMethod >::Leaf< T, DistanceMethod >::m_data
private

Definition at line 53 of file KdTree.icpp.


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