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 // 23-Jan-2009 V.Ivanchenko make the class to 27 // 23-Jan-2009 V.Ivanchenko make the class to be a singleton 28 // 17-Aug-2012 V.Ivanchenko added hadronic mod 28 // 17-Aug-2012 V.Ivanchenko added hadronic model factories 29 29 30 #include "G4NuclearPolarizationStore.hh" 30 #include "G4NuclearPolarizationStore.hh" 31 #include "G4SystemOfUnits.hh" 31 #include "G4SystemOfUnits.hh" 32 32 33 G4ThreadLocal G4NuclearPolarizationStore* 33 G4ThreadLocal G4NuclearPolarizationStore* 34 G4NuclearPolarizationStore::instance = nullptr 34 G4NuclearPolarizationStore::instance = nullptr; 35 35 36 G4NuclearPolarizationStore* G4NuclearPolarizat 36 G4NuclearPolarizationStore* G4NuclearPolarizationStore::GetInstance() 37 { 37 { 38 if(nullptr == instance) { 38 if(nullptr == instance) { 39 static G4ThreadLocalSingleton<G4NuclearPol 39 static G4ThreadLocalSingleton<G4NuclearPolarizationStore> inst; 40 instance = inst.Instance(); 40 instance = inst.Instance(); 41 } 41 } 42 return instance; 42 return instance; 43 } 43 } 44 44 45 G4NuclearPolarizationStore::G4NuclearPolarizat 45 G4NuclearPolarizationStore::G4NuclearPolarizationStore() 46 { 46 { 47 for(G4int i=0; i<maxNumStates; ++i) { nuclis 47 for(G4int i=0; i<maxNumStates; ++i) { nuclist[i] = nullptr; } 48 oldIdx = 0; 48 oldIdx = 0; 49 } 49 } 50 50 51 G4NuclearPolarizationStore::~G4NuclearPolariza 51 G4NuclearPolarizationStore::~G4NuclearPolarizationStore() 52 { 52 { 53 for(G4int i=0; i<maxNumStates; ++i) { 53 for(G4int i=0; i<maxNumStates; ++i) { 54 delete nuclist[i]; 54 delete nuclist[i]; 55 nuclist[i] = nullptr; 55 nuclist[i] = nullptr; 56 } 56 } 57 } 57 } 58 58 59 void G4NuclearPolarizationStore::Register(G4Nu 59 void G4NuclearPolarizationStore::Register(G4NuclearPolarization* ptr) 60 { 60 { 61 G4int idx = -1; 61 G4int idx = -1; 62 for(G4int i=0; i<maxNumStates; ++i) { 62 for(G4int i=0; i<maxNumStates; ++i) { 63 if(ptr == nuclist[i]) { return; } 63 if(ptr == nuclist[i]) { return; } 64 if(nullptr == nuclist[i]) { idx = i; } 64 if(nullptr == nuclist[i]) { idx = i; } 65 } 65 } 66 if(idx >= 0) { 66 if(idx >= 0) { 67 nuclist[idx] = ptr; 67 nuclist[idx] = ptr; 68 return; 68 return; 69 } 69 } 70 // delete oldest object 70 // delete oldest object 71 delete nuclist[oldIdx]; 71 delete nuclist[oldIdx]; 72 nuclist[oldIdx] = ptr; 72 nuclist[oldIdx] = ptr; 73 // redefine oldIdx 73 // redefine oldIdx 74 ++oldIdx; 74 ++oldIdx; 75 if(oldIdx >= maxNumStates) { oldIdx = 0; } 75 if(oldIdx >= maxNumStates) { oldIdx = 0; } 76 } 76 } 77 77 78 G4NuclearPolarization* 78 G4NuclearPolarization* 79 G4NuclearPolarizationStore::FindOrBuild(G4int 79 G4NuclearPolarizationStore::FindOrBuild(G4int Z, G4int A, G4double Eexc) 80 { 80 { 81 static const G4double tolerance = 10.*CLHEP: 81 static const G4double tolerance = 10.*CLHEP::eV; 82 for(G4int i=0; i<maxNumStates; ++i) { 82 for(G4int i=0; i<maxNumStates; ++i) { 83 auto nucp = nuclist[i]; 83 auto nucp = nuclist[i]; 84 if(nucp && Z == nucp->GetZ() && A == nucp- 84 if(nucp && Z == nucp->GetZ() && A == nucp->GetA() && 85 std::abs(Eexc - nucp->GetExcitationEner 85 std::abs(Eexc - nucp->GetExcitationEnergy()) < tolerance) { 86 return nucp; 86 return nucp; 87 } 87 } 88 } 88 } 89 G4NuclearPolarization* ptr = new G4NuclearPo 89 G4NuclearPolarization* ptr = new G4NuclearPolarization(Z, A, Eexc); 90 Register(ptr); 90 Register(ptr); 91 return ptr; 91 return ptr; 92 } 92 } 93 93 94 void G4NuclearPolarizationStore::RemoveMe(G4Nu 94 void G4NuclearPolarizationStore::RemoveMe(G4NuclearPolarization* ptr) 95 { 95 { 96 for(G4int i=0; i<maxNumStates; ++i) { 96 for(G4int i=0; i<maxNumStates; ++i) { 97 if(ptr == nuclist[i]) { 97 if(ptr == nuclist[i]) { 98 delete ptr; 98 delete ptr; 99 nuclist[i] = nullptr; 99 nuclist[i] = nullptr; 100 // do we need redefine oldIdx? 100 // do we need redefine oldIdx? 101 if(i == oldIdx) { 101 if(i == oldIdx) { 102 for(G4int j=0; j<maxNumStates; ++j) { 102 for(G4int j=0; j<maxNumStates; ++j) { 103 if(j != i && nullptr != nuclist[j]) { 103 if(j != i && nullptr != nuclist[j]) { 104 oldIdx = j; 104 oldIdx = j; 105 return; 105 return; 106 } 106 } 107 } 107 } 108 oldIdx = i; 108 oldIdx = i; 109 } 109 } 110 return; 110 return; 111 } 111 } 112 } 112 } 113 } 113 } 114 114