| 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 // Class G4PropagatorInField 26 // Class G4PropagatorInField
27 // 27 //
28 // class description: 28 // class description:
29 // 29 //
30 // This class performs the navigation/propagat 30 // This class performs the navigation/propagation of a particle/track
31 // in a magnetic field. The field is in genera 31 // in a magnetic field. The field is in general non-uniform.
32 // For the calculation of the path, it relies 32 // For the calculation of the path, it relies on the class G4ChordFinder.
33 33
34 // History: 34 // History:
35 // ------- 35 // -------
36 // 25.10.96 John Apostolakis, design and impl 36 // 25.10.96 John Apostolakis, design and implementation
37 // 25.03.97 John Apostolakis, adaptation for 37 // 25.03.97 John Apostolakis, adaptation for G4Transportation and cleanup
38 // 8.11.02 John Apostolakis, changes to enab 38 // 8.11.02 John Apostolakis, changes to enable use of safety in intersecting
39 // ------------------------------------------- 39 // ---------------------------------------------------------------------------
40 #ifndef G4PropagatorInField_hh 40 #ifndef G4PropagatorInField_hh
41 #define G4PropagatorInField_hh 1 41 #define G4PropagatorInField_hh 1
42 42
43 #include "G4Types.hh" 43 #include "G4Types.hh"
44 44
45 #include <vector> 45 #include <vector>
46 46
47 #include "G4FieldTrack.hh" 47 #include "G4FieldTrack.hh"
48 #include "G4FieldManager.hh" 48 #include "G4FieldManager.hh"
49 #include "G4VIntersectionLocator.hh" 49 #include "G4VIntersectionLocator.hh"
50 50
51 class G4ChordFinder; 51 class G4ChordFinder;
52 52
53 class G4Navigator; 53 class G4Navigator;
54 class G4VPhysicalVolume; 54 class G4VPhysicalVolume;
55 class G4VCurvedTrajectoryFilter; 55 class G4VCurvedTrajectoryFilter;
56 56
57 class G4PropagatorInField 57 class G4PropagatorInField
58 { 58 {
59 59
60 public: // with description 60 public: // with description
61 61
62 G4PropagatorInField( G4Navigator* theNaviga 62 G4PropagatorInField( G4Navigator* theNavigator,
63 G4FieldManager* detect 63 G4FieldManager* detectorFieldMgr,
64 G4VIntersectionLocator 64 G4VIntersectionLocator* vLocator = nullptr );
65 ~G4PropagatorInField(); 65 ~G4PropagatorInField();
66 66
67 G4double ComputeStep( G4FieldTrack& pFieldT 67 G4double ComputeStep( G4FieldTrack& pFieldTrack,
68 G4double pCurrentProp 68 G4double pCurrentProposedStepLength,
69 G4double& pNewSafety, 69 G4double& pNewSafety,
70 G4VPhysicalVolume* pP 70 G4VPhysicalVolume* pPhysVol = nullptr,
71 G4bool canRelaxDeltaC 71 G4bool canRelaxDeltaChord = false);
72 // Compute the next geometric Step 72 // Compute the next geometric Step
73 73
74 inline G4ThreeVector EndPosition() const; 74 inline G4ThreeVector EndPosition() const;
75 inline G4ThreeVector EndMomentumDir() const 75 inline G4ThreeVector EndMomentumDir() const;
76 inline G4bool IsParticleLooping() co 76 inline G4bool IsParticleLooping() const;
77 // Return the state after the Step 77 // Return the state after the Step
78 78
79 inline G4double GetEpsilonStep() const; 79 inline G4double GetEpsilonStep() const;
80 // Relative accuracy for current Step (Ca 80 // Relative accuracy for current Step (Calc.)
81 inline void SetEpsilonStep(G4double new 81 inline void SetEpsilonStep(G4double newEps);
82 // The ratio DeltaOneStep()/h_current_ste 82 // The ratio DeltaOneStep()/h_current_step
83 83
84 G4FieldManager* FindAndSetFieldManager(G4VP 84 G4FieldManager* FindAndSetFieldManager(G4VPhysicalVolume* pCurrentPhysVol);
85 // Set (and return) the correct field man 85 // Set (and return) the correct field manager (global or local),
86 // if it exists. 86 // if it exists.
87 // Should be called before ComputeStep is 87 // Should be called before ComputeStep is called;
88 // Currently, ComputeStep will call it, i 88 // Currently, ComputeStep will call it, if it has not been called.
89 89
90 inline G4ChordFinder* GetChordFinder(); 90 inline G4ChordFinder* GetChordFinder();
91 91
92 G4int SetVerboseLevel( G4int verbose 92 G4int SetVerboseLevel( G4int verbose );
93 inline G4int GetVerboseLevel() const; 93 inline G4int GetVerboseLevel() const;
94 inline G4int Verbose() const; 94 inline G4int Verbose() const;
95 inline void CheckMode(G4bool mode); <<
96 95
97 inline void SetVerboseTrace( G4bool enabl 96 inline void SetVerboseTrace( G4bool enable );
98 inline G4bool GetVerboseTrace(); 97 inline G4bool GetVerboseTrace();
99 // Tracing key parts of Compute Step 98 // Tracing key parts of Compute Step
100 99
101 inline G4int GetMaxLoopCount() const; 100 inline G4int GetMaxLoopCount() const;
102 inline void SetMaxLoopCount( G4int new_max 101 inline void SetMaxLoopCount( G4int new_max );
103 // A maximum for the number of substeps t 102 // A maximum for the number of substeps that a particle can take.
104 // Above this number it is signaled as 103 // Above this number it is signaled as 'looping'.
105 104
106 void printStatus( const G4FieldTrack& 105 void printStatus( const G4FieldTrack& startFT,
107 const G4FieldTrack& 106 const G4FieldTrack& currentFT,
108 G4double 107 G4double requestStep,
109 G4double 108 G4double safety,
110 G4int 109 G4int step,
111 G4VPhysicalVolume* 110 G4VPhysicalVolume* startVolume);
112 // Print Method - useful mostly for debug 111 // Print Method - useful mostly for debugging.
113 112
114 inline G4FieldTrack GetEndState() const; 113 inline G4FieldTrack GetEndState() const;
115 114
116 inline G4double GetMinimumEpsilonStep() con 115 inline G4double GetMinimumEpsilonStep() const; // Min for relative accuracy
117 inline void SetMinimumEpsilonStep( G4do 116 inline void SetMinimumEpsilonStep( G4double newEpsMin ); // of any step
118 inline G4double GetMaximumEpsilonStep() con 117 inline G4double GetMaximumEpsilonStep() const;
119 inline void SetMaximumEpsilonStep( G4do 118 inline void SetMaximumEpsilonStep( G4double newEpsMax );
120 // The 4 above methods are now obsolescen 119 // The 4 above methods are now obsolescent but *for now* will work
121 // They are being replaced by same-name m 120 // They are being replaced by same-name methods in G4FieldManager,
122 // allowing the specialisation in differe 121 // allowing the specialisation in different volumes.
123 // Their new behaviour is to change the v 122 // Their new behaviour is to change the values for the global field
124 // manager 123 // manager
125 124
126 void SetLargestAcceptableStep( G4double << 125 inline void SetLargestAcceptableStep( G4double newBigDist );
127 G4double GetLargestAcceptableStep(); << 126 inline G4double GetLargestAcceptableStep();
128 void ResetLargestAcceptableStep(); <<
129 // Obtain / change the size of the larges <<
130 // Reset method uses the world volume's <<
131 <<
132 G4double GetMaxStepSizeMultiplier(); <<
133 void SetMaxStepSizeMultiplier(G4double <<
134 // Control extra Multiplier parameter for <<
135 G4double GetMinBigDistance(); <<
136 void SetMinBigDistance(G4double val); <<
137 // Control minimum 'directional' distance <<
138 127
139 void SetTrajectoryFilter(G4VCurvedTrajector 128 void SetTrajectoryFilter(G4VCurvedTrajectoryFilter* filter);
140 // Set the filter that examines & stores 129 // Set the filter that examines & stores 'intermediate'
141 // curved trajectory points. Currently o 130 // curved trajectory points. Currently only position is stored.
142 131
143 std::vector<G4ThreeVector>* GimmeTrajectory 132 std::vector<G4ThreeVector>* GimmeTrajectoryVectorAndForgetIt() const;
144 // Access the points which have passed by 133 // Access the points which have passed by the filter.
145 // Responsibility for deleting the points 134 // Responsibility for deleting the points lies with the client.
146 // This method MUST BE called exactly ONC 135 // This method MUST BE called exactly ONCE per step.
147 136
148 void ClearPropagatorState(); 137 void ClearPropagatorState();
149 // Clear all the State of this class and 138 // Clear all the State of this class and its current associates
150 // --> the current field manager & chord 139 // --> the current field manager & chord finder will also be called
151 140
152 inline void SetDetectorFieldManager( G4Fiel 141 inline void SetDetectorFieldManager( G4FieldManager* newGlobalFieldManager );
153 // Update this (dangerous) state -- for t 142 // Update this (dangerous) state -- for the time being
154 143
155 inline void SetUseSafetyForOptimization( 144 inline void SetUseSafetyForOptimization( G4bool );
156 inline G4bool GetUseSafetyForOptimization() 145 inline G4bool GetUseSafetyForOptimization();
157 // Toggle & view parameter for using safe 146 // Toggle & view parameter for using safety to discard
158 // unneccesary calls to navigator (thus ' 147 // unneccesary calls to navigator (thus 'optimising' performance)
159 inline G4bool IntersectChord( const G4Three 148 inline G4bool IntersectChord( const G4ThreeVector& StartPointA,
160 const G4Three 149 const G4ThreeVector& EndPointB,
161 G4doubl 150 G4double& NewSafety,
162 G4doubl 151 G4double& LinearStepLength,
163 G4Three 152 G4ThreeVector& IntersectionPoint);
164 // Intersect the chord from StartPointA t 153 // Intersect the chord from StartPointA to EndPointB
165 // and return whether an intersection occ 154 // and return whether an intersection occurred
166 // NOTE: Safety is changed! 155 // NOTE: Safety is changed!
167 156
168 inline G4bool IsFirstStepInVolume(); 157 inline G4bool IsFirstStepInVolume();
169 inline G4bool IsLastStepInVolume(); 158 inline G4bool IsLastStepInVolume();
170 inline void PrepareNewTrack(); 159 inline void PrepareNewTrack();
171 160
172 inline G4VIntersectionLocator* GetIntersect 161 inline G4VIntersectionLocator* GetIntersectionLocator();
173 inline void SetIntersectionLocator(G4VInter 162 inline void SetIntersectionLocator(G4VIntersectionLocator* pLocator );
174 // Change or get the object which calcula 163 // Change or get the object which calculates the exact
175 // intersection point with the next bound 164 // intersection point with the next boundary
176 165
177 inline G4int GetIterationsToIncreaseChordDi 166 inline G4int GetIterationsToIncreaseChordDistance() const;
178 inline void SetIterationsToIncreaseChordDi 167 inline void SetIterationsToIncreaseChordDistance(G4int numIters);
179 // Control the parameter which enables th 168 // Control the parameter which enables the temporary 'relaxation'
180 // which ensures that chord segments ar 169 // which ensures that chord segments are short enough so that
181 // their sagitta is small than delta-ch 170 // their sagitta is small than delta-chord parameter.
182 // The Set method increases the value of 171 // The Set method increases the value of delta-chord temporarily,
183 // doubling it once the number of itera 172 // doubling it once the number of iterations substeps reach
184 // value of 'IncreaseChordDistanceThres 173 // value of 'IncreaseChordDistanceThreshold'. It is also doubled
185 // again every time the iteration count 174 // again every time the iteration count reaches a multiple of this
186 // value. 175 // value.
187 // Note: delta-chord is reset to its orig 176 // Note: delta-chord is reset to its original value at the end of
188 // each call to ComputeStep. 177 // each call to ComputeStep.
189 178
190 public: // without description 179 public: // without description
191 180
192 inline G4double GetDeltaIntersection() cons 181 inline G4double GetDeltaIntersection() const;
193 inline G4double GetDeltaOneStep() const; 182 inline G4double GetDeltaOneStep() const;
194 183
195 inline G4FieldManager* GetCurrentFieldManag 184 inline G4FieldManager* GetCurrentFieldManager();
196 inline G4EquationOfMotion* GetCurrentEquati 185 inline G4EquationOfMotion* GetCurrentEquationOfMotion();
197 // Auxiliary methods - their results can 186 // Auxiliary methods - their results can/will change during propagation
198 187
199 inline void SetNavigatorForPropagating(G4Na 188 inline void SetNavigatorForPropagating(G4Navigator* SimpleOrMultiNavigator);
200 inline G4Navigator* GetNavigatorForPropagat 189 inline G4Navigator* GetNavigatorForPropagating();
201 190
202 inline void SetThresholdNoZeroStep( G4int n 191 inline void SetThresholdNoZeroStep( G4int noAct,
203 G4int n 192 G4int noHarsh,
204 G4int n 193 G4int noAbandon );
205 inline G4int GetThresholdNoZeroSteps( G4int 194 inline G4int GetThresholdNoZeroSteps( G4int i );
206 195
207 inline G4double GetZeroStepThreshold(); 196 inline G4double GetZeroStepThreshold();
208 inline void SetZeroStepThreshold( G4dou 197 inline void SetZeroStepThreshold( G4double newLength );
209 198
210 void RefreshIntersectionLocator(); 199 void RefreshIntersectionLocator();
211 // Update the Locator with parameters fro 200 // Update the Locator with parameters from this class
212 // and from current field manager 201 // and from current field manager
213 202
214 protected: // without description 203 protected: // without description
215 204
216 void PrintStepLengthDiagnostic( G4double 205 void PrintStepLengthDiagnostic( G4double currentProposedStepLength,
217 G4double 206 G4double decreaseFactor,
218 G4double 207 G4double stepTrial,
219 const G4FieldTrac 208 const G4FieldTrack& aFieldTrack);
220 209
221 void ReportLoopingParticle( G4int count, G 210 void ReportLoopingParticle( G4int count, G4double StepTaken,
222 G4double stepRe 211 G4double stepRequest, const char* methodName,
223 const G4ThreeVe << 212 G4ThreeVector momentumVec,
224 G4VPhysicalVolu 213 G4VPhysicalVolume* physVol);
225 void ReportStuckParticle(G4int noZeroSteps, 214 void ReportStuckParticle(G4int noZeroSteps, G4double proposedStep,
226 G4double lastTried 215 G4double lastTriedStep, G4VPhysicalVolume* physVol);
227 216
228 private: 217 private:
229 218
230 // ---------------------------------------- 219 // ----------------------------------------------------------------------
231 // DATA Members 220 // DATA Members
232 // ---------------------------------------- 221 // ----------------------------------------------------------------------
233 222
234 // ======================================= 223 // ==================================================================
235 // INVARIANTS - Must not change during tra 224 // INVARIANTS - Must not change during tracking
236 225
237 // ** PARAMETERS ----------- 226 // ** PARAMETERS -----------
238 G4int fMax_loop_count = 1000; 227 G4int fMax_loop_count = 1000;
239 // Limit for the number of sub-steps take 228 // Limit for the number of sub-steps taken in one call to ComputeStep
240 G4int fIncreaseChordDistanceThreshold = 100 229 G4int fIncreaseChordDistanceThreshold = 100;
241 G4bool fUseSafetyForOptimisation = true; 230 G4bool fUseSafetyForOptimisation = true;
242 // (false) is less sensitive to incorrect 231 // (false) is less sensitive to incorrect safety
243 232
244 // Thresholds for identifying "abnormal" c 233 // Thresholds for identifying "abnormal" cases - which cause looping
245 // 234 //
246 G4int fActionThreshold_NoZeroSteps = 2; 235 G4int fActionThreshold_NoZeroSteps = 2; // Threshold # - above it act
247 G4int fSevereActionThreshold_NoZeroSteps = 236 G4int fSevereActionThreshold_NoZeroSteps = 10; // Threshold # to act harshly
248 G4int fAbandonThreshold_NoZeroSteps = 50; 237 G4int fAbandonThreshold_NoZeroSteps = 50; // Threshold # to abandon
249 G4double fZeroStepThreshold = 0.0; 238 G4double fZeroStepThreshold = 0.0;
250 // Threshold *length* for counting of tin 239 // Threshold *length* for counting of tiny or 'zero' steps
251 << 240
252 // Parameters related to handling of very l <<
253 // occur typically in large volumes with <<
254 G4double fLargestAcceptableStep; 241 G4double fLargestAcceptableStep;
255 // Maximum size of a step - for optimizat 242 // Maximum size of a step - for optimization (and to avoid problems)
256 G4double fMaxStepSizeMultiplier = 3; <<
257 // Multiplier for directional exit distan <<
258 G4double fMinBigDistance= 100. ; // * CLHEP <<
259 // Minimum distance added to directional <<
260 // ** End of PARAMETERS ----- 243 // ** End of PARAMETERS -----
261 244
262 G4double kCarTolerance; 245 G4double kCarTolerance;
263 // Geometrical tolerance defining surfa 246 // Geometrical tolerance defining surface thickness
264 247
265 G4bool fAllocatedLocator; 248 G4bool fAllocatedLocator; // Book-keeping
266 249
267 // --------------------------------------- 250 // --------------------------------------------------------
268 // ** Dependent Objects - to which work is 251 // ** Dependent Objects - to which work is delegated
269 252
270 G4FieldManager* fDetectorFieldMgr; 253 G4FieldManager* fDetectorFieldMgr;
271 // The Field Manager of the whole Dete 254 // The Field Manager of the whole Detector. (default)
272 255
273 G4VIntersectionLocator* fIntersectionLocato 256 G4VIntersectionLocator* fIntersectionLocator;
274 // Refines candidate intersection 257 // Refines candidate intersection
275 258
276 G4VCurvedTrajectoryFilter* fpTrajectoryFilt 259 G4VCurvedTrajectoryFilter* fpTrajectoryFilter = nullptr;
277 // The filter encapsulates the algorithm 260 // The filter encapsulates the algorithm which selects which
278 // intermediate points should be stored i 261 // intermediate points should be stored in a trajectory.
279 // When it is NULL, no intermediate point 262 // When it is NULL, no intermediate points will be stored.
280 // Else PIF::ComputeStep must submit (all 263 // Else PIF::ComputeStep must submit (all) intermediate
281 // points it calculates, to this filter. 264 // points it calculates, to this filter. (jacek 04/11/2002)
282 265
283 G4Navigator* fNavigator; 266 G4Navigator* fNavigator;
284 // Set externally - only by tracking / ru 267 // Set externally - only by tracking / run manager
285 // 268 //
286 // ** End of Dependent Objects ----------- 269 // ** End of Dependent Objects ----------------------------
287 270
288 // End of INVARIANTS 271 // End of INVARIANTS
289 // ======================================= 272 // ==================================================================
290 273
291 // STATE information 274 // STATE information
292 // ----------------- 275 // -----------------
293 G4FieldManager* fCurrentFieldMgr; 276 G4FieldManager* fCurrentFieldMgr;
294 // The Field Manager of the current volu 277 // The Field Manager of the current volume (may be the global)
295 G4bool fSetFieldMgr = false; // Has it bee 278 G4bool fSetFieldMgr = false; // Has it been set for the current step?
296 279
297 // Parameters of current step 280 // Parameters of current step
298 G4double fEpsilonStep; // Relati 281 G4double fEpsilonStep; // Relative accuracy of current Step
299 G4FieldTrack End_PointAndTangent; // End po 282 G4FieldTrack End_PointAndTangent; // End point storage
300 G4bool fParticleIsLooping = false; 283 G4bool fParticleIsLooping = false;
301 G4int fNoZeroStep = 0; // Count 284 G4int fNoZeroStep = 0; // Count of zero Steps
302 285
303 // State used for Optimisation 286 // State used for Optimisation
304 G4double fFull_CurveLen_of_LastAttempt = -1 287 G4double fFull_CurveLen_of_LastAttempt = -1;
305 G4double fLast_ProposedStepLength = -1; 288 G4double fLast_ProposedStepLength = -1;
306 // Previous step information -- for use i 289 // Previous step information -- for use in adjust step size
307 G4ThreeVector fPreviousSftOrigin; 290 G4ThreeVector fPreviousSftOrigin;
308 G4double fPreviousSafety = 0.0; 291 G4double fPreviousSafety = 0.0;
309 // Last safety origin & value: for optimi 292 // Last safety origin & value: for optimisation
310 293
311 G4int fVerboseLevel = 0; 294 G4int fVerboseLevel = 0;
312 G4bool fVerbTracePiF = false; 295 G4bool fVerbTracePiF = false;
313 G4bool fCheck = false; <<
314 // For debugging purposes 296 // For debugging purposes
315 297
316 G4bool fFirstStepInVolume = true; 298 G4bool fFirstStepInVolume = true;
317 G4bool fLastStepInVolume = true; 299 G4bool fLastStepInVolume = true;
318 G4bool fNewTrack = true; 300 G4bool fNewTrack = true;
319 }; 301 };
320 302
321 // Inline methods 303 // Inline methods
322 // 304 //
323 #include "G4PropagatorInField.icc" 305 #include "G4PropagatorInField.icc"
324 306
325 #endif 307 #endif
326 308