| 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 // 31 Jul 2008 MGP Revised and renamed to G4LogLogInterpolator
34 //
35 // -------------------------------------------------------------------
36
37 #include "G4LogLogInterpolator.hh"
38
39 // Constructor
40
41 G4LogLogInterpolator::G4LogLogInterpolator()
42 { }
43
44 // Destructor
45
46 G4LogLogInterpolator::~G4LogLogInterpolator()
47 { }
48
49 G4IInterpolator* G4LogLogInterpolator::Clone() const
50 { return new G4LogLogInterpolator; }
51
52
53 G4double G4LogLogInterpolator::Calculate(G4double x, G4int bin,
54 const G4DataVector& points,
55 const G4DataVector& data) const
56 {
57 G4int nBins = G4int(data.size() - 1);
58 // ---- MGP ---- To be verified; value = 0. is redundant here
59 G4double value = 0.;
60 if (x < points[0] || x == 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
71 if (d1 != 0. && d2 != 0.)
72 {
73 value = (std::log10(d1)*std::log10(e2/x) + std::log10(d2)*std::log10(x/e1)) / std::log10(e2/e1);
74 value = std::pow(10.,value);
75 }
76 else
77 {
78 value = 0.;
79 }
80 }
81 else
82 {
83 value = data[nBins];
84 }
85
86 return value;
87 }
88