| 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 SAXSSensitiveDetector.cc 26 /// \file SAXSSensitiveDetector.cc
27 /// \brief Implementation of the SAXSSensitive 27 /// \brief Implementation of the SAXSSensitiveDetector class
28 // 28 //
29 //....oooOO0OOooo........oooOO0OOooo........oo 29 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
30 30
31 #include "SAXSSensitiveDetector.hh" 31 #include "SAXSSensitiveDetector.hh"
32 <<
33 #include "SAXSSensitiveDetectorHit.hh" 32 #include "SAXSSensitiveDetectorHit.hh"
34 33
35 #include "G4HCofThisEvent.hh" 34 #include "G4HCofThisEvent.hh"
36 #include "G4Navigator.hh" <<
37 #include "G4SDManager.hh" <<
38 #include "G4Step.hh" <<
39 #include "G4TouchableHistory.hh" 35 #include "G4TouchableHistory.hh"
40 #include "G4Track.hh" 36 #include "G4Track.hh"
>> 37 #include "G4Step.hh"
>> 38 #include "G4SDManager.hh"
>> 39 #include "G4Navigator.hh"
41 #include "G4ios.hh" 40 #include "G4ios.hh"
42 41
43 //....oooOO0OOooo........oooOO0OOooo........oo 42 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
44 43
45 SAXSSensitiveDetector::SAXSSensitiveDetector(G << 44 SAXSSensitiveDetector::SAXSSensitiveDetector(G4String name):
>> 45 G4VSensitiveDetector(name)
46 { 46 {
47 G4String HCname; 47 G4String HCname;
48 collectionName.insert(HCname = "collection") << 48 collectionName.insert(HCname="collection");
49 fHCID = -1; 49 fHCID = -1;
50 << 50
51 fVarStopAndKill = true; 51 fVarStopAndKill = true;
52 << 52
53 fSDMessenger = new SAXSSensitiveDetectorMess 53 fSDMessenger = new SAXSSensitiveDetectorMessenger(this);
54 } 54 }
55 55
56 //....oooOO0OOooo........oooOO0OOooo........oo 56 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
57 57
58 SAXSSensitiveDetector::~SAXSSensitiveDetector( 58 SAXSSensitiveDetector::~SAXSSensitiveDetector() {}
59 59
60 //....oooOO0OOooo........oooOO0OOooo........oo 60 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
61 61
62 void SAXSSensitiveDetector::Initialize(G4HCofT 62 void SAXSSensitiveDetector::Initialize(G4HCofThisEvent* HCE)
63 { 63 {
64 fHitsCollection = new SensitiveDetectorHitsC << 64 fHitsCollection =
65 if (fHCID < 0) fHCID = G4SDManager::GetSDMpo << 65 new SensitiveDetectorHitsCollection(SensitiveDetectorName,collectionName[0]);
66 HCE->AddHitsCollection(fHCID, fHitsCollectio << 66 if(fHCID<0)
>> 67 fHCID = G4SDManager::GetSDMpointer()->GetCollectionID(fHitsCollection);
>> 68 HCE->AddHitsCollection(fHCID,fHitsCollection);
67 } 69 }
68 70
69 //....oooOO0OOooo........oooOO0OOooo........oo 71 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
70 72
71 bool SAXSSensitiveDetector::ProcessHits(G4Step << 73 bool SAXSSensitiveDetector::ProcessHits(G4Step* aStep,G4TouchableHistory*)
72 { << 74 {
73 G4Track* vTrack = aStep->GetTrack(); 75 G4Track* vTrack = aStep->GetTrack();
74 << 76
75 G4StepPoint* preStepPoint = aStep->GetPreSte 77 G4StepPoint* preStepPoint = aStep->GetPreStepPoint();
76 << 78
77 G4ThreeVector worldPosition = preStepPoint-> << 79 G4ThreeVector worldPosition = preStepPoint->GetPosition();
78 G4ThreeVector localPosition = << 80 G4ThreeVector localPosition = preStepPoint->GetTouchableHandle()->
79 preStepPoint->GetTouchableHandle()->GetHis << 81 GetHistory()->GetTopTransform().TransformPoint(worldPosition);
80 worldPosition); << 82
81 <<
82 G4ThreeVector mom = preStepPoint->GetMomentu 83 G4ThreeVector mom = preStepPoint->GetMomentumDirection();
83 << 84
84 // if the partcile is not on the boundary of << 85 //if the partcile is not on the boundary of the sensitive detector, return
85 if (!(preStepPoint->GetStepStatus() == fGeom << 86 if (!(preStepPoint->GetStepStatus() == fGeomBoundary)) {return false;}
86 return false; << 87
87 } <<
88 <<
89 G4int vType = -1; 88 G4int vType = -1;
90 if (preStepPoint->GetMass() == 0 && preStepP << 89 if(preStepPoint->GetMass() == 0 && preStepPoint->GetCharge() == 0) {
91 vType = 0; 90 vType = 0;
92 } 91 }
93 else if (preStepPoint->GetMass() != 0 && pre << 92 else if(preStepPoint->GetMass() != 0 && preStepPoint->GetCharge() == 0) {
94 vType = 1; 93 vType = 1;
95 } 94 }
96 else if (preStepPoint->GetMass() != 0 && pre << 95 else if(preStepPoint->GetMass() != 0 && preStepPoint->GetCharge() > 0) {
97 vType = 2; 96 vType = 2;
98 } 97 }
99 else if (preStepPoint->GetMass() != 0 && pre << 98 else if(preStepPoint->GetMass() != 0 && preStepPoint->GetCharge() < 0) {
100 vType = 3; 99 vType = 3;
101 } 100 }
102 101
103 // insert a hit << 102 //insert a hit
104 SAXSSensitiveDetectorHit* aHit = new SAXSSen 103 SAXSSensitiveDetectorHit* aHit = new SAXSSensitiveDetectorHit();
105 aHit->SetPos(localPosition); 104 aHit->SetPos(localPosition);
106 aHit->SetMom(mom); 105 aHit->SetMom(mom);
107 aHit->SetType(vType); << 106 aHit->SetType(vType);
108 aHit->SetEnergy(preStepPoint->GetKineticEner << 107 aHit->SetEnergy(preStepPoint->GetKineticEnergy());
109 aHit->SetTime(preStepPoint->GetGlobalTime()) 108 aHit->SetTime(preStepPoint->GetGlobalTime());
110 aHit->SetTrackID(vTrack->GetTrackID()); 109 aHit->SetTrackID(vTrack->GetTrackID());
111 aHit->SetWeight(vTrack->GetWeight()); 110 aHit->SetWeight(vTrack->GetWeight());
112 fHitsCollection->insert(aHit); 111 fHitsCollection->insert(aHit);
113 << 112
114 if (fVarStopAndKill) { << 113 if (fVarStopAndKill) {vTrack->SetTrackStatus(fStopAndKill);}
115 vTrack->SetTrackStatus(fStopAndKill); << 114
116 } <<
117 <<
118 return true; 115 return true;
119 } 116 }
120 //....oooOO0OOooo........oooOO0OOooo........oo 117 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
121 118
122 void SAXSSensitiveDetector::EndOfEvent(G4HCofT 119 void SAXSSensitiveDetector::EndOfEvent(G4HCofThisEvent*) {}
123 120
124 //....oooOO0OOooo........oooOO0OOooo........oo 121 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
>> 122
125 123