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