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