| 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 analysis/AnaEx02/src/HistoManager.cc 26 /// \file analysis/AnaEx02/src/HistoManager.cc
27 /// \brief Implementation of the HistoManager 27 /// \brief Implementation of the HistoManager 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 #include "HistoManager.hh" << 33 #include <TH1D.h>
>> 34 #include <TFile.h>
>> 35 #include <TTree.h>
>> 36 #include <CLHEP/Units/SystemOfUnits.h>
34 37
>> 38 #include "HistoManager.hh"
35 #include "G4UnitsTable.hh" 39 #include "G4UnitsTable.hh"
36 40
37 #include <CLHEP/Units/SystemOfUnits.h> << 41 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
38 #include <TFile.h> << 42
39 #include <TH1D.h> << 43 HistoManager::HistoManager()
40 #include <TTree.h> << 44 :fRootFile(0),
>> 45 fNtuple1(0), fNtuple2(0),
>> 46 fEabs(0.), fEgap(0.) ,fLabs(0.), fLgap(0.)
>> 47 {
>> 48
>> 49 // histograms
>> 50 for (G4int k=0; k<kMaxHisto; k++) fHisto[k] = 0;
>> 51
>> 52 // ntuple
>> 53 fNtuple1 = 0;
>> 54 fNtuple2 = 0;
>> 55 }
41 56
42 //....oooOO0OOooo........oooOO0OOooo........oo 57 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
43 58
44 HistoManager::~HistoManager() 59 HistoManager::~HistoManager()
45 { 60 {
46 delete fRootFile; << 61 if (fRootFile) delete fRootFile;
47 } 62 }
48 63
49 //....oooOO0OOooo........oooOO0OOooo........oo 64 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
50 65
51 void HistoManager::Book() 66 void HistoManager::Book()
52 { << 67 {
53 // Creating a tree container to handle histo 68 // Creating a tree container to handle histograms and ntuples.
54 // This tree is associated to an output file 69 // This tree is associated to an output file.
55 // 70 //
56 G4String fileName = "AnaEx02.root"; 71 G4String fileName = "AnaEx02.root";
57 fRootFile = new TFile(fileName, "RECREATE"); << 72 fRootFile = new TFile(fileName,"RECREATE");
58 if (fRootFile == nullptr) { << 73 if (! fRootFile) {
59 G4cout << " HistoManager::Book :" << 74 G4cout << " HistoManager::Book :"
60 << " problem creating the ROOT TFil << 75 << " problem creating the ROOT TFile "
>> 76 << G4endl;
61 return; 77 return;
62 } 78 }
63 << 79
64 // id = 0 80 // id = 0
65 fHisto[0] = new TH1D("EAbs", "Edep in absorb << 81 fHisto[0] = new TH1D("EAbs", "Edep in absorber (MeV)", 100, 0., 800*CLHEP::MeV);
66 // id = 1 82 // id = 1
67 fHisto[1] = new TH1D("EGap", "Edep in gap (M << 83 fHisto[1] = new TH1D("EGap", "Edep in gap (MeV)", 100, 0., 100*CLHEP::MeV);
68 // id = 2 84 // id = 2
69 fHisto[2] = new TH1D("LAbs", "trackL in abso << 85 fHisto[2] = new TH1D("LAbs", "trackL in absorber (mm)", 100, 0., 1*CLHEP::m);
70 // id = 3 86 // id = 3
71 fHisto[3] = new TH1D("LGap", "trackL in gap << 87 fHisto[3] = new TH1D("LGap", "trackL in gap (mm)", 100, 0., 50*CLHEP::cm);
72 88
73 for (G4int i = 0; i < kMaxHisto; ++i) { << 89 for ( G4int i=0; i<kMaxHisto; ++i ) {
74 if (fHisto[i] == nullptr) { << 90 if (! fHisto[i]) G4cout << "\n can't create histo " << i << G4endl;
75 G4cout << "\n can't create histo " << i << 91 }
76 } <<
77 } <<
78 92
79 // create 1st ntuple 93 // create 1st ntuple
80 fNtuple1 = new TTree("Ntuple1", "Edep"); 94 fNtuple1 = new TTree("Ntuple1", "Edep");
81 fNtuple1->Branch("Eabs", &fEabs, "Eabs/D"); 95 fNtuple1->Branch("Eabs", &fEabs, "Eabs/D");
82 fNtuple1->Branch("Egap", &fEgap, "Egap/D"); 96 fNtuple1->Branch("Egap", &fEgap, "Egap/D");
83 97
84 // create 2nd ntuple << 98 // create 2nd ntuple
85 fNtuple2 = new TTree("Ntuple2", "TrackL"); 99 fNtuple2 = new TTree("Ntuple2", "TrackL");
86 fNtuple2->Branch("Labs", &fLabs, "Labs/D"); 100 fNtuple2->Branch("Labs", &fLabs, "Labs/D");
87 fNtuple2->Branch("Lgap", &fLgap, "Lgap/D"); 101 fNtuple2->Branch("Lgap", &fLgap, "Lgap/D");
88 << 102
89 G4cout << "\n----> Output file is open in " 103 G4cout << "\n----> Output file is open in " << fileName << G4endl;
90 } 104 }
91 105
92 //....oooOO0OOooo........oooOO0OOooo........oo 106 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
93 107
94 void HistoManager::Save() 108 void HistoManager::Save()
95 { << 109 {
96 if (fRootFile == nullptr) { << 110 if (! fRootFile) return;
97 return; << 111
98 } << 112 fRootFile->Write(); // Writing the histograms to the file
99 << 113 fRootFile->Close(); // and closing the tree (and the file)
100 fRootFile->Write(); // Writing the histogra << 114
101 fRootFile->Close(); // and closing the tree <<
102 <<
103 G4cout << "\n----> Histograms and ntuples ar 115 G4cout << "\n----> Histograms and ntuples are saved\n" << G4endl;
104 } 116 }
105 117
106 //....oooOO0OOooo........oooOO0OOooo........oo 118 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
107 119
108 void HistoManager::FillHisto(G4int ih, G4doubl 120 void HistoManager::FillHisto(G4int ih, G4double xbin, G4double weight)
109 { 121 {
110 if (ih >= kMaxHisto) { 122 if (ih >= kMaxHisto) {
111 G4cerr << "---> warning from HistoManager: 123 G4cerr << "---> warning from HistoManager::FillHisto() : histo " << ih
112 << " does not exist. (xbin=" << xbi << 124 << " does not exist. (xbin=" << xbin << " weight=" << weight << ")"
>> 125 << G4endl;
113 return; 126 return;
114 } 127 }
115 if (fHisto[ih] != nullptr) { << 128 if (fHisto[ih]) { fHisto[ih]->Fill(xbin, weight); }
116 fHisto[ih]->Fill(xbin, weight); <<
117 } <<
118 } 129 }
119 130
120 //....oooOO0OOooo........oooOO0OOooo........oo 131 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
121 132
122 void HistoManager::Normalize(G4int ih, G4doubl 133 void HistoManager::Normalize(G4int ih, G4double fac)
123 { 134 {
124 if (ih >= kMaxHisto) { 135 if (ih >= kMaxHisto) {
125 G4cout << "---> warning from HistoManager: 136 G4cout << "---> warning from HistoManager::Normalize() : histo " << ih
126 << " does not exist. (fac=" << fac 137 << " does not exist. (fac=" << fac << ")" << G4endl;
127 return; 138 return;
128 } 139 }
129 if (fHisto[ih] != nullptr) { << 140 if (fHisto[ih]) fHisto[ih]->Scale(fac);
130 fHisto[ih]->Scale(fac); <<
131 } <<
132 } 141 }
133 142
134 //....oooOO0OOooo........oooOO0OOooo........oo 143 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
135 144
136 void HistoManager::FillNtuple(G4double energyA << 145 void HistoManager::FillNtuple(G4double energyAbs, G4double energyGap,
137 G4double trackLG << 146 G4double trackLAbs , G4double trackLGap )
138 { 147 {
139 fEabs = energyAbs; 148 fEabs = energyAbs;
140 fEgap = energyGap; 149 fEgap = energyGap;
141 fLabs = trackLAbs; 150 fLabs = trackLAbs;
142 fLgap = trackLGap; 151 fLgap = trackLGap;
143 152
144 if (fNtuple1 != nullptr) { << 153 if (fNtuple1) fNtuple1->Fill();
145 fNtuple1->Fill(); << 154 if (fNtuple2) fNtuple2->Fill();
146 } <<
147 if (fNtuple2 != nullptr) { <<
148 fNtuple2->Fill(); <<
149 } <<
150 } 155 }
151 156
152 //....oooOO0OOooo........oooOO0OOooo........oo 157 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
153 158
154 void HistoManager::PrintStatistic() 159 void HistoManager::PrintStatistic()
155 { 160 {
156 G4cout << "\n ----> print histograms statist 161 G4cout << "\n ----> print histograms statistic \n" << G4endl;
157 for (auto h1 : fHisto) { << 162 for ( G4int i=0; i<kMaxHisto; ++i ) {
158 const G4String name = h1->GetName(); << 163 TH1D* h1 = fHisto[i];
>> 164 const G4String name = h1->GetName();
159 165
160 G4String unitCategory; 166 G4String unitCategory;
161 if (name[0] == 'E') { << 167 if (name[0] == 'E' ) unitCategory = "Energy";
162 unitCategory = "Energy"; << 168 if (name[0] == 'L' ) unitCategory = "Length";
163 } <<
164 if (name[0] == 'L') { <<
165 unitCategory = "Length"; <<
166 } <<
167 169
168 G4cout << name << ": mean = " << G4BestUni << 170 G4cout << name
169 << " rms = " << G4BestUnit(h1->GetR << 171 << ": mean = " << G4BestUnit(h1->GetMean(), unitCategory)
>> 172 << " rms = " << G4BestUnit(h1->GetRMS(), unitCategory )
>> 173 << G4endl;
170 } 174 }
171 } 175 }
172 176
173 //....oooOO0OOooo........oooOO0OOooo........oo 177 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
174 178