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 // 24 // 28 // Author: Vladimir Ivanchenko (Vladimir.Ivan 25 // Author: Vladimir Ivanchenko (Vladimir.Ivantchenko@cern.ch) 29 // 26 // 30 // History: 27 // History: 31 // ----------- 28 // ----------- 32 // 27 May 2002 VI Created 29 // 27 May 2002 VI Created 33 // 30 // 34 // ------------------------------------------- 31 // ------------------------------------------------------------------- 35 32 36 #include "G4LinLogInterpolation.hh" 33 #include "G4LinLogInterpolation.hh" 37 #include "G4Exp.hh" << 38 34 39 //....oooOO0OOooo........oooOO0OOooo........oo << 40 // Constructor 35 // Constructor >> 36 41 G4LinLogInterpolation::G4LinLogInterpolation() 37 G4LinLogInterpolation::G4LinLogInterpolation() 42 { } 38 { } 43 39 44 //....oooOO0OOooo........oooOO0OOooo........oo << 40 45 // Destructor 41 // Destructor >> 42 46 G4LinLogInterpolation::~G4LinLogInterpolation( 43 G4LinLogInterpolation::~G4LinLogInterpolation() 47 { } 44 { } 48 45 49 //....oooOO0OOooo........oooOO0OOooo........oo << 46 50 G4double G4LinLogInterpolation::Calculate(G4do << 47 G4double G4LinLogInterpolation::Calculate(G4double x, G4int bin, 51 const G4DataVector& points, << 48 const G4DataVector& points, 52 const G4DataVector& data) const 49 const G4DataVector& data) const 53 { 50 { 54 //G4cout << "G4LinLogInterpolation is perfor << 51 G4int nBins = data.size() - 1; 55 G4int nBins = G4int(data.size() - 1); << 56 G4double value = 0.; 52 G4double value = 0.; 57 if (x < points[0]) 53 if (x < points[0]) 58 { 54 { 59 value = 0.; 55 value = 0.; 60 } 56 } 61 else if (bin < nBins) 57 else if (bin < nBins) 62 { 58 { 63 G4double e1 = points[bin]; 59 G4double e1 = points[bin]; 64 G4double e2 = points[bin+1]; 60 G4double e2 = points[bin+1]; 65 G4double d1 = std::log(data[bin]); << 61 G4double d1 = log(data[bin]); 66 G4double d2 = std::log(data[bin+1]); << 62 G4double d2 = log(data[bin+1]); 67 value = G4Exp(d1 + (d2 - d1)*(x - e1)/ ( << 63 value = exp(d1 + (d2 - d1)*(x - e1)/ (e2 - e1)); 68 } 64 } 69 else 65 else 70 { 66 { 71 value = data[nBins]; 67 value = data[nBins]; 72 } 68 } 73 return value; << 74 } << 75 << 76 //....oooOO0OOooo........oooOO0OOooo........oo << 77 << 78 G4double G4LinLogInterpolation::Calculate(G4do << 79 const G4DataVector& points, << 80 cons << 81 cons << 82 const G4DataVector& log_data) cons << 83 { << 84 //G4cout << "G4LinLogInterpolation is perfor << 85 G4int nBins = G4int(data.size() - 1); << 86 G4double value = 0.; << 87 //G4double log_x = std::log10(x); << 88 if (x < points[0]) << 89 { << 90 value = 0.; << 91 } << 92 else if (bin < nBins) << 93 { << 94 G4double e1 = points[bin]; << 95 G4double e2 = points[bin+1]; << 96 G4double d1 = data[bin]; << 97 G4double d2 = data[bin+1]; << 98 //G4double log_e1 = log_points[bin]; << 99 //G4double log_e2 = log_points[bin+1]; << 100 G4double log_d1 = log_data[bin]; << 101 G4double log_d2 = log_data[bin+1]; << 102 if (d1 > 0.0 && d2 > 0.0) << 103 { << 104 // Values e1, e2, d1 and d2 are the log va << 105 // original energy and data values. << 106 // Simple linear interpolation performed << 107 // on logarithmic data should be equivalen << 108 //value = log_d1 + (log_d2 - log_d1) << 109 value = G4Exp(log_d1 + (log_d2 - log << 110 } << 111 else << 112 { << 113 if (d1 == 0.0) log_d1 = -300; << 114 if (d2 == 0.0) log_d2 = -300; << 115 value = G4Exp(log_d1 + (log_d2 - log << 116 } << 117 } << 118 else << 119 { << 120 value = data[nBins]; << 121 } << 122 return value; 69 return value; 123 } 70 } 124 71