| 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 /// \file electromagnetic/TestEm2/include/Run. 26 /// \file electromagnetic/TestEm2/include/Run.hh
27 /// \brief Definition of the Run class 27 /// \brief Definition of the Run class
28 // 28 //
29 // 29 //
30 //....oooOO0OOooo........oooOO0OOooo........oo 30 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
31 //....oooOO0OOooo........oooOO0OOooo........oo 31 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
32 32
33 #ifndef Run_h 33 #ifndef Run_h
34 #define Run_h 1 34 #define Run_h 1
35 35
36 #include "DetectorConstruction.hh" <<
37 <<
38 #include "G4AnalysisManager.hh" <<
39 #include "G4Run.hh" 36 #include "G4Run.hh"
>> 37 #include "G4AnalysisManager.hh"
40 38
41 #include <vector> 39 #include <vector>
42 typedef std::vector<G4double> MyVector; 40 typedef std::vector<G4double> MyVector;
43 41
44 //....oooOO0OOooo........oooOO0OOooo........oo 42 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
45 43
46 class DetectorConstruction; 44 class DetectorConstruction;
47 class PrimaryGeneratorAction; 45 class PrimaryGeneratorAction;
48 46
49 //....oooOO0OOooo........oooOO0OOooo........oo 47 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
50 48
51 class Run : public G4Run 49 class Run : public G4Run
52 { 50 {
53 public: << 51 public:
54 Run(DetectorConstruction*, PrimaryGenerato <<
55 ~Run() override = default; <<
56 52
57 void Merge(const G4Run*) override; << 53 Run(DetectorConstruction*, PrimaryGeneratorAction*);
>> 54 virtual ~Run();
58 55
59 void InitializePerEvent(); << 56 virtual void Merge(const G4Run*);
60 void FillPerEvent(); <<
61 57
62 inline void FillPerTrack(G4double, G4doubl << 58 void InitializePerEvent();
63 inline void FillPerStep(G4double, G4int, G << 59 void FillPerEvent();
64 60
65 inline void AddStep(G4double q); << 61 inline void FillPerTrack(G4double,G4double);
>> 62 inline void FillPerStep (G4double,G4int,G4int);
66 63
67 void EndOfRun(G4double edep, G4double rms, << 64 inline void AddStep(G4double q);
68 65
69 inline void SetVerbose(G4int val) { fVerbo << 66 void EndOfRun(G4double edep, G4double rms, G4double& limit);
70 67
71 private: << 68 inline void SetVerbose(G4int val) {fVerbose = val;};
72 void Reset(); << 69
>> 70 private:
>> 71 void Reset();
73 72
74 DetectorConstruction* fDet = nullptr; << 73 DetectorConstruction* fDet;
75 PrimaryGeneratorAction* fKin = nullptr; << 74 PrimaryGeneratorAction* fKin;
>> 75
>> 76 G4int f_nLbin;
>> 77 MyVector f_dEdL;
>> 78 MyVector fSumELongit;
>> 79 MyVector fSumE2Longit;
>> 80 MyVector fSumELongitCumul;
>> 81 MyVector fSumE2LongitCumul;
76 82
77 G4int f_nLbin = kMaxBin; << 83 G4int f_nRbin;
78 MyVector f_dEdL; << 84 MyVector f_dEdR;
79 MyVector fSumELongit; << 85 MyVector fSumERadial;
80 MyVector fSumE2Longit; << 86 MyVector fSumE2Radial;
81 MyVector fSumELongitCumul; << 87 MyVector fSumERadialCumul;
82 MyVector fSumE2LongitCumul; << 88 MyVector fSumE2RadialCumul;
83 89
84 G4int f_nRbin = kMaxBin; << 90 G4double fChargTrLength;
85 MyVector f_dEdR; << 91 G4double fSumChargTrLength;
86 MyVector fSumERadial; << 92 G4double fSum2ChargTrLength;
87 MyVector fSumE2Radial; <<
88 MyVector fSumERadialCumul; <<
89 MyVector fSumE2RadialCumul; <<
90 93
91 G4double fChargTrLength = 0.; << 94 G4double fNeutrTrLength;
92 G4double fSumChargTrLength = 0.; << 95 G4double fSumNeutrTrLength;
93 G4double fSum2ChargTrLength = 0.; << 96 G4double fSum2NeutrTrLength;
94 97
95 G4double fNeutrTrLength = 0.; << 98 G4double fChargedStep;
96 G4double fSumNeutrTrLength = 0.; << 99 G4double fNeutralStep;
97 G4double fSum2NeutrTrLength = 0.; <<
98 100
99 G4double fChargedStep = 0.; << 101 G4int fVerbose;
100 G4double fNeutralStep = 0.; <<
101 <<
102 G4int fVerbose = 0; <<
103 }; 102 };
104 103
105 //....oooOO0OOooo........oooOO0OOooo........oo 104 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
106 105
107 inline void Run::FillPerTrack(G4double charge, << 106 inline
>> 107 void Run::FillPerTrack(G4double charge, G4double trkLength)
108 { 108 {
109 if (charge != 0.) << 109 if (charge != 0.) fChargTrLength += trkLength;
110 fChargTrLength += trkLength; << 110 else fNeutrTrLength += trkLength;
111 else <<
112 fNeutrTrLength += trkLength; <<
113 } 111 }
114 112
115 //....oooOO0OOooo........oooOO0OOooo........oo 113 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
116 114
117 inline void Run::FillPerStep(G4double dEstep, << 115 inline
>> 116 void Run::FillPerStep(G4double dEstep, G4int Lbin, G4int Rbin)
118 { 117 {
119 f_dEdL[Lbin] += dEstep; << 118 f_dEdL[Lbin] += dEstep; f_dEdR[Rbin] += dEstep;
120 f_dEdR[Rbin] += dEstep; <<
121 } 119 }
122 120
123 //....oooOO0OOooo........oooOO0OOooo........oo 121 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
124 122
125 inline void Run::AddStep(G4double q) 123 inline void Run::AddStep(G4double q)
126 { 124 {
127 if (q == 0.0) { << 125 if (q == 0.0) { fNeutralStep += 1.0; }
128 fNeutralStep += 1.0; << 126 else { fChargedStep += 1.0; }
129 } <<
130 else { <<
131 fChargedStep += 1.0; <<
132 } <<
133 } 127 }
134 << 128
135 //....oooOO0OOooo........oooOO0OOooo........oo 129 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
136 130
137 #endif 131 #endif
>> 132
138 133