Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/processes/biasing/generic/src/G4BOptnChangeCrossSection.cc

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/src/G4BOptnChangeCrossSection.cc (Version 11.3.0) and /processes/biasing/generic/src/G4BOptnChangeCrossSection.cc (Version 10.2.p2)


  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 // G4BOptnChangeCrossSection                   << 
 27 // ------------------------------------------- << 
 28                                                << 
 29 #include "G4BOptnChangeCrossSection.hh"            26 #include "G4BOptnChangeCrossSection.hh"
 30 #include "G4InteractionLawPhysical.hh"             27 #include "G4InteractionLawPhysical.hh"
 31                                                    28 
 32 G4BOptnChangeCrossSection::G4BOptnChangeCrossS <<  29 
 33   : G4VBiasingOperation( name  )               <<  30 
                                                   >>  31 G4BOptnChangeCrossSection::G4BOptnChangeCrossSection(G4String name)
                                                   >>  32   : G4VBiasingOperation( name  ),
                                                   >>  33     fInteractionOccured( false )
 34 {                                                  34 {
 35   fBiasedExponentialLaw = new G4InteractionLaw     35   fBiasedExponentialLaw = new G4InteractionLawPhysical("LawForOperation"+name);
 36 }                                                  36 }
 37                                                    37 
 38 G4BOptnChangeCrossSection::~G4BOptnChangeCross     38 G4BOptnChangeCrossSection::~G4BOptnChangeCrossSection()
 39 {                                                  39 {
 40   delete fBiasedExponentialLaw;                <<  40   if ( fBiasedExponentialLaw ) delete fBiasedExponentialLaw;
 41 }                                                  41 }
 42                                                    42 
 43 const G4VBiasingInteractionLaw* G4BOptnChangeC     43 const G4VBiasingInteractionLaw* G4BOptnChangeCrossSection::ProvideOccurenceBiasingInteractionLaw( const G4BiasingProcessInterface*, G4ForceCondition& )
 44 {                                                  44 {
 45   return fBiasedExponentialLaw;                    45   return fBiasedExponentialLaw;
 46 }                                                  46 }
 47                                                    47 
 48 void G4BOptnChangeCrossSection::SetBiasedCross <<  48 void G4BOptnChangeCrossSection::SetBiasedCrossSection(G4double xst)
 49 {                                                  49 {
 50   fBiasedExponentialLaw->SetPhysicalCrossSecti     50   fBiasedExponentialLaw->SetPhysicalCrossSection( xst );
 51   if ( updateInteractionLength ) UpdateForStep << 
 52 }                                                  51 }
 53                                                    52 
 54 G4double G4BOptnChangeCrossSection::GetBiasedC     53 G4double G4BOptnChangeCrossSection::GetBiasedCrossSection() const
 55 {                                                  54 {
 56   return fBiasedExponentialLaw->GetPhysicalCro     55   return fBiasedExponentialLaw->GetPhysicalCrossSection();
 57 }                                                  56 }
 58                                                    57 
 59 void G4BOptnChangeCrossSection::Sample()           58 void G4BOptnChangeCrossSection::Sample()
 60 {                                                  59 {
 61   fInteractionOccured = false;                     60   fInteractionOccured = false;
 62   fBiasedExponentialLaw->Sample();                 61   fBiasedExponentialLaw->Sample();
 63 }                                                  62 }
 64                                                    63 
 65 void G4BOptnChangeCrossSection::UpdateForStep(     64 void G4BOptnChangeCrossSection::UpdateForStep( G4double truePathLength )
 66 {                                                  65 {
 67   fBiasedExponentialLaw->UpdateForStep( truePa     66   fBiasedExponentialLaw->UpdateForStep( truePathLength );
 68 }                                                  67 }
 69                                                    68