| 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: G3DetTable.cc,v 1.12 2006-06-29 18:12:48 gunter Exp $
>> 28 // GEANT4 tag $Name: geant4-09-04-patch-01 $
27 // 29 //
28 #include "globals.hh" 30 #include "globals.hh"
29 #include "G3DetTable.hh" 31 #include "G3DetTable.hh"
30 32
31 typedef std::map<G4String, G3DetTableEntry*, s 33 typedef std::map<G4String, G3DetTableEntry*, std::less<G4String> >
32 ::iterator DTDiterator; 34 ::iterator DTDiterator;
33 35
34 G4String 36 G4String
35 G3DetTable::MakeHash(G4String& set, G4String& 37 G3DetTable::MakeHash(G4String& set, G4String& det){;
36 return set+" "+det; 38 return set+" "+det;
37 } 39 }
38 40
39 G3DetTable::G3DetTable(){ 41 G3DetTable::G3DetTable(){
40 } 42 }
41 43
42 G3DetTable::~G3DetTable(){ 44 G3DetTable::~G3DetTable(){
43 if (DTD.size() > 0) { 45 if (DTD.size() > 0) {
44 // G4cout << "Deleting DTD" << G4endl; 46 // G4cout << "Deleting DTD" << G4endl;
45 for (DTDiterator i=DTD.begin(); i != DTD.e 47 for (DTDiterator i=DTD.begin(); i != DTD.end(); i++) {
46 delete (*i).second; 48 delete (*i).second;
47 } 49 }
48 DTD.clear(); 50 DTD.clear();
49 } 51 }
50 } 52 }
51 53
52 G4VSensitiveDetector* 54 G4VSensitiveDetector*
53 G3DetTable::GetSD(G4String& set, G4String& det 55 G3DetTable::GetSD(G4String& set, G4String& det){
54 56
55 // make hash ID 57 // make hash ID
56 const G4String ShashID = MakeHash(set, det); 58 const G4String ShashID = MakeHash(set, det);
57 59
58 // search the map 60 // search the map
59 DTDiterator i = DTD.find(ShashID); 61 DTDiterator i = DTD.find(ShashID);
60 G3DetTableEntry* DTE = (*i).second; 62 G3DetTableEntry* DTE = (*i).second;
61 if (DTE != 0) { 63 if (DTE != 0) {
62 return DTE->GetSD(); 64 return DTE->GetSD();
63 } else { 65 } else {
64 return 0; 66 return 0;
65 } 67 }
66 } 68 }
67 69
68 G4int 70 G4int
69 G3DetTable::GetID(G4String& set, G4String& det 71 G3DetTable::GetID(G4String& set, G4String& det){
70 72
71 // make hash ID 73 // make hash ID
72 G4String ShashID = MakeHash(set, det); 74 G4String ShashID = MakeHash(set, det);
73 75
74 // search the Hash Dictionary 76 // search the Hash Dictionary
75 DTDiterator i = DTD.find(ShashID); 77 DTDiterator i = DTD.find(ShashID);
76 G3DetTableEntry* DTE = (*i).second; 78 G3DetTableEntry* DTE = (*i).second;
77 if (DTE != 0) { 79 if (DTE != 0) {
78 return DTE->GetID(); 80 return DTE->GetID();
79 } else { 81 } else {
80 return 0; 82 return 0;
81 } 83 }
82 } 84 }
83 85
84 void 86 void
85 G3DetTable::Put(G4String& set, G4String& det, 87 G3DetTable::Put(G4String& set, G4String& det, G4int id,
86 G4VSensitiveDetector* D){ 88 G4VSensitiveDetector* D){
87 // make hash ID 89 // make hash ID
88 G4String ShashID = MakeHash(set, det); 90 G4String ShashID = MakeHash(set, det);
89 G3DetTableEntry* DTE = new G3DetTableEntry(s 91 G3DetTableEntry* DTE = new G3DetTableEntry(set, det, id, D);
90 G4cout << "Inserted DTE with id " << ShashID 92 G4cout << "Inserted DTE with id " << ShashID << G4endl;
91 DTD[ShashID] = DTE; 93 DTD[ShashID] = DTE;
92 } 94 }
93 95
94 void 96 void
95 G3DetTable::PrintAll(){ 97 G3DetTable::PrintAll(){
96 if (DTD.size()>0){ 98 if (DTD.size()>0){
97 G4int count=0; 99 G4int count=0;
98 G4cout << "Dump of DTD - " << DTD.size() < 100 G4cout << "Dump of DTD - " << DTD.size() << " entries:" << G4endl;
99 for (DTDiterator i=DTD.begin(); i != DTD.e 101 for (DTDiterator i=DTD.begin(); i != DTD.end(); i++) {
100 count++; 102 count++;
101 G3DetTableEntry* DTE = (*i).second; 103 G3DetTableEntry* DTE = (*i).second;
102 G4cout << "DTD entry " << std::setw(3) < 104 G4cout << "DTD entry " << std::setw(3) << count << " sensitive detector name: "
103 << DTE->GetSD()->GetName() << G4endl; 105 << DTE->GetSD()->GetName() << G4endl;
104 } 106 }
105 } 107 }
106 } 108 }
107 109
108 110
109 111
110 112
111 113
112 114