ATLAS Offline Software
Public Member Functions | Protected Member Functions | Private Types | Private Member Functions | Static Private Member Functions | Private Attributes | List of all members
Trk::RiddersAlgorithm Class Reference

#include <RiddersAlgorithm.h>

Inheritance diagram for Trk::RiddersAlgorithm:
Collaboration diagram for Trk::RiddersAlgorithm:

Public Member Functions

 RiddersAlgorithm (const std::string &name, ISvcLocator *pSvcLocator)
 Standard Athena-Algorithm Constructor. More...
 
 ~RiddersAlgorithm ()
 Default Destructor. More...
 
StatusCode initialize ()
 standard Athena-Algorithm method More...
 
StatusCode execute ()
 standard Athena-Algorithm method More...
 
StatusCode finalize ()
 standard Athena-Algorithm method More...
 
virtual StatusCode sysInitialize () override
 Override sysInitialize. More...
 
virtual const DataObjIDColl & extraOutputDeps () const override
 Return the list of extra output dependencies. More...
 
ServiceHandle< StoreGateSvc > & evtStore ()
 The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc. More...
 
const ServiceHandle< StoreGateSvc > & evtStore () const
 The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc. More...
 
const ServiceHandle< StoreGateSvc > & detStore () const
 The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc. More...
 
virtual StatusCode sysStart () override
 Handle START transition. More...
 
virtual std::vector< Gaudi::DataHandle * > inputHandles () const override
 Return this algorithm's input handles. More...
 
virtual std::vector< Gaudi::DataHandle * > outputHandles () const override
 Return this algorithm's output handles. More...
 
Gaudi::Details::PropertyBase & declareProperty (Gaudi::Property< T > &t)
 
Gaudi::Details::PropertyBase * declareProperty (const std::string &name, SG::VarHandleKey &hndl, const std::string &doc, const SG::VarHandleKeyType &)
 Declare a new Gaudi property. More...
 
Gaudi::Details::PropertyBase * declareProperty (const std::string &name, SG::VarHandleBase &hndl, const std::string &doc, const SG::VarHandleType &)
 Declare a new Gaudi property. More...
 
Gaudi::Details::PropertyBase * declareProperty (const std::string &name, SG::VarHandleKeyArray &hndArr, const std::string &doc, const SG::VarHandleKeyArrayType &)
 
Gaudi::Details::PropertyBase * declareProperty (const std::string &name, T &property, const std::string &doc, const SG::NotHandleType &)
 Declare a new Gaudi property. More...
 
Gaudi::Details::PropertyBase * declareProperty (const std::string &name, T &property, const std::string &doc="none")
 Declare a new Gaudi property. More...
 
void updateVHKA (Gaudi::Details::PropertyBase &)
 
MsgStream & msg () const
 
MsgStream & msg (const MSG::Level lvl) const
 
bool msgLvl (const MSG::Level lvl) const
 

Protected Member Functions

void renounceArray (SG::VarHandleKeyArray &handlesArray)
 remove all handles from I/O resolution More...
 
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. More...
 

Private Types

typedef ServiceHandle< StoreGateSvc > StoreGateSvc_t
 

Private Member Functions

Gaudi::Details::PropertyBase & declareGaudiProperty (Gaudi::Property< T > &hndl, const SG::VarHandleKeyType &)
 specialization for handling Gaudi::Property<SG::VarHandleKey> More...
 
Gaudi::Details::PropertyBase & declareGaudiProperty (Gaudi::Property< T > &hndl, const SG::VarHandleKeyArrayType &)
 specialization for handling Gaudi::Property<SG::VarHandleKeyArray> More...
 
Gaudi::Details::PropertyBase & declareGaudiProperty (Gaudi::Property< T > &hndl, const SG::VarHandleType &)
 specialization for handling Gaudi::Property<SG::VarHandleBase> More...
 
Gaudi::Details::PropertyBase & declareGaudiProperty (Gaudi::Property< T > &t, const SG::NotHandleType &)
 specialization for handling everything that's not a Gaudi::Property<SG::VarHandleKey> or a <SG::VarHandleKeyArray> More...
 

Static Private Member Functions

static Amg::Transform3D createTransform (double x, double y, double z, double phi=0., double theta=0., double alphaZ=0.)
 private helper method to create a HepTransform More...
 
static double parabolicInterpolation (double y0, double y1, double y2, double x0, double x1, double x2)
 Langrange-parabolic interpolation. More...
 

Private Attributes

PublicToolHandle< IPropagator > m_propagator {this, "Propagator", "Trk::RungeKuttaPropagator/RungeKuttaPropagator"}
 member variables for algorithm properties: More...
 
BooleanProperty m_useCustomField {this, "UseCustomMagneticField", true}
 
BooleanProperty m_useAlignedSurfaces {this, "UseAlignedSurfaces", true}
 
DoubleProperty m_fieldValue {this, "CustomFieldValue", 2.*Gaudi::Units::tesla}
 
MagneticFieldProperties * m_magFieldProperties = nullptr
 
DoubleProperty m_sigmaLoc {this, "StartPerigeeSigmaLoc", 100.*Gaudi::Units::micrometer}
 The smearing. More...
 
DoubleProperty m_sigmaR {this, "StartPerigeeSigmaR", 0.}
 
DoubleProperty m_minPhi {this, "StartPerigeeMinPhi", -M_PI}
 
DoubleProperty m_maxPhi {this, "StartPerigeeMaxPhi", M_PI}
 
DoubleProperty m_minEta {this, "StartPerigeeMinEta", -2.5}
 
DoubleProperty m_maxEta {this, "StartPerigeeMaxEta", 2.5}
 
DoubleProperty m_minP {this, "StartPerigeeMinP", 0.5*Gaudi::Units::GeV}
 
DoubleProperty m_maxP {this, "StartPerigeeMaxP", 50000*Gaudi::Units::GeV}
 
DoubleProperty m_minimumR {this, "TargetSurfaceMinR", 10.}
 To create the first extimations. More...
 
DoubleProperty m_maximumR {this, "TargetSurfaceMaxR", 1000.}
 
DoubleArrayProperty m_localVariations {this, "LocalVariations", {}}
 variations More...
 
DoubleArrayProperty m_angularVariations {this, "AngularVariations", {}}
 
DoubleArrayProperty m_qOpVariations {this, "QopVariations", {}}
 
TTree * m_validationTree = nullptr
 Root Validation Tree. More...
 
StringProperty m_validationTreeName
 
StringProperty m_validationTreeDescription
 
StringProperty m_validationTreeFolder
 
int m_steps = 0
 
float m_loc1loc1 [RIDDLERSSTEPS] {}
 
float m_loc1loc2 [RIDDLERSSTEPS] {}
 
float m_loc1phi [RIDDLERSSTEPS] {}
 
float m_loc1theta [RIDDLERSSTEPS] {}
 
float m_loc1qop [RIDDLERSSTEPS] {}
 
float m_loc1steps [RIDDLERSSTEPS] {}
 
float m_loc2loc1 [RIDDLERSSTEPS] {}
 
float m_loc2loc2 [RIDDLERSSTEPS] {}
 
float m_loc2phi [RIDDLERSSTEPS] {}
 
float m_loc2theta [RIDDLERSSTEPS] {}
 
float m_loc2qop [RIDDLERSSTEPS] {}
 
float m_loc2steps [RIDDLERSSTEPS] {}
 
float m_philoc1 [RIDDLERSSTEPS] {}
 
float m_philoc2 [RIDDLERSSTEPS] {}
 
float m_phiphi [RIDDLERSSTEPS] {}
 
float m_phitheta [RIDDLERSSTEPS] {}
 
float m_phiqop [RIDDLERSSTEPS] {}
 
float m_phisteps [RIDDLERSSTEPS] {}
 
float m_thetaloc1 [RIDDLERSSTEPS] {}
 
float m_thetaloc2 [RIDDLERSSTEPS] {}
 
float m_thetaphi [RIDDLERSSTEPS] {}
 
float m_thetatheta [RIDDLERSSTEPS] {}
 
float m_thetaqop [RIDDLERSSTEPS] {}
 
float m_thetasteps [RIDDLERSSTEPS] {}
 
float m_qoploc1 [RIDDLERSSTEPS] {}
 
float m_qoploc2 [RIDDLERSSTEPS] {}
 
float m_qopphi [RIDDLERSSTEPS] {}
 
float m_qoptheta [RIDDLERSSTEPS] {}
 
float m_qopqop [RIDDLERSSTEPS] {}
 
float m_qopsteps [RIDDLERSSTEPS] {}
 
Rndm::Numbers * m_gaussDist = nullptr
 Random Number setup. More...
 
Rndm::Numbers * m_flatDist = nullptr
 
DataObjIDColl m_extendedExtraObjects
 
StoreGateSvc_t m_evtStore
 Pointer to StoreGate (event store by default) More...
 
StoreGateSvc_t m_detStore
 Pointer to StoreGate (detector store by default) More...
 
std::vector< SG::VarHandleKeyArray * > m_vhka
 
bool m_varHandleArraysDeclared
 

Detailed Description

This is a test algorithm for evaluating the jacobians for the transport of Track Parameters

Author
Andreas Salzburger Andre.nosp@m.as.S.nosp@m.alzbu.nosp@m.rger.nosp@m.@cern.nosp@m..ch

Definition at line 44 of file RiddersAlgorithm.h.

Member Typedef Documentation

◆ StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< Algorithm > >::StoreGateSvc_t
privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ RiddersAlgorithm()

Trk::RiddersAlgorithm::RiddersAlgorithm ( const std::string &  name,
ISvcLocator *  pSvcLocator 
)

Standard Athena-Algorithm Constructor.

Definition at line 24 of file RiddersAlgorithm.cxx.

24  :
25  AthAlgorithm(name,pSvcLocator) {}

◆ ~RiddersAlgorithm()

Trk::RiddersAlgorithm::~RiddersAlgorithm ( )

Default Destructor.

Definition at line 29 of file RiddersAlgorithm.cxx.

30 {
31  delete m_gaussDist;
32  delete m_flatDist;
33  delete m_magFieldProperties;
34 }

Member Function Documentation

◆ createTransform()

Amg::Transform3D Trk::RiddersAlgorithm::createTransform ( double  x,
double  y,
double  z,
double  phi = 0.,
double  theta = 0.,
double  alphaZ = 0. 
)
staticprivate

private helper method to create a HepTransform

Definition at line 789 of file RiddersAlgorithm.cxx.

790 {
791 
792  if (phi!=0. && theta != 0.){
793  // create the Start Surface
794  Amg::Vector3D surfacePosition(x,y,z);
795  // z direction
796  Amg::Vector3D surfaceZdirection(cos(phi)*sin(theta),
797  sin(phi)*sin(theta),
798  cos(theta));
799  // the global z axis
800  Amg::Vector3D zAxis(0.,0.,1.);
801  // the y direction
802  Amg::Vector3D surfaceYdirection(zAxis.cross(surfaceZdirection));
803  // the x direction
804  Amg::Vector3D surfaceXdirection(surfaceYdirection.cross(surfaceZdirection));
805  // the rotation
806  Amg::RotationMatrix3D surfaceRotation;
807  surfaceRotation.col(0) = surfaceXdirection;
808  surfaceRotation.col(1) = surfaceYdirection;
809  surfaceRotation.col(2) = surfaceZdirection;
810  Amg::Transform3D nominalTransform(surfaceRotation, surfacePosition);
811  return Amg::Transform3D(nominalTransform*Amg::AngleAxis3D(alphaZ,zAxis));
812 
813  }
814 
815  return Amg::Transform3D(Amg::Translation3D(x,y,z));
816 }

◆ declareGaudiProperty() [1/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Algorithm > >::declareGaudiProperty ( Gaudi::Property< T > &  hndl,
const SG::VarHandleKeyArrayType &   
)
inlineprivateinherited

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

Definition at line 170 of file AthCommonDataStore.h.

172  {
173  return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
174  hndl.value(),
175  hndl.documentation());
176 
177  }

◆ declareGaudiProperty() [2/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Algorithm > >::declareGaudiProperty ( Gaudi::Property< T > &  hndl,
const SG::VarHandleKeyType &   
)
inlineprivateinherited

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

Definition at line 156 of file AthCommonDataStore.h.

158  {
159  return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
160  hndl.value(),
161  hndl.documentation());
162 
163  }

◆ declareGaudiProperty() [3/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Algorithm > >::declareGaudiProperty ( Gaudi::Property< T > &  hndl,
const SG::VarHandleType &   
)
inlineprivateinherited

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

Definition at line 184 of file AthCommonDataStore.h.

186  {
187  return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
188  hndl.value(),
189  hndl.documentation());
190  }

◆ declareGaudiProperty() [4/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Algorithm > >::declareGaudiProperty ( Gaudi::Property< T > &  t,
const SG::NotHandleType &   
)
inlineprivateinherited

specialization for handling everything that's not a Gaudi::Property<SG::VarHandleKey> or a <SG::VarHandleKeyArray>

Definition at line 199 of file AthCommonDataStore.h.

200  {
201  return PBASE::declareProperty(t);
202  }

◆ declareProperty() [1/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty ( const std::string &  name,
SG::VarHandleBase &  hndl,
const std::string &  doc,
const SG::VarHandleType &   
)
inlineinherited

Declare a new Gaudi property.

Parameters
nameName of the property.
hndlObject holding the property value.
docDocumentation string for the property.

This is the version for types that derive from SG::VarHandleBase. The property value object is put on the input and output lists as appropriate; then we forward to the base class.

Definition at line 245 of file AthCommonDataStore.h.

249  {
250  this->declare(hndl.vhKey());
251  hndl.vhKey().setOwner(this);
252 
253  return PBASE::declareProperty(name,hndl,doc);
254  }

◆ declareProperty() [2/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty ( const std::string &  name,
SG::VarHandleKey &  hndl,
const std::string &  doc,
const SG::VarHandleKeyType &   
)
inlineinherited

Declare a new Gaudi property.

Parameters
nameName of the property.
hndlObject holding the property value.
docDocumentation string for the property.

This is the version for types that derive from SG::VarHandleKey. The property value object is put on the input and output lists as appropriate; then we forward to the base class.

Definition at line 221 of file AthCommonDataStore.h.

225  {
226  this->declare(hndl);
227  hndl.setOwner(this);
228 
229  return PBASE::declareProperty(name,hndl,doc);
230  }

◆ declareProperty() [3/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty ( const std::string &  name,
SG::VarHandleKeyArray &  hndArr,
const std::string &  doc,
const SG::VarHandleKeyArrayType &   
)
inlineinherited

Definition at line 259 of file AthCommonDataStore.h.

263  {
264 
265  // std::ostringstream ost;
266  // ost << Algorithm::name() << " VHKA declareProp: " << name
267  // << " size: " << hndArr.keys().size()
268  // << " mode: " << hndArr.mode()
269  // << " vhka size: " << m_vhka.size()
270  // << "\n";
271  // debug() << ost.str() << endmsg;
272 
273  hndArr.setOwner(this);
274  m_vhka.push_back(&hndArr);
275 
276  Gaudi::Details::PropertyBase* p = PBASE::declareProperty(name, hndArr, doc);
277  if (p != 0) {
278  p->declareUpdateHandler(&AthCommonDataStore<PBASE>::updateVHKA, this);
279  } else {
280  ATH_MSG_ERROR("unable to call declareProperty on VarHandleKeyArray "
281  << name);
282  }
283 
284  return p;
285 
286  }

◆ declareProperty() [4/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty ( const std::string &  name,
T &  property,
const std::string &  doc,
const SG::NotHandleType &   
)
inlineinherited

Declare a new Gaudi property.

Parameters
nameName of the property.
propertyObject holding the property value.
docDocumentation string for the property.

This is the generic version, for types that do not derive from SG::VarHandleKey. It just forwards to the base class version of declareProperty.

Definition at line 333 of file AthCommonDataStore.h.

337  {
338  return PBASE::declareProperty(name, property, doc);
339  }

◆ declareProperty() [5/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty ( const std::string &  name,
T &  property,
const std::string &  doc = "none" 
)
inlineinherited

Declare a new Gaudi property.

Parameters
nameName of the property.
propertyObject holding the property value.
docDocumentation string for the property.

This dispatches to either the generic declareProperty or the one for VarHandle/Key/KeyArray.

Definition at line 352 of file AthCommonDataStore.h.

355  {
356  typedef typename SG::HandleClassifier<T>::type htype;
357  return declareProperty (name, property, doc, htype());
358  }

◆ declareProperty() [6/6]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty ( Gaudi::Property< T > &  t)
inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

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

◆ detStore()

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

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

Definition at line 95 of file AthCommonDataStore.h.

95 { return m_detStore; }

◆ evtStore() [1/2]

ServiceHandle<StoreGateSvc>& AthCommonDataStore< AthCommonMsg< Algorithm > >::evtStore ( )
inlineinherited

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

Definition at line 85 of file AthCommonDataStore.h.

85 { return m_evtStore; }

◆ evtStore() [2/2]

const ServiceHandle<StoreGateSvc>& AthCommonDataStore< AthCommonMsg< Algorithm > >::evtStore ( ) const
inlineinherited

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

Definition at line 90 of file AthCommonDataStore.h.

90 { return m_evtStore; }

◆ execute()

StatusCode Trk::RiddersAlgorithm::execute ( )

standard Athena-Algorithm method

Definition at line 137 of file RiddersAlgorithm.cxx.

138 {
139  const EventContext& ctx = Gaudi::Hive::currentContext();
140  // this is fine
141  double p = m_minP + m_flatDist->shoot()*(m_maxP-m_minP);
142  double charge = (m_flatDist->shoot() > 0.5 ) ? -1. : 1.;
143  double qOverP = charge/p;
144 
145  // for the momentum logging
146  // m_startP = p;
147 
148  // the local start start
149  double loc1 = m_sigmaLoc * m_gaussDist->shoot();
150  double loc2 = m_sigmaLoc * m_gaussDist->shoot();
151  // are adopted for planar and straight line surfaces
152  double phi = m_minPhi + m_maxPhi * m_flatDist->shoot();
153  double eta = m_minEta + m_flatDist->shoot()*(m_maxEta-m_minEta);
154  double theta = 2.*atan(exp(-eta));
155 
156  // start
157  double startR = std::abs(m_sigmaR * m_gaussDist->shoot());
158  double surfacePhi = M_PI * m_flatDist->shoot();
159  surfacePhi *= (m_flatDist->shoot() > 0.5 ) ? -1. : 1.;
160  double startX = startR*cos(surfacePhi);
161  double startY = startR*sin(surfacePhi);
162  double startZ = m_sigmaLoc * m_gaussDist->shoot();
163 
164  // rotate it around Z
165  double alphaZ = M_PI * m_flatDist->shoot();
166  alphaZ *= (m_flatDist->shoot() > 0.5 ) ? -1. : 1.;
167 
168  // create the plane surface
169  Trk::PlaneSurface startSurface(createTransform(startX,
170  startY,
171  startZ,
172  phi, theta,
173  alphaZ),
174  10e3,10e3);
175 
176  // make a covariance Matrix
177  AmgMatrix(5,5) covMat;
178  covMat.setZero();
179 
180  // the initial perigee with random numbers
181  Trk::AtaPlane startParameters(loc1,
182  loc2,
183  phi,
184  theta,
185  qOverP,
186  startSurface,
187  covMat);
188 
189  ATH_MSG_VERBOSE( "Start Parameters : " << startParameters );
190 
191 
192  // destination position
193  double estimationR = m_minimumR + (m_maximumR-m_minimumR) * m_flatDist->shoot();
194 
195 
196  // --------------- propagate to find a first intersection ---------------------
197  Trk::CylinderSurface estimationCylinder(Amg::Transform3D(), estimationR, 10e10);
198 
199  ATH_MSG_VERBOSE( "Cylinder to be intersected : " << estimationCylinder );
200 
201  auto estimationParameters = m_propagator->propagateParameters(ctx,
202  startParameters,
203  estimationCylinder,
204  Trk::alongMomentum,
205  false,
206  *m_magFieldProperties);
207  if (!estimationParameters) {
208  ATH_MSG_VERBOSE( "Estimation of intersection did not work - skip event !" );
209  return StatusCode::SUCCESS;
210  }
211 
212  ATH_MSG_VERBOSE( "Estimation Parameters: " << *estimationParameters );
213 
214  const Amg::Vector3D& estimatedPosition = estimationParameters->position();
215 
216  double estimationX = estimatedPosition.x();
217  double estimationY = estimatedPosition.y();
218  double estimationZ = estimatedPosition.z();
219 
220  double estimationPhi = estimatedPosition.phi();
221  double estimationTheta = estimatedPosition.theta();
222 
223 
224 
225  double rotateTrans = M_PI * m_flatDist->shoot();
226  rotateTrans *= (m_flatDist->shoot() > 0.5 ) ? -1. : 1.;
227 
228  Amg::Transform3D surfaceTransform;
229 
230  if (m_useAlignedSurfaces){
231  // create a radial vector
232  Amg::Vector3D radialVector(estimatedPosition.x(), estimatedPosition.y(), 0.);
233  Amg::Vector3D surfaceZdirection(radialVector.unit());
234  Amg::Vector3D surfaceYdirection(0.,0.,1.);
235  // the x direction
236  Amg::Vector3D surfaceXdirection(surfaceYdirection.cross(surfaceZdirection));
237  // the rotation
238  Amg::RotationMatrix3D surfaceRotation;
239  surfaceRotation.col(0) = surfaceXdirection;
240  surfaceRotation.col(1) = surfaceYdirection;
241  surfaceRotation.col(2) = surfaceZdirection;
242  Amg::Transform3D nominalTransform(surfaceRotation, estimatedPosition);
243  surfaceTransform = Amg::Transform3D(nominalTransform*Amg::AngleAxis3D(rotateTrans,Amg::Vector3D(0.,0.,1.)));
244  } else
245  surfaceTransform = createTransform(estimationX,
246  estimationY,
247  estimationZ,
248  estimationPhi,
249  estimationTheta,
250  rotateTrans);
251 
252  // cleanup for memory reasons
253 
254  Trk::PlaneSurface destinationSurface(surfaceTransform,10e5 , 10e5);
255 
256 
257  // transport the start to the destination surface
258  std::optional<Trk::TransportJacobian> optTransportJacobian{};
259  AmgMatrix(5,5) testMatrix; testMatrix.setZero();
260  Trk::TransportJacobian currentStepJacobian(testMatrix);
261  double pathLimit = -1.;
262 
263  auto trackParameters = m_propagator->propagate(ctx,
264  startParameters,
265  destinationSurface,
266  Trk::alongMomentum,
267  false,
268  *m_magFieldProperties,
269  optTransportJacobian,
270  pathLimit);
271 
272  // --------------------- check if test propagation was successful ------------------------------
273  if (trackParameters && optTransportJacobian){
274 
275  unsigned int recStep = 0;
276  const auto& transportJacobian = (*optTransportJacobian);
277  // [0] Transport Jacobian -----------------------------------------------------
278  ATH_MSG_VERBOSE( "TransportJacobian : " << transportJacobian );
279 
280 
281  // and now fill the variables
282  m_loc1loc1[recStep] = (transportJacobian)(0,0);
283  m_loc1loc2[recStep] = (transportJacobian)(0,1);
284  m_loc1phi[recStep] = (transportJacobian)(0,2);
285  m_loc1theta[recStep] = (transportJacobian)(0,3);
286  m_loc1qop[recStep] = (transportJacobian)(0,4);
287  m_loc1steps[recStep] = 0.;
288 
289  m_loc2loc1[recStep] = (transportJacobian)(1,0);
290  m_loc2loc2[recStep] = (transportJacobian)(1,1);
291  m_loc2phi[recStep] = (transportJacobian)(1,2);
292  m_loc2theta[recStep] = (transportJacobian)(1,3);
293  m_loc2qop[recStep] = (transportJacobian)(1,4);
294  m_loc2steps[recStep] = 0.;
295 
296  m_philoc1[recStep] = (transportJacobian)(2,0);
297  m_philoc2[recStep] = (transportJacobian)(2,1);
298  m_phiphi[recStep] = (transportJacobian)(2,2);
299  m_phitheta[recStep] = (transportJacobian)(2,3);
300  m_phiqop[recStep] = (transportJacobian)(2,4);
301  m_phisteps[recStep] = 0.;
302 
303  m_thetaloc1[recStep] = (transportJacobian)(3,0);
304  m_thetaloc2[recStep] = (transportJacobian)(3,1);
305  m_thetaphi[recStep] = (transportJacobian)(3,2);
306  m_thetatheta[recStep] = (transportJacobian)(3,3);
307  m_thetaqop[recStep] = (transportJacobian)(3,4);
308  m_thetasteps[recStep] = 0.;
309 
310  m_qoploc1[recStep] = (transportJacobian)(4,0);
311  m_qoploc2[recStep] = (transportJacobian)(4,1);
312  m_qopphi[recStep] = (transportJacobian)(4,2);
313  m_qoptheta[recStep] = (transportJacobian)(4,3);
314  m_qopqop[recStep] = (transportJacobian)(4,4);
315  m_qopsteps[recStep] = 0.;
316 
317  ++recStep;
318 
319  // start the riddlers algorithm
320  // [1-2-3] Riddlers jacobians -----------------------------------------
321  for (unsigned int istep = 0; istep < m_localVariations.size(); ++istep){
322  // --------------------------
323  ATH_MSG_VERBOSE( "Performing step : " << istep );
324  // the initial perigee with random numbers
325  // for the first row
326  Trk::AtaPlane startLoc1Minus(loc1-m_localVariations[istep],loc2,phi,theta,qOverP,startSurface);
327  Trk::AtaPlane startLoc1Plus(loc1+m_localVariations[istep],loc2,phi,theta,qOverP,startSurface);
328  // for the second row
329  Trk::AtaPlane startLoc2Minus(loc1,loc2-m_localVariations[istep],phi,theta,qOverP,startSurface);
330  Trk::AtaPlane startLoc2Plus(loc1,loc2+m_localVariations[istep],phi,theta,qOverP,startSurface);
331  // for the third row
332  Trk::AtaPlane startPhiMinus(loc1,loc2,phi-m_angularVariations[istep],theta,qOverP,startSurface);
333  Trk::AtaPlane startPhiPlus(loc1,loc2,phi+m_angularVariations[istep],theta,qOverP,startSurface);
334  // for the fourth row
335  Trk::AtaPlane startThetaMinus(loc1,loc2,phi,theta-m_angularVariations[istep],qOverP,startSurface);
336  Trk::AtaPlane startThetaPlus(loc1,loc2,phi,theta+m_angularVariations[istep],qOverP,startSurface);
337  // for the fifth row
338  Trk::AtaPlane startQopMinus(loc1,loc2,phi,theta,qOverP-m_qOpVariations[istep],startSurface);
339  Trk::AtaPlane startQopPlus(loc1,loc2,phi,theta,qOverP+m_qOpVariations[istep],startSurface);
340 
341  // the propagations --- 10 times
342  auto endLoc1Minus = m_propagator->propagateParameters(ctx,
343  startLoc1Minus,
344  destinationSurface,
345  Trk::alongMomentum,
346  false,
347  *m_magFieldProperties);
348 
349 
350  auto endLoc1Plus = m_propagator->propagateParameters(ctx,
351  startLoc1Plus,
352  destinationSurface,
353  Trk::alongMomentum,
354  false,
355  *m_magFieldProperties);
356 
357  auto endLoc2Minus = m_propagator->propagateParameters(ctx,
358  startLoc2Minus,
359  destinationSurface,
360  Trk::alongMomentum,
361  false,
362  *m_magFieldProperties);
363 
364  auto endLoc2Plus = m_propagator->propagateParameters(ctx,
365  startLoc2Plus,
366  destinationSurface,
367  Trk::alongMomentum,
368  false,
369  *m_magFieldProperties);
370 
371  auto endPhiMinus = m_propagator->propagateParameters(ctx,
372  startPhiMinus,
373  destinationSurface,
374  Trk::alongMomentum,
375  false,
376  *m_magFieldProperties);
377 
378  auto endPhiPlus = m_propagator->propagateParameters(ctx,
379  startPhiPlus,
380  destinationSurface,
381  Trk::alongMomentum,
382  false,
383  *m_magFieldProperties);
384 
385  auto endThetaMinus = m_propagator->propagateParameters(ctx,
386  startThetaMinus,
387  destinationSurface,
388  Trk::alongMomentum,
389  false,
390  *m_magFieldProperties);
391 
392  auto endThetaPlus = m_propagator->propagateParameters(ctx,
393  startThetaPlus,
394  destinationSurface,
395  Trk::alongMomentum,
396  false,
397  *m_magFieldProperties);
398 
399  auto endQopMinus = m_propagator->propagateParameters(ctx,
400  startQopMinus,
401  destinationSurface,
402  Trk::alongMomentum,
403  false,
404  *m_magFieldProperties);
405 
406  auto endQopPlus = m_propagator->propagateParameters(ctx,
407  startQopPlus,
408  destinationSurface,
409  Trk::alongMomentum,
410  false,
411  *m_magFieldProperties);
412  if (endLoc1Minus
413  && endLoc1Plus
414  && endLoc2Minus
415  && endLoc2Plus
416  && endPhiMinus
417  && endPhiPlus
418  && endThetaMinus
419  && endThetaPlus
420  && endQopMinus
421  && endQopPlus){
422 
423  // Loc 1
424  const Amg::VectorX& endLoc1MinusPar = endLoc1Minus->parameters();
425  const Amg::VectorX& endLoc1PlusPar = endLoc1Plus->parameters();
426  // Loc 2
427  const Amg::VectorX& endLoc2MinusPar = endLoc2Minus->parameters();
428  const Amg::VectorX& endLoc2PlusPar = endLoc2Plus->parameters();
429  // Phi
430  const Amg::VectorX& endPhiMinusPar = endPhiMinus->parameters();
431  const Amg::VectorX& endPhiPlusPar = endPhiPlus->parameters();
432  // Theta
433  const Amg::VectorX& endThetaMinusPar = endThetaMinus->parameters();
434  const Amg::VectorX& endThetaPlusPar = endThetaPlus->parameters();
435  // qop
436  const Amg::VectorX& endQopMinusPar = endQopMinus->parameters();
437  const Amg::VectorX& endQopPlusPar = endQopPlus->parameters();
438 
439  // the deltas
440  Amg::VectorX endLoc1Diff(endLoc1PlusPar-endLoc1MinusPar);
441  Amg::VectorX endLoc2Diff(endLoc2PlusPar-endLoc2MinusPar);
442  Amg::VectorX endPhiDiff(endPhiPlusPar-endPhiMinusPar);
443  Amg::VectorX endThetaDiff(endThetaPlusPar-endThetaMinusPar);
444  Amg::VectorX endQopDiff(endQopPlusPar-endQopMinusPar);
445 
446  currentStepJacobian(0,0) = endLoc1Diff[0]/(2.*m_localVariations[istep]);
447  currentStepJacobian(0,1) = endLoc2Diff[0]/(2.*m_localVariations[istep]);
448  currentStepJacobian(0,2) = endPhiDiff[0]/(2.*m_angularVariations[istep]);
449  currentStepJacobian(0,3) = endThetaDiff[0]/(2.*m_angularVariations[istep]);
450  currentStepJacobian(0,4) = endQopDiff[0]/(2.*m_qOpVariations[istep]);
451 
452  m_loc1loc1[recStep] = currentStepJacobian(0,0);
453  m_loc1loc2[recStep] = currentStepJacobian(0,1);
454  m_loc1phi[recStep] = currentStepJacobian(0,2);
455  m_loc1theta[recStep] = currentStepJacobian(0,3);
456  m_loc1qop[recStep] = currentStepJacobian(0,4);
457  m_loc1steps[recStep] = m_localVariations[istep];
458 
459  currentStepJacobian(1,0) = endLoc1Diff[1]/(2.*m_localVariations[istep]);
460  currentStepJacobian(1,1) = endLoc2Diff[1]/(2.*m_localVariations[istep]);
461  currentStepJacobian(1,2) = endPhiDiff[1]/(2.*m_angularVariations[istep]);
462  currentStepJacobian(1,3) = endThetaDiff[1]/(2.*m_angularVariations[istep]);
463  currentStepJacobian(1,4) = endQopDiff[1]/(2.*m_qOpVariations[istep]);
464 
465  m_loc2loc1[recStep] = currentStepJacobian(1,0);
466  m_loc2loc2[recStep] = currentStepJacobian(1,1);
467  m_loc2phi[recStep] = currentStepJacobian(1,2);
468  m_loc2theta[recStep] = currentStepJacobian(1,3);
469  m_loc2qop[recStep] = currentStepJacobian(1,4);
470  m_loc2steps[recStep] = m_localVariations[istep];
471 
472  currentStepJacobian(2,0) = endLoc1Diff[2]/(2.*m_localVariations[istep]);
473  currentStepJacobian(2,1) = endLoc2Diff[2]/(2.*m_localVariations[istep]);
474  currentStepJacobian(2,2) = endPhiDiff[2]/(2.*m_angularVariations[istep]);
475  currentStepJacobian(2,3) = endThetaDiff[2]/(2.*m_angularVariations[istep]);
476  currentStepJacobian(2,4) = endQopDiff[2]/(2.*m_qOpVariations[istep]);
477 
478  m_philoc1[recStep] = currentStepJacobian(2,0);
479  m_philoc2[recStep] = currentStepJacobian(2,1);
480  m_phiphi[recStep] = currentStepJacobian(2,2);
481  m_phitheta[recStep] = currentStepJacobian(2,3);
482  m_phiqop[recStep] = currentStepJacobian(2,4);
483  m_phisteps[recStep] = m_angularVariations[istep];
484 
485  currentStepJacobian(3,0) = endLoc1Diff[3]/(2.*m_localVariations[istep]);
486  currentStepJacobian(3,1) = endLoc2Diff[3]/(2.*m_localVariations[istep]);
487  currentStepJacobian(3,2) = endPhiDiff[3]/(2.*m_angularVariations[istep]);
488  currentStepJacobian(3,3) = endThetaDiff[3]/(2.*m_angularVariations[istep]);
489  currentStepJacobian(3,4) = endQopDiff[3]/(2.*m_qOpVariations[istep]);
490 
491  m_thetaloc1[recStep] = currentStepJacobian(3,0);
492  m_thetaloc2[recStep] = currentStepJacobian(3,1);
493  m_thetaphi[recStep] = currentStepJacobian(3,2);
494  m_thetatheta[recStep] = currentStepJacobian(3,3);
495  m_thetaqop[recStep] = currentStepJacobian(3,4);
496  m_thetasteps[recStep] = m_angularVariations[istep];
497 
498  currentStepJacobian(4,0) = endLoc1Diff[4]/(2.*m_localVariations[istep]);
499  currentStepJacobian(4,1) = endLoc2Diff[4]/(2.*m_localVariations[istep]);
500  currentStepJacobian(4,2) = endPhiDiff[4]/(2.*m_angularVariations[istep]);
501  currentStepJacobian(4,3) = endThetaDiff[4]/(2.*m_angularVariations[istep]);
502  currentStepJacobian(4,4) = endQopDiff[4]/(2.*m_qOpVariations[istep]);
503 
504  m_qoploc1[recStep] = currentStepJacobian(4,0);
505  m_qoploc2[recStep] = currentStepJacobian(4,1);
506  m_qopphi[recStep] = currentStepJacobian(4,2);
507  m_qoptheta[recStep] = currentStepJacobian(4,3);
508  m_qopqop[recStep] = currentStepJacobian(4,4);
509  m_qopsteps[recStep] = m_qOpVariations[istep];
510 
511  ATH_MSG_DEBUG( "Current TransportJacobian : " << currentStepJacobian );
512 
513  ++recStep;
514  }
515  }
516 
517  // -------------------------------------------------------------------------------
518  if (recStep > 2){
519  // The parabolic interpolation -------------------------------------------------------------------------------
520  // dL1
521  m_loc1loc1[recStep] = parabolicInterpolation(m_loc1loc1[recStep-1],m_loc1loc1[recStep-2],m_loc1loc1[recStep-3],
522  m_localVariations[2], m_localVariations[1], m_localVariations[0]);
523  m_loc1loc2[recStep] = parabolicInterpolation(m_loc1loc2[recStep-1],m_loc1loc2[recStep-2],m_loc1loc2[recStep-3],
524  m_localVariations[2], m_localVariations[1], m_localVariations[0]);
525  m_loc1phi[recStep] = parabolicInterpolation(m_loc1phi[recStep-1],m_loc1phi[recStep-2],m_loc1phi[recStep-3],
526  m_angularVariations[2], m_angularVariations[1], m_angularVariations[0]);
527  m_loc1theta[recStep] = parabolicInterpolation(m_loc1theta[recStep-1],m_loc1theta[recStep-2],m_loc1theta[recStep-3],
528  m_angularVariations[2], m_angularVariations[1], m_angularVariations[0]);
529  m_loc1qop[recStep] = parabolicInterpolation(m_loc1qop[recStep-1],m_loc1qop[recStep-2],m_loc1qop[recStep-3],
530  m_qOpVariations[2], m_qOpVariations[1], m_qOpVariations[0]);
531  m_loc1steps[recStep] = 1;
532  // dL2
533  m_loc2loc1[recStep] = parabolicInterpolation(m_loc2loc1[recStep-1],m_loc2loc1[recStep-2],m_loc2loc1[recStep-3],
534  m_localVariations[2], m_localVariations[1], m_localVariations[0]);
535  m_loc2loc2[recStep] = parabolicInterpolation(m_loc2loc2[recStep-1],m_loc2loc2[recStep-2],m_loc2loc2[recStep-3],
536  m_localVariations[2], m_localVariations[1], m_localVariations[0]);
537  m_loc2phi[recStep] = parabolicInterpolation(m_loc2phi[recStep-1],m_loc2phi[recStep-2],m_loc2phi[recStep-3],
538  m_angularVariations[2], m_angularVariations[1], m_angularVariations[0]);
539  m_loc2theta[recStep] = parabolicInterpolation(m_loc2theta[recStep-1],m_loc2theta[recStep-2],m_loc2theta[recStep-3],
540  m_angularVariations[2], m_angularVariations[1], m_angularVariations[0]);
541  m_loc2qop[recStep] = parabolicInterpolation(m_loc2qop[recStep-1],m_loc2qop[recStep-2],m_loc2qop[recStep-3],
542  m_qOpVariations[2], m_qOpVariations[1], m_qOpVariations[0]);
543  m_loc2steps[recStep] = 1;
544  // dPhi
545  m_philoc1[recStep] = parabolicInterpolation(m_philoc1[recStep-1],m_philoc1[recStep-2],m_philoc1[recStep-3],
546  m_localVariations[2], m_localVariations[1], m_localVariations[0]);
547  m_philoc2[recStep] = parabolicInterpolation(m_philoc2[recStep-1],m_philoc2[recStep-2],m_philoc2[recStep-3],
548  m_localVariations[2], m_localVariations[1], m_localVariations[0]);
549  m_phiphi[recStep] = parabolicInterpolation(m_phiphi[recStep-1],m_phiphi[recStep-2],m_phiphi[recStep-3],
550  m_angularVariations[2], m_angularVariations[1], m_angularVariations[0]);
551  m_phitheta[recStep] = parabolicInterpolation(m_phitheta[recStep-1],m_phitheta[recStep-2],m_phitheta[recStep-3],
552  m_angularVariations[2], m_angularVariations[1], m_angularVariations[0]);
553  m_phiqop[recStep] = parabolicInterpolation(m_phiqop[recStep-1],m_phiqop[recStep-2],m_phiqop[recStep-3],
554  m_qOpVariations[2], m_qOpVariations[1], m_qOpVariations[0]);
555  m_phisteps[recStep] = 1;
556  // dTheta
557  m_thetaloc1[recStep] = parabolicInterpolation(m_thetaloc1[recStep-1],m_thetaloc1[recStep-2],m_thetaloc1[recStep-3],
558  m_localVariations[2], m_localVariations[1], m_localVariations[0]);
559  m_thetaloc2[recStep] = parabolicInterpolation(m_thetaloc2[recStep-1],m_thetaloc2[recStep-2],m_thetaloc2[recStep-3],
560  m_localVariations[2], m_localVariations[1], m_localVariations[0]);
561  m_thetaphi[recStep] = parabolicInterpolation(m_thetaphi[recStep-1],m_thetaphi[recStep-2],m_thetaphi[recStep-3],
562  m_angularVariations[2], m_angularVariations[1], m_angularVariations[0]);
563  m_thetatheta[recStep] = parabolicInterpolation(m_thetatheta[recStep-1],m_thetatheta[recStep-2],m_thetatheta[recStep-3],
564  m_angularVariations[2], m_angularVariations[1], m_angularVariations[0]);
565  m_thetaqop[recStep] = parabolicInterpolation(m_thetaqop[recStep-1],m_thetaqop[recStep-2],m_thetaqop[recStep-3],
566  m_qOpVariations[2], m_qOpVariations[1], m_qOpVariations[0]);
567  m_thetasteps[recStep] = 1;
568  // dTheta
569  m_qoploc1[recStep] = parabolicInterpolation(m_qoploc1[recStep-1],m_qoploc1[recStep-2],m_qoploc1[recStep-3],
570  m_localVariations[2], m_localVariations[1], m_localVariations[0]);
571  m_qoploc2[recStep] = parabolicInterpolation(m_qoploc2[recStep-1],m_qoploc2[recStep-2],m_qoploc2[recStep-3],
572  m_localVariations[2], m_localVariations[1], m_localVariations[0]);
573  m_qopphi[recStep] = parabolicInterpolation(m_qopphi[recStep-1],m_qopphi[recStep-2],m_qopphi[recStep-3],
574  m_angularVariations[2], m_angularVariations[1], m_angularVariations[0]);
575  m_qoptheta[recStep] = parabolicInterpolation(m_qoptheta[recStep-1],m_qoptheta[recStep-2],m_qoptheta[recStep-3],
576  m_angularVariations[2], m_angularVariations[1], m_angularVariations[0]);
577  m_qopqop[recStep] = parabolicInterpolation(m_qopqop[recStep-1],m_qopqop[recStep-2],m_qopqop[recStep-3],
578  m_qOpVariations[2], m_qOpVariations[1], m_qOpVariations[0]);
579  m_qopsteps[recStep] = 1;
580 
581  currentStepJacobian(0,0)= m_loc1loc1[recStep];
582  currentStepJacobian(0,1)= m_loc1loc2[recStep];
583  currentStepJacobian(0,2)= m_loc1phi[recStep];
584  currentStepJacobian(0,3)= m_loc1theta[recStep];
585  currentStepJacobian(0,4)= m_loc1qop[recStep];
586 
587  currentStepJacobian(1,0)= m_loc2loc1[recStep];
588  currentStepJacobian(1,1)= m_loc2loc2[recStep];
589  currentStepJacobian(1,2)= m_loc2phi[recStep];
590  currentStepJacobian(1,3)= m_loc2theta[recStep];
591  currentStepJacobian(1,4)= m_loc2qop[recStep];
592 
593  currentStepJacobian(2,0)= m_philoc1[recStep];
594  currentStepJacobian(2,1)= m_philoc2[recStep];
595  currentStepJacobian(2,2)= m_phiphi[recStep];
596  currentStepJacobian(2,3)= m_phitheta[recStep];
597  currentStepJacobian(2,4)= m_phiqop[recStep];
598 
599  currentStepJacobian(3,0)= m_thetaloc1[recStep];
600  currentStepJacobian(3,1)= m_thetaloc2[recStep];
601  currentStepJacobian(3,2)= m_thetaphi[recStep];
602  currentStepJacobian(3,3)= m_thetatheta[recStep];
603  currentStepJacobian(3,4)= m_thetaqop[recStep];
604 
605  currentStepJacobian(4,0)= m_qoploc1[recStep];
606  currentStepJacobian(4,1)= m_qoploc2[recStep];
607  currentStepJacobian(4,2)= m_qopphi[recStep];
608  currentStepJacobian(4,3)= m_qoptheta[recStep];
609  currentStepJacobian(4,4)= m_qopqop[recStep];
610 
611  }
612 
613  ATH_MSG_DEBUG( "Interpolated TransportJacobian : " << currentStepJacobian );
614  ++recStep;
615 
616 
617  // now fill the results
618  TransportJacobian diffMatrix(transportJacobian-currentStepJacobian);
619 
620  ATH_MSG_VERBOSE( "Absolute Differences of the TransportJacobian : " << diffMatrix );
621 
622  // Absolute differences ----------------------------------------------------
623  // (A1)
624  // fill the differences into the last one log (loc1)
625  m_loc1loc1[recStep] = diffMatrix(0,0);
626  m_loc1loc2[recStep] = diffMatrix(0,1);
627  m_loc1phi[recStep] = diffMatrix(0,2);
628  m_loc1theta[recStep] = diffMatrix(0,3);
629  m_loc1qop[recStep] = diffMatrix(0,4);
630  m_loc1steps[recStep] = 2;
631  // fill the differences into the last one log (loc2)
632  m_loc2loc1[recStep] = diffMatrix(1,0);
633  m_loc2loc2[recStep] = diffMatrix(1,1);
634  m_loc2phi[recStep] = diffMatrix(1,2);
635  m_loc2theta[recStep] = diffMatrix(1,3);
636  m_loc2qop[recStep] = diffMatrix(1,4);
637  m_loc2steps[recStep] = 2;
638  // fill the differences into the last one log (phi)
639  m_philoc1[recStep] = diffMatrix(2,0);
640  m_philoc2[recStep] = diffMatrix(2,1);
641  m_phiphi[recStep] = diffMatrix(2,2);
642  m_phitheta[recStep] = diffMatrix(2,3);
643  m_phiqop[recStep] = diffMatrix(2,4);
644  m_phisteps[recStep] = 2;
645  // fill the differences into the last one log (theta)
646  m_thetaloc1[recStep] = diffMatrix(3,0);
647  m_thetaloc2[recStep] = diffMatrix(3,1);
648  m_thetaphi[recStep] = diffMatrix(3,2);
649  m_thetatheta[recStep] = diffMatrix(3,3);
650  m_thetaqop[recStep] = diffMatrix(3,4);
651  m_thetasteps[recStep] = 2;
652  // fill the differences into the last one log (qop)
653  m_qoploc1[recStep] = diffMatrix(4,0);
654  m_qoploc2[recStep] = diffMatrix(4,1);
655  m_qopphi[recStep] = diffMatrix(4,2);
656  m_qoptheta[recStep] = diffMatrix(4,3);
657  m_qopqop[recStep] = diffMatrix(4,4);
658  m_qopsteps[recStep] = 2;
659  ++recStep;
660 
661  // (A2)
662  if (recStep > 1){
663  // fill the differences into the last one log (loc1)
664  m_loc1loc1[recStep] = std::abs(m_loc1loc1[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc1loc1[recStep-1] )) : 0.;
665  m_loc1loc2[recStep] = std::abs(m_loc1loc2[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc1loc2[recStep-1] )) : 0.;
666  m_loc1phi[recStep] = std::abs(m_loc1phi[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc1phi[recStep-1] )) : 0.;
667  m_loc1theta[recStep] = std::abs(m_loc1theta[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc1theta[recStep-1])) : 0.;
668  m_loc1qop[recStep] = std::abs(m_loc1qop[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc1qop[recStep-1] )) : 0.;
669  m_loc1steps[recStep] = 3;
670  // fill the differences into the last one log (loc2)
671  m_loc2loc1[recStep] = std::abs(m_loc2loc1[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc2loc1[recStep-1] )) : 0.;
672  m_loc2loc2[recStep] = std::abs(m_loc2loc2[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc2loc2[recStep-1] )) : 0.;
673  m_loc2phi[recStep] = std::abs(m_loc2phi[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc2phi[recStep-1] )) : 0.;
674  m_loc2theta[recStep] = std::abs(m_loc2theta[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc2theta[recStep-1])) : 0.;
675  m_loc2qop[recStep] = std::abs(m_loc2qop[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc2qop[recStep-1] )) : 0.;
676  m_loc2steps[recStep] = 3;
677  // fill the differences into the last one log (phi)
678  m_philoc1[recStep] = std::abs(m_philoc1[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_philoc1[recStep-1] )) : 0.;
679  m_philoc2[recStep] = std::abs(m_philoc2[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_philoc2[recStep-1] )) : 0.;
680  m_phiphi[recStep] = std::abs(m_phiphi[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_phiphi[recStep-1] )) : 0.;
681  m_phitheta[recStep] = std::abs(m_phitheta[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_phitheta[recStep-1])) : 0.;
682  m_phiqop[recStep] = std::abs(m_phiqop[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_phiqop[recStep-1] )) : 0.;
683  m_phisteps[recStep] = 3;
684  // fill the differences into the last one log (theta)
685  m_thetaloc1[recStep] = std::abs(m_thetaloc1[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_thetaloc1[recStep-1] )) : 0.;
686  m_thetaloc2[recStep] = std::abs(m_thetaloc2[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_thetaloc2[recStep-1] )) : 0.;
687  m_thetaphi[recStep] = std::abs(m_thetaphi[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_thetaphi[recStep-1] )) : 0.;
688  m_thetatheta[recStep] = std::abs(m_thetatheta[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_thetatheta[recStep-1])) : 0.;
689  m_thetaqop[recStep] = std::abs(m_thetaqop[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_thetaqop[recStep-1] )) : 0.;
690  m_thetasteps[recStep] = 3;
691  // fill the differences into the last one log (qop)
692  m_qoploc1[recStep] = std::abs(m_qoploc1[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_qoploc1[recStep-1] )) : 0.;
693  m_qoploc2[recStep] = std::abs(m_qoploc2[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_qoploc2[recStep-1] )) : 0.;
694  m_qopphi[recStep] = std::abs(m_qopphi[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_qopphi[recStep-1] )) : 0.;
695  m_qoptheta[recStep] = std::abs(m_qoptheta[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_qoptheta[recStep-1])) : 0.;
696  m_qopqop[recStep] = std::abs(m_qopqop[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_qopqop[recStep-1] )) : 0.;
697  m_qopsteps[recStep] = 3;
698  }
699  ++recStep;
700 
701 
702  // Relative differences) ----------------------------------------------------
703  // (R1)
704  // fill the differences into the last one log (loc1)
705  m_loc1loc1[recStep] = std::abs((transportJacobian)(0,0)) > 1e-50 ? diffMatrix(0,0)/((transportJacobian)(0,0)) : 0.;
706  m_loc1loc2[recStep] = std::abs((transportJacobian)(0,1)) > 1e-50 ? diffMatrix(0,1)/((transportJacobian)(0,1)) : 0.;
707  m_loc1phi[recStep] = std::abs((transportJacobian)(0,2)) > 1e-50 ? diffMatrix(0,2)/((transportJacobian)(0,2)) : 0.;
708  m_loc1theta[recStep] = std::abs((transportJacobian)(0,3)) > 1e-50 ? diffMatrix(0,3)/((transportJacobian)(0,3)) : 0.;
709  m_loc1qop[recStep] = std::abs((transportJacobian)(0,4)) > 1e-50 ? diffMatrix(0,4)/((transportJacobian)(0,4)) : 0.;
710  m_loc1steps[recStep] = 4;
711  // fill the differences into the last one log (loc2)
712  m_loc2loc1[recStep] = std::abs((transportJacobian)(1,0)) > 1e-50 ? diffMatrix(1,0)/((transportJacobian)(1,0)) : 0.;
713  m_loc2loc2[recStep] = std::abs((transportJacobian)(1,1)) > 1e-50 ? diffMatrix(1,1)/((transportJacobian)(1,1)) : 0.;
714  m_loc2phi[recStep] = std::abs((transportJacobian)(1,2)) > 1e-50 ? diffMatrix(1,2)/((transportJacobian)(1,2)) : 0.;
715  m_loc2theta[recStep] = std::abs((transportJacobian)(1,3)) > 1e-50 ? diffMatrix(1,3)/((transportJacobian)(1,3)) : 0.;
716  m_loc2qop[recStep] = std::abs((transportJacobian)(1,4)) > 1e-50 ? diffMatrix(1,4)/((transportJacobian)(1,4)) : 0.;
717  m_loc2steps[recStep] = 4;
718  // fill the differences into the last one log (phi)
719  m_philoc1[recStep] = std::abs((transportJacobian)(2,0)) > 1e-50 ? diffMatrix(2,0)/((transportJacobian)(2,0)) : 0.;
720  m_philoc2[recStep] = std::abs((transportJacobian)(2,1)) > 1e-50 ? diffMatrix(2,1)/((transportJacobian)(2,1)) : 0.;
721  m_phiphi[recStep] = std::abs((transportJacobian)(2,2)) > 1e-50 ? diffMatrix(2,2)/((transportJacobian)(2,2)) : 0.;
722  m_phitheta[recStep] = std::abs((transportJacobian)(2,3)) > 1e-50 ? diffMatrix(2,3)/((transportJacobian)(2,3)) : 0.;
723  m_phiqop[recStep] = std::abs((transportJacobian)(2,4)) > 1e-50 ? diffMatrix(2,4)/((transportJacobian)(2,4)) : 0.;
724  m_phisteps[recStep] = 4;
725  // fill the differences into the last one log (theta)
726  m_thetaloc1[recStep] = std::abs((transportJacobian)(3,0)) > 1e-50 ? diffMatrix(3,0)/((transportJacobian)(3,0)) : 0.;
727  m_thetaloc2[recStep] = std::abs((transportJacobian)(3,1)) > 1e-50 ? diffMatrix(3,1)/((transportJacobian)(3,1)) : 0.;
728  m_thetaphi[recStep] = std::abs((transportJacobian)(3,2)) > 1e-50 ? diffMatrix(3,2)/((transportJacobian)(3,2)) : 0.;
729  m_thetatheta[recStep] = std::abs((transportJacobian)(3,3)) > 1e-50 ? diffMatrix(3,3)/((transportJacobian)(3,3)) : 0.;
730  m_thetaqop[recStep] = std::abs((transportJacobian)(3,4)) > 1e-50 ? diffMatrix(3,4)/((transportJacobian)(3,4)) : 0.;
731  m_thetasteps[recStep] = 4;
732  // fill the differences into the last one log (qop)
733  m_qoploc1[recStep] = std::abs((transportJacobian)(4,0)) > 1e-50 ? diffMatrix(4,0)/((transportJacobian)(4,0)) : 0.;
734  m_qoploc2[recStep] = std::abs((transportJacobian)(4,1)) > 1e-50 ? diffMatrix(4,1)/((transportJacobian)(4,1)) : 0.;
735  m_qopphi[recStep] = std::abs((transportJacobian)(4,2)) > 1e-50 ? diffMatrix(4,2)/((transportJacobian)(4,2)) : 0.;
736  m_qoptheta[recStep] = std::abs((transportJacobian)(4,3)) > 1e-50 ? diffMatrix(4,3)/((transportJacobian)(4,3)) : 0.;
737  m_qopqop[recStep] = std::abs((transportJacobian)(4,4)) > 1e-50 ? diffMatrix(4,4)/((transportJacobian)(4,4)) : 0.;
738  m_qopsteps[recStep] = 4;
739  ++recStep;
740 
741  // (R2)
742  // Relative differences ----------------------------------------------------
743  m_loc1loc1[recStep] = std::abs(m_loc1loc1[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc1loc1[recStep-1] )) : 0.;
744  m_loc1loc2[recStep] = std::abs(m_loc1loc2[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc1loc2[recStep-1] )) : 0.;
745  m_loc1phi[recStep] = std::abs(m_loc1phi[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc1phi[recStep-1] )) : 0.;
746  m_loc1theta[recStep] = std::abs(m_loc1theta[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc1theta[recStep-1])) : 0.;
747  m_loc1qop[recStep] = std::abs(m_loc1qop[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc1qop[recStep-1] )) : 0.;
748  m_loc1steps[recStep] = 5;
749  // fill the differences into the last one log (loc2)
750  m_loc2loc1[recStep] = std::abs(m_loc2loc1[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc2loc1[recStep-1] )) : 0.;
751  m_loc2loc2[recStep] = std::abs(m_loc2loc2[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc2loc2[recStep-1] )) : 0.;
752  m_loc2phi[recStep] = std::abs(m_loc2phi[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc2phi[recStep-1] )) : 0.;
753  m_loc2theta[recStep] = std::abs(m_loc2theta[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc2theta[recStep-1])) : 0.;
754  m_loc2qop[recStep] = std::abs(m_loc2qop[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_loc2qop[recStep-1] )) : 0.;
755  m_loc2steps[recStep] = 5;
756  // fill the differences into the last one log (phi)
757  m_philoc1[recStep] = std::abs(m_philoc1[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_philoc1[recStep-1] )) : 0.;
758  m_philoc2[recStep] = std::abs(m_philoc2[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_philoc2[recStep-1] )) : 0.;
759  m_phiphi[recStep] = std::abs(m_phiphi[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_phiphi[recStep-1] )) : 0.;
760  m_phitheta[recStep] = std::abs(m_phitheta[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_phitheta[recStep-1])) : 0.;
761  m_phiqop[recStep] = std::abs(m_phiqop[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_phiqop[recStep-1] )) : 0.;
762  m_phisteps[recStep] = 5;
763  // fill the differences into the last one log (theta)
764  m_thetaloc1[recStep] = std::abs(m_thetaloc1[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_thetaloc1[recStep-1] )) : 0.;
765  m_thetaloc2[recStep] = std::abs(m_thetaloc2[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_thetaloc2[recStep-1] )) : 0.;
766  m_thetaphi[recStep] = std::abs(m_thetaphi[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_thetaphi[recStep-1] )) : 0.;
767  m_thetatheta[recStep] = std::abs(m_thetatheta[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_thetatheta[recStep-1])) : 0.;
768  m_thetaqop[recStep] = std::abs(m_thetaqop[recStep-1] ) > 1e-50 ? -std::log10(std::abs(m_thetaqop[recStep-1] )) : 0.;
769  m_thetasteps[recStep] = 5;
770  // fill the differences into the last one log (qop)
771  m_qoploc1[recStep] = std::abs(m_qoploc1[recStep-1] ) > 1e-50 ? -std::log10( std::abs(m_qoploc1[recStep-1] ) ): 0.;
772  m_qoploc2[recStep] = std::abs(m_qoploc2[recStep-1] ) > 1e-50 ? -std::log10( std::abs(m_qoploc2[recStep-1] ) ): 0.;
773  m_qopphi[recStep] = std::abs(m_qopphi[recStep-1] ) > 1e-50 ? -std::log10( std::abs(m_qopphi[recStep-1] ) ): 0.;
774  m_qoptheta[recStep] = std::abs(m_qoptheta[recStep-1] ) > 1e-50 ? -std::log10( std::abs(m_qoptheta[recStep-1]) ): 0.;
775  m_qopqop[recStep] = std::abs(m_qopqop[recStep-1] ) > 1e-50 ? -std::log10( std::abs(m_qopqop[recStep-1] ) ): 0.;
776  m_qopsteps[recStep] = 5;
777  ++recStep;
778 
779  m_steps = recStep;
780  m_validationTree->Fill();
781  }
782 
783  // Code entered here will be executed once per event
784  return StatusCode::SUCCESS;
785 }

◆ extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< Algorithm > >::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

◆ extraOutputDeps()

const DataObjIDColl & AthAlgorithm::extraOutputDeps ( ) const
overridevirtualinherited

Return the list of extra output dependencies.

This list is extended to include symlinks implied by inheritance relations.

Definition at line 50 of file AthAlgorithm.cxx.

51 {
52  // If we didn't find any symlinks to add, just return the collection
53  // from the base class. Otherwise, return the extended collection.
54  if (!m_extendedExtraObjects.empty()) {
55  return m_extendedExtraObjects;
56  }
57  return Algorithm::extraOutputDeps();
58 }

◆ finalize()

StatusCode Trk::RiddersAlgorithm::finalize ( )

standard Athena-Algorithm method

Definition at line 129 of file RiddersAlgorithm.cxx.

130 {
131  // Code entered here will be executed once at the end of the program run.
132  return StatusCode::SUCCESS;
133 }

◆ initialize()

StatusCode Trk::RiddersAlgorithm::initialize ( )

standard Athena-Algorithm method

Definition at line 39 of file RiddersAlgorithm.cxx.

40 {
41  // Code entered here will be executed once at program start.
42  ATH_MSG_INFO( " initialize()" );
43 
44  ATH_CHECK( m_propagator.retrieve() );
45 
46  // Prepare the magnetic field properties
47  if (!m_useCustomField)
48  m_magFieldProperties = new Trk::MagneticFieldProperties();
49  else {
50  // the field
51  Amg::Vector3D bField(0.,0.,m_fieldValue);
52  // create the custom magnetic field
53  m_magFieldProperties = new Trk::MagneticFieldProperties(bField);
54  }
55 
56  // intialize the random number generators
57  m_gaussDist = new Rndm::Numbers(randSvc(), Rndm::Gauss(0.,1.));
58  m_flatDist = new Rndm::Numbers(randSvc(), Rndm::Flat(0.,1.));
59 
60 
61  // create the new Tree
62  m_validationTree = new TTree(m_validationTreeName.value().c_str(),
63  m_validationTreeDescription.value().c_str());
64 
65  // the branches for the start
66  m_validationTree->Branch("RiddersSteps", &m_steps, "steps/I");
67  // loc 1
68  m_validationTree->Branch("Loc1Loc1", m_loc1loc1, "loc1loc1[steps]/F");
69  m_validationTree->Branch("Loc1Loc2", m_loc1loc2, "loc1loc2[steps]/F");
70  m_validationTree->Branch("Loc1Phi", m_loc1phi, "loc1phi[steps]/F");
71  m_validationTree->Branch("Loc1Theta", m_loc1theta, "loc1theta[steps]/F");
72  m_validationTree->Branch("Loc1qOp", m_loc1qop, "loc1qop[steps]/F");
73  m_validationTree->Branch("Loc1Steps", m_loc1steps, "loc1steps[steps]/F");
74  // loc 2
75  m_validationTree->Branch("Loc2Loc1", m_loc2loc1, "loc2loc1[steps]/F");
76  m_validationTree->Branch("Loc2Loc2", m_loc2loc2, "loc2loc2[steps]/F");
77  m_validationTree->Branch("Loc2Phi", m_loc2phi, "loc2phi[steps]/F");
78  m_validationTree->Branch("Loc2Theta", m_loc2theta, "loc2theta[steps]/F");
79  m_validationTree->Branch("Loc2qOp", m_loc2qop, "loc2qop[steps]/F");
80  m_validationTree->Branch("Loc2Steps", m_loc2steps, "loc2steps[steps]/F");
81  // phi
82  m_validationTree->Branch("PhiLoc1", m_philoc1, "philoc1[steps]/F");
83  m_validationTree->Branch("PhiLoc2", m_philoc2 , "philoc2[steps]/F");
84  m_validationTree->Branch("PhiPhi", m_phiphi, "phiphi[steps]/F");
85  m_validationTree->Branch("PhiTheta", m_phitheta, "phitheta[steps]/F");
86  m_validationTree->Branch("PhiqOp", m_phiqop, "phiqop[steps]/F");
87  m_validationTree->Branch("PhiSteps", m_phisteps, "phisteps[steps]/F");
88  // Theta
89  m_validationTree->Branch("ThetaLoc1", m_thetaloc1, "thetaloc1[steps]/F");
90  m_validationTree->Branch("ThetaLoc2", m_thetaloc2, "thetaloc2[steps]/F");
91  m_validationTree->Branch("ThetaPhi", m_thetaphi, "thetaphi[steps]/F");
92  m_validationTree->Branch("ThetaTheta", m_thetatheta, "thetatheta[steps]/F");
93  m_validationTree->Branch("ThetaqOp", m_thetaqop, "thetaqop[steps]/F");
94  m_validationTree->Branch("ThetaSteps", m_thetasteps, "thetasteps[steps]/F");
95  // Qop
96  m_validationTree->Branch("QopLoc1", m_qoploc1, "qoploc1[steps]/F");
97  m_validationTree->Branch("QopLoc2", m_qoploc2, "qoploc2[steps]/F");
98  m_validationTree->Branch("QopPhi", m_qopphi, "qopphi[steps]/F");
99  m_validationTree->Branch("QopTheta", m_qoptheta, "qoptheta[steps]/F");
100  m_validationTree->Branch("QopqOp", m_qopqop, "qopqop[steps]/F");
101  m_validationTree->Branch("QopSteps", m_qopsteps, "qopsteps[steps]/F");
102 
103  // now register the Tree
104  SmartIF<ITHistSvc> tHistSvc{service("THistSvc")};
105  if (!tHistSvc){
106  ATH_MSG_ERROR( "initialize() Could not find Hist Service -> Switching ValidationMode Off !" );
107  delete m_validationTree; m_validationTree = nullptr;
108  }
109  if ((tHistSvc->regTree(m_validationTreeFolder, m_validationTree)).isFailure()) {
110  ATH_MSG_ERROR( "initialize() Could not register the validation Tree -> Switching ValidationMode Off !" );
111  delete m_validationTree; m_validationTree = nullptr;
112  }
113 
114  if (m_localVariations.empty())
115  m_localVariations = {0.01, 0.001, 0.0001};
116 
117  if (m_angularVariations.empty())
118  m_angularVariations = {0.01, 0.001, 0.0001};
119 
120  if (m_qOpVariations.empty())
121  m_qOpVariations = {0.0001, 0.00001, 0.000001};
122 
123  ATH_MSG_INFO( "initialize() successful in " );
124  return StatusCode::SUCCESS;
125 }

◆ inputHandles()

virtual std::vector<Gaudi::DataHandle*> AthCommonDataStore< AthCommonMsg< Algorithm > >::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.

◆ msg() [1/2]

MsgStream& AthCommonMsg< Algorithm >::msg ( ) const
inlineinherited

Definition at line 24 of file AthCommonMsg.h.

24  {
25  return this->msgStream();
26  }

◆ msg() [2/2]

MsgStream& AthCommonMsg< Algorithm >::msg ( const MSG::Level  lvl) const
inlineinherited

Definition at line 27 of file AthCommonMsg.h.

27  {
28  return this->msgStream(lvl);
29  }

◆ msgLvl()

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

Definition at line 30 of file AthCommonMsg.h.

30  {
31  return this->msgLevel(lvl);
32  }

◆ outputHandles()

virtual std::vector<Gaudi::DataHandle*> AthCommonDataStore< AthCommonMsg< Algorithm > >::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.

◆ parabolicInterpolation()

double Trk::RiddersAlgorithm::parabolicInterpolation ( double  y0,
double  y1,
double  y2,
double  x0,
double  x1,
double  x2 
)
staticprivate

Langrange-parabolic interpolation.

Definition at line 818 of file RiddersAlgorithm.cxx.

820 {
821  double Z0 = x1*x2*y0;
822  double Z1 = x0*x2*y1;
823  double Z2 = x0*x1*y2;
824  double N0 = (x0-x1)*(x0-x2);
825  double N1 = (x1-x2)*(x1-x0);
826  double N2 = (x2-x0)*(x2-x1);
827  return Z0/N0 + Z1/N1 + Z2/N2;
828 }

◆ 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< Algorithm > >::renounce ( T &  h)
inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

381  {
382  h.renounce();
383  PBASE::renounce (h);
384  }

◆ renounceArray()

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

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

364  {
365  handlesArray.renounce();
366  }

◆ sysInitialize()

StatusCode AthAlgorithm::sysInitialize ( )
overridevirtualinherited

Override sysInitialize.

Override sysInitialize from the base class.

Loop through all output handles, and if they're WriteCondHandles, automatically register them and this Algorithm with the CondSvc

Scan through all outputHandles, and if they're WriteCondHandles, register them with the CondSvc

Reimplemented from AthCommonDataStore< AthCommonMsg< Algorithm > >.

Reimplemented in AthAnalysisAlgorithm, AthFilterAlgorithm, PyAthena::Alg, and AthHistogramAlgorithm.

Definition at line 66 of file AthAlgorithm.cxx.

66  {
67  StatusCode sc=AthCommonDataStore<AthCommonMsg<Algorithm>>::sysInitialize();
68 
69  if (sc.isFailure()) {
70  return sc;
71  }
72  ServiceHandle<ICondSvc> cs("CondSvc",name());
73  for (auto h : outputHandles()) {
74  if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
75  // do this inside the loop so we don't create the CondSvc until needed
76  if ( cs.retrieve().isFailure() ) {
77  ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
78  return StatusCode::SUCCESS;
79  }
80  if (cs->regHandle(this,*h).isFailure()) {
81  sc = StatusCode::FAILURE;
82  ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
83  << " with CondSvc");
84  }
85  }
86  }
87  return sc;
88 }

◆ sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< Algorithm > >::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< Algorithm > >::updateVHKA ( Gaudi::Details::PropertyBase &  )
inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

308  {
309  // debug() << "updateVHKA for property " << p.name() << " " << p.toString()
310  // << " size: " << m_vhka.size() << endmsg;
311  for (auto &a : m_vhka) {
312  std::vector<SG::VarHandleKey*> keys = a->keys();
313  for (auto k : keys) {
314  k->setOwner(this);
315  }
316  }
317  }

Member Data Documentation

◆ m_angularVariations

DoubleArrayProperty Trk::RiddersAlgorithm::m_angularVariations {this, "AngularVariations", {}}
private

Definition at line 97 of file RiddersAlgorithm.h.

◆ m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Algorithm > >::m_detStore
privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

◆ m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Algorithm > >::m_evtStore
privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

◆ m_extendedExtraObjects

DataObjIDColl AthAlgorithm::m_extendedExtraObjects
privateinherited

Definition at line 79 of file AthAlgorithm.h.

◆ m_fieldValue

DoubleProperty Trk::RiddersAlgorithm::m_fieldValue {this, "CustomFieldValue", 2.*Gaudi::Units::tesla}
private

Definition at line 73 of file RiddersAlgorithm.h.

◆ m_flatDist

Rndm::Numbers* Trk::RiddersAlgorithm::m_flatDist = nullptr
private

Definition at line 151 of file RiddersAlgorithm.h.

◆ m_gaussDist

Rndm::Numbers* Trk::RiddersAlgorithm::m_gaussDist = nullptr
private

Random Number setup.

Definition at line 150 of file RiddersAlgorithm.h.

◆ m_loc1loc1

float Trk::RiddersAlgorithm::m_loc1loc1[RIDDLERSSTEPS] {}
private

Definition at line 113 of file RiddersAlgorithm.h.

◆ m_loc1loc2

float Trk::RiddersAlgorithm::m_loc1loc2[RIDDLERSSTEPS] {}
private

Definition at line 114 of file RiddersAlgorithm.h.

◆ m_loc1phi

float Trk::RiddersAlgorithm::m_loc1phi[RIDDLERSSTEPS] {}
private

Definition at line 115 of file RiddersAlgorithm.h.

◆ m_loc1qop

float Trk::RiddersAlgorithm::m_loc1qop[RIDDLERSSTEPS] {}
private

Definition at line 117 of file RiddersAlgorithm.h.

◆ m_loc1steps

float Trk::RiddersAlgorithm::m_loc1steps[RIDDLERSSTEPS] {}
private

Definition at line 118 of file RiddersAlgorithm.h.

◆ m_loc1theta

float Trk::RiddersAlgorithm::m_loc1theta[RIDDLERSSTEPS] {}
private

Definition at line 116 of file RiddersAlgorithm.h.

◆ m_loc2loc1

float Trk::RiddersAlgorithm::m_loc2loc1[RIDDLERSSTEPS] {}
private

Definition at line 120 of file RiddersAlgorithm.h.

◆ m_loc2loc2

float Trk::RiddersAlgorithm::m_loc2loc2[RIDDLERSSTEPS] {}
private

Definition at line 121 of file RiddersAlgorithm.h.

◆ m_loc2phi

float Trk::RiddersAlgorithm::m_loc2phi[RIDDLERSSTEPS] {}
private

Definition at line 122 of file RiddersAlgorithm.h.

◆ m_loc2qop

float Trk::RiddersAlgorithm::m_loc2qop[RIDDLERSSTEPS] {}
private

Definition at line 124 of file RiddersAlgorithm.h.

◆ m_loc2steps

float Trk::RiddersAlgorithm::m_loc2steps[RIDDLERSSTEPS] {}
private

Definition at line 125 of file RiddersAlgorithm.h.

◆ m_loc2theta

float Trk::RiddersAlgorithm::m_loc2theta[RIDDLERSSTEPS] {}
private

Definition at line 123 of file RiddersAlgorithm.h.

◆ m_localVariations

DoubleArrayProperty Trk::RiddersAlgorithm::m_localVariations {this, "LocalVariations", {}}
private

variations

Definition at line 96 of file RiddersAlgorithm.h.

◆ m_magFieldProperties

MagneticFieldProperties* Trk::RiddersAlgorithm::m_magFieldProperties = nullptr
private

Definition at line 75 of file RiddersAlgorithm.h.

◆ m_maxEta

DoubleProperty Trk::RiddersAlgorithm::m_maxEta {this, "StartPerigeeMaxEta", 2.5}
private

Definition at line 85 of file RiddersAlgorithm.h.

◆ m_maximumR

DoubleProperty Trk::RiddersAlgorithm::m_maximumR {this, "TargetSurfaceMaxR", 1000.}
private

Definition at line 93 of file RiddersAlgorithm.h.

◆ m_maxP

DoubleProperty Trk::RiddersAlgorithm::m_maxP {this, "StartPerigeeMaxP", 50000*Gaudi::Units::GeV}
private

Definition at line 88 of file RiddersAlgorithm.h.

◆ m_maxPhi

DoubleProperty Trk::RiddersAlgorithm::m_maxPhi {this, "StartPerigeeMaxPhi", M_PI}
private

Definition at line 83 of file RiddersAlgorithm.h.

◆ m_minEta

DoubleProperty Trk::RiddersAlgorithm::m_minEta {this, "StartPerigeeMinEta", -2.5}
private

Definition at line 84 of file RiddersAlgorithm.h.

◆ m_minimumR

DoubleProperty Trk::RiddersAlgorithm::m_minimumR {this, "TargetSurfaceMinR", 10.}
private

To create the first extimations.

Definition at line 92 of file RiddersAlgorithm.h.

◆ m_minP

DoubleProperty Trk::RiddersAlgorithm::m_minP {this, "StartPerigeeMinP", 0.5*Gaudi::Units::GeV}
private

Definition at line 86 of file RiddersAlgorithm.h.

◆ m_minPhi

DoubleProperty Trk::RiddersAlgorithm::m_minPhi {this, "StartPerigeeMinPhi", -M_PI}
private

Definition at line 82 of file RiddersAlgorithm.h.

◆ m_philoc1

float Trk::RiddersAlgorithm::m_philoc1[RIDDLERSSTEPS] {}
private

Definition at line 127 of file RiddersAlgorithm.h.

◆ m_philoc2

float Trk::RiddersAlgorithm::m_philoc2[RIDDLERSSTEPS] {}
private

Definition at line 128 of file RiddersAlgorithm.h.

◆ m_phiphi

float Trk::RiddersAlgorithm::m_phiphi[RIDDLERSSTEPS] {}
private

Definition at line 129 of file RiddersAlgorithm.h.

◆ m_phiqop

float Trk::RiddersAlgorithm::m_phiqop[RIDDLERSSTEPS] {}
private

Definition at line 131 of file RiddersAlgorithm.h.

◆ m_phisteps

float Trk::RiddersAlgorithm::m_phisteps[RIDDLERSSTEPS] {}
private

Definition at line 132 of file RiddersAlgorithm.h.

◆ m_phitheta

float Trk::RiddersAlgorithm::m_phitheta[RIDDLERSSTEPS] {}
private

Definition at line 130 of file RiddersAlgorithm.h.

◆ m_propagator

PublicToolHandle<IPropagator> Trk::RiddersAlgorithm::m_propagator {this, "Propagator", "Trk::RungeKuttaPropagator/RungeKuttaPropagator"}
private

member variables for algorithm properties:

Definition at line 69 of file RiddersAlgorithm.h.

◆ m_qoploc1

float Trk::RiddersAlgorithm::m_qoploc1[RIDDLERSSTEPS] {}
private

Definition at line 141 of file RiddersAlgorithm.h.

◆ m_qoploc2

float Trk::RiddersAlgorithm::m_qoploc2[RIDDLERSSTEPS] {}
private

Definition at line 142 of file RiddersAlgorithm.h.

◆ m_qopphi

float Trk::RiddersAlgorithm::m_qopphi[RIDDLERSSTEPS] {}
private

Definition at line 143 of file RiddersAlgorithm.h.

◆ m_qopqop

float Trk::RiddersAlgorithm::m_qopqop[RIDDLERSSTEPS] {}
private

Definition at line 145 of file RiddersAlgorithm.h.

◆ m_qopsteps

float Trk::RiddersAlgorithm::m_qopsteps[RIDDLERSSTEPS] {}
private

Definition at line 146 of file RiddersAlgorithm.h.

◆ m_qoptheta

float Trk::RiddersAlgorithm::m_qoptheta[RIDDLERSSTEPS] {}
private

Definition at line 144 of file RiddersAlgorithm.h.

◆ m_qOpVariations

DoubleArrayProperty Trk::RiddersAlgorithm::m_qOpVariations {this, "QopVariations", {}}
private

Definition at line 98 of file RiddersAlgorithm.h.

◆ m_sigmaLoc

DoubleProperty Trk::RiddersAlgorithm::m_sigmaLoc {this, "StartPerigeeSigmaLoc", 100.*Gaudi::Units::micrometer}
private

The smearing.

Definition at line 78 of file RiddersAlgorithm.h.

◆ m_sigmaR

DoubleProperty Trk::RiddersAlgorithm::m_sigmaR {this, "StartPerigeeSigmaR", 0.}
private

Definition at line 80 of file RiddersAlgorithm.h.

◆ m_steps

int Trk::RiddersAlgorithm::m_steps = 0
private

Definition at line 112 of file RiddersAlgorithm.h.

◆ m_thetaloc1

float Trk::RiddersAlgorithm::m_thetaloc1[RIDDLERSSTEPS] {}
private

Definition at line 134 of file RiddersAlgorithm.h.

◆ m_thetaloc2

float Trk::RiddersAlgorithm::m_thetaloc2[RIDDLERSSTEPS] {}
private

Definition at line 135 of file RiddersAlgorithm.h.

◆ m_thetaphi

float Trk::RiddersAlgorithm::m_thetaphi[RIDDLERSSTEPS] {}
private

Definition at line 136 of file RiddersAlgorithm.h.

◆ m_thetaqop

float Trk::RiddersAlgorithm::m_thetaqop[RIDDLERSSTEPS] {}
private

Definition at line 138 of file RiddersAlgorithm.h.

◆ m_thetasteps

float Trk::RiddersAlgorithm::m_thetasteps[RIDDLERSSTEPS] {}
private

Definition at line 139 of file RiddersAlgorithm.h.

◆ m_thetatheta

float Trk::RiddersAlgorithm::m_thetatheta[RIDDLERSSTEPS] {}
private

Definition at line 137 of file RiddersAlgorithm.h.

◆ m_useAlignedSurfaces

BooleanProperty Trk::RiddersAlgorithm::m_useAlignedSurfaces {this, "UseAlignedSurfaces", true}
private

Definition at line 72 of file RiddersAlgorithm.h.

◆ m_useCustomField

BooleanProperty Trk::RiddersAlgorithm::m_useCustomField {this, "UseCustomMagneticField", true}
private

Definition at line 71 of file RiddersAlgorithm.h.

◆ m_validationTree

TTree* Trk::RiddersAlgorithm::m_validationTree = nullptr
private

Root Validation Tree.

Definition at line 100 of file RiddersAlgorithm.h.

◆ m_validationTreeDescription

StringProperty Trk::RiddersAlgorithm::m_validationTreeDescription
private
Initial value:
{this, "ValidationTreeDescription", "Output of the RiddersAlgorithm",
"validation tree description - second argument in TTree"}

Definition at line 105 of file RiddersAlgorithm.h.

◆ m_validationTreeFolder

StringProperty Trk::RiddersAlgorithm::m_validationTreeFolder
private
Initial value:
{this, "ValidationTreeFolder", "/val/RiddersAlgorithm",
"stream/folder to for the TTree to be written out"}

Definition at line 108 of file RiddersAlgorithm.h.

◆ m_validationTreeName

StringProperty Trk::RiddersAlgorithm::m_validationTreeName
private
Initial value:
{this, "ValidationTreeName", "RiddersTree",
"validation tree name - to be acessed by this from root"}

Definition at line 102 of file RiddersAlgorithm.h.

◆ m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< Algorithm > >::m_varHandleArraysDeclared
privateinherited

Definition at line 399 of file AthCommonDataStore.h.

◆ m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< Algorithm > >::m_vhka
privateinherited

Definition at line 398 of file AthCommonDataStore.h.

The documentation for this class was generated from the following files:
Trk::RiddersAlgorithm::m_phisteps
float m_phisteps[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:132
Trk::RiddersAlgorithm::m_localVariations
DoubleArrayProperty m_localVariations
variations
Definition: RiddersAlgorithm.h:96
AllowedVariables::e
e
Definition: AsgElectronSelectorTool.cxx:37
Trk::y
@ y
Definition: ParamDefs.h:56
plotBeamSpotCompare.x1
x1
Definition: plotBeamSpotCompare.py:216
test_pyathena.eta
eta
Definition: test_pyathena.py:10
Trk::AmgMatrix
AmgMatrix(3, 3) NeutralParticleParameterCalculator
Definition: NeutralParticleParameterCalculator.cxx:233
dqt_zlumi_pandas.N2
N2
Definition: dqt_zlumi_pandas.py:325
Amg::VectorX
Eigen::Matrix< double, Eigen::Dynamic, 1 > VectorX
Dynamic Vector - dynamic allocation.
Definition: EventPrimitives.h:30
Trk::z
@ z
global position (cartesian)
Definition: ParamDefs.h:57
MuonR4::SegmentFit::Parameters
AmgVector(toInt(ParamDefs::nPars)) Parameters
Definition: MuonHoughDefs.h:48
Trk::MagneticFieldProperties
Definition: MagneticFieldProperties.h:31
ATH_MSG_INFO
#define ATH_MSG_INFO(x)
Definition: AthMsgStreamMacros.h:31
PlotCalibFromCool.zAxis
zAxis
Definition: PlotCalibFromCool.py:76
Trk::RiddersAlgorithm::m_thetaloc2
float m_thetaloc2[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:135
Trk::RiddersAlgorithm::m_maxEta
DoubleProperty m_maxEta
Definition: RiddersAlgorithm.h:85
Trk::RiddersAlgorithm::parabolicInterpolation
static double parabolicInterpolation(double y0, double y1, double y2, double x0, double x1, double x2)
Langrange-parabolic interpolation.
Definition: RiddersAlgorithm.cxx:818
AthCommonDataStore::declareProperty
Gaudi::Details::PropertyBase & declareProperty(Gaudi::Property< T > &t)
Definition: AthCommonDataStore.h:145
Trk::ParametersT
Dummy class used to allow special convertors to be called for surfaces owned by a detector element.
Definition: EMErrorDetail.h:25
Trk::RiddersAlgorithm::m_thetaphi
float m_thetaphi[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:136
Trk::RiddersAlgorithm::m_flatDist
Rndm::Numbers * m_flatDist
Definition: RiddersAlgorithm.h:151
plotBeamSpotCompare.x2
x2
Definition: plotBeamSpotCompare.py:218
Trk::RiddersAlgorithm::m_validationTreeDescription
StringProperty m_validationTreeDescription
Definition: RiddersAlgorithm.h:106
Trk::RiddersAlgorithm::m_maxP
DoubleProperty m_maxP
Definition: RiddersAlgorithm.h:89
M_PI
#define M_PI
Definition: ActiveFraction.h:11
AthCommonDataStore< AthCommonMsg< Algorithm > >::m_evtStore
StoreGateSvc_t m_evtStore
Pointer to StoreGate (event store by default)
Definition: AthCommonDataStore.h:390
AthCommonDataStore< AthCommonMsg< Algorithm > >::m_vhka
std::vector< SG::VarHandleKeyArray * > m_vhka
Definition: AthCommonDataStore.h:398
Trk::RiddersAlgorithm::m_sigmaR
DoubleProperty m_sigmaR
Definition: RiddersAlgorithm.h:81
Trk::loc2
@ loc2
generic first and second local coordinate
Definition: ParamDefs.h:35
Trk::alongMomentum
@ alongMomentum
Definition: PropDirection.h:20
Trk::RiddersAlgorithm::m_qoploc2
float m_qoploc2[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:142
read_hist_ntuple.t
t
Definition: read_hist_ntuple.py:5
drawFromPickle.cos
cos
Definition: drawFromPickle.py:36
ATH_MSG_VERBOSE
#define ATH_MSG_VERBOSE(x)
Definition: AthMsgStreamMacros.h:28
Trk::RiddersAlgorithm::m_loc1theta
float m_loc1theta[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:116
Trk::RiddersAlgorithm::m_loc2steps
float m_loc2steps[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:125
drawFromPickle.exp
exp
Definition: drawFromPickle.py:36
Trk::Z0
@ Z0
Definition: ParameterType.h:18
Trk::RiddersAlgorithm::m_philoc2
float m_philoc2[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:128
Trk::RiddersAlgorithm::m_thetaloc1
float m_thetaloc1[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:134
makeTRTBarrelCans.y1
tuple y1
Definition: makeTRTBarrelCans.py:15
Trk::RiddersAlgorithm::m_loc2theta
float m_loc2theta[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:123
drawFromPickle.atan
atan
Definition: drawFromPickle.py:36
Trk::RiddersAlgorithm::m_loc1qop
float m_loc1qop[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:117
AthenaPoolTestRead.sc
sc
Definition: AthenaPoolTestRead.py:27
Trk::RiddersAlgorithm::m_gaussDist
Rndm::Numbers * m_gaussDist
Random Number setup.
Definition: RiddersAlgorithm.h:150
SG::VarHandleKeyArray::setOwner
virtual void setOwner(IDataHandleHolder *o)=0
IDTPMcnv.htype
htype
Definition: IDTPMcnv.py:29
Trk::RiddersAlgorithm::m_qopphi
float m_qopphi[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:143
Trk::RiddersAlgorithm::m_validationTree
TTree * m_validationTree
Root Validation Tree.
Definition: RiddersAlgorithm.h:100
Trk::RiddersAlgorithm::m_loc1phi
float m_loc1phi[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:115
Trk::RiddersAlgorithm::m_thetasteps
float m_thetasteps[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:139
python.utils.AtlRunQueryDQUtils.p
p
Definition: AtlRunQueryDQUtils.py:210
Trk::RiddersAlgorithm::m_angularVariations
DoubleArrayProperty m_angularVariations
Definition: RiddersAlgorithm.h:97
AthCommonDataStore
Definition: AthCommonDataStore.h:52
AthAlgorithm::sysInitialize
virtual StatusCode sysInitialize() override
Override sysInitialize.
Definition: AthAlgorithm.cxx:66
Trk::RiddersAlgorithm::m_qOpVariations
DoubleArrayProperty m_qOpVariations
Definition: RiddersAlgorithm.h:98
ATH_MSG_ERROR
#define ATH_MSG_ERROR(x)
Definition: AthMsgStreamMacros.h:33
CheckAppliedSFs.e3
e3
Definition: CheckAppliedSFs.py:264
AthCommonDataStore< AthCommonMsg< Algorithm > >::outputHandles
virtual std::vector< Gaudi::DataHandle * > outputHandles() const override
Return this algorithm's output handles.
Trk::theta
@ theta
Definition: ParamDefs.h:66
EL::StatusCode
::StatusCode StatusCode
StatusCode definition for legacy code.
Definition: PhysicsAnalysis/D3PDTools/EventLoop/EventLoop/StatusCode.h:22
ATH_MSG_DEBUG
#define ATH_MSG_DEBUG(x)
Definition: AthMsgStreamMacros.h:29
Trk::RiddersAlgorithm::m_minP
DoubleProperty m_minP
Definition: RiddersAlgorithm.h:87
makeTRTBarrelCans.y2
tuple y2
Definition: makeTRTBarrelCans.py:18
Trk::RiddersAlgorithm::m_thetaqop
float m_thetaqop[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:138
Amg::Transform3D
Eigen::Affine3d Transform3D
Definition: GeoPrimitives.h:46
dqt_zlumi_pandas.N1
int N1
Definition: dqt_zlumi_pandas.py:322
ATH_CHECK
#define ATH_CHECK
Definition: AthCheckMacros.h:40
Trk::RiddersAlgorithm::m_loc1steps
float m_loc1steps[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:118
AthCommonDataStore< AthCommonMsg< Algorithm > >::m_detStore
StoreGateSvc_t m_detStore
Pointer to StoreGate (detector store by default)
Definition: AthCommonDataStore.h:393
Trk::RiddersAlgorithm::m_loc2loc1
float m_loc2loc1[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:120
Trk::RiddersAlgorithm::m_philoc1
float m_philoc1[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:127
Trk::RiddersAlgorithm::m_steps
int m_steps
Definition: RiddersAlgorithm.h:112
Trk::RiddersAlgorithm::m_qoptheta
float m_qoptheta[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:144
MuonR4::SegmentFit::ParamDefs::x0
@ x0
Trk::RiddersAlgorithm::m_sigmaLoc
DoubleProperty m_sigmaLoc
The smearing.
Definition: RiddersAlgorithm.h:79
Trk::RiddersAlgorithm::m_qopsteps
float m_qopsteps[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:146
Trk::RiddersAlgorithm::m_loc2loc2
float m_loc2loc2[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:121
Trk::RiddersAlgorithm::m_propagator
PublicToolHandle< IPropagator > m_propagator
member variables for algorithm properties:
Definition: RiddersAlgorithm.h:70
Trk::RiddersAlgorithm::m_minPhi
DoubleProperty m_minPhi
Definition: RiddersAlgorithm.h:82
Trk::RiddersAlgorithm::m_phiphi
float m_phiphi[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:129
Trk::RiddersAlgorithm::m_minimumR
DoubleProperty m_minimumR
To create the first extimations.
Definition: RiddersAlgorithm.h:92
SG::VarHandleKeyArray::renounce
virtual void renounce()=0
SG::HandleClassifier::type
std::conditional< std::is_base_of< SG::VarHandleKeyArray, T >::value, VarHandleKeyArrayType, type2 >::type type
Definition: HandleClassifier.h:54
Trk::RiddersAlgorithm::m_loc2phi
float m_loc2phi[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:122
Trk::RiddersAlgorithm::m_loc1loc1
float m_loc1loc1[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:113
Trk::RiddersAlgorithm::m_fieldValue
DoubleProperty m_fieldValue
Definition: RiddersAlgorithm.h:74
Trk::RiddersAlgorithm::m_qoploc1
float m_qoploc1[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:141
MuonR4::SegmentFit::ParamDefs::y0
@ y0
Trk
Ensure that the ATLAS eigen extensions are properly loaded.
Definition: FakeTrackBuilder.h:9
Amg
Definition of ATLAS Math & Geometry primitives (Amg)
Definition: AmgStringHelpers.h:19
Trk::RiddersAlgorithm::m_magFieldProperties
MagneticFieldProperties * m_magFieldProperties
Definition: RiddersAlgorithm.h:75
merge_scale_histograms.doc
string doc
Definition: merge_scale_histograms.py:9
name
std::string name
Definition: Control/AthContainers/Root/debug.cxx:228
charge
double charge(const T &p)
Definition: AtlasPID.h:897
Amg::Vector3D
Eigen::Matrix< double, 3, 1 > Vector3D
Definition: GeoPrimitives.h:47
CxxUtils::to
CONT to(RANGE &&r)
Definition: ranges.h:39
Trk::RiddersAlgorithm::m_thetatheta
float m_thetatheta[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:137
AthAlgorithm::m_extendedExtraObjects
DataObjIDColl m_extendedExtraObjects
Definition: AthAlgorithm.h:79
a
TList * a
Definition: liststreamerinfos.cxx:10
h
Trk::RiddersAlgorithm::createTransform
static Amg::Transform3D createTransform(double x, double y, double z, double phi=0., double theta=0., double alphaZ=0.)
private helper method to create a HepTransform
Definition: RiddersAlgorithm.cxx:789
ATH_MSG_WARNING
#define ATH_MSG_WARNING(x)
Definition: AthMsgStreamMacros.h:32
Trk::RiddersAlgorithm::m_maxPhi
DoubleProperty m_maxPhi
Definition: RiddersAlgorithm.h:83
Trk::PlaneSurface
Definition: PlaneSurface.h:64
Amg::RotationMatrix3D
Eigen::Matrix< double, 3, 3 > RotationMatrix3D
Definition: GeoPrimitives.h:49
Trk::AtaPlane
ParametersT< TrackParametersDim, Charged, PlaneSurface > AtaPlane
Definition: Tracking/TrkEvent/TrkParameters/TrkParameters/TrackParameters.h:34
Amg::Translation3D
Eigen::Translation< double, 3 > Translation3D
Definition: GeoPrimitives.h:44
Trk::RiddersAlgorithm::m_validationTreeName
StringProperty m_validationTreeName
Definition: RiddersAlgorithm.h:103
Trk::qOverP
@ qOverP
perigee
Definition: ParamDefs.h:67
if
if(febId1==febId2)
Definition: LArRodBlockPhysicsV0.cxx:567
Trk::RiddersAlgorithm::m_loc2qop
float m_loc2qop[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:124
Trk::RiddersAlgorithm::m_phiqop
float m_phiqop[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:131
SG::VarHandleBase::vhKey
SG::VarHandleKey & vhKey()
Return a non-const reference to the HandleKey.
Definition: StoreGate/src/VarHandleBase.cxx:623
Trk::RiddersAlgorithm::m_phitheta
float m_phitheta[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:130
Amg::AngleAxis3D
Eigen::AngleAxisd AngleAxis3D
Definition: GeoPrimitives.h:45
AthAlgorithm::AthAlgorithm
AthAlgorithm()
Default constructor:
Trk::RiddersAlgorithm::m_qopqop
float m_qopqop[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:145
Trk::phi
@ phi
Definition: ParamDefs.h:75
python.Bindings.keys
keys
Definition: Control/AthenaPython/python/Bindings.py:798
LHEF::Writer
Pythia8::Writer Writer
Definition: Prophecy4fMerger.cxx:12
Trk::RiddersAlgorithm::m_useAlignedSurfaces
BooleanProperty m_useAlignedSurfaces
Definition: RiddersAlgorithm.h:72
drawFromPickle.sin
sin
Definition: drawFromPickle.py:36
Trk::x
@ x
Definition: ParamDefs.h:55
Trk::RiddersAlgorithm::m_minEta
DoubleProperty m_minEta
Definition: RiddersAlgorithm.h:84
Trk::loc1
@ loc1
Definition: ParamDefs.h:34
Trk::RiddersAlgorithm::m_loc1loc2
float m_loc1loc2[RIDDLERSSTEPS]
Definition: RiddersAlgorithm.h:114
PlotCalibFromCool.be
be
Definition: PlotCalibFromCool.py:398
Trk::RiddersAlgorithm::m_useCustomField
BooleanProperty m_useCustomField
Definition: RiddersAlgorithm.h:71
Trk::RiddersAlgorithm::m_validationTreeFolder
StringProperty m_validationTreeFolder
Definition: RiddersAlgorithm.h:109
AthCommonDataStore::declareGaudiProperty
Gaudi::Details::PropertyBase & declareGaudiProperty(Gaudi::Property< T > &hndl, const SG::VarHandleKeyType &)
specialization for handling Gaudi::Property<SG::VarHandleKey>
Definition: AthCommonDataStore.h:156
fitman.k
k
Definition: fitman.py:528
Trk::RiddersAlgorithm::m_maximumR
DoubleProperty m_maximumR
Definition: RiddersAlgorithm.h:93
ServiceHandle< ICondSvc >
Generated on Tue Feb 18 2025 22:11:00 for ATLAS Offline Software by   doxygen 1.8.18