Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/processes/biasing/generic/include/G4ILawForceFreeFlight.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 ]

Diff markup

Differences between /processes/biasing/generic/include/G4ILawForceFreeFlight.hh (Version 11.3.0) and /processes/biasing/generic/include/G4ILawForceFreeFlight.hh (Version 11.2.1)


  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 //
                                                   >>  27 //
                                                   >>  28 // ---------------------------------------------------------------
                                                   >>  29 //
 26 // G4ILawForceFreeFlight                           30 // G4ILawForceFreeFlight
 27 //                                                 31 //
 28 // Class Description:                              32 // Class Description:
                                                   >>  33 //     A G4VBiasingInteractionLaw representing the "interaction" law
                                                   >>  34 //  for a force free flight, ie, a particle which does not interact.
                                                   >>  35 //  It is a limit case for which the non-interaction probability over
                                                   >>  36 //  a segment is always 1, and the effective cross-section always
                                                   >>  37 //  zero.
                                                   >>  38 //     This singular behavior is signaled by the IsSingular()
                                                   >>  39 //  method returning always true.
 29 //                                                 40 //
 30 // A G4VBiasingInteractionLaw representing the <<  41 // ---------------------------------------------------------------
 31 // for a force free flight, ie, a particle whi <<  42 //   Initial version                         Nov. 2013 M. Verderi
 32 // It is a limit case for which the non-intera << 
 33 // a segment is always 1, and the effective cr << 
 34 // zero. This singular behavior is signaled by << 
 35 // method returning always true.               << 
 36 //                                             << 
 37 // Author: Marc Verderi, November 2013.        << 
 38 // ------------------------------------------- << 
 39 #ifndef G4ILawForceFreeFlight_hh                   43 #ifndef G4ILawForceFreeFlight_hh
 40 #define G4ILawForceFreeFlight_hh 1                 44 #define G4ILawForceFreeFlight_hh 1
 41                                                    45 
 42 #include "G4VBiasingInteractionLaw.hh"             46 #include "G4VBiasingInteractionLaw.hh"
 43                                                    47 
 44 class G4ILawForceFreeFlight : public G4VBiasin     48 class G4ILawForceFreeFlight : public G4VBiasingInteractionLaw
 45 {                                                  49 {
 46   public:                                      <<  50 public:
 47                                                <<  51   G4ILawForceFreeFlight(G4String name = "forceFreeFlightLaw");
 48     G4ILawForceFreeFlight(const G4String& name <<  52   virtual ~G4ILawForceFreeFlight();
 49     virtual ~G4ILawForceFreeFlight();          << 
 50                                                    53   
 51     virtual G4double ComputeEffectiveCrossSect <<  54 public:
 52     virtual G4double ComputeNonInteractionProb <<  55   virtual G4double     ComputeEffectiveCrossSectionAt(G4double               length) const;
 53                                                <<  56   virtual G4double ComputeNonInteractionProbabilityAt(G4double               length) const;
 54     // -- sample the distribution              <<  57   // -- sample the distribution
 55     virtual  G4double SampleInteractionLength( <<  58   virtual  G4double           SampleInteractionLength();
 56     // -- move by true path length, this posit <<  59   // -- move by true path length, this position becomes the new initial point
 57     virtual G4double UpdateInteractionLengthFo <<  60   virtual G4double     UpdateInteractionLengthForStep(G4double       truePathLength);
 58     virtual G4bool IsSingular() const { return <<  61   virtual G4bool IsSingular() const {return true;}
 59 };                                                 62 };
 60                                                    63 
 61 #endif                                             64 #endif
 62                                                    65