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: G4VITRestDiscreteProcess.cc 64057 2012-10-30 15:04:49Z gcosmo $ 26 // 27 // 27 // Author: Mathieu Karamitros (kara (AT) cenbg 28 // Author: Mathieu Karamitros (kara (AT) cenbg . in2p3 . fr) 28 // 29 // 29 // History: 30 // History: 30 // ----------- 31 // ----------- 31 // 10 Oct 2011 M.Karamitros created 32 // 10 Oct 2011 M.Karamitros created 32 // 33 // 33 // ------------------------------------------- 34 // ------------------------------------------------------------------- 34 35 35 #include "G4VITRestDiscreteProcess.hh" << 36 << 37 G4VITRestDiscreteProcess::G4VITRestDiscretePro << 38 << 39 : G4VITProcess(aName, aType) << 40 { << 41 enableAlongStepDoIt = false; << 42 } << 43 36 44 G4VITRestDiscreteProcess::~G4VITRestDiscretePr << 37 #include "G4VITRestDiscreteProcess.hh" 45 << 38 G4VITRestDiscreteProcess::G4VITRestDiscreteProcess() 46 G4double G4VITRestDiscreteProcess::PostStepGet << 39 :G4VITProcess("No Name Discrete Process") 47 << 48 << 49 { 40 { 50 if ((previousStepSize < 0.0) || (fpState-> << 41 G4Exception("G4VITRestDiscreteProcess::G4VITRestDiscreteProcess","Illegal operation", 51 <= 0.0)) << 42 JustWarning,"default constructor is called"); 52 { << 53 // beggining of tracking (or just afte << 54 ResetNumberOfInteractionLengthLeft(); << 55 } << 56 else if (previousStepSize > 0.0) << 57 { << 58 // subtract NumberOfInteractionLengthL << 59 SubtractNumberOfInteractionLengthLeft( << 60 } << 61 else << 62 { << 63 // zero step << 64 // DO NOTHING << 65 } << 66 << 67 // condition is set to "Not Forced" << 68 *condition = NotForced; << 69 << 70 // get mean free path << 71 fpState->currentInteractionLength = GetMea << 72 << 73 << 74 << 75 G4double value; << 76 if (fpState->currentInteractionLength < DB << 77 { << 78 value = fpState->theNumberOfInteractio << 79 } << 80 else << 81 { << 82 value = DBL_MAX; << 83 } << 84 #ifdef G4VERBOSE << 85 if (verboseLevel > 1) << 86 { << 87 G4cout << "G4VITRestDiscreteProcess::P << 88 G4cout << "[ " << GetProcessName() << << 89 track.GetDynamicParticle()->DumpInfo() << 90 G4cout << " in Material " << track.Ge << 91 G4cout << "InteractionLength= " << val << 92 } << 93 #endif << 94 return value; << 95 } 43 } 96 44 97 G4VParticleChange* G4VITRestDiscreteProcess::P << 45 G4VITRestDiscreteProcess::G4VITRestDiscreteProcess(const G4String& aName , G4ProcessType aType) 98 << 46 : G4VITProcess(aName, aType) 99 { 47 { 100 // reset NumberOfInteractionLengthLeft << 48 enableAlongStepDoIt = false; 101 ClearNumberOfInteractionLengthLeft(); << 102 << 103 return pParticleChange; << 104 } 49 } 105 50 106 G4double G4VITRestDiscreteProcess::AtRestGetPh << 51 G4VITRestDiscreteProcess::~G4VITRestDiscreteProcess() 107 << 108 { 52 { 109 // beggining of tracking << 110 ResetNumberOfInteractionLengthLeft(); << 111 << 112 // condition is set to "Not Forced" << 113 *condition = NotForced; << 114 << 115 // get mean life time << 116 fpState->currentInteractionLength = GetMea << 117 << 118 #ifdef G4VERBOSE << 119 if ((fpState->currentInteractionLength < 0 << 120 { << 121 G4cout << "G4VITRestDiscreteProcess::A << 122 G4cout << "[ " << GetProcessName() << << 123 track.GetDynamicParticle()->DumpInfo() << 124 G4cout << " in Material " << track.Ge << 125 G4cout << "MeanLifeTime = " << fpState << 126 << "[ns]" << G4endl; << 127 } << 128 #endif << 129 << 130 return fpState->theNumberOfInteractionLeng << 131 * (fpState->currentInteractionLengt << 132 } 53 } 133 54 134 G4VParticleChange* G4VITRestDiscreteProcess::A << 55 G4VITRestDiscreteProcess::G4VITRestDiscreteProcess(G4VITRestDiscreteProcess& right) 135 << 56 : G4VITProcess(right) 136 { 57 { 137 // clear NumberOfInteractionLengthLeft << 138 ClearNumberOfInteractionLengthLeft(); << 139 << 140 return pParticleChange; << 141 } 58 } 142 << 143 59