| 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 // MODULE: G4NucleusLimits.cc 28 // MODULE: G4NucleusLimits.cc
29 // 29 //
30 // Version: 0.b.4 30 // Version: 0.b.4
31 // Date: 14/04/00 31 // Date: 14/04/00
32 // Author: F Lei & P R Truscott 32 // Author: F Lei & P R Truscott
33 // Organisation: DERA UK 33 // Organisation: DERA UK
34 // Customer: ESA/ESTEC, NOORDWIJK 34 // Customer: ESA/ESTEC, NOORDWIJK
35 // Contract: 12115/96/JG/NL Work Or 35 // Contract: 12115/96/JG/NL Work Order No. 3
36 // 36 //
37 // %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 37 // %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
38 // 38 //
39 // CHANGE HISTORY 39 // CHANGE HISTORY
40 // -------------- 40 // --------------
41 // 41 //
42 // 29 February 2000, P R Truscott, DERA UK 42 // 29 February 2000, P R Truscott, DERA UK
43 // 0.b.3 release. 43 // 0.b.3 release.
44 // 44 //
45 // 14 April 2000, F Lei, DERA UK 45 // 14 April 2000, F Lei, DERA UK
46 // 0.b.4 release. No change in this class 46 // 0.b.4 release. No change in this class
47 // << 47
48 // 02 November 2011, L Desorgher <<
49 // Remove the maximum limits of A<250 and Z<1 <<
50 // %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 48 // %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
51 ////////////////////////////////////////////// 49 ///////////////////////////////////////////////////////////////////////////////
52 // 50 //
53 #include "G4NucleusLimits.hh" 51 #include "G4NucleusLimits.hh"
54 ////////////////////////////////////////////// 52 ////////////////////////////////////////////////////////////////////////////////
55 // 53 //
56 G4NucleusLimits::G4NucleusLimits () 54 G4NucleusLimits::G4NucleusLimits ()
57 : aMin(1), aMax(260), zMin(0), zMax(100) << 55 : aMin(1), aMax(250), zMin(0), zMax(100)
>> 56 //
58 // 57 //
59 // Default constructor sets the limits to co 58 // Default constructor sets the limits to cover all nuclei with Z<100.
60 // 59 //
61 {;} 60 {;}
62 ////////////////////////////////////////////// 61 ////////////////////////////////////////////////////////////////////////////////
63 // 62 //
64 G4NucleusLimits::G4NucleusLimits 63 G4NucleusLimits::G4NucleusLimits
65 (G4int aMin1, G4int aMax1, G4int zMin1, G4in 64 (G4int aMin1, G4int aMax1, G4int zMin1, G4int zMax1)
66 { 65 {
67 // 66 //
>> 67 //
68 // check that aMin1 is within [1, 250]. 68 // check that aMin1 is within [1, 250].
69 // 69 //
70 if (aMin1 < 1) {aMin = 1;} 70 if (aMin1 < 1) {aMin = 1;}
71 //else if (aMin1 > 250) {aMin = 240;} << 71 else if (aMin1 > 250) {aMin = 240;}
72 else {aMin = aMin1;} 72 else {aMin = aMin1;}
73 73
74 // 74 //
>> 75 //
75 // check that aMax1 is within [1, 250]. 76 // check that aMax1 is within [1, 250].
76 // 77 //
77 if (aMax1 < 1) {aMax = 1;} 78 if (aMax1 < 1) {aMax = 1;}
78 //else if (aMax1 > 250) {aMax = 250;} << 79 else if (aMax1 > 250) {aMax = 250;}
79 else {aMax = aMax1;} 80 else {aMax = aMax1;}
80 81
81 // 82 //
>> 83 //
82 // If aMin > aMax then swap them. 84 // If aMin > aMax then swap them.
83 // 85 //
84 if (aMin > aMax) { 86 if (aMin > aMax) {
85 G4int t = aMin; 87 G4int t = aMin;
86 aMin = aMax; 88 aMin = aMax;
87 aMax = t; 89 aMax = t;
88 } 90 }
89 // 91 //
>> 92 //
90 // check that zMin1 is within [0, 100]. 93 // check that zMin1 is within [0, 100].
91 // 94 //
92 if (zMin1 < 0) {zMin = 0;} 95 if (zMin1 < 0) {zMin = 0;}
93 //else if (zMin1 > 100) {zMin = 100;} << 96 else if (zMin1 > 100) {zMin = 100;}
94 else {zMin = zMin1;} 97 else {zMin = zMin1;}
95 98
96 // 99 //
>> 100 //
97 // check that zMax1 is within [0, 100]. 101 // check that zMax1 is within [0, 100].
98 // 102 //
99 if (zMax1 < 0) {zMax = 0;} 103 if (zMax1 < 0) {zMax = 0;}
100 //else if (zMax1 > 100) {zMax = 100;} << 104 else if (zMax1 > 100) {zMax = 100;}
101 else {zMax = zMax1;} 105 else {zMax = zMax1;}
102 106
103 // 107 //
>> 108 //
104 // If zMin > zMax then swap them. 109 // If zMin > zMax then swap them.
105 // 110 //
106 if (zMin > zMax) { 111 if (zMin > zMax) {
107 G4int t = zMin; 112 G4int t = zMin;
108 zMin = zMax; 113 zMin = zMax;
109 zMax = t; 114 zMax = t;
110 } 115 }
111 } <<
112 <<
113 116
>> 117 }
>> 118 ////////////////////////////////////////////////////////////////////////////////
>> 119 //
114 G4NucleusLimits::~G4NucleusLimits () 120 G4NucleusLimits::~G4NucleusLimits ()
115 {;} 121 {;}
116 << 122 ////////////////////////////////////////////////////////////////////////////////
117 << 123 //
118 std::ostream &operator << (std::ostream& strm, << 124 std::ostream &operator << (std::ostream &s, const G4NucleusLimits &q)
>> 125 //
>> 126 //
>> 127 // Definition of the insertion operator << to provide the nucleus limits to
>> 128 // ostream.
>> 129 //
119 { 130 {
120 // Definition of the insertion operator << t << 131 s <<"Atomic weight: " <<q.GetAMin() <<"->" <<q.GetAMax()
121 // ostream << 132 <<"Atomic number: " <<q.GetZMin() <<"->" <<q.GetZMax();
122 strm << "Atomic weight: " << q.GetAMin() << << 133 return s;
123 << "Atomic number: " << q.GetZMin() << <<
124 return strm; <<
125 } 134 }
>> 135 ////////////////////////////////////////////////////////////////////////////////
>> 136
>> 137
>> 138
126 139
127 140