#include <Gbts2ActsSeedingTool.h>

Inheritance diagram for Gbts2ActsSeedingTool:

Collaboration diagram for Gbts2ActsSeedingTool:

Public Member Functions
	Gbts2ActsSeedingTool (const std::string &, const std::string &, const IInterface *)

virtual	~Gbts2ActsSeedingTool ()

virtual StatusCode	initialize () override

virtual StatusCode	finalize () override

virtual StatusCode	createSeeds (const EventContext &ctx, const Acts::SpacePointContainer< ActsTrk::SpacePointCollector, Acts::detail::RefHolder > &spContainer, const Acts::Vector3 &beamSpotPos, const Acts::Vector3 &bField, ActsTrk::SeedContainer &seedContainer) const override

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

	DeclareInterfaceID (ISeedingTool, 1, 0)

virtual StatusCode	createSeeds (const EventContext &ctx, const Acts::SpacePointContainer< ActsTrk::SpacePointCollector, Acts::detail::RefHolder > &spContainer, const Acts::Vector3 &beamSpotPos, const Acts::Vector3 &bField, ActsTrk::SeedContainer &seedContainer) const =0

Protected Types
typedef TrigFTF_GNN_Node	GNN_Node

typedef TrigFTF_GNN_DataStorage	GNN_DataStorage

typedef TrigFTF_GNN_Edge	GNN_Edge

Protected Member Functions
std::pair< int, int >	buildTheGraph (const IRoiDescriptor &, const std::unique_ptr< GNN_DataStorage > &, std::vector< GNN_Edge > &) const

int	runCCA (int, std::vector< GNN_Edge > &) const

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

Protected Attributes
SG::ReadCondHandleKey< InDet::BeamSpotData >	m_beamSpotKey { this, "BeamSpotKey", "BeamSpotData", "SG key for beam spot" }

const std::vector< short > *	m_sct_h2l {nullptr}

const std::vector< short > *	m_pix_h2l {nullptr}

std::vector< bool >	m_are_pixels

ToolHandle< ITrigL2LayerNumberTool >	m_layerNumberTool {this, "layerNumberTool", "TrigL2LayerNumberToolITk"}

const AtlasDetectorID *	m_atlasId = nullptr

const SCT_ID *	m_sctId = nullptr

const PixelID *	m_pixelId = nullptr

BooleanProperty	m_filter_phi {this, "DoPhiFiltering", true}

BooleanProperty	m_useBeamTilt {this, "UseBeamTilt", false}

BooleanProperty	m_LRTmode {this, "LRTMode",false}

BooleanProperty	m_useML {this, "useML", true}

UnsignedIntegerProperty	m_nMaxPhiSlice {this, "nMaxPhiSlice", 53}

BooleanProperty	m_doubletFilterRZ {this, "Doublet_FilterRZ", true}

BooleanProperty	m_useEtaBinning {this, "UseEtaBinning", true}

FloatProperty	m_minPt {this, "pTmin", 1000.0}

IntegerProperty	m_nMaxEdges {this, "MaxGraphEdges", 2000000}

StringProperty	m_connectionFile {this, "ConnectionFileName", "binTables_ITK_RUN4.txt"}

float	m_phiSliceWidth = 0.

std::unique_ptr< GNN_FasTrackConnector >	m_connector = nullptr

std::vector< TrigInDetSiLayer >	m_layerGeometry

std::unique_ptr< const TrigFTF_GNN_Geometry >	m_geo = nullptr

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

Detailed Description

Definition at line 14 of file Gbts2ActsSeedingTool.h.

Member Typedef Documentation

◆ GNN_DataStorage

typedef TrigFTF_GNN_DataStorage SeedingToolBase::GNN_DataStorage

protectedinherited

Definition at line 33 of file SeedingToolBase.h.

◆ GNN_Edge

typedef TrigFTF_GNN_Edge SeedingToolBase::GNN_Edge

protectedinherited

Definition at line 34 of file SeedingToolBase.h.

◆ GNN_Node

typedef TrigFTF_GNN_Node SeedingToolBase::GNN_Node

protectedinherited

Definition at line 32 of file SeedingToolBase.h.

◆ StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ Gbts2ActsSeedingTool()

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

Definition at line 14 of file Gbts2ActsSeedingTool.cxx.

                                                 : SeedingToolBase(t,n,p)
 {
 }

◆ ~Gbts2ActsSeedingTool()

virtual Gbts2ActsSeedingTool::~Gbts2ActsSeedingTool ( )

inlinevirtual

Definition at line 19 of file Gbts2ActsSeedingTool.h.

19 {};

Member Function Documentation

◆ buildTheGraph()

std::pair< int, int > SeedingToolBase::buildTheGraph	(	const IRoiDescriptor &	roi,
		const std::unique_ptr< GNN_DataStorage > &	storage,
		std::vector< GNN_Edge > &	edgeStorage
	)		const

protectedinherited

Definition at line 68 of file SeedingToolBase.cxx.

                                                                                                                                                                                  {
  
   const float M_2PI = 2.0*M_PI;
   
   const float cut_dphi_max      = m_LRTmode ? 0.07 : 0.012;
   const float cut_dcurv_max     = m_LRTmode ? 0.015 : 0.001;
   const float cut_tau_ratio_max = m_LRTmode ? 0.015 : 0.007;
   const float min_z0            = m_LRTmode ? -600.0 : roi.zedMinus();
   const float max_z0            = m_LRTmode ? 600.0 : roi.zedPlus();
   const float min_deltaPhi      = m_LRTmode ? 0.01f : 0.001f;
   
   const float maxOuterRadius    = m_LRTmode ? 1050.0 : 550.0;
  
   const float cut_zMinU = min_z0 + maxOuterRadius*roi.dzdrMinus();
   const float cut_zMaxU = max_z0 + maxOuterRadius*roi.dzdrPlus();
  
   const float ptCoeff = 0.29997*1.9972/2.0;// ~0.3*B/2 - assuming nominal field of 2*T
  
   float tripletPtMin = 0.8*m_minPt;//correction due to limited pT resolution
   
   float maxCurv = ptCoeff/tripletPtMin;
  
   const float maxKappa_high_eta          = m_LRTmode ? 1.0*maxCurv : std::sqrt(0.8)*maxCurv;
   const float maxKappa_low_eta           = m_LRTmode ? 1.0*maxCurv : std::sqrt(0.6)*maxCurv;
   const float dphi_coeff                 = m_LRTmode ? 1.0*maxCurv : 0.68*maxCurv;
   
   const float minDeltaRadius = 2.0;
     
   float deltaPhi = 0.5f*m_phiSliceWidth;//the default sliding window along phi
  
   unsigned int nConnections = 0;
   
   edgeStorage.reserve(m_nMaxEdges);
   
   int nEdges = 0;
  
   for(const auto& bg : m_geo->bin_groups()) {//loop over bin groups
     
     TrigFTF_GNN_EtaBin& B1 = storage->getEtaBin(bg.first);
  
     if(B1.empty()) continue;
  
     float rb1 = B1.getMinBinRadius();
  
     for(const auto& b2_idx : bg.second) {
  
       const TrigFTF_GNN_EtaBin& B2 = storage->getEtaBin(b2_idx);
  
       if(B2.empty()) continue;
       
       float rb2 = B2.getMaxBinRadius();
     
       if(m_useEtaBinning) {
     deltaPhi = min_deltaPhi + dphi_coeff*std::fabs(rb2-rb1);    
       }
  
       unsigned int first_it = 0;
  
       for(unsigned int n1Idx = 0;n1Idx<B1.m_vn.size();n1Idx++) {//loop over nodes in Layer 1
  
     std::vector<unsigned int>& v1In = B1.m_in[n1Idx];   
  
     if(v1In.size() >= MAX_SEG_PER_NODE) continue;
       
     const std::array<float, 5>& n1pars = B1.m_params[n1Idx];
  
     float phi1 = n1pars[2];
     float r1 = n1pars[3];
     float z1 = n1pars[4];
       
     //sliding window phi1 +/- deltaPhi
       
     float minPhi = phi1 - deltaPhi;
     float maxPhi = phi1 + deltaPhi;
       
     for(unsigned int n2PhiIdx = first_it; n2PhiIdx<B2.m_vPhiNodes.size();n2PhiIdx++) {//sliding window over nodes in Layer 2
     
       float phi2 = B2.m_vPhiNodes[n2PhiIdx].first;
     
       if(phi2 < minPhi) {
         first_it = n2PhiIdx;
         continue;
       }
       if(phi2 > maxPhi) break;
     
       unsigned int n2Idx = B2.m_vPhiNodes[n2PhiIdx].second;
     
       const std::vector<unsigned int>& v2In = B2.m_in[n2Idx];
         
       if(v2In.size() >= MAX_SEG_PER_NODE) continue;
         
       const std::array<float, 5>& n2pars = B2.m_params[n2Idx];
     
       float r2 = n2pars[3];
       
       float dr = r2 - r1;
     
       if(dr < minDeltaRadius) {
         continue;
       }
     
       float z2 = n2pars[4];
  
       float dz = z2 - z1;
       float tau = dz/dr;
       float ftau = std::fabs(tau);
       if (ftau > 36.0) {
         continue;
       }
     
       if(ftau < n1pars[0]) continue;
       if(ftau > n1pars[1]) continue;
  
       if(ftau < n2pars[0]) continue;
       if(ftau > n2pars[1]) continue;
         
       if (m_doubletFilterRZ) {
           
         float z0 = z1 - r1*tau;
       
         if(z0 < min_z0 || z0 > max_z0) continue;
       
         float zouter = z0 + maxOuterRadius*tau;
       
         if(zouter < cut_zMinU || zouter > cut_zMaxU) continue;                
       }
         
       float curv = (phi2-phi1)/dr;
       float abs_curv = std::abs(curv);
         
       if(ftau < 4.0) {//eta = 2.1
         if(abs_curv > maxKappa_low_eta) {
           continue;
         }
       }
       else {
         if(abs_curv > maxKappa_high_eta) {
           continue;
         }
       }
     
       //match edge candidate against edges incoming to n2
  
       float exp_eta = std::sqrt(1+tau*tau)-tau;
  
       bool isGood = v2In.size() <= 2;//we must have enough incoming edges to decide
  
       if(!isGood) {
  
         float uat_1 = 1.0f/exp_eta;
             
         for(const auto& n2_in_idx : v2In) {
             
           float tau2 = edgeStorage.at(n2_in_idx).m_p[0]; 
           float tau_ratio = tau2*uat_1 - 1.0f;
           
           if(std::fabs(tau_ratio) > cut_tau_ratio_max){//bad match
         continue;
           }
           isGood = true;//good match found
           break;
         }
       }
     
       if(!isGood) {//no match found, skip creating [n1 <- n2] edge
         continue;
       }
  
       float dPhi2 = curv*r2;
       float dPhi1 = curv*r1;
     
       if(nEdges < m_nMaxEdges) {
       
         edgeStorage.emplace_back(B1.m_vn[n1Idx], B2.m_vn[n2Idx], exp_eta, curv, phi1 + dPhi1);
         
         if(v1In.size() < MAX_SEG_PER_NODE) v1In.push_back(nEdges);
           
         int outEdgeIdx = nEdges;
       
         float uat_2  = 1/exp_eta;
         float Phi2  = phi2 + dPhi2;
         float curv2 = curv;
         
         for(const auto& inEdgeIdx : v2In) {//looking for neighbours of the new edge
         
           TrigFTF_GNN_Edge* pS = &(edgeStorage.at(inEdgeIdx));
           
           if(pS->m_nNei >= N_SEG_CONNS) continue;
         
           float tau_ratio = pS->m_p[0]*uat_2 - 1.0f;
           
           if(std::abs(tau_ratio) > cut_tau_ratio_max){//bad match
         continue;
           }
           
           float dPhi =  Phi2 - pS->m_p[2];
           
           if(dPhi<-M_PI) dPhi += M_2PI;
           else if(dPhi>M_PI) dPhi -= M_2PI;
           
           if(dPhi < -cut_dphi_max || dPhi > cut_dphi_max) {
         continue;
           }
             
           float dcurv = curv2 - pS->m_p[1];
             
           if(dcurv < -cut_dcurv_max || dcurv > cut_dcurv_max) {
         continue;
           }
             
           pS->m_vNei[pS->m_nNei++] = outEdgeIdx;
         
           nConnections++;
         
         }
         nEdges++;       
       }
     } //loop over n2 (outer) nodes
       } //loop over n1 (inner) nodes
     } //loop over bins in Layer 2
   } //loop over bin groups
  
   return std::make_pair(nEdges, nConnections);
 }

◆ createSeeds() [1/2]

virtual StatusCode ActsTrk::ISeedingTool::createSeeds	(	const EventContext &	ctx,
		const Acts::SpacePointContainer< ActsTrk::SpacePointCollector, Acts::detail::RefHolder > &	spContainer,
		const Acts::Vector3 &	beamSpotPos,
		const Acts::Vector3 &	bField,
		ActsTrk::SeedContainer &	seedContainer
	)		const

pure virtualinherited

◆ createSeeds() [2/2]

StatusCode Gbts2ActsSeedingTool::createSeeds	(	const EventContext &	ctx,
		const Acts::SpacePointContainer< ActsTrk::SpacePointCollector, Acts::detail::RefHolder > &	spContainer,
		const Acts::Vector3 &	beamSpotPos,
		const Acts::Vector3 &	bField,
		ActsTrk::SeedContainer &	seedContainer
	)		const

overridevirtual

Definition at line 35 of file Gbts2ActsSeedingTool.cxx.

                                                                                                                                                                                                                                                     {
   
     std::unique_ptr<GNN_DataStorage> storage = std::make_unique<GNN_DataStorage>(*m_geo);
  
     SG::ReadCondHandle<InDet::BeamSpotData> beamSpotHandle { m_beamSpotKey, ctx };
     
     const Amg::Vector3D &vertex = beamSpotHandle->beamPos();
     
     float shift_x = vertex.x() - beamSpotHandle->beamTilt(0)*vertex.z();
     float shift_y = vertex.y() - beamSpotHandle->beamTilt(1)*vertex.z();
  
     std::vector<std::vector<GNN_Node> > node_storage;//layer-based collections
     node_storage.resize(m_are_pixels.size());
  
     for(auto& v : node_storage) v.reserve(100000);
     
     unsigned int nPixelLoaded = 0;
     unsigned int nStripLoaded = 0;
  
     for(size_t idx=0; idx<spContainer.size(); idx++){
         const auto & sp = spContainer.at(idx);
         const auto & extSP = sp.externalSpacePoint();
         const std::vector<xAOD::DetectorIDHashType>& elementlist = extSP.elementIdList() ;
  
         bool isPixel(elementlist.size() == 1);
  
     short layer = (isPixel ? m_pix_h2l : m_sct_h2l)->at(static_cast<int>(elementlist[0]));
  
     //convert incoming xaod spacepoints into GNN nodes
     
         GNN_Node& node = node_storage[layer].emplace_back(layer);
  
         const auto& pos = extSP.globalPosition();   
  
     node.m_x = pos.x() - shift_x;
     node.m_y = pos.y() - shift_y;
     node.m_z = pos.z();
         node.m_r = std::sqrt(std::pow(node.m_x, 2) + std::pow(node.m_y, 2));
     node.m_phi = std::atan2(node.m_y, node.m_x);
     node.m_idx = idx;
  
         if(isPixel && m_useML){
             const xAOD::PixelCluster* pCL = dynamic_cast<const xAOD::PixelCluster*>(extSP.measurements().front());
             if(pCL != nullptr){
                 node.m_pcw = pCL->widthInEta();
             }
         }
     }
  
     for(size_t l = 0; l < node_storage.size(); l++) {
  
       const std::vector<GNN_Node>& nodes = node_storage[l];
  
       if(nodes.size() == 0) continue;
     
       if(m_are_pixels[l]) 
     nPixelLoaded += storage->loadPixelGraphNodes(l, nodes, m_useML);
       else
     nStripLoaded += storage->loadStripGraphNodes(l, nodes);
     }
     
     ATH_MSG_DEBUG("Loaded "<<nPixelLoaded<<" pixel spacepoints and "<<nStripLoaded<<" strip spacepoints");
  
     storage->sortByPhi();
  
     storage->initializeNodes(m_useML);
  
     storage->generatePhiIndexing(1.5*m_phiSliceWidth);
  
     std::vector<GNN_Edge> edgeStorage;
  
     const TrigRoiDescriptor fakeRoi = TrigRoiDescriptor(0, -4.5, 4.5, 0, -M_PI, M_PI, 0, -150.0, 150.0);
  
     std::pair<int, int> graphStats = buildTheGraph(fakeRoi, storage, edgeStorage);
  
     ATH_MSG_DEBUG("Created graph with "<<graphStats.first<<" edges and "<<graphStats.second<< " edge links");
  
     int maxLevel = runCCA(graphStats.first, edgeStorage);
  
     ATH_MSG_DEBUG("Reached Level "<<maxLevel<<" after GNN iterations");
  
     int minLevel = 3;//a triplet + 2 confirmation
  
     if(m_LRTmode) {
         minLevel = 2;//a triplet + 1 confirmation
     }
  
     if(maxLevel < minLevel) return StatusCode::SUCCESS;
  
     std::vector<GNN_Edge*> vSeeds;
  
     vSeeds.reserve(graphStats.first/2);
  
     for(int edgeIndex = 0; edgeIndex < graphStats.first; edgeIndex++) {
       
       GNN_Edge* pS = &(edgeStorage.at(edgeIndex));
  
       if(pS->m_level < minLevel) continue;
  
       vSeeds.push_back(pS);
     }
  
     if(vSeeds.empty()) return StatusCode::SUCCESS;
  
     std::sort(vSeeds.begin(), vSeeds.end(), GNN_Edge::CompareLevel());
  
     //backtracking
  
     TrigFTF_GNN_TrackingFilter tFilter(m_layerGeometry, edgeStorage);
  
     for(auto pS : vSeeds) {
         if(pS->m_level == -1) continue;
  
         TrigFTF_GNN_EdgeState rs(false);
  
         tFilter.followTrack(pS, rs);
  
         if(!rs.m_initialized) {
             continue;
         }
  
         if(static_cast<int>(rs.m_vs.size()) < minLevel) continue;
  
         std::vector<const GNN_Node*> vN;
  
         for(std::vector<GNN_Edge*>::reverse_iterator sIt=rs.m_vs.rbegin();sIt!=rs.m_vs.rend();++sIt) {
             (*sIt)->m_level = -1;//mark as collected
             
             if(sIt == rs.m_vs.rbegin()) {
                 vN.push_back((*sIt)->m_n1);
             }
  
             vN.push_back((*sIt)->m_n2);
         
         }
  
         if(vN.size()<3) continue;
     
     const auto & sp1 = spContainer.at(vN[0]->sp_idx()).externalSpacePoint();
     const auto & sp2 = spContainer.at(vN[1]->sp_idx()).externalSpacePoint();
     const auto & sp3 = spContainer.at(vN[2]->sp_idx()).externalSpacePoint();
     
     //add seed to output
  
     std::unique_ptr<ActsTrk::Seed> to_add = std::make_unique<ActsTrk::Seed>(sp1, sp2, sp3);
     
         seedContainer.push_back(std::move(to_add));
     }
  
     ATH_MSG_DEBUG("GBTS created "<<seedContainer.size()<<" seeds");
  
     return StatusCode::SUCCESS;
 }

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

◆ DeclareInterfaceID()

ActsTrk::ISeedingTool::DeclareInterfaceID	(	ISeedingTool	,
		1	,
		0
	)

inherited

◆ 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

◆ finalize()

StatusCode Gbts2ActsSeedingTool::finalize ( )

overridevirtual

Reimplemented from SeedingToolBase.

Definition at line 31 of file Gbts2ActsSeedingTool.cxx.

                                           {
   return SeedingToolBase::finalize();
 }

◆ initialize()

StatusCode Gbts2ActsSeedingTool::initialize ( )

overridevirtual

Reimplemented from SeedingToolBase.

Definition at line 20 of file Gbts2ActsSeedingTool.cxx.

                                            {
     ATH_CHECK(SeedingToolBase::initialize());
     ATH_CHECK(m_beamSpotKey.initialize());
     m_sct_h2l = m_layerNumberTool->sctLayers();
     m_pix_h2l = m_layerNumberTool->pixelLayers();
     m_are_pixels.resize(m_layerNumberTool->maxNumberOfUniqueLayers(), true);
     for(const auto& l : *m_sct_h2l) m_are_pixels[l] = false;
     
     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.

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

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

◆ runCCA()

int SeedingToolBase::runCCA	(	int	nEdges,
		std::vector< GNN_Edge > &	edgeStorage
	)		const

protectedinherited

Definition at line 293 of file SeedingToolBase.cxx.

                                                                                       {
  
   const int maxIter = 15;
  
   int maxLevel = 0;
  
   int iter = 0;
   
   std::vector<TrigFTF_GNN_Edge*> v_old;
   
   for(int edgeIndex=0;edgeIndex<nEdges;edgeIndex++) {
  
     TrigFTF_GNN_Edge* pS = &(edgeStorage[edgeIndex]);
     if(pS->m_nNei == 0) continue;
     
     v_old.push_back(pS);//TO-DO: increment level for segments as they already have at least one neighbour
   }
  
   for(;iter<maxIter;iter++) {
  
     //generate proposals
     std::vector<TrigFTF_GNN_Edge*> v_new;
     v_new.clear();
     v_new.reserve(v_old.size());
     
     for(auto pS : v_old) {
       
       int next_level = pS->m_level;
           
       for(int nIdx=0;nIdx<pS->m_nNei;nIdx++) {
     
         unsigned int nextEdgeIdx = pS->m_vNei[nIdx];
             
         TrigFTF_GNN_Edge* pN = &(edgeStorage[nextEdgeIdx]);
             
         if(pS->m_level == pN->m_level) {
           next_level = pS->m_level + 1;
           v_new.push_back(pS);
           break;
         }
       }
       
       pS->m_next = next_level;//proposal
     }
   
     //update
  
     int nChanges = 0;
       
     for(auto pS : v_new) {
       if(pS->m_next != pS->m_level) {
         nChanges++;
         pS->m_level = pS->m_next;
         if(maxLevel < pS->m_level) maxLevel = pS->m_level;
       }
     }
  
     if(nChanges == 0) break;
  
  
     v_old = std::move(v_new);
     v_new.clear();
   }
  
   return maxLevel;  
 }

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

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

std::vector<bool> Gbts2ActsSeedingTool::m_are_pixels

protected

Definition at line 38 of file Gbts2ActsSeedingTool.h.

◆ m_atlasId

const AtlasDetectorID* SeedingToolBase::m_atlasId = nullptr

protectedinherited

Definition at line 45 of file SeedingToolBase.h.

◆ m_beamSpotKey

SG::ReadCondHandleKey<InDet::BeamSpotData> Gbts2ActsSeedingTool::m_beamSpotKey { this, "BeamSpotKey", "BeamSpotData", "SG key for beam spot" }

protected

Definition at line 34 of file Gbts2ActsSeedingTool.h.

◆ m_connectionFile

StringProperty SeedingToolBase::m_connectionFile {this, "ConnectionFileName", "binTables_ITK_RUN4.txt"}

protectedinherited

Definition at line 59 of file SeedingToolBase.h.

◆ m_connector

std::unique_ptr<GNN_FasTrackConnector> SeedingToolBase::m_connector = nullptr

protectedinherited

Definition at line 63 of file SeedingToolBase.h.

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

BooleanProperty SeedingToolBase::m_doubletFilterRZ {this, "Doublet_FilterRZ", true}

protectedinherited

Definition at line 55 of file SeedingToolBase.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_filter_phi

BooleanProperty SeedingToolBase::m_filter_phi {this, "DoPhiFiltering", true}

protectedinherited

Definition at line 49 of file SeedingToolBase.h.

◆ m_geo

std::unique_ptr<const TrigFTF_GNN_Geometry> SeedingToolBase::m_geo = nullptr

protectedinherited

Definition at line 65 of file SeedingToolBase.h.

◆ m_layerGeometry

std::vector<TrigInDetSiLayer> SeedingToolBase::m_layerGeometry

protectedinherited

Definition at line 64 of file SeedingToolBase.h.

◆ m_layerNumberTool

ToolHandle<ITrigL2LayerNumberTool> SeedingToolBase::m_layerNumberTool {this, "layerNumberTool", "TrigL2LayerNumberToolITk"}

protectedinherited

Definition at line 43 of file SeedingToolBase.h.

◆ m_LRTmode

BooleanProperty SeedingToolBase::m_LRTmode {this, "LRTMode",false}

protectedinherited

Definition at line 51 of file SeedingToolBase.h.

◆ m_minPt

FloatProperty SeedingToolBase::m_minPt {this, "pTmin", 1000.0}

protectedinherited

Definition at line 57 of file SeedingToolBase.h.

◆ m_nMaxEdges

IntegerProperty SeedingToolBase::m_nMaxEdges {this, "MaxGraphEdges", 2000000}

protectedinherited

Definition at line 58 of file SeedingToolBase.h.

◆ m_nMaxPhiSlice

UnsignedIntegerProperty SeedingToolBase::m_nMaxPhiSlice {this, "nMaxPhiSlice", 53}

protectedinherited

Definition at line 54 of file SeedingToolBase.h.

◆ m_phiSliceWidth

float SeedingToolBase::m_phiSliceWidth = 0.

protectedinherited

Definition at line 61 of file SeedingToolBase.h.

◆ m_pix_h2l

const std::vector<short>* Gbts2ActsSeedingTool::m_pix_h2l {nullptr}

protected

Definition at line 37 of file Gbts2ActsSeedingTool.h.

◆ m_pixelId

const PixelID* SeedingToolBase::m_pixelId = nullptr

protectedinherited

Definition at line 47 of file SeedingToolBase.h.

◆ m_sct_h2l

const std::vector<short>* Gbts2ActsSeedingTool::m_sct_h2l {nullptr}

protected

Definition at line 36 of file Gbts2ActsSeedingTool.h.

◆ m_sctId

const SCT_ID* SeedingToolBase::m_sctId = nullptr

protectedinherited

Definition at line 46 of file SeedingToolBase.h.

◆ m_useBeamTilt

BooleanProperty SeedingToolBase::m_useBeamTilt {this, "UseBeamTilt", false}

protectedinherited

Definition at line 50 of file SeedingToolBase.h.

◆ m_useEtaBinning

BooleanProperty SeedingToolBase::m_useEtaBinning {this, "UseEtaBinning", true}

protectedinherited

Definition at line 56 of file SeedingToolBase.h.

◆ m_useML

BooleanProperty SeedingToolBase::m_useML {this, "useML", true}

protectedinherited

Definition at line 52 of file SeedingToolBase.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

Protected Types

Protected Member Functions

Protected Attributes

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ GNN_DataStorage

◆ GNN_Edge

◆ GNN_Node

◆ StoreGateSvc_t

Constructor & Destructor Documentation

◆ Gbts2ActsSeedingTool()

◆ ~Gbts2ActsSeedingTool()

Member Function Documentation

◆ buildTheGraph()

◆ createSeeds() [1/2]

◆ createSeeds() [2/2]

◆ declareGaudiProperty() [1/4]

◆ declareGaudiProperty() [2/4]

◆ declareGaudiProperty() [3/4]

◆ declareGaudiProperty() [4/4]

◆ DeclareInterfaceID()

◆ 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()

◆ finalize()

◆ initialize()

◆ inputHandles()

◆ msg() [1/2]

◆ msg() [2/2]

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ runCCA()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

Member Data Documentation

◆ m_are_pixels

◆ m_atlasId

◆ m_beamSpotKey

◆ m_connectionFile

◆ m_connector

◆ m_detStore

◆ m_doubletFilterRZ

◆ m_evtStore

◆ m_filter_phi

◆ m_geo

◆ m_layerGeometry

◆ m_layerNumberTool

◆ m_LRTmode

◆ m_minPt

◆ m_nMaxEdges

◆ m_nMaxPhiSlice

◆ m_phiSliceWidth

◆ m_pix_h2l

◆ m_pixelId

◆ m_sct_h2l

◆ m_sctId

◆ m_useBeamTilt

◆ m_useEtaBinning

◆ m_useML

◆ m_varHandleArraysDeclared

◆ m_vhka