G4MultiLevelLocator.hh

Go to the documentation of this file. Or view the newest version in sPHENIX GitHub for file G4MultiLevelLocator.hh

//
// ********************************************************************
// * License and Disclaimer                                           *
// *                                                                  *
// * The  Geant4 software  is  copyright of the Copyright Holders  of *
// * the Geant4 Collaboration.  It is provided  under  the terms  and *
// * conditions of the Geant4 Software License,  included in the file *
// * LICENSE and available at  http://cern.ch/geant4/license .  These *
// * include a list of copyright holders.                             *
// *                                                                  *
// * Neither the authors of this software system, nor their employing *
// * institutes,nor the agencies providing financial support for this *
// * work  make  any representation or  warranty, express or implied, *
// * regarding  this  software system or assume any liability for its *
// * use.  Please see the license in the file  LICENSE  and URL above *
// * for the full disclaimer and the limitation of liability.         *
// *                                                                  *
// * This  code  implementation is the result of  the  scientific and *
// * technical work of the GEANT4 collaboration.                      *
// * By using,  copying,  modifying or  distributing the software (or *
// * any work based  on the software)  you  agree  to acknowledge its *
// * use  in  resulting  scientific  publications,  and indicate your *
// * acceptance of all terms of the Geant4 Software license.          *
// ********************************************************************
//
// Class G4MultiLevelLocator 
//
// class description:
// 
// Implementing the calculation of the intersection point with a boundary when
// PropagationInField is used. Derived from method LocateIntersectionPoint()
// from G4PropagatorInField, it is based on a linear method for finding the
// intersection point by means of a 'depth' algorithm in case of slow progress
// (intersection is not found after 100 trials).

// History:
// -------
// 27.10.08 - Tatiana Nikitina: Derived from LocateIntersectionPoint() from 
//                              G4PropagatorInField class
// ---------------------------------------------------------------------------

#ifndef G4MULTILEVELLOCATOR_HH
#define G4MULTILEVELLOCATOR_HH

#include "G4VIntersectionLocator.hh"

class G4MultiLevelLocator : public G4VIntersectionLocator
{
   public:  // with description 
 
     G4MultiLevelLocator(G4Navigator *theNavigator);
       // Constructor
     ~G4MultiLevelLocator();
       // Default destructor
     
     G4bool EstimateIntersectionPoint( 
         const  G4FieldTrack&       curveStartPointTangent,  // A
         const  G4FieldTrack&       curveEndPointTangent,    // B
         const  G4ThreeVector&      trialPoint,              // E
                G4FieldTrack&       intersectPointTangent,   // Output
                G4bool&             recalculatedEndPoint,    // Out
                G4double&           fPreviousSafety,         // In/Out
                G4ThreeVector&      fPreviousSftOrigin);     // In/Out
      // If such an intersection exists, this function calculates the
      // intersection point of the true path of the particle with the surface
      // of the current volume (or of one of its daughters). 
      // Should use lateral displacement as measure of convergence

     void ReportStatistics(); 

     inline void SetMaxSteps(unsigned int valMax) { fMaxSteps= valMax; }
     inline void SetWarnSteps(unsigned int valWarn) { fWarnSteps= valWarn; }

   private:

     void ReportFieldValue( const G4FieldTrack& locationPV,
                            const char* nameLoc,
                            const G4EquationOfMotion* equation );

     // Invariants -- parameters
     // ====================================   
     static const G4int max_depth = 10;
     unsigned int fMaxSteps = 10000; // Effort abandoned; signal is looping 
     unsigned int fWarnSteps = 1000; // Warn about many steps (but succeeded)

     // State - varies during simulation
     // ====================================
     G4FieldTrack* ptrInterMedFT[max_depth+1];
       // Used to store intermediate tracks values in case of too slow progress

     unsigned long int fNumCalls = 0; 
     unsigned long int fNumAdvanceFull = 0,
                       fNumAdvanceGood = 0,
                       fNumAdvanceTrials = 0;
       // Counters for statistics & debugging
};

#endif