Geant4  9.6.p02
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
G4NeutronHPArbitaryTab.hh
Go to the documentation of this file.
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 //
27 // $Id$
28 //
29 #ifndef G4NeutronHPArbitaryTab_h
30 #define G4NeutronHPArbitaryTab_h 1
31 
32 #include <fstream>
34 
35 #include "globals.hh"
36 #include "G4ios.hh"
37 #include "Randomize.hh"
38 #include "G4NeutronHPVector.hh"
39 #include "G4VNeutronHPEDis.hh"
41 
42 // we will need a List of these .... one per term.
43 
45 {
46  public:
48  {
49  theDistFunc = 0;
50  }
52  {
53  if(theDistFunc!=0) delete [] theDistFunc;
54  }
55 
56  inline void Init(std::ifstream & theData)
57  {
58  G4int i;
59  theFractionalProb.Init(theData, CLHEP::eV);
60  theData >> nDistFunc; // = number of incoming n energy points
61  theDistFunc = new G4NeutronHPVector [nDistFunc];
62  theManager.Init(theData);
63  G4double currentEnergy;
64  for(i=0; i<nDistFunc; i++)
65  {
66  theData >> currentEnergy;
67  theDistFunc[i].SetLabel(currentEnergy*CLHEP::eV);
68  theDistFunc[i].Init(theData, CLHEP::eV);
69  //************************************************************************
70  //EMendoza:
71  //ThinOut() assumes that the data is linear-linear, what is false:
72  //theDistFunc[i].ThinOut(0.02); // @@@ optimization to be finished.
73  //************************************************************************
74  }
75 
76  //************************************************************************
77  //EMendoza:
78  //Here we calculate the thresholds for the 2D sampling:
79  for(i=0; i<nDistFunc; i++){
80  G4int np=theDistFunc[i].GetVectorLength();
81  theLowThreshold[i]=theDistFunc[i].GetEnergy(0);
82  theHighThreshold[i]=theDistFunc[i].GetEnergy(np-1);
83  for(G4int j=0;j<np-1;j++){
84  if(theDistFunc[i].GetXsec(j+1)>1.e-20){
85  theLowThreshold[i]=theDistFunc[i].GetEnergy(j);
86  break;
87  }
88  }
89  for(G4int j=1;j<np;j++){
90  if(theDistFunc[i].GetXsec(j-1)>1.e-20){
91  theHighThreshold[i]=theDistFunc[i].GetEnergy(j);
92  }
93  }
94  }
95  //************************************************************************
96  }
97 
99  {
100  return theFractionalProb.GetY(anEnergy);
101  }
102 
103  G4double Sample(G4double anEnergy) ;
104 
105  private:
106 
107  G4NeutronHPVector theFractionalProb;
108  G4int nDistFunc;
109  G4InterpolationManager theManager; // knows the interpolation between stores
110  G4NeutronHPVector * theDistFunc; // one per incoming energy
111  G4NeutronHPVector theBuffer;
112  //************************************************************************
113  //EMendoza:
114  G4double theLowThreshold[1000];
115  G4double theHighThreshold[1000];
116  //************************************************************************
117 
118 };
119 
120 #endif