| 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 // 26 //
27 // ------------------------------------------- 27 // --------------------------------------------------------------
28 // GEANT 4 - Underground Dark Matter Detecto 28 // GEANT 4 - Underground Dark Matter Detector Advanced Example
29 // 29 //
30 // For information related to this code c 30 // For information related to this code contact: Alex Howard
31 // e-mail: alexander.howard@cern.ch 31 // e-mail: alexander.howard@cern.ch
32 // ------------------------------------------- 32 // --------------------------------------------------------------
33 // Comments 33 // Comments
34 // 34 //
35 // Underground Advanced 35 // Underground Advanced
36 // by A. Howard and H. Araujo 36 // by A. Howard and H. Araujo
37 // (27th November 2001) 37 // (27th November 2001)
38 // 38 //
39 // MaxTimeCuts program 39 // MaxTimeCuts program
40 // ------------------------------------------- 40 // --------------------------------------------------------------
41 41
42 #include "DMXMaxTimeCuts.hh" 42 #include "DMXMaxTimeCuts.hh"
43 43
44 #include "G4PhysicalConstants.hh" <<
45 #include "G4Step.hh" 44 #include "G4Step.hh"
46 #include "G4UserLimits.hh" 45 #include "G4UserLimits.hh"
47 #include "G4VParticleChange.hh" 46 #include "G4VParticleChange.hh"
>> 47 #include "G4EnergyLossTables.hh"
>> 48
48 49
49 DMXMaxTimeCuts::DMXMaxTimeCuts(const G4String& 50 DMXMaxTimeCuts::DMXMaxTimeCuts(const G4String& aName)
50 : DMXSpecialCuts(aName) 51 : DMXSpecialCuts(aName)
51 { 52 {
52 if (verboseLevel>1) { 53 if (verboseLevel>1) {
53 G4cout << GetProcessName() << " is create 54 G4cout << GetProcessName() << " is created "<< G4endl;
54 } 55 }
55 SetProcessType(fUserDefined); 56 SetProcessType(fUserDefined);
56 } 57 }
57 58
58 DMXMaxTimeCuts::~DMXMaxTimeCuts() 59 DMXMaxTimeCuts::~DMXMaxTimeCuts()
59 {} 60 {}
60 61
61 DMXMaxTimeCuts::DMXMaxTimeCuts(DMXMaxTimeCuts& 62 DMXMaxTimeCuts::DMXMaxTimeCuts(DMXMaxTimeCuts&)
62 : DMXSpecialCuts() 63 : DMXSpecialCuts()
63 {} 64 {}
64 65
65 66
66 G4double DMXMaxTimeCuts::PostStepGetPhysicalIn 67 G4double DMXMaxTimeCuts::PostStepGetPhysicalInteractionLength(
67 const G4Track& aT 68 const G4Track& aTrack,
68 G4double , 69 G4double ,
69 G4ForceCondition* condition 70 G4ForceCondition* condition
70 ) 71 )
71 { 72 {
72 // condition is set to "Not Forced" 73 // condition is set to "Not Forced"
73 *condition = NotForced; 74 *condition = NotForced;
74 75
75 G4double proposedStep = DBL_MAX; 76 G4double proposedStep = DBL_MAX;
76 // get the pointer to UserLimits 77 // get the pointer to UserLimits
77 G4UserLimits* pUserLimits = aTrack.GetVolum 78 G4UserLimits* pUserLimits = aTrack.GetVolume()->GetLogicalVolume()->GetUserLimits();
78 const G4DynamicParticle* aParticle = aTrack 79 const G4DynamicParticle* aParticle = aTrack.GetDynamicParticle();
79 80
80 // can apply cuts for specific particles - 81 // can apply cuts for specific particles - use if(particleDef):
81 // G4ParticleDefinition* aParticleDef = a 82 // G4ParticleDefinition* aParticleDef = aTrack.GetDefinition();
82 83
83 // G4cout << " Time: " << pUserLimits->Ge 84 // G4cout << " Time: " << pUserLimits->GetUserMaxTime(aTrack) << G4endl;
84 85
85 if (pUserLimits) { 86 if (pUserLimits) {
86 G4double temp = DBL_MAX; 87 G4double temp = DBL_MAX;
87 //max time limit 88 //max time limit
88 G4double dTime= (pUserLimits->GetUserMaxT 89 G4double dTime= (pUserLimits->GetUserMaxTime(aTrack) - aTrack.GetGlobalTime());
89 if (dTime < 0. ) { 90 if (dTime < 0. ) {
90 proposedStep = 0.; 91 proposedStep = 0.;
91 } else { 92 } else {
92 G4double beta = (aParticle->GetTotalMom 93 G4double beta = (aParticle->GetTotalMomentum())/(aParticle->GetTotalEnergy());
93 temp = beta*c_light*dTime; 94 temp = beta*c_light*dTime;
94 if (proposedStep > temp) proposedStep = 95 if (proposedStep > temp) proposedStep = temp;
95 } 96 }
96 97
97 } 98 }
98 return proposedStep; 99 return proposedStep;
99 } 100 }
100 101