[815] | 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 | // |
---|
| 27 | // $Id: G4VErrorLimitProcess.hh,v 1.2 2007/05/29 14:41:35 gcosmo Exp $ |
---|
[1058] | 28 | // GEANT4 tag $Name: geant4-09-02-ref-02 $ |
---|
[815] | 29 | // |
---|
| 30 | // |
---|
| 31 | // Class description: |
---|
| 32 | // |
---|
| 33 | // Base class for classes limiting the step. |
---|
| 34 | |
---|
| 35 | // History: |
---|
| 36 | // |
---|
| 37 | // Created: P.Arce May 2007 |
---|
| 38 | // -------------------------------------------------------------------- |
---|
| 39 | |
---|
| 40 | #ifndef G4VErrorLimitProcess_hh |
---|
| 41 | #define G4VErrorLimitProcess_hh |
---|
| 42 | |
---|
| 43 | #include "G4ios.hh" |
---|
| 44 | #include "globals.hh" |
---|
| 45 | #include "G4VDiscreteProcess.hh" |
---|
| 46 | #include "G4PhysicsTable.hh" |
---|
| 47 | #include "G4PhysicsLogVector.hh" |
---|
| 48 | #include "G4ElementTable.hh" |
---|
| 49 | #include "G4Gamma.hh" |
---|
| 50 | #include "G4Electron.hh" |
---|
| 51 | #include "G4Step.hh" |
---|
| 52 | |
---|
| 53 | class G4ErrorLimitsMessenger; |
---|
| 54 | |
---|
| 55 | //----------------------------------------------------------------- |
---|
| 56 | |
---|
| 57 | class G4VErrorLimitProcess : public G4VDiscreteProcess |
---|
| 58 | { |
---|
| 59 | |
---|
| 60 | public: // with description |
---|
| 61 | |
---|
| 62 | G4VErrorLimitProcess(const G4String& processName); |
---|
| 63 | |
---|
| 64 | ~G4VErrorLimitProcess(); |
---|
| 65 | |
---|
| 66 | virtual G4double |
---|
| 67 | PostStepGetPhysicalInteractionLength( const G4Track& track, |
---|
| 68 | G4double previousStepSize, |
---|
| 69 | G4ForceCondition* condition ) = 0; |
---|
| 70 | // Returns the step limit |
---|
| 71 | |
---|
| 72 | virtual G4double GetMeanFreePath(const class G4Track &, G4double, |
---|
| 73 | enum G4ForceCondition *); |
---|
| 74 | // Returns kInfinity |
---|
| 75 | |
---|
| 76 | virtual G4VParticleChange* PostStepDoIt(const G4Track&, const G4Step& ); |
---|
| 77 | // No action but retrieving the G4VParticleChange |
---|
| 78 | // extracted from the G4Track |
---|
| 79 | |
---|
| 80 | // Get and Set methods |
---|
| 81 | |
---|
| 82 | G4double GetStepLimit() const { return theStepLimit; } |
---|
| 83 | void SetStepLimit( G4double val ) { theStepLimit = val; } |
---|
| 84 | |
---|
| 85 | protected: |
---|
| 86 | |
---|
| 87 | G4double theStepLimit; // limit set by the user |
---|
| 88 | G4double theStepLength; // step length extracted from the user step limit, |
---|
| 89 | // with the algorithms of each concrete class |
---|
| 90 | }; |
---|
| 91 | |
---|
| 92 | #endif |
---|