Trk::Trk2dDistanceSeeder Class Reference

AlgoTool calculates the points of minimum distance between two tracks on the transverse plane, which is analytically well defined (intersection of two circles). More...

#include <Trk2dDistanceSeeder.h>

Inheritance diagram for Trk::Trk2dDistanceSeeder:

Collaboration diagram for Trk::Trk2dDistanceSeeder:

Public Member Functions
	Trk2dDistanceSeeder (const std::string &t, const std::string &n, const IInterface *p)
virtual	~Trk2dDistanceSeeder ()
virtual StatusCode	initialize () override
virtual StatusCode	finalize () override
TwoPointOnTrack	GetSeed (const TwoTracks &mytracks, TwoPoints *twopoints=nullptr) 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
double	getBField (const Perigee &p, MagField::AtlasFieldCache &cache) const
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
bool	m_solveAmbiguityUsingZ
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 calculates the points of minimum distance between two tracks on the transverse plane, which is analytically well defined (intersection of two circles).

In case of double intersection different possibilities were considered; at the end I found reasonably good to choose the intersection point where the tracks are nearest in the z coordinate...

changes: 11-11-2007 Intersection case completely rewritten after having done analytical calculation (sign come out of calculation!)

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 35 of file Trk2dDistanceSeeder.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

Trk2dDistanceSeeder()

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

Definition at line 143 of file Trk2dDistanceSeeder.cxx.

                                                                                                       : 
    AthAlgTool(t,n,p),
    m_solveAmbiguityUsingZ(true)
  {   
    declareProperty("SolveAmbiguityUsingZ",m_solveAmbiguityUsingZ);
    declareInterface<Trk2dDistanceSeeder>(this);
  }

~Trk2dDistanceSeeder()

Trk::Trk2dDistanceSeeder::~Trk2dDistanceSeeder ( )

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::Trk2dDistanceSeeder::finalize ( )

overridevirtual

Definition at line 161 of file Trk2dDistanceSeeder.cxx.

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

getBField()

double Trk::Trk2dDistanceSeeder::getBField ( const Perigee & p, MagField::AtlasFieldCache & cache ) const

private

Definition at line 426 of file Trk2dDistanceSeeder.cxx.

  {
    double magnFieldVect[3];
    double posXYZ[3];
    posXYZ[0] = p.associatedSurface().center().x();
    posXYZ[1] = p.associatedSurface().center().y();
    posXYZ[2] = p.associatedSurface().center().z();
 
    cache.getField(posXYZ,magnFieldVect);
    const double bfield = magnFieldVect[2]*299.792;//should be in GeV/mm
    if (bfield==0. || std::isnan(bfield)) {
      ATH_MSG_DEBUG( "Could not find a magnetic field different from zero: very very strange" );
      return 0.60407; //Value in GeV/mm (ATLAS units)
    } 
      ATH_MSG_DEBUG( "Magnetic field projection of z axis in the perigee position is: " << bfield << " GeV/mm " );
    
    return bfield;
  }

GetSeed()

TwoPointOnTrack Trk::Trk2dDistanceSeeder::GetSeed	(	const TwoTracks &	mytracks,
		TwoPoints *	twopoints = nullptr ) const

Definition at line 169 of file Trk2dDistanceSeeder.cxx.

  {
    SG::ReadCondHandle<AtlasFieldCacheCondObj> readHandle{m_fieldCacheCondObjInputKey, Gaudi::Hive::currentContext()};
    const AtlasFieldCacheCondObj* fieldCondObj{*readHandle};
    if (!fieldCondObj)[[unlikely]]{
      ATH_MSG_ERROR("GetSeed: fieldCondObj is nullptr.");
      return {};
    }
    MagField::AtlasFieldCache fieldCache;
    fieldCondObj->getInitializedCache (fieldCache);
 
    const double bfield1 = getBField (mytracks.getFirstPerigee(), fieldCache);
    const double bfield2 = getBField (mytracks.getSecondPerigee(), fieldCache);
 
    //phitanpoca here means not the tan to poca (which is phi0) but the direction from perigee to the center of curvature (I don't know 
    //why I chose this strange name, sorry!)
    const double phitanpoca1=getphipoca(mytracks.getFirstPerigee());
    const double phitanpoca2=getphipoca(mytracks.getSecondPerigee());
    
    //Temporary abs1 and abs2 are the signed radius quantities (later we will reduce it to unsigned quantities)
    double abs1 = getRadiusOfCurvature(mytracks.getFirstPerigee(), bfield1);
    double abs2 = getRadiusOfCurvature(mytracks.getSecondPerigee(),bfield2);
    
    const double sgnr1 = abs1>0 ? 1. : -1.;
    const double sgnr2 = abs2>0 ? 1. : -1.;
 
    //component x of center of curv of first particle
    const std::pair<Amg::Vector3D,Amg::Vector3D> centersofcurv
      (getCenterOfCurvature(mytracks.getFirstPerigee(),abs1,phitanpoca1),
       getCenterOfCurvature(mytracks.getSecondPerigee(),abs2,phitanpoca2));
 
#ifdef TRK2DDISTANCESEEDER_DEBUG
    ATH_MSG_DEBUG( " Center of track number 1: " << centersofcurv.first << " center of track 2 " << centersofcurv.second );
#endif
 
    const double distance2d = dist2d(centersofcurv.first,centersofcurv.second);
 
    abs1 = std::abs(abs1);
    abs2 = std::abs(abs2);
 
  
#ifdef TRK2DDISTANCESEEDER_DEBUG
    ATH_MSG_DEBUG( "abs1: " << abs1 << " abs2: " << abs2 );
    ATH_MSG_DEBUG( "phitanpoca1: " << phitanpoca1 << " phitanpoca2: " << phitanpoca2 );
    ATH_MSG_DEBUG( "distance2d " << distance2d );
#endif
 
    double phi1 = 0;
    double phi2 = 0;
 
    // Strictly redundant with phi1 and phi2 above, but needed to get results
    // that are rounded identically with the pre-MT version.
    double phi1poca = 0;
    double phi2poca = 0;
 
    //first case (the two circles are the one distinct from the other)
    if (distance2d > (abs1+abs2)) {
 
#ifdef TRK2DDISTANCESEEDER_DEBUG
      ATH_MSG_DEBUG ("Distinct circles " );
#endif
 
      phi1 = safeAtan2(centersofcurv.second.y()-centersofcurv.first.y(),
                      centersofcurv.second.x()-centersofcurv.first.x());
    
      if (sgnr2<0) {
        phi2=phi1;
      } else {
        phi2=oppositeangle(phi1);
      }      
    
      if (sgnr1<0) {
        phi1=oppositeangle(phi1);
      }
 
      //Now you are worried that the solution has to be the one nearest to the original phi...
      phi1=takenearest(phi1,phitanpoca1);
      phi2=takenearest(phi2,phitanpoca2);
    }
    else {
      //second case(if distance2d<abs1+abs2 we have still two cases
      //1) one circle inside the other (nobody is touched) (if |abs2-abs1|>d)
      //2) two intersections (if |abs2-abs1|<d)
      //   -->(case with one intersection seems me of no physical interest)
      if (fabs(abs2-abs1)>=distance2d) {
 
#ifdef TRK2DDISTANCESEEDER_DEBUG
        ATH_MSG_DEBUG( "  one circle inside the other " );
#endif
 
        //1)
        if (abs2<abs1) {
 
#ifdef TRK2DDISTANCESEEDER_DEBUG
          ATH_MSG_DEBUG("  second radius smaller than first " );
#endif 
          phi1 = safeAtan2(centersofcurv.second.y()-centersofcurv.first.y(),
                          centersofcurv.second.x()-centersofcurv.first.x());    
          phi2=phi1;
        }
        else {
    
#ifdef TRK2DDISTANCESEEDER_DEBUG
          ATH_MSG_DEBUG( "  first radius smaller than second " );
#endif 
    
    
          phi1 = safeAtan2(-(centersofcurv.second.y()-centersofcurv.first.y()),
                          -(centersofcurv.second.x()-centersofcurv.first.x()));
          phi2=phi1;
        }
      
        //adjust the sign, taking into account possible q(1,2)<0
        if (sgnr2<0) {
          phi2=oppositeangle(phi2);
        }      
      
        if (sgnr1<0) {
          phi1=oppositeangle(phi1);
        }
 
        phi1=takenearest(setphipoca(phi1),setphipoca(phitanpoca1));
        phi2=takenearest(setphipoca(phi2),setphipoca(phitanpoca2));      
        phi1poca = setphipoca(phi1);
        phi2poca = setphipoca(phi2);
      }
      else {
 
        //Do it easier...
        const double projection2=(square(abs1)-square(abs2)-square(distance2d))/2./distance2d;
        const double cosinus2=projection2/sgnr2/abs2;
 
 
#ifdef TRK2DDISTANCESEEDER_DEBUG
        const double projection1=(square(abs2)-square(abs1)-square(distance2d))/2./distance2d;
        const double cosinus1=projection1/sgnr1/abs1;
        ATH_MSG_DEBUG( "projection1: " << projection1 << " cosinus1 " << cosinus1
                       << "projection2: " << projection2 << " cosinus2 " << cosinus2 );
#endif
 
        const double phibase2 =
          safeAtan2(centersofcurv.second.y() - centersofcurv.first.y(),
                    centersofcurv.second.x() - centersofcurv.first.x());
 
        const double addtophi2=
          safeAcos(cosinus2);
 
#ifdef TRK2DDISTANCESEEDER_DEBUG
        ATH_MSG_DEBUG( " phibase2 is : " << phibase2 << " add to phi " << addtophi2 );
#endif
 
        const std::pair<double,double> possiblephiontrack2(phibase2+addtophi2,phibase2-addtophi2);
 
#ifdef TRK2DDISTANCESEEDER_DEBUG
        ATH_MSG_DEBUG( "the two phis are: " << possiblephiontrack2.first << " and " <<  possiblephiontrack2.second );
#endif
 
        const std::pair<double,double> 
          possiblecosphitrack1((centersofcurv.second.x()-centersofcurv.first.x()
                                +sgnr2*abs2*std::cos(possiblephiontrack2.first))/sgnr1/abs1,
                               (centersofcurv.second.x()-centersofcurv.first.x()
                                +sgnr2*abs2*std::cos(possiblephiontrack2.second))/sgnr1/abs1);
 
        const std::pair<double,double>
          possiblesigntrack1(sgnr1*(centersofcurv.second.y()-centersofcurv.first.y()
                                    +sgnr2*abs2*std::sin(possiblephiontrack2.first))>0?1.:-1.,
                             sgnr1*(centersofcurv.second.y()-centersofcurv.first.y()
                                    +sgnr2*abs2*std::sin(possiblephiontrack2.second))>0?1.:-1.);
 
        const std::pair<double,double>
          possiblephiontrack1(possiblesigntrack1.first*safeAcos(possiblecosphitrack1.first),
                              possiblesigntrack1.second*safeAcos(possiblecosphitrack1.second));
                           
                             
        const std::pair<PointOnTrack,PointOnTrack>
          possiblepointsontrack1(PointOnTrack(mytracks.getFirstPerigee(),
                                              takenearest(setphipoca(possiblephiontrack1.first),
                                                          setphipoca(phitanpoca1))),
                                 PointOnTrack(mytracks.getFirstPerigee(),
                                              takenearest(setphipoca(possiblephiontrack1.second),
                                                          setphipoca(phitanpoca1))));
 
        const std::pair<PointOnTrack,PointOnTrack>
          possiblepointsontrack2(PointOnTrack(mytracks.getSecondPerigee(),
                                              takenearest(setphipoca(possiblephiontrack2.first),
                                                          setphipoca(phitanpoca2))),
                                 PointOnTrack(mytracks.getSecondPerigee(),
                                              takenearest(setphipoca(possiblephiontrack2.second),
                                                          setphipoca(phitanpoca2))));
 
 
        const std::pair<Amg::Vector3D,Amg::Vector3D>
          possiblepoints1(getSeedPoint(possiblepointsontrack1.first.getPerigee(),centersofcurv.first,
                                       abs1*sgnr1,possiblepointsontrack1.first.getPhiPoint()),
                          getSeedPoint(possiblepointsontrack1.second.getPerigee(),centersofcurv.first,
                                       abs1*sgnr1,possiblepointsontrack1.second.getPhiPoint()));
 
        const std::pair<Amg::Vector3D,Amg::Vector3D>
          possiblepoints2(getSeedPoint(possiblepointsontrack2.first.getPerigee(),centersofcurv.second,
                                       abs2*sgnr2,possiblepointsontrack2.first.getPhiPoint()),
                          getSeedPoint(possiblepointsontrack2.second.getPerigee(),centersofcurv.second,
                                       abs2*sgnr2,possiblepointsontrack2.second.getPhiPoint()));
 
 
#ifdef TRK2DDISTANCESEEDER_DEBUG
        ATH_MSG_DEBUG( "Point 1a: x " << possiblepoints1.first.x() << " y " << possiblepoints1.first.y() );
        ATH_MSG_DEBUG( "Point 2a: x " << possiblepoints2.first.x() << " y " << possiblepoints2.first.y() );
        ATH_MSG_DEBUG( "Point 1b: x " << possiblepoints1.second.x() << " y " << possiblepoints1.second.y() );
        ATH_MSG_DEBUG( "Point 2b: x " << possiblepoints2.second.x() << " y " << possiblepoints2.second.y() );
        ATH_MSG_DEBUG( "Distance between 1a and 2a:" << fabs(possiblepoints1.first.z()-possiblepoints2.first.z())  << 
                       "Distance between 1a and 2a:" << fabs(possiblepoints1.second.z()-possiblepoints2.second.z())  );
#endif
 
      
        //now discover what couple of points are the nearest ones
        if (m_solveAmbiguityUsingZ)
        {
          if (fabs(possiblepoints1.first.z()-possiblepoints2.first.z())<
              fabs(possiblepoints1.second.z()-possiblepoints2.second.z()))
          {
            phi1poca = possiblepointsontrack1.first.getPhiPoint();
            phi2poca = possiblepointsontrack2.first.getPhiPoint();
          } else {
            phi1poca = possiblepointsontrack1.second.getPhiPoint();
            phi2poca = possiblepointsontrack2.second.getPhiPoint();
          }
        }
        else
        {
          if (sqrt(possiblepoints1.first.x()*possiblepoints1.first.x()+possiblepoints1.first.y()*possiblepoints1.first.y())<
              sqrt(possiblepoints2.first.x()*possiblepoints2.first.x()+possiblepoints2.first.y()*possiblepoints2.first.y()))
          {
            phi1poca = possiblepointsontrack1.first.getPhiPoint();
            phi2poca = possiblepointsontrack2.first.getPhiPoint();
          } else {
            phi1poca = possiblepointsontrack1.second.getPhiPoint();
            phi2poca = possiblepointsontrack2.second.getPhiPoint();
          }
        }
        phi1=goFromPhipocaToPhi(phi1poca);
        phi2=goFromPhipocaToPhi(phi2poca);
      }
    }
 
    if (twopoints) {
      *twopoints = TwoPoints (getSeedPoint(centersofcurv.first,
                                           abs1*sgnr1,setphipoca(phi1)),
                              getSeedPoint(centersofcurv.second,
                                           abs2*sgnr2,setphipoca(phi2)));
    }
 
    return std::make_pair (PointOnTrack (mytracks.getFirstPerigee(), phi1poca),
                           PointOnTrack (mytracks.getSecondPerigee(),phi2poca));
  }

initialize()

StatusCode Trk::Trk2dDistanceSeeder::initialize ( )

overridevirtual

Definition at line 153 of file Trk2dDistanceSeeder.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::Trk2dDistanceSeeder::interfaceID ( )

inlinestatic

Definition at line 39 of file Trk2dDistanceSeeder.h.

    {
        return IID_Trk2dDistanceSeeder;
    };

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 >, and AthCheckedComponent<::AthAlgTool >.

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::Trk2dDistanceSeeder::m_fieldCacheCondObjInputKey {this, "AtlasFieldCacheCondObj", "fieldCondObj", "Name of the Magnetic Field conditions object key"}

private

Definition at line 65 of file Trk2dDistanceSeeder.h.

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

m_solveAmbiguityUsingZ

bool Trk::Trk2dDistanceSeeder::m_solveAmbiguityUsingZ

private

Definition at line 63 of file Trk2dDistanceSeeder.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:

• Trk2dDistanceSeeder.h
• Trk2dDistanceSeeder.cxx