| 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 //
27 /// \file GB06BOptnSplitAndKillByImportance.cc
28 /// \brief Implementation of the GB06BOptnSpli
29
30 #include "GB06BOptnSplitAndKillByImportance.hh
31
32 #include "G4BiasingProcessInterface.hh"
33 #include "G4BiasingProcessSharedData.hh"
34 #include "G4ParallelGeometriesLimiterProcess.h
35 #include "G4ProcessManager.hh"
36 #include "Randomize.hh"
37
38 //....oooOO0OOooo........oooOO0OOooo........oo
39
40 GB06BOptnSplitAndKillByImportance::GB06BOptnSp
41 : G4VBiasingOperation(name),
42 fParallelWorldIndex(-1),
43 fBiasingSharedData(nullptr),
44 fParticleChange(),
45 fDummyParticleChange()
46 {}
47
48 //....oooOO0OOooo........oooOO0OOooo........oo
49
50 GB06BOptnSplitAndKillByImportance::~GB06BOptnS
51
52 //....oooOO0OOooo........oooOO0OOooo........oo
53
54 G4double GB06BOptnSplitAndKillByImportance::Di
55
56 {
57 // -- Remember the touchable history (ie geo
58 // -- Start by getting the process handling
59 // -- geometries for the generic biasing:
60 auto biasingLimiterProcess = fBiasingSharedD
61 fPreStepTouchableHistory =
62 biasingLimiterProcess
63 ->GetNavigator(fParallelWorldIndex) //
64 ->CreateTouchableHistoryHandle(); // --
65
66 // -- We request to be "forced" : meaning Ge
67 // -- anyway at the PostStepDoIt(...) stage
68 // -- its end point position) and, there, we
69 // -- split/kill if we are on a volume bound
70 *condition = Forced;
71
72 // -- As we're forced, we make this returned
73 return DBL_MAX;
74 }
75
76 //....oooOO0OOooo........oooOO0OOooo........oo
77
78 G4VParticleChange*
79 GB06BOptnSplitAndKillByImportance::GenerateBia
80 {
81 // -- Given we used the "Forced" condition,
82 // -- We check the status of the step in the
83 // -- splitting/killing if the step has been
84
85 // -- We first check if we limit the step in
86 G4bool isLimiting =
87 fBiasingSharedData->GetParallelGeometriesL
88
89 // -- if not limiting, we leave the track un
90 if (!isLimiting) {
91 fDummyParticleChange.Initialize(*track);
92 return &fDummyParticleChange;
93 }
94
95 // -- We collect the geometry state at the e
96 // -- Note this is the same call than in the
97 // -- fPreStepTouchableHistory, but the navi
98 // -- volume since then (even if the track i
99 // -- geometry state has changed.
100 auto biasingLimiterProcess = fBiasingSharedD
101 fPostStepTouchableHistory =
102 biasingLimiterProcess->GetNavigator(fParal
103
104 // -- We verify we are still in the "same" p
105 // -- remember : using a replica, we have "o
106 // -- but representing many different placem
107 // -- by replica number. By checking we are
108 // -- volume, we verify the end step point h
109 // -- world volume of the parallel geometry:
110 if (fPreStepTouchableHistory->GetVolume() !=
111 // -- the track is leaving the volumes in
112 // -- we leave this track unchanged:
113 fDummyParticleChange.Initialize(*track);
114 return &fDummyParticleChange;
115 }
116
117 // -----------------------------------------
118 // -- At this stage, we know we have a parti
119 // -- each of this slice has a well defined
120 // -- We will split if the track is entering
121 // -- kill (applying Russian roulette) in th
122 // -----------------------------------------
123
124 // -- We start by getting the replica number
125 G4int preReplicaNumber = fPreStepTouchableHi
126 G4int postReplicaNumber = fPostStepTouchable
127
128 // -- and get the related importance we defi
129 G4int preImportance = (*fImportanceMap)[preR
130 G4int postImportance = (*fImportanceMap)[pos
131
132 // -- Get track weight:
133 G4double initialWeight = track->GetWeight();
134
135 // -- Initialize the "particle change" (it w
136 // -- the tracking):
137 fParticleChange.Initialize(*track);
138
139 if (postImportance > preImportance) {
140 // -- We split :
141 G4int splittingFactor = postImportance / p
142
143 // Define the tracks weight:
144 G4double weightOfTrack = initialWeight / s
145
146 // Ask currect track weight to be changed
147 fParticleChange.ProposeParentWeight(weight
148 // Now we clone this track (this is the ac
149 // we will then have the primary and clone
150 // splitting by a factor 2:
151 G4Track* clone = new G4Track(*track);
152 clone->SetWeight(weightOfTrack);
153 fParticleChange.AddSecondary(clone);
154 // -- Below's call added for safety & illu
155 // -- modify the clone (ie : daughter) wei
156 // -- Here this call is not mandatory as b
157 fParticleChange.SetSecondaryWeightByProces
158 }
159 else {
160 // -- We apply Russian roulette:
161 G4double survivingProbability = G4double(p
162
163 // Shoot a random number (in ]0,1[ segment
164 G4double random = G4UniformRand();
165 if (random > survivingProbability) {
166 // We ask for the the track to be killed
167 fParticleChange.ProposeTrackStatus(fStop
168 }
169 else {
170 // In this case, the track survives. We
171 // to conserve weight among killed and s
172 fParticleChange.ProposeParentWeight(init
173 }
174 }
175
176 return &fParticleChange;
177 }
178
179 //....oooOO0OOooo........oooOO0OOooo........oo
180