| 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 // G4AdjointStackingAction class implementatio 26 // G4AdjointStackingAction class implementation
27 // 27 //
28 // Author: L. Desorgher, SpaceIT GmbH - April 28 // Author: L. Desorgher, SpaceIT GmbH - April 2008
29 // Contract: ESA contract 21435/08/NL/AT 29 // Contract: ESA contract 21435/08/NL/AT
30 // Customer: ESA/ESTEC 30 // Customer: ESA/ESTEC
31 // ------------------------------------------- 31 // --------------------------------------------------------------------
32 32
33 #include "G4AdjointStackingAction.hh" 33 #include "G4AdjointStackingAction.hh"
34 #include "G4AdjointTrackingAction.hh" 34 #include "G4AdjointTrackingAction.hh"
35 #include "G4Event.hh" 35 #include "G4Event.hh"
36 #include "G4Track.hh" 36 #include "G4Track.hh"
37 #include "G4ios.hh" 37 #include "G4ios.hh"
38 #include "G4StackManager.hh" 38 #include "G4StackManager.hh"
39 39
40 G4AdjointStackingAction:: 40 G4AdjointStackingAction::
41 G4AdjointStackingAction(G4AdjointTrackingActio 41 G4AdjointStackingAction(G4AdjointTrackingAction* anAction)
42 { 42 {
43 theAdjointTrackingAction = anAction; 43 theAdjointTrackingAction = anAction;
44 } 44 }
45 45
46 // ------------------------------------------- 46 // --------------------------------------------------------------------
47 // 47 //
48 G4ClassificationOfNewTrack 48 G4ClassificationOfNewTrack
49 G4AdjointStackingAction::ClassifyNewTrack(cons 49 G4AdjointStackingAction::ClassifyNewTrack(const G4Track * aTrack)
50 { 50 {
51 G4ClassificationOfNewTrack classification = 51 G4ClassificationOfNewTrack classification = fUrgent;
52 G4String partType = aTrack->GetParticleDefin 52 G4String partType = aTrack->GetParticleDefinition()->GetParticleType();
53 adjoint_mode = G4StrUtil::contains(partType, 53 adjoint_mode = G4StrUtil::contains(partType, "adjoint");
54 if (!adjoint_mode ) 54 if (!adjoint_mode )
55 { 55 {
56 if (!reclassification_stage) 56 if (!reclassification_stage)
57 { 57 {
58 classification = fWaiting; 58 classification = fWaiting;
59 } 59 }
60 else // need to check if forwrad tracking 60 else // need to check if forwrad tracking can be continued use of
61 { 61 {
62 if (theAdjointTrackingAction->GetNbOfAdo 62 if (theAdjointTrackingAction->GetNbOfAdointTracksReachingTheExternalSurface()>0)
63 { 63 {
64 if (theFwdStackingAction != nullptr) 64 if (theFwdStackingAction != nullptr)
65 { 65 {
66 classification = theFwdStackingActi 66 classification = theFwdStackingAction->ClassifyNewTrack(aTrack);
67 } 67 }
68 } 68 }
69 else 69 else
70 { 70 {
71 classification = fKill; 71 classification = fKill;
72 } 72 }
73 } 73 }
74 } 74 }
75 else if (theUserAdjointStackingAction != nul 75 else if (theUserAdjointStackingAction != nullptr)
76 { 76 {
77 classification = theUserAdjointStackingAct 77 classification = theUserAdjointStackingAction->ClassifyNewTrack(aTrack);
78 } 78 }
79 return classification; 79 return classification;
80 } 80 }
81 81
82 // ------------------------------------------- 82 // --------------------------------------------------------------------
83 // 83 //
84 void G4AdjointStackingAction::NewStage() 84 void G4AdjointStackingAction::NewStage()
85 { 85 {
86 reclassification_stage = true; 86 reclassification_stage = true;
87 if (first_reclassification_stage) 87 if (first_reclassification_stage)
88 { 88 {
89 if (theUserAdjointStackingAction != nullpt 89 if (theUserAdjointStackingAction != nullptr)
90 { 90 {
91 theUserAdjointStackingAction->NewStage() 91 theUserAdjointStackingAction->NewStage();
92 } 92 }
93 stackManager->ReClassify(); 93 stackManager->ReClassify();
94 } 94 }
95 else if (theFwdStackingAction != nullptr) th 95 else if (theFwdStackingAction != nullptr) theFwdStackingAction->NewStage();
96 { 96 {
97 first_reclassification_stage = false; 97 first_reclassification_stage = false;
98 } 98 }
99 } 99 }
100 100
101 // ------------------------------------------- 101 // --------------------------------------------------------------------
102 // 102 //
103 void G4AdjointStackingAction::PrepareNewEvent( 103 void G4AdjointStackingAction::PrepareNewEvent()
104 { 104 {
105 reclassification_stage = false; 105 reclassification_stage = false;
106 first_reclassification_stage = true; 106 first_reclassification_stage = true;
107 if (theUserAdjointStackingAction != nullptr) 107 if (theUserAdjointStackingAction != nullptr)
108 { 108 {
109 theUserAdjointStackingAction->PrepareNewEv 109 theUserAdjointStackingAction->PrepareNewEvent();
110 } 110 }
111 } 111 }
112 112