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 G4AdjointStackingAction::~G4AdjointStackingAction() >> 49 {;} >> 50 >> 51 // -------------------------------------------------------------------- >> 52 // 48 G4ClassificationOfNewTrack 53 G4ClassificationOfNewTrack 49 G4AdjointStackingAction::ClassifyNewTrack(cons 54 G4AdjointStackingAction::ClassifyNewTrack(const G4Track * aTrack) 50 { 55 { 51 G4ClassificationOfNewTrack classification = 56 G4ClassificationOfNewTrack classification = fUrgent; 52 G4String partType = aTrack->GetParticleDefin 57 G4String partType = aTrack->GetParticleDefinition()->GetParticleType(); 53 adjoint_mode = G4StrUtil::contains(partType, 58 adjoint_mode = G4StrUtil::contains(partType, "adjoint"); 54 if (!adjoint_mode ) 59 if (!adjoint_mode ) 55 { 60 { 56 if (!reclassification_stage) 61 if (!reclassification_stage) 57 { 62 { 58 classification = fWaiting; 63 classification = fWaiting; 59 } 64 } 60 else // need to check if forwrad tracking 65 else // need to check if forwrad tracking can be continued use of 61 { 66 { 62 if (theAdjointTrackingAction->GetNbOfAdo 67 if (theAdjointTrackingAction->GetNbOfAdointTracksReachingTheExternalSurface()>0) 63 { 68 { 64 if (theFwdStackingAction != nullptr) << 69 if (theFwdStackingAction) 65 { 70 { 66 classification = theFwdStackingActi 71 classification = theFwdStackingAction->ClassifyNewTrack(aTrack); 67 } 72 } 68 } 73 } 69 else 74 else 70 { 75 { 71 classification = fKill; 76 classification = fKill; 72 } 77 } 73 } 78 } 74 } 79 } 75 else if (theUserAdjointStackingAction != nul << 80 else if (theUserAdjointStackingAction) 76 { 81 { 77 classification = theUserAdjointStackingAct 82 classification = theUserAdjointStackingAction->ClassifyNewTrack(aTrack); 78 } 83 } 79 return classification; 84 return classification; 80 } 85 } 81 86 82 // ------------------------------------------- 87 // -------------------------------------------------------------------- 83 // 88 // 84 void G4AdjointStackingAction::NewStage() 89 void G4AdjointStackingAction::NewStage() 85 { 90 { 86 reclassification_stage = true; 91 reclassification_stage = true; 87 if (first_reclassification_stage) 92 if (first_reclassification_stage) 88 { 93 { 89 if (theUserAdjointStackingAction != nullpt << 94 if (theUserAdjointStackingAction) 90 { 95 { 91 theUserAdjointStackingAction->NewStage() 96 theUserAdjointStackingAction->NewStage(); 92 } 97 } 93 stackManager->ReClassify(); 98 stackManager->ReClassify(); 94 } 99 } 95 else if (theFwdStackingAction != nullptr) th << 100 else if (theFwdStackingAction) theFwdStackingAction->NewStage(); 96 { 101 { 97 first_reclassification_stage = false; 102 first_reclassification_stage = false; 98 } 103 } 99 } 104 } 100 105 101 // ------------------------------------------- 106 // -------------------------------------------------------------------- 102 // 107 // 103 void G4AdjointStackingAction::PrepareNewEvent( 108 void G4AdjointStackingAction::PrepareNewEvent() 104 { 109 { 105 reclassification_stage = false; 110 reclassification_stage = false; 106 first_reclassification_stage = true; 111 first_reclassification_stage = true; 107 if (theUserAdjointStackingAction != nullptr) << 112 if (theUserAdjointStackingAction) 108 { 113 { 109 theUserAdjointStackingAction->PrepareNewEv 114 theUserAdjointStackingAction->PrepareNewEvent(); 110 } 115 } 111 } 116 } 112 117