| 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: Luciano Pandola 27 // Author: Luciano Pandola
28 // 28 //
29 // History: 29 // History:
30 // ----------- 30 // -----------
31 // 09 Dec 2009 L. Pandola 1st implementati 31 // 09 Dec 2009 L. Pandola 1st implementation.
32 // 32 //
33 // ------------------------------------------- 33 // -------------------------------------------------------------------
34 // 34 //
35 // Class description: 35 // Class description:
36 // This is a container of data that are used f 36 // This is a container of data that are used for sampling algorithm
37 // of Penelope08 Rayleigh scattering 37 // of Penelope08 Rayleigh scattering
38 // ------------------------------------------- 38 // -------------------------------------------------------------------
39 39
40 #ifndef G4PENELOPESAMPLINGDATA_HH 40 #ifndef G4PENELOPESAMPLINGDATA_HH
41 #define G4PENELOPESAMPLINGDATA_HH 1 41 #define G4PENELOPESAMPLINGDATA_HH 1
42 42
43 #include "globals.hh" 43 #include "globals.hh"
44 #include "G4DataVector.hh" 44 #include "G4DataVector.hh"
45 // 45 //
46 //This is a container of data that are used fo 46 //This is a container of data that are used for sampling algoritm
47 // 47 //
48 class G4PenelopeSamplingData 48 class G4PenelopeSamplingData
49 { 49 {
50 public: 50 public:
51 explicit G4PenelopeSamplingData(G4int npoint 51 explicit G4PenelopeSamplingData(G4int npoints=150);
52 ~G4PenelopeSamplingData(); 52 ~G4PenelopeSamplingData();
53 53
54 void AddPoint(G4double x0,G4double pac0,G4do 54 void AddPoint(G4double x0,G4double pac0,G4double a0,G4double b0,size_t ITTL0,
55 size_t ITTU0); 55 size_t ITTU0);
56 size_t GetNumberOfStoredPoints(); 56 size_t GetNumberOfStoredPoints();
57 void Clear(); 57 void Clear();
58 void DumpTable(); 58 void DumpTable();
59 59
60 G4double GetX(size_t index); 60 G4double GetX(size_t index);
61 G4double GetPAC(size_t index); 61 G4double GetPAC(size_t index);
62 G4double GetA(size_t index); 62 G4double GetA(size_t index);
63 G4double GetB(size_t index); 63 G4double GetB(size_t index);
64 64
65 G4double SampleValue(G4double rndm); 65 G4double SampleValue(G4double rndm);
66 66
67 G4PenelopeSamplingData & operator=(const G4P 67 G4PenelopeSamplingData & operator=(const G4PenelopeSamplingData &right) = delete;
68 G4PenelopeSamplingData(const G4PenelopeSampl 68 G4PenelopeSamplingData(const G4PenelopeSamplingData&) = delete;
69 69
70 private: 70 private:
71 G4DataVector* fX; //grid points, in increasi 71 G4DataVector* fX; //grid points, in increasing order
72 G4DataVector* fPAC; //value of the cumulativ 72 G4DataVector* fPAC; //value of the cumulative pdf at x_i
73 G4DataVector* fA; // rational inverse cumula 73 G4DataVector* fA; // rational inverse cumulative inverse distribution parameters
74 G4DataVector* fB; 74 G4DataVector* fB;
75 75
76 std::vector<size_t> *fITTL; //largest j for 76 std::vector<size_t> *fITTL; //largest j for which pac(j) < (i-1)/(np-1)
77 std::vector<size_t> *fITTU; //smallest k for 77 std::vector<size_t> *fITTU; //smallest k for which pac(k) > i/(np-1)
78 78
79 G4int fNP; //number of grid points 79 G4int fNP; //number of grid points
80 }; 80 };
81 81
82 #endif 82 #endif
83 83
84 84