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 // Author: Alfonso Mantero (Alfonso.Mantero@ge 27 // Author: Alfonso Mantero (Alfonso.Mantero@ge.infn.it) 28 // 28 // 29 // History: 29 // History: 30 // ----------- 30 // ----------- 31 // 2 June 2002 First committed to cvs 31 // 2 June 2002 First committed to cvs 32 // 32 // 33 // ------------------------------------------- 33 // ------------------------------------------------------------------- >> 34 34 // Class description: 35 // Class description: 35 // Low Energy Electromagnetic Physics 36 // Low Energy Electromagnetic Physics 36 // This Class loads and stores all the informa 37 // This Class loads and stores all the information of auger effect (shellIds, 37 // probabilities and energies of the electron 38 // probabilities and energies of the electrons emitted) >> 39 // Further documentation available from http://www.ge.infn.it/geant4/lowE >> 40 38 // ------------------------------------------- 41 // ------------------------------------------------------------------- 39 42 40 #ifndef G4AUGERDATA_HH 43 #ifndef G4AUGERDATA_HH 41 #define G4AUGERDATA_HH 1 44 #define G4AUGERDATA_HH 1 42 45 43 #include "globals.hh" 46 #include "globals.hh" 44 #include <vector> 47 #include <vector> 45 #include <map> 48 #include <map> 46 #include "G4AugerTransition.hh" 49 #include "G4AugerTransition.hh" 47 50 48 class G4DataVector; 51 class G4DataVector; 49 52 50 class G4AugerData 53 class G4AugerData 51 { 54 { 52 public: 55 public: 53 56 54 explicit G4AugerData(); << 57 G4AugerData(); 55 ~G4AugerData() = default; << 58 >> 59 ~G4AugerData(); 56 60 57 /// The method returns the number of shells << 61 // The method returns the number of shells in wich a 58 /// vacancy can be filled by a NON-radiative << 62 // vacancy can be filled by a NON-radiative transition, given the atomic number 59 size_t NumberOfVacancies(G4int Z) const; 63 size_t NumberOfVacancies(G4int Z) const; 60 64 61 /// Given the index of the vacancy (and the << 65 // Given the index of the vacancy (and the atomic number Z) returns its identity 62 G4int VacancyId(G4int Z, G4int vacancyIndex) 66 G4int VacancyId(G4int Z, G4int vacancyIndex) const; 63 67 64 /// Given the index of a vacancy in the atom << 68 // Given the index of a vacancy in the atom with the atomc number Z, returns the number of 65 /// shells starting from wich an electron ca << 69 //shells starting from wich an electron can fill the vacancy 66 size_t NumberOfTransitions(G4int Z, G4int va 70 size_t NumberOfTransitions(G4int Z, G4int vacancyIndex) const; 67 71 68 /// Given the atomic number Z, the Index of << 72 // Given the atomic number Z, the Index of the initial vacancy shell 69 /// and the index of the starting shell for << 73 // and the index of the starting shell for the 70 /// transition, returns the identity of the << 74 // transition, returns the identity of the shell originating the electron transition 71 G4int StartShellId(G4int Z, G4int initialVac 75 G4int StartShellId(G4int Z, G4int initialVacancyIndex, G4int transitionShellIndex) const; 72 76 73 /// Given the atomic number , the indexes of << 77 // Given the atomic number , the indexes of the starting, the auger originating shell, 74 /// and the transition shell Id, returns the << 78 // and the transition shell Id, returns the transition energy 75 G4double StartShellEnergy(G4int Z, G4int vac 79 G4double StartShellEnergy(G4int Z, G4int vacancyIndex, G4int transitionId, G4int augerIndex) const; 76 80 77 /// Given the atomic number, the index of t << 81 // Given the atomic number, the index of the starting shell, the auger originating shells, 78 /// and the transition shell Id, returns the << 82 // and the transition shell Id, returns the transition probability 79 G4double StartShellProb(G4int Z, G4int vacan 83 G4double StartShellProb(G4int Z, G4int vacancyIndex,G4int transitionId,G4int augerIndex) const; 80 84 81 /// Given the atomic number, the index of th << 85 // Given the atomic number, the index of the starting vacancy shell and the transition shell Id, 82 /// returns the number of shells wich an aug << 86 // returns the number of shells wich an auger electron can come from. 83 size_t NumberOfAuger(G4int Z, G4int initInde 87 size_t NumberOfAuger(G4int Z, G4int initIndex, G4int vacancyId) const; 84 88 85 /// Given the atomic number, th index of the << 89 // Given the atomic number, th index of the starting and the auger originating shell, 86 /// and the transition shell Id, returns the << 90 // and the transition shell Id, returns the ager originating shell Id 87 size_t AugerShellId(G4int Z, G4int vacancyIn 91 size_t AugerShellId(G4int Z, G4int vacancyIndex, G4int transId, G4int augerIndex) const; 88 92 89 std::vector<G4AugerTransition> LoadData(G4in 93 std::vector<G4AugerTransition> LoadData(G4int Z); >> 94 90 void BuildAugerTransitionTable(); 95 void BuildAugerTransitionTable(); >> 96 91 void PrintData(G4int Z); 97 void PrintData(G4int Z); 92 98 93 /// Given the atomic number and the vacancy << 99 94 /// the AugerTransition object related to th << 100 >> 101 // Given the atomic number and the vacancy initial shell index returns >> 102 // the AugerTransition object related to that shell >> 103 95 G4AugerTransition* GetAugerTransition(G4int 104 G4AugerTransition* GetAugerTransition(G4int Z, G4int vacancyShellIndex); 96 105 97 /// Given the atomic number returns a vector << 106 // Given the atomic number returns a vector of possible AugerTransition objects 98 std::vector<G4AugerTransition>* GetAugerTran 107 std::vector<G4AugerTransition>* GetAugerTransitions(G4int Z); 99 108 100 private: 109 private: >> 110 >> 111 // std::map<G4int,G4DataVector*,std::less<G4int> > idMap; >> 112 101 typedef std::map<G4int,std::vector<G4AugerTr 113 typedef std::map<G4int,std::vector<G4AugerTransition>,std::less<G4int> > trans_Table; 102 trans_Table augerTransitionTable; << 114 trans_Table augerTransitionTable; >> 115 >> 116 /* >> 117 std::map<G4int,std::map<G4Int,G4DataVector*,std::less<G4int> >,std::less<G4int> > transProbabilityMap; >> 118 std::map<G4int,std::map<G4Int,G4DataVector*,std::less<G4int> >,std::less<G4int> > transAugerIdMap; >> 119 */ 103 120 104 std::vector<G4int> nInitShells; 121 std::vector<G4int> nInitShells; 105 std::vector<G4int> numberOfVacancies; 122 std::vector<G4int> numberOfVacancies; 106 123 107 }; 124 }; 108 125 109 #endif 126 #endif 110 127 111 128 112 129 113 130 114 131 115 132