| Geant4 Cross Reference |
1 // 1 //
2 // ******************************************* 2 // ********************************************************************
3 // * License and Disclaimer 3 // * License and Disclaimer *
4 // * 4 // * *
5 // * The Geant4 software is copyright of th 5 // * The Geant4 software is copyright of the Copyright Holders of *
6 // * the Geant4 Collaboration. It is provided 6 // * the Geant4 Collaboration. It is provided under the terms and *
7 // * conditions of the Geant4 Software License 7 // * conditions of the Geant4 Software License, included in the file *
8 // * LICENSE and available at http://cern.ch/ 8 // * LICENSE and available at http://cern.ch/geant4/license . These *
9 // * include a list of copyright holders. 9 // * include a list of copyright holders. *
10 // * 10 // * *
11 // * Neither the authors of this software syst 11 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing fin 12 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warran 13 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assum 14 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file 15 // * use. Please see the license in the file LICENSE and URL above *
16 // * for the full disclaimer and the limitatio 16 // * for the full disclaimer and the limitation of liability. *
17 // * 17 // * *
18 // * This code implementation is the result 18 // * This code implementation is the result of the scientific and *
19 // * technical work of the GEANT4 collaboratio 19 // * technical work of the GEANT4 collaboration. *
20 // * By using, copying, modifying or distri 20 // * By using, copying, modifying or distributing the software (or *
21 // * any work based on the software) you ag 21 // * any work based on the software) you agree to acknowledge its *
22 // * use in resulting scientific publicati 22 // * use in resulting scientific publications, and indicate your *
23 // * acceptance of all terms of the Geant4 Sof 23 // * acceptance of all terms of the Geant4 Software license. *
24 // ******************************************* 24 // ********************************************************************
25 // 25 //
>> 26 // $Id: G4AllITManager.hh 84670 2014-10-17 15:23:24Z matkara $
26 // 27 //
27 // Author: Mathieu Karamitros << 28 // Author: Mathieu Karamitros, kara@cenbg.in2p3.fr
28 29
29 // The code is developed in the framework of t 30 // The code is developed in the framework of the ESA AO7146
30 // 31 //
31 // We would be very happy hearing from you, se 32 // We would be very happy hearing from you, send us your feedback! :)
32 // 33 //
33 // In order for Geant4-DNA to be maintained an 34 // In order for Geant4-DNA to be maintained and still open-source,
34 // article citations are crucial. 35 // article citations are crucial.
35 // If you use Geant4-DNA chemistry and you pub 36 // If you use Geant4-DNA chemistry and you publish papers about your software,
36 // in addition to the general paper on Geant4- 37 // in addition to the general paper on Geant4-DNA:
37 // 38 //
38 // Int. J. Model. Simul. Sci. Comput. 1 (2010) 39 // Int. J. Model. Simul. Sci. Comput. 1 (2010) 157–178
39 // 40 //
40 // we would be very happy if you could please 41 // we would be very happy if you could please also cite the following
41 // reference papers on chemistry: 42 // reference papers on chemistry:
42 // 43 //
43 // J. Comput. Phys. 274 (2014) 841-882 44 // J. Comput. Phys. 274 (2014) 841-882
44 // Prog. Nucl. Sci. Tec. 2 (2011) 503-508 45 // Prog. Nucl. Sci. Tec. 2 (2011) 503-508
45 46
46 #ifndef G4AllITFinder_h << 47 #ifndef G4AllITManager_h
47 #define G4AllITFinder_h 1 << 48 #define G4AllITManager_h 1
48 #include "globals.hh" 49 #include "globals.hh"
49 #include "G4ITType.hh" 50 #include "G4ITType.hh"
50 #include "G4ThreeVector.hh" 51 #include "G4ThreeVector.hh"
51 #include "G4KDTreeResult.hh" 52 #include "G4KDTreeResult.hh"
52 53
53 #include <map> 54 #include <map>
54 #include <vector> 55 #include <vector>
55 #include <memory> 56 #include <memory>
56 57
57 class G4IT; 58 class G4IT;
58 class G4VITFinder; 59 class G4VITFinder;
59 class G4ITBox; 60 class G4ITBox;
60 class G4Track; 61 class G4Track;
61 template<typename T> 62 template<typename T>
62 class G4ITFinder; 63 class G4ITFinder;
63 64
64 /** 65 /**
65 * Holds all IT Manager, and take care of dele 66 * Holds all IT Manager, and take care of deleting them
66 * when AllITManager is deleted 67 * when AllITManager is deleted
67 * Set general verbose for all IT Manager 68 * Set general verbose for all IT Manager
68 */ 69 */
69 70
70 class G4AllITFinder 71 class G4AllITFinder
71 { 72 {
72 public: 73 public:
73 static G4AllITFinder* Instance(); 74 static G4AllITFinder* Instance();
74 static void DeleteInstance(); 75 static void DeleteInstance();
75 /** 76 /**
76 * To delete the Instance you should use Del 77 * To delete the Instance you should use DeleteInstance()
77 * rather than the destructor 78 * rather than the destructor
78 */ 79 */
79 80
80 ~G4AllITFinder(); 81 ~G4AllITFinder();
81 82
82 G4VITFinder* GetInstance(G4ITType); 83 G4VITFinder* GetInstance(G4ITType);
83 G4ITBox* GetBox(const G4Track*); 84 G4ITBox* GetBox(const G4Track*);
84 85
85 void RegisterManager(G4VITFinder* manager); 86 void RegisterManager(G4VITFinder* manager);
86 void Push(G4Track* track); 87 void Push(G4Track* track);
87 88
88 /** 89 /**
89 * Set General verbose for all IT Manager 90 * Set General verbose for all IT Manager
90 * See ITManager builder 91 * See ITManager builder
91 */ 92 */
92 void SetVerboseLevel(G4int level) 93 void SetVerboseLevel(G4int level)
93 { 94 {
94 fVerbose = level; 95 fVerbose = level;
95 } 96 }
96 G4int GetVerboseLevel() 97 G4int GetVerboseLevel()
97 { 98 {
98 return fVerbose; 99 return fVerbose;
99 } 100 }
100 101
101 void UpdatePositionMap(); 102 void UpdatePositionMap();
102 103
103 template<typename T> 104 template<typename T>
104 inline G4KDTreeResultHandle FindNearest(co 105 inline G4KDTreeResultHandle FindNearest(const G4ThreeVector& pos,
105 co 106 const T* it);
106 template<typename T> 107 template<typename T>
107 inline G4KDTreeResultHandle FindNearest(co 108 inline G4KDTreeResultHandle FindNearest(const T* it0, const T* it);
108 template<typename T> 109 template<typename T>
109 inline G4KDTreeResultHandle FindNearestInR 110 inline G4KDTreeResultHandle FindNearestInRange(const G4ThreeVector& pos,
110 111 const T* it,
111 112 G4double range);
112 template<typename T> 113 template<typename T>
113 inline G4KDTreeResultHandle FindNearestInR 114 inline G4KDTreeResultHandle FindNearestInRange(const T* it0,
114 115 const T* it,
115 116 G4double range);
116 117
117 private: 118 private:
118 G4AllITFinder(); 119 G4AllITFinder();
119 static G4ThreadLocal G4AllITFinder* fpInstan 120 static G4ThreadLocal G4AllITFinder* fpInstance;
120 std::map<G4ITType, G4VITFinder*> fITSubManag 121 std::map<G4ITType, G4VITFinder*> fITSubManager;
121 122
122 int fVerbose; 123 int fVerbose;
123 }; 124 };
124 125
125 template<typename T> 126 template<typename T>
126 inline G4KDTreeResultHandle G4AllITFinder::F 127 inline G4KDTreeResultHandle G4AllITFinder::FindNearest(const G4ThreeVector& pos,
127 128 const T* it)
128 { 129 {
129 return G4ITFinder<T>::Instance()->FindNear 130 return G4ITFinder<T>::Instance()->FindNearest(pos, it);
130 } 131 }
131 132
132 template<typename T> 133 template<typename T>
133 inline G4KDTreeResultHandle G4AllITFinder::F 134 inline G4KDTreeResultHandle G4AllITFinder::FindNearest(const T* it0,
134 135 const T* it)
135 { 136 {
136 return G4ITFinder<T>::Instance()->FindNear 137 return G4ITFinder<T>::Instance()->FindNearest(it0, it);
137 } 138 }
138 139
139 template<typename T> 140 template<typename T>
140 inline G4KDTreeResultHandle G4AllITFinder::F 141 inline G4KDTreeResultHandle G4AllITFinder::FindNearestInRange(const G4ThreeVector& pos,
141 142 const T* it,
142 143 G4double range)
143 { 144 {
144 return G4ITFinder<T>::Instance()->FindNear 145 return G4ITFinder<T>::Instance()->FindNearestInRange(pos, it, range);
145 } 146 }
146 147
147 template<typename T> 148 template<typename T>
148 inline G4KDTreeResultHandle G4AllITFinder::F 149 inline G4KDTreeResultHandle G4AllITFinder::FindNearestInRange(const T* it0,
149 150 const T* it,
150 151 G4double range)
151 { 152 {
152 return G4ITFinder<T>::Instance()->FindNear 153 return G4ITFinder<T>::Instance()->FindNearestInRange(it0, it, range);
153 } 154 }
154 155
155 #endif 156 #endif
156 157