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