| 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 // G4StackManager <<
27 // 26 //
28 // Class description: << 27 // $Id: G4StackManager.hh,v 1.12 2006/06/29 18:09:07 gunter Exp $
>> 28 // GEANT4 tag $Name: geant4-08-03-patch-01 $
29 // 29 //
30 // This is the manager class of handling stack <<
31 // This class must be a singleton and be const <<
32 // Almost all methods must be invoked exclusiv <<
33 // Especially, some Clear() methods MUST NOT b <<
34 // Event abortion is handled by G4EventManager <<
35 // 30 //
36 // G4StackManager has three stacks, the urgent <<
37 // waiting stack, and the postpone to next eve <<
38 // of each stack is descrived in the Geant4 Us <<
39 31
40 // Author: Makoto Asai, 1996 <<
41 // <<
42 // History: <<
43 // - 01/Feb/1996, Makoto Asai - Created <<
44 // - 04/Oct/2011, Pere Mato - Use of G4TrackSt <<
45 // - 28/Aug/2023, Makoto Asai - Adding sub-eve <<
46 // ------------------------------------------- <<
47 #ifndef G4StackManager_hh <<
48 #define G4StackManager_hh 1 <<
49 32
50 #include <map> << 33 #ifndef G4StackManager_h
51 #include <vector> << 34 #define G4StackManager_h 1
52 35
53 #include "G4UserStackingAction.hh" 36 #include "G4UserStackingAction.hh"
54 #include "G4StackedTrack.hh" 37 #include "G4StackedTrack.hh"
55 #include "G4TrackStack.hh" 38 #include "G4TrackStack.hh"
56 #include "G4SmartTrackStack.hh" <<
57 #include "G4SubEventTrackStack.hh" <<
58 #include "G4ClassificationOfNewTrack.hh" 39 #include "G4ClassificationOfNewTrack.hh"
59 #include "G4Track.hh" 40 #include "G4Track.hh"
60 #include "G4TrackStatus.hh" 41 #include "G4TrackStatus.hh"
61 #include "G4ExceptionSeverity.hh" <<
62 #include "globals.hh" 42 #include "globals.hh"
63 <<
64 class G4StackingMessenger; 43 class G4StackingMessenger;
65 class G4VTrajectory; 44 class G4VTrajectory;
66 class G4Event; << 45
67 class G4ParticleDefinition; << 46 // class description:
>> 47 //
>> 48 // This is the manager class of handling stacks of G4Track objects.
>> 49 // This class must be a singleton and be constructed by G4EventManager.
>> 50 // Almost all methods must be invoked exclusively by G4EventManager.
>> 51 // Especially, some Clear() methods MUST NOT be invoked by the user.
>> 52 // Event abortion is handled by G4EventManager.
>> 53 //
>> 54 // This G4StackingManager has three stacks, the urgent stack, the
>> 55 // waiting stack, and the postpone to next event stack. The meanings
>> 56 // of each stack is descrived in the Geant4 user's manual.
>> 57 //
>> 58
68 59
69 class G4StackManager 60 class G4StackManager
70 { 61 {
71 public: 62 public:
>> 63 G4StackManager();
>> 64 ~G4StackManager();
72 65
73 G4StackManager(); << 66 private:
74 ~G4StackManager(); << 67 const G4StackManager & operator=
75 << 68 (const G4StackManager &right);
76 const G4StackManager& operator=(const G4St << 69 G4int operator==(const G4StackManager &right) const;
77 G4bool operator==(const G4StackManager&) c << 70 G4int operator!=(const G4StackManager &right) const;
78 G4bool operator!=(const G4StackManager&) c <<
79 <<
80 G4int PushOneTrack(G4Track* newTrack, <<
81 G4VTrajectory* newTraje <<
82 G4Track* PopNextTrack(G4VTrajectory** newT <<
83 G4int PrepareNewEvent(G4Event* currentEven <<
84 71
85 void ReClassify(); << 72 public:
86 // Send all tracks stored in the Urgent << 73 G4int PushOneTrack(G4Track *newTrack, G4VTrajectory *newTrajectory = 0);
>> 74 G4Track * PopNextTrack(G4VTrajectory**newTrajectory);
>> 75 G4int PrepareNewEvent();
>> 76
>> 77 public: // with description
>> 78 void ReClassify();
>> 79 // Send all tracks stored in the Urgent stack one by one to
87 // the user's concrete ClassifyNewTrack( 80 // the user's concrete ClassifyNewTrack() method. This method
88 // can be invoked from the user's G4User 81 // can be invoked from the user's G4UserStackingAction concrete
89 // class, especially fron its NewStage() 82 // class, especially fron its NewStage() method. Be aware that
90 // when the urgent stack becomes empty, 83 // when the urgent stack becomes empty, all tracks in the waiting
91 // stack are send to the urgent stack an 84 // stack are send to the urgent stack and then the user's NewStage()
92 // method is invoked. 85 // method is invoked.
93 86
94 void SetNumberOfAdditionalWaitingStacks(G4 << 87 void SetNumberOfAdditionalWaitingStacks(G4int iAdd);
95 // Set the number of additional (optiona << 88 // Set the number of additional (optional) waiting stacks.
96 // This method must be invoked at PreIni 89 // This method must be invoked at PreInit, Init or Idle states.
97 // Once the user set the number of addit 90 // Once the user set the number of additional waiting stacks,
98 // he/she can use the corresponding ENUM 91 // he/she can use the corresponding ENUM in G4ClassificationOfNewTrack.
99 // The user should invoke G4RunManager:: 92 // The user should invoke G4RunManager::SetNumberOfAdditionalWaitingStacks
100 // method, which invokes this method. 93 // method, which invokes this method.
101 94
102 void TransferStackedTracks(G4Classificatio << 95 void TransferStackedTracks(G4ClassificationOfNewTrack origin, G4ClassificationOfNewTrack destination);
103 G4Classificatio << 96 // Transfter all stacked tracks from the origin stack to the destination stack.
104 // Transfer all stacked tracks from the << 97 // The destination stack needs not be empty.
105 // destination stack. The destination st <<
106 // If the destination is fKill, tracks a 98 // If the destination is fKill, tracks are deleted.
107 // If the origin is fKill, nothing happe 99 // If the origin is fKill, nothing happen.
108 100
109 void TransferOneStackedTrack(G4Classificat << 101 void TransferOneStackedTrack(G4ClassificationOfNewTrack origin, G4ClassificationOfNewTrack destination);
110 G4Classificat << 102 // Transfter one stacked track from the origin stack to the destination stack.
111 // Transfter one stacked track from the <<
112 // stack. <<
113 // The transfered track is the one which 103 // The transfered track is the one which came last to the origin stack.
114 // The destination stack needs not be em 104 // The destination stack needs not be empty.
115 // If the destination is fKill, the trac 105 // If the destination is fKill, the track is deleted.
116 // If the origin is fKill, nothing happe 106 // If the origin is fKill, nothing happen.
117 107
118 void RegisterSubEventType(G4int ty, G4int << 108 private:
119 // Registering a sub-event type and the << 109 G4UserStackingAction * userStackingAction;
120 // stored in a G4SubEvent object of the << 110 G4int verboseLevel;
121 << 111 G4TrackStack * urgentStack;
122 void SetDefaultClassification( << 112 G4TrackStack * waitingStack;
123 G4TrackStatus, G4ClassificationOf << 113 G4TrackStack * postponeStack;
124 G4ExceptionSeverity es = G4Except << 114 G4StackingMessenger* theMessenger;
125 void SetDefaultClassification( << 115 std::vector<G4TrackStack*> additionalWaitingStacks;
126 const G4ParticleDefinition*, G4Cl << 116 G4int numberOfAdditionalWaitingStacks;
127 G4ExceptionSeverity es = G4Except <<
128 // Define the default classification for <<
129 // Default can be alternated by the User <<
130 // G4ExceptionSeverity can be set to war <<
131 // is inproperly changed. <<
132 <<
133 inline G4ClassificationOfNewTrack GetDefau <<
134 { return fDefaultClassification; } <<
135 117
136 public: 118 public:
137 void ReleaseSubEvent(G4int ty); << 119 inline void clear()
138 inline std::size_t GetNSubEventTypes() << 120 {
139 { return subEvtTypes.size(); } << 121 ClearUrgentStack();
140 inline G4int GetSubEventType(std::size_t i << 122 ClearWaitingStack();
141 { return subEvtTypes[i]; } << 123 for(int i=1;i<=numberOfAdditionalWaitingStacks;i++) {ClearWaitingStack(i);}
142 << 124 }
143 void clear(); << 125 inline void ClearUrgentStack()
144 void ClearUrgentStack(); << 126 { urgentStack->clear(); }
145 void ClearWaitingStack(G4int i=0); << 127 inline void ClearWaitingStack(int i=0)
146 void ClearPostponeStack(); << 128 {
147 G4int GetNTotalTrack() const; << 129 if(i==0) {
148 G4int GetNUrgentTrack() const; << 130 waitingStack->clear();
149 G4int GetNWaitingTrack(G4int i=0) const; << 131 } else {
150 G4int GetNPostponedTrack() const; << 132 if(i<=numberOfAdditionalWaitingStacks) additionalWaitingStacks[i-1]->clear();
151 void SetVerboseLevel( G4int const value ); << 133 }
152 void SetUserStackingAction(G4UserStackingA << 134 }
153 << 135 inline void ClearPostponeStack()
154 private: << 136 { postponeStack->clear(); }
155 void DefineDefaultClassification(const G4T << 137 inline G4int GetNTotalTrack() const
156 void SortOut(G4StackedTrack&,G4Classificat << 138 { int n = urgentStack->GetNTrack() + waitingStack->GetNTrack() + postponeStack->GetNTrack();
>> 139 for(int i=1;i<=numberOfAdditionalWaitingStacks;i++) {n += additionalWaitingStacks[i-1]->GetNTrack();}
>> 140 return n;
>> 141 }
>> 142 inline G4int GetNUrgentTrack() const
>> 143 { return urgentStack->GetNTrack(); }
>> 144 inline G4int GetNWaitingTrack(int i=0) const
>> 145 { if(i==0) { return waitingStack->GetNTrack(); }
>> 146 else {
>> 147 if(i<=numberOfAdditionalWaitingStacks) { return additionalWaitingStacks[i-1]->GetNTrack();}
>> 148 }
>> 149 return 0;
>> 150 }
>> 151 inline G4int GetNPostponedTrack() const
>> 152 { return postponeStack->GetNTrack(); }
>> 153 inline void SetVerboseLevel( G4int const value )
>> 154 { verboseLevel = value; }
>> 155 inline void SetUserStackingAction(G4UserStackingAction* value)
>> 156 {
>> 157 userStackingAction = value;
>> 158 if(userStackingAction) userStackingAction->SetStackManager(this);
>> 159 }
157 160
158 private: 161 private:
159 << 162 inline G4ClassificationOfNewTrack
160 G4UserStackingAction* userStackingAction = << 163 DefaultClassification(G4Track *aTrack)
161 G4int verboseLevel = 0; << 164 {
162 #ifdef G4_USESMARTSTACK << 165 G4ClassificationOfNewTrack classification = fUrgent;
163 G4SmartTrackStack* urgentStack = nullptr; << 166 if( aTrack->GetTrackStatus() == fPostponeToNextEvent )
164 #else << 167 { classification = fPostpone; }
165 G4TrackStack* urgentStack = nullptr; << 168 return classification;
166 #endif << 169 }
167 G4TrackStack* waitingStack = nullptr; <<
168 G4TrackStack* postponeStack = nullptr; <<
169 G4StackingMessenger* theMessenger = nullpt <<
170 std::vector<G4TrackStack*> additionalWaiti <<
171 G4int numberOfAdditionalWaitingStacks = 0; <<
172 <<
173 std::map<G4TrackStatus, <<
174 std::pair<G4ClassificationOfNewTr <<
175 defClassTrackStatus; <<
176 std::map<const G4ParticleDefinition*, <<
177 std::pair<G4ClassificationOfNewTr <<
178 defClassPartDef; <<
179 G4ClassificationOfNewTrack fDefaultClassif <<
180 G4ExceptionSeverity fExceptionSeverity = G <<
181 <<
182 std::map<G4int,G4SubEventTrackStack*> subE <<
183 std::vector<G4int> subEvtTypes; <<
184 }; 170 };
185 171
186 #endif 172 #endif
>> 173
187 174