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