G4KDTree Class Reference

#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 *	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 60 of file G4KDTree.hh.

Constructor & Destructor Documentation

G4KDTree::G4KDTree

(

int

dim = 3)

Definition at line 169 of file G4KDTree.cc.

G4KDTree::~G4KDTree ( )

virtual

Definition at line 178 of file G4KDTree.cc.

Member Function Documentation

void G4KDTree::__Clear_Rec ( G4KDNode *  node)

protected

Definition at line 203 of file G4KDTree.cc.

Here is the call 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 261 of file G4KDTree.cc.

Here is the call 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  )

protected

Definition at line 420 of file G4KDTree.cc.

Here is the call graph for this function:

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

protected

Definition at line 308 of file G4KDTree.cc.

Here is the call graph for this function:

void G4KDTree::Clear

(

)

Definition at line 190 of file G4KDTree.cc.

int G4KDTree::GetDim ( )

inline

Definition at line 136 of file G4KDTree.hh.

Here is the caller graph for this function:

int G4KDTree::GetNbNodes ( )

inline

Definition at line 80 of file G4KDTree.hh.

G4KDNode* G4KDTree::GetRoot ( )

inline

Definition at line 81 of file G4KDTree.hh.

G4KDNode * G4KDTree::Insert	(	const double *	pos,
		void *	data
	)

Definition at line 221 of file G4KDTree.cc.

Here is the call graph for this function:

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

Definition at line 251 of file G4KDTree.cc.

Here is the call graph for this function:

G4KDTreeResultHandle G4KDTree::Nearest

(

const double *

pos)

Definition at line 386 of file G4KDTree.cc.

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

Definition at line 552 of file G4KDTree.cc.

G4KDTreeResultHandle G4KDTree::Nearest

(

G4KDNode *

node)

Definition at line 508 of file G4KDTree.cc.

Here is the call graph for this function:

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

Definition at line 561 of file G4KDTree.cc.

Here is the call graph for this function:

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

Definition at line 578 of file G4KDTree.cc.

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

Definition at line 590 of file G4KDTree.cc.

Here is the call graph for this function:

void G4KDTree::SetDataDestructor ( void(*)(void *)  fDestr)

inline

Definition at line 141 of file G4KDTree.hh.

Friends And Related Function Documentation

friend class G4KDNode

friend

Definition at line 62 of file G4KDTree.hh.

Member Data Documentation

G4KDNode* G4KDTree::fRoot

protected

Definition at line 69 of file G4KDTree.hh.

---

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

• D:/Geant4/geant4_9_6_p02/source/processes/electromagnetic/dna/management/include/G4KDTree.hh
• D:/Geant4/geant4_9_6_p02/source/processes/electromagnetic/dna/management/src/G4KDTree.cc