| Geant4 Cross Reference |
1 // 1
2 // *******************************************
3 // * License and Disclaimer
4 // *
5 // * The Geant4 software is copyright of th
6 // * the Geant4 Collaboration. It is provided
7 // * conditions of the Geant4 Software License
8 // * LICENSE and available at http://cern.ch/
9 // * include a list of copyright holders.
10 // *
11 // * Neither the authors of this software syst
12 // * institutes,nor the agencies providing fin
13 // * work make any representation or warran
14 // * regarding this software system or assum
15 // * use. Please see the license in the file
16 // * for the full disclaimer and the limitatio
17 // *
18 // * This code implementation is the result
19 // * technical work of the GEANT4 collaboratio
20 // * By using, copying, modifying or distri
21 // * any work based on the software) you ag
22 // * use in resulting scientific publicati
23 // * acceptance of all terms of the Geant4 Sof
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 H
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 G4INCLInvFInterpolationTable.cc
39 * \brief Simple interpolation table for the i
40 *
41 * \date 17 July 2012
42 * \author Davide Mancusi
43 */
44
45 // #include <cassert>
46 #include <algorithm>
47 #include <functional>
48 #include "G4INCLInvFInterpolationTable.hh"
49
50 namespace G4INCL {
51
52 InvFInterpolationTable::InvFInterpolationTab
53 // assert(nNodes>2);
54
55 const G4double x0 = f.getXMinimum();
56 const G4double x1 = f.getXMaximum();
57
58 // Build the nodes
59 G4double last = f(x0);
60 InterpolationNode firstNode(last, x0, 0.);
61 nodes.push_back(firstNode);
62 //G4int skippedNodes = 0;
63 for(unsigned i = 1; i < nNodes; i++) {
64 const G4double xi = x0 + i*(x1-x0)/((G4d
65 // Make sure that the x vector is sorted
66 // function)
67 const G4double value = f(xi);
68 if(value <= last) {
69 //++skippedNodes;
70 continue;
71 }
72 InterpolationNode node(value, xi, 0.);
73 nodes.push_back(node);
74 last = value;
75 }
76
77 // assert(nNodes==nodes.size()+skippedNodes);
78
79 // Initialise the "derivative" values
80 initDerivatives();
81 }
82
83 }
84