| 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 G4INCLCrossSectionsTruncatedMultiPio
39 * \brief Truncated multipion cross sections
40 *
41 * \date 10th December 2014
42 * \author Davide Mancusi
43 */
44
45 #include "G4INCLCrossSectionsTruncatedMultiPio
46 // #include <cassert>
47
48 namespace G4INCL {
49
50 CrossSectionsTruncatedMultiPions::CrossSecti
51 nMaxPi(nPi)
52 {}
53
54 G4double CrossSectionsTruncatedMultiPions::e
55 // if(!p1->isPion() && !p2->isPion()) {
56 if((p1->isNucleon()||p1->isDelta()) && (p
57 return NNElastic(p1, p2);
58 }
59 // else if (p1->isNucleon() || p2->isNucleon(
60 else if ((p1->isNucleon() && p2->isPion()
61 G4double pielas = piNTot(p1,p2) - piNIne
62 if (pielas < 0.)
63 pielas = 0.;
64 return pielas;
65 } else
66 return 0.0;
67 }
68
69 G4double CrossSectionsTruncatedMultiPions::p
70 G4double sum = CrossSectionsMultiPions::pi
71 if(nMaxPi<=1) {
72 for(G4int i=nMaxPi+1; i<=nMaxPiPiN; ++i)
73 sum += CrossSectionsMultiPions::piNTox
74 }
75 return sum;
76 }
77
78 G4double CrossSectionsTruncatedMultiPions::N
79 if(xpi<nMaxPi)
80 return CrossSectionsMultiPions::NNToxPiN
81 else if(xpi==nMaxPi) {
82 G4double sum = 0.;
83 for(G4int i=xpi; i<=nMaxPiNN; ++i)
84 sum += CrossSectionsMultiPions::NNToxP
85 return sum;
86 } else
87 return 0.;
88 }
89
90 G4double CrossSectionsTruncatedMultiPions::p
91 if(xpi<nMaxPi)
92 return CrossSectionsMultiPions::piNToxPi
93 else if(xpi==nMaxPi) {
94 G4double sum = 0.;
95 for(G4int i=xpi; i<=nMaxPiPiN; ++i)
96 sum += CrossSectionsMultiPions::piNTox
97 return sum;
98 } else
99 return 0.;
100 }
101
102 } // namespace G4INCL
103
104