Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/event/src/G4AdjointStackingAction.cc

Version: [ ReleaseNotes ] [ 1.0 ] [ 1.1 ] [ 2.0 ] [ 3.0 ] [ 3.1 ] [ 3.2 ] [ 4.0 ] [ 4.0.p1 ] [ 4.0.p2 ] [ 4.1 ] [ 4.1.p1 ] [ 5.0 ] [ 5.0.p1 ] [ 5.1 ] [ 5.1.p1 ] [ 5.2 ] [ 5.2.p1 ] [ 5.2.p2 ] [ 6.0 ] [ 6.0.p1 ] [ 6.1 ] [ 6.2 ] [ 6.2.p1 ] [ 6.2.p2 ] [ 7.0 ] [ 7.0.p1 ] [ 7.1 ] [ 7.1.p1 ] [ 8.0 ] [ 8.0.p1 ] [ 8.1 ] [ 8.1.p1 ] [ 8.1.p2 ] [ 8.2 ] [ 8.2.p1 ] [ 8.3 ] [ 8.3.p1 ] [ 8.3.p2 ] [ 9.0 ] [ 9.0.p1 ] [ 9.0.p2 ] [ 9.1 ] [ 9.1.p1 ] [ 9.1.p2 ] [ 9.1.p3 ] [ 9.2 ] [ 9.2.p1 ] [ 9.2.p2 ] [ 9.2.p3 ] [ 9.2.p4 ] [ 9.3 ] [ 9.3.p1 ] [ 9.3.p2 ] [ 9.4 ] [ 9.4.p1 ] [ 9.4.p2 ] [ 9.4.p3 ] [ 9.4.p4 ] [ 9.5 ] [ 9.5.p1 ] [ 9.5.p2 ] [ 9.6 ] [ 9.6.p1 ] [ 9.6.p2 ] [ 9.6.p3 ] [ 9.6.p4 ] [ 10.0 ] [ 10.0.p1 ] [ 10.0.p2 ] [ 10.0.p3 ] [ 10.0.p4 ] [ 10.1 ] [ 10.1.p1 ] [ 10.1.p2 ] [ 10.1.p3 ] [ 10.2 ] [ 10.2.p1 ] [ 10.2.p2 ] [ 10.2.p3 ] [ 10.3 ] [ 10.3.p1 ] [ 10.3.p2 ] [ 10.3.p3 ] [ 10.4 ] [ 10.4.p1 ] [ 10.4.p2 ] [ 10.4.p3 ] [ 10.5 ] [ 10.5.p1 ] [ 10.6 ] [ 10.6.p1 ] [ 10.6.p2 ] [ 10.6.p3 ] [ 10.7 ] [ 10.7.p1 ] [ 10.7.p2 ] [ 10.7.p3 ] [ 10.7.p4 ] [ 11.0 ] [ 11.0.p1 ] [ 11.0.p2 ] [ 11.0.p3, ] [ 11.0.p4 ] [ 11.1 ] [ 11.1.1 ] [ 11.1.2 ] [ 11.1.3 ] [ 11.2 ] [ 11.2.1 ] [ 11.2.2 ] [ 11.3.0 ]

Diff markup

Differences between /event/src/G4AdjointStackingAction.cc (Version 11.3.0) and /event/src/G4AdjointStackingAction.cc (Version 10.4.p3)


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