#include <kdtree.h>

Public Member Functions
	KDTree (KDTreeArray &data_in, bool rearrange_in=true, int dim_in=-1)

	~KDTree ()

void	n_nearest_brute_force (std::vector< double > &qv, int nn, KDTreeResultVector &result)

void	n_nearest (std::vector< double > &qv, int nn, KDTreeResultVector &result)

void	n_nearest_around_point (int idxin, int correltime, int nn, KDTreeResultVector &result)

void	r_nearest (std::vector< double > &qv, double r2, KDTreeResultVector &result)

void	r_nearest_around_point (int idxin, int correltime, double r2, KDTreeResultVector &result)

int	r_count (std::vector< double > &qv, double r2)

int	r_count_around_point (int idxin, int correltime, double r2)

Public Attributes
const KDTreeArray &	the_data

const int	N

int	dim

bool	sort_results

const bool	rearrange

Friends
class	KDTreeNode

class	SearchRecord

Detailed Description

Definition at line 57 of file kdtree.h.

Constructor & Destructor Documentation

◆ KDTree()

kdtree::KDTree::KDTree	(	KDTreeArray &	data_in,
		bool	rearrange_in = `true`,
		int	dim_in = `-1`
	)

◆ ~KDTree()

kdtree::KDTree::~KDTree ( )

Member Function Documentation

◆ n_nearest()

void kdtree::KDTree::n_nearest	(	std::vector< double > &	qv,
		int	nn,
		KDTreeResultVector &	result
	)

◆ n_nearest_around_point()

void kdtree::KDTree::n_nearest_around_point	(	int	idxin,
		int	correltime,
		int	nn,
		KDTreeResultVector &	result
	)

◆ n_nearest_brute_force()

void kdtree::KDTree::n_nearest_brute_force	(	std::vector< double > &	qv,
		int	nn,
		KDTreeResultVector &	result
	)

◆ r_count()

int kdtree::KDTree::r_count	(	std::vector< double > &	qv,
		double	r2
	)

◆ r_count_around_point()

int kdtree::KDTree::r_count_around_point	(	int	idxin,
		int	correltime,
		double	r2
	)

◆ r_nearest()

void kdtree::KDTree::r_nearest	(	std::vector< double > &	qv,
		double	r2,
		KDTreeResultVector &	result
	)

◆ r_nearest_around_point()

void kdtree::KDTree::r_nearest_around_point	(	int	idxin,
		int	correltime,
		double	r2,
		KDTreeResultVector &	result
	)

Friends And Related Function Documentation

◆ KDTreeNode

friend class KDTreeNode

friend

Definition at line 107 of file kdtree.h.

◆ SearchRecord

friend class SearchRecord

friend

Definition at line 108 of file kdtree.h.

Member Data Documentation

◆ dim

int kdtree::KDTree::dim

Definition at line 69 of file kdtree.h.

◆ N

const int kdtree::KDTree::N

Definition at line 68 of file kdtree.h.

◆ rearrange

const bool kdtree::KDTree::rearrange

Definition at line 71 of file kdtree.h.

◆ sort_results

bool kdtree::KDTree::sort_results

Definition at line 70 of file kdtree.h.

◆ the_data

const KDTreeArray& kdtree::KDTree::the_data

Definition at line 59 of file kdtree.h.

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

kdtree.h

Public Member Functions

Public Attributes

Friends