| 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 // 26 //
27 // ------------------------------------------- 27 // -------------------------------------------------------------------
28 // GEANT4 Class file 28 // GEANT4 Class file
29 // 29 //
30 // For information related to this code c 30 // For information related to this code contact:
31 // 31 //
32 // File name: G4CrossSectionPatch 32 // File name: G4CrossSectionPatch
33 // 33 //
34 // Author: 34 // Author:
35 // 35 //
36 // Creation date: 15 April 1999 36 // Creation date: 15 April 1999
37 // 37 //
38 // Modifications: 38 // Modifications:
39 // 39 //
40 // ------------------------------------------- 40 // -------------------------------------------------------------------
41 41
42 #include "globals.hh" 42 #include "globals.hh"
43 #include "G4CrossSectionPatch.hh" 43 #include "G4CrossSectionPatch.hh"
44 #include "G4VCrossSectionSource.hh" 44 #include "G4VCrossSectionSource.hh"
45 #include "G4KineticTrack.hh" 45 #include "G4KineticTrack.hh"
46 #include "G4CrossSectionVector.hh" 46 #include "G4CrossSectionVector.hh"
47 47
48 G4CrossSectionPatch::G4CrossSectionPatch() 48 G4CrossSectionPatch::G4CrossSectionPatch()
49 { } 49 { }
50 50
51 51
52 G4CrossSectionPatch::~G4CrossSectionPatch() 52 G4CrossSectionPatch::~G4CrossSectionPatch()
53 { } 53 { }
54 54
55 55
56 G4bool G4CrossSectionPatch::operator==(const G 56 G4bool G4CrossSectionPatch::operator==(const G4CrossSectionPatch &right) const
57 { 57 {
58 return (this == (G4CrossSectionPatch*) &righ 58 return (this == (G4CrossSectionPatch*) &right);
59 } 59 }
60 60
61 61
62 G4bool G4CrossSectionPatch::operator!=(const G 62 G4bool G4CrossSectionPatch::operator!=(const G4CrossSectionPatch &right) const
63 { 63 {
64 return (this != (G4CrossSectionPatch*) &righ 64 return (this != (G4CrossSectionPatch*) &right);
65 } 65 }
66 66
67 67
68 G4double G4CrossSectionPatch::CrossSection(con 68 G4double G4CrossSectionPatch::CrossSection(const G4KineticTrack& trk1,
69 const G4KineticTrack& trk2) const 69 const G4KineticTrack& trk2) const
70 { 70 {
71 // The cross section is provided by one of t 71 // The cross section is provided by one of the components, according to their energy
72 // validity range 72 // validity range
73 73
74 G4double crossSection = 0.; 74 G4double crossSection = 0.;
75 G4double ecm = (trk1.Get4Momentum() + trk2.G 75 G4double ecm = (trk1.Get4Momentum() + trk2.Get4Momentum()).mag();
76 76
77 const G4CrossSectionVector* components = Get 77 const G4CrossSectionVector* components = GetComponents();
78 if (components != 0) 78 if (components != 0)
79 { 79 {
80 std::size_t nComponents = this->GetCompo << 80 G4int nComponents = this->GetComponents()->size();
>> 81 // G4int nValid = 0;
81 82
82 for (std::size_t i=0; i<nComponents; ++i << 83 G4int i;
>> 84 for (i=0; i<nComponents; i++)
83 { 85 {
84 G4CrossSectionSourcePtr componentPtr 86 G4CrossSectionSourcePtr componentPtr = (*components)[i];
85 G4VCrossSectionSource* component = compone 87 G4VCrossSectionSource* component = componentPtr();
86 if (component->IsValid(ecm)) 88 if (component->IsValid(ecm))
87 { 89 {
88 crossSection = component->CrossSection 90 crossSection = component->CrossSection(trk1,trk2);
89 } 91 }
90 else if (i < (nComponents - 1) ) 92 else if (i < (nComponents - 1) )
91 { 93 {
92 G4CrossSectionSourcePtr nextPtr = (*co 94 G4CrossSectionSourcePtr nextPtr = (*components)[i+1];
93 G4VCrossSectionSource* next = nextPtr( 95 G4VCrossSectionSource* next = nextPtr();
94 if (ecm > component->HighLimit() && ec 96 if (ecm > component->HighLimit() && ecm < next->LowLimit())
95 { 97 {
96 // Merge cross-sections in transition re 98 // Merge cross-sections in transition region between two validity ranges
97 crossSection = Transition(trk1,trk2,comp 99 crossSection = Transition(trk1,trk2,component,next);
98 } 100 }
99 } 101 }
100 } 102 }
101 } 103 }
102 104
103 return crossSection; 105 return crossSection;
104 } 106 }
105 107
106 108
107 G4bool G4CrossSectionPatch::IsValid(G4double e 109 G4bool G4CrossSectionPatch::IsValid(G4double e) const
108 { 110 {
109 // The Patch is valid if any of its componen 111 // The Patch is valid if any of its components are valid
110 G4bool answer = false; 112 G4bool answer = false;
111 const G4CrossSectionVector* components = Get 113 const G4CrossSectionVector* components = GetComponents();
112 if (components != 0) 114 if (components != 0)
113 { 115 {
114 std::size_t n = components->size(); << 116 G4int n = components->size();
115 for (std::size_t i=0; i<n; ++i) << 117 G4int i;
>> 118 for (i=0; i<n; i++)
116 { 119 {
117 G4CrossSectionSourcePtr componentPtr = (*c 120 G4CrossSectionSourcePtr componentPtr = (*components)[i];
118 G4VCrossSectionSource* component = c 121 G4VCrossSectionSource* component = componentPtr();
119 if (component->IsValid(e)) 122 if (component->IsValid(e))
120 { 123 {
121 answer = true; 124 answer = true;
122 break; 125 break;
123 } 126 }
124 } 127 }
125 } 128 }
126 return answer; 129 return answer;
127 } 130 }
128 131
129 132
130 G4double G4CrossSectionPatch::Transition(const 133 G4double G4CrossSectionPatch::Transition(const G4KineticTrack& trk1, const G4KineticTrack& trk2,
131 const G4VCrossSectionSource* c 134 const G4VCrossSectionSource* comp1,
132 const G4VCrossSectionSource* c 135 const G4VCrossSectionSource* comp2) const
133 { 136 {
134 //Merge two cross sections in the transition 137 //Merge two cross sections in the transition region between their validity ranges
135 138
136 G4double crossSection = 0.; 139 G4double crossSection = 0.;
137 140
138 G4double ecm = (trk1.Get4Momentum() + trk2.G 141 G4double ecm = (trk1.Get4Momentum() + trk2.Get4Momentum()).mag();
139 G4double sigma1 = comp1->CrossSection(trk1,t 142 G4double sigma1 = comp1->CrossSection(trk1,trk2);
140 G4double sigma2 = comp2->CrossSection(trk1,t 143 G4double sigma2 = comp2->CrossSection(trk1,trk2);
141 G4double denom = comp2->LowLimit() - comp1-> 144 G4double denom = comp2->LowLimit() - comp1->HighLimit();
142 G4double diff = ecm - comp1->HighLimit(); 145 G4double diff = ecm - comp1->HighLimit();
143 if (denom > 0. && diff > 0.) 146 if (denom > 0. && diff > 0.)
144 { 147 {
145 G4double ratio = diff / denom; 148 G4double ratio = diff / denom;
146 crossSection = (1.- ratio) * sigma1 + ra 149 crossSection = (1.- ratio) * sigma1 + ratio * sigma2;
147 } 150 }
148 151
149 return crossSection; 152 return crossSection;
150 } 153 }
151 154
152 155
153 G4double G4CrossSectionPatch::Transition(G4dou 156 G4double G4CrossSectionPatch::Transition(G4double ecm,
154 G4double sigma1, G4double sigma2, 157 G4double sigma1, G4double sigma2,
155 G4double e1, G4double e2) const 158 G4double e1, G4double e2) const
156 { 159 {
157 //Merge two cross sections in the transition 160 //Merge two cross sections in the transition region between their validity ranges
158 161
159 G4double crossSection = 0.; 162 G4double crossSection = 0.;
160 163
161 G4double denom = e2 - e1; 164 G4double denom = e2 - e1;
162 G4double diff = ecm - e1; 165 G4double diff = ecm - e1;
163 if (denom > 0. && diff > 0.) 166 if (denom > 0. && diff > 0.)
164 { 167 {
165 G4double ratio = diff / denom; 168 G4double ratio = diff / denom;
166 crossSection = (1.- ratio) * sigma1 + ra 169 crossSection = (1.- ratio) * sigma1 + ratio * sigma2;
167 } 170 }
168 171
169 return crossSection; 172 return crossSection;
170 } 173 }
171 174
172 175