#include <G4KDTreeResult.hh>
G4KDTreeResult enables to go through the nearest entities found by G4KDTree.
Definition at line 59 of file G4KDTreeResult.hh.
G4KDTreeResult::G4KDTreeResult |
( |
G4KDTree * |
tree | ) |
|
G4KDTreeResult::~G4KDTreeResult |
( |
| ) |
|
|
virtual |
void G4KDTreeResult::Clear |
( |
| ) |
|
Definition at line 95 of file G4KDTreeResult.cc.
References fIterator.
97 std::list<ResNode>::erase(begin(),end());
std::list< ResNode >::iterator fIterator
bool G4KDTreeResult::End |
( |
| ) |
|
double G4KDTreeResult::GetDistanceSqr |
( |
| ) |
|
void * G4KDTreeResult::GetItem |
( |
double *& |
pos | ) |
|
void * G4KDTreeResult::GetItem |
( |
double & |
x, |
|
|
double & |
y, |
|
|
double & |
z |
|
) |
| |
Definition at line 138 of file G4KDTreeResult.cc.
140 x = (*fIterator).GetNode()->GetPosition()[0];
141 y = (*fIterator).GetNode()->GetPosition()[1];
142 z = (*fIterator).GetNode()->GetPosition()[2];
144 return (*fIterator).GetNode()->GetData();
void * G4KDTreeResult::GetItemData |
( |
| ) |
|
void * G4KDTreeResult::GetItemNDistanceSQ |
( |
double & |
dist_sq | ) |
|
Definition at line 147 of file G4KDTreeResult.cc.
149 dist_sq = (*fIterator).GetDistanceSqr();
150 return (*fIterator).GetNode()->GetData();
void * G4KDTreeResult::GetItemNDistanceSQ |
( |
double *& |
pos, |
|
|
double & |
dist_sq |
|
) |
| |
size_t G4KDTreeResult::GetSize |
( |
| ) |
|
void G4KDTreeResult::Next |
( |
| ) |
|
void G4KDTreeResult::Rewind |
( |
| ) |
|
size_t G4KDTreeResult::size |
( |
| ) |
|
void G4KDTreeResult::Sort |
( |
| ) |
|
std::list<ResNode>::iterator G4KDTreeResult::fIterator |
|
protected |
The documentation for this class was generated from the following files: