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