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 // Author: Sebastien Incerti << 26 // $Id: G4LivermoreGammaConversionModel.hh,v 1.3 2009-04-17 10:29:20 vnivanch Exp $ 27 // 22 January 2012 << 27 // GEANT4 tag $Name: geant4-09-04-patch-01 $ 28 // on base of G4LivermoreGammaConversi << 29 // and G4LivermoreRayleighModel (MT ve << 30 // 28 // 31 // Modifications: Zhuxin Li@CENBG << 32 // 11 March 2020 << 33 // derives from G4PairProductio << 34 // ------------------------------------------- << 35 29 36 #ifndef G4LivermoreGammaConversionModel_h 30 #ifndef G4LivermoreGammaConversionModel_h 37 #define G4LivermoreGammaConversionModel_h 1 31 #define G4LivermoreGammaConversionModel_h 1 38 32 39 #include "G4PairProductionRelModel.hh" << 33 #include "G4VEmModel.hh" 40 #include "G4Log.hh" << 34 #include "G4Electron.hh" >> 35 #include "G4Positron.hh" >> 36 #include "G4ParticleChangeForGamma.hh" >> 37 #include "G4CrossSectionHandler.hh" >> 38 #include "G4ForceCondition.hh" >> 39 #include "G4CompositeEMDataSet.hh" >> 40 #include "G4Gamma.hh" 41 41 42 class G4ParticleChangeForGamma; << 42 class G4LivermoreGammaConversionModel : public G4VEmModel 43 class G4PhysicsFreeVector; << 44 class G4PhysicsLogVector; << 45 << 46 class G4LivermoreGammaConversionModel : public << 47 { 43 { >> 44 48 public: 45 public: 49 << 46 50 explicit G4LivermoreGammaConversionModel( << 47 G4LivermoreGammaConversionModel(const G4ParticleDefinition* p = 0, 51 const G4ParticleDefinition* p = n << 48 const G4String& nam = "LivermoreConversion"); 52 const G4String& nam = "LivermoreC << 49 53 ~G4LivermoreGammaConversionModel() override; << 50 virtual ~G4LivermoreGammaConversionModel(); 54 << 51 55 void Initialise(const G4ParticleDefinition*, << 52 virtual void Initialise(const G4ParticleDefinition*, const G4DataVector&); 56 const G4DataVector&) overrid << 53 57 void InitialiseForElement(const G4ParticleDe << 54 virtual G4double ComputeCrossSectionPerAtom( 58 G4int Z) ove << 59 G4double ComputeCrossSectionPerAtom( << 60 const G4Partic 55 const G4ParticleDefinition*, 61 G4double 56 G4double kinEnergy, 62 G4double 57 G4double Z, 63 G4double << 58 G4double A=0, 64 G4double << 59 G4double cut=0, 65 G4double << 60 G4double emax=DBL_MAX); 66 G4LivermoreGammaConversionModel & operator= << 61 67 (const G4LivermoreGammaConversionModel &rig << 62 virtual void SampleSecondaries(std::vector<G4DynamicParticle*>*, 68 G4LivermoreGammaConversionModel(const G4Liv << 63 const G4MaterialCutsCouple*, >> 64 const G4DynamicParticle*, >> 65 G4double tmin, >> 66 G4double maxEnergy); 69 67 70 private: << 68 protected: 71 void ReadData(const G4int ZZ); << 72 const G4String& FindDirectoryPath(); << 73 69 74 G4ParticleChangeForGamma* fParticleChange; 70 G4ParticleChangeForGamma* fParticleChange; 75 71 76 static G4PhysicsFreeVector* data[101]; // 10 << 72 G4double GetMeanFreePath(const G4Track& aTrack, 77 static G4String gDataDirectory; << 73 G4double previousStepSize, >> 74 G4ForceCondition* condition); >> 75 private: >> 76 >> 77 const G4double smallEnergy; >> 78 G4double lowEnergyLimit; >> 79 G4double highEnergyLimit; 78 80 79 G4double lowEnergyLimit; << 80 G4int verboseLevel; 81 G4int verboseLevel; 81 G4int maxZ = 100; << 82 G4bool isInitialised; 82 G4bool useSpline = false; << 83 83 G4bool isInitialised = false; << 84 G4double ScreenFunction1(G4double screenVariable); >> 85 G4double ScreenFunction2(G4double screenVariable); >> 86 G4VCrossSectionHandler* crossSectionHandler; >> 87 G4VEMDataSet* meanFreePathTable; >> 88 >> 89 G4LivermoreGammaConversionModel & operator=(const G4LivermoreGammaConversionModel &right); >> 90 G4LivermoreGammaConversionModel(const G4LivermoreGammaConversionModel&); >> 91 >> 92 84 }; 93 }; 85 94 >> 95 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo.... 86 96 87 #endif 97 #endif 88 98