#include <CombinatorialNSWSeedFinderAlg.h>

Inheritance diagram for MuonR4::CombinatorialNSWSeedFinderAlg:

Collaboration diagram for MuonR4::CombinatorialNSWSeedFinderAlg:

Public Member Functions
virtual	~CombinatorialNSWSeedFinderAlg ()=default

virtual StatusCode	initialize () override

virtual StatusCode	execute (const EventContext &ctx) const override

virtual StatusCode	sysInitialize () override
	Override sysInitialize. More...

virtual bool	isClonable () const override
	Specify if the algorithm is clonable. More...

virtual unsigned int	cardinality () const override
	Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant. More...

virtual StatusCode	sysExecute (const EventContext &ctx) override
	Execute an algorithm. More...

virtual const DataObjIDColl &	extraOutputDeps () const override
	Return the list of extra output dependencies. More...

virtual bool	filterPassed (const EventContext &ctx) const

virtual void	setFilterPassed (bool state, const EventContext &ctx) 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	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
std::unique_ptr< SegmentSeed >	buildSegmentSeed (HitVec &hits, const AmgSymMatrix(2)&bMatrix, const HoughMaximum &max, const HitLayVec &extensionLayers) const

HitVec	extendHits (const Amg::Vector3D &startPos, const Amg::Vector3D &direction, const HitLayVec &stripHitsLayers) const

std::vector< std::unique_ptr< SegmentSeed > >	findSeedsFromMaximum (const HoughMaximum &max, const ActsGeometryContext &gctx) const

HitLayVec	findCombinatoricHits (const Amg::Vector3D &beamSpot, const HitLayVec &combinatoricLayers) const

HitWindow	findHitInWindow (const Amg::Vector3D &startPos, const SpacePoint *testHit, const Amg::Vector3D &dirEstUp, const Amg::Vector3D &dirEstDn) const

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
SG::ReadHandleKey< EtaHoughMaxContainer >	m_etaKey {this, "CombinatorialReadKey", "MuonHoughNswMaxima"}

SG::WriteHandleKey< SegmentSeedContainer >	m_writeKey {this, "CombinatorialPhiWriteKey", "MuonHoughNswSegmentSeeds"}

SG::ReadHandleKey< ActsGeometryContext >	m_geoCtxKey {this, "AlignmentKey", "ActsAlignment", "cond handle key"}

ServiceHandle< Muon::IMuonIdHelperSvc >	m_idHelperSvc {this, "MuonIdHelperSvc", "Muon::MuonIdHelperSvc/MuonIdHelperSvc"}

const MuonGMR4::MuonDetectorManager *	m_detMgr {nullptr}

DoubleProperty	m_windowTheta {this, "m_windowTheta", 0.5 * Gaudi::Units::deg}

DoubleProperty	m_minPullThreshold {this, "m_minPullThreshold", 5.}

ToolHandle< MuonValR4::IPatternVisualizationTool >	m_visionTool {this, "VisualizationTool", ""}
	Pattern visualization tool. More...

DataObjIDColl	m_extendedExtraObjects
	Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks. More...

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 39 of file CombinatorialNSWSeedFinderAlg.h.

Member Typedef Documentation

◆ StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ ~CombinatorialNSWSeedFinderAlg()

virtual MuonR4::CombinatorialNSWSeedFinderAlg::~CombinatorialNSWSeedFinderAlg ( )

virtualdefault

Member Function Documentation

◆ buildSegmentSeed()

std::unique_ptr< SegmentSeed > MuonR4::CombinatorialNSWSeedFinderAlg::buildSegmentSeed	(	HitVec &	hits,
		const AmgSymMatrix(2)&	bMatrix,
		const HoughMaximum &	max,
		const HitLayVec &	extensionLayers
	)		const

private

Definition at line 200 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                                                         {
     // we require at least four hits for the seeding
     if (hits.size() != minLayers) {
         ATH_MSG_VERBOSE("Seed Rejection: Wrong number of initial layers for seeding --they should be four");
         return nullptr;
     }
  
     std::array<double, 4> params = CombinatorialSeedSolver::defineParameters(bMatrix, hits);
  
     const auto [segPos, direction] = CombinatorialSeedSolver::seedSolution(hits, params);
  
     double tanPhi = houghTanPhi(direction);
     double tanTheta = houghTanTheta(direction);
  
     double interceptX = segPos.x();
     double interceptY = segPos.y();
     // check the consistency of the parameters - expected to lay in the strip's
     // length
     for (std::size_t i = 0; i < 4; i++) {
         const xAOD::UncalibratedMeasurement *primaryMeas = hits[i]->primaryMeasurement();
  
         if (primaryMeas->type() == xAOD::UncalibMeasType::MMClusterType) {
             const auto *clust = static_cast<const xAOD::MMCluster *>(primaryMeas);
             
             double halfLength = 0.5 * clust->readoutElement()->stripLayer(clust->measurementHash()).design().stripLength(clust->channelNumber());
         
             if (std::abs(params[i]) > halfLength) {
                 ATH_MSG_VERBOSE("Seed Rejection: Invalid seed - outside of the strip's length");
                 return nullptr;
             }
         }
     }
  
     // extend the seed to the segment -- include hits from the other layers too
     auto extendedHits = extendHits(segPos, direction, extensionLayers);
     hits.insert(hits.end(), extendedHits.begin(), extendedHits.end());
     return std::make_unique<SegmentSeed>(tanTheta, interceptY, tanPhi,
                                          interceptX, hits.size(),
                                          std::move(hits), max.parentBucket());
 }

◆ cardinality()

unsigned int AthCommonReentrantAlgorithm< Gaudi::Algorithm >::cardinality

overridevirtualinherited

Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.

Override this to return 0 for reentrant algorithms.

Definition at line 75 of file AthCommonReentrantAlgorithm.cxx.

 {
   return 0;
 }

◆ declareGaudiProperty() [1/4]

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

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

◆ declareGaudiProperty() [2/4]

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

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

◆ declareGaudiProperty() [3/4]

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

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

◆ declareGaudiProperty() [4/4]

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

   {
     return PBASE::declareProperty(t);
   }

◆ declareProperty() [1/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::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< Gaudi::Algorithm > >::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< Gaudi::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.

   {
  
     // 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< Gaudi::Algorithm > >::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< Gaudi::Algorithm > >::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< Gaudi::Algorithm > >::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< Gaudi::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< Gaudi::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< Gaudi::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 MuonR4::CombinatorialNSWSeedFinderAlg::execute ( const EventContext & ctx ) const

overridevirtual

Definition at line 336 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                                                {
     // read the inputs
     const EtaHoughMaxContainer *maxima{nullptr};
     ATH_CHECK(SG::get( maxima, m_etaKey, ctx));
  
     const ActsGeometryContext *gctx{nullptr};
     ATH_CHECK(SG::get(gctx, m_geoCtxKey, ctx));
  
     // prepare our output collection
     SG::WriteHandle writeMaxima{m_writeKey, ctx};
     ATH_CHECK(writeMaxima.record(std::make_unique<SegmentSeedContainer>()));
  
     // we use the information from the previous eta-hough transform
     // to get the combined hits that belong in the same maxima
     for (const HoughMaximum *max : *maxima) {
         std::vector<std::unique_ptr<SegmentSeed>> seeds = findSeedsFromMaximum(*max, *gctx);
      
         for(const auto& hitMax : max->getHitsInMax()){
                 ATH_MSG_VERBOSE("Hit "<<m_idHelperSvc->toString(hitMax->identify())<<", "
                               <<Amg::toString(hitMax->positionInChamber())<<", dir: "<<Amg::toString(hitMax->directionInChamber()));
         }
  
         for (auto &seed : seeds) {
             ATH_MSG_VERBOSE("Seed tanTheta = "<<seed->tanTheta()<<", y0 = "<<seed->interceptY()
                          <<", tanPhi = "<<seed->tanPhi()<<", x0 = "<<seed->interceptX()<<", hits in the seed "<<seed->getHitsInMax().size());
         
             for(const auto& hit : seed->getHitsInMax()){
                 ATH_MSG_VERBOSE("Hit "<<m_idHelperSvc->toString(hit->identify())<<", "
                               <<Amg::toString(hit->positionInChamber())<<", dir: "<<Amg::toString(hit->directionInChamber()));
             }
             if (m_visionTool.isEnabled()) {          
             m_visionTool->visualizeSeed(ctx, *seed, "#phi-combinatorialSeed");
             }
             writeMaxima->push_back(std::move(seed));
         }
     }
  
  
     return StatusCode::SUCCESS;
 }

◆ extendHits()

HitVec MuonR4::CombinatorialNSWSeedFinderAlg::extendHits	(	const Amg::Vector3D &	startPos,
		const Amg::Vector3D &	direction,
		const HitLayVec &	stripHitsLayers
	)		const

private

Definition at line 151 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                                                        {
     
     //the hits we need to return to extend the segment seed
     HitVec combinatoricHits;
     
     //the stripHitsLayers are already the unused ones - only use for the extension
     for (unsigned int i = 0; i < stripHitsLayers.size(); i++) {
  
         double offset = stripHitsLayers[i].front()->positionInChamber().dot(stripHitsLayers[i].front()->planeNormal());
         const Amg::Vector3D extrapPos = startPos + Amg::intersect<3>(startPos, direction, stripHitsLayers[i].front()->planeNormal(), offset).value_or(0) *  direction;
  
         unsigned int indexOfHit = stripHitsLayers[i].size()+1;
         unsigned int triedHit{0};
         double minPull{std::numeric_limits<double>::max()};
        
         // loop over the hits on the same layer
         for (unsigned int j = 0; j < stripHitsLayers[i].size(); j++) {
             auto hit = stripHitsLayers[i].at(j);   
             double pull = std::sqrt(SegmentFitHelpers::chiSqTermStrip(extrapPos, direction, *hit, msg()));
             ATH_MSG_VERBOSE("Trying extension with hit " << m_idHelperSvc->toString(hit->identify()));
            
             //find the hit with the minimum pull (check at least one hit after we have increasing pulls)
             if (pull > minPull) {
               
                 triedHit+=1;  
                 continue;                 
             }
  
             if(triedHit>1){
                 break;
             }
  
             indexOfHit = j;
             minPull = pull;
         }
  
         // complete the seed with the extended hits
         if (minPull < m_minPullThreshold) {
             ATH_MSG_VERBOSE("Extension successfull - hit" << m_idHelperSvc->toString(stripHitsLayers[i].at(indexOfHit)->identify())<<", pos: "
                               <<Amg::toString(stripHitsLayers[i].at(indexOfHit)->positionInChamber())<<", dir: "<<Amg::toString(stripHitsLayers[i].at(indexOfHit)->directionInChamber())<<" found with pull "<<minPull);
             combinatoricHits.push_back(stripHitsLayers[i].at(indexOfHit));
         }
     }
     return combinatoricHits;
 }

◆ extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< Gaudi::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 & AthCommonReentrantAlgorithm< Gaudi::Algorithm >::extraOutputDeps

overridevirtualinherited

Return the list of extra output dependencies.

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

Definition at line 94 of file AthCommonReentrantAlgorithm.cxx.

 {
   // If we didn't find any symlinks to add, just return the collection
   // from the base class.  Otherwise, return the extended collection.
   if (!m_extendedExtraObjects.empty()) {
     return m_extendedExtraObjects;
   }
   return BaseAlg::extraOutputDeps();
 }

◆ filterPassed()

virtual bool AthCommonReentrantAlgorithm< Gaudi::Algorithm >::filterPassed ( const EventContext & ctx ) const

inlinevirtualinherited

Definition at line 96 of file AthCommonReentrantAlgorithm.h.

                                                            {
     return execState( ctx ).filterPassed();
   }

◆ findCombinatoricHits()

HitLayVec MuonR4::CombinatorialNSWSeedFinderAlg::findCombinatoricHits	(	const Amg::Vector3D &	beamSpot,
		const HitLayVec &	combinatoricLayers
	)		const

private

Construct the beamspot to first hit connection to guestimate the angle

Apply cut window on theta of the seed.

Definition at line 89 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                                                                          {
   
  
     HitLayVec seedHitsFromLayers{};
     //try all the hits combinations from the layers for now (--rethink about optimized way)
     unsigned int iterLay0{0}, iterLay1{0}, iterLay2{0}, iterLay3{0};    
     unsigned int startLay1{0}, startLay2{0}, startLay3{0};
     
     for( ; iterLay0 <  combinatoricLayers[0].size() ; ++iterLay0){
  
         const SpacePoint* hit0 = combinatoricLayers[0][iterLay0];
         const Amg::Vector3D initSeedDir{(beamSpot - hit0->positionInChamber()).unit()};
         const Amg::Vector3D dirEstUp = Amg::dirFromAngles(initSeedDir.phi(), initSeedDir.theta() - m_windowTheta); 
         const Amg::Vector3D dirEstDn = Amg::dirFromAngles(initSeedDir.phi(), initSeedDir.theta() + m_windowTheta); 
  
         ATH_MSG_VERBOSE("Reference hit: "<<m_idHelperSvc->toString(hit0->identify())
                     <<", position: "<<Amg::toString(hit0->positionInChamber())<<" seed dir: "<<Amg::toString(initSeedDir)
                 <<"  seed plane"<<Amg::toString(beamSpot + Amg::intersect<3>(beamSpot, initSeedDir, hit0->planeNormal(),
                                                                 hit0->planeNormal().dot(hit0->positionInChamber())).value_or(0.) * initSeedDir ));
         for( iterLay1 = startLay1; iterLay1 <  combinatoricLayers[1].size() ; ++iterLay1){
             const SpacePoint* hit1 = combinatoricLayers[1][iterLay1];
             const auto hit1InWindow = findHitInWindow(beamSpot, hit1, dirEstUp, dirEstDn);
             // hit is above- hits are sorted in y so break the loops (we need 4 hits for the seed = no reason to check the others)
             if(hit1InWindow == HitWindow::tooHigh) {
                 break;
             }else if(hit1InWindow == HitWindow::tooLow){
                 startLay1=iterLay1;
                 continue;
             }
             for( iterLay2 = startLay2; iterLay2 < combinatoricLayers[2].size() ; ++iterLay2){
                 const SpacePoint* hit2 = combinatoricLayers[2][iterLay2];
                 const auto hit2InWindow = findHitInWindow(beamSpot, hit2, dirEstUp, dirEstDn);
                 if (hit2InWindow == HitWindow::tooHigh){
                     iterLay1 = combinatoricLayers[1].size();
                     break;
                 }else if(hit2InWindow == HitWindow::tooLow){
                     startLay2=iterLay2;
                     continue;
                 }    
                 for( iterLay3 = startLay3; iterLay3 < combinatoricLayers[3].size(); ++iterLay3){
                     const SpacePoint* hit3 = combinatoricLayers[3][iterLay3];
                     const auto hit3InWindow = findHitInWindow(beamSpot, hit3, dirEstUp, dirEstDn);
                     if (hit3InWindow == HitWindow::tooHigh){
                         iterLay1 = combinatoricLayers[1].size();
                         iterLay2 = combinatoricLayers[2].size();
                         break;
                     }else if(hit3InWindow == HitWindow::tooLow){
                         startLay3=iterLay3;
                         continue;
                     }
                     seedHitsFromLayers.emplace_back(HitVec{hit0, hit1, hit2, hit3}); 
                 }
             }
         }
     }
     return seedHitsFromLayers;
 }

◆ findHitInWindow()

HitWindow MuonR4::CombinatorialNSWSeedFinderAlg::findHitInWindow	(	const Amg::Vector3D &	startPos,
		const SpacePoint *	testHit,
		const Amg::Vector3D &	dirEstUp,
		const Amg::Vector3D &	dirEstDn
	)		const

private

Calculate the strip edges

Definition at line 49 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                                                           {
  
     const double planeOffSet = testHit->positionInChamber().dot(testHit->planeNormal());
  
     const Amg::Vector3D estPlaneArrivalUp = startPos+ 
         Amg::intersect<3>(startPos, dirEstUp, testHit->planeNormal(), planeOffSet).value_or(0) * dirEstUp;
     const Amg::Vector3D estPlaneArrivalDn = startPos + 
         Amg::intersect<3>(startPos, dirEstDn, testHit->planeNormal(), planeOffSet).value_or(0) * dirEstDn;
  
     switch (testHit->type()) {
     case xAOD::UncalibMeasType::MMClusterType:{
     const auto* prd = static_cast<const xAOD::MMCluster*>(testHit->primaryMeasurement());
  
     const double halfLength =  prd->readoutElement()->stripLayer(prd->measurementHash()).design().stripLength(prd->channelNumber()) * 0.5;
     const Amg::Vector3D leftEdge = testHit->positionInChamber() - halfLength * testHit->directionInChamber();
     const Amg::Vector3D rightEdge = testHit->positionInChamber() + halfLength * testHit->directionInChamber();
  
     const bool below = estPlaneArrivalDn.y() > std::max(leftEdge.y(), rightEdge.y());
     const bool above = estPlaneArrivalUp.y() < std::min(leftEdge.y(), rightEdge.y()); 
     ATH_MSG_DEBUG("Hit " << m_idHelperSvc->toString(testHit->identify())
                         << (below || above ? " is outside the window" : " is inside the window"));
  
   
     if(below) return HitWindow::tooLow;
     if(above) return HitWindow::tooHigh;
     
     return HitWindow::inside;
     }
     default:
     ATH_MSG_DEBUG("STGCs not implemented yet - I will do ");
     break;
     }
     //return randmoly an outside hit for now
     return HitWindow::tooHigh;
 };

◆ findSeedsFromMaximum()

std::vector< std::unique_ptr< SegmentSeed > > MuonR4::CombinatorialNSWSeedFinderAlg::findSeedsFromMaximum	(	const HoughMaximum &	max,
		const ActsGeometryContext &	gctx
	)		const

private

Definition at line 245 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                                                                                   {
     // first sort the hits per layer from the maximum
     SpacePointPerLayerSplitter hitLayers{max.getHitsInMax()};
  
     HitLayVec stripHitsLayers{hitLayers.stripHits()};
  
     std::vector<std::unique_ptr<SegmentSeed>> seeds;
  
     unsigned int layerSize = stripHitsLayers.size();
  
     if (layerSize < minLayers) {
         ATH_MSG_VERBOSE("Not enough layers to build a seed");
         return seeds;
     }
  
     if (m_visionTool.isEnabled()) {
         MuonValR4::IPatternVisualizationTool::PrimitiveVec primitives{};
         const auto truthHits = getMatchingSimHits(max.getHitsInMax());
         constexpr double legX{0.2};
         double legY{0.8};
         for (const SpacePoint* sp : max.getHitsInMax()) {
             const auto* mmClust = static_cast<const xAOD::MMCluster*>(sp->primaryMeasurement());
             const xAOD::MuonSimHit* simHit = getTruthMatchedHit(*mmClust);
             if (!simHit || !MC::isMuon(simHit)) continue;
             const MuonGMR4::MmReadoutElement* reEle = mmClust->readoutElement();
             const MuonGMR4::StripDesign& design = reEle->stripLayer(mmClust->measurementHash()).design();
             const Amg::Transform3D toChamb = reEle->msSector()->globalToLocalTrans(gctx) * 
                                              reEle->localToGlobalTrans(gctx, simHit->identify());
             const Amg::Vector3D hitPos = toChamb * xAOD::toEigen(simHit->localPosition());
             const Amg::Vector3D hitDir = toChamb.linear() * xAOD::toEigen(simHit->localDirection());
         
             const double pull = std::sqrt(SegmentFitHelpers::chiSqTermStrip(hitPos,hitDir, *sp, msgStream()));
             const double pull2 = (mmClust->localPosition<1>().x() - simHit->localPosition().x()) / std::sqrt(mmClust->localCovariance<1>().x());
             primitives.push_back(MuonValR4::drawLabel(std::format("ml: {:1d}, gap: {:1d}, {:}, pull: {:.2f} / {:.2f}", reEle->multilayer(), mmClust->gasGap(), 
                                 !design.hasStereoAngle() ? "X" : design.stereoAngle() >0 ? "U": "V",pull, pull2),legX,legY,14));
             legY-=0.05;           
         }
         m_visionTool->visualizeBucket(Gaudi::Hive::currentContext(), *max.parentBucket(),
                                       "truth", std::move(primitives));
     }
  
     const Amg::Transform3D globToLocal = max.msSector()->globalToLocalTrans(gctx);
     std::array<const SpacePoint*, 4> seedHits{};
     for (std::size_t i = 0; i < layerSize - 3; ++i) {
         seedHits[0] = stripHitsLayers[i].front();
         for (std::size_t j = i + 1; j < layerSize - 2; ++j) {
             seedHits[1] = stripHitsLayers[j].front();
             for (std::size_t k = j + 1; k < layerSize - 1; ++k) {
                 seedHits[2] = stripHitsLayers[k].front();
                 for (std::size_t l = k + 1; l < layerSize; ++l) {
                     seedHits[3] = stripHitsLayers[l].front();
                     AmgSymMatrix(2) bMatrix = CombinatorialSeedSolver::betaMatrix(seedHits);                   
                     if (std::abs(bMatrix.determinant()) < 1.e-6) {
                        
                         continue;
                     }
                   
                     const HitLayVec layers{stripHitsLayers[i], stripHitsLayers[j], stripHitsLayers[k], stripHitsLayers[l]};
              
     
                     // each layer may have more than one hit - take the hit combinations                    
                      HitLayVec result = findCombinatoricHits(globToLocal.translation(), layers);
  
                      //the layers not participated in the seed build - gonna be used for the extension  
                     HitLayVec extensionLayers;
                     std::copy_if(stripHitsLayers.begin(), stripHitsLayers.end(), std::back_inserter(extensionLayers),
                                 [&layers,this](const HitVec& stripLayer){
                                 const Identifier gasGapId = m_idHelperSvc->gasGapId(stripLayer.front()->identify());
                                 return std::ranges::find_if(layers,[&gasGapId, this](const HitVec& spacePoints){
                                     return gasGapId == m_idHelperSvc->gasGapId(spacePoints.front()->identify());
                                 }) == layers.end();
                     });               
  
                     // we have made sure to have hits from all the four layers -
                     // start by 4 hits for the seed and try to build the seed for the combinatorics found
                     for (auto &combinatoricHits : result) {
                         auto seed = buildSegmentSeed(combinatoricHits, bMatrix, max, extensionLayers);
                         if (seed) {
                             seeds.push_back(std::move(seed));
                             
                         }
                     }
          
                 }
             }
         }
     }
  
     return seeds;
 }

◆ initialize()

StatusCode MuonR4::CombinatorialNSWSeedFinderAlg::initialize ( )

overridevirtual

Definition at line 33 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                      {
     ATH_CHECK(m_geoCtxKey.initialize());
     ATH_CHECK(m_etaKey.initialize());
     ATH_CHECK(m_writeKey.initialize());
     ATH_CHECK(m_idHelperSvc.retrieve());
     ATH_CHECK(m_visionTool.retrieve(DisableTool{m_visionTool.empty()}));
     ATH_CHECK(detStore()->retrieve(m_detMgr));
  
     if (!(m_idHelperSvc->hasMM() || m_idHelperSvc->hasSTGC())) {
         ATH_MSG_ERROR("MM or STGC not part of initialized detector layout");
         return StatusCode::FAILURE;
     }
    
     return StatusCode::SUCCESS;
 }

◆ inputHandles()

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

◆ isClonable()

bool AthCommonReentrantAlgorithm< Gaudi::Algorithm >::isClonable

overridevirtualinherited

Specify if the algorithm is clonable.

Reentrant algorithms are clonable.

Definition at line 68 of file AthCommonReentrantAlgorithm.cxx.

 {
   // Reentrant algorithms are clonable.
   return true;
 }

◆ msg() [1/2]

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                 {
     return this->msgStream();
   }

◆ msg() [2/2]

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

inlineinherited

Definition at line 27 of file AthCommonMsg.h.

                                                   {
     return this->msgStream(lvl);
   }

◆ msgLvl()

bool AthCommonMsg< Gaudi::Algorithm >::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< Gaudi::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.

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

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

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

◆ renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                           {
     handlesArray.renounce();
   }

◆ setFilterPassed()

virtual void AthCommonReentrantAlgorithm< Gaudi::Algorithm >::setFilterPassed	(	bool	state,
		const EventContext &	ctx
	)		const

inlinevirtualinherited

Definition at line 100 of file AthCommonReentrantAlgorithm.h.

                                                                             {
     execState( ctx ).setFilterPassed( state );
   }

◆ sysExecute()

StatusCode AthCommonReentrantAlgorithm< Gaudi::Algorithm >::sysExecute ( const EventContext & ctx )

overridevirtualinherited

Execute an algorithm.

We override this in order to work around an issue with the Algorithm base class storing the event context in a member variable that can cause crashes in MT jobs.

Definition at line 85 of file AthCommonReentrantAlgorithm.cxx.

 {
   return BaseAlg::sysExecute (ctx);
 }

◆ sysInitialize()

StatusCode AthCommonReentrantAlgorithm< Gaudi::Algorithm >::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< Gaudi::Algorithm > >.

Reimplemented in InputMakerBase, and HypoBase.

Definition at line 61 of file AthCommonReentrantAlgorithm.cxx.

                                                                {
   StatusCode sc=AthCommonDataStore<AthCommonMsg<BaseAlg>>::sysInitialize();
  
   if (sc.isFailure()) {
     return sc;
   }
   
   ServiceHandle<ICondSvc> cs("CondSvc",name());
   for (auto h : outputHandles()) {
     if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
       // do this inside the loop so we don't create the CondSvc until needed
       if ( cs.retrieve().isFailure() ) {
         ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
         return StatusCode::SUCCESS;
       }      
       if (cs->regHandle(this,*h).isFailure()) {
         sc = StatusCode::FAILURE;
         ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
                       << " with CondSvc");
       }
     }
   }
   return sc;  
 }

◆ sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< Gaudi::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< Gaudi::Algorithm > >::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_detMgr

const MuonGMR4::MuonDetectorManager* MuonR4::CombinatorialNSWSeedFinderAlg::m_detMgr {nullptr}

private

Definition at line 61 of file CombinatorialNSWSeedFinderAlg.h.

◆ m_detStore

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

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

◆ m_etaKey

SG::ReadHandleKey<EtaHoughMaxContainer> MuonR4::CombinatorialNSWSeedFinderAlg::m_etaKey {this, "CombinatorialReadKey", "MuonHoughNswMaxima"}

private

Definition at line 49 of file CombinatorialNSWSeedFinderAlg.h.

◆ m_evtStore

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

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

◆ m_extendedExtraObjects

DataObjIDColl AthCommonReentrantAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects

privateinherited

Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.

Empty if no symlinks were found.

Definition at line 114 of file AthCommonReentrantAlgorithm.h.

◆ m_geoCtxKey

SG::ReadHandleKey<ActsGeometryContext> MuonR4::CombinatorialNSWSeedFinderAlg::m_geoCtxKey {this, "AlignmentKey", "ActsAlignment", "cond handle key"}

private

Definition at line 55 of file CombinatorialNSWSeedFinderAlg.h.

◆ m_idHelperSvc

ServiceHandle<Muon::IMuonIdHelperSvc> MuonR4::CombinatorialNSWSeedFinderAlg::m_idHelperSvc {this, "MuonIdHelperSvc", "Muon::MuonIdHelperSvc/MuonIdHelperSvc"}

private

Definition at line 58 of file CombinatorialNSWSeedFinderAlg.h.

◆ m_minPullThreshold

DoubleProperty MuonR4::CombinatorialNSWSeedFinderAlg::m_minPullThreshold {this, "m_minPullThreshold", 5.}

private

Definition at line 86 of file CombinatorialNSWSeedFinderAlg.h.

◆ m_varHandleArraysDeclared

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

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

◆ m_vhka

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

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

◆ m_visionTool

ToolHandle<MuonValR4::IPatternVisualizationTool> MuonR4::CombinatorialNSWSeedFinderAlg::m_visionTool {this, "VisualizationTool", ""}

private

Pattern visualization tool.

Definition at line 89 of file CombinatorialNSWSeedFinderAlg.h.

◆ m_windowTheta

DoubleProperty MuonR4::CombinatorialNSWSeedFinderAlg::m_windowTheta {this, "m_windowTheta", 0.5 * Gaudi::Units::deg}

private

Definition at line 83 of file CombinatorialNSWSeedFinderAlg.h.

◆ m_writeKey

SG::WriteHandleKey<SegmentSeedContainer> MuonR4::CombinatorialNSWSeedFinderAlg::m_writeKey {this, "CombinatorialPhiWriteKey", "MuonHoughNswSegmentSeeds"}

private

Definition at line 52 of file CombinatorialNSWSeedFinderAlg.h.

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

Public Member Functions

Protected Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ StoreGateSvc_t

Constructor & Destructor Documentation

◆ ~CombinatorialNSWSeedFinderAlg()

Member Function Documentation

◆ buildSegmentSeed()

◆ cardinality()

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

◆ execute()

◆ extendHits()

◆ extraDeps_update_handler()

◆ extraOutputDeps()

◆ filterPassed()

◆ findCombinatoricHits()

◆ findHitInWindow()

◆ findSeedsFromMaximum()

◆ initialize()

◆ inputHandles()

◆ isClonable()

◆ msg() [1/2]

◆ msg() [2/2]

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ setFilterPassed()

◆ sysExecute()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

Member Data Documentation

◆ m_detMgr

◆ m_detStore

◆ m_etaKey

◆ m_evtStore

◆ m_extendedExtraObjects

◆ m_geoCtxKey

◆ m_idHelperSvc

◆ m_minPullThreshold

◆ m_varHandleArraysDeclared

◆ m_vhka

◆ m_visionTool

◆ m_windowTheta

◆ m_writeKey