#include <G4KDTreeResult.hh>
Definition at line 69 of file G4KDTreeResult.hh.
◆ G4KDTreeResult()
G4KDTreeResult::G4KDTreeResult |
( |
G4KDTree * |
tree | ) |
|
◆ ~G4KDTreeResult()
G4KDTreeResult::~G4KDTreeResult |
( |
| ) |
|
|
virtual |
Definition at line 94 of file G4KDTreeResult.cc.
95{
96 KDTR_parent::erase(begin(),end());
97
98}
◆ Clear()
void G4KDTreeResult::Clear |
( |
| ) |
|
Definition at line 106 of file G4KDTreeResult.cc.
107{
108
109
110 KDTR_parent::erase(begin(),end());
112}
KDTR_parent::iterator fIterator
◆ End()
bool G4KDTreeResult::End |
( |
| ) |
|
◆ GetDistanceSqr()
double G4KDTreeResult::GetDistanceSqr |
( |
| ) |
const |
◆ GetItem()
template<typename PointT >
PointT * G4KDTreeResult::GetItem |
◆ GetItemNDistanceSQ()
template<typename PointT >
PointT * G4KDTreeResult::GetItemNDistanceSQ |
( |
double & |
dist_sq | ) |
const |
Definition at line 146 of file G4KDTreeResult.hh.
147 {
149 return this->GetItem<PointT>();
150 }
double GetDistanceSqr() const
◆ GetNode()
◆ GetSize()
size_t G4KDTreeResult::GetSize |
( |
| ) |
const |
◆ Insert()
void G4KDTreeResult::Insert |
( |
double |
dis_sq, |
|
|
G4KDNode_Base * |
node |
|
) |
| |
◆ Next()
void G4KDTreeResult::Next |
( |
| ) |
|
◆ operator delete()
void G4KDTreeResult::operator delete |
( |
void * |
object | ) |
|
|
inline |
Definition at line 133 of file G4KDTreeResult.hh.
134{
136}
G4DLLIMPORT G4Allocator< G4KDTreeResult > *& aKDTreeAllocator()
◆ operator new()
void * G4KDTreeResult::operator new |
( |
size_t |
| ) |
|
|
inline |
◆ Rewind()
void G4KDTreeResult::Rewind |
( |
| ) |
|
◆ size()
size_t G4KDTreeResult::size |
( |
| ) |
const |
◆ Sort()
void G4KDTreeResult::Sort |
( |
| ) |
|
Definition at line 114 of file G4KDTreeResult.cc.
115{
116
118}
bool CompareResNode(const ResNode &left, const ResNode &right)
◆ fIterator
KDTR_parent::iterator G4KDTreeResult::fIterator |
|
protected |
◆ fTree
The documentation for this class was generated from the following files: