Geant4 11.3.0
Toolkit for the simulation of the passage of particles through matter
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
G4ITFinder.hh
Go to the documentation of this file.
1//
2// ********************************************************************
3// * License and Disclaimer *
4// * *
5// * The Geant4 software is copyright of the Copyright Holders of *
6// * the Geant4 Collaboration. It is provided under the terms and *
7// * conditions of the Geant4 Software License, included in the file *
8// * LICENSE and available at http://cern.ch/geant4/license . These *
9// * include a list of copyright holders. *
10// * *
11// * Neither the authors of this software system, nor their employing *
12// * institutes,nor the agencies providing financial support for this *
13// * work make any representation or warranty, express or implied, *
14// * regarding this software system or assume any liability for its *
15// * use. Please see the license in the file LICENSE and URL above *
16// * for the full disclaimer and the limitation of liability. *
17// * *
18// * This code implementation is the result of the scientific and *
19// * technical work of the GEANT4 collaboration. *
20// * By using, copying, modifying or distributing the software (or *
21// * any work based on the software) you agree to acknowledge its *
22// * use in resulting scientific publications, and indicate your *
23// * acceptance of all terms of the Geant4 Software license. *
24// ********************************************************************
25//
26//
27// Author: Mathieu Karamitros
28
29// The code is developed in the framework of the ESA AO7146
30//
31// We would be very happy hearing from you, send us your feedback! :)
32//
33// In order for Geant4-DNA to be maintained and still open-source,
34// article citations are crucial.
35// If you use Geant4-DNA chemistry and you publish papers about your software,
36// in addition to the general paper on Geant4-DNA:
37//
38// Int. J. Model. Simul. Sci. Comput. 1 (2010) 157–178
39//
40// we would be very happy if you could please also cite the following
41// reference papers on chemistry:
42//
43// J. Comput. Phys. 274 (2014) 841-882
44// Prog. Nucl. Sci. Tec. 2 (2011) 503-508
45
46#ifndef G4ITFinder_hh
47#define G4ITFinder_hh 1
48
49#include <G4AllITFinder.hh>
50
51#include "globals.hh"
52#include <map>
53#include "G4KDTree.hh"
54#include "G4KDTreeResult.hh"
55#include "G4Track.hh"
56#include "G4ITTrackHolder.hh"
57
59{
60 public:
61 G4VITFinder() = default;
62 virtual ~G4VITFinder() = default;
63 virtual void Clear() = 0;
64 virtual void Push(G4Track* track) = 0;
65 virtual G4ITType GetITType() = 0;
66 virtual void UpdatePositionMap() = 0;
67 protected:
69};
70
71/**
72 * Localize the nearest neighbor
73 * For now, G4KDTree is used
74 */
75
76template <class T> //, class SearcherT = G4KDTree>
77class G4ITFinder : public G4VITFinder
78{
79 public:
80 static G4ITFinder* Instance();
81 ~G4ITFinder() override;
82 void Clear() override;
83 void SetVerboseLevel(G4int level) { fVerbose = level; }
85 void Push(G4Track* track) override;
86 G4ITType GetITType() override { return T::ITType(); }
87 void UpdatePositionMap() override;
88 G4KDTreeResultHandle FindNearestInRange(const T* point /*from this point*/,
89 G4int key /*for this type*/,
90 G4double /*range*/);
92 G4int key /*for this type*/);
93 G4KDTreeResultHandle FindNearest(const T* /*from this point*/,
94 G4int key /*for this type*/);
96 const G4ThreeVector& /*from this point*/, G4int key /*for this type*/,
97 G4double /*range*/);
98 G4KDTreeResultHandle FindNearest(const T* /*from this point*/,
99 const T* /*for this type*/);
100 private:
101 static G4ThreadLocal G4ITFinder* fInstance;
102 G4ITFinder();
103 using TreeMap = std::map<G4int, G4KDTree*> ;
104 TreeMap fTree;
105};
106
107#ifdef TEMPLATE
108# undef TEMPLATE
109#endif
110
111#define TEMPLATE template <class T>
112#define G4ITMANAGER G4ITFinder<T>
113
114#include "G4ITFinder.icc"
115
116#undef TEMPLATE
117#undef G4ITMANAGER
118
119#endif
G4ReferenceCountedHandle< G4KDTreeResult > G4KDTreeResultHandle
CLHEP::Hep3Vector G4ThreeVector
double G4double
Definition G4Types.hh:83
int G4int
Definition G4Types.hh:85
void SetVerboseLevel(G4int level)
Definition G4ITFinder.hh:83
void Clear() override
G4KDTreeResultHandle FindNearest(const T *, G4int key)
~G4ITFinder() override
G4KDTreeResultHandle FindNearestInRange(const T *point, G4int key, G4double)
G4KDTreeResultHandle FindNearest(const G4ThreeVector &, G4int key)
void UpdatePositionMap() override
void Push(G4Track *track) override
G4KDTreeResultHandle FindNearest(const T *, const T *)
G4ITType GetITType() override
Definition G4ITFinder.hh:86
G4int GetVerboseLevel()
Definition G4ITFinder.hh:84
static G4ITFinder * Instance()
G4KDTreeResultHandle FindNearestInRange(const G4ThreeVector &, G4int key, G4double)
virtual ~G4VITFinder()=default
G4int fVerbose
Definition G4ITFinder.hh:68
virtual void Push(G4Track *track)=0
virtual G4ITType GetITType()=0
virtual void UpdatePositionMap()=0
virtual void Clear()=0
G4VITFinder()=default
#define G4ThreadLocal
Definition tls.hh:77