| 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 hadronic/Hadr01/include/Histo.hh 26 /// \file hadronic/Hadr01/include/Histo.hh
27 /// \brief Definition of the Histo class 27 /// \brief Definition of the Histo class
28 // 28 //
29 29
30 #ifndef Histo_h 30 #ifndef Histo_h
31 #define Histo_h 1 31 #define Histo_h 1
32 32
33 //-------------------------------------------- 33 //---------------------------------------------------------------------------
34 // 34 //
35 // ClassName: Histo 35 // ClassName: Histo
36 // 36 //
37 // Description: Utility class to hold and mani 37 // Description: Utility class to hold and manipulate histograms/nTuples
38 // 38 //
39 // Author: V.Ivanchenko 30/10/03 39 // Author: V.Ivanchenko 30/10/03
40 // 40 //
41 //-------------------------------------------- 41 //----------------------------------------------------------------------------
42 // 42 //
43 43
44 //....oooOO0OOooo........oooOO0OOooo........oo 44 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
45 45
46 #include "G4DataVector.hh" <<
47 #include "globals.hh" 46 #include "globals.hh"
48 << 47 #include "G4DataVector.hh"
49 #include <vector> 48 #include <vector>
50 49
51 //....oooOO0OOooo........oooOO0OOooo........oo 50 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
52 51
53 class G4RootAnalysisManager; 52 class G4RootAnalysisManager;
54 class HistoMessenger; 53 class HistoMessenger;
55 54
56 class Histo 55 class Histo
57 { 56 {
58 public: << 57 public:
59 Histo(); << 58
>> 59 Histo();
>> 60
>> 61 ~Histo();
60 62
61 ~Histo(); << 63 // Book predefined histogramms
>> 64 void Book();
62 65
63 // Book predefined histogramms << 66 // Save histogramms to file
64 void Book(); << 67 void Save();
>> 68
>> 69 // In this method 1-D histogramms are predefined
>> 70 void Add1D(const G4String&, const G4String&, G4int nb, G4double x1,
>> 71 G4double x2, G4double u=1.);
>> 72
>> 73 // It change bins and boundaries
>> 74 void SetHisto1D(G4int, G4int, G4double, G4double, G4double);
>> 75
>> 76 // Histogram activation/deactivation
>> 77 void Activate(G4int, G4bool);
>> 78
>> 79 // Histogramms are filled
>> 80 void Fill(G4int, G4double, G4double);
>> 81
>> 82 // Histogramms are scaled
>> 83 void ScaleH1(G4int, G4double);
>> 84
>> 85 // In this method nTuple is booked
>> 86 void AddTuple(const G4String&);
>> 87
>> 88 // In this method nTuple is booked
>> 89 void AddTupleI(const G4String&);
>> 90 void AddTupleF(const G4String&);
>> 91 void AddTupleD(const G4String&);
>> 92
>> 93 // Fill nTuple parameter
>> 94 void FillTupleI(G4int, G4int);
>> 95 void FillTupleF(G4int, G4float);
>> 96 void FillTupleD(G4int, G4double);
>> 97
>> 98 // Save tuple event
>> 99 void AddRow();
>> 100
>> 101 // Set output file
>> 102 void SetFileName(const G4String&);
>> 103
>> 104 inline void SetVerbose(G4int val) { fVerbose = val; };
>> 105
>> 106 inline G4bool IsActive() const { return fHistoActive; };
>> 107
>> 108 private:
>> 109
>> 110 G4RootAnalysisManager* fManager;
>> 111 HistoMessenger* fMessenger;
>> 112
>> 113 G4String fHistName;
>> 114 G4String fTupleName;
>> 115 G4String fTupleTitle;
>> 116 G4int fNHisto;
>> 117 G4int fVerbose;
>> 118 G4bool fDefaultAct;
>> 119 G4bool fHistoActive;
>> 120 G4bool fNtupleActive;
>> 121
>> 122 std::vector<G4int> fHisto;
>> 123 std::vector<G4int> fTupleI;
>> 124 std::vector<G4int> fTupleF;
>> 125 std::vector<G4int> fTupleD;
>> 126 std::vector<G4int> fBins;
>> 127 std::vector<G4bool> fActive;
>> 128 std::vector<G4double> fXmin;
>> 129 std::vector<G4double> fXmax;
>> 130 std::vector<G4double> fUnit;
>> 131 std::vector<G4String> fIds;
>> 132 std::vector<G4String> fTitles;
>> 133 std::vector<G4String> fNtupleI;
>> 134 std::vector<G4String> fNtupleF;
>> 135 std::vector<G4String> fNtupleD;
65 136
66 // Save histogramms to file <<
67 void Save(); <<
68 <<
69 // In this method 1-D histogramms are pred <<
70 void Add1D(const G4String&, const G4String <<
71 G4double u = 1.); <<
72 <<
73 // It change bins and boundaries <<
74 void SetHisto1D(G4int, G4int, G4double, G4 <<
75 <<
76 // Histogram activation/deactivation <<
77 void Activate(G4int, G4bool); <<
78 <<
79 // Histogramms are filled <<
80 void Fill(G4int, G4double, G4double); <<
81 <<
82 // Histogramms are scaled <<
83 void ScaleH1(G4int, G4double); <<
84 <<
85 // In this method nTuple is booked <<
86 void AddTuple(const G4String&); <<
87 <<
88 // In this method nTuple is booked <<
89 void AddTupleI(const G4String&); <<
90 void AddTupleF(const G4String&); <<
91 void AddTupleD(const G4String&); <<
92 <<
93 // Fill nTuple parameter <<
94 void FillTupleI(G4int, G4int); <<
95 void FillTupleF(G4int, G4float); <<
96 void FillTupleD(G4int, G4double); <<
97 <<
98 // Save tuple event <<
99 void AddRow(); <<
100 <<
101 // Set output file <<
102 void SetFileName(const G4String&); <<
103 <<
104 inline void SetVerbose(G4int val) { fVerbo <<
105 <<
106 inline G4bool IsActive() const { return fH <<
107 <<
108 private: <<
109 G4RootAnalysisManager* fManager; <<
110 HistoMessenger* fMessenger; <<
111 <<
112 G4String fHistName; <<
113 G4String fTupleName; <<
114 G4String fTupleTitle; <<
115 G4int fNHisto; <<
116 G4int fVerbose; <<
117 G4bool fDefaultAct; <<
118 G4bool fHistoActive; <<
119 G4bool fNtupleActive; <<
120 <<
121 std::vector<G4int> fHisto; <<
122 std::vector<G4int> fTupleI; <<
123 std::vector<G4int> fTupleF; <<
124 std::vector<G4int> fTupleD; <<
125 std::vector<G4int> fBins; <<
126 std::vector<G4bool> fActive; <<
127 std::vector<G4double> fXmin; <<
128 std::vector<G4double> fXmax; <<
129 std::vector<G4double> fUnit; <<
130 std::vector<G4String> fIds; <<
131 std::vector<G4String> fTitles; <<
132 std::vector<G4String> fNtupleI; <<
133 std::vector<G4String> fNtupleF; <<
134 std::vector<G4String> fNtupleD; <<
135 }; 137 };
136 138
137 #endif 139 #endif
138 140