Geant4  10.02.p02
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 // $Id: G4ITManager.hh 84670 2014-10-17 15:23:24Z matkara $
27 //
28 // Author: Mathieu Karamitros, kara@cenbg.in2p3.fr
29 
30 // The code is developed in the framework of the ESA AO7146
31 //
32 // We would be very happy hearing from you, send us your feedback! :)
33 //
34 // In order for Geant4-DNA to be maintained and still open-source,
35 // article citations are crucial.
36 // If you use Geant4-DNA chemistry and you publish papers about your software,
37 // in addition to the general paper on Geant4-DNA:
38 //
39 // Int. J. Model. Simul. Sci. Comput. 1 (2010) 157–178
40 //
41 // we would be very happy if you could please also cite the following
42 // reference papers on chemistry:
43 //
44 // J. Comput. Phys. 274 (2014) 841-882
45 // Prog. Nucl. Sci. Tec. 2 (2011) 503-508
46 
47 #ifndef G4ITManager_hh
48 #define G4ITManager_hh 1
49 
50 #include <G4AllITFinder.hh>
51 
52 #include "globals.hh"
53 #include <map>
54 #include "G4KDTree.hh"
55 #include "G4KDTreeResult.hh"
56 #include "G4Track.hh"
57 #include "G4ITTrackHolder.hh"
58 
60 {
61 public:
62  G4VITFinder();
63  virtual ~G4VITFinder(){;}
64  virtual void Clear() = 0;
65  virtual void SetVerboseLevel(G4int level) = 0;
66  virtual G4int GetVerboseLevel() = 0;
67  virtual void Push(G4Track* track) = 0;
68  virtual G4ITType GetITType() = 0;
69  virtual void UpdatePositionMap() = 0;
70 };
71 
77 template<class T>//, class SearcherT = G4KDTree>
78 class G4ITFinder: public G4VITFinder
79 {
81  G4ITFinder();
82 
83  typedef std::map<int, G4KDTree*> TreeMap;
84  TreeMap fTree;
85 
86  int fVerbose;
87 
88 public:
89  static G4ITFinder * Instance();
90  virtual ~G4ITFinder();
91  virtual void Clear();
92 
93  virtual void SetVerboseLevel(G4int level)
94  {
95  fVerbose = level;
96  }
97 
99  {
100  return fVerbose;
101  }
102 
103  virtual void Push(G4Track* track);
104 
105  virtual G4ITType GetITType()
106  {
107  return T::ITType();
108  }
109 
110  virtual void UpdatePositionMap();
111  static void iUpdatePositionMap();
112 
113  G4KDTreeResultHandle FindNearestInRange(const T* point /*from this point*/,
114  int key /*for this type*/,
115  G4double /*range*/);
117  int key /*for this type*/);
118  G4KDTreeResultHandle FindNearest(const T* /*from this point*/,
119  int key /*for this type*/);
120  G4KDTreeResultHandle FindNearestInRange(const G4ThreeVector& /*from this point*/,
121  int key /*for this type*/,
122  G4double /*range*/);
123  G4KDTreeResultHandle FindNearest(const T* /*from this point*/,
124  const T* /*for this type*/);
125 };
126 
127 #ifdef TEMPLATE
128 #undef TEMPLATE
129 #endif
130 
131 #define TEMPLATE template<class T>
132 #define G4ITMANAGER G4ITFinder<T>
133 
134 #include "G4ITFinder.icc"
135 
136 #undef TEMPLATE
137 #undef G4ITMANAGER
138 
139 #endif
std::map< int, G4KDTree * > TreeMap
Definition: G4ITFinder.hh:83
CLHEP::Hep3Vector G4ThreeVector
G4KDTreeResultHandle FindNearestInRange(const T *point, int key, G4double)
Tag the G4IT Should be automatically setup by G4IT using : ITDef(MyIT) and ITImp(MyIT) ...
Definition: G4ITType.hh:60
virtual G4ITType GetITType()
Definition: G4ITFinder.hh:105
virtual void SetVerboseLevel(G4int level)=0
#define G4ThreadLocal
Definition: tls.hh:89
int G4int
Definition: G4Types.hh:78
static void iUpdatePositionMap()
virtual void UpdatePositionMap()=0
virtual G4int GetVerboseLevel()
Definition: G4ITFinder.hh:98
TreeMap fTree
Definition: G4ITFinder.hh:84
int fVerbose
Definition: G4ITFinder.hh:86
virtual void Push(G4Track *track)=0
virtual void SetVerboseLevel(G4int level)
Definition: G4ITFinder.hh:93
virtual void UpdatePositionMap()
static G4ITFinder * Instance()
G4KDTreeResultHandle FindNearest(const G4ThreeVector &, int key)
virtual ~G4ITFinder()
virtual ~G4VITFinder()
Definition: G4ITFinder.hh:63
virtual void Clear()=0
Localize the nearest neighbor For now, G4KDTree is used.
virtual void Clear()
double G4double
Definition: G4Types.hh:76
static G4ThreadLocal G4ITFinder * fInstance
Definition: G4ITFinder.hh:80
virtual void Push(G4Track *track)
virtual G4int GetVerboseLevel()=0
virtual G4ITType GetITType()=0