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 G4INCLInvFInterpolationTable.cc 38 /** \file G4INCLInvFInterpolationTable.cc 39 * \brief Simple interpolation table for the i 39 * \brief Simple interpolation table for the inverse of a IFunction1D functor 40 * 40 * 41 * \date 17 July 2012 41 * \date 17 July 2012 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 "G4INCLInvFInterpolationTable.hh" 48 #include "G4INCLInvFInterpolationTable.hh" 49 49 50 namespace G4INCL { 50 namespace G4INCL { 51 51 52 InvFInterpolationTable::InvFInterpolationTab 52 InvFInterpolationTable::InvFInterpolationTable(IFunction1D const &f, const unsigned int nNodes) { 53 // assert(nNodes>2); 53 // assert(nNodes>2); 54 54 55 const G4double x0 = f.getXMinimum(); 55 const G4double x0 = f.getXMinimum(); 56 const G4double x1 = f.getXMaximum(); 56 const G4double x1 = f.getXMaximum(); 57 57 58 // Build the nodes 58 // Build the nodes 59 G4double last = f(x0); 59 G4double last = f(x0); 60 InterpolationNode firstNode(last, x0, 0.); 60 InterpolationNode firstNode(last, x0, 0.); 61 nodes.push_back(firstNode); 61 nodes.push_back(firstNode); 62 //G4int skippedNodes = 0; << 62 // G4int skippedNodes = 0; 63 for(unsigned i = 1; i < nNodes; i++) { 63 for(unsigned i = 1; i < nNodes; i++) { 64 const G4double xi = x0 + i*(x1-x0)/((G4d 64 const G4double xi = x0 + i*(x1-x0)/((G4double)(nNodes-1)); 65 // Make sure that the x vector is sorted 65 // Make sure that the x vector is sorted (corresponding to a monotonous 66 // function) 66 // function) 67 const G4double value = f(xi); 67 const G4double value = f(xi); 68 if(value <= last) { 68 if(value <= last) { 69 //++skippedNodes; << 69 // ++skippedNodes; 70 continue; 70 continue; 71 } 71 } 72 InterpolationNode node(value, xi, 0.); 72 InterpolationNode node(value, xi, 0.); 73 nodes.push_back(node); 73 nodes.push_back(node); 74 last = value; 74 last = value; 75 } 75 } 76 76 77 // assert(nNodes==nodes.size()+skippedNodes); 77 // assert(nNodes==nodes.size()+skippedNodes); 78 78 79 // Initialise the "derivative" values 79 // Initialise the "derivative" values 80 initDerivatives(); 80 initDerivatives(); 81 } 81 } 82 82 83 } 83 } 84 84