| Geant4 Cross Reference |
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: Maria Grazia Pia (Maria.Grazia.Pia@cern.ch)
29 //
30 // History:
31 // -----------
32 // 31 Jul 2001 MGP Created
33 //
34 // -------------------------------------------------------------------
35
36 #include "G4SemiLogInterpolation.hh"
37
38 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
39 // Constructor
40 G4SemiLogInterpolation::G4SemiLogInterpolation()
41 { }
42
43
44 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
45 // Destructor
46 G4SemiLogInterpolation::~G4SemiLogInterpolation()
47 { }
48
49 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
50 G4VDataSetAlgorithm* G4SemiLogInterpolation::Clone() const
51 { return new G4SemiLogInterpolation; }
52
53 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
54 G4double G4SemiLogInterpolation::Calculate(G4double x, G4int bin,
55 const G4DataVector& points,
56 const G4DataVector& data) const
57 {
58 G4int nBins = G4int(data.size() - 1);
59 G4double value = 0.;
60 if (x < points[0])
61 {
62 value = 0.;
63 }
64 else if (bin < nBins)
65 {
66 G4double e1 = points[bin];
67 G4double e2 = points[bin+1];
68 G4double d1 = data[bin];
69 G4double d2 = data[bin+1];
70 value = (d1*std::log10(e2/x) + d2*std::log10(x/e1)) / std::log10(e2/e1);
71 }
72 else
73 {
74 value = data[nBins];
75 }
76 return value;
77 }
78
79 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
80 G4double G4SemiLogInterpolation::Calculate(G4double x, G4int bin,
81 const G4DataVector& points,
82 const G4DataVector& data,
83 const G4DataVector& log_points,
84 const G4DataVector& /*log_data*/) const
85 {
86 //A combination of logarithmic interpolation on energy set and
87 //linear Interpolation on data set
88 //G4cout << "G4SemiLogInterpolation is performed (4 arguments)" << G4endl;
89 G4int nBins = G4int(data.size() - 1);
90 G4double value = 0.;
91 G4double log_x = std::log10(x);
92 if (x < points[0])
93 {
94 value = 0.;
95 }
96 else if (bin < nBins)
97 {
98 G4double e1 = points[bin];
99 G4double e2 = points[bin+1];
100 G4double d1 = data[bin];
101 G4double d2 = data[bin+1];
102 G4double log_e1 = log_points[bin];
103 G4double log_e2 = log_points[bin+1];
104
105 // Values log_e1 and log_e2 are the log values of the corresponding
106 // original energy actual values. Original d1 and d2 values are used.
107 // Simple linear interpolation performed on loagarithmic data
108 // should be equivalent to semi log-log interpolation
109 if (e1 == 0.0) log_e1 = -300;
110 if (e2 == 0.0) log_e2 = -300;
111 value = d1 + (d2 - d1)*(log_x - log_e1)/(log_e2 - log_e1);
112 }
113 else
114 {
115 value = data[nBins];
116 }
117 return value;
118 }
119
120