| 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 //
>> 24 //
>> 25 // $Id: G4FluoData.hh,v 1.1 ?????
>> 26 // GEANT4 tag $Name: geant4-04-00 $
25 // 27 //
26 // Author: Elena Guardincerri (Elena.Guardince 28 // Author: Elena Guardincerri (Elena.Guardincerri@ge.infn.it)
27 // 29 //
28 // History: 30 // History:
29 // ----------- 31 // -----------
30 // 16 Sept 2001 First committed to cvs 32 // 16 Sept 2001 First committed to cvs
31 // 33 //
32 // ------------------------------------------- 34 // -------------------------------------------------------------------
33 35
34 // Class description: 36 // Class description:
35 // Low Energy Electromagnetic Physics 37 // Low Energy Electromagnetic Physics
36 // Fluorescence data set: shell identifiers, t 38 // Fluorescence data set: shell identifiers, transition probabilities,
37 // transition energies 39 // transition energies
>> 40 // Further documentation available from http://www.ge.infn.it/geant4/lowE
38 41
39 // ------------------------------------------- 42 // -------------------------------------------------------------------
40 43
41 #ifndef G4FLUODATA_HH 44 #ifndef G4FLUODATA_HH
42 #define G4FLUODATA_HH 1 45 #define G4FLUODATA_HH 1
43 46
44 #include "globals.hh" 47 #include "globals.hh"
45 #include <vector> << 48 #include "g4std/vector"
46 #include <map> << 49 #include "g4std/map"
>> 50
47 51
48 class G4FluoTransition; <<
49 class G4DataVector; 52 class G4DataVector;
50 53
51 class G4FluoData 54 class G4FluoData
52 { 55 {
53 public: 56 public:
54 57
55 explicit G4FluoData(const G4String& dir); << 58 G4FluoData();
56 59
57 ~G4FluoData(); 60 ~G4FluoData();
58 61
59 /// The method returns the number of shells << 62 // The method returns the number of shells in wich a
60 /// vacancy can be filled by a radiative tra << 63 // vacancy can be filled by a radiative transition
61 std::size_t NumberOfVacancies() const; << 64 size_t NumberOfVacancies() const;
62 65
63 /// Given the index of the vacancy returns i << 66 // Given the index of the vacancy returns its identity
64 G4int VacancyId(G4int vacancyIndex) const; 67 G4int VacancyId(G4int vacancyIndex) const;
65 68
66 /// Given the index of a vacancy returns the << 69 // Given the index of a vacancy returns the number of
67 /// shells starting from wich an electrons c << 70 //shells starting from wich an electrons can fill the vacancy
68 std::size_t NumberOfTransitions(G4int vacanc << 71 size_t NumberOfTransitions(G4int vacancyIndex) const;
69 << 72
70 /// Given the indexes of the starting and fi << 73 // Given the indexes of the starting and final shells for the
71 /// transition, returns the identity of the << 74 // transition, returns the identity of the starting one
72 G4int StartShellId(G4int initIndex, G4int va << 75 G4int StartShellId(G4int initIndex,G4int vacancyIndex);
73 << 76
74 /// Given the indexes of the starting and fi << 77 // Given the indexes of the starting and final shells for the
75 /// transition, returns the transition energ << 78 // transition, returns the transition energy
76 G4double StartShellEnergy(G4int initIndex, G << 79 G4double StartShellEnergy(G4int initIndex,G4int vacancyIndex);
77 << 80
78 /// Given the indexes of the starting and fi << 81 // Given the indexes of the starting and final shells for the
79 /// transition, returns the probability of t << 82 // transition, returns the probability of this transition
80 G4double StartShellProb(G4int initIndex, G4i << 83 G4double StartShellProb(G4int initIndex,G4int vacancyIndex);
81 84
82 void LoadData(G4int Z); << 85 void LoadData( G4int Z);
83 86
84 void PrintData(); 87 void PrintData();
85 88
86 G4FluoData& operator=(const G4FluoData& righ <<
87 G4FluoData(const G4FluoData&) = delete; <<
88 <<
89 private: 89 private:
90 std::map<G4int,G4DataVector*,std::less<G4int <<
91 std::map<G4int,G4DataVector*,std::less<G4int <<
92 std::map<G4int,G4DataVector*,std::less<G4int <<
93 std::vector<G4int> nInitShells; <<
94 std::map<G4int,std::vector<G4FluoTransition* <<
95 G4String fluoDirectory; <<
96 <<
97 G4int numberOfVacancies = 0; <<
98 90
>> 91 G4std::map<G4int,G4DataVector*,G4std::less<G4int> > idMap;
>> 92 G4std::map<G4int,G4DataVector*,G4std::less<G4int> > energyMap;
>> 93 G4std::map<G4int,G4DataVector*,G4std::less<G4int> > probabilityMap;
>> 94 G4std::vector<G4int> nInitShells;
>> 95 G4int numberOfVacancies;
>> 96
99 }; 97 };
100 98
101 #endif 99 #endif
102 100
103 101
104 102