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