| 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 // 26 //
27 // ------------------------------------------- 27 // -------------------------------------------------------------------
28 // GEANT4 Class file 28 // GEANT4 Class file
29 // 29 //
30 // For information related to this code c 30 // For information related to this code contact:
31 // 31 //
32 // File name: G4XAqmTotal 32 // File name: G4XAqmTotal
33 // 33 //
34 // Author: 34 // Author:
35 // 35 //
36 // Creation date: 15 April 1999 36 // Creation date: 15 April 1999
37 // 37 //
38 // Modifications: 38 // Modifications:
39 // 39 //
40 // Additive Quark Model total cross section 40 // Additive Quark Model total cross section
41 // (H.J. Lipkin and F. Scheck, Phys.Rev. 16 (1 41 // (H.J. Lipkin and F. Scheck, Phys.Rev. 16 (1966) 71
42 // 42 //
43 // ------------------------------------------- 43 // -------------------------------------------------------------------
44 44
45 #include "globals.hh" 45 #include "globals.hh"
46 #include "G4ios.hh" 46 #include "G4ios.hh"
47 #include "G4Pow.hh" 47 #include "G4Pow.hh"
48 #include "G4SystemOfUnits.hh" 48 #include "G4SystemOfUnits.hh"
49 #include "G4XAqmTotal.hh" 49 #include "G4XAqmTotal.hh"
50 #include "G4KineticTrack.hh" 50 #include "G4KineticTrack.hh"
51 #include "G4ParticleDefinition.hh" 51 #include "G4ParticleDefinition.hh"
52 52
53 53
54 // Validity range of this cross-section 54 // Validity range of this cross-section
55 const G4double G4XAqmTotal::_lowLimit = 0.; 55 const G4double G4XAqmTotal::_lowLimit = 0.;
56 const G4double G4XAqmTotal::_highLimit = DBL_M 56 const G4double G4XAqmTotal::_highLimit = DBL_MAX;
57 57
58 G4XAqmTotal::G4XAqmTotal() 58 G4XAqmTotal::G4XAqmTotal()
59 { 59 {
60 // As a first approximation the model is ass 60 // As a first approximation the model is assumed to be valid over
61 // the entire energy range 61 // the entire energy range
62 } 62 }
63 63
64 64
65 G4XAqmTotal::~G4XAqmTotal() 65 G4XAqmTotal::~G4XAqmTotal()
66 { } 66 { }
67 67
68 68
69 G4bool G4XAqmTotal::operator==(const G4XAqmTot 69 G4bool G4XAqmTotal::operator==(const G4XAqmTotal &right) const
70 { 70 {
71 return (this == (G4XAqmTotal *) &right); 71 return (this == (G4XAqmTotal *) &right);
72 } 72 }
73 73
74 74
75 G4bool G4XAqmTotal::operator!=(const G4XAqmTot 75 G4bool G4XAqmTotal::operator!=(const G4XAqmTotal &right) const
76 { 76 {
77 return (this != (G4XAqmTotal *) &right); 77 return (this != (G4XAqmTotal *) &right);
78 } 78 }
79 79
80 80
81 G4double G4XAqmTotal::CrossSection(const G4Kin 81 G4double G4XAqmTotal::CrossSection(const G4KineticTrack& trk1, const G4KineticTrack& trk2) const
82 { 82 {
83 G4double sigma = 0.; 83 G4double sigma = 0.;
84 84
85 // Get strangeness content 85 // Get strangeness content
86 const G4ParticleDefinition* def1 = trk1.GetD 86 const G4ParticleDefinition* def1 = trk1.GetDefinition();
87 G4int sTrk1 = def1->GetQuarkContent(3) + def 87 G4int sTrk1 = def1->GetQuarkContent(3) + def1->GetAntiQuarkContent(3);
88 const G4ParticleDefinition* def2 = trk2.GetD 88 const G4ParticleDefinition* def2 = trk2.GetDefinition();
89 G4int sTrk2 = def2->GetQuarkContent(3) + def 89 G4int sTrk2 = def2->GetQuarkContent(3) + def2->GetAntiQuarkContent(3);
90 90
91 // Get non-strange quark content 91 // Get non-strange quark content
92 G4int qTrk1 = def1->GetQuarkContent(1) + def 92 G4int qTrk1 = def1->GetQuarkContent(1) + def1->GetAntiQuarkContent(1) +
93 def1->GetQuarkContent(2) + def 93 def1->GetQuarkContent(2) + def1->GetAntiQuarkContent(2) +
94 def1->GetQuarkContent(4) + def 94 def1->GetQuarkContent(4) + def1->GetAntiQuarkContent(4) +
95 def1->GetQuarkContent(5) + def 95 def1->GetQuarkContent(5) + def1->GetAntiQuarkContent(5) +
96 def1->GetQuarkContent(6) + def 96 def1->GetQuarkContent(6) + def1->GetAntiQuarkContent(6);
97 97
98 G4int qTrk2 = def2->GetQuarkContent(1) + def 98 G4int qTrk2 = def2->GetQuarkContent(1) + def2->GetAntiQuarkContent(1) +
99 def2->GetQuarkContent(2) + def 99 def2->GetQuarkContent(2) + def2->GetAntiQuarkContent(2) +
100 def2->GetQuarkContent(4) + def 100 def2->GetQuarkContent(4) + def2->GetAntiQuarkContent(4) +
101 def2->GetQuarkContent(5) + def 101 def2->GetQuarkContent(5) + def2->GetAntiQuarkContent(5) +
102 def2->GetQuarkContent(6) + def 102 def2->GetQuarkContent(6) + def2->GetAntiQuarkContent(6);
103 103
104 G4double sRatio1 = 0.; 104 G4double sRatio1 = 0.;
105 if (qTrk1 != 0) sRatio1 = sTrk1 / qTrk1; 105 if (qTrk1 != 0) sRatio1 = sTrk1 / qTrk1;
106 106
107 G4double sRatio2 = 0.; 107 G4double sRatio2 = 0.;
108 if (qTrk2 != 0) sRatio2 = sTrk2 / qTrk2; 108 if (qTrk2 != 0) sRatio2 = sTrk2 / qTrk2;
109 109
110 // Calculate the number of colliding mesons 110 // Calculate the number of colliding mesons
111 G4int nMesons = 0; 111 G4int nMesons = 0;
112 G4int nQ1 = sTrk1 + qTrk1; 112 G4int nQ1 = sTrk1 + qTrk1;
113 113
114 if (nQ1 == 2) nMesons++; 114 if (nQ1 == 2) nMesons++;
115 G4int nQ2 = sTrk2 + qTrk2; 115 G4int nQ2 = sTrk2 + qTrk2;
116 if (nQ2 == 2) nMesons++; 116 if (nQ2 == 2) nMesons++;
117 117
118 // Cross-section (units to be checked!) 118 // Cross-section (units to be checked!)
119 sigma = 40. * G4Pow::GetInstance()->powN((2. 119 sigma = 40. * G4Pow::GetInstance()->powN((2.0/3.0),nMesons) * (1. - 0.4 * sRatio1) * (1. - 0.4 * sRatio2) * millibarn;
120 120
121 return sigma; 121 return sigma;
122 } 122 }
123 123
124 124
125 G4String G4XAqmTotal::Name() const 125 G4String G4XAqmTotal::Name() const
126 { 126 {
127 G4String name("AqmTotalCrossSection"); 127 G4String name("AqmTotalCrossSection");
128 return name; 128 return name;
129 } 129 }
130 130
131 131
132 132
133 G4bool G4XAqmTotal::IsValid(G4double e) const 133 G4bool G4XAqmTotal::IsValid(G4double e) const
134 { 134 {
135 G4bool answer = InLimits(e,_lowLimit,_highLi 135 G4bool answer = InLimits(e,_lowLimit,_highLimit);
136 136
137 return answer; 137 return answer;
138 } 138 }
139 139