Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/track/include/G4VelocityTable.hh

Version: [ ReleaseNotes ] [ 1.0 ] [ 1.1 ] [ 2.0 ] [ 3.0 ] [ 3.1 ] [ 3.2 ] [ 4.0 ] [ 4.0.p1 ] [ 4.0.p2 ] [ 4.1 ] [ 4.1.p1 ] [ 5.0 ] [ 5.0.p1 ] [ 5.1 ] [ 5.1.p1 ] [ 5.2 ] [ 5.2.p1 ] [ 5.2.p2 ] [ 6.0 ] [ 6.0.p1 ] [ 6.1 ] [ 6.2 ] [ 6.2.p1 ] [ 6.2.p2 ] [ 7.0 ] [ 7.0.p1 ] [ 7.1 ] [ 7.1.p1 ] [ 8.0 ] [ 8.0.p1 ] [ 8.1 ] [ 8.1.p1 ] [ 8.1.p2 ] [ 8.2 ] [ 8.2.p1 ] [ 8.3 ] [ 8.3.p1 ] [ 8.3.p2 ] [ 9.0 ] [ 9.0.p1 ] [ 9.0.p2 ] [ 9.1 ] [ 9.1.p1 ] [ 9.1.p2 ] [ 9.1.p3 ] [ 9.2 ] [ 9.2.p1 ] [ 9.2.p2 ] [ 9.2.p3 ] [ 9.2.p4 ] [ 9.3 ] [ 9.3.p1 ] [ 9.3.p2 ] [ 9.4 ] [ 9.4.p1 ] [ 9.4.p2 ] [ 9.4.p3 ] [ 9.4.p4 ] [ 9.5 ] [ 9.5.p1 ] [ 9.5.p2 ] [ 9.6 ] [ 9.6.p1 ] [ 9.6.p2 ] [ 9.6.p3 ] [ 9.6.p4 ] [ 10.0 ] [ 10.0.p1 ] [ 10.0.p2 ] [ 10.0.p3 ] [ 10.0.p4 ] [ 10.1 ] [ 10.1.p1 ] [ 10.1.p2 ] [ 10.1.p3 ] [ 10.2 ] [ 10.2.p1 ] [ 10.2.p2 ] [ 10.2.p3 ] [ 10.3 ] [ 10.3.p1 ] [ 10.3.p2 ] [ 10.3.p3 ] [ 10.4 ] [ 10.4.p1 ] [ 10.4.p2 ] [ 10.4.p3 ] [ 10.5 ] [ 10.5.p1 ] [ 10.6 ] [ 10.6.p1 ] [ 10.6.p2 ] [ 10.6.p3 ] [ 10.7 ] [ 10.7.p1 ] [ 10.7.p2 ] [ 10.7.p3 ] [ 10.7.p4 ] [ 11.0 ] [ 11.0.p1 ] [ 11.0.p2 ] [ 11.0.p3, ] [ 11.0.p4 ] [ 11.1 ] [ 11.1.1 ] [ 11.1.2 ] [ 11.1.3 ] [ 11.2 ] [ 11.2.1 ] [ 11.2.2 ] [ 11.3.0 ]

  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 // G4VelocityTable
 27 //
 28 // Class description:
 29 //
 30 // This class keeps a table of velocity as a function of the ratio
 31 // kinetic erngy and mass. G4VelocityTable is used by
 32 // G4Track::CalculateVelocity().
 33 
 34 // Author: Hisaya Kurashige,  17 August 2011
 35 // --------------------------------------------------------------------
 36 #ifndef G4VelocityTable_hh
 37 #define G4VelocityTable_hh 1
 38 
 39 #include <vector>
 40 #include <iostream>
 41 
 42 #include "globals.hh"
 43 #include "G4ios.hh"
 44 #include "G4ThreadLocalSingleton.hh"
 45 
 46 class G4VelocityTable
 47 {
 48   friend class G4ThreadLocalSingleton<G4VelocityTable>;
 49 
 50   using G4VTDataVector = std::vector<G4double>;
 51 
 52   public:
 53 
 54     G4double Value(G4double theEnergy);
 55       // Get the cross-section/energy-loss value corresponding to the
 56       // given energy. An appropriate interpolation is used to calculate
 57       // the value
 58 
 59     static G4VelocityTable* GetVelocityTable();
 60 
 61     static void SetVelocityTableProperties(G4double t_max, G4double t_min,
 62                                            G4int nbin);
 63     static G4double GetMaxTOfVelocityTable();
 64     static G4double GetMinTOfVelocityTable();
 65     static G4int GetNbinOfVelocityTable();
 66 
 67   private:
 68 
 69     G4VelocityTable();
 70     ~G4VelocityTable();
 71 
 72     void PrepareVelocityTable();
 73 
 74     std::size_t FindBinLocation(G4double theEnergy) const;
 75       // Find the bin# in which theEnergy belongs - pure virtual function
 76 
 77     inline G4double Interpolation() const;
 78 
 79     // --------------------------------------------------------------------
 80 
 81     G4double edgeMin = 0.0;  // Energy of first point
 82     G4double edgeMax = 0.0;  // Energy of the last point
 83 
 84     std::size_t numberOfNodes = 0;
 85 
 86     G4VTDataVector dataVector;     // Vector to keep the crossection/energyloss
 87     G4VTDataVector binVector;      // Vector to keep energy
 88     G4VTDataVector secDerivative;  // Vector to keep second derivatives
 89 
 90     G4double dBin = 0.0;     // Bin width - useful only for fixed binning
 91     G4double baseBin = 0.0;  // Set this in constructor for performance
 92 
 93     G4double lastEnergy = -DBL_MAX;  // Cache the last input value
 94     G4double lastValue = 0.0;        // Cache the last output value
 95     std::size_t lastBin = 0;         // Cache the last bin location
 96 
 97     static G4ThreadLocal G4VelocityTable* theInstance;
 98 
 99     G4double maxT = 1000.0;
100     G4double minT = 0.0001;
101     G4int NbinT = 500;
102 };
103 
104 // ----------------------
105 // Inline methods
106 // ----------------------
107 
108 inline G4double G4VelocityTable::Interpolation() const
109 {
110   // Linear interpolation is used to get the value. If the give energy
111   // is in the highest bin, no interpolation will be Done. Because
112   // there is an extra bin hidden from a user at locBin=numberOfBin,
113   // the following interpolation is valid even the current locBin=
114   // numberOfBin-1.
115 
116   G4double intplFactor =
117     (lastEnergy - binVector[lastBin]) /
118     (binVector[lastBin + 1] - binVector[lastBin]);  // Interpol. factor
119 
120   return dataVector[lastBin] +
121          (dataVector[lastBin + 1] - dataVector[lastBin]) * intplFactor;
122 }
123 
124 #endif
125