#include <G4AllITManager.hh>
Inheritance diagram for G4ITManager< T >:
Collaboration diagram for G4ITManager< T >:
Public Member Functions | |
| virtual | ~G4ITManager () |
| virtual void | Push (G4Track *) |
| G4int | NbElements (const G4IT *) |
| void | EraseABox (T *) |
| void | EraseABox (G4ITBox *) |
| void | SetVerboseLevel (G4int level) |
| G4int | GetVerboseLevel () |
| virtual void | UpdatePositionMap () |
| G4KDTreeResultHandle | FindNearestInRange (const T *, const T *, G4double) |
| G4KDTreeResultHandle | FindNearest (const G4ThreeVector &, const T *it) |
| G4KDTreeResultHandle | FindNearest (const T *it0, const T *it) |
| G4KDTreeResultHandle | FindNearestInRange (const G4ThreeVector &, const T *, G4double) |
| G4ITBox * | GetBox (const T *IT) |
| virtual G4ITBox * | GetBox (const G4IT *IT) |
| virtual G4ITBox * | GetFirstBox () |
| virtual G4ITBox * | GetNextBox (G4ITBox *box) |
| virtual G4ITBox * | GetLastBox () |
 Public Member Functions inherited from G4VITManager | |
| G4VITManager () | |
| virtual | ~G4VITManager () |
| void | SetVerboseLevel (G4int level) |
| G4int | GetVerboseLevel () |
| virtual void | CreateTree () |
| G4ITType | GetITType () |
| G4ITBox * | GetBox (const G4Track *track) |
Static Public Member Functions | |
| static G4ITManager< T > * | Instance () |
| static void | iUpdatePositionMap () |
Additional Inherited Members | |
| Protected Attributes inherited from G4VITManager | |
| G4ITType | fType |
| G4int | fVerbose |
Detailed Description
template<typename T>
class G4ITManager< T >
G4ITManager is able to save into different boxes the ITs that will be used in the simulation. It is a stack-like. Those boxes are used to fill a tree which helps finding the closest neighboor.
Definition at line 52 of file G4AllITManager.hh.
Constructor & Destructor Documentation
template<typename T>
|
virtual |
Member Function Documentation
template<typename T>
| void G4ITManager< T >::EraseABox | ( | T * | ) |
template<typename T>
| void G4ITManager< T >::EraseABox | ( | G4ITBox * | ) |
template<typename T>
| G4KDTreeResultHandle G4ITManager< T >::FindNearest | ( | const G4ThreeVector & | , |
| const T * | it | ||
| ) |
template<typename T>
| G4KDTreeResultHandle G4ITManager< T >::FindNearest | ( | const T * | it0, |
| const T * | it | ||
| ) |
template<typename T>
| G4KDTreeResultHandle G4ITManager< T >::FindNearestInRange | ( | const T * | , |
| const T * | , | ||
| G4double | |||
| ) |
template<typename T>
| G4KDTreeResultHandle G4ITManager< T >::FindNearestInRange | ( | const G4ThreeVector & | , |
| const T * | , | ||
| G4double | |||
| ) |
template<typename T>
|
inline |
template<typename T>
|
inlinevirtual |
Implements G4VITManager.
Definition at line 198 of file G4ITManager.hh.
Here is the call graph for this function:
template<typename T>
|
inlinevirtual |
Implements G4VITManager.
Definition at line 213 of file G4ITManager.hh.
template<typename T>
|
inlinevirtual |
Implements G4VITManager.
Definition at line 232 of file G4ITManager.hh.
template<typename T>
|
inlinevirtual |
Implements G4VITManager.
Definition at line 223 of file G4ITManager.hh.
Here is the call graph for this function:
template<typename T>
|
inline |
Definition at line 178 of file G4ITManager.hh.
template<typename T>
|
static |
Here is the caller graph for this function:
template<typename T>
|
static |
template<typename T>
| G4int G4ITManager< T >::NbElements | ( | const G4IT * | ) |
template<typename T>
|
virtual |
Implements G4VITManager.
template<typename T>
|
inline |
Definition at line 174 of file G4ITManager.hh.
template<typename T>
|
virtual |
Implements G4VITManager.
The documentation for this class was generated from the following files:
- source/source/processes/electromagnetic/dna/management/include/G4AllITManager.hh
- source/source/processes/electromagnetic/dna/management/include/G4ITManager.hh
