| 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 /// \file eventgenerator/HepMC/MCTruth/src/MCT 26 /// \file eventgenerator/HepMC/MCTruth/src/MCTruthTrackingAction.cc
27 /// \brief Implementation of the MCTruthTracki 27 /// \brief Implementation of the MCTruthTrackingAction class
28 // 28 //
29 // 29 //
>> 30 // $Id: MCTruthTrackingAction.cc 73446 2013-08-27 11:32:59Z gcosmo $
30 // 31 //
31 // 32 //
32 // ------------------------------------------- 33 // --------------------------------------------------------------
33 // GEANT 4 - MCTruthTrackingAction class 34 // GEANT 4 - MCTruthTrackingAction class
34 // ------------------------------------------- 35 // --------------------------------------------------------------
35 // 36 //
36 // Author: Witold POKORSKI (Witold.Pokorski@ce 37 // Author: Witold POKORSKI (Witold.Pokorski@cern.ch)
37 // 38 //
38 // ------------------------------------------- 39 // --------------------------------------------------------------
39 // <<
40 //....oooOO0OOooo........oooOO0OOooo........oo <<
41 <<
42 #include "MCTruthTrackingAction.hh" <<
43 40
44 #include "MCTruthTrackInformation.hh" << 41 #include <iostream>
45 42
46 #include "G4Track.hh" 43 #include "G4Track.hh"
47 #include "G4TrackVector.hh" 44 #include "G4TrackVector.hh"
48 #include "G4TrackingManager.hh" 45 #include "G4TrackingManager.hh"
>> 46 #include "MCTruthTrackingAction.hh"
>> 47 #include "MCTruthTrackInformation.hh"
49 48
50 #include <iostream> << 49 MCTruthTrackingAction::MCTruthTrackingAction()
51 << 50 {}
52 //....oooOO0OOooo........oooOO0OOooo........oo <<
53 <<
54 MCTruthTrackingAction::MCTruthTrackingAction() <<
55 <<
56 //....oooOO0OOooo........oooOO0OOooo........oo <<
57 <<
58 MCTruthTrackingAction::~MCTruthTrackingAction( <<
59 51
60 //....oooOO0OOooo........oooOO0OOooo........oo << 52 MCTruthTrackingAction::~MCTruthTrackingAction()
>> 53 {}
61 54
62 void MCTruthTrackingAction::PreUserTrackingAct 55 void MCTruthTrackingAction::PreUserTrackingAction(const G4Track* track)
63 { 56 {
64 fmom = G4LorentzVector(track->GetMomentum(), 57 fmom = G4LorentzVector(track->GetMomentum(), track->GetTotalEnergy());
65 << 58
66 if (!track->GetUserInformation()) { << 59 if(!track->GetUserInformation())
>> 60 {
67 G4VUserTrackInformation* mcinf = new MCTru 61 G4VUserTrackInformation* mcinf = new MCTruthTrackInformation;
68 fpTrackingManager->SetUserTrackInformation 62 fpTrackingManager->SetUserTrackInformation(mcinf);
69 } 63 }
70 } 64 }
71 65
72 //....oooOO0OOooo........oooOO0OOooo........oo <<
73 <<
74 void MCTruthTrackingAction::PostUserTrackingAc 66 void MCTruthTrackingAction::PostUserTrackingAction(const G4Track* track)
75 { 67 {
>> 68
76 G4LorentzVector prodpos(track->GetGlobalTime 69 G4LorentzVector prodpos(track->GetGlobalTime() - track->GetLocalTime(),
77 track->GetVertexPosi << 70 track->GetVertexPosition());
78 G4LorentzVector endpos(track->GetGlobalTime( 71 G4LorentzVector endpos(track->GetGlobalTime(), track->GetPosition());
79 72
80 // here (?) make all different checks to dec 73 // here (?) make all different checks to decide whether to store the particle
81 // 74 //
82 if (TrackToBeStored(track)) { << 75 if (trackToBeStored(track))
83 MCTruthTrackInformation* mcinf = (MCTruthT << 76 {
84 << 77 MCTruthTrackInformation* mcinf =
85 MCTruthManager::GetInstance()->AddParticle << 78 (MCTruthTrackInformation*) track->GetUserInformation();
86 fmom, prodpos, endpos, track->GetDefinit << 79
87 track->GetParentID(), mcinf->GetDirectPa << 80 MCTruthManager::GetInstance()->
>> 81 AddParticle(fmom, prodpos, endpos,
>> 82 track->GetDefinition()->GetPDGEncoding(),
>> 83 track->GetTrackID(),
>> 84 track->GetParentID(), mcinf->GetDirectParent());
88 } 85 }
89 else { << 86 else
>> 87 {
90 // If track is not to be stored, propagate 88 // If track is not to be stored, propagate it's parent ID (stored)
91 // to its secondaries 89 // to its secondaries
92 // 90 //
93 G4TrackVector* childrens = fpTrackingManag << 91 G4TrackVector* childrens = fpTrackingManager->GimmeSecondaries() ;
94 92
95 for (unsigned int index = 0; index < child << 93 for( unsigned int index = 0 ; index < childrens->size() ; ++index )
96 G4Track* tr = (*childrens)[index]; << 94 {
97 tr->SetParentID(track->GetParentID()); << 95 G4Track* tr = (*childrens)[index] ;
>> 96 tr->SetParentID( track->GetParentID() );
98 97
99 // set the flag saying that the direct m 98 // set the flag saying that the direct mother is not stored
100 // 99 //
101 MCTruthTrackInformation* mcinf = (MCTrut << 100 MCTruthTrackInformation* mcinf =
102 if (!mcinf) tr->SetUserInformation(mcinf << 101 (MCTruthTrackInformation*) tr->GetUserInformation();
>> 102 if(!mcinf)
>> 103 tr->SetUserInformation(mcinf = new MCTruthTrackInformation);
103 104
104 mcinf->SetDirectParent(false); << 105 mcinf->SetDirectParent(false);
105 } << 106 }
106 } 107 }
107 } 108 }
108 109
109 //....oooOO0OOooo........oooOO0OOooo........oo << 110 G4bool MCTruthTrackingAction::trackToBeStored(const G4Track* track)
110 <<
111 G4bool MCTruthTrackingAction::TrackToBeStored( <<
112 { 111 {
113 MCTruthConfig* config = MCTruthManager::GetI 112 MCTruthConfig* config = MCTruthManager::GetInstance()->GetConfig();
114 << 113
115 // check energy 114 // check energy
116 if (fmom.e() > config->GetMinE()) return tru 115 if (fmom.e() > config->GetMinE()) return true;
117 << 116
118 // particle type 117 // particle type
119 std::vector<G4int> types = config->GetPartic 118 std::vector<G4int> types = config->GetParticleTypes();
120 << 119
121 if (std::find(types.begin(), types.end(), tr << 120 if(std::find( types.begin(), types.end(),
122 != types.end()) << 121 track->GetDefinition()->GetPDGEncoding())
123 return true; << 122 != types.end()) return true;
124 123
125 // creator process 124 // creator process
126 125
127 // etc... 126 // etc...
128 << 127
129 return false; 128 return false;
130 } 129 }
131 <<
132 //....oooOO0OOooo........oooOO0OOooo........oo <<
133 130