| Geant4 Cross Reference |
1 // 1 //
2 // ******************************************* 2 // ********************************************************************
3 // * License and Disclaimer << 3 // * DISCLAIMER *
4 // * 4 // * *
5 // * The Geant4 software is copyright of th << 5 // * The following disclaimer summarizes all the specific disclaimers *
6 // * the Geant4 Collaboration. It is provided << 6 // * of contributors to this software. The specific disclaimers,which *
7 // * conditions of the Geant4 Software License << 7 // * govern, are listed with their locations in: *
8 // * LICENSE and available at http://cern.ch/ << 8 // * http://cern.ch/geant4/license *
9 // * include a list of copyright holders. <<
10 // * 9 // * *
11 // * Neither the authors of this software syst 10 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing fin 11 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warran 12 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assum 13 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file << 14 // * use. *
16 // * for the full disclaimer and the limitatio <<
17 // * 15 // * *
18 // * This code implementation is the result << 16 // * This code implementation is the intellectual property of the *
19 // * technical work of the GEANT4 collaboratio << 17 // * GEANT4 collaboration. *
20 // * By using, copying, modifying or distri << 18 // * By copying, distributing or modifying the Program (or any work *
21 // * any work based on the software) you ag << 19 // * based on the Program) you indicate your acceptance of this *
22 // * use in resulting scientific publicati << 20 // * statement, and all its terms. *
23 // * acceptance of all terms of the Geant4 Sof <<
24 // ******************************************* 21 // ********************************************************************
25 // 22 //
26 // 23 //
27 // Author: Vladimir Ivanchenko (Vladimir.Ivan 24 // Author: Vladimir Ivanchenko (Vladimir.Ivantchenko@cern.ch)
28 // 25 //
29 // History: 26 // History:
30 // ----------- 27 // -----------
31 // 29 May 2002 VI Created 28 // 29 May 2002 VI Created
32 // 29 //
33 // ------------------------------------------- 30 // -------------------------------------------------------------------
34 31
35 #include "G4LinLogLogInterpolation.hh" 32 #include "G4LinLogLogInterpolation.hh"
36 33
37 // Constructor 34 // Constructor
38 35
39 G4LinLogLogInterpolation::G4LinLogLogInterpola 36 G4LinLogLogInterpolation::G4LinLogLogInterpolation()
40 { } 37 { }
41 38
42 // Destructor 39 // Destructor
43 40
44 G4LinLogLogInterpolation::~G4LinLogLogInterpol 41 G4LinLogLogInterpolation::~G4LinLogLogInterpolation()
45 { } 42 { }
46 43
47 G4VDataSetAlgorithm* G4LinLogLogInterpolation: 44 G4VDataSetAlgorithm* G4LinLogLogInterpolation::Clone() const
48 { return new G4LinLogLogInterpolation; } 45 { return new G4LinLogLogInterpolation; }
49 46
50 47
51 G4double G4LinLogLogInterpolation::Calculate(G 48 G4double G4LinLogLogInterpolation::Calculate(G4double x, G4int bin,
52 const G4DataVector& points, 49 const G4DataVector& points,
53 const G4DataVector& data) const 50 const G4DataVector& data) const
54 { 51 {
55 //G4cout << "G4LinLogLogInterpolation is per << 52 G4int nBins = data.size() - 1;
56 G4int nBins = G4int(data.size() - 1); <<
57 G4double value = 0.; 53 G4double value = 0.;
58 if (x < points[0]) 54 if (x < points[0])
59 { 55 {
60 value = 0.; 56 value = 0.;
61 } 57 }
62 else if (bin < nBins) 58 else if (bin < nBins)
63 { 59 {
64 G4double e1 = points[bin]; 60 G4double e1 = points[bin];
65 G4double e2 = points[bin+1]; 61 G4double e2 = points[bin+1];
66 G4double d1 = data[bin]; 62 G4double d1 = data[bin];
67 G4double d2 = data[bin+1]; 63 G4double d2 = data[bin+1];
68 if(d1 > 0.0 && d2 > 0.0) { 64 if(d1 > 0.0 && d2 > 0.0) {
69 value = (std::log10(d1)*std::log10(e2/ << 65 value = (log10(d1)*log10(e2/x) + log10(d2)*log10(x/e1)) / log10(e2/e1);
70 value = std::pow(10.,value); << 66 value = pow(10,value);
71 } else { 67 } else {
72 value = (d1*std::log10(e2/x) + d2*std: << 68 value = (d1*log10(e2/x) + d2*log10(x/e1)) / log10(e2/e1);
73 } 69 }
74 } 70 }
75 else 71 else
76 { 72 {
77 value = data[nBins]; 73 value = data[nBins];
78 } 74 }
79 75
80 return value; <<
81 } <<
82 <<
83 G4double G4LinLogLogInterpolation::Calculate(G <<
84 const G4DataVector& points, <<
85 cons <<
86 cons <<
87 const G4DataVector& log_data) cons <<
88 { <<
89 //G4cout << "G4LinLogLogInterpolation is per <<
90 G4int nBins = G4int(data.size() - 1); <<
91 G4double value = 0.; <<
92 G4double log_x = std::log10(x); <<
93 if (x < points[0]) <<
94 { <<
95 value = 0.; <<
96 } <<
97 else if (bin < nBins) <<
98 { <<
99 G4double e1 = points[bin]; <<
100 G4double e2 = points[bin+1]; <<
101 G4double d1 = data[bin]; <<
102 G4double d2 = data[bin+1]; <<
103 G4double log_e1 = log_points[bin]; <<
104 G4double log_e2 = log_points[bin+1]; <<
105 G4double log_d1 = log_data[bin]; <<
106 G4double log_d2 = log_data[bin+1]; <<
107 //G4cout << "x = " << x << " , log_x = " <<
108 //G4cout << "e1 = " << e1 << " , d1 = " <<
109 //G4cout << "e2 = " << e2 << " , d2 = " <<
110 //G4cout << "log_e1 = " << log_e1 << " , <<
111 //G4cout << "log_e2 = " << log_e2 << " , <<
112 if (d1 > 0.0 && d2 > 0.0) <<
113 { <<
114 // Values e1, e2, d1 and d2 are the l <<
115 // original energy and data values. S <<
116 // on loagarithmic data should be equ <<
117 value = log_d1 + (log_d2 - log_d1)*(l <<
118 <<
119 //G4cout << "Case of normal log-log i <<
120 //G4cout << "Temp log interpolated va <<
121 <<
122 // Delogarithmize to obtain interpola <<
123 value = std::pow(10.,value); <<
124 <<
125 //G4cout << "Final Interpolated value <<
126 } <<
127 else <<
128 { <<
129 // Case of semi log-log interpolation <<
130 //G4cout << "G4LinLogLogInterpolation <<
131 if (e1 == 0.0) e1 = 1e-300; <<
132 if (e2 == 0.0) e2 = 1e-300; <<
133 value = d1 + (d2 - d1)*(log_x - log_e1 <<
134 //G4cout << "LinLogInterpolation: Fina <<
135 } <<
136 } <<
137 else <<
138 { <<
139 value = data[nBins]; <<
140 } <<
141 return value; 76 return value;
142 } 77 }
143 78