#include <SiSpacePointMakerTool.h>

Inheritance diagram for InDet::SiSpacePointMakerTool:

Collaboration diagram for InDet::SiSpacePointMakerTool:

Public Member Functions
	SiSpacePointMakerTool (const std::string &type, const std::string &name, const IInterface *parent)
	Constructor. More...

virtual	~SiSpacePointMakerTool ()=default
	Default destructor. More...

virtual StatusCode	initialize () override
	Initialize. More...

virtual StatusCode	finalize () override
	Finalize. More...

void	fillSCT_SpacePointCollection (std::array< const InDetDD::SiDetectorElement , nNeighbours > &, std::array< const SCT_ClusterCollection , nNeighbours > &, std::array< double, 14 > &, bool, const Amg::Vector3D &, SpacePointCollection , SpacePointOverlapCollection , DataPool< SCT_SpacePoint > *dataItemsSCT) const

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	sysInitialize () override
	Perform system initialization for an algorithm. 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

Static Public Member Functions
static const InterfaceID &	interfaceID ()
	Return interfaceID. More...

static Trk::SpacePoint *	makeSCT_SpacePoint (InDet::SCTinformation &, InDet::SCTinformation &, IdentifierHash, IdentifierHash, double, double, DataPool< SCT_SpacePoint > *dataItemsSCT)
	Convert clusters to space points: SCT_Clusters -> SCT_SpacePoints. More...

static void	fillPixelSpacePointCollection (const InDet::PixelClusterCollection clusters, SpacePointCollection spacepointCollection, DataPool< PixelSpacePoint > *dataItemsPixel)
	Convert clusters to space points: PixelClusters -> PixelSpacePoints. More...

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...

Private Attributes
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

Cut parameters
DoubleProperty	m_stripLengthTolerance {this, "StripLengthTolerance", 0.01}

DoubleProperty	m_SCTgapParameter {this, "SCTGapParameter", 0., "Recommend 0.001 - 0.0015 for ITK geometry"}

ID helper
const SCT_ID *	m_idHelper {nullptr}

void	updateRange (const InDetDD::SiDetectorElement element1, const InDetDD::SiDetectorElement element2, double &stripLengthGapTolerance, double &min, double &max) const
	update range accordingly to the gap between the stereo modules More...

double	offset (const InDetDD::SiDetectorElement element1, const InDetDD::SiDetectorElement element2, double &stripLengthGapTolerance) const
	Get stripLengthGapTolerance and return offset value for two SiDetectorElement's. More...

bool	fillSCT_Information (const InDet::SCT_ClusterCollection clusters1, const InDet::SCT_ClusterCollection clusters2, const Amg::Vector3D &vertexVec, const InDetDD::SiDetectorElementCollection *elements) const
	Not implemented yet. More...

Detailed Description

Used by SiTrackerSpacePointFinder. Make PixelSpacePoints from PixelClusters. Make SCT_SpacePoints from SCT_Clusters. Make OverlapSpacePoints from SCT_Clusters.

Definition at line 45 of file SiSpacePointMakerTool.h.

Member Typedef Documentation

◆ StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ SiSpacePointMakerTool()

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

Constructor.

Definition at line 32 of file SiSpacePointMakerTool.cxx.

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

◆ ~SiSpacePointMakerTool()

virtual InDet::SiSpacePointMakerTool::~SiSpacePointMakerTool ( )

virtualdefault

Default destructor.

Member Function Documentation

◆ declareGaudiProperty() [1/4]

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

inlineprivateinherited

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

Definition at line 170 of file AthCommonDataStore.h.

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

◆ declareGaudiProperty() [2/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< AlgTool > >::declareGaudiProperty	(	Gaudi::Property< T > &	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());
  
   }

◆ declareGaudiProperty() [3/4]

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

inlineprivateinherited

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

Definition at line 184 of file AthCommonDataStore.h.

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

◆ declareGaudiProperty() [4/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< AlgTool > >::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.

   {
     return PBASE::declareProperty(t);
   }

◆ declareProperty() [1/6]

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

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
hndl	Object holding the property value.
doc	Documentation 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.

   {
     this->declare(hndl.vhKey());
     hndl.vhKey().setOwner(this);
  
     return PBASE::declareProperty(name,hndl,doc);
   }

◆ declareProperty() [2/6]

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

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
hndl	Object holding the property value.
doc	Documentation 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.

   {
     this->declare(hndl);
     hndl.setOwner(this);
  
     return PBASE::declareProperty(name,hndl,doc);
   }

◆ declareProperty() [3/6]

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

inlineinherited

Definition at line 259 of file AthCommonDataStore.h.

   {
  
     // std::ostringstream ost;
     // ost << Algorithm::name() << " VHKA declareProp: " << name 
     //     << " size: " << hndArr.keys().size() 
     //     << " mode: " << hndArr.mode() 
     //     << "  vhka size: " << m_vhka.size()
     //     << "\n";
     // debug() << ost.str() << endmsg;
  
     hndArr.setOwner(this);
     m_vhka.push_back(&hndArr);
  
     Gaudi::Details::PropertyBase* p =  PBASE::declareProperty(name, hndArr, doc);
     if (p != 0) {
       p->declareUpdateHandler(&AthCommonDataStore<PBASE>::updateVHKA, this);
     } else {
       ATH_MSG_ERROR("unable to call declareProperty on VarHandleKeyArray " 
                     << name);
     }
  
     return p;
  
   }

◆ declareProperty() [4/6]

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

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
property	Object holding the property value.
doc	Documentation 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.

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

◆ declareProperty() [5/6]

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

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
property	Object holding the property value.
doc	Documentation 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.

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

◆ declareProperty() [6/6]

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

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

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

◆ detStore()

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

inlineinherited

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

Definition at line 95 of file AthCommonDataStore.h.

95 { return m_detStore; }

◆ evtStore() [1/2]

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.

85 { return m_evtStore; }

◆ evtStore() [2/2]

const ServiceHandle<StoreGateSvc>& AthCommonDataStore< AthCommonMsg< AlgTool > >::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; }

◆ 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

◆ fillPixelSpacePointCollection()

void InDet::SiSpacePointMakerTool::fillPixelSpacePointCollection	(	const InDet::PixelClusterCollection *	clusters,
		SpacePointCollection *	spacepointCollection,
		DataPool< PixelSpacePoint > *	dataItemsPixel
	)

static

Convert clusters to space points: PixelClusters -> PixelSpacePoints.

Definition at line 52 of file SiSpacePointMakerTool.cxx.

                                                                                                        {
  
     InDet::PixelClusterCollection::const_iterator clusStart = clusters->begin();
     InDet::PixelClusterCollection::const_iterator clusFinish = clusters->end();
  
     if ((*clusStart)->detectorElement()) {
       IdentifierHash idHash = clusters->identifyHash();
       const Amg::Transform3D& T = (*clusStart)->detectorElement()->surface().transform();
       double Ax[3] = {T(0,0),T(1,0),T(2,0)};
       double Ay[3] = {T(0,1),T(1,1),T(2,1)};
       double Az[3] = {T(0,2),T(1,2),T(2,2)};
  
       spacepointCollection->reserve(spacepointCollection->size()+clusters->size());
  
       for(; clusStart!=clusFinish; ++clusStart){
         const InDet::SiCluster* c = (*clusStart);
         const Amg::MatrixX&     V = c->localCovariance();
  
         // Global position is already computed during pixel cluster creation and cached in the SiCluster object
         const Amg::Vector3D&  pos = c->globalPosition();
  
         double B0[2] = {Ax[0]*V(0,0)+Ax[1]*V(1,0),Ax[0]*V(1,0)+Ax[1]*V(1,1)};
         double B1[2] = {Ay[0]*V(0,0)+Ay[1]*V(1,0),Ay[0]*V(1,0)+Ay[1]*V(1,1)};
         double B2[2] = {Az[0]*V(0,0)+Az[1]*V(1,0),Az[0]*V(1,0)+Az[1]*V(1,1)};
  
         double C01 = B1[0]*Ax[0]+B1[1]*Ax[1];
         double C02 = B2[0]*Ax[0]+B2[1]*Ax[1];
         double C12 = B2[0]*Ay[0]+B2[1]*Ay[1];
  
         AmgSymMatrix(3) cov;
         cov << B0[0] * Ax[0] + B0[1] * Ax[1], C01, C02, C01,
             B1[0] * Ay[0] + B1[1] * Ay[1], C12,
             // cppcheck-suppress constStatement
             C02, C12, B2[0] * Az[0] + B2[1] * Az[1];
  
         if (dataItemsPixel) {
           PixelSpacePoint* pix = dataItemsPixel->nextElementPtr();
           (*pix) = InDet::PixelSpacePoint(idHash, c, pos, cov);
           spacepointCollection->push_back(pix);
  
         } else {
           spacepointCollection->push_back(
               new InDet::PixelSpacePoint(idHash, c, pos, cov));
         }
       }
     }
   }

◆ fillSCT_Information()

bool InDet::SiSpacePointMakerTool::fillSCT_Information	(	const InDet::SCT_ClusterCollection *	clusters1,
		const InDet::SCT_ClusterCollection *	clusters2,
		const Amg::Vector3D &	vertexVec,
		const InDetDD::SiDetectorElementCollection *	elements
	)		const

private

Not implemented yet.

◆ fillSCT_SpacePointCollection()

void InDet::SiSpacePointMakerTool::fillSCT_SpacePointCollection	(	std::array< const InDetDD::SiDetectorElement *, nNeighbours > &	elements,
		std::array< const SCT_ClusterCollection *, nNeighbours > &	clusters,
		std::array< double, 14 > &	overlapExtents,
		bool	allClusters,
		const Amg::Vector3D &	vertexVec,
		SpacePointCollection *	spacepointCollection,
		SpacePointOverlapCollection *	spacepointoverlapCollection,
		DataPool< SCT_SpacePoint > *	dataItemsSCT
	)		const

Definition at line 147 of file SiSpacePointMakerTool.cxx.

   {
  
     // This function is called once all the needed quantities are collected.
     // It is used to build space points checking the compatibility of clusters on pairs of detector elements.
     // Detector elements and cluster collections are elements and clusters, respectively.
     // [0] is the trigger element
     // [1] is the opposite element
     // [2]-[3] are the elements tested for eta overlaps
     // [4]-[5] are the elements tested for phi overlaps
     //
     // To build space points:
     // - For the opposite element and the ones tested for eta overlaps, you have to check
     //   if clusters are compatible with the local position of the trigger cluster
     //   requiring that the distance between the two clusters in phi is withing a specified range.
     //   - overlapExtents[0], overlapExtents[1] are filled for the opposite element
     //   - overlapExtents[2], overlapExtents[3], overlapExtents[4], overlapExtents[5] are filled for the eta overlapping elements
     // - For the elements tested for phi overlaps, you have to check
     //   if clusters are compatible with the local position of the trigger cluster.
     //   This needs that the trigger cluster is at the edge of the trigger module
     //   and that the other cluster is on the compatible edge of its module
     //   - overlapExtents[6], overlapExtents[7], overlapExtents[10], overlapExtents[11]
     //     overlapExtents[8], overlapExtents[9], overlapExtents[12], overlapExtents[13] are filled for the phi overlapping elements
  
     constexpr int otherSideIndex{1};
     constexpr int maxEtaIndex{3};
     std::array<int, nNeighbours-1> elementIndex{};
     int nElements = 0;
  
     // For the nNeighbours sides, fill elementIndex with the indices of the existing elements.
     // Same the number of elements in nElements to loop on the later on
     for(int n=1; n!=nNeighbours; ++n) {
       if(elements[n]) {
         elementIndex[nElements++] = n;
       }
     }
     // return if all detector elements are nullptr
     if(!nElements) return;
  
     // trigger element and clusters
     const InDetDD::SiDetectorElement* element = elements[0];
     IdentifierHash                         Id = clusters[0]->identifyHash();
  
     std::vector<SCTinformation> sctInfos;
     sctInfos.reserve(clusters[0]->size());
  
     // loop on all clusters on the trigger detector element and save the related information
     for (const auto *const cluster : *clusters[0]) {
       Amg::Vector2D locpos = cluster->localPosition();
       std::pair<Amg::Vector3D, Amg::Vector3D > ends(element->endsOfStrip(InDetDD::SiLocalPosition(locpos.y(),locpos.x(),0.)));
       InDet::SCTinformation sct(cluster,ends.first, ends.second, vertexVec,locpos.x());
       sctInfos.push_back(sct);
     }
  
     double  limit  = 1. + m_stripLengthTolerance;
     double slimit  = 0.                         ;
     std::vector<Trk::SpacePoint*> tmpSpacePoints;
     tmpSpacePoints.reserve(sctInfos.size());
  
     if(!allClusters) {
  
       // Start processing the opposite side and the eta overlapping elements
       int n = 0;
       for(; n < nElements; ++n) {
  
         int currentIndex = elementIndex[n];
  
         if(currentIndex > maxEtaIndex) break;
  
         // get the detector element and the IdentifierHash
         const InDetDD::SiDetectorElement* currentElement  = elements[currentIndex];
         IdentifierHash                    currentId       = clusters[currentIndex]->identifyHash();
  
         // retrieve the range
         double min = overlapExtents[currentIndex*2-2];
         double max = overlapExtents[currentIndex*2-1];
  
         if (m_SCTgapParameter != 0.) {
           updateRange(element, currentElement, slimit, min, max);
         }
  
         InDet::SCTinformation sctInfo;
         for (const auto *const cluster : *clusters[currentIndex]) {
  
           bool processed = false;
           const Amg::Vector2D& locpos = cluster->localPosition();
           double lx1 = locpos.x();
  
           for(auto& sct : sctInfos) {
  
             double diff = lx1-sct.locX();
  
             if(diff < min || diff > max) continue;
  
             if (not processed) {
               processed = true;
               std::pair<Amg::Vector3D, Amg::Vector3D > ends(currentElement->endsOfStrip(InDetDD::SiLocalPosition(locpos.y(),locpos.x(),0.)));
               sctInfo.set(cluster,ends.first, ends.second, vertexVec,lx1);
             }
  
             Trk::SpacePoint* sp = makeSCT_SpacePoint(
                 sct, sctInfo, Id, currentId, limit, slimit, dataItemsSCT);
             if (sp) {
               tmpSpacePoints.push_back(sp);
             }
           }
         }
         // If you are processing the opposite element, save the space points into
         // the spacepointCollection and clear the temporary collection
         if( currentIndex==otherSideIndex && !tmpSpacePoints.empty() ) {
           spacepointCollection->reserve(tmpSpacePoints.size()+spacepointCollection->size());
           for (Trk::SpacePoint* sp: tmpSpacePoints) {
             spacepointCollection->push_back(sp);
           }
           tmpSpacePoints.clear();
         }
       }
  
       // process the phi overlapping elements
       // if possible n starts from 4
       for(; n < nElements; ++n) {
  
         int currentIndex = elementIndex[n];
         const InDetDD::SiDetectorElement* currentElement = elements[currentIndex];
  
         double min = overlapExtents[4*currentIndex-10];
         double max = overlapExtents[4*currentIndex- 9];
  
         if (m_SCTgapParameter != 0.) {
           updateRange(element, currentElement, slimit, min, max);
         }
  
         std::vector<SCTinformation*> sctPhiInfos;
         sctPhiInfos.reserve(sctInfos.size());
  
         for(auto& sct : sctInfos) {
           double lx0 = sct.locX();
           if (min <= lx0 && lx0 <= max) {
             sctPhiInfos.push_back(&sct);
           }
         }
         // continue if you have no cluster from the phi overlapping region of the trigger element
         if(sctPhiInfos.empty()) continue;
  
         IdentifierHash currentId = clusters[currentIndex]->identifyHash();
  
         min = overlapExtents[4*currentIndex-8];
         max = overlapExtents[4*currentIndex-7];
  
         if (m_SCTgapParameter != 0.) {
           updateRange(element, currentElement, slimit, min, max);
         }
  
         for (const auto *const cluster : *clusters[currentIndex]) {
  
           const Amg::Vector2D& locpos = cluster->localPosition();
           double lx1 = locpos.x();
           if(lx1 < min || lx1 > max ) continue;
  
           std::pair<Amg::Vector3D, Amg::Vector3D > ends(currentElement->endsOfStrip(InDetDD::SiLocalPosition(locpos.y(),locpos.x(),0.)));
           InDet::SCTinformation sctInfo(cluster,ends.first, ends.second, vertexVec,lx1);
  
           for(auto& sct : sctPhiInfos) {
             Trk::SpacePoint* sp = makeSCT_SpacePoint(
                 *sct, sctInfo, Id, currentId, limit, slimit, dataItemsSCT);
             if (sp) {
               tmpSpacePoints.push_back(sp);
             }
           }
         }
       }
  
       // fill the space point collection for eta/phi overlapping clusters
       if(!tmpSpacePoints.empty()) {
         spacepointoverlapCollection->reserve(tmpSpacePoints.size()+spacepointoverlapCollection->size());
         for (Trk::SpacePoint* sp: tmpSpacePoints) {
           spacepointoverlapCollection->push_back(sp);
         }
       }
       return;
     }
  
     // the following code is used to create spacepoints processing all clusters without limits
  
     for(int n=0; n!=nElements; ++n) {
  
       int currentIndex = elementIndex[n];
       const InDetDD::SiDetectorElement* currentElement      = elements[currentIndex];
       IdentifierHash                    currentId           = clusters[currentIndex]->identifyHash();
  
       if (m_SCTgapParameter != 0.) {
         offset(element, currentElement, slimit);
       }
  
       for (const auto *const cluster : *clusters[currentIndex]) {
  
         const Amg::Vector2D& locpos = cluster->localPosition();
         std::pair<Amg::Vector3D, Amg::Vector3D > ends(currentElement->endsOfStrip(InDetDD::SiLocalPosition(locpos.y(),locpos.x(),0.)));
         InDet::SCTinformation sctInfo(cluster,ends.first, ends.second,vertexVec,locpos.x());
  
         for(auto& sct : sctInfos) {
           Trk::SpacePoint* sp = makeSCT_SpacePoint(sct,sctInfo,Id,currentId,limit,slimit,dataItemsSCT);
           if(sp) {
             tmpSpacePoints.push_back(sp);
           }
         }
       }
       // If you are processing the opposite element, save the space points into
       // the spacepointCollection and clear the temporary collection
       if( currentIndex==otherSideIndex && !tmpSpacePoints.empty() ) {
         spacepointCollection->reserve(tmpSpacePoints.size()+spacepointCollection->size());
         for (Trk::SpacePoint* sp: tmpSpacePoints) {
           spacepointCollection->push_back(sp);
         }
         tmpSpacePoints.clear();
       }
     }
     // fill the space point collection for eta/phi overlapping clusters
     if(!tmpSpacePoints.empty()) {
       spacepointoverlapCollection->reserve(tmpSpacePoints.size()+spacepointoverlapCollection->size());
       for (Trk::SpacePoint* sp: tmpSpacePoints) {
         spacepointoverlapCollection->push_back(sp);
       }
     }
   }

◆ finalize()

StatusCode InDet::SiSpacePointMakerTool::finalize ( )

overridevirtual

Finalize.

Definition at line 47 of file SiSpacePointMakerTool.cxx.

                                              {
     return StatusCode::SUCCESS;
   }

◆ initialize()

StatusCode InDet::SiSpacePointMakerTool::initialize ( )

overridevirtual

Initialize.

Definition at line 39 of file SiSpacePointMakerTool.cxx.

                                                 {
     // Get the SCT Helper
     ATH_CHECK(detStore()->retrieve(m_idHelper, "SCT_ID"));
     m_SCTgapParameter = std::abs(m_SCTgapParameter);
     if (m_SCTgapParameter > 0.002) m_SCTgapParameter = 0.002;
     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::SiSpacePointMakerTool::interfaceID ( )

static

Return interfaceID.

Definition at line 27 of file SiSpacePointMakerTool.cxx.

                                                         {
     return IID_ISiSpacePointMakerTool;
   }

◆ makeSCT_SpacePoint()

Trk::SpacePoint * InDet::SiSpacePointMakerTool::makeSCT_SpacePoint	(	InDet::SCTinformation &	In0,
		InDet::SCTinformation &	In1,
		IdentifierHash	ID0,
		IdentifierHash	ID1,
		double	limit,
		double	slimit,
		DataPool< SCT_SpacePoint > *	dataItemsSCT
	)

static

Convert clusters to space points: SCT_Clusters -> SCT_SpacePoints.

Definition at line 382 of file SiSpacePointMakerTool.cxx.

                                               {
  
     double a  =-In0.traj_direction().dot(In1.normal());
     double b  = In0.strip_direction().dot(In1.normal());
     double l0 = In0.oneOverStrip()*slimit+limit ;
  
     if(std::abs(a) > (std::abs(b)*l0)) return nullptr;
  
     double c  =-In1.traj_direction().dot(In0.normal());
     double d  = In1.strip_direction().dot(In0.normal());
     double l1 = In1.oneOverStrip()*slimit+limit ;
  
     if(std::abs(c) > (std::abs(d)*l1)) return nullptr;
  
     double m = a/b;
  
     if(slimit!=0.) {
  
       double n = c/d;
  
       if     (m >  limit || n >  limit) {
  
         double cs  = In0.strip_direction().dot(In1.strip_direction())*(In0.oneOverStrip()*In0.oneOverStrip());
         double dm  = (m-1);
         double dmn = (n-1.)*cs;
         if(dmn > dm) dm = dmn;
         m-=dm; n-=(dm/cs);
         if(std::abs(m) > limit || std::abs(n) > limit) return nullptr;
       } else if(m < -limit || n < -limit) {
  
         double cs  = In0.strip_direction().dot(In1.strip_direction())*(In0.oneOverStrip()*In0.oneOverStrip());
         double dm  = -(1.+m);
         double dmn = -(1.+n)*cs;
         if(dmn > dm) dm = dmn;
         m+=dm; n+=(dm/cs);
         if(std::abs(m) > limit || std::abs(n) > limit) return nullptr;
       }
     }
     Amg::Vector3D point(In0.position(m));
  
     const std::pair<IdentifierHash,IdentifierHash> elementIdList(ID0,ID1);
     //if we have a DataPool use it
     if (dataItemsSCT) {
       SCT_SpacePoint* sp = dataItemsSCT->nextElementPtr();
       (*sp) = InDet::SCT_SpacePoint(elementIdList, point,
                                     {In0.cluster(), In1.cluster()});
       return sp;
     }
     return new InDet::SCT_SpacePoint(elementIdList, point,
                                      {In0.cluster(), In1.cluster()});
   }

◆ msg() [1/2]

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                 {
     return this->msgStream();
   }

◆ msg() [2/2]

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

inlineinherited

Definition at line 27 of file AthCommonMsg.h.

                                                   {
     return this->msgStream(lvl);
   }

◆ msgLvl()

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

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                                {
     return this->msgLevel(lvl);
   }

◆ offset()

double InDet::SiSpacePointMakerTool::offset	(	const InDetDD::SiDetectorElement *	element1,
		const InDetDD::SiDetectorElement *	element2,
		double &	stripLengthGapTolerance
	)		const

private

Get stripLengthGapTolerance and return offset value for two SiDetectorElement's.

Definition at line 106 of file SiSpacePointMakerTool.cxx.

   {
     const Amg::Transform3D& T1 = element1->transform();
     const Amg::Transform3D& T2 = element2->transform();
     Amg::Vector3D           C  = element1->center() ;
     bool isAnnulus = (element1->design().shape() == InDetDD::Annulus);
     // bool isPolar = (element1->design().shape() == InDetDD::PolarAnnulus);
  
     double x12 = T1(0,0)*T2(0,0)+T1(1,0)*T2(1,0)+T1(2,0)*T2(2,0)                              ;
     double r   = isAnnulus ? std::sqrt(C[0]*C[0]+C[1]*C[1]) : std::sqrt(T1(0,3)*T1(0,3)+T1(1,3)*T1(1,3));
     double s   = (T1(0,3)-T2(0,3))*T1(0,2)+(T1(1,3)-T2(1,3))*T1(1,2)+(T1(2,3)-T2(2,3))*T1(2,2);
  
     double dm  = (m_SCTgapParameter*r)*std::abs(s*x12);
     double d   = isAnnulus ? dm/.04 : dm/std::sqrt((1.-x12)*(1.+x12));
  
     if (std::abs(T1(2,2)) > 0.7) d*=(r/std::abs(T1(2,3))); // endcap d = d*R/Z
  
     stripLengthGapTolerance = d;
  
     return dm;
   }

◆ outputHandles()

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

overridevirtualinherited

Return this algorithm's output handles.

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

◆ renounce()

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

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

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

◆ renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                           {
     handlesArray.renounce();
   }

◆ sysInitialize()

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

overridevirtualinherited

Perform system initialization for an algorithm.

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

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

◆ 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.

◆ updateRange()

void InDet::SiSpacePointMakerTool::updateRange	(	const InDetDD::SiDetectorElement *	element1,
		const InDetDD::SiDetectorElement *	element2,
		double &	stripLengthGapTolerance,
		double &	min,
		double &	max
	)		const

private

update range accordingly to the gap between the stereo modules

Definition at line 133 of file SiSpacePointMakerTool.cxx.

                                                                           {
     double dm = offset(element1, element2, stripLengthGapTolerance);
     min -= dm;
     max += dm;
   }

◆ 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_idHelper

const SCT_ID* InDet::SiSpacePointMakerTool::m_idHelper {nullptr}

private

Definition at line 90 of file SiSpacePointMakerTool.h.

◆ m_SCTgapParameter

DoubleProperty InDet::SiSpacePointMakerTool::m_SCTgapParameter {this, "SCTGapParameter", 0., "Recommend 0.001 - 0.0015 for ITK geometry"}

private

Definition at line 85 of file SiSpacePointMakerTool.h.

◆ m_stripLengthTolerance

DoubleProperty InDet::SiSpacePointMakerTool::m_stripLengthTolerance {this, "StripLengthTolerance", 0.01}

private

Definition at line 84 of file SiSpacePointMakerTool.h.

◆ m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< AlgTool > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

◆ m_vhka

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

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

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

Public Member Functions

Static Public Member Functions

Protected Member Functions

Private Types

Private Member Functions

Private Attributes

ID helper

Detailed Description

Member Typedef Documentation

◆ StoreGateSvc_t

Constructor & Destructor Documentation

◆ SiSpacePointMakerTool()

◆ ~SiSpacePointMakerTool()

Member Function Documentation

◆ declareGaudiProperty() [1/4]

◆ declareGaudiProperty() [2/4]

◆ declareGaudiProperty() [3/4]

◆ declareGaudiProperty() [4/4]

◆ declareProperty() [1/6]

◆ declareProperty() [2/6]

◆ declareProperty() [3/6]

◆ declareProperty() [4/6]

◆ declareProperty() [5/6]

◆ declareProperty() [6/6]

◆ detStore()

◆ evtStore() [1/2]

◆ evtStore() [2/2]

◆ extraDeps_update_handler()

◆ fillPixelSpacePointCollection()

◆ fillSCT_Information()

◆ fillSCT_SpacePointCollection()

◆ finalize()

◆ initialize()

◆ inputHandles()

◆ interfaceID()

◆ makeSCT_SpacePoint()

◆ msg() [1/2]

◆ msg() [2/2]

◆ msgLvl()

◆ offset()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ sysInitialize()

◆ sysStart()

◆ updateRange()

◆ updateVHKA()

Member Data Documentation

◆ m_detStore

◆ m_evtStore

◆ m_idHelper

◆ m_SCTgapParameter

◆ m_stripLengthTolerance

◆ m_varHandleArraysDeclared

◆ m_vhka