G4KDTreeResult Class Reference

#include <G4KDTreeResult.hh>

Inheritance diagram for G4KDTreeResult:

Collaboration diagram for G4KDTreeResult:

Public Member Functions
	G4KDTreeResult (G4KDTree *)
virtual	~G4KDTreeResult ()
void	Insert (double, G4KDNode_Base *)
void	Clear ()
void	Sort ()
size_t	GetSize () const
size_t	size () const
void	Rewind ()
bool	End ()
void	Next ()
template<typename PointT >
PointT *	GetItem () const
G4KDNode_Base *	GetNode () const
template<typename PointT >
PointT *	GetItemNDistanceSQ (double &) const
double	GetDistanceSqr () const

Protected Attributes
G4KDTree *	fTree
std::list< ResNode >::iterator	fIterator

Detailed Description

G4KDTreeResult enables to go through the nearest entities found by G4KDTree.

Definition at line 68 of file G4KDTreeResult.hh.

Constructor & Destructor Documentation

G4KDTreeResult()

G4KDTreeResult::G4KDTreeResult

(

G4KDTree *

tree

)

Definition at line 80 of file G4KDTreeResult.cc.

                                             : std::list<ResNode>()
{
    fTree = tree;
}

~G4KDTreeResult()

G4KDTreeResult::~G4KDTreeResult ( )

virtual

Definition at line 85 of file G4KDTreeResult.cc.

{
    std::list<ResNode>::erase(begin(),end());
}

Member Function Documentation

Clear()

void G4KDTreeResult::Clear

(

)

Definition at line 95 of file G4KDTreeResult.cc.

{
    std::list<ResNode>::erase(begin(),end());
    fIterator = std::list<ResNode>::begin();
}

End()

bool G4KDTreeResult::End

(

)

Definition at line 121 of file G4KDTreeResult.cc.

{
    return (fIterator == end());
}

GetDistanceSqr()

double G4KDTreeResult::GetDistanceSqr

(

)

const

Definition at line 131 of file G4KDTreeResult.cc.

{
    return (*fIterator).GetDistanceSqr();
}

Here is the caller graph for this function:

GetItem()

template<typename PointT >

PointT * G4KDTreeResult::GetItem

(

)

const

Definition at line 111 of file G4KDTreeResult.hh.

  {
    G4KDNode<PointT>* node = (G4KDNode<PointT>*) (GetNode());
    return node->GetPoint();
  }

Here is the call graph for this function:

GetItemNDistanceSQ()

template<typename PointT >

PointT * G4KDTreeResult::GetItemNDistanceSQ

(

double &

dist_sq

)

const

Definition at line 118 of file G4KDTreeResult.hh.

  {
    dist_sq = GetDistanceSqr();
    return this->GetItem<PointT>();
  }

Here is the call graph for this function:

GetNode()

G4KDNode_Base * G4KDTreeResult::GetNode

(

)

const

Definition at line 136 of file G4KDTreeResult.cc.

                                             {
    return (*fIterator).GetNode();
}

Here is the caller graph for this function:

GetSize()

size_t G4KDTreeResult::GetSize

(

)

const

Definition at line 106 of file G4KDTreeResult.cc.

{
    return std::list<ResNode>::size();
}

Insert()

void G4KDTreeResult::Insert	(	double	dis_sq,
		G4KDNode_Base *	node
	)

Definition at line 90 of file G4KDTreeResult.cc.

{
    std::list<ResNode>::push_back(ResNode(dis_sq,node));
}

Next()

void G4KDTreeResult::Next

(

)

Definition at line 126 of file G4KDTreeResult.cc.

{
    fIterator++;
}

Rewind()

void G4KDTreeResult::Rewind

(

)

Definition at line 116 of file G4KDTreeResult.cc.

{
    fIterator = begin();
}

Here is the caller graph for this function:

size()

size_t G4KDTreeResult::size

(

)

const

Definition at line 111 of file G4KDTreeResult.cc.

{
    return std::list<ResNode>::size();
}

Sort()

void G4KDTreeResult::Sort

(

)

Definition at line 101 of file G4KDTreeResult.cc.

{
    std::list<ResNode>::sort(CompareResNode);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

fIterator

std::list<ResNode>::iterator G4KDTreeResult::fIterator

protected

Definition at line 72 of file G4KDTreeResult.hh.

fTree

G4KDTree* G4KDTreeResult::fTree

protected

Definition at line 71 of file G4KDTreeResult.hh.

---

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

• G4KDTreeResult.hh
• G4KDTreeResult.cc