| 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 // INCL++ intra-nuclear cascade model
27 // Alain Boudard, CEA-Saclay, France
28 // Joseph Cugnon, University of Liege, Belgium
29 // Jean-Christophe David, CEA-Saclay, France
30 // Pekka Kaitaniemi, CEA-Saclay, France, and Helsinki Institute of Physics, Finland
31 // Sylvie Leray, CEA-Saclay, France
32 // Davide Mancusi, CEA-Saclay, France
33 //
34 #define INCLXX_IN_GEANT4_MODE 1
35
36 #include "globals.hh"
37
38 /** \file G4INCLInterpolationTable.cc
39 * \brief Simple interpolation table
40 *
41 * \date 30 January 2014
42 * \author Davide Mancusi
43 */
44
45 // #include <cassert>
46 #include <algorithm>
47 #include <functional>
48 #include "G4INCLInterpolationTable.hh"
49
50 namespace G4INCL {
51
52 InterpolationTable::InterpolationTable() : IFunction1D() {}
53
54 InterpolationTable::InterpolationTable(std::vector<G4double> const &x, std::vector<G4double> const &y)
55 : IFunction1D(x.front(), x.back())
56 {
57 // assert(x.size()==y.size());
58 // Assert that the x vector is sorted
59 // assert(std::adjacent_find(nodes.begin(), nodes.end(), std::greater<InterpolationNode>()) == nodes.end());
60
61 for(unsigned i = 0; i < x.size(); ++i)
62 nodes.push_back(InterpolationNode(x.at(i), y.at(i), 0.));
63
64 initDerivatives();
65 }
66
67 std::vector<G4double> InterpolationTable::getNodeAbscissae() const {
68 std::vector<G4double> x(nodes.size());
69 std::transform(nodes.begin(), nodes.end(), x.begin(),
70 std::mem_fn(&InterpolationNode::getX));
71 return x;
72 }
73
74 std::vector<G4double> InterpolationTable::getNodeValues() const {
75 std::vector<G4double> y(nodes.size());
76 std::transform(nodes.begin(), nodes.end(), y.begin(),
77 std::mem_fn(&InterpolationNode::getY));
78 return y;
79 }
80
81 void InterpolationTable::initDerivatives() {
82 for(unsigned i = 0; i < nodes.size()-1; i++) {
83 if((nodes.at(i+1).getX() - nodes.at(i).getX()) == 0.0) // Safeguard against division by zero
84 nodes[i].setYPrime(0.0);
85 else
86 nodes[i].setYPrime((nodes.at(i+1).getY() - nodes.at(i).getY())/(nodes.at(i+1).getX() - nodes.at(i).getX()));
87 }
88 nodes.back().setYPrime(nodes.at(nodes.size()-2).getYPrime()); // Duplicate the last value
89 }
90
91 G4double InterpolationTable::operator()(const G4double x) const {
92 // Find the relevant interpolation bin
93 InterpolationNode xNode(x,0.,0.);
94 std::vector<InterpolationNode>::const_iterator iter =
95 std::lower_bound(nodes.begin(), nodes.end(), xNode);
96
97 if(iter==nodes.begin())
98 return nodes.front().getY();
99
100 if(iter==nodes.end())
101 return nodes.back().getY();
102
103 std::vector<InterpolationNode>::const_iterator previousIter = iter - 1;
104 const G4double dx = x - previousIter->getX();
105 return previousIter->getY() + previousIter->getYPrime()*dx;
106 }
107
108 std::string InterpolationTable::print() const {
109 std::string message;
110 for(std::vector<InterpolationNode>::const_iterator n=nodes.begin(), e=nodes.end(); n!=e; ++n)
111 message += n->print();
112 return message;
113 }
114
115 }
116