Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/processes/biasing/generic/include/G4ILawCommonTruncatedExp.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 // G4ILawCommonTruncatedExp
 27 //
 28 // Class Description:
 29 //
 30 // A G4VBiasingInteractionLaw representing a truncated exponential
 31 // law : an exponential law acting on [0,L] segment. This law is
 32 // Common as it collects several process cross-sections, which sum
 33 // is used to drive the law.
 34 //
 35 // Author: Marc Verderi, November 2013.
 36 // --------------------------------------------------------------------
 37 #ifndef G4ILawCommonTruncatedExp_hh
 38 #define G4ILawCommonTruncatedExp_hh 1
 39 
 40 #include "G4VBiasingInteractionLaw.hh"
 41 #include "G4ILawTruncatedExp.hh"
 42 #include "G4ThreeVector.hh"
 43 
 44 class G4ILawCommonTruncatedExp : public G4VBiasingInteractionLaw
 45 {
 46   public:
 47 
 48     G4ILawCommonTruncatedExp(const G4String& name = "expSharedForceInteractionLaw");
 49     virtual ~G4ILawCommonTruncatedExp();
 50   
 51     virtual G4bool IsSingular() const
 52       { return fExpInteractionLaw.IsSingular(); }
 53     virtual G4bool IsEffectiveCrossSectionInfinite() const
 54       { return fExpInteractionLaw.IsEffectiveCrossSectionInfinite(); }
 55 
 56     virtual G4double ComputeEffectiveCrossSectionAt(G4double length) const;
 57     virtual G4double ComputeNonInteractionProbabilityAt(G4double length) const;
 58 
 59     void SetForceCrossSection( G4double xs )
 60       { fExpInteractionLaw.SetForceCrossSection( xs ); }
 61     void SetSelectedProcessXSfraction( G4double fXS )
 62       { fSelectedProcessXSfraction = fXS; }
 63     G4double SetSelectedProcessXSfraction() const
 64       { return fSelectedProcessXSfraction; }
 65     void SetMaximumDistance(G4double d)
 66       { fExpInteractionLaw.SetMaximumDistance(d); }
 67     G4double GetMaximumDistance() const
 68       { return fExpInteractionLaw.GetMaximumDistance(); }
 69    G4double GetInteractionDistance() const
 70       { return fExpInteractionLaw.GetInteractionDistance(); }
 71 
 72   private:
 73 
 74     // -- sample the distribution:
 75     virtual G4double SampleInteractionLength();
 76     // -- move by true path length, this position becomes the new initial point
 77     // -- in this case, cheat by returning DBL_MAX, to let operation proposing the
 78     // -- step length in the alongGPIL
 79     virtual G4double UpdateInteractionLengthForStep(G4double truePathLength);
 80 
 81   private:
 82 
 83     G4ILawTruncatedExp fExpInteractionLaw;
 84     G4double fSelectedProcessXSfraction = 0.0;
 85     G4double fInteractionDistance = 0.0;
 86 };
 87 
 88 #endif
 89