| 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 runAndEvent/RE01/src/RE01TrackerSD.c 26 /// \file runAndEvent/RE01/src/RE01TrackerSD.cc
27 /// \brief Implementation of the RE01TrackerSD 27 /// \brief Implementation of the RE01TrackerSD class
28 // 28 //
>> 29 // $Id: RE01TrackerSD.cc 66379 2012-12-18 09:46:33Z gcosmo $
29 // 30 //
30 31
31 #include "RE01TrackerSD.hh" 32 #include "RE01TrackerSD.hh"
32 <<
33 #include "RE01TrackInformation.hh" <<
34 #include "RE01TrackerHit.hh" 33 #include "RE01TrackerHit.hh"
>> 34 #include "RE01TrackInformation.hh"
35 35
36 #include "G4HCofThisEvent.hh" <<
37 #include "G4Step.hh" 36 #include "G4Step.hh"
>> 37 #include "G4HCofThisEvent.hh"
38 #include "G4TouchableHistory.hh" 38 #include "G4TouchableHistory.hh"
39 #include "G4ios.hh" 39 #include "G4ios.hh"
40 40
41 //....oooOO0OOooo........oooOO0OOooo........oo << 41 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
42 RE01TrackerSD::RE01TrackerSD(G4String name) : << 42 RE01TrackerSD::RE01TrackerSD(G4String name)
>> 43 :G4VSensitiveDetector(name),fTrackerCollection(0)
43 { 44 {
44 G4String HCname; 45 G4String HCname;
45 collectionName.insert(HCname = "trackerColle << 46 collectionName.insert(HCname="trackerCollection");
46 } 47 }
47 48
48 //....oooOO0OOooo........oooOO0OOooo........oo << 49 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
49 RE01TrackerSD::~RE01TrackerSD() << 50 RE01TrackerSD::~RE01TrackerSD(){;}
50 { <<
51 ; <<
52 } <<
53 51
54 //....oooOO0OOooo........oooOO0OOooo........oo << 52 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
55 void RE01TrackerSD::Initialize(G4HCofThisEvent 53 void RE01TrackerSD::Initialize(G4HCofThisEvent* HCE)
56 { 54 {
57 static int HCID = -1; 55 static int HCID = -1;
58 fTrackerCollection = new RE01TrackerHitsColl << 56 fTrackerCollection = new RE01TrackerHitsCollection
59 if (HCID < 0) { << 57 (SensitiveDetectorName,collectionName[0]);
60 HCID = GetCollectionID(0); << 58 if(HCID<0)
61 } << 59 { HCID = GetCollectionID(0); }
62 HCE->AddHitsCollection(HCID, fTrackerCollect << 60 HCE->AddHitsCollection(HCID,fTrackerCollection);
63 } 61 }
64 62
65 //....oooOO0OOooo........oooOO0OOooo........oo << 63 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
66 G4bool RE01TrackerSD::ProcessHits(G4Step* aSte 64 G4bool RE01TrackerSD::ProcessHits(G4Step* aStep, G4TouchableHistory*)
67 { 65 {
68 G4double edep = aStep->GetTotalEnergyDeposit 66 G4double edep = aStep->GetTotalEnergyDeposit();
69 if (edep == 0.) return false; << 67 if(edep==0.) return false;
70 68
71 RE01TrackerHit* newHit = new RE01TrackerHit( 69 RE01TrackerHit* newHit = new RE01TrackerHit();
72 newHit->SetEdep(edep); << 70 newHit->SetEdep( edep );
73 newHit->SetPos(aStep->GetPreStepPoint()->Get << 71 newHit->SetPos( aStep->GetPreStepPoint()->GetPosition() );
74 RE01TrackInformation* trackInfo = << 72 RE01TrackInformation* trackInfo =
75 (RE01TrackInformation*)(aStep->GetTrack()- 73 (RE01TrackInformation*)(aStep->GetTrack()->GetUserInformation());
76 if (trackInfo->GetTrackingStatus() > 0) { << 74 if(trackInfo->GetTrackingStatus()>0)
77 newHit->SetTrackID(aStep->GetTrack()->GetT << 75 { newHit->SetTrackID( aStep->GetTrack()->GetTrackID() ); }
78 } << 76 else
79 else { << 77 { newHit->SetTrackID( -1 ); }
80 newHit->SetTrackID(-1); << 78 fTrackerCollection->insert( newHit );
81 } <<
82 fTrackerCollection->insert(newHit); <<
83 79
84 return true; 80 return true;
85 } 81 }
86 82
87 //....oooOO0OOooo........oooOO0OOooo........oo << 83 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
88 void RE01TrackerSD::EndOfEvent(G4HCofThisEvent 84 void RE01TrackerSD::EndOfEvent(G4HCofThisEvent*)
89 { << 85 {;}
90 ; <<
91 } <<
92 86