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 // 28 // 29 // ------------------------------------------- 29 // -------------------------------------------------------------- 30 // GEANT 4 class implementation file 30 // GEANT 4 class implementation file 31 // 31 // 32 // History: first implementation, based on ob 32 // History: first implementation, based on object model of 33 // 2nd December 1995, G.Cosmo 33 // 2nd December 1995, G.Cosmo 34 // ------------------------------------------- 34 // -------------------------------------------------------------- 35 // 15 April 1998 M.Maire 35 // 15 April 1998 M.Maire 36 // ------------------------------------------- 36 // -------------------------------------------------------------- 37 37 38 #include "DMXMinEkineCuts.hh" 38 #include "DMXMinEkineCuts.hh" 39 39 40 #include "G4Step.hh" 40 #include "G4Step.hh" 41 #include "G4UserLimits.hh" 41 #include "G4UserLimits.hh" 42 #include "G4VParticleChange.hh" 42 #include "G4VParticleChange.hh" 43 #include "G4LossTableManager.hh" 43 #include "G4LossTableManager.hh" 44 44 45 DMXMinEkineCuts::DMXMinEkineCuts(const G4Strin 45 DMXMinEkineCuts::DMXMinEkineCuts(const G4String& aName) 46 : DMXSpecialCuts(aName) 46 : DMXSpecialCuts(aName) 47 { 47 { 48 if (verboseLevel>1) { 48 if (verboseLevel>1) { 49 G4cout << GetProcessName() << " is created 49 G4cout << GetProcessName() << " is created "<< G4endl; 50 } 50 } 51 SetProcessType(fUserDefined); 51 SetProcessType(fUserDefined); 52 } 52 } 53 53 54 DMXMinEkineCuts::~DMXMinEkineCuts() 54 DMXMinEkineCuts::~DMXMinEkineCuts() 55 {} 55 {} 56 56 57 DMXMinEkineCuts::DMXMinEkineCuts(DMXMinEkineCu 57 DMXMinEkineCuts::DMXMinEkineCuts(DMXMinEkineCuts&) 58 : DMXSpecialCuts() 58 : DMXSpecialCuts() 59 {} 59 {} 60 60 61 61 62 G4double DMXMinEkineCuts::PostStepGetPhysicalI 62 G4double DMXMinEkineCuts::PostStepGetPhysicalInteractionLength( 63 const G4Track& aT 63 const G4Track& aTrack, 64 G4double , 64 G4double , 65 G4ForceCondition* condition) 65 G4ForceCondition* condition) 66 { 66 { 67 // condition is set to "Not Forced" 67 // condition is set to "Not Forced" 68 *condition = NotForced; 68 *condition = NotForced; 69 69 70 G4double proposedStep = DBL_MAX; 70 G4double proposedStep = DBL_MAX; 71 // get the pointer to UserLimits 71 // get the pointer to UserLimits 72 G4UserLimits* pUserLimits = aTrack.GetVolume 72 G4UserLimits* pUserLimits = aTrack.GetVolume()->GetLogicalVolume()->GetUserLimits(); 73 const G4DynamicParticle* aParticle = aTrack. 73 const G4DynamicParticle* aParticle = aTrack.GetDynamicParticle(); 74 G4ParticleDefinition* aParticleDef = aTrack. 74 G4ParticleDefinition* aParticleDef = aTrack.GetDefinition(); 75 75 76 if (pUserLimits && aParticleDef->GetPDGCharg 76 if (pUserLimits && aParticleDef->GetPDGCharge() != 0.0) { 77 //min kinetic energy 77 //min kinetic energy 78 G4double temp = DBL_MAX; 78 G4double temp = DBL_MAX; 79 G4double eKine = aParticle->GetKine 79 G4double eKine = aParticle->GetKineticEnergy(); 80 const G4MaterialCutsCouple* couple = aTrac 80 const G4MaterialCutsCouple* couple = aTrack.GetMaterialCutsCouple(); 81 G4double eMin = pUserLimits->GetUserMinEki 81 G4double eMin = pUserLimits->GetUserMinEkine(aTrack); 82 82 83 if (eKine < eMin) 83 if (eKine < eMin) 84 return 0.; 84 return 0.; 85 85 86 G4double rangeNow = DBL_MAX; 86 G4double rangeNow = DBL_MAX; 87 87 88 G4LossTableManager* lossManager = G4LossTa 88 G4LossTableManager* lossManager = G4LossTableManager::Instance(); 89 rangeNow = lossManager->GetRange(aParticle 89 rangeNow = lossManager->GetRange(aParticleDef,eKine,couple); 90 90 91 // charged particles only 91 // charged particles only 92 G4double rangeMin = lossManager->GetRange( 92 G4double rangeMin = lossManager->GetRange(aParticleDef,eMin,couple); 93 temp = rangeNow - rangeMin; 93 temp = rangeNow - rangeMin; 94 if (proposedStep > temp) proposedStep = te 94 if (proposedStep > temp) proposedStep = temp; 95 } 95 } 96 return proposedStep; 96 return proposedStep; 97 } 97 } 98 98