Import Geant4 0.0.0 source tree

2016-06-01 15:25:35 +02:00
parent 54d6b71f95
commit b97f8d0df7
3237 changed files with 807095 additions and 0 deletions
@@ -0,0 +1,125 @@
+// This code implementation is the intellectual property of
+// the RD44 GEANT4 collaboration.
+//
+// By copying, distributing or modifying the Program (or any work
+// based on the Program) you indicate your acceptance of this statement,
+// and all its terms.
+//
+// $Id: G4DistributionGenerator.cc,v 2.2 1998/07/13 17:26:46 urbi Exp $
+// GEANT4 tag $Name: geant4-00 $
+//
+// -------------------------------------------------------------------
+//      GEANT 4 class file --- Copyright CERN 1998
+//      CERN Geneva Switzerland
+//
+//      For information related to this code contact:
+//      CERN, IT Division, ASD group
+//
+//      File name:     G4DistributionGenerator
+//
+//      Author:        Maria Grazia Pia (pia@genova.infn.it)
+// 
+//      Creation date: 8 May 1998
+//
+//      Modifications: 
+// -------------------------------------------------------------------
+
+
+#include "G4DistributionGenerator.hh"
+#include "G4ios.hh"
+#include <assert.h>
+
+// Constructor
+
+G4DistributionGenerator::G4DistributionGenerator(RWTValOrderedVector<G4double>& x,
+						 RWTValOrderedVector<G4double>& values)
+  
+{
+  _x = x;
+
+  // Check boundaries: must be size(x) = size(values) + 1
+  if (x.entries() != (values.entries() + 1))
+    { G4cout << " Inconsistent parameters in G4DistributionGenerator "
+	   << endl;
+    }
+  assert (x.entries() == (values.entries() + 1));
+
+  G4double tot = 0.;
+  int i;
+  for (i=0; i<values.entries(); i++) { tot += values[i]; }
+  assert (tot > 0.);
+  
+  _cumProb.insert(0.);    
+  //  _cumProb.insert(values[0] / tot);
+  G4double sum = 0.;
+  for (i=0; i<values.entries(); i++) 
+    { 
+      sum += values[i];
+      _cumProb.insert(sum / tot); }
+
+  // Debugging
+  /*
+  for (i=0; i<values.entries(); i++)
+    { G4cout << values[i] << "  " ; }
+  G4cout << "  Integral = " << tot << endl;
+  for (i=0; i<_cumProb.entries(); i++)
+    { 
+      G4cout << "Variable " << _x[i]  
+	   << " --- cumProb = " << _cumProb[i] << endl;
+    }
+  */
+  // End of debugging
+
+}
+
+// Destructor
+
+G4DistributionGenerator::~G4DistributionGenerator()
+{
+}
+
+
+G4double G4DistributionGenerator::Generate(G4double ranflat)
+{
+  G4double xRandom = _x[0];
+
+  G4int bin = _cumProb.entries() - 1;
+  int i;
+  for (i=1; i<_cumProb.entries(); i++)
+    {
+      if (ranflat >= _cumProb[i-1] && ranflat < _cumProb[i])
+	{
+	  bin = i - 1;
+	}
+    }
+
+  if (bin >= 0 && bin < (_cumProb.entries()-1) && bin < (_x.entries()-1)) 
+    {
+      G4double coeff = (ranflat - _cumProb[bin]) *  (_x[bin+1] - _x[bin]) / 
+                   (_cumProb[bin+1] - _cumProb[bin]);
+      xRandom = _x[bin] + coeff;
+
+      // Deugging
+      /*
+      G4cout << "Random = " << ranflat << " Generated " << xRandom << endl;
+      */
+      // Endo of Debugging
+
+    }
+  else
+    { 
+      // Debugging
+      /*
+      G4cout << "Bin " << bin << " "
+	   << _cumProb.entries() << " " 
+	   << _x.entries()
+	   << endl;
+      */
+      // End of debugging
+    }
+
+  return xRandom;
+
+}
+
+