| 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 // 26 //
>> 27 // $Id: G4PSTermination.cc,v 1.2 2007/12/10 16:29:42 gunter Exp $
>> 28 // GEANT4 tag $Name: geant4-09-01-patch-03 $
27 // 29 //
28 // G4PSTermination 30 // G4PSTermination
29 #include "G4PSTermination.hh" 31 #include "G4PSTermination.hh"
30 32
31 ////////////////////////////////////////////// 33 ///////////////////////////////////////////////////////////////////////////////
32 // (Description) 34 // (Description)
33 // This is a primitive scorer class for scor 35 // This is a primitive scorer class for scoring only terminated traks inside
34 // the cell. 36 // the cell.
35 // 37 //
36 // Created: 2007-02-02 Tsukasa ASO, Akinori K 38 // Created: 2007-02-02 Tsukasa ASO, Akinori Kimura.
37 // 2010-07-22 Introduce Unit specification. <<
38 // 2011-09-09 Modify comment in PrintAll(). <<
39 // 39 //
40 ////////////////////////////////////////////// 40 ///////////////////////////////////////////////////////////////////////////////
41 41
42 G4PSTermination::G4PSTermination(const G4Strin << 42 G4PSTermination::G4PSTermination(G4String name, G4int depth)
43 : G4VPrimitiveScorer(name, depth) << 43 :G4VPrimitiveScorer(name,depth),HCID(-1),weighted(false)
44 { << 44 {;}
45 SetUnit(""); << 45
46 } << 46 G4PSTermination::~G4PSTermination()
>> 47 {;}
47 48
48 G4bool G4PSTermination::ProcessHits(G4Step* aS << 49 G4bool G4PSTermination::ProcessHits(G4Step* aStep,G4TouchableHistory*)
49 { 50 {
50 if(aStep->GetTrack()->GetTrackStatus() != fS << 51 if ( aStep->GetTrack()->GetTrackStatus() != fStopAndKill ) return FALSE;
51 return false; <<
52 52
53 G4int index = GetIndex(aStep); << 53 G4int index = GetIndex(aStep);
54 G4double val = 1.0; 54 G4double val = 1.0;
55 if(weighted) << 55 if(weighted) val *= aStep->GetPreStepPoint()->GetWeight();
56 val *= aStep->GetPreStepPoint()->GetWeight << 56 EvtMap->add(index,val);
57 EvtMap->add(index, val); << 57 return TRUE;
58 return true; <<
59 } 58 }
60 59
61 void G4PSTermination::Initialize(G4HCofThisEve 60 void G4PSTermination::Initialize(G4HCofThisEvent* HCE)
62 { 61 {
63 EvtMap = new G4THitsMap<G4double>(detector-> << 62 EvtMap = new G4THitsMap<G4double>(detector->GetName(),GetName());
64 if(HCID < 0) << 63 if(HCID < 0) {HCID = GetCollectionID(0);}
65 { << 64 HCE->AddHitsCollection(HCID, (G4VHitsCollection*)EvtMap);
66 HCID = GetCollectionID(0); <<
67 } <<
68 HCE->AddHitsCollection(HCID, (G4VHitsCollect <<
69 } 65 }
70 66
71 void G4PSTermination::clear() { EvtMap->clear( << 67 void G4PSTermination::EndOfEvent(G4HCofThisEvent*)
>> 68 {;}
>> 69
>> 70 void G4PSTermination::clear(){
>> 71 EvtMap->clear();
>> 72 }
>> 73
>> 74 void G4PSTermination::DrawAll()
>> 75 {;}
72 76
73 void G4PSTermination::PrintAll() 77 void G4PSTermination::PrintAll()
74 { 78 {
75 G4cout << " MultiFunctionalDet " << detecto 79 G4cout << " MultiFunctionalDet " << detector->GetName() << G4endl;
76 G4cout << " PrimitiveScorer " << GetName() < 80 G4cout << " PrimitiveScorer " << GetName() << G4endl;
77 G4cout << " Number of entries " << EvtMap->e 81 G4cout << " Number of entries " << EvtMap->entries() << G4endl;
78 for(const auto& [copy, terminations] : *(Evt << 82 std::map<G4int,G4double*>::iterator itr = EvtMap->GetMap()->begin();
79 { << 83 for(; itr != EvtMap->GetMap()->end(); itr++) {
80 G4cout << " copy no.: " << copy << 84 G4cout << " copy no.: " << itr->first
81 << " terminations: " << *(terminat << 85 << " collisions: " << *(itr->second)
>> 86 << G4endl;
82 } 87 }
83 } 88 }
84 89
85 void G4PSTermination::SetUnit(const G4String& <<
86 { <<
87 if(unit.empty()) <<
88 { <<
89 unitName = unit; <<
90 unitValue = 1.0; <<
91 } <<
92 else <<
93 { <<
94 G4String msg = "Invalid unit [" + unit + " <<
95 GetUnit() + "] ) for " + Ge <<
96 G4Exception("G4PSTermination::SetUnit", "D <<
97 } <<
98 } <<
99 90