Geant4 Cross Reference |
1 // 1 // 2 // ******************************************* 2 // ******************************************************************** 3 // * License and Disclaimer << 3 // * DISCLAIMER * 4 // * 4 // * * 5 // * The Geant4 software is copyright of th << 5 // * The following disclaimer summarizes all the specific disclaimers * 6 // * the Geant4 Collaboration. It is provided << 6 // * of contributors to this software. The specific disclaimers,which * 7 // * conditions of the Geant4 Software License << 7 // * govern, are listed with their locations in: * 8 // * LICENSE and available at http://cern.ch/ << 8 // * http://cern.ch/geant4/license * 9 // * include a list of copyright holders. << 10 // * 9 // * * 11 // * Neither the authors of this software syst 10 // * Neither the authors of this software system, nor their employing * 12 // * institutes,nor the agencies providing fin 11 // * institutes,nor the agencies providing financial support for this * 13 // * work make any representation or warran 12 // * work make any representation or warranty, express or implied, * 14 // * regarding this software system or assum 13 // * regarding this software system or assume any liability for its * 15 // * use. Please see the license in the file << 14 // * use. * 16 // * for the full disclaimer and the limitatio << 17 // * 15 // * * 18 // * This code implementation is the result << 16 // * This code implementation is the intellectual property of the * 19 // * technical work of the GEANT4 collaboratio << 17 // * GEANT4 collaboration. * 20 // * By using, copying, modifying or distri << 18 // * By copying, distributing or modifying the Program (or any work * 21 // * any work based on the software) you ag << 19 // * based on the Program) you indicate your acceptance of this * 22 // * use in resulting scientific publicati << 20 // * statement, and all its terms. * 23 // * acceptance of all terms of the Geant4 Sof << 24 // ******************************************* 21 // ******************************************************************** 25 // 22 // >> 23 // $Id: G4AugerData.hh >> 24 // GEANT4 tag $Name: geant4-08-00-patch-01 $ 26 // 25 // 27 // Author: Alfonso Mantero (Alfonso.Mantero@ge 26 // Author: Alfonso Mantero (Alfonso.Mantero@ge.infn.it) 28 // 27 // 29 // History: 28 // History: 30 // ----------- 29 // ----------- 31 // 2 June 2002 First committed to cvs 30 // 2 June 2002 First committed to cvs 32 // 31 // 33 // ------------------------------------------- 32 // ------------------------------------------------------------------- >> 33 34 // Class description: 34 // Class description: 35 // Low Energy Electromagnetic Physics 35 // Low Energy Electromagnetic Physics 36 // This Class loads and stores all the informa 36 // This Class loads and stores all the information of auger effect (shellIds, 37 // probabilities and energies of the electron 37 // probabilities and energies of the electrons emitted) >> 38 // Further documentation available from http://www.ge.infn.it/geant4/lowE >> 39 38 // ------------------------------------------- 40 // ------------------------------------------------------------------- 39 41 40 #ifndef G4AUGERDATA_HH 42 #ifndef G4AUGERDATA_HH 41 #define G4AUGERDATA_HH 1 43 #define G4AUGERDATA_HH 1 42 44 43 #include "globals.hh" 45 #include "globals.hh" 44 #include <vector> 46 #include <vector> 45 #include <map> 47 #include <map> 46 #include "G4AugerTransition.hh" 48 #include "G4AugerTransition.hh" 47 49 48 class G4DataVector; 50 class G4DataVector; 49 51 50 class G4AugerData 52 class G4AugerData 51 { 53 { 52 public: 54 public: 53 55 54 explicit G4AugerData(); << 56 G4AugerData(); 55 ~G4AugerData() = default; << 57 >> 58 ~G4AugerData(); 56 59 57 /// The method returns the number of shells << 60 // The method returns the number of shells in wich a 58 /// vacancy can be filled by a NON-radiative << 61 // vacancy can be filled by a NON-radiative transition, given the atomic number 59 size_t NumberOfVacancies(G4int Z) const; 62 size_t NumberOfVacancies(G4int Z) const; 60 63 61 /// Given the index of the vacancy (and the << 64 // Given the index of the vacancy (and the atomic number Z) returns its identity 62 G4int VacancyId(G4int Z, G4int vacancyIndex) 65 G4int VacancyId(G4int Z, G4int vacancyIndex) const; 63 66 64 /// Given the index of a vacancy in the atom << 67 // 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 << 68 //shells starting from wich an electron can fill the vacancy 66 size_t NumberOfTransitions(G4int Z, G4int va 69 size_t NumberOfTransitions(G4int Z, G4int vacancyIndex) const; 67 70 68 /// Given the atomic number Z, the Index of << 71 // Given the atomic number Z, the Index of the initial vacancy shell 69 /// and the index of the starting shell for << 72 // and the index of the starting shell for the 70 /// transition, returns the identity of the << 73 // transition, returns the identity of the shell originating the electron transition 71 G4int StartShellId(G4int Z, G4int initialVac 74 G4int StartShellId(G4int Z, G4int initialVacancyIndex, G4int transitionShellIndex) const; 72 75 73 /// Given the atomic number , the indexes of << 76 // Given the atomic number , the indexes of the starting, the auger originating shell, 74 /// and the transition shell Id, returns the << 77 // and the transition shell Id, returns the transition energy 75 G4double StartShellEnergy(G4int Z, G4int vac 78 G4double StartShellEnergy(G4int Z, G4int vacancyIndex, G4int transitionId, G4int augerIndex) const; 76 79 77 /// Given the atomic number, the index of t << 80 // Given the atomic number, the index of the starting shell, the auger originating shells, 78 /// and the transition shell Id, returns the << 81 // and the transition shell Id, returns the transition probability 79 G4double StartShellProb(G4int Z, G4int vacan 82 G4double StartShellProb(G4int Z, G4int vacancyIndex,G4int transitionId,G4int augerIndex) const; 80 83 81 /// Given the atomic number, the index of th << 84 // 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 << 85 // returns the number of shells wich an auger electron can come from. 83 size_t NumberOfAuger(G4int Z, G4int initInde 86 size_t NumberOfAuger(G4int Z, G4int initIndex, G4int vacancyId) const; 84 87 85 /// Given the atomic number, th index of the << 88 // Given the atomic number, th index of the starting and the auger originating shell, 86 /// and the transition shell Id, returns the << 89 // and the transition shell Id, returns the ager originating shell Id 87 size_t AugerShellId(G4int Z, G4int vacancyIn 90 size_t AugerShellId(G4int Z, G4int vacancyIndex, G4int transId, G4int augerIndex) const; 88 91 89 std::vector<G4AugerTransition> LoadData(G4in 92 std::vector<G4AugerTransition> LoadData(G4int Z); >> 93 90 void BuildAugerTransitionTable(); 94 void BuildAugerTransitionTable(); >> 95 91 void PrintData(G4int Z); 96 void PrintData(G4int Z); 92 97 93 /// Given the atomic number and the vacancy << 98 94 /// the AugerTransition object related to th << 99 >> 100 // Given the atomic number and the vacancy intial shell index returns >> 101 // the AugerTransition object related to that shell >> 102 95 G4AugerTransition* GetAugerTransition(G4int 103 G4AugerTransition* GetAugerTransition(G4int Z, G4int vacancyShellIndex); 96 104 97 /// Given the atomic number returns a vector << 105 // Given the atomic number returns a vector of possible AugerTransition objects 98 std::vector<G4AugerTransition>* GetAugerTran 106 std::vector<G4AugerTransition>* GetAugerTransitions(G4int Z); 99 107 100 private: 108 private: >> 109 >> 110 // std::map<G4int,G4DataVector*,std::less<G4int> > idMap; >> 111 101 typedef std::map<G4int,std::vector<G4AugerTr 112 typedef std::map<G4int,std::vector<G4AugerTransition>,std::less<G4int> > trans_Table; 102 trans_Table augerTransitionTable; << 113 trans_Table augerTransitionTable; >> 114 >> 115 /* >> 116 std::map<G4int,std::map<G4Int,G4DataVector*,std::less<G4int> >,std::less<G4int> > transProbabilityMap; >> 117 std::map<G4int,std::map<G4Int,G4DataVector*,std::less<G4int> >,std::less<G4int> > transAugerIdMap; >> 118 */ 103 119 104 std::vector<G4int> nInitShells; 120 std::vector<G4int> nInitShells; 105 std::vector<G4int> numberOfVacancies; 121 std::vector<G4int> numberOfVacancies; 106 122 107 }; 123 }; 108 124 109 #endif 125 #endif 110 126 111 127 112 128 113 129 114 130 115 131