| 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 // G4PhysicsFreeVector class implementation 26 // G4PhysicsFreeVector class implementation
27 // 27 //
28 // Authors: 28 // Authors:
29 // - 02 Dec. 1995, G.Cosmo: Structure created 29 // - 02 Dec. 1995, G.Cosmo: Structure created based on object model
30 // - 06 Jun. 1996, K.Amako: Implemented the 1s 30 // - 06 Jun. 1996, K.Amako: Implemented the 1st version
31 // Revisions: 31 // Revisions:
32 // - 11 Nov. 2000, H.Kurashige: Use STL vector 32 // - 11 Nov. 2000, H.Kurashige: Use STL vector for dataVector and binVector
33 // - 25 Aug. 2021, V.Ivanchenko updated for Ge 33 // - 25 Aug. 2021, V.Ivanchenko updated for Geant4 11.0
34 // ------------------------------------------- 34 // --------------------------------------------------------------------
35 35
36 #include "G4PhysicsFreeVector.hh" 36 #include "G4PhysicsFreeVector.hh"
37 #include "G4Exp.hh" 37 #include "G4Exp.hh"
38 38
39 // ------------------------------------------- 39 // --------------------------------------------------------------------
40 G4PhysicsFreeVector::G4PhysicsFreeVector(G4boo 40 G4PhysicsFreeVector::G4PhysicsFreeVector(G4bool spline)
41 : G4PhysicsVector(spline) 41 : G4PhysicsVector(spline)
42 {} 42 {}
43 43
44 // ------------------------------------------- 44 // --------------------------------------------------------------------
45 G4PhysicsFreeVector::G4PhysicsFreeVector(G4int 45 G4PhysicsFreeVector::G4PhysicsFreeVector(G4int length)
46 : G4PhysicsFreeVector(static_cast<std::size_ 46 : G4PhysicsFreeVector(static_cast<std::size_t>(length), false)
47 {} 47 {}
48 48
49 // ------------------------------------------- 49 // --------------------------------------------------------------------
50 G4PhysicsFreeVector::G4PhysicsFreeVector(std:: 50 G4PhysicsFreeVector::G4PhysicsFreeVector(std::size_t length, G4bool spline)
51 : G4PhysicsVector(spline) 51 : G4PhysicsVector(spline)
52 { 52 {
53 numberOfNodes = length; 53 numberOfNodes = length;
54 54
55 if (0 < length) { 55 if (0 < length) {
56 binVector.resize(numberOfNodes, 0.0); 56 binVector.resize(numberOfNodes, 0.0);
57 dataVector.resize(numberOfNodes, 0.0); 57 dataVector.resize(numberOfNodes, 0.0);
58 } 58 }
59 Initialise(); 59 Initialise();
60 } 60 }
61 61
62 // ------------------------------------------- 62 // --------------------------------------------------------------------
63 G4PhysicsFreeVector::G4PhysicsFreeVector(std:: 63 G4PhysicsFreeVector::G4PhysicsFreeVector(std::size_t length, G4double,
64 G4dou 64 G4double, G4bool spline)
65 : G4PhysicsFreeVector(length, spline) 65 : G4PhysicsFreeVector(length, spline)
66 {} 66 {}
67 67
68 // ------------------------------------------- 68 // --------------------------------------------------------------------
69 G4PhysicsFreeVector::G4PhysicsFreeVector(const 69 G4PhysicsFreeVector::G4PhysicsFreeVector(const std::vector<G4double>& energies,
70 const 70 const std::vector<G4double>& values,
71 G4boo 71 G4bool spline)
72 : G4PhysicsVector(spline) 72 : G4PhysicsVector(spline)
73 { 73 {
74 numberOfNodes = energies.size(); 74 numberOfNodes = energies.size();
75 75
76 if (numberOfNodes != values.size()) 76 if (numberOfNodes != values.size())
77 { 77 {
78 G4ExceptionDescription ed; 78 G4ExceptionDescription ed;
79 ed << "The size of energy vector " << numb 79 ed << "The size of energy vector " << numberOfNodes << " != " << values.size();
80 G4Exception("G4PhysicsFreeVector construct 80 G4Exception("G4PhysicsFreeVector constructor: ","glob04", FatalException, ed);
81 } 81 }
82 82
83 binVector = energies; 83 binVector = energies;
84 dataVector = values; 84 dataVector = values;
85 Initialise(); 85 Initialise();
86 } 86 }
87 87
88 // ------------------------------------------- 88 // --------------------------------------------------------------------
89 G4PhysicsFreeVector::G4PhysicsFreeVector(const 89 G4PhysicsFreeVector::G4PhysicsFreeVector(const G4double* energies,
90 const 90 const G4double* values,
91 std:: 91 std::size_t length,
92 G4boo 92 G4bool spline)
93 : G4PhysicsVector(spline) 93 : G4PhysicsVector(spline)
94 { 94 {
95 numberOfNodes = length; 95 numberOfNodes = length;
96 96
97 if (0 < numberOfNodes) 97 if (0 < numberOfNodes)
98 { 98 {
99 binVector.resize(numberOfNodes); 99 binVector.resize(numberOfNodes);
100 dataVector.resize(numberOfNodes); 100 dataVector.resize(numberOfNodes);
101 101
102 for(std::size_t i = 0; i < numberOfNodes; 102 for(std::size_t i = 0; i < numberOfNodes; ++i)
103 { 103 {
104 binVector[i] = energies[i]; 104 binVector[i] = energies[i];
105 dataVector[i] = values[i]; 105 dataVector[i] = values[i];
106 } 106 }
107 } 107 }
108 Initialise(); 108 Initialise();
109 } 109 }
110 110
111 // ------------------------------------------- 111 // --------------------------------------------------------------------
112 void G4PhysicsFreeVector::PutValues(const std: 112 void G4PhysicsFreeVector::PutValues(const std::size_t index,
113 const G4do 113 const G4double e,
114 const G4do 114 const G4double value)
115 { 115 {
116 if (index >= numberOfNodes) 116 if (index >= numberOfNodes)
117 { 117 {
118 PrintPutValueError(index, value, "G4Physic 118 PrintPutValueError(index, value, "G4PhysicsFreeVector::PutValues ");
119 return; 119 return;
120 } 120 }
121 binVector[index] = e; 121 binVector[index] = e;
122 dataVector[index] = value; 122 dataVector[index] = value;
123 if(index == 0) 123 if(index == 0)
124 { 124 {
125 edgeMin = e; 125 edgeMin = e;
126 } 126 }
127 else if(numberOfNodes == index + 1) 127 else if(numberOfNodes == index + 1)
128 { 128 {
129 edgeMax = e; 129 edgeMax = e;
130 } 130 }
131 } 131 }
132 132
133 // ------------------------------------------- 133 // --------------------------------------------------------------------
134 void G4PhysicsFreeVector::InsertValues(const G 134 void G4PhysicsFreeVector::InsertValues(const G4double energy,
135 const G 135 const G4double value)
136 { 136 {
137 auto binLoc = std::lower_bound(binVector.cbe 137 auto binLoc = std::lower_bound(binVector.cbegin(), binVector.cend(), energy);
138 auto dataLoc = dataVector.cbegin(); 138 auto dataLoc = dataVector.cbegin();
139 dataLoc += binLoc - binVector.cbegin(); 139 dataLoc += binLoc - binVector.cbegin();
140 140
141 binVector.insert(binLoc, energy); 141 binVector.insert(binLoc, energy);
142 dataVector.insert(dataLoc, value); 142 dataVector.insert(dataLoc, value);
143 143
144 ++numberOfNodes; 144 ++numberOfNodes;
145 Initialise(); 145 Initialise();
146 } 146 }
147 147
148 // ------------------------------------------- 148 // --------------------------------------------------------------------
149 void G4PhysicsFreeVector::EnableLogBinSearch(c 149 void G4PhysicsFreeVector::EnableLogBinSearch(const G4int n)
150 { 150 {
151 // check if log search is applicable 151 // check if log search is applicable
152 if (0 >= n || edgeMin <= 0.0 || edgeMin == e 152 if (0 >= n || edgeMin <= 0.0 || edgeMin == edgeMax || numberOfNodes < 3)
153 { 153 {
154 return; 154 return;
155 } 155 }
156 nLogNodes = static_cast<std::size_t>(static_ 156 nLogNodes = static_cast<std::size_t>(static_cast<G4int>(numberOfNodes)/n);
157 if (nLogNodes < 3) { nLogNodes = 3; } 157 if (nLogNodes < 3) { nLogNodes = 3; }
158 scale.resize(nLogNodes, 0); 158 scale.resize(nLogNodes, 0);
159 imax1 = nLogNodes - 2; 159 imax1 = nLogNodes - 2;
160 iBin1 = (imax1 + 1) / G4Log(edgeMax/edgeMin) 160 iBin1 = (imax1 + 1) / G4Log(edgeMax/edgeMin);
161 lmin1 = G4Log(edgeMin); 161 lmin1 = G4Log(edgeMin);
162 scale[0] = 0; 162 scale[0] = 0;
163 scale[imax1 + 1] = idxmax; 163 scale[imax1 + 1] = idxmax;
164 std::size_t j = 0; 164 std::size_t j = 0;
165 for (std::size_t i = 1; i <= imax1; ++i) 165 for (std::size_t i = 1; i <= imax1; ++i)
166 { 166 {
167 G4double e = edgeMin*G4Exp(i/iBin1); 167 G4double e = edgeMin*G4Exp(i/iBin1);
168 for (; j <= idxmax; ++j) 168 for (; j <= idxmax; ++j)
169 { 169 {
170 if (binVector[j] <= e && e < binVector[j 170 if (binVector[j] <= e && e < binVector[j+1])
171 { 171 {
172 scale[i] = j; 172 scale[i] = j;
173 break; 173 break;
174 } 174 }
175 } 175 }
176 } 176 }
177 } 177 }
178 178
179 // ------------------------------------------- 179 // --------------------------------------------------------------------
180 180