G4KDTreeResult Class Reference

#include <G4KDTreeResult.hh>

Inheritance diagram for G4KDTreeResult:

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

Protected Attributes
KDTR_parent::iterator	fIterator
G4KDTree *	fTree

Detailed Description

Definition at line 69 of file G4KDTreeResult.hh.

Constructor & Destructor Documentation

G4KDTreeResult()

G4KDTreeResult::G4KDTreeResult

(

G4KDTree *

tree

)

Definition at line 87 of file G4KDTreeResult.cc.

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

References fTree.

~G4KDTreeResult()

G4KDTreeResult::~G4KDTreeResult ( )

virtual

Definition at line 94 of file G4KDTreeResult.cc.

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

Member Function Documentation

Clear()

void G4KDTreeResult::Clear

(

)

Definition at line 106 of file G4KDTreeResult.cc.

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

References fIterator.

End()

bool G4KDTreeResult::End

(

)

Definition at line 137 of file G4KDTreeResult.cc.

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

References fIterator.

GetDistanceSqr()

double G4KDTreeResult::GetDistanceSqr

(

)

const

Definition at line 147 of file G4KDTreeResult.cc.

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

Referenced by GetItemNDistanceSQ().

GetItem()

template<typename PointT >

PointT * G4KDTreeResult::GetItem

Definition at line 139 of file G4KDTreeResult.hh.

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

References GetNode(), and G4KDNode< PointT >::GetPoint().

GetItemNDistanceSQ()

template<typename PointT >

PointT * G4KDTreeResult::GetItemNDistanceSQ

(

double &

dist_sq

)

const

Definition at line 146 of file G4KDTreeResult.hh.

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

References GetDistanceSqr().

GetNode()

G4KDNode_Base * G4KDTreeResult::GetNode

(

)

const

Definition at line 152 of file G4KDTreeResult.cc.

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

Referenced by GetItem().

GetSize()

size_t G4KDTreeResult::GetSize

(

)

const

Definition at line 120 of file G4KDTreeResult.cc.

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

Insert()

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

Definition at line 100 of file G4KDTreeResult.cc.

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

Next()

void G4KDTreeResult::Next

(

)

Definition at line 142 of file G4KDTreeResult.cc.

{
    ++fIterator;
}

References fIterator.

operator delete()

void G4KDTreeResult::operator delete ( void *  object )

inline

Definition at line 133 of file G4KDTreeResult.hh.

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

References aKDTreeAllocator().

operator new()

void * G4KDTreeResult::operator new ( size_t  )

inline

Definition at line 127 of file G4KDTreeResult.hh.

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

References aKDTreeAllocator().

Rewind()

void G4KDTreeResult::Rewind

(

)

Definition at line 132 of file G4KDTreeResult.cc.

{
  fIterator = begin();
}

References fIterator.

Referenced by G4KDTree::NearestInRange().

size()

size_t G4KDTreeResult::size

(

)

const

Definition at line 126 of file G4KDTreeResult.cc.

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

Sort()

void G4KDTreeResult::Sort

(

)

Definition at line 114 of file G4KDTreeResult.cc.

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

References CompareResNode().

Referenced by G4KDTree::NearestInRange().

Field Documentation

fIterator

KDTR_parent::iterator G4KDTreeResult::fIterator

protected

Definition at line 74 of file G4KDTreeResult.hh.

Referenced by Clear(), End(), Next(), and Rewind().

fTree

G4KDTree* G4KDTreeResult::fTree

protected

Definition at line 72 of file G4KDTreeResult.hh.

Referenced by G4KDTreeResult().

---

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

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