#include <G4KDTree.hh>

Collaboration diagram for G4KDTree:

Public Member Functions
	G4KDTree (int dim=3)

virtual	~G4KDTree ()

void	Clear ()

int	GetDim ()

void	SetDataDestructor (void(fDestr)(void ))

int	GetNbNodes ()

G4KDNode *	GetRoot ()

G4KDNode *	InsertMap (const double &x, const double &y, const double &z, void *data)

G4KDNode *	InsertMap (const double pos, void data)

void	Build ()

G4KDNode *	Insert (const double pos, void data)

G4KDNode *	Insert (const double &x, const double &y, const double &z, void *data)

G4KDTreeResultHandle	Nearest (const double *pos)

G4KDTreeResultHandle	Nearest (const double &x, const double &y, const double &z)

G4KDTreeResultHandle	Nearest (G4KDNode *node)

G4KDTreeResultHandle	NearestInRange (const double *pos, const double &range)

G4KDTreeResultHandle	NearestInRange (const double &x, const double &y, const double &z, const double &range)

G4KDTreeResultHandle	NearestInRange (G4KDNode *node, const double &range)

Protected Member Functions
void	__Clear_Rec (G4KDNode *node)

int	__NearestInRange (G4KDNode node, const double pos, const double &range_sq, const double &range, G4KDTreeResult &list, int ordered, G4KDNode *source_node=0)

void	__NearestToPosition (G4KDNode node, const double pos, G4KDNode &result, double result_dist_sq, struct HyperRect *fRect)

void	__NearestToNode (G4KDNode source_node, G4KDNode node, const double pos, std::vector< G4KDNode > &result, double result_dist_sq, struct HyperRect fRect, int &nbresult)

Protected Attributes
G4KDNode *	fRoot

Friends
class	G4KDNode

Detailed Description

G4KDTree is used by the ITManager to locate the neareast neighbours. A kdtree sorts out node in such a way that it reduces the number of node check. The results of this search can be retrieved by G4KDTreeResultHandle.

Definition at line 62 of file G4KDTree.hh.

Constructor & Destructor Documentation

G4KDTree::G4KDTree ( int dim = 3 )

Definition at line 170 of file G4KDTree.cc.

G4KDTree::~G4KDTree ( )

virtual

Definition at line 179 of file G4KDTree.cc.

Here is the call graph for this function:

Member Function Documentation

void G4KDTree::__Clear_Rec ( G4KDNode * node )

protected

Definition at line 206 of file G4KDTree.cc.

Here is the call graph for this function:

Here is the caller graph for this function:

int G4KDTree::__NearestInRange	(	G4KDNode *	node,
		const double *	pos,
		const double &	range_sq,
		const double &	range,
		G4KDTreeResult &	list,
		int	ordered,
		G4KDNode *	source_node = `0`
	)

protected

Definition at line 303 of file G4KDTree.cc.

Here is the call graph for this function:

Here is the caller graph for this function:

void G4KDTree::__NearestToNode	(	G4KDNode *	source_node,
		G4KDNode *	node,
		const double *	pos,
		std::vector< G4KDNode * > &	result,
		double *	result_dist_sq,
		struct HyperRect *	fRect,
		int &	nbresult
	)