Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/processes/biasing/generic/include/G4BOptnLeadingParticle.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 // G4BOptnLeadingParticle
 27 //
 28 // Class Description:
 29 //
 30 // A G4VBiasingOperation that implements the so-called "Leading
 31 // particle biasing scheme". It is of interest in the shield problem
 32 // to estimate the flux leaking from the shield.
 33 // It works as follows:
 34 // - it is intented for hadronic inelastic interaction
 35 // - at each interaction, are kept:
 36 //     - the most energetic particle (the leading particle)
 37 //         - with unmodified weight
 38 //     - randomly one particle of each species
 39 //         - with this particle weight = n * primary_weight where
 40 //           n is the number of particles of this species
 41 //
 42 // Author: Marc Verderi, November 2019.
 43 // --------------------------------------------------------------------
 44 
 45 #ifndef G4BOptnLeadingParticle_hh
 46 #define G4BOptnLeadingParticle_hh 1
 47 
 48 #include "G4VBiasingOperation.hh"
 49 #include "G4ParticleChange.hh"
 50 
 51 class G4BOptnLeadingParticle : public G4VBiasingOperation
 52 {
 53   public:
 54 
 55     // -- Constructor :
 56     G4BOptnLeadingParticle(const G4String& name);
 57     // -- destructor:
 58     virtual ~G4BOptnLeadingParticle();
 59   
 60     // -- Methods from G4VBiasingOperation interface:
 61     // ----------------------------------------------
 62     // -- Unused:
 63     virtual const G4VBiasingInteractionLaw*
 64     ProvideOccurenceBiasingInteractionLaw( const G4BiasingProcessInterface*,
 65                                            G4ForceCondition& ) { return nullptr; }
 66     // -- Used:
 67     virtual G4VParticleChange*
 68     ApplyFinalStateBiasing( const G4BiasingProcessInterface*, // -- Method used for this biasing. The related biasing operator
 69                             const G4Track*,                   // -- returns this biasing operation at the post step do it level
 70                             const G4Step*,                    // -- when the wrapped process has won the interaction length race.
 71                             G4bool& );                        // -- The wrapped process final state is then trimmed.
 72     // -- Unused:
 73     virtual G4double
 74     DistanceToApplyOperation( const G4Track*, G4double, G4ForceCondition* ) { return 0.0; }
 75     virtual G4VParticleChange*
 76     GenerateBiasingFinalState( const G4Track*, const G4Step* ) { return nullptr; }
 77 
 78     // -- The possibility is given to further apply a Russian roulette on tracks that are accompagnying the leading particle
 79     // -- after the classical leading particle biasing algorithm has been applied.
 80     // -- This is of interest when applying the technique to e+ -> gamma gamma for example. Given one gamma is leading,
 81     // -- the second one is alone in its category, hence selected. With the Russian roulette it is then possible to keep
 82     // -- this one randomly. This is also of interest for pi0 decays, or for brem. e- -> e- gamma where the e- or gamma
 83     // -- are alone in their category.
 84     void SetFurtherKillingProbability( G4double p ) // -- if p <= 0.0 the killing is ignored.
 85     {
 86       fRussianRouletteKillingProbability = p;
 87     }
 88     G4double GetFurtherKillingProbability() const
 89     {
 90       return fRussianRouletteKillingProbability;
 91     }
 92 
 93   private:
 94 
 95     // -- Particle change used to return the trimmed final state:
 96     G4ParticleChange fParticleChange;
 97     G4double fRussianRouletteKillingProbability = -1.0;
 98 };
 99 
100 #endif
101