Trk::NewtonTrkDistanceFinder Class Reference

AlgoTool which uses an iterative Newton method in two dimensions (the two points along the two tracks) in order to find their minimum distance. More...

#include <NewtonTrkDistanceFinder.h>

Inheritance diagram for Trk::NewtonTrkDistanceFinder:

Collaboration diagram for Trk::NewtonTrkDistanceFinder:

Public Member Functions
	NewtonTrkDistanceFinder (const std::string &t, const std::string &n, const IInterface *p)
virtual	~NewtonTrkDistanceFinder ()
virtual StatusCode	initialize () override
virtual StatusCode	finalize () override
std::variant< TwoPoints, std::string >	GetClosestPoints (const Perigee &a, const Perigee &b) const
std::variant< TwoPoints, std::string >	GetClosestPoints (const PointOnTrack &, const PointOnTrack &) const
std::variant< TwoPoints, std::string >	GetClosestPoints (const TwoTracks &twotracks) const
std::variant< TwoPoints, std::string >	GetClosestPoints (const TwoPointOnTrack &twopointontrack) const
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode	sysInitialize () override
	Perform system initialization for an algorithm.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const

Static Public Member Functions
static const InterfaceID &	interfaceID ()

Protected Member Functions
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
double	m_precision
double	m_maxloopnumber
SG::ReadCondHandleKey< AtlasFieldCacheCondObj >	m_fieldCacheCondObjInputKey {this, "AtlasFieldCacheCondObj", "fieldCondObj", "Name of the Magnetic Field conditions object key"}
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default)
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default)
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Detailed Description

AlgoTool which uses an iterative Newton method in two dimensions (the two points along the two tracks) in order to find their minimum distance.

For each track you can also provade a starting point, in order to avoid local maxima or an undefined quadratic form near a point...

Author

Giaci.nosp@m.nto..nosp@m.Piacq.nosp@m.uadi.nosp@m.o@phy.nosp@m.sik..nosp@m.uni-f.nosp@m.reib.nosp@m.urg.d.nosp@m.e

Definition at line 30 of file NewtonTrkDistanceFinder.h.

Member Typedef Documentation

StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< AlgTool > >::StoreGateSvc_t

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

NewtonTrkDistanceFinder()

Trk::NewtonTrkDistanceFinder::NewtonTrkDistanceFinder	(	const std::string &	t,
		const std::string &	n,
		const IInterface *	p )

Definition at line 31 of file NewtonTrkDistanceFinder.cxx.

                                                                                                               : 
    AthAlgTool(t,n,p),
    m_precision(1e-8),
    m_maxloopnumber(20)
  {   
    declareProperty("Precision",m_precision);
    declareProperty("MaxLoops",m_maxloopnumber);
    declareInterface<NewtonTrkDistanceFinder>(this);
  }

~NewtonTrkDistanceFinder()

Trk::NewtonTrkDistanceFinder::~NewtonTrkDistanceFinder ( )

virtualdefault

Member Function Documentation

declareGaudiProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< AlgTool > >::declareGaudiProperty ( Gaudi::Property< T, V, H > & hndl, const SG::VarHandleKeyType &  )

inlineprivateinherited

specialization for handling Gaudi::Property<SG::VarHandleKey>

Definition at line 156 of file AthCommonDataStore.h.

  {
    return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
                                                       hndl.value(), 
                                                       hndl.documentation());
 
  }

declareProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< AlgTool > >::declareProperty ( Gaudi::Property< T, V, H > & t )

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

                                                                     {
    typedef typename SG::HandleClassifier<T>::type htype;
    return AthCommonDataStore<PBASE>::declareGaudiProperty(t, htype());
  }

detStore()

const ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< AlgTool > >::detStore ( ) const

inlineinherited

The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

evtStore()

ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< AlgTool > >::evtStore ( )

inlineinherited

The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::extraDeps_update_handler ( Gaudi::Details::PropertyBase & ExtraDeps )

protectedinherited

Add StoreName to extra input/output deps as needed.

use the logic of the VarHandleKey to parse the DataObjID keys supplied via the ExtraInputs and ExtraOuputs Properties to add the StoreName if it's not explicitly given

finalize()

StatusCode Trk::NewtonTrkDistanceFinder::finalize ( )

overridevirtual

Definition at line 50 of file NewtonTrkDistanceFinder.cxx.

  {
    ATH_MSG_DEBUG( "Finalize successful" );
    return StatusCode::SUCCESS;
  }

GetClosestPoints() [1/4]

std::variant< TwoPoints, std::string > Trk::NewtonTrkDistanceFinder::GetClosestPoints ( const Perigee & a, const Perigee & b ) const

inline

Definition at line 55 of file NewtonTrkDistanceFinder.h.

                                                                 {
      //with the constractur of PointOnTrackPar a track is constructed with, as seed, 
    //directly the point of closest approach (see for info PointOnTrack.h)
      return GetClosestPoints(PointOnTrack(a),PointOnTrack(b));
    }

GetClosestPoints() [2/4]

std::variant< TwoPoints, std::string > Trk::NewtonTrkDistanceFinder::GetClosestPoints	(	const PointOnTrack &	firsttrack,
		const PointOnTrack &	secondtrack ) const

Definition at line 57 of file NewtonTrkDistanceFinder.cxx.

{
  //Now the direction of momentum at point of closest approach (but only direction, not versus)
  const double a_phi0    = firsttrack.getPerigee().parameters()[Trk::phi0];
  const double a_cosphi0 = -sin(a_phi0);//do i need it?
  const double a_sinphi0 =  cos(a_phi0);//~?
  
  //Now initialize the variable you need to go on
  const double a_x0=firsttrack.getPerigee().associatedSurface().center().x() +
    firsttrack.getPerigee().parameters()[Trk::d0]*a_cosphi0;
  const double a_y0=firsttrack.getPerigee().associatedSurface().center().y() +
    firsttrack.getPerigee().parameters()[Trk::d0]*a_sinphi0;
  const double a_z0=firsttrack.getPerigee().associatedSurface().center().z() +
    firsttrack.getPerigee().parameters()[Trk::z0];
 
#ifdef TrkDistance_DEBUG
  ATH_MSG_DEBUG( "a_x0 " << a_x0 << " a_y0 " << a_y0 << " a_z0 " << a_z0 );
  ATH_MSG_DEBUG( "m_a_phi0 " << a_phi0 );
#endif
 
  // Setup magnetic field retrieval
  SG::ReadCondHandle<AtlasFieldCacheCondObj> readHandle{m_fieldCacheCondObjInputKey, Gaudi::Hive::currentContext()};
  const AtlasFieldCacheCondObj* fieldCondObj{*readHandle};
 
  MagField::AtlasFieldCache fieldCache;
  fieldCondObj->getInitializedCache (fieldCache);
 
  double magnFieldVect[3];
  double posXYZ[3];
  posXYZ[0] = firsttrack.getPerigee().associatedSurface().center().x();
  posXYZ[1] = firsttrack.getPerigee().associatedSurface().center().y();
  posXYZ[2] = firsttrack.getPerigee().associatedSurface().center().z();
  fieldCache.getField(posXYZ,magnFieldVect);
 
  
  //Magnetic field at (x0,y0,z0)
  const double a_Bz=magnFieldVect[2]*299.792;//B field in Gev/mm
  //EvaluateMagneticField(a_x0,b_y0,b_z0);  
 
  const double a_Rt = getRadiusOfCurvature(firsttrack.getPerigee(),a_Bz);
  const double a_cotantheta = 1./tan(firsttrack.getPerigee().parameters()[Trk::theta]);
  
#ifdef TrkDistance_DEBUG
  ATH_MSG_DEBUG( "a_Rt" << a_Rt << " a_cotantheta " << a_cotantheta );
  ATH_MSG_DEBUG( "Magnetic field at perigee is " << a_Bz << "GeV/mm " );
#endif
 
  //Now the direction of momentum at point of closest approach (but only direction, not versus)
  const double b_phi0    =  secondtrack.getPerigee().parameters()[Trk::phi0];
  const double b_cosphi0 = -sin(b_phi0);//do i need it?
  const double b_sinphi0 =  cos(b_phi0);//~?
  
  //Now initialize the variable you need to go on
  const double b_x0=secondtrack.getPerigee().associatedSurface().center().x() +
    secondtrack.getPerigee().parameters()[Trk::d0]*b_cosphi0;
  const double b_y0=secondtrack.getPerigee().associatedSurface().center().y() +
    secondtrack.getPerigee().parameters()[Trk::d0]*b_sinphi0;
  const double b_z0=secondtrack.getPerigee().associatedSurface().center().z() +
    secondtrack.getPerigee().parameters()[Trk::z0];
  
#ifdef TrkDistance_DEBUG
  ATH_MSG_DEBUG( "b_x0 " << b_x0 << " b_y0 " << b_y0 << " b_z0 " << b_z0 );
  ATH_MSG_DEBUG( "b_phi0 " << b_phi0 );
#endif
 
 
  posXYZ[0] = secondtrack.getPerigee().associatedSurface().center().x();
  posXYZ[1] = secondtrack.getPerigee().associatedSurface().center().y();
  posXYZ[2] = secondtrack.getPerigee().associatedSurface().center().z();  
  fieldCache.getField(posXYZ,magnFieldVect);
  
  //Magnetic field at (x0,y0,z0)
  const double b_Bz = magnFieldVect[2]*299.792;//B field in Gev/mm - for the moment use a constant field offline
  //use the right value expressed in GeV
  //EvaluateMagneticField(b_x0,b_y0,b_z0);
 
  const double b_Rt = getRadiusOfCurvature(secondtrack.getPerigee(),b_Bz);
  const double b_cotantheta = 1./tan(secondtrack.getPerigee().parameters()[Trk::theta]);
  
#ifdef TrkDistance_DEBUG
  ATH_MSG_DEBUG( "b_Rt" << b_Rt << " b_cotantheta " << b_cotantheta );
  ATH_MSG_DEBUG( "Magnetic field at perigee is " << b_Bz << " GeV/mm " );
#endif
 
 
  //Now prepare some more elaborate pieces for later
  const double ab_Dx0 = a_x0-b_x0-a_Rt*a_cosphi0+b_Rt*b_cosphi0;
  const double ab_Dy0 = a_y0-b_y0-a_Rt*a_sinphi0+b_Rt*b_sinphi0;
  const double ab_Dz0 = a_z0-b_z0+a_Rt*a_cotantheta*a_phi0-b_Rt*b_cotantheta*b_phi0;
 
#ifdef TrkDistance_DEBUG
  ATH_MSG_DEBUG( "ab_Dx0 " << ab_Dx0 << " ab_Dy0 " << ab_Dy0 << " ab_Dz0 " << ab_Dz0 );
#endif
 
 
  //Prepare the initial point that can be different from point of closest approach
  //If you don't specify any point the default will be the point of closest approach!!
  //Another subroutine will be implemented if you want to use 
  //a certain seed
  double a_phi = firsttrack.getPhiPoint();//this has to be corrected as soon as you adjust the Trk2dDistanceSeeder...
  double b_phi = secondtrack.getPhiPoint();
 
  //store cos and sin of phi
  double a_cosphi = -sin(a_phi);
  double a_sinphi =  cos(a_phi);
  double b_cosphi = -sin(b_phi);
  double b_sinphi =  cos(b_phi);
  
 
#ifdef TrkDistance_DEBUG
  ATH_MSG_DEBUG( "Beginning phi is a_phi: " << a_phi << " b_phi " << b_phi );
  ATH_MSG_DEBUG( "LOOP number 0" );
#endif
 
 
  int loopsnumber = 0;
  
  bool isok=false;
 
  while (!isok) {
 
#ifdef TrkDistance_DEBUG
    ATH_MSG_DEBUG( "Entered LOOP number: " << loopsnumber );
    ATH_MSG_DEBUG( "actual value of a_phi: " << a_phi << " of b_phi " << b_phi );
#endif
    
    
    //count the loop number
    ++loopsnumber;
    
    
#ifdef TrkDistance_DEBUG
    ATH_MSG_DEBUG( "First point x: " << GetClosestPoints().first.x()  
                   << "y: " << GetClosestPoints().first.y()  
                   << "z: " << GetClosestPoints().first.z() );
    ATH_MSG_DEBUG( << "Second point x: " << GetClosestPoints().second.x()  
                   << "y: " << GetClosestPoints().second.y()  
                   << "z: " << GetClosestPoints().second.z() );
    
    ATH_MSG_DEBUG( "ActualDistance: " << GetDistance() );
    ATH_MSG_DEBUG( "real Dx0 " << ab_Dx0+a_Rt*a_cosphi-b_Rt*b_cosphi );
    ATH_MSG_DEBUG( "real Dy0 " << ab_Dy0+a_Rt*a_sinphi-b_Rt*b_sinphi );
#endif
    
    //I remove the factor two from the formula
    const double d1da_phi =
      (ab_Dx0-b_Rt*b_cosphi)*(-a_Rt*a_sinphi)+
      (ab_Dy0-b_Rt*b_sinphi)*a_cosphi*a_Rt+
      (ab_Dz0-a_Rt*a_cotantheta*a_phi+b_Rt*b_cotantheta*b_phi)*(-a_Rt*a_cotantheta);
    
    
    //same for second deriv respective to phi
    const double d1db_phi =
      (ab_Dx0+a_Rt*a_cosphi)*b_Rt*b_sinphi-//attention!MINUS here
      (ab_Dy0+a_Rt*a_sinphi)*b_cosphi*b_Rt+
      (ab_Dz0-a_Rt*a_cotantheta*a_phi+b_Rt*b_cotantheta*b_phi)*(+b_Rt*b_cotantheta);
    
    //second derivatives (d^2/d^2(a) d^2/d^2(b) d^2/d(a)d(b) )
 
    const double d2da_phi2 =
      (ab_Dx0-b_Rt*b_cosphi)*(-a_Rt*a_cosphi)+
      (ab_Dy0-b_Rt*b_sinphi)*(-a_Rt*a_sinphi)+
      +a_Rt*a_Rt*(a_cotantheta*a_cotantheta);
 
    const double d2db_phi2 =
      (ab_Dx0+a_Rt*a_cosphi)*(+b_Rt*b_cosphi)+
      (ab_Dy0+a_Rt*a_sinphi)*(+b_Rt*b_sinphi)+
      +b_Rt*b_Rt*(b_cotantheta*b_cotantheta);
 
 
    const double d2da_phib_phi = -a_Rt*b_Rt*(a_sinphi*b_sinphi+a_cosphi*b_cosphi+a_cotantheta*b_cotantheta);
 
    //Calculate the determinant of the Jacobian
 
    const double det = d2da_phi2*d2db_phi2-d2da_phib_phi*d2da_phib_phi;
 
 
#ifdef TrkDistance_DEBUG
    ATH_MSG_DEBUG( "d1da_phi " << d1da_phi << " d1db_phi " << d1db_phi << " d2da_phi2 " << d2da_phi2 << " d2db_phi2 " << d2db_phi2 
                   << " d2da_phib_phi " << d2da_phib_phi << " det " << det );
#endif
    
    //if the quadratic form is defined negative or is semidefined, throw the event
    //(you are in a maximum or in a saddle point)
    if (det<0) {
      ATH_MSG_DEBUG( "Hessian is negative: saddle point" );
      return "Hessian is negative";
    }
    if (det>0&&d2da_phi2<0) {
      ATH_MSG_DEBUG( "Hessian indicates a maximum: derivative will be zero but result incorrect" );
      return "Maximum point found";
    }
 
    //Now apply the Newton formula in more than one dimension
    const double deltaa_phi = -(d2db_phi2*d1da_phi-d2da_phib_phi*d1db_phi)/det;
    const double deltab_phi = -(-d2da_phib_phi*d1da_phi+d2da_phi2*d1db_phi)/det;
 
#ifdef TrkDistance_DEBUG
    ATH_MSG_DEBUG( "deltaa_phi: " << deltaa_phi );
    ATH_MSG_DEBUG( "deltab_phi: " << deltab_phi );
#endif
 
 
    a_phi += deltaa_phi;
    b_phi += deltab_phi;
 
    //store cos and sin of phi
    a_cosphi = -sin(a_phi);
    a_sinphi =  cos(a_phi);
    b_cosphi = -sin(b_phi);
    b_sinphi =  cos(b_phi);
    
    if (std::sqrt(std::pow(deltaa_phi,2)+std::pow(deltab_phi,2))<m_precision || 
    loopsnumber>m_maxloopnumber) isok=true;
    
  }
    
  if (loopsnumber>m_maxloopnumber) {
    return "Could not find minimum distance: max loops number reached"; //now return error, see how to do it...
  }
  
 
  return TwoPoints(Amg::Vector3D(a_x0+a_Rt*(a_cosphi-a_cosphi0),
                 a_y0+a_Rt*(a_sinphi-a_sinphi0),
                 a_z0-a_Rt*(a_phi-a_phi0)*a_cotantheta),
           Amg::Vector3D(b_x0+b_Rt*(b_cosphi-b_cosphi0),
                 b_y0+b_Rt*(b_sinphi-b_sinphi0),
                 b_z0-b_Rt*(b_phi-b_phi0)*b_cotantheta));
}

GetClosestPoints() [3/4]

std::variant< TwoPoints, std::string > Trk::NewtonTrkDistanceFinder::GetClosestPoints ( const TwoPointOnTrack & twopointontrack ) const

inline

Definition at line 70 of file NewtonTrkDistanceFinder.h.

                                                                    {
      return GetClosestPoints(twopointontrack.first,twopointontrack.second);
    }

GetClosestPoints() [4/4]

std::variant< TwoPoints, std::string > Trk::NewtonTrkDistanceFinder::GetClosestPoints ( const TwoTracks & twotracks ) const

inline

Definition at line 65 of file NewtonTrkDistanceFinder.h.

                                                        {
      return GetClosestPoints(twotracks.getFirstPerigee(),twotracks.getSecondPerigee());
    }

initialize()

StatusCode Trk::NewtonTrkDistanceFinder::initialize ( )

overridevirtual

Definition at line 43 of file NewtonTrkDistanceFinder.cxx.

  { 
    ATH_CHECK( AlgTool::initialize() );
    ATH_CHECK( m_fieldCacheCondObjInputKey.initialize() );
    ATH_MSG_DEBUG( "Initialize successful" );
    return StatusCode::SUCCESS;
  }

inputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< AlgTool > >::inputHandles ( ) const

overridevirtualinherited

Return this algorithm's input handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

interfaceID()

const InterfaceID & Trk::NewtonTrkDistanceFinder::interfaceID ( )

inlinestatic

Definition at line 34 of file NewtonTrkDistanceFinder.h.

      {
        return IID_NewtonTrkDistanceFinder;
      };

msg()

MsgStream & AthCommonMsg< AlgTool >::msg ( ) const

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

bool AthCommonMsg< AlgTool >::msgLvl ( const MSG::Level lvl ) const

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

outputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< AlgTool > >::outputHandles ( ) const

overridevirtualinherited

Return this algorithm's output handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

renounce()

std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void > AthCommonDataStore< AthCommonMsg< AlgTool > >::renounce ( T & h )

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

  {
    h.renounce();
    PBASE::renounce (h);
  }

renounceArray()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::renounceArray ( SG::VarHandleKeyArray & handlesArray )

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

sysInitialize()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::sysInitialize ( )

overridevirtualinherited

Perform system initialization for an algorithm.

We override this to declare all the elements of handle key arrays at the end of initialization. See comments on updateVHKA.

Reimplemented in asg::AsgMetadataTool, AthCheckedComponent< AthAlgTool >, AthCheckedComponent<::AthAlgTool >, and DerivationFramework::CfAthAlgTool.

sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::sysStart ( )

overridevirtualinherited

Handle START transition.

We override this in order to make sure that conditions handle keys can cache a pointer to the conditions container.

updateVHKA()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::updateVHKA ( Gaudi::Details::PropertyBase & )

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

                                               {
    // debug() << "updateVHKA for property " << p.name() << " " << p.toString() 
    //         << "  size: " << m_vhka.size() << endmsg;
    for (auto &a : m_vhka) {
      std::vector<SG::VarHandleKey*> keys = a->keys();
      for (auto k : keys) {
        k->setOwner(this);
      }
    }
  }

Member Data Documentation

m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

m_fieldCacheCondObjInputKey

SG::ReadCondHandleKey<AtlasFieldCacheCondObj> Trk::NewtonTrkDistanceFinder::m_fieldCacheCondObjInputKey {this, "AtlasFieldCacheCondObj", "fieldCondObj", "Name of the Magnetic Field conditions object key"}

private

Definition at line 80 of file NewtonTrkDistanceFinder.h.

{this, "AtlasFieldCacheCondObj", "fieldCondObj", "Name of the Magnetic Field conditions object key"};

m_maxloopnumber

double Trk::NewtonTrkDistanceFinder::m_maxloopnumber

private

Definition at line 77 of file NewtonTrkDistanceFinder.h.

m_precision

double Trk::NewtonTrkDistanceFinder::m_precision

private

Definition at line 76 of file NewtonTrkDistanceFinder.h.

m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< AlgTool > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< AlgTool > >::m_vhka

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

---

The documentation for this class was generated from the following files:

• NewtonTrkDistanceFinder.h
• NewtonTrkDistanceFinder.cxx