| 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 | // $Id: G4LinInterpolation.cc,v 1.3 2006/06/29 19:40:03 gunter Exp $
|
|---|
| 28 | // GEANT4 tag $Name: geant4-09-02 $
|
|---|
| 29 | //
|
|---|
| 30 | // Author: Maria Grazia Pia (Maria.Grazia.Pia@cern.ch)
|
|---|
| 31 | //
|
|---|
| 32 | // History:
|
|---|
| 33 | // -----------
|
|---|
| 34 | // 31 Jul 2001 MGP Created
|
|---|
| 35 | //
|
|---|
| 36 | // -------------------------------------------------------------------
|
|---|
| 37 |
|
|---|
| 38 | #include "G4LinInterpolation.hh"
|
|---|
| 39 |
|
|---|
| 40 | // Constructor
|
|---|
| 41 |
|
|---|
| 42 | G4LinInterpolation::G4LinInterpolation()
|
|---|
| 43 | { }
|
|---|
| 44 |
|
|---|
| 45 | // Destructor
|
|---|
| 46 |
|
|---|
| 47 | G4LinInterpolation::~G4LinInterpolation()
|
|---|
| 48 | { }
|
|---|
| 49 |
|
|---|
| 50 |
|
|---|
| 51 | G4VDataSetAlgorithm* G4LinInterpolation::Clone() const
|
|---|
| 52 | { return new G4LinInterpolation; }
|
|---|
| 53 |
|
|---|
| 54 | G4double G4LinInterpolation::Calculate(G4double x, G4int bin,
|
|---|
| 55 | const G4DataVector& points,
|
|---|
| 56 | const G4DataVector& data) const
|
|---|
| 57 | {
|
|---|
| 58 | G4int nBins = 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 + (d2 - d1)*(x - e1)/(e2 - e1);
|
|---|
| 71 | }
|
|---|
| 72 | else
|
|---|
| 73 | {
|
|---|
| 74 | value = data[nBins];
|
|---|
| 75 | }
|
|---|
| 76 | return value;
|
|---|
| 77 | }
|
|---|
