| Geant4 Cross Reference |
1 // 1 //
2 // ******************************************* 2 // ********************************************************************
3 // * License and Disclaimer << 3 // * DISCLAIMER *
4 // * 4 // * *
5 // * The Geant4 software is copyright of th << 5 // * The following disclaimer summarizes all the specific disclaimers *
6 // * the Geant4 Collaboration. It is provided << 6 // * of contributors to this software. The specific disclaimers,which *
7 // * conditions of the Geant4 Software License << 7 // * govern, are listed with their locations in: *
8 // * LICENSE and available at http://cern.ch/ << 8 // * http://cern.ch/geant4/license *
9 // * include a list of copyright holders. <<
10 // * 9 // * *
11 // * Neither the authors of this software syst 10 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing fin 11 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warran 12 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assum 13 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file << 14 // * use. *
16 // * for the full disclaimer and the limitatio <<
17 // * 15 // * *
18 // * This code implementation is the result << 16 // * This code implementation is the intellectual property of the *
19 // * technical work of the GEANT4 collaboratio << 17 // * GEANT4 collaboration. *
20 // * By using, copying, modifying or distri << 18 // * By copying, distributing or modifying the Program (or any work *
21 // * any work based on the software) you ag << 19 // * based on the Program) you indicate your acceptance of this *
22 // * use in resulting scientific publicati << 20 // * statement, and all its terms. *
23 // * acceptance of all terms of the Geant4 Sof <<
24 // ******************************************* 21 // ********************************************************************
25 // 22 //
26 // 23 //
27 // ------------------------------------------- 24 // -------------------------------------------------------------------
28 // GEANT4 Class file 25 // GEANT4 Class file
29 // 26 //
30 // For information related to this code c 27 // For information related to this code contact:
31 // 28 //
32 // File name: G4XAqmElastic 29 // File name: G4XAqmElastic
33 // 30 //
34 // Author: 31 // Author:
35 // 32 //
36 // Creation date: 15 April 1999 33 // Creation date: 15 April 1999
37 // 34 //
38 // Modifications: 35 // Modifications:
39 // 36 //
40 // Additive Quark Model Elastic cross section 37 // Additive Quark Model Elastic cross section
41 // (H.J. Lipkin and F. Scheck, Phys.Rev. 16 (1 38 // (H.J. Lipkin and F. Scheck, Phys.Rev. 16 (1966) 71
42 // 39 //
43 // ------------------------------------------- 40 // -------------------------------------------------------------------
44 41
45 #include "globals.hh" 42 #include "globals.hh"
46 #include "G4ios.hh" 43 #include "G4ios.hh"
47 #include "G4Pow.hh" <<
48 #include "G4XAqmElastic.hh" 44 #include "G4XAqmElastic.hh"
49 #include "G4XAqmTotal.hh" 45 #include "G4XAqmTotal.hh"
50 #include "G4KineticTrack.hh" 46 #include "G4KineticTrack.hh"
>> 47 #include "G4ParticleDefinition.hh"
51 48
52 49
53 // Validity range of this cross-section 50 // Validity range of this cross-section
54 const G4double G4XAqmElastic::_lowLimit = 0.; 51 const G4double G4XAqmElastic::_lowLimit = 0.;
55 const G4double G4XAqmElastic::_highLimit = DBL 52 const G4double G4XAqmElastic::_highLimit = DBL_MAX;
56 53
57 G4XAqmElastic::G4XAqmElastic() 54 G4XAqmElastic::G4XAqmElastic()
58 { 55 {
59 // As a first approximation the model is ass 56 // As a first approximation the model is assumed to be valid over
60 // the entire energy range 57 // the entire energy range
61 } 58 }
62 59
63 60
64 G4XAqmElastic::~G4XAqmElastic() 61 G4XAqmElastic::~G4XAqmElastic()
65 { } 62 { }
66 63
67 64
68 G4bool G4XAqmElastic::operator==(const G4XAqmE 65 G4bool G4XAqmElastic::operator==(const G4XAqmElastic &right) const
69 { 66 {
70 return (this == (G4XAqmElastic *) &right); 67 return (this == (G4XAqmElastic *) &right);
71 } 68 }
72 69
73 70
74 G4bool G4XAqmElastic::operator!=(const G4XAqmE 71 G4bool G4XAqmElastic::operator!=(const G4XAqmElastic &right) const
75 { 72 {
76 return (this != (G4XAqmElastic *) &right); 73 return (this != (G4XAqmElastic *) &right);
77 } 74 }
78 75
79 76
80 G4double G4XAqmElastic::CrossSection(const G4K 77 G4double G4XAqmElastic::CrossSection(const G4KineticTrack& trk1, const G4KineticTrack& trk2) const
81 { 78 {
82 G4double sigma = 0.; 79 G4double sigma = 0.;
83 80
84 // Reference to be checked!!!!!!!!!!!!!!!!!! 81 // Reference to be checked!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
85 static const G4double coeff = 0.39; << 82 const G4double coeff = 0.39;
86 static const G4double param = 1.5; << 83 const G4double param = 1.5;
87 84
88 G4XAqmTotal aqmTotal; 85 G4XAqmTotal aqmTotal;
89 86
90 G4double sigmaTot = aqmTotal.CrossSection(tr 87 G4double sigmaTot = aqmTotal.CrossSection(trk1,trk2);
91 sigma = coeff * G4Pow::GetInstance()->powA(s << 88 sigma = coeff * pow(sigmaTot,param);
92 89
93 // Verify that elastic cross section < total 90 // Verify that elastic cross section < total cross section
94 91
95 if (sigma > sigmaTot) 92 if (sigma > sigmaTot)
96 throw G4HadronicException(__FILE__, __LINE 93 throw G4HadronicException(__FILE__, __LINE__, "G4XAqmElastic::CrossSection - elastic cross section greater than total");
97 94
98 return sigma; 95 return sigma;
99 } 96 }
100 97
101 98
102 G4String G4XAqmElastic::Name() const 99 G4String G4XAqmElastic::Name() const
103 { 100 {
104 G4String name("AqmElasticCrossSection"); 101 G4String name("AqmElasticCrossSection");
105 return name; 102 return name;
106 } 103 }
107 104
108 105
109 G4bool G4XAqmElastic::IsValid(G4double e) cons 106 G4bool G4XAqmElastic::IsValid(G4double e) const
110 { 107 {
111 G4bool answer = InLimits(e,_lowLimit,_highLi 108 G4bool answer = InLimits(e,_lowLimit,_highLimit);
112 109
113 return answer; 110 return answer;
114 } 111 }
115 112