Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/processes/electromagnetic/lowenergy/src/G4LinLogLogInterpolation.cc

Version: [ ReleaseNotes ] [ 1.0 ] [ 1.1 ] [ 2.0 ] [ 3.0 ] [ 3.1 ] [ 3.2 ] [ 4.0 ] [ 4.0.p1 ] [ 4.0.p2 ] [ 4.1 ] [ 4.1.p1 ] [ 5.0 ] [ 5.0.p1 ] [ 5.1 ] [ 5.1.p1 ] [ 5.2 ] [ 5.2.p1 ] [ 5.2.p2 ] [ 6.0 ] [ 6.0.p1 ] [ 6.1 ] [ 6.2 ] [ 6.2.p1 ] [ 6.2.p2 ] [ 7.0 ] [ 7.0.p1 ] [ 7.1 ] [ 7.1.p1 ] [ 8.0 ] [ 8.0.p1 ] [ 8.1 ] [ 8.1.p1 ] [ 8.1.p2 ] [ 8.2 ] [ 8.2.p1 ] [ 8.3 ] [ 8.3.p1 ] [ 8.3.p2 ] [ 9.0 ] [ 9.0.p1 ] [ 9.0.p2 ] [ 9.1 ] [ 9.1.p1 ] [ 9.1.p2 ] [ 9.1.p3 ] [ 9.2 ] [ 9.2.p1 ] [ 9.2.p2 ] [ 9.2.p3 ] [ 9.2.p4 ] [ 9.3 ] [ 9.3.p1 ] [ 9.3.p2 ] [ 9.4 ] [ 9.4.p1 ] [ 9.4.p2 ] [ 9.4.p3 ] [ 9.4.p4 ] [ 9.5 ] [ 9.5.p1 ] [ 9.5.p2 ] [ 9.6 ] [ 9.6.p1 ] [ 9.6.p2 ] [ 9.6.p3 ] [ 9.6.p4 ] [ 10.0 ] [ 10.0.p1 ] [ 10.0.p2 ] [ 10.0.p3 ] [ 10.0.p4 ] [ 10.1 ] [ 10.1.p1 ] [ 10.1.p2 ] [ 10.1.p3 ] [ 10.2 ] [ 10.2.p1 ] [ 10.2.p2 ] [ 10.2.p3 ] [ 10.3 ] [ 10.3.p1 ] [ 10.3.p2 ] [ 10.3.p3 ] [ 10.4 ] [ 10.4.p1 ] [ 10.4.p2 ] [ 10.4.p3 ] [ 10.5 ] [ 10.5.p1 ] [ 10.6 ] [ 10.6.p1 ] [ 10.6.p2 ] [ 10.6.p3 ] [ 10.7 ] [ 10.7.p1 ] [ 10.7.p2 ] [ 10.7.p3 ] [ 10.7.p4 ] [ 11.0 ] [ 11.0.p1 ] [ 11.0.p2 ] [ 11.0.p3, ] [ 11.0.p4 ] [ 11.1 ] [ 11.1.1 ] [ 11.1.2 ] [ 11.1.3 ] [ 11.2 ] [ 11.2.1 ] [ 11.2.2 ] [ 11.3.0 ]

Diff markup

Differences between /processes/electromagnetic/lowenergy/src/G4LinLogLogInterpolation.cc (Version 11.3.0) and /processes/electromagnetic/lowenergy/src/G4LinLogLogInterpolation.cc (Version 9.1.p3)


  1 //                                                  1 //
  2 // *******************************************      2 // ********************************************************************
  3 // * License and Disclaimer                         3 // * License and Disclaimer                                           *
  4 // *                                                4 // *                                                                  *
  5 // * The  Geant4 software  is  copyright of th      5 // * The  Geant4 software  is  copyright of the Copyright Holders  of *
  6 // * the Geant4 Collaboration.  It is provided      6 // * the Geant4 Collaboration.  It is provided  under  the terms  and *
  7 // * conditions of the Geant4 Software License      7 // * conditions of the Geant4 Software License,  included in the file *
  8 // * LICENSE and available at  http://cern.ch/      8 // * LICENSE and available at  http://cern.ch/geant4/license .  These *
  9 // * include a list of copyright holders.           9 // * include a list of copyright holders.                             *
 10 // *                                               10 // *                                                                  *
 11 // * Neither the authors of this software syst     11 // * Neither the authors of this software system, nor their employing *
 12 // * institutes,nor the agencies providing fin     12 // * institutes,nor the agencies providing financial support for this *
 13 // * work  make  any representation or  warran     13 // * work  make  any representation or  warranty, express or implied, *
 14 // * regarding  this  software system or assum     14 // * regarding  this  software system or assume any liability for its *
 15 // * use.  Please see the license in the file      15 // * use.  Please see the license in the file  LICENSE  and URL above *
 16 // * for the full disclaimer and the limitatio     16 // * for the full disclaimer and the limitation of liability.         *
 17 // *                                               17 // *                                                                  *
 18 // * This  code  implementation is the result      18 // * This  code  implementation is the result of  the  scientific and *
 19 // * technical work of the GEANT4 collaboratio     19 // * technical work of the GEANT4 collaboration.                      *
 20 // * By using,  copying,  modifying or  distri     20 // * By using,  copying,  modifying or  distributing the software (or *
 21 // * any work based  on the software)  you  ag     21 // * any work based  on the software)  you  agree  to acknowledge its *
 22 // * use  in  resulting  scientific  publicati     22 // * use  in  resulting  scientific  publications,  and indicate your *
 23 // * acceptance of all terms of the Geant4 Sof     23 // * acceptance of all terms of the Geant4 Software license.          *
 24 // *******************************************     24 // ********************************************************************
 25 //                                                 25 //
 26 //                                                 26 //
 27 // Author:  Vladimir Ivanchenko (Vladimir.Ivan     27 // Author:  Vladimir Ivanchenko (Vladimir.Ivantchenko@cern.ch)
 28 //                                                 28 //
 29 // History:                                        29 // History:
 30 // -----------                                     30 // -----------
 31 // 29 May 2002   VI        Created                 31 // 29 May 2002   VI        Created
 32 //                                                 32 //
 33 // -------------------------------------------     33 // -------------------------------------------------------------------
 34                                                    34 
 35 #include "G4LinLogLogInterpolation.hh"             35 #include "G4LinLogLogInterpolation.hh"
 36                                                    36 
 37 // Constructor                                     37 // Constructor
 38                                                    38 
 39 G4LinLogLogInterpolation::G4LinLogLogInterpola     39 G4LinLogLogInterpolation::G4LinLogLogInterpolation()
 40 { }                                                40 { }
 41                                                    41 
 42 // Destructor                                      42 // Destructor
 43                                                    43 
 44 G4LinLogLogInterpolation::~G4LinLogLogInterpol     44 G4LinLogLogInterpolation::~G4LinLogLogInterpolation()
 45 { }                                                45 { }
 46                                                    46 
 47 G4VDataSetAlgorithm* G4LinLogLogInterpolation:     47 G4VDataSetAlgorithm* G4LinLogLogInterpolation::Clone() const 
 48 { return new G4LinLogLogInterpolation; }           48 { return new G4LinLogLogInterpolation; }
 49                                                    49 
 50                                                    50 
 51 G4double G4LinLogLogInterpolation::Calculate(G     51 G4double G4LinLogLogInterpolation::Calculate(G4double x, G4int bin, 
 52             const G4DataVector& points,            52             const G4DataVector& points, 
 53             const G4DataVector& data) const        53             const G4DataVector& data) const
 54 {                                                  54 {
 55   //G4cout << "G4LinLogLogInterpolation is per <<  55   G4int nBins = data.size() - 1;
 56   G4int nBins = G4int(data.size() - 1);        << 
 57   G4double value = 0.;                             56   G4double value = 0.;
 58   if (x < points[0])                               57   if (x < points[0])
 59     {                                              58     {
 60       value = 0.;                                  59       value = 0.;
 61     }                                              60     }
 62   else if (bin < nBins)                            61   else if (bin < nBins)
 63     {                                              62     {
 64       G4double e1 = points[bin];                   63       G4double e1 = points[bin];
 65       G4double e2 = points[bin+1];                 64       G4double e2 = points[bin+1];
 66       G4double d1 = data[bin];                     65       G4double d1 = data[bin];
 67       G4double d2 = data[bin+1];                   66       G4double d2 = data[bin+1];
 68       if(d1 > 0.0 && d2 > 0.0) {                   67       if(d1 > 0.0 && d2 > 0.0) {
 69         value = (std::log10(d1)*std::log10(e2/     68         value = (std::log10(d1)*std::log10(e2/x) + std::log10(d2)*std::log10(x/e1)) / std::log10(e2/e1);
 70         value = std::pow(10.,value);               69         value = std::pow(10.,value);
 71       } else {                                     70       } else {
 72         value = (d1*std::log10(e2/x) + d2*std:     71         value = (d1*std::log10(e2/x) + d2*std::log10(x/e1)) / std::log10(e2/e1);
 73       }                                            72       }
 74     }                                              73     }
 75   else                                             74   else
 76     {                                              75     {
 77       value = data[nBins];                         76       value = data[nBins];
 78     }                                              77     }
 79                                                    78 
 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;                                    79   return value;
142 }                                                  80 }
143                                                    81