InDet::VertexPointEstimator Class Reference

Some helper tools like: hits counter. More...

#include <VertexPointEstimator.h>

Inheritance diagram for InDet::VertexPointEstimator:

Collaboration diagram for InDet::VertexPointEstimator:

Public Types
typedef std::map< std::string, float >	Values_t

Public Member Functions
	VertexPointEstimator (const std::string &type, const std::string &name, const IInterface *parent)
virtual	~VertexPointEstimator ()=default
virtual StatusCode	initialize () override
virtual StatusCode	finalize () override
Amg::Vector3D	getCirclesIntersectionPoint (const Trk::Perigee *per1, const Trk::Perigee *per2, unsigned int flag, int &errorcode) const
	Get intersection point of two track helices.
Amg::Vector3D	getCirclesIntersectionPoint (const Trk::Perigee *per1, const Trk::Perigee *per2, unsigned int flag, int &errorcode, Values_t &decors) const
	Get intersection point of two track helices.
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 ()
static std::vector< std::string >	decorKeys ()
	Return list of keys used for decorations.

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
Amg::Vector3D	intersectionImpl (const Trk::Perigee *per1, const Trk::Perigee *per2, unsigned int flag, int &errorcode, float &deltaPhi, float &deltaR) const
	internal implementation
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Static Private Member Functions
static double	areaVar (double, double, double, double, double, double, double &)
static double	areaVar (double, double, double, double, double, double, double &, double &, double &)
static bool	circleIntersection (double, double, double, double, double, double, double &, double &, double &, double &)
static bool	secondDegree (double, double, double, double &, double &)
static double	areaTriangle (double, double, double, double, double, double)

Private Attributes
DoubleArrayProperty	m_maxDR
DoubleArrayProperty	m_maxDZ
DoubleArrayProperty	m_maxR
DoubleArrayProperty	m_minArcLength
DoubleArrayProperty	m_maxArcLength
DoubleArrayProperty	m_minDr
DoubleArrayProperty	m_maxDr
DoubleArrayProperty	m_maxHl {this, "MaxHl", {10000., 10000., 10000.}, "maximum ratio H/l"}
DoubleArrayProperty	m_maxPhi
BooleanProperty	m_returnOnError {this, "ReturnOnError", true}
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

Static Private Attributes
static const double	s_bmagnt = 2.083

Detailed Description

Some helper tools like: hits counter.

Author

Tatjana Lenz , Thomas Koffas

Definition at line 20 of file VertexPointEstimator.h.

Member Typedef Documentation

StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Values_t

typedef std::map<std::string, float> InDet::VertexPointEstimator::Values_t

Definition at line 33 of file VertexPointEstimator.h.

Constructor & Destructor Documentation

VertexPointEstimator()

InDet::VertexPointEstimator::VertexPointEstimator	(	const std::string &	type,
		const std::string &	name,
		const IInterface *	parent )

Definition at line 25 of file VertexPointEstimator.cxx.

                                                                                                                   :
    AthAlgTool(type, name, parent)
  {
    declareInterface<VertexPointEstimator>(this);
  }

~VertexPointEstimator()

virtual InDet::VertexPointEstimator::~VertexPointEstimator ( )

virtualdefault

Member Function Documentation

areaTriangle()

double InDet::VertexPointEstimator::areaTriangle ( double a, double b, double d, double e, double g, double h )

staticprivate

Definition at line 500 of file VertexPointEstimator.cxx.

                                            { // double i)
    double c = 1;
    double f = 1;
    double i = 1;
    return fabs(0.5* ( (a*e*i + d*h*c + b*f*g)  - (g*e*c + d*b*i + a*f*h) ) );  
  }

areaVar() [1/2]

double InDet::VertexPointEstimator::areaVar ( double xc1, double yc1, double r1, double xc2, double yc2, double r2, double & phi )

staticprivate

Definition at line 355 of file VertexPointEstimator.cxx.

  {
    double ret = -999999;
    double xi1;
    double yi1;
    double xi2;
    double yi2;
    if (circleIntersection( xc1,  yc1,  r1,  xc2,  yc2,  r2, xi1, yi1, xi2, yi2 ))
    {
      double  h = 0.5*(sqrt( pow(xi1-xi2,2) + pow(yi1-yi2,2) ));
      double  l = sqrt( pow(xc1-xc2,2) + pow(yc1-yc2,2) );
      if (l!=0) ret = h/l;
 
      double norm1 = sqrt((xi1-xc1)*(xi1-xc1)+(yi1-yc1)*(yi1-yc1));
      double norm2 = sqrt((xi1-xc2)*(xi1-xc2)+(yi1-yc2)*(yi1-yc2));
      if((norm1!=0.) && (norm2!=0.)){ //rejecting pathology
        //centers at the origin
        norm1 = 1./norm1;
        norm2 = 1./norm2;
        double xa = (xi1-xc1)*norm1;
        double ya = (yi1-yc1)*norm1;
        double xb = (xi1-xc2)*norm2;
        double yb = (yi1-yc2)*norm2;
        double costheta = xa*xb + ya*yb;
        phi = M_PI-std::acos(costheta);
      }
    }
    return ret;
  }

areaVar() [2/2]

double InDet::VertexPointEstimator::areaVar ( double xc1, double yc1, double r1, double xc2, double yc2, double r2, double & h, double & hl, double & ddphi )

staticprivate

Definition at line 395 of file VertexPointEstimator.cxx.

  {
    double ret = -999999;
    double xi1;
    double yi1;
    double xi2;
    double yi2;
    h     = 0;
    hl    = 0;
    ddphi = 0.;
    if (circleIntersection( xc1,  yc1,  r1,  xc2,  yc2,  r2, xi1, yi1, xi2, yi2 )) {
 
      // the two triangles have identical area
      ret =  areaTriangle(xc1,yc1, xc2,yc2,  xi1,yi1) ;
      
      h = 0.5*(sqrt( pow(xi1-xi2,2) + pow(yi1-yi2,2) ));
      
      double  l = sqrt( pow(xc1-xc2,2) + pow(yc1-yc2,2) );
      if (l!=0) hl = h/l;
      
      // |AxB| = |A||B|sin(phi) => sinphi = |AxB| / |A||B|
      // (xi1,yi1) = first  intersection point; this is the one I use
      // (xi2,yi2) = second intersection point; this is symmetric to the first
      // (xc1,yc1) = centre first  circle 
      // (xc2,yc2) = centre second circle 
      double norm1 = sqrt(pow(xi1-xc1,2)+pow(yi1-yc1,2));
      double norm2 = sqrt(pow(xi1-xc2,2)+pow(yi1-yc2,2));
      if ((norm1 != 0) && (norm2 != 0)){ // rejecting pathology
        // centres at the origin
        double xa = (xi1 - xc1)/norm1;
        double ya = (yi1 - yc1)/norm1;
        double xb = (xi1 - xc2)/norm2;
        double yb = (yi1 - yc2)/norm2;
        double costheta = xa*xb +ya*yb;
        double phi = M_PI-internal_acos(costheta);
        ddphi = phi;
      }
    }
    
    return ret;
  }

circleIntersection()

bool InDet::VertexPointEstimator::circleIntersection ( double xc1, double yc1, double r1, double xc2, double yc2, double r2, double & xi1, double & yi1, double & xi2, double & yi2 )

staticprivate

Definition at line 438 of file VertexPointEstimator.cxx.

  {
    // Calculate the intersection of the two circles:
    //
    // (x-xc1)^2 + (y-yc1)^2 = R1^2
    // (x-xc2)^2 + (y-yc2)^2 = R2^2
    
    xi1 = -999999999.;
    xi2 = -999999999.;
    yi1 = -999999999.;
    yi2 = -999999999.;
    
    if ( yc1 != yc2) {
      double A = (xc1 - xc2) / (yc2- yc1);
      double B = (r1*r1 - r2*r2 - xc1*xc1 + xc2*xc2 - yc1*yc1 + yc2*yc2) / 2. / ( yc2 -yc1);
      double a  = 1 + A*A;
      double b  = 2*A*B - 2*xc1 -2*A*yc1;
      double c  = B*B - 2*B*yc1 + xc1*xc1 + yc1*yc1 - r1*r1;
      if (secondDegree(a,b,c,xi1,xi2) ){
        yi1 = A*xi1 + B;
        yi2 = A*xi2 + B;
        return true;
      }    
      return false;
    }
    if (xc1 != xc2){
      double A = (yc1 - yc2) / (xc2- xc1);
      double B = (r1*r1 - r2*r2 - xc1*xc1 + xc2*xc2 - yc1*yc1 + yc2*yc2) / 2. / ( xc2 -xc1);
      double a  = 1 + A*A;
      double b  = 2*A*B - 2*yc1 -2*A*xc1;
      double c  = B*B - 2*B*xc1 + xc1*xc1 + yc1*yc1 - r1*r1;
      if (secondDegree(a,b,c,yi1,yi2) ){
        xi1 = A*yi1 + B;
        xi2 = A*yi2 + B;
        return true;
      }    
      return false;
    }
    
      // circles are concentric and we don't care
      return false;
    
    return false;
  }

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());
  }

decorKeys()

std::vector< std::string > InDet::VertexPointEstimator::decorKeys ( )

static

Return list of keys used for decorations.

Definition at line 74 of file VertexPointEstimator.cxx.

  {
    return {"deltaPhiTracks", "DR1R2"};
  }

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

overridevirtual

Definition at line 42 of file VertexPointEstimator.cxx.

                                            {
    return StatusCode::SUCCESS;
  }

getCirclesIntersectionPoint() [1/2]

Amg::Vector3D InDet::VertexPointEstimator::getCirclesIntersectionPoint	(	const Trk::Perigee *	per1,
		const Trk::Perigee *	per2,
		unsigned int	flag,
		int &	errorcode ) const

Get intersection point of two track helices.

circles intersection point calculation

Based on pure geometric arguments. Return error flag if problems.

Definition at line 49 of file VertexPointEstimator.cxx.

  {
    float deltaPhi;
    float deltaR;
    return intersectionImpl (per1, per2, flag, errorcode, deltaPhi, deltaR);
  }

getCirclesIntersectionPoint() [2/2]

Amg::Vector3D InDet::VertexPointEstimator::getCirclesIntersectionPoint	(	const Trk::Perigee *	per1,
		const Trk::Perigee *	per2,
		unsigned int	flag,
		int &	errorcode,
		Values_t &	decors ) const

Get intersection point of two track helices.

Based on pure geometric arguments. Return error flag if problems. Also return dictionary of values for decorations.

Definition at line 61 of file VertexPointEstimator.cxx.

  {
    decors.clear();
    return intersectionImpl (per1, per2, flag, errorcode,
                             decors["deltaPhiTracks"],
                             decors["DR1R2"]);
  }

initialize()

StatusCode InDet::VertexPointEstimator::initialize ( )

overridevirtual

Definition at line 37 of file VertexPointEstimator.cxx.

                                              {
    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 & InDet::VertexPointEstimator::interfaceID ( )

static

Definition at line 32 of file VertexPointEstimator.cxx.

                                                       {
    return IID_IVertexPointEstimator;
  }

intersectionImpl()

Amg::Vector3D InDet::VertexPointEstimator::intersectionImpl ( const Trk::Perigee * per1, const Trk::Perigee * per2, unsigned int flag, int & errorcode, float & deltaPhi, float & deltaR ) const

private

internal implementation

Definition at line 83 of file VertexPointEstimator.cxx.

  {
    /*
      Calculates the initial approximation to the vertex position. Based on CTVMFT.
      Tries to intersect circles that are (R,Phi) projections of the helical trajectories of the two tracks
      If the circles intersect, the intersection with smaller z difference between the 2 helices extrapolated to the intersection is chosen.
      If the circles do not intersect, the vertex approximation is taken as the point of closest approach of the two circles.
      per1 should be that of the track with the smaller radius
    */
    Amg::Vector3D intPoint(0.,0.,0.);
    double aconst = -1.49898*s_bmagnt; //is it correct???????????????????
    double DRMAX = 0.;         // maximum XY separation, non-intersecting circles
    double DZMAX = 0.;         // maximum allowed track Z separation at the vertex
    double RVMAX = 0.;         // maximum allowed vertex radius
    double minArcLength(0.);
    double maxArcLength(0.);
    double minDr(0.);
    double maxDr(0.);
    double maxHl(0.);
    double maxPhi(0.);
    if (flag <= 2) {
      DRMAX = m_maxDR[flag]; //maximum XY separation, non-intersecting circles
      DZMAX = m_maxDZ[flag]; //maximum allowed track Z separation at the vertex
      RVMAX = m_maxR[flag] ; //maximum allowed vertex radius
      minArcLength = m_minArcLength[flag];
      maxArcLength = m_maxArcLength[flag];
      minDr = m_minDr[flag];
      maxDr = m_maxDr[flag];
      maxHl = m_maxHl[flag];
      maxPhi= m_maxPhi[flag];
    }
    
    double d0[2];
    double z0[2];
    double phi[2];
    double cotTheta[2];
    double qOverPt[2];
    double RC[2];
    double XC[2];
    double YC[2];
    double RA[2];
    double AB[2];
    double XSVI[2];
    double YSVI[2];
    double ZSVI[2];
    double RVI[2];
    double DZSVI[2];
    double SS1[2];
    double SS2[2];
    double ZZ1[2];
    double ZZ2[2];
    
    double X=0.;
    double Y=0.;
    double Z=0.;
    for (int I=0; I<2; ++I) {
      d0[I]       = -999.;
      z0[I]       = -999.;
      phi[I]      = -999.;
      cotTheta[I] = -999.;
      qOverPt[I]  = -999.;
      RC[I]       = -999.;
      XC[I]       = -999.;
      YC[I]       = -999.;
      RA[I]       = +999.;
      AB[I]       = +999.;
      XSVI[I]     = 0.;
      YSVI[I]     = 0.;
      ZSVI[I]     = 0.;
      RVI[I]      = 2.0*RVMAX;
      DZSVI[I]    = 2.0*DZMAX;
      SS1[I]      = 0.;
      SS2[I]      = 0.;
      ZZ1[I]      = 0.;
      ZZ2[I]      = 0.;
    }
 
    double U(0.);
    const AmgVector(5)& perParam1 = per1->parameters();
    double pt1 = fabs(sin(perParam1[Trk::theta])/perParam1[Trk::qOverP]);
    const AmgVector(5)& perParam2 = per2->parameters(); 
    double pt2 = fabs(sin(perParam2[Trk::theta])/perParam2[Trk::qOverP]);
    if (pt1 < pt2) {
      d0[0]  = perParam1[Trk::d0]; d0[1] = perParam2[Trk::d0];
      z0[0]  = perParam1[Trk::z0]; z0[1] = perParam2[Trk::z0];
      phi[0] = perParam1[Trk::phi]; phi[1] = perParam2[Trk::phi];
      double theta1  = perParam1[Trk::theta]; cotTheta[0] = 1./tan(theta1);
      double theta2  = perParam2[Trk::theta]; cotTheta[1] = 1./tan(theta2);
      double qOverP1 = perParam1[Trk::qOverP]; qOverPt[0] = qOverP1/sin(perParam1[Trk::theta]);
      double qOverP2 = perParam2[Trk::qOverP]; qOverPt[1] = qOverP2/sin(perParam2[Trk::theta]);
      RC[0] = 10.*0.5/(qOverPt[0]*aconst);  RC[1] = 10.*0.5/(qOverPt[1]*aconst);//Radius of curvature
      U     = RC[0] + d0[0];
      XC[0] = -1*U*sin(phi[0]);   //Circle center x-coordinate
      YC[0] = U*cos(phi[0]);      //Circle center y-coordinate
      RA[0] = fabs(RC[0]);
      U     = RC[1] + d0[1];
      XC[1] = -1*U*sin(phi[1]);  // Circle center x-coordinate
      YC[1] = U*cos(phi[1]);     // Circle center y-coordinate
      RA[1] = fabs(RC[1]);
    } else {
      d0[0]  = perParam2[Trk::d0]; d0[1] = perParam1[Trk::d0];
      z0[0]  = perParam2[Trk::z0]; z0[1] = perParam1[Trk::z0];
      phi[0] = perParam2[Trk::phi]; phi[1] = perParam1[Trk::phi];
      double theta2  = perParam2[Trk::theta]; cotTheta[0] = 1./tan(theta2);
      double theta1  = perParam1[Trk::theta]; cotTheta[1] = 1./tan(theta1);
      double qOverP2 = perParam2[Trk::qOverP]; qOverPt[0] = qOverP2/sin(perParam2[Trk::theta]);
      double qOverP1 = perParam1[Trk::qOverP]; qOverPt[1] = qOverP1/sin(perParam1[Trk::theta]);
      RC[0]    = 10.*0.5/(qOverPt[0]*aconst);  RC[1] = 10.*0.5/(qOverPt[1]*aconst);//Radius of curvature
      double U = RC[0] + d0[0];
      XC[0]    = -1*U*sin(phi[0]);   //Circle center x-coordinate
      YC[0]    = U*cos(phi[0]);      //Circle center y-coordinate
      RA[0]    = fabs(RC[0]);
      U        = RC[1] + d0[1];
      XC[1]    = -1*U*sin(phi[1]);  // Circle center x-coordinate
      YC[1]    = U*cos(phi[1]);     // Circle center y-coordinate
      RA[1]    = fabs(RC[1]);
    }
 
    //  get the circle centre separation
    double DX = XC[1] - XC[0];
    double DY = YC[1] - YC[0];
    double D = DX*DX + DY*DY;
    D = sqrt(D);
    if (D == 0.) {
      ATH_MSG_DEBUG("Concentric circles, should not happen return (0,0,0)");
      errorcode = 1;
      if(m_returnOnError) return intPoint;
    }
    U = D - RA[0] - RA[1]; // signed separation, if > 0., the circles do not intersect, if < 0., they might
    //  rotate, translate to a system, where the two circle centres lie on the X axis
 
    //New cut from Mauro
    deltaR = U; double PHI = -99999.;
    double hl = areaVar(XC[0], YC[0], RA[0], XC[1], YC[1], RA[1], PHI);
    
    double COST = DX/D;
    double SINT = DY/D;
    double Y0 = (-1*XC[0]*YC[1] + XC[1]*YC[0])/D; //Translation along the y-axis
    for (int I=0; I<2; ++I) {
      AB[I] = COST*XC[I] + SINT*YC[I];   // The new circle center positions in the rotated system. Essentially the new x-coordinates, since the y-coordinates are 0.
    }
    U = (XC[1] + XC[0])*(XC[1] - XC[0]) + (YC[1] + YC[0])*(YC[1] - YC[0]);
    double V = (RA[1] + RA[0])*(RA[1] - RA[0]);
    double XX = 0.5*(U - V)/D;            // X of intersection in rotated coordinate system (a+AB[0]). Again the y is 0.
    if ((XX - AB[0])*(XX - AB[0]) > 0.) {
      U = sqrt((XX - AB[0])*(XX - AB[0])); //This is the a in my logbook 
    }
    double YY2 = (RA[0] + U)*(RA[0] - U);  //This is the h^2 in my logbook
    double YY;
    int nsol = 0;
    if (YY2 > 0.) {
 
      // the circles intersect
      YY = sqrt(YY2); // two intersection points (+/- Y) or (+/- h) in my logbook
 
      for (int I=0; I<2; ++I) {
        U       = YY + Y0;  // invert the translation
        XSVI[I] = COST*XX - SINT*U;  // Invert the rotation
        YSVI[I] = SINT*XX + COST*U;
        YY      = -1*YY;
      }
 
      nsol = 2;
 
    } else {
      // circles do not intersect - find how close they approach each other
      // in the XY plane and take the point half way between them
      U = D - RA[0] - RA[1];
      if (U > 0.) {
        //Circles do not overlap at all and are outside from each other.See logbook
        V  = U;
        XX = AB[1] + RA[1];
 
        if (AB[0] < AB[1]) XX = AB[0] + RA[0];
            } else {                            
        //Circles inside each other but off-centered.See logbook
        if (AB[0] < AB[1]) {                //To the left
          XX = AB[1] - RA[1];
          V = AB[0] - RA[0] - XX;
        } else {
          //To the right
          XX = AB[0] + RA[0];
          V = AB[1] + RA[1] - XX;
        }
      } 
      XX      = XX + 0.5*V;
      XSVI[0] = COST*XX - SINT*Y0;           // rotate back to the original system
      YSVI[0] = SINT*XX + COST*Y0;           // one solution
      nsol    = 1;
      if (V > DRMAX) {                       
        //Cut if distance of minimum approach is too big
        ATH_MSG_DEBUG("XY distance of minimum approach is too large, return (0,0,0)");
        errorcode = 2;
        if(m_returnOnError) return intPoint;
      }
    }
    
    for (int J=0; J<nsol; ++J) {              // loop over solutions
      U = (XSVI[J] - XC[0])/RC[0];
      V = -1*(YSVI[J] - YC[0])/RC[0];
      U = atan2(U,V) - phi[0];                // turning angle from the track origin
      if (U < -1*pi) U = U + twopi;
      if (U > pi) U = U - twopi;
      SS1[J] = RC[0]*U;                       // arc length
      ZZ1[J] = z0[0] + SS1[J]*cotTheta[0];
      U = (XSVI[J] - XC[1])/RC[1];
      V = -1*(YSVI[J] - YC[1])/RC[1];
      U = atan2(U,V) - phi[1];
      if (U < -1*pi) U = U + twopi;
      if (U > pi) U = U - twopi;
      SS2[J] = RC[1]*U;
      ZZ2[J] = z0[1] + SS1[J]*cotTheta[1];
      RVI[J] = sqrt(XSVI[J]*XSVI[J] + YSVI[J]*YSVI[J]);
      DZSVI[J] = ZZ2[J] - ZZ1[J];
    }
    ZSVI[0] = 0.5*(ZZ1[0] + ZZ2[0]);
    ZSVI[1] = 0.5*(ZZ1[1] + ZZ2[1]);
    
    if (std::min(RVI[0],RVI[1]) > RVMAX) {                        // check the vertex radius is acceptable
      ATH_MSG_DEBUG("Unacceptable vertex radius");
      errorcode = 3;
    }
    
    if (std::min(fabs(DZSVI[0]),fabs(DZSVI[1])) > DZMAX) {         // check the Z difference
      ATH_MSG_DEBUG("Unacceptable Z difference");
      errorcode = 4;
    }
    
    double A = std::min(SS1[0],SS2[0]);                            // minimum track arc length, solution 1
    double B = std::min(SS1[1],SS2[1]);                            // minimum track arc length, solution 2
    if (std::max(A,B) < minArcLength || std::max(A,B) > maxArcLength) {          // limit the minimum arc length
      ATH_MSG_DEBUG("Unacceptable arc length");
      errorcode = 5;
      if(m_returnOnError) return intPoint;
    }
    
    int J = 0;
    if ( nsol == 2 && (fabs(DZSVI[1]) < fabs(DZSVI[0])) ) J = 1;
    
    X = XSVI[J];
    Y = YSVI[J];
    Z = ZSVI[J];
    intPoint(0)=X; intPoint(1)=Y; intPoint(2)=Z;
    
    if(deltaR>maxDr || deltaR<minDr){
      ATH_MSG_DEBUG("Unaceptable circle distance");
      errorcode = 6;
      if(m_returnOnError) return intPoint;
    }
    
    if(hl>maxHl){
      ATH_MSG_DEBUG("Unacceptable h/D ratio");
      errorcode = 7;
      if(m_returnOnError) return intPoint;
    }
    
    deltaPhi = PHI; // quick fix: cannot get rid of (double) PHI as it is passed by ref and deltaPhi is a float
    if(deltaPhi>maxPhi){
      ATH_MSG_DEBUG("Unacceptable difference in phi");
      errorcode = 8;
      if(m_returnOnError) return intPoint;
    }
 
    return intPoint;
  }

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();
  }

secondDegree()

bool InDet::VertexPointEstimator::secondDegree ( double a, double b, double c, double & y1, double & y2 )

staticprivate

Definition at line 487 of file VertexPointEstimator.cxx.

  {
    y1 = -999999999;
    y2 = -999999999;
    double discr = b*b - 4*a*c;
    if (discr < 0) return false;
    y1 = (-b+sqrt(discr))/2./a;
    y2 = (-b-sqrt(discr))/2./a;
    return true;
    
  }

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_maxArcLength

DoubleArrayProperty InDet::VertexPointEstimator::m_maxArcLength

private

Initial value:

{this, "MaxArcLength", {10000., 10000., 10000.},
       "maximum permitted arc length, track to vertex, depends on the posion of the first measurement"}

Definition at line 91 of file VertexPointEstimator.h.

      {this, "MaxArcLength", {10000., 10000., 10000.},
       "maximum permitted arc length, track to vertex, depends on the posion of the first measurement"};

m_maxDR

DoubleArrayProperty InDet::VertexPointEstimator::m_maxDR

private

Initial value:

{this, "MaxTrkXYDiffAtVtx", {10000., 10000., 10000.},
       "maximum XY separation, non-intersecting circles"}

Definition at line 79 of file VertexPointEstimator.h.

      {this, "MaxTrkXYDiffAtVtx", {10000., 10000., 10000.},
       "maximum XY separation, non-intersecting circles"};

m_maxDr

DoubleArrayProperty InDet::VertexPointEstimator::m_maxDr

private

Initial value:

{this, "MaxDeltaR", {5., 10., 10.},
       "maximum difference between helix centers"}

Definition at line 97 of file VertexPointEstimator.h.

      {this, "MaxDeltaR", {5., 10., 10.},
       "maximum difference between helix centers"};

m_maxDZ

DoubleArrayProperty InDet::VertexPointEstimator::m_maxDZ

private

Initial value:

{this, "MaxTrkZDiffAtVtx", {10000., 10000., 10000.},
       "maximum allowed track Z separation at the vertex"}

Definition at line 82 of file VertexPointEstimator.h.

      {this, "MaxTrkZDiffAtVtx", {10000., 10000., 10000.},
       "maximum allowed track Z separation at the vertex"};

m_maxHl

DoubleArrayProperty InDet::VertexPointEstimator::m_maxHl {this, "MaxHl", {10000., 10000., 10000.}, "maximum ratio H/l"}

private

Definition at line 100 of file VertexPointEstimator.h.

{this, "MaxHl", {10000., 10000., 10000.}, "maximum ratio H/l"};

m_maxPhi

DoubleArrayProperty InDet::VertexPointEstimator::m_maxPhi

private

Initial value:

{this, "MaxPhi", {0.05, 0.1, 0.1},
       "maximum DPhi at the estimated vertex position"}

Definition at line 102 of file VertexPointEstimator.h.

      {this, "MaxPhi", {0.05, 0.1, 0.1},
       "maximum DPhi at the estimated vertex position"};

m_maxR

DoubleArrayProperty InDet::VertexPointEstimator::m_maxR

private

Initial value:

{this, "MaxTrkXYValue", {10000., 10000., 10000.},
       "maximum allowed vertex radius"}

Definition at line 85 of file VertexPointEstimator.h.

      {this, "MaxTrkXYValue", {10000., 10000., 10000.},
       "maximum allowed vertex radius"};

m_minArcLength

DoubleArrayProperty InDet::VertexPointEstimator::m_minArcLength

private

Initial value:

{this, "MinArcLength", {-10000., -10000., -10000.},
       "minimum permitted arc length, track to vertex, depends on the posion of the first measurement"}

Definition at line 88 of file VertexPointEstimator.h.

      {this, "MinArcLength", {-10000., -10000., -10000.},
       "minimum permitted arc length, track to vertex, depends on the posion of the first measurement"};

m_minDr

DoubleArrayProperty InDet::VertexPointEstimator::m_minDr

private

Initial value:

{this, "MinDeltaR", {-5., -25., -50.},
       "minimum difference between helix centers"}

Definition at line 94 of file VertexPointEstimator.h.

      {this, "MinDeltaR", {-5., -25., -50.},
       "minimum difference between helix centers"};

m_returnOnError

BooleanProperty InDet::VertexPointEstimator::m_returnOnError {this, "ReturnOnError", true}

private

Definition at line 105 of file VertexPointEstimator.h.

{this, "ReturnOnError", true};

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.

s_bmagnt

const double InDet::VertexPointEstimator::s_bmagnt = 2.083

staticprivate

Definition at line 78 of file VertexPointEstimator.h.

---

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

• VertexPointEstimator.h
• VertexPointEstimator.cxx