[819] | 1 | // |
---|
| 2 | // ******************************************************************** |
---|
| 3 | // * License and Disclaimer * |
---|
| 4 | // * * |
---|
| 5 | // * The Geant4 software is copyright of the Copyright Holders of * |
---|
| 6 | // * the Geant4 Collaboration. It is provided under the terms and * |
---|
| 7 | // * conditions of the Geant4 Software License, included in the file * |
---|
| 8 | // * LICENSE and available at http://cern.ch/geant4/license . These * |
---|
| 9 | // * include a list of copyright holders. * |
---|
| 10 | // * * |
---|
| 11 | // * Neither the authors of this software system, nor their employing * |
---|
| 12 | // * institutes,nor the agencies providing financial support for this * |
---|
| 13 | // * work make any representation or warranty, express or implied, * |
---|
| 14 | // * regarding this software system or assume any liability for its * |
---|
| 15 | // * use. Please see the license in the file LICENSE and URL above * |
---|
| 16 | // * for the full disclaimer and the limitation of liability. * |
---|
| 17 | // * * |
---|
| 18 | // * This code implementation is the result of the scientific and * |
---|
| 19 | // * technical work of the GEANT4 collaboration. * |
---|
| 20 | // * By using, copying, modifying or distributing the software (or * |
---|
| 21 | // * any work based on the software) you agree to acknowledge its * |
---|
| 22 | // * use in resulting scientific publications, and indicate your * |
---|
| 23 | // * acceptance of all terms of the Geant4 Software license. * |
---|
| 24 | // ******************************************************************** |
---|
| 25 | // |
---|
| 26 | // |
---|
| 27 | // |
---|
| 28 | // Author: Vladimir Ivanchenko (Vladimir.Ivantchenko@cern.ch) |
---|
| 29 | // |
---|
| 30 | // History: |
---|
| 31 | // ----------- |
---|
| 32 | // 27 May 2002 VI Created |
---|
| 33 | // |
---|
| 34 | // ------------------------------------------------------------------- |
---|
| 35 | |
---|
| 36 | #include "G4LinLogInterpolation.hh" |
---|
| 37 | |
---|
| 38 | // Constructor |
---|
| 39 | |
---|
| 40 | G4LinLogInterpolation::G4LinLogInterpolation() |
---|
| 41 | { } |
---|
| 42 | |
---|
| 43 | |
---|
| 44 | // Destructor |
---|
| 45 | |
---|
| 46 | G4LinLogInterpolation::~G4LinLogInterpolation() |
---|
| 47 | { } |
---|
| 48 | |
---|
| 49 | |
---|
| 50 | G4double G4LinLogInterpolation::Calculate(G4double x, G4int bin, |
---|
| 51 | const G4DataVector& points, |
---|
| 52 | const G4DataVector& data) const |
---|
| 53 | { |
---|
[1192] | 54 | //G4cout << "G4LinLogInterpolation is performed on dataset (2 arguments) " << G4endl; |
---|
[819] | 55 | G4int nBins = data.size() - 1; |
---|
| 56 | G4double value = 0.; |
---|
| 57 | if (x < points[0]) |
---|
| 58 | { |
---|
| 59 | value = 0.; |
---|
| 60 | } |
---|
| 61 | else if (bin < nBins) |
---|
| 62 | { |
---|
| 63 | G4double e1 = points[bin]; |
---|
| 64 | G4double e2 = points[bin+1]; |
---|
| 65 | G4double d1 = std::log(data[bin]); |
---|
| 66 | G4double d2 = std::log(data[bin+1]); |
---|
| 67 | value = std::exp(d1 + (d2 - d1)*(x - e1)/ (e2 - e1)); |
---|
| 68 | } |
---|
| 69 | else |
---|
| 70 | { |
---|
| 71 | value = data[nBins]; |
---|
| 72 | } |
---|
| 73 | return value; |
---|
| 74 | } |
---|
[1192] | 75 | |
---|
| 76 | G4double G4LinLogInterpolation::Calculate(G4double x, G4int bin, |
---|
| 77 | const G4DataVector& points, |
---|
| 78 | const G4DataVector& data, |
---|
| 79 | const G4DataVector& /*log_points*/, |
---|
| 80 | const G4DataVector& log_data) const |
---|
| 81 | { |
---|
| 82 | //G4cout << "G4LinLogInterpolation is performed on dataset (4 arguments) " << G4endl; |
---|
| 83 | G4int nBins = data.size() - 1; |
---|
| 84 | G4double value = 0.; |
---|
| 85 | //G4double log_x = std::log10(x); |
---|
| 86 | if (x < points[0]) |
---|
| 87 | { |
---|
| 88 | value = 0.; |
---|
| 89 | } |
---|
| 90 | else if (bin < nBins) |
---|
| 91 | { |
---|
| 92 | G4double e1 = points[bin]; |
---|
| 93 | G4double e2 = points[bin+1]; |
---|
| 94 | G4double d1 = data[bin]; |
---|
| 95 | G4double d2 = data[bin+1]; |
---|
| 96 | //G4double log_e1 = log_points[bin]; |
---|
| 97 | //G4double log_e2 = log_points[bin+1]; |
---|
| 98 | G4double log_d1 = log_data[bin]; |
---|
| 99 | G4double log_d2 = log_data[bin+1]; |
---|
| 100 | if (d1 > 0.0 && d2 > 0.0) |
---|
| 101 | { |
---|
| 102 | // Values e1, e2, d1 and d2 are the log values of the corresponding |
---|
| 103 | // original energy and data values. Simple linear interpolation performed |
---|
| 104 | // on loagarithmic data should be equivalent to log-log interpolation |
---|
| 105 | //value = log_d1 + (log_d2 - log_d1)*(log_x - log_e1)/(log_e2 - log_e1); |
---|
| 106 | value = std::exp(log_d1 + (log_d2 - log_d1)*(x - e1)/(e2 - e1)); |
---|
| 107 | } |
---|
| 108 | else |
---|
| 109 | { |
---|
| 110 | if (d1 == 0.0) log_d1 = -300; |
---|
| 111 | if (d2 == 0.0) log_d2 = -300; |
---|
| 112 | value = std::exp(log_d1 + (log_d2 - log_d1)*(x - e1)/(e2 - e1)); |
---|
| 113 | } |
---|
| 114 | } |
---|
| 115 | else |
---|
| 116 | { |
---|
| 117 | value = data[nBins]; |
---|
| 118 | } |
---|
| 119 | return value; |
---|
| 120 | } |
---|
| 121 | |
---|