| 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 // Pekka Kaitaniemi, CEA and Helsinki Institute of Physics
28 // Joseph Cugnon, University of Liege, Belgium << 28 // Davide Mancusi, CEA
29 // Jean-Christophe David, CEA-Saclay, France << 29 // Alain Boudard, CEA
30 // Pekka Kaitaniemi, CEA-Saclay, France, and H << 30 // Sylvie Leray, CEA
31 // Sylvie Leray, CEA-Saclay, France << 31 // Joseph Cugnon, University of Liege
32 // Davide Mancusi, CEA-Saclay, France << 32 //
>> 33 // INCL++ revision: v5.1.8
33 // 34 //
34 #define INCLXX_IN_GEANT4_MODE 1 35 #define INCLXX_IN_GEANT4_MODE 1
35 36
36 #include "globals.hh" 37 #include "globals.hh"
37 38
38 /** \file G4INCLIFunction1D.cc 39 /** \file G4INCLIFunction1D.cc
39 * \brief Functor for 1-dimensional mathematic 40 * \brief Functor for 1-dimensional mathematical functions
40 * 41 *
41 * \date 16 July 2011 42 * \date 16 July 2011
42 * \author Davide Mancusi 43 * \author Davide Mancusi
43 */ 44 */
44 45
45 #include <algorithm> 46 #include <algorithm>
46 #include <cmath> 47 #include <cmath>
47 #include <cstdlib> 48 #include <cstdlib>
48 #include "G4INCLIFunction1D.hh" 49 #include "G4INCLIFunction1D.hh"
49 #include "G4INCLLogger.hh" 50 #include "G4INCLLogger.hh"
50 #include "G4INCLInvFInterpolationTable.hh" << 51 #include "G4INCLInverseInterpolationTable.hh"
51 52
52 namespace G4INCL { 53 namespace G4INCL {
53 54
54 const G4double IFunction1D::integrationCoeff 55 const G4double IFunction1D::integrationCoefficients[] = {
55 2.*95.0/288.0, 56 2.*95.0/288.0,
56 317.0/240.0, 57 317.0/240.0,
57 23.0/30.0, 58 23.0/30.0,
58 793.0/720.0, 59 793.0/720.0,
59 157.0/160.0, 60 157.0/160.0,
60 157.0/160.0, 61 157.0/160.0,
61 793.0/720.0, 62 793.0/720.0,
62 23.0/30.0, 63 23.0/30.0,
63 317.0/240.0, 64 317.0/240.0,
64 }; 65 };
65 66
66 G4double IFunction1D::integrate(const G4doub 67 G4double IFunction1D::integrate(const G4double x0, const G4double x1, const G4double step) const {
67 G4double xi = std::max(x0, xMin); 68 G4double xi = std::max(x0, xMin);
68 G4double xa = std::min(x1, xMax); 69 G4double xa = std::min(x1, xMax);
69 G4double sign; 70 G4double sign;
70 71
71 if(x1 <= x0) { 72 if(x1 <= x0) {
72 sign = -1.0; 73 sign = -1.0;
73 std::swap(xi, xa); 74 std::swap(xi, xa);
74 } else 75 } else
75 sign = 1.0; 76 sign = 1.0;
76 77
77 const G4double interval = xa - xi; 78 const G4double interval = xa - xi;
78 79
79 G4int nIntervals; 80 G4int nIntervals;
80 if(step<0.) { 81 if(step<0.) {
81 nIntervals = 45; 82 nIntervals = 45;
82 } else { 83 } else {
83 nIntervals = G4int(interval/step); 84 nIntervals = G4int(interval/step);
84 85
85 // Round up nIntervals to the closest mu 86 // Round up nIntervals to the closest multiple of 9
86 G4int remainder = nIntervals % 9; 87 G4int remainder = nIntervals % 9;
87 if (remainder != 0) 88 if (remainder != 0)
88 nIntervals += 9 - remainder; 89 nIntervals += 9 - remainder;
89 90
90 nIntervals = std::max(nIntervals, 9); 91 nIntervals = std::max(nIntervals, 9);
91 } 92 }
92 93
93 const G4double dx = interval/nIntervals; 94 const G4double dx = interval/nIntervals;
94 G4double result = (operator()(xi) + operat 95 G4double result = (operator()(xi) + operator()(xa)) * integrationCoefficients[0]/2;
95 for(G4int j = 1; j<nIntervals; ++j) { 96 for(G4int j = 1; j<nIntervals; ++j) {
96 const G4double x = xi + interval*G4doubl 97 const G4double x = xi + interval*G4double(j)/G4double(nIntervals);
97 const unsigned index = j%9; 98 const unsigned index = j%9;
98 result += operator()(x) * integrationCoe 99 result += operator()(x) * integrationCoefficients[index];
99 } 100 }
100 101
101 return result*dx*sign; 102 return result*dx*sign;
102 103
103 } 104 }
104 105
105 IFunction1D *IFunction1D::primitive() const 106 IFunction1D *IFunction1D::primitive() const {
106 class Primitive : public IFunction1D { 107 class Primitive : public IFunction1D {
107 public: 108 public:
108 Primitive(IFunction1D const * const f) 109 Primitive(IFunction1D const * const f) :
109 IFunction1D(f->getXMinimum(), f->get 110 IFunction1D(f->getXMinimum(), f->getXMaximum()),
110 theFunction(f) 111 theFunction(f)
111 {} 112 {}
112 113
113 G4double operator()(const G4double x) 114 G4double operator()(const G4double x) const {
114 return theFunction->integrate(xMin,x 115 return theFunction->integrate(xMin,x);
115 } 116 }
116 private: 117 private:
117 IFunction1D const * const theFunction; 118 IFunction1D const * const theFunction;
118 } *thePrimitive = new Primitive(this); 119 } *thePrimitive = new Primitive(this);
119 120
120 return thePrimitive; 121 return thePrimitive;
121 } 122 }
122 123
123 InterpolationTable *IFunction1D::inverseCDFT << 124 InverseInterpolationTable *IFunction1D::inverseCDFTable(const G4int nNodes) const {
124 class InverseCDF : public IFunction1D { 125 class InverseCDF : public IFunction1D {
125 public: 126 public:
126 InverseCDF(IFunction1D const * const f << 127 InverseCDF(IFunction1D const * const f) :
127 IFunction1D(f->getXMinimum(), f->get 128 IFunction1D(f->getXMinimum(), f->getXMaximum()),
128 theFunction(f), 129 theFunction(f),
129 normalisation(1./theFunction->integr << 130 normalisation(1./theFunction->integrate(xMin,xMax))
130 fWrap(fw) <<
131 {} 131 {}
132 132
133 G4double operator()(const G4double x) 133 G4double operator()(const G4double x) const {
134 if(fWrap) << 134 return std::min(1., normalisation * theFunction->integrate(xMin,x));
135 return fWrap(std::min(1., normalis <<
136 else <<
137 return std::min(1., normalisation <<
138 } 135 }
139 private: 136 private:
140 IFunction1D const * const theFunction; 137 IFunction1D const * const theFunction;
141 const G4double normalisation; 138 const G4double normalisation;
142 ManipulatorFunc fWrap; << 139 } *theInverseCDF = new InverseCDF(this);
143 } *theInverseCDF = new InverseCDF(this, fW <<
144 140
145 InterpolationTable *theTable = new InvFInt << 141 InverseInterpolationTable *theTable = new InverseInterpolationTable(*theInverseCDF, nNodes);
146 delete theInverseCDF; 142 delete theInverseCDF;
147 return theTable; 143 return theTable;
148 } 144 }
>> 145
149 } 146 }
150 147
151 148