| Geant4 Cross Reference |
1 // 1
2 // *******************************************
3 // * License and Disclaimer
4 // *
5 // * The Geant4 software is copyright of th
6 // * the Geant4 Collaboration. It is provided
7 // * conditions of the Geant4 Software License
8 // * LICENSE and available at http://cern.ch/
9 // * include a list of copyright holders.
10 // *
11 // * Neither the authors of this software syst
12 // * institutes,nor the agencies providing fin
13 // * work make any representation or warran
14 // * regarding this software system or assum
15 // * use. Please see the license in the file
16 // * for the full disclaimer and the limitatio
17 // *
18 // * This code implementation is the result
19 // * technical work of the GEANT4 collaboratio
20 // * By using, copying, modifying or distri
21 // * any work based on the software) you ag
22 // * use in resulting scientific publicati
23 // * acceptance of all terms of the Geant4 Sof
24 // *******************************************
25 //
26
27 // Author: Ivana Hrivnacova, 10/08/2022 (ivan
28
29 #include "G4THnToolsManager.hh"
30
31 #include "tools/histo/h2d"
32
33 using namespace G4Analysis;
34
35 #include <fstream>
36
37 // Specialization for H2 type
38
39
40 //____________________________________________
41 template <>
42 tools::histo::h2d* G4THnToolsManager<kDim2, to
43 const G4String& title,
44 const std::array<G4HnDimension, kDim2>& bins
45 const std::array<G4HnDimensionInformation, k
46 {
47 // Apply hn information to bins
48 auto newXBins(bins[kX]);
49 Update(newXBins, hnInfo[kX]);
50 auto newYBins(bins[kY]);
51 Update(newYBins, hnInfo[kY]);
52
53 if ((hnInfo[kX].fBinScheme == G4BinScheme::k
54 (hnInfo[kY].fBinScheme == G4BinScheme::k
55 return new tools::histo::h2d(title,
56 newXBins.fNBi
57 newYBins.fNBi
58 }
59
60 return new tools::histo::h2d(title, newXBins
61 }
62
63 //____________________________________________
64 template <>
65 void G4THnToolsManager<kDim2, tools::histo::h2
66 tools::histo::h2d* ht,
67 const std::array<G4HnDimension, kDim2>& bins
68 const std::array<G4HnDimensionInformation, k
69 {
70 // Apply hn information to bins
71 auto newXBins(bins[kX]);
72 Update(newXBins, hnInfo[kX]);
73 auto newYBins(bins[kY]);
74 Update(newYBins, hnInfo[kY]);
75
76 if ((hnInfo[kX].fBinScheme == G4BinScheme::k
77 (hnInfo[kY].fBinScheme == G4BinScheme::k
78 ht->configure(
79 newXBins.fNBins, newXBins.fMinValue,
80 newYBins.fNBins, newYBins.fMinValue,
81 return;
82 }
83
84 ht->configure(newXBins.fEdges, newYBins.fEdg
85 }
86
87 //____________________________________________
88 template <>
89 G4bool G4THnToolsManager<kDim2, tools::histo::
90 tools::histo::h2d* ht, const G4HnInformation
91 std::array<G4double, kDim2>& value, G4double
92 {
93 const auto& xInfo = hnInformation.GetHnDimen
94 const auto& yInfo = hnInformation.GetHnDimen
95
96 // Apply hn information to value
97 Update(value[kX], xInfo);
98 Update(value[kY], yInfo);
99
100 // Fill updated value
101 ht->fill(value[kX], value[kY], weight);
102
103 return true;
104 }
105
106 //____________________________________________
107 template <>
108 G4bool G4THnToolsManager<kDim2, tools::histo::
109 std::ofstream& output)
110 {
111 // Write selected objects on ASCII file
112 // According to the implementation by Michel M
113 // extended examples.
114
115 // Do nothing if no histograms are selected
116 if ( ! GetHnManager()->IsAscii() ) return tr
117
118 // Write h2 histograms
119 auto id = GetHnManager()->GetFirstId();
120 for (const auto& [h2, info] : *GetTHnVector(
121
122 if ( (h2 == nullptr) || (! info->GetAscii(
123 // skip writing
124 // if h2 was deleted or writing ascii is
125 id++;
126 continue;
127 }
128
129 Message(kVL3, "write on ascii", "h2d", inf
130
131 output << "\n 2D histogram " << id++ << "
132 << "\n \n \t \t X \t\t Y \t
133
134 for (G4int j=0; j< G4int(h2->axis_x().bins
135 for (G4int k=0; k< G4int(h2->axis_y().bi
136 output << " " << j << "\t" << k << "\
137 << h2->axis_x().bin_center(j) <
138 << h2->axis_y().bin_center(k) <
139 << h2->bin_height(j, k) << G4en
140 }
141 }
142 }
143
144 return output.good();
145 }
146