| 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 //
26 // 23 //
>> 24 // $Id: XrayFluoDataSet.hh
>> 25 // GEANT4 tag $Name: xray_fluo-V03-02-00
27 // 26 //
28 // Author: Elena Guardincerri (Elena.Guardince 27 // Author: Elena Guardincerri (Elena.Guardincerri@ge.infn.it)
29 // 28 //
30 // History: 29 // History:
31 // ----------- 30 // -----------
32 // 28 Nov 2001 Elena Guardincerri Created 31 // 28 Nov 2001 Elena Guardincerri Created
33 // 2001 - 2009 Alfonso Mantero Mantaine << 32 //
34 // ------------------------------------------- 33 // -------------------------------------------------------------------
35 34
36 //for the documentation of this class see also 35 //for the documentation of this class see also G4EMDataSet class
37 36
38 #ifndef FluoDataSet_hh 37 #ifndef FluoDataSet_hh
39 #define FluoDataSet_hh 1 38 #define FluoDataSet_hh 1
40 39
41 #include <CLHEP/Units/SystemOfUnits.h> <<
42 <<
43 #include "globals.hh" 40 #include "globals.hh"
44 #include "G4DataVector.hh" 41 #include "G4DataVector.hh"
45 #include "G4VEMDataSet.hh" 42 #include "G4VEMDataSet.hh"
46 43
47 class G4VDataSetAlgorithm; 44 class G4VDataSetAlgorithm;
48 45
49 class XrayFluoDataSet : public G4VEMDataSet { 46 class XrayFluoDataSet : public G4VEMDataSet {
50 47
51 public: 48 public:
52 49
53 XrayFluoDataSet(G4int Z, 50 XrayFluoDataSet(G4int Z,
54 G4DataVector* points, 51 G4DataVector* points,
55 G4DataVector* values, 52 G4DataVector* values,
56 const G4VDataSetAlgorithm* interpolati 53 const G4VDataSetAlgorithm* interpolation,
57 G4double unitE = CLHEP::MeV, G4double << 54 G4double unitE = MeV, G4double unitData = barn);
58 55
59 XrayFluoDataSet(G4int Z, 56 XrayFluoDataSet(G4int Z,
60 const G4String& dataFile, 57 const G4String& dataFile,
61 const G4VDataSetAlgorithm* interpolati 58 const G4VDataSetAlgorithm* interpolation,
62 G4double unitE = CLHEP::MeV, G4double << 59 G4double unitE = MeV, G4double unitData = barn);
63 60
64 ~XrayFluoDataSet(); 61 ~XrayFluoDataSet();
65 62
66 //find the value corresponding to the energy 63 //find the value corresponding to the energy e in the set
67 //identified by id 64 //identified by id
68 G4double FindValue(G4double e, G4int) const; 65 G4double FindValue(G4double e, G4int) const;
69 66
70 virtual const G4VEMDataSet* GetComponent(G4i 67 virtual const G4VEMDataSet* GetComponent(G4int) const { return 0;}
71 68
72 virtual void AddComponent(G4VEMDataSet*) { } 69 virtual void AddComponent(G4VEMDataSet*) { }
73 70
74 virtual size_t NumberOfComponents() const { 71 virtual size_t NumberOfComponents() const { return 0; }
75 72
76 virtual void SetEnergiesData(G4DataVector*, <<
77 = 0) {} <<
78 <<
79 virtual G4bool SaveData(const G4String&) con <<
80 <<
81 virtual G4double RandomSelect(int = 0) const <<
82 73
83 void PrintData() const; 74 void PrintData() const;
84 75
85 const G4DataVector& GetEnergies(G4int) const 76 const G4DataVector& GetEnergies(G4int) const { return *energies; }
86 const G4DataVector& GetData(G4int) const { r 77 const G4DataVector& GetData(G4int) const { return *data; }
87 <<
88 virtual const G4DataVector& GetLogEnergies(G <<
89 virtual const G4DataVector& GetLogData(G4int <<
90 // void SetEnergiesData(G4DataVector* x, G4 <<
91 <<
92 virtual void SetLogEnergiesData(G4DataVector <<
93 G4DataVector <<
94 G4DataVector <<
95 G4DataVector <<
96 G4int ) {;} <<
97 <<
98 virtual G4bool LoadNonLogData(const G4String <<
99 <<
100 // G4bool SaveData(const G4String& fileName) <<
101 <<
102 <<
103 78
104 private: 79 private:
105 80
106 << 81 void LoadData(const G4String& dataFile);
107 G4bool LoadData(const G4String& dataFile); << 82 G4int z;
108 <<
109 G4int FindBinLocation(G4double energy) const 83 G4int FindBinLocation(G4double energy) const;
110 84
111 G4DataVector* energies; // Owned pointer 85 G4DataVector* energies; // Owned pointer
112 G4DataVector* data; // Owned pointer 86 G4DataVector* data; // Owned pointer
113 87
114 const G4VDataSetAlgorithm* algorithm; // Not 88 const G4VDataSetAlgorithm* algorithm; // Not owned pointer
115 89
116 G4double unit1; 90 G4double unit1;
117 G4double unit2; 91 G4double unit2;
118 92
119 size_t numberOfBins; 93 size_t numberOfBins;
120 94
121 }; 95 };
122 << 96
123 #endif 97 #endif
124 98