Geant4 Cross Reference |
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 // $Id$ 26 // 27 // 27 // ------------------------------------------- 28 // ------------------------------------------------------------ 28 // GEANT 4 class implementation file << 29 // GEANT 4 class implementation file 29 // ------------------------------------------- 30 // ------------------------------------------------------------ 30 // 31 // 31 32 32 #include "G4ErrorMagFieldLimitProcess.hh" 33 #include "G4ErrorMagFieldLimitProcess.hh" 33 #include "G4ErrorMessenger.hh" 34 #include "G4ErrorMessenger.hh" 34 #include "G4TransportationManager.hh" 35 #include "G4TransportationManager.hh" 35 #include "G4FieldManager.hh" 36 #include "G4FieldManager.hh" 36 #include "G4Field.hh" 37 #include "G4Field.hh" 37 #include "G4Track.hh" 38 #include "G4Track.hh" 38 39 39 #ifdef G4VERBOSE 40 #ifdef G4VERBOSE 40 # include "G4ErrorPropagatorData.hh" << 41 #include "G4ErrorPropagatorData.hh" 41 #endif 42 #endif 42 43 43 //-------------------------------------------- 44 //------------------------------------------------------------------------ 44 G4ErrorMagFieldLimitProcess::G4ErrorMagFieldLi << 45 G4ErrorMagFieldLimitProcess:: 45 const G4String& processName) << 46 G4ErrorMagFieldLimitProcess(const G4String& processName) 46 : G4VErrorLimitProcess(processName) << 47 : G4VErrorLimitProcess(processName) 47 { 48 { 48 theStepLimit = kInfinity; 49 theStepLimit = kInfinity; 49 } 50 } 50 51 >> 52 51 //-------------------------------------------- 53 //------------------------------------------------------------------------ 52 G4ErrorMagFieldLimitProcess::~G4ErrorMagFieldL << 54 G4ErrorMagFieldLimitProcess::~G4ErrorMagFieldLimitProcess() >> 55 { } >> 56 53 57 54 //-------------------------------------------- 58 //------------------------------------------------------------------------ 55 G4double G4ErrorMagFieldLimitProcess::PostStep << 59 G4double G4ErrorMagFieldLimitProcess:: 56 const G4Track& aTrack, G4double, G4ForceCond << 60 PostStepGetPhysicalInteractionLength( const G4Track& aTrack, G4double , >> 61 G4ForceCondition* condition ) 57 { 62 { 58 *condition = NotForced; << 63 *condition = NotForced; 59 const G4Field* field = G4TransportationManag << 64 const G4Field* field = 60 ->GetFieldManager() << 65 G4TransportationManager::GetTransportationManager()->GetFieldManager() 61 ->GetDetectorField( << 66 ->GetDetectorField(); 62 67 63 theStepLength = kInfinity; 68 theStepLength = kInfinity; 64 if(field != 0) << 69 if( field != 0 ) { 65 { << 66 G4ThreeVector trkPosi = aTrack.GetPosition 70 G4ThreeVector trkPosi = aTrack.GetPosition(); 67 G4double pos1[3]; 71 G4double pos1[3]; 68 pos1[0] = trkPosi.x(); << 72 pos1[0] = trkPosi.x(); pos1[1] = trkPosi.y(); pos1[2] = trkPosi.z(); 69 pos1[1] = trkPosi.y(); << 70 pos1[2] = trkPosi.z(); << 71 73 72 G4double h1[3]; 74 G4double h1[3]; 73 field->GetFieldValue(pos1, h1); << 75 field->GetFieldValue( pos1, h1 ); 74 76 75 G4ThreeVector BVec(h1[0], h1[1], h1[2]); << 77 G4ThreeVector BVec(h1[0],h1[1],h1[2]); 76 G4double pmag = aTrack.GetMomentum().m << 78 G4double pmag = aTrack.GetMomentum().mag(); 77 G4double BPerpMom = BVec.cross(G4ThreeVect << 79 G4double BPerpMom = BVec.cross( G4ThreeVector(pmag,0.,0.) ).mag() / pmag; 78 80 79 theStepLength = theStepLimit * pmag / BPer << 81 theStepLength = theStepLimit * pmag / BPerpMom; 80 #ifdef G4VERBOSE 82 #ifdef G4VERBOSE 81 if(G4ErrorPropagatorData::verbose() >= 3) << 83 if(G4ErrorPropagatorData::verbose() >= 3 ) { 82 { << 84 G4cout << "G4ErrorMagFieldLimitProcess:: stepLength " 83 G4cout << "G4ErrorMagFieldLimitProcess:: << 85 << theStepLength << " B " << BPerpMom << " BVec " << BVec 84 << " B " << BPerpMom << " BVec " << 86 << " pmag " << pmag << G4endl; 85 << G4endl; << 87 } 86 } << 87 #endif 88 #endif 88 } 89 } 89 90 90 return theStepLength; 91 return theStepLength; 91 } 92 } 92 93