|
Geant4
10.02
|
G4KDTreeResult enables to go through the nearest entities found by G4KDTree. More...
#include <G4KDTreeResult.hh>
Inheritance diagram for G4KDTreeResult:
Collaboration diagram for G4KDTreeResult:Public Member Functions | |
| G4KDTreeResult (G4KDTree *) | |
| virtual | ~G4KDTreeResult () |
| 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 |
| std::list< ResNode >::iterator | fIterator |
G4KDTreeResult enables to go through the nearest entities found by G4KDTree.
Definition at line 68 of file G4KDTreeResult.hh.
| G4KDTreeResult::G4KDTreeResult | ( | G4KDTree * | tree | ) |
Definition at line 80 of file G4KDTreeResult.cc.
References fTree.
|
virtual |
Definition at line 85 of file G4KDTreeResult.cc.
| void G4KDTreeResult::Clear | ( | ) |
Definition at line 95 of file G4KDTreeResult.cc.
References fIterator.
| bool G4KDTreeResult::End | ( | ) |
Definition at line 121 of file G4KDTreeResult.cc.
References fIterator.
| double G4KDTreeResult::GetDistanceSqr | ( | ) | const |
Definition at line 131 of file G4KDTreeResult.cc.
Referenced by GetItemNDistanceSQ().
Here is the caller graph for this function:| PointT * G4KDTreeResult::GetItem | ( | ) | const |
Definition at line 111 of file G4KDTreeResult.hh.
References GetNode(), and G4KDNode< PointT >::GetPoint().
Here is the call graph for this function:| PointT * G4KDTreeResult::GetItemNDistanceSQ | ( | double & | dist_sq | ) | const |
Definition at line 118 of file G4KDTreeResult.hh.
References GetDistanceSqr().
Here is the call graph for this function:| G4KDNode_Base * G4KDTreeResult::GetNode | ( | ) | const |
Definition at line 136 of file G4KDTreeResult.cc.
Referenced by GetItem().
Here is the caller graph for this function:| size_t G4KDTreeResult::GetSize | ( | ) | const |
Definition at line 106 of file G4KDTreeResult.cc.
| void G4KDTreeResult::Insert | ( | double | dis_sq, |
| G4KDNode_Base * | node | ||
| ) |
Definition at line 90 of file G4KDTreeResult.cc.
| void G4KDTreeResult::Next | ( | ) |
Definition at line 126 of file G4KDTreeResult.cc.
References fIterator.
| void G4KDTreeResult::Rewind | ( | ) |
Definition at line 116 of file G4KDTreeResult.cc.
References fIterator.
Referenced by G4KDTree::NearestInRange().
Here is the caller graph for this function:| size_t G4KDTreeResult::size | ( | ) | const |
Definition at line 111 of file G4KDTreeResult.cc.
| void G4KDTreeResult::Sort | ( | ) |
Definition at line 101 of file G4KDTreeResult.cc.
References CompareResNode().
Referenced by G4KDTree::NearestInRange().
Here is the call graph for this function:
Here is the caller graph for this function:
|
protected |
|
protected |
Definition at line 71 of file G4KDTreeResult.hh.
Referenced by G4KDTreeResult().