#include <G4KDTreeResult.hh>

Inheritance 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 69 of file G4KDTreeResult.hh.

Constructor & Destructor Documentation

◆ G4KDTreeResult()

G4KDTreeResult::G4KDTreeResult ( G4KDTree * tree )

Definition at line 87 of file G4KDTreeResult.cc.

{
    fTree = tree;
}

Referenced by operator delete().

◆ ~G4KDTreeResult()

G4KDTreeResult::~G4KDTreeResult ( )

virtual

Definition at line 92 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 104 of file G4KDTreeResult.cc.

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

◆ End()

bool G4KDTreeResult::End ( )

Definition at line 135 of file G4KDTreeResult.cc.

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

◆ GetDistanceSqr()

double G4KDTreeResult::GetDistanceSqr ( ) const

Definition at line 145 of file G4KDTreeResult.cc.

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

Referenced by G4DNAIRTMoleculeEncounterStepper::CalculateStep(), G4DNAMoleculeEncounterStepper::CalculateStep(), and GetItemNDistanceSQ().

◆ GetItem()

template<typename PointT>

PointT * G4KDTreeResult::GetItem ( ) const

Definition at line 139 of file G4KDTreeResult.hh.

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

Referenced by GetItemNDistanceSQ().

◆ 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>();
  }

◆ GetNode()

G4KDNode_Base * G4KDTreeResult::GetNode ( ) const

Definition at line 150 of file G4KDTreeResult.cc.

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

Referenced by GetItem().

◆ GetSize()

size_t G4KDTreeResult::GetSize ( ) const

Definition at line 118 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 98 of file G4KDTreeResult.cc.

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

Referenced by G4KDTree::Nearest().

◆ Next()

void G4KDTreeResult::Next ( )

Definition at line 140 of file G4KDTreeResult.cc.

{
    ++fIterator;
}

◆ operator delete()

void G4KDTreeResult::operator delete ( void * object )

inline

Definition at line 133 of file G4KDTreeResult.hh.

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

◆ operator new()

void * G4KDTreeResult::operator new ( size_t )

inline

Definition at line 127 of file G4KDTreeResult.hh.

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

◆ Rewind()

void G4KDTreeResult::Rewind ( )

Definition at line 130 of file G4KDTreeResult.cc.

{
  fIterator = begin();
}

Referenced by G4KDTree::Nearest().

◆ size()

size_t G4KDTreeResult::size ( ) const

Definition at line 124 of file G4KDTreeResult.cc.

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

◆ Sort()

void G4KDTreeResult::Sort ( )

Definition at line 112 of file G4KDTreeResult.cc.

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

Member Data 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