| 1 | //
|
|---|
| 2 | // ********************************************************************
|
|---|
| 3 | // * License and Disclaimer *
|
|---|
| 4 | // * *
|
|---|
| 5 | // * The Geant4 software is copyright of the Copyright Holders of *
|
|---|
| 6 | // * the Geant4 Collaboration. It is provided under the terms and *
|
|---|
| 7 | // * conditions of the Geant4 Software License, included in the file *
|
|---|
| 8 | // * LICENSE and available at http://cern.ch/geant4/license . These *
|
|---|
| 9 | // * include a list of copyright holders. *
|
|---|
| 10 | // * *
|
|---|
| 11 | // * Neither the authors of this software system, nor their employing *
|
|---|
| 12 | // * institutes,nor the agencies providing financial support for this *
|
|---|
| 13 | // * work make any representation or warranty, express or implied, *
|
|---|
| 14 | // * regarding this software system or assume any liability for its *
|
|---|
| 15 | // * use. Please see the license in the file LICENSE and URL above *
|
|---|
| 16 | // * for the full disclaimer and the limitation of liability. *
|
|---|
| 17 | // * *
|
|---|
| 18 | // * This code implementation is the result of the scientific and *
|
|---|
| 19 | // * technical work of the GEANT4 collaboration. *
|
|---|
| 20 | // * By using, copying, modifying or distributing the software (or *
|
|---|
| 21 | // * any work based on the software) you agree to acknowledge its *
|
|---|
| 22 | // * use in resulting scientific publications, and indicate your *
|
|---|
| 23 | // * acceptance of all terms of the Geant4 Software license. *
|
|---|
| 24 | // ********************************************************************
|
|---|
| 25 | //
|
|---|
| 26 | // $Id: G4PenelopeSamplingData.hh,v 1.1 2010/03/17 14:19:04 pandola Exp $
|
|---|
| 27 | // GEANT4 tag $Name: geant4-09-04-beta-01 $
|
|---|
| 28 | //
|
|---|
| 29 | // Author: Luciano Pandola
|
|---|
| 30 | //
|
|---|
| 31 | // History:
|
|---|
| 32 | // -----------
|
|---|
| 33 | // 09 Dec 2009 L. Pandola 1st implementation.
|
|---|
| 34 | //
|
|---|
| 35 | // -------------------------------------------------------------------
|
|---|
| 36 | //
|
|---|
| 37 | // Class description:
|
|---|
| 38 | // This is a container of data that are used for sampling algorithm
|
|---|
| 39 | // of Penelope08 Rayleigh scattering
|
|---|
| 40 | // -------------------------------------------------------------------
|
|---|
| 41 |
|
|---|
| 42 | #ifndef G4PENELOPESAMPLINGDATA_HH
|
|---|
| 43 | #define G4PENELOPESAMPLINGDATA_HH 1
|
|---|
| 44 |
|
|---|
| 45 | #include "globals.hh"
|
|---|
| 46 | #include "G4DataVector.hh"
|
|---|
| 47 | //
|
|---|
| 48 | //This is a container of data that are used for sampling algoritm
|
|---|
| 49 | //
|
|---|
| 50 | class G4PenelopeSamplingData
|
|---|
| 51 | {
|
|---|
| 52 |
|
|---|
| 53 | public:
|
|---|
| 54 | G4PenelopeSamplingData(G4int npoints=150);
|
|---|
| 55 | ~G4PenelopeSamplingData();
|
|---|
| 56 |
|
|---|
| 57 | void AddPoint(G4double x0,G4double pac0,G4double a0,G4double b0,size_t ITTL0,
|
|---|
| 58 | size_t ITTU0);
|
|---|
| 59 | size_t GetNumberOfStoredPoints();
|
|---|
| 60 | void Clear();
|
|---|
| 61 | void DumpTable();
|
|---|
| 62 |
|
|---|
| 63 | G4double GetX(size_t index);
|
|---|
| 64 | G4double GetPAC(size_t index);
|
|---|
| 65 | G4double GetA(size_t index);
|
|---|
| 66 | G4double GetB(size_t index);
|
|---|
| 67 |
|
|---|
| 68 | G4double SampleValue(G4double rndm);
|
|---|
| 69 |
|
|---|
| 70 | private:
|
|---|
| 71 | G4PenelopeSamplingData & operator=(const G4PenelopeSamplingData &right);
|
|---|
| 72 | G4PenelopeSamplingData(const G4PenelopeSamplingData&);
|
|---|
| 73 |
|
|---|
| 74 | //G4double xlow;
|
|---|
| 75 | //G4double xhigh;
|
|---|
| 76 |
|
|---|
| 77 | G4DataVector* x; //grid points, in increasing order
|
|---|
| 78 | G4DataVector* pac; //value of the cumulative pdf at x_i
|
|---|
| 79 | G4DataVector* a; // rational inverse cumulative inverse distribution parameters
|
|---|
| 80 | G4DataVector* b;
|
|---|
| 81 |
|
|---|
| 82 | std::vector<size_t> *ITTL; //largest j for which pac(j) < (i-1)/(np-1)
|
|---|
| 83 | std::vector<size_t> *ITTU; //smallest k for which pac(k) > i/(np-1)
|
|---|
| 84 |
|
|---|
| 85 | G4int np; //number of grid points
|
|---|
| 86 |
|
|---|
| 87 |
|
|---|
| 88 |
|
|---|
| 89 | };
|
|---|
| 90 |
|
|---|
| 91 | #endif
|
|---|
| 92 |
|
|---|
