G4KDTreeResult Class Reference

#include <G4KDTreeResult.hh>

Inheritance diagram for G4KDTreeResult:

Collaboration diagram for G4KDTreeResult:

Public Member Functions
	G4KDTreeResult (G4KDTree *)
virtual	~G4KDTreeResult ()
void *	operator new (size_t)
void	operator delete (void *)
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
KDTR_parent::iterator	fIterator

Detailed Description

Definition at line 70 of file G4KDTreeResult.hh.

Constructor & Destructor Documentation

G4KDTreeResult::G4KDTreeResult

(

G4KDTree *

tree

)

Definition at line 84 of file G4KDTreeResult.cc.

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

G4KDTreeResult::~G4KDTreeResult ( )

virtual

Definition at line 91 of file G4KDTreeResult.cc.

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

Member Function Documentation

void G4KDTreeResult::Clear

(

)

Definition at line 103 of file G4KDTreeResult.cc.

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

bool G4KDTreeResult::End

(

)

Definition at line 134 of file G4KDTreeResult.cc.

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

double G4KDTreeResult::GetDistanceSqr

(

)

const

Definition at line 144 of file G4KDTreeResult.cc.

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

Here is the caller graph for this function:

template<typename PointT >

PointT * G4KDTreeResult::GetItem

(

)

const

Definition at line 140 of file G4KDTreeResult.hh.

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

Here is the call graph for this function:

template<typename PointT >

PointT * G4KDTreeResult::GetItemNDistanceSQ

(

double &

dist_sq

)

const

Definition at line 147 of file G4KDTreeResult.hh.

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

Here is the call graph for this function:

G4KDNode_Base * G4KDTreeResult::GetNode

(

)

const

Definition at line 149 of file G4KDTreeResult.cc.

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

Here is the caller graph for this function:

size_t G4KDTreeResult::GetSize

(

)

const

Definition at line 117 of file G4KDTreeResult.cc.

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

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

Definition at line 97 of file G4KDTreeResult.cc.

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

void G4KDTreeResult::Next

(

)

Definition at line 139 of file G4KDTreeResult.cc.

{
    ++fIterator;
}

void G4KDTreeResult::operator delete ( void *  object )

inline

Definition at line 134 of file G4KDTreeResult.hh.

{
  aKDTreeAllocator->FreeSingle((G4KDTreeResult *) object);
}

void * G4KDTreeResult::operator new ( size_t  )

inline

Definition at line 128 of file G4KDTreeResult.hh.

{
  if (!aKDTreeAllocator) aKDTreeAllocator = new G4Allocator<G4KDTreeResult>;
  return (void *) aKDTreeAllocator->MallocSingle();
}

void G4KDTreeResult::Rewind

(

)

Definition at line 129 of file G4KDTreeResult.cc.

{
  fIterator = begin();
}

Here is the caller graph for this function:

size_t G4KDTreeResult::size

(

)

const

Definition at line 123 of file G4KDTreeResult.cc.

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

void G4KDTreeResult::Sort

(

)

Definition at line 111 of file G4KDTreeResult.cc.

{
    //std::list<ResNode>::sort(CompareResNode);
  std::sort(begin(), end(), CompareResNode);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

KDTR_parent::iterator G4KDTreeResult::fIterator

protected

Definition at line 75 of file G4KDTreeResult.hh.

G4KDTree* G4KDTreeResult::fTree

protected

Definition at line 73 of file G4KDTreeResult.hh.

---

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

• geant4.10.03.p01/source/processes/electromagnetic/dna/management/include/G4KDTreeResult.hh
• geant4.10.03.p01/source/processes/electromagnetic/dna/management/src/G4KDTreeResult.cc