| 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 // G4ProductionCuts class implementation 26 // G4ProductionCuts class implementation
27 // 27 //
28 // Author: H.Kurashige, 17 September 2002 - Fi 28 // Author: H.Kurashige, 17 September 2002 - First implementation
29 // ------------------------------------------- 29 // --------------------------------------------------------------------
30 30
31 #include "G4ProductionCuts.hh" 31 #include "G4ProductionCuts.hh"
32 #include "G4ProductionCutsTable.hh" 32 #include "G4ProductionCutsTable.hh"
33 33
34 #include <sstream> 34 #include <sstream>
35 35
36 G4ProductionCuts::G4ProductionCuts() 36 G4ProductionCuts::G4ProductionCuts()
37 { 37 {
38 for (G4int i=0; i<NumberOfG4CutIndex; ++i) 38 for (G4int i=0; i<NumberOfG4CutIndex; ++i)
39 { 39 {
40 fRangeCuts.push_back(0.0); 40 fRangeCuts.push_back(0.0);
41 } 41 }
42 } 42 }
43 43
44 G4ProductionCuts::G4ProductionCuts(const G4Pro 44 G4ProductionCuts::G4ProductionCuts(const G4ProductionCuts& right)
45 { 45 {
46 for (G4int i=0; i<NumberOfG4CutIndex; ++i) 46 for (G4int i=0; i<NumberOfG4CutIndex; ++i)
47 { 47 {
48 fRangeCuts.push_back(0.0); 48 fRangeCuts.push_back(0.0);
49 } 49 }
50 *this = right; 50 *this = right;
51 } 51 }
52 52
53 G4ProductionCuts::~G4ProductionCuts() 53 G4ProductionCuts::~G4ProductionCuts()
54 { 54 {
55 fRangeCuts.clear(); 55 fRangeCuts.clear();
56 } 56 }
57 57
58 G4ProductionCuts& G4ProductionCuts::operator=( 58 G4ProductionCuts& G4ProductionCuts::operator=(const G4ProductionCuts& right)
59 { 59 {
60 if (&right==this) return *this; 60 if (&right==this) return *this;
61 61
62 for (G4int i=0; i<NumberOfG4CutIndex; ++i) 62 for (G4int i=0; i<NumberOfG4CutIndex; ++i)
63 { 63 {
64 fRangeCuts[i] = right.fRangeCuts[i]; 64 fRangeCuts[i] = right.fRangeCuts[i];
65 } 65 }
66 isModified = right.isModified; 66 isModified = right.isModified;
67 return *this; 67 return *this;
68 } 68 }
69 69
70 G4bool G4ProductionCuts::operator==(const G4Pr 70 G4bool G4ProductionCuts::operator==(const G4ProductionCuts& right) const
71 { 71 {
72 return (this == &right); 72 return (this == &right);
73 } 73 }
74 74
75 G4bool G4ProductionCuts::operator!=(const G4Pr 75 G4bool G4ProductionCuts::operator!=(const G4ProductionCuts& right) const
76 { 76 {
77 return (this != &right); 77 return (this != &right);
78 } 78 }
79 79
80 void G4ProductionCuts::SetProductionCut(G4doub 80 void G4ProductionCuts::SetProductionCut(G4double cut, G4int index)
81 { 81 {
82 if(index >= 0 && index < NumberOfG4CutIndex) 82 if(index >= 0 && index < NumberOfG4CutIndex)
83 { 83 {
84 fRangeCuts[index] = cut; 84 fRangeCuts[index] = cut;
85 isModified = true; 85 isModified = true;
86 } 86 }
87 else 87 else
88 { 88 {
89 std::ostringstream os; 89 std::ostringstream os;
90 os << "Setting cuts for particles other th 90 os << "Setting cuts for particles other than photon, e-, e+ or proton has "
91 "no effect."; 91 "no effect.";
92 G4Exception("G4ProductionCuts::SetProducti 92 G4Exception("G4ProductionCuts::SetProductionCut", "ProcCuts110",
93 JustWarning, os.str().c_str()) 93 JustWarning, os.str().c_str());
94 } 94 }
95 } 95 }
96 96
97 void G4ProductionCuts::SetProductionCut(G4doub 97 void G4ProductionCuts::SetProductionCut(G4double cut)
98 { 98 {
99 for(G4int i = 0; i < NumberOfG4CutIndex; ++i 99 for(G4int i = 0; i < NumberOfG4CutIndex; ++i)
100 { 100 {
101 fRangeCuts[i] = cut; 101 fRangeCuts[i] = cut;
102 } 102 }
103 isModified = true; 103 isModified = true;
104 } 104 }
105 105
106 void G4ProductionCuts::SetProductionCut(G4doub 106 void G4ProductionCuts::SetProductionCut(G4double cut, G4ParticleDefinition* ptr)
107 { 107 {
108 SetProductionCut(cut, GetIndex(ptr)); 108 SetProductionCut(cut, GetIndex(ptr));
109 } 109 }
110 110
111 void G4ProductionCuts::SetProductionCut(G4doub 111 void G4ProductionCuts::SetProductionCut(G4double cut, const G4String& pName)
112 { 112 {
113 SetProductionCut(cut, GetIndex(pName)); 113 SetProductionCut(cut, GetIndex(pName));
114 } 114 }
115 115
116 G4double G4ProductionCuts::GetProductionCut(G4 116 G4double G4ProductionCuts::GetProductionCut(G4int index) const
117 { 117 {
118 G4double cut = -1.0; 118 G4double cut = -1.0;
119 if (index>=0 && index<NumberOfG4CutIndex) 119 if (index>=0 && index<NumberOfG4CutIndex)
120 { 120 {
121 cut = fRangeCuts[index]; 121 cut = fRangeCuts[index];
122 } 122 }
123 return cut; 123 return cut;
124 } 124 }
125 125
126 G4double G4ProductionCuts::GetProductionCut(co 126 G4double G4ProductionCuts::GetProductionCut(const G4String& name) const
127 { 127 {
128 return GetProductionCut(GetIndex(name)); 128 return GetProductionCut(GetIndex(name));
129 } 129 }
130 130
131 131
132 const std::vector<G4double>& G4ProductionCut 132 const std::vector<G4double>& G4ProductionCuts::GetProductionCuts() const
133 { 133 {
134 return fRangeCuts; 134 return fRangeCuts;
135 } 135 }
136 136
137 G4bool G4ProductionCuts::IsModified() const 137 G4bool G4ProductionCuts::IsModified() const
138 { 138 {
139 return isModified; 139 return isModified;
140 } 140 }
141 141
142 void G4ProductionCuts::PhysicsTableUpdated() 142 void G4ProductionCuts::PhysicsTableUpdated()
143 { 143 {
144 isModified = false; 144 isModified = false;
145 } 145 }
146 146
147 G4int G4ProductionCuts::GetIndex(const G4Strin 147 G4int G4ProductionCuts::GetIndex(const G4String& name)
148 { 148 {
149 G4int index = -1; 149 G4int index = -1;
150 if ( name == "gamma" ) { index = 0; } 150 if ( name == "gamma" ) { index = 0; }
151 else if ( name == "e-" ) { index = 1; } 151 else if ( name == "e-" ) { index = 1; }
152 else if ( name == "e+" ) { index = 2; } 152 else if ( name == "e+" ) { index = 2; }
153 else if ( name == "proton" ) { index = 3; } 153 else if ( name == "proton" ) { index = 3; }
154 154
155 return index; 155 return index;
156 } 156 }
157 157
158 158
159 G4int G4ProductionCuts::GetIndex(const G4Parti 159 G4int G4ProductionCuts::GetIndex(const G4ParticleDefinition* ptr)
160 { 160 {
161 G4int pdg = (nullptr == ptr) ? 0 : ptr->GetP 161 G4int pdg = (nullptr == ptr) ? 0 : ptr->GetPDGEncoding();
162 G4int index = -1; 162 G4int index = -1;
163 if (pdg == 22) { index = 0; } 163 if (pdg == 22) { index = 0; }
164 else if (pdg == 11) { index = 1; } 164 else if (pdg == 11) { index = 1; }
165 else if (pdg == -11) { index = 2; } 165 else if (pdg == -11) { index = 2; }
166 else if (pdg == 2212) { index = 3; } 166 else if (pdg == 2212) { index = 3; }
167 167
168 return index; 168 return index;
169 } 169 }
170 170
171 void G4ProductionCuts::SetProductionCuts(std:: 171 void G4ProductionCuts::SetProductionCuts(std::vector<G4double>& cut)
172 { 172 {
173 G4int vSize = (G4int)cut.size(); 173 G4int vSize = (G4int)cut.size();
174 if (vSize != NumberOfG4CutIndex) 174 if (vSize != NumberOfG4CutIndex)
175 { 175 {
176 #ifdef G4VERBOSE 176 #ifdef G4VERBOSE
177 if (G4ProductionCutsTable::GetProductionCu 177 if (G4ProductionCutsTable::GetProductionCutsTable()->GetVerboseLevel() > 1)
178 { 178 {
179 G4cout << "G4ProductionCuts::SetProducti 179 G4cout << "G4ProductionCuts::SetProductionCuts ";
180 G4cout << " The size of given cut value 180 G4cout << " The size of given cut value vector [=" << vSize << "] "
181 << " is not consistent with numbe 181 << " is not consistent with number of CutIndex [="
182 << NumberOfG4CutIndex << G4endl; 182 << NumberOfG4CutIndex << G4endl;
183 } 183 }
184 #endif 184 #endif
185 G4Exception( "G4ProductionCuts::SetProduct 185 G4Exception( "G4ProductionCuts::SetProductionCuts ",
186 "ProcCuts108", 186 "ProcCuts108",
187 JustWarning, "Given vector si 187 JustWarning, "Given vector size is inconsistent ");
188 if (NumberOfG4CutIndex<vSize) { vSize = N 188 if (NumberOfG4CutIndex<vSize) { vSize = NumberOfG4CutIndex; }
189 } 189 }
190 for(G4int i = 0; i<vSize; ++i) 190 for(G4int i = 0; i<vSize; ++i)
191 { 191 {
192 fRangeCuts[i] = cut[i]; 192 fRangeCuts[i] = cut[i];
193 } 193 }
194 isModified = true; 194 isModified = true;
195 } 195 }
196 196