| 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: G4MultiFunctionalDetector.cc 67992 2013-03-13 10:59:57Z gcosmo $
27 // 28 //
28 // G4MultiFunctionalDetector 29 // G4MultiFunctionalDetector
29 // 30 //
30 // 2010-07-23 T.Aso Call PS if the step length 31 // 2010-07-23 T.Aso Call PS if the step length or energy deposit is not zero.
31 // << 32 //
32 // 33 //
33 #include "G4MultiFunctionalDetector.hh" 34 #include "G4MultiFunctionalDetector.hh"
34 <<
35 #include "G4SDManager.hh" 35 #include "G4SDManager.hh"
36 #include "G4VPrimitiveScorer.hh" 36 #include "G4VPrimitiveScorer.hh"
37 37
38 G4MultiFunctionalDetector::G4MultiFunctionalDe << 38 G4MultiFunctionalDetector::G4MultiFunctionalDetector(G4String name)
39 : G4VSensitiveDetector(name) << 39 :G4VSensitiveDetector(name)
40 { << 40 {;}
41 ; <<
42 } <<
43 41
44 G4MultiFunctionalDetector::~G4MultiFunctionalD 42 G4MultiFunctionalDetector::~G4MultiFunctionalDetector()
45 { << 43 {;}
46 for (auto pr : primitives) <<
47 delete pr; <<
48 primitives.clear(); <<
49 } <<
50 44
51 G4bool G4MultiFunctionalDetector::ProcessHits( << 45 G4bool G4MultiFunctionalDetector::ProcessHits(G4Step* aStep,G4TouchableHistory* aTH)
52 { 46 {
53 if (aStep->GetStepLength() > 0. || aStep->Ge << 47 if(aStep->GetStepLength()>0. || aStep->GetTotalEnergyDeposit()>0.){
54 for (auto pr : primitives) { << 48 G4int nPrim = primitives.size();
55 pr->HitPrimitive(aStep, aTH); << 49 for(G4int iPrim=0;iPrim<nPrim;iPrim++)
>> 50 {
>> 51 primitives[iPrim]->HitPrimitive(aStep,aTH);
>> 52 }
56 } 53 }
57 } << 54 return true;
58 return true; <<
59 } 55 }
60 56
61 G4bool G4MultiFunctionalDetector::RegisterPrim 57 G4bool G4MultiFunctionalDetector::RegisterPrimitive(G4VPrimitiveScorer* aPS)
62 { 58 {
63 for (auto pr : primitives) { << 59 G4int nPrim = primitives.size();
64 if (pr == aPS) { << 60 for(G4int iPrim=0;iPrim<nPrim;iPrim++)
65 G4ExceptionDescription ED; << 61 {
66 ED << "Primitive <" << aPS->GetName() << << 62 if(primitives[iPrim]==aPS)
67 << ">." << G4endl << "Method Register << 63 {
68 G4Exception("G4MultiFunctionalDetector:: << 64 G4ExceptionDescription ED;
69 return false; << 65 ED << "Primitive <" << aPS->GetName() << "> is already defined in <" << SensitiveDetectorName
70 } << 66 << ">." << G4endl << "Method RegisterPrimitive() is ignored." << G4endl;
71 } << 67 G4Exception("G4MultiFunctionalDetector::RegisterPrimitive","Det0101",
72 primitives.push_back(aPS); << 68 JustWarning,ED);
73 aPS->SetMultiFunctionalDetector(this); << 69 return false;
74 collectionName.insert(aPS->GetName()); << 70 }
75 if (G4SDManager::GetSDMpointer()->FindSensit << 71 }
76 { << 72 primitives.push_back(aPS);
77 // This G4MultiFunctionalDetector has alre << 73 aPS->SetMultiFunctionalDetector(this);
78 // G4SDManager. Make sure this new primiti << 74 collectionName.insert(aPS->GetName());
79 G4SDManager::GetSDMpointer()->AddNewCollec << 75 if(G4SDManager::GetSDMpointer()->FindSensitiveDetector(SensitiveDetectorName,false))
80 } << 76 {
81 return true; << 77 // This G4MultiFunctionalDetector has already been registered to G4SDManager.
>> 78 // Make sure this new primitive is registered as well.
>> 79 G4SDManager::GetSDMpointer()->AddNewCollection(SensitiveDetectorName,aPS->GetName());
>> 80 }
>> 81 return true;
82 } 82 }
83 83
84 G4bool G4MultiFunctionalDetector::RemovePrimit 84 G4bool G4MultiFunctionalDetector::RemovePrimitive(G4VPrimitiveScorer* aPS)
85 { 85 {
86 auto pr = std::find(primitives.begin(), prim << 86 std::vector<G4VPrimitiveScorer*>::iterator iterPS;
87 if (pr != primitives.end()) { << 87 std::vector<G4String>::iterator iterName = collectionName.begin();
88 primitives.erase(pr); << 88 for(iterPS=primitives.begin();iterPS!=primitives.end();iterPS++)
89 aPS->SetMultiFunctionalDetector(nullptr); << 89 {
90 return true; << 90 if(*iterPS==aPS)
91 } << 91 {
92 G4cerr << "Primitive <" << aPS->GetName() << << 92 primitives.erase(iterPS);
93 << ">." << G4endl << "Method RemovePr << 93 aPS->SetMultiFunctionalDetector(0);
94 return false; << 94 return true;
95 } << 95 }
>> 96 iterName++;
>> 97 }
>> 98 G4cerr << "Primitive <" << aPS->GetName() << "> is not defined in <" << SensitiveDetectorName
>> 99 << ">." << G4endl << "Method RemovePrimitive() is ignored." << G4endl;
>> 100 return false;
>> 101 }
96 102
97 void G4MultiFunctionalDetector::Initialize(G4H 103 void G4MultiFunctionalDetector::Initialize(G4HCofThisEvent* HC)
98 { 104 {
99 for (auto pr : primitives) { << 105 G4int nPrim = primitives.size();
100 pr->Initialize(HC); << 106 for(G4int iPrim=0;iPrim<nPrim;iPrim++)
101 } << 107 { primitives[iPrim]->Initialize(HC); }
102 } 108 }
103 109
104 void G4MultiFunctionalDetector::EndOfEvent(G4H 110 void G4MultiFunctionalDetector::EndOfEvent(G4HCofThisEvent* HC)
105 { 111 {
106 for (auto pr : primitives) { << 112 G4int nPrim = primitives.size();
107 pr->EndOfEvent(HC); << 113 for(G4int iPrim=0;iPrim<nPrim;iPrim++)
108 } << 114 { primitives[iPrim]->EndOfEvent(HC); }
109 } 115 }
110 116
111 void G4MultiFunctionalDetector::clear() 117 void G4MultiFunctionalDetector::clear()
112 { 118 {
113 for (auto pr : primitives) { << 119 G4int nPrim = primitives.size();
114 pr->clear(); << 120 for(G4int iPrim=0;iPrim<nPrim;iPrim++)
115 } << 121 { primitives[iPrim]->clear(); }
116 } 122 }
117 123
118 void G4MultiFunctionalDetector::DrawAll() 124 void G4MultiFunctionalDetector::DrawAll()
119 { 125 {
120 for (auto pr : primitives) { << 126 G4int nPrim = primitives.size();
121 pr->DrawAll(); << 127 for(G4int iPrim=0;iPrim<nPrim;iPrim++)
122 } << 128 { primitives[iPrim]->DrawAll(); }
123 } 129 }
124 130
125 void G4MultiFunctionalDetector::PrintAll() 131 void G4MultiFunctionalDetector::PrintAll()
126 { 132 {
127 for (auto pr : primitives) { << 133 G4int nPrim = primitives.size();
128 pr->PrintAll(); << 134 for(G4int iPrim=0;iPrim<nPrim;iPrim++)
129 } << 135 { primitives[iPrim]->PrintAll(); }
130 } 136 }
>> 137
131 138