| 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 // G4SmartTrackStack class implementation 26 // G4SmartTrackStack class implementation
27 // 27 //
28 // Author: S.Kamperis - 4 October 2012 28 // Author: S.Kamperis - 4 October 2012
29 // ------------------------------------------- 29 // --------------------------------------------------------------------
30 30
31 #include "G4SmartTrackStack.hh" 31 #include "G4SmartTrackStack.hh"
32 #include "G4VTrajectory.hh" 32 #include "G4VTrajectory.hh"
33 #include "G4Track.hh" 33 #include "G4Track.hh"
34 34
35 void G4SmartTrackStack::dumpStatistics() 35 void G4SmartTrackStack::dumpStatistics()
36 { 36 {
37 // Print to stderr so that we can split stat 37 // Print to stderr so that we can split stats output from normal
38 // output of Geant4 which is typically being 38 // output of Geant4 which is typically being printed to stdout
39 for (G4int i=0; i<nTurn; ++i) 39 for (G4int i=0; i<nTurn; ++i)
40 { 40 {
41 G4cerr << stacks[i]->GetNTrack() << " "; 41 G4cerr << stacks[i]->GetNTrack() << " ";
42 G4cerr << stacks[i]->getTotalEnergy() << " 42 G4cerr << stacks[i]->getTotalEnergy() << " ";
43 } 43 }
44 G4cerr << G4endl; 44 G4cerr << G4endl;
45 } 45 }
46 46
47 G4SmartTrackStack::G4SmartTrackStack() 47 G4SmartTrackStack::G4SmartTrackStack()
48 { 48 {
49 for(G4int i=0; i<nTurn; ++i) 49 for(G4int i=0; i<nTurn; ++i)
50 { 50 {
51 stacks[i] = new G4TrackStack(5000); 51 stacks[i] = new G4TrackStack(5000);
52 energies[i] = 0.; 52 energies[i] = 0.;
53 } 53 }
54 } 54 }
55 55
56 G4SmartTrackStack::~G4SmartTrackStack() 56 G4SmartTrackStack::~G4SmartTrackStack()
57 { 57 {
58 for (auto* sp : stacks) 58 for (auto* sp : stacks)
59 { 59 {
60 delete sp; 60 delete sp;
61 } 61 }
62 } 62 }
63 63
64 void G4SmartTrackStack::TransferTo(G4TrackStac 64 void G4SmartTrackStack::TransferTo(G4TrackStack* aStack)
65 { 65 {
66 for (auto* sp : stacks) 66 for (auto* sp : stacks)
67 { 67 {
68 sp->TransferTo(aStack); 68 sp->TransferTo(aStack);
69 } 69 }
70 nTracks = 0; 70 nTracks = 0;
71 } 71 }
72 72
73 G4StackedTrack G4SmartTrackStack::PopFromStack 73 G4StackedTrack G4SmartTrackStack::PopFromStack()
74 { 74 {
75 G4StackedTrack aStackedTrack; 75 G4StackedTrack aStackedTrack;
76 76
77 if (nTracks != 0) 77 if (nTracks != 0)
78 { 78 {
79 while (true) 79 while (true)
80 { 80 {
81 if (stacks[fTurn]->GetNTrack() != 0u) 81 if (stacks[fTurn]->GetNTrack() != 0u)
82 { 82 {
83 aStackedTrack = stacks[fTurn]->PopFrom 83 aStackedTrack = stacks[fTurn]->PopFromStack();
84 energies[fTurn] -= aStackedTrack.GetTr 84 energies[fTurn] -= aStackedTrack.GetTrack()->GetDynamicParticle()->GetTotalEnergy();
85 --nTracks; 85 --nTracks;
86 break; 86 break;
87 } 87 }
88 88
89 fTurn = (fTurn+1) % nTurn; 89 fTurn = (fTurn+1) % nTurn;
90 } 90 }
91 } 91 }
92 92
93 return aStackedTrack; 93 return aStackedTrack;
94 } 94 }
95 95
96 enum 96 enum
97 { 97 {
98 electronCode = 11, positronCode = -11, gamma 98 electronCode = 11, positronCode = -11, gammaCode = 22, neutronCode = 2112
99 }; 99 };
100 100
101 void G4SmartTrackStack::PushToStack( const G4S 101 void G4SmartTrackStack::PushToStack( const G4StackedTrack& aStackedTrack )
102 { 102 {
103 103
104 G4int iDest = 0; 104 G4int iDest = 0;
105 if (aStackedTrack.GetTrack()->GetParentID() 105 if (aStackedTrack.GetTrack()->GetParentID() != 0)
106 { 106 {
107 G4int code = aStackedTrack.GetTrack()->Get 107 G4int code = aStackedTrack.GetTrack()->GetDynamicParticle()->GetPDGcode();
108 if (code == electronCode) 108 if (code == electronCode)
109 iDest = 2; 109 iDest = 2;
110 else if (code == gammaCode) 110 else if (code == gammaCode)
111 iDest = 3; 111 iDest = 3;
112 else if (code == positronCode) 112 else if (code == positronCode)
113 iDest = 4; 113 iDest = 4;
114 else if (code == neutronCode) 114 else if (code == neutronCode)
115 iDest = 1; 115 iDest = 1;
116 } 116 }
117 else 117 else
118 { 118 {
119 // We have a primary track, which should g 119 // We have a primary track, which should go first.
120 fTurn = 0; // reseting the turn 120 fTurn = 0; // reseting the turn
121 } 121 }
122 stacks[iDest]->PushToStack(aStackedTrack); 122 stacks[iDest]->PushToStack(aStackedTrack);
123 energies[iDest] += aStackedTrack.GetTrack()- 123 energies[iDest] += aStackedTrack.GetTrack()->GetDynamicParticle()->GetTotalEnergy();
124 ++nTracks; 124 ++nTracks;
125 125
126 G4long dy1 = stacks[iDest]->GetNTrack() - st 126 G4long dy1 = stacks[iDest]->GetNTrack() - stacks[iDest]->GetSafetyValue1();
127 G4long dy2 = stacks[fTurn]->GetNTrack() - st 127 G4long dy2 = stacks[fTurn]->GetNTrack() - stacks[fTurn]->GetSafetyValue2();
128 128
129 if (dy1 > 0 || dy1 > dy2 || 129 if (dy1 > 0 || dy1 > dy2 ||
130 (iDest == 2 && 130 (iDest == 2 &&
131 stacks[iDest]->GetNTrack() < 50 && ener 131 stacks[iDest]->GetNTrack() < 50 && energies[iDest] < energies[fTurn]))
132 { 132 {
133 fTurn = iDest; 133 fTurn = iDest;
134 } 134 }
135 135
136 if (nTracks > maxNTracks) maxNTracks = nTrac 136 if (nTracks > maxNTracks) maxNTracks = nTracks;
137 } 137 }
138 138
139 void G4SmartTrackStack::clear() 139 void G4SmartTrackStack::clear()
140 { 140 {
141 for (G4int i = 0; i < nTurn; ++i) 141 for (G4int i = 0; i < nTurn; ++i)
142 { 142 {
143 stacks[i]->clear(); 143 stacks[i]->clear();
144 energies[i] = 0.0; 144 energies[i] = 0.0;
145 fTurn = 0; 145 fTurn = 0;
146 } 146 }
147 nTracks = 0; 147 nTracks = 0;
148 } 148 }
149 149
150 void G4SmartTrackStack::clearAndDestroy() 150 void G4SmartTrackStack::clearAndDestroy()
151 { 151 {
152 for (G4int i = 0; i < nTurn; ++i) 152 for (G4int i = 0; i < nTurn; ++i)
153 { 153 {
154 stacks[i]->clearAndDestroy(); 154 stacks[i]->clearAndDestroy();
155 energies[i] = 0.0; 155 energies[i] = 0.0;
156 fTurn = 0; 156 fTurn = 0;
157 } 157 }
158 nTracks = 0; 158 nTracks = 0;
159 } 159 }
160 160