#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, V, H > &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
enum	StripOrient { StripOrient::U, StripOrient::V, StripOrient::X, StripOrient::P, StripOrient::C, StripOrient::Unknown }
	Enumeration to classify the orientation of a NSW strip More...

enum	HitWindow { HitWindow::tooLow, HitWindow::inside, HitWindow::tooHigh }
	To fastly check whether a hit is roughly compatible with a muon trajectory a narrow corridor is opened from the estimated beamspot to the first tested hit in the seed finding. More...

using	HitVec = SpacePointPerLayerSplitter::HitVec

using	HitLayVec = SpacePointPerLayerSplitter::HitLayVec

using	HitLaySpan_t = std::vector< std::reference_wrapper< const HitVec > >
	Abbrivation of the space comprising multiple hit vectors without copy. More...

using	UsedHitMarker_t = std::vector< std::vector< char > >
	Abbrivation of the container book keeping whether a hit is used or not. More...

using	UsedHitSpan_t = std::vector< std::reference_wrapper< std::vector< char > >>
	Abbrivation of the container to pass a subset of markers wtihout copy. More...

using	InitialSeed_t = std::array< const SpacePoint *, 4 >
	Abbrivation of the More...

using	InitialSeedVec_t = std::vector< InitialSeed_t >
	Vector of initial seeds. More...

typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
StripOrient	classifyStrip (const SpacePoint &spacePoint) const
	Determines the orientation of the strip space point. More...

UsedHitMarker_t	emptyBookKeeper (const HitLayVec &sortedSp) const
	Constructs an empty HitMarker from the split space points. More...

HitWindow	hitFromIPCorridor (const SpacePoint &testHit, const Amg::Vector3D &beamSpotPos, const Amg::Vector3D &dirEstUp, const Amg::Vector3D &dirEstDn) const
	The hit is above the predefined corridor. More...

void	constructPrelimnarySeeds (const Amg::Vector3D &beamSpot, const HitLaySpan_t &combinatoricLayers, const UsedHitSpan_t &usedHits, InitialSeedVec_t &outVec) const
	Construct a set of prelimnary seeds from the selected combinatoric layers. More...

std::unique_ptr< SegmentSeed >	buildSegmentSeed (const InitialSeed_t &initialSeed, const AmgSymMatrix(2)&bMatrix, const HoughMaximum &max, const HitLaySpan_t &extensionLayers, const UsedHitSpan_t &usedHits) const
	Build the final seed from the initial seed hits and then attempt to append hits from the complementary layers onto the seed. More...

void	markHitsAsUsed (const SegmentSeed &seed, const HitLayVec &allSortHits, UsedHitMarker_t &usedHitMarker) const

HitVec	extendHits (const Amg::Vector3D &startPos, const Amg::Vector3D &direction, const HitLaySpan_t &extensionLayers, const UsedHitSpan_t &usedHits) const

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

Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey> More...

Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyArrayType &)
	specialization for handling Gaudi::Property<SG::VarHandleKeyArray> More...

Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleType &)
	specialization for handling Gaudi::Property<SG::VarHandleBase> More...

Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &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"}

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

DoubleProperty	m_minPullThreshold {this, "maxPull", 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 28 of file CombinatorialNSWSeedFinderAlg.h.

Member Typedef Documentation

◆ HitLaySpan_t

using MuonR4::CombinatorialNSWSeedFinderAlg::HitLaySpan_t = std::vector<std::reference_wrapper<const HitVec> >

private

Abbrivation of the space comprising multiple hit vectors without copy.

Definition at line 54 of file CombinatorialNSWSeedFinderAlg.h.

◆ HitLayVec

using MuonR4::CombinatorialNSWSeedFinderAlg::HitLayVec = SpacePointPerLayerSplitter::HitLayVec

private

Definition at line 52 of file CombinatorialNSWSeedFinderAlg.h.

◆ HitVec

using MuonR4::CombinatorialNSWSeedFinderAlg::HitVec = SpacePointPerLayerSplitter::HitVec

private

Definition at line 50 of file CombinatorialNSWSeedFinderAlg.h.

◆ InitialSeed_t

using MuonR4::CombinatorialNSWSeedFinderAlg::InitialSeed_t = std::array<const SpacePoint*, 4>

private

Abbrivation of the

Definition at line 60 of file CombinatorialNSWSeedFinderAlg.h.

◆ InitialSeedVec_t

using MuonR4::CombinatorialNSWSeedFinderAlg::InitialSeedVec_t = std::vector<InitialSeed_t>

private

Vector of initial seeds.

Definition at line 62 of file CombinatorialNSWSeedFinderAlg.h.

◆ StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

◆ UsedHitMarker_t

using MuonR4::CombinatorialNSWSeedFinderAlg::UsedHitMarker_t = std::vector<std::vector<char> >

private

Abbrivation of the container book keeping whether a hit is used or not.

Definition at line 56 of file CombinatorialNSWSeedFinderAlg.h.

◆ UsedHitSpan_t

using MuonR4::CombinatorialNSWSeedFinderAlg::UsedHitSpan_t = std::vector<std::reference_wrapper<std::vector<char> >>

private

Abbrivation of the container to pass a subset of markers wtihout copy.

Definition at line 58 of file CombinatorialNSWSeedFinderAlg.h.

Member Enumeration Documentation

◆ HitWindow

enum MuonR4::CombinatorialNSWSeedFinderAlg::HitWindow

strongprivate

To fastly check whether a hit is roughly compatible with a muon trajectory a narrow corridor is opened from the estimated beamspot to the first tested hit in the seed finding.

Hits in subsequent layers need to be within this corridor in order to be considered for seed construction. The HitWindow is the output classification of such a corridor test.

Enumerator
tooLow
inside	The hit is below the predefined corridor.
tooHigh	The hit is inside the defined window and hence an initial candidate.

Definition at line 71 of file CombinatorialNSWSeedFinderAlg.h.

                             {tooLow, 
                              inside, 
                              tooHigh}; 

◆ StripOrient

enum MuonR4::CombinatorialNSWSeedFinderAlg::StripOrient

strongprivate

Enumeration to classify the orientation of a NSW strip

Enumerator
U
V	Stereo strips with positive angle.
X	Stereo strips with negative angle.
P	Ordinary eta strips.
C	Single phi measurements.
Unknown	Combined 2D space point (sTGC wire + strip / sTgc pad)

Definition at line 39 of file CombinatorialNSWSeedFinderAlg.h.

Constructor & Destructor Documentation

◆ ~CombinatorialNSWSeedFinderAlg()

virtual MuonR4::CombinatorialNSWSeedFinderAlg::~CombinatorialNSWSeedFinderAlg ( )

virtualdefault

Member Function Documentation

◆ buildSegmentSeed()

std::unique_ptr< SegmentSeed > MuonR4::CombinatorialNSWSeedFinderAlg::buildSegmentSeed	(	const InitialSeed_t &	initialSeed,
		const AmgSymMatrix(2)&	bMatrix,
		const HoughMaximum &	max,
		const HitLaySpan_t &	extensionLayers,
		const UsedHitSpan_t &	usedHits
	)		const

private

Build the final seed from the initial seed hits and then attempt to append hits from the complementary layers onto the seed.

Parameters

initialSeed	Reference to the hit quadruplet that may form a seed
bMatrix	Kernel matrix calculated from the layer configuration to construct the seed
max	Refrence to the eta maximum from which the segment seed is constructed
extensionLayers	Reference to the hits on the remaining layers of the detector
usedExtensionHits	Refrence to the book keeper of which of the hits on the extension was already used

Definition at line 284 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                                                          {
  
     std::array<double, 4> params = defineParameters(bMatrix, initialSeed);
  
     const auto [segPos, direction] = seedSolution(initialSeed, params);
  
     // check the consistency of the parameters - expected to lay in the strip's
     // length
     for (std::size_t i = 0; i < 4; ++i) {
         const double halfLength = stripHalfLength(*initialSeed[i]);
         
         if (std::abs(params[i]) > halfLength) {
             ATH_MSG_VERBOSE("Seed Rejection: Invalid seed - outside of the strip's length");
             return nullptr;
         }
     }
     double tanPhi = houghTanPhi(direction);
     double tanTheta = houghTanTheta(direction);
  
     double interceptX = segPos.x();
     double interceptY = segPos.y();
  
  
     // extend the seed to the segment -- include hits from the other layers too
     auto extendedHits = extendHits(segPos, direction, extensionLayers, usedHits);
     HitVec hits{initialSeed.begin(),initialSeed.end()};
     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;
 }

◆ classifyStrip()

CombinatorialNSWSeedFinderAlg::StripOrient MuonR4::CombinatorialNSWSeedFinderAlg::classifyStrip ( const SpacePoint & spacePoint ) const

private

Determines the orientation of the strip space point.

Definition at line 85 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                                           {
     
     if (sp.type() == xAOD::UncalibMeasType::MMClusterType) {
         const auto& design = getDesign(sp);
         if (!design.hasStereoAngle()) {
             return StripOrient::X;
         } 
         return design.stereoAngle() > 0. ? StripOrient::U : StripOrient::V;
     } else if (sp.type() == xAOD::UncalibMeasType::sTgcStripType) {
         const auto* prd = static_cast<const xAOD::sTgcMeasurement*>(sp.primaryMeasurement());
         if (sp.dimension() == 2) {
             return StripOrient::C;
         }
         return prd->channelType() == sTgcIdHelper::Strip ? StripOrient::X : StripOrient::P;
          
     }
     ATH_MSG_WARNING("Cannot classify orientation of "<<m_idHelperSvc->toString(sp.identify()));
     return StripOrient::Unknown;
 }

◆ constructPrelimnarySeeds()

void MuonR4::CombinatorialNSWSeedFinderAlg::constructPrelimnarySeeds	(	const Amg::Vector3D &	beamSpot,
		const HitLaySpan_t &	combinatoricLayers,
		const UsedHitSpan_t &	usedHits,
		InitialSeedVec_t &	outVec
	)		const

private

Construct a set of prelimnary seeds from the selected combinatoric layers.

Quadruplets of hits, one from each layer, are formed if they are all within the the corridor as described above

Parameters

beamSpot	Position of the beam spot in the sector's frame
combinatoricLayers	Quadruplet of four hit vectors from which the hits are retrieved
usedHits	Mask marking hits that were already successfully added to a seed
outVec	Reference to the output vector where the initial seeds are stored. The vector is cleared at the beginning and capacity is allocated accordingly

Assign enough memory to the vector

The hit is alrady in a good seed. Don't consider again

Construct the beamspot to first hit connection to guestimate the angle

Apply cut window on theta of the seed.

Definition at line 182 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                                                                          {
     seedHitsFromLayers.clear();
     std::size_t maxSize{1};
     for (const HitVec& hitVec : combinatoricLayers) {
         maxSize = maxSize * hitVec.size();
     }
     seedHitsFromLayers.reserve(maxSize);
  
     
     unsigned int iterLay0{0}, iterLay1{0}, iterLay2{0}, iterLay3{0};    
     unsigned int startLay1{0}, startLay2{0}, startLay3{0};
     
     for( ; iterLay0 <  combinatoricLayers[0].get().size() ; ++iterLay0){
         if (usedHits[0].get()[iterLay0]) {
             continue;
         }
         const SpacePoint* hit0 = combinatoricLayers[0].get()[iterLay0];
         const Amg::Vector3D initSeedDir{(beamSpot - hit0->localPosition()).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->localPosition())
                       <<", seed dir: "<<Amg::toString(initSeedDir)
                       <<", seed plane: "<<Amg::toString(SeedingAux::extrapolateToPlane(beamSpot, initSeedDir, *hit0)));
         for( iterLay1 = startLay1; iterLay1 <  combinatoricLayers[1].get().size() ; ++iterLay1){
             TEST_HIT_CORRIDOR(1, iterLay1, startLay1);
             for( iterLay2 = startLay2; iterLay2 < combinatoricLayers[2].get().size() ; ++iterLay2){
                 TEST_HIT_CORRIDOR(2, iterLay2, startLay2);
                 for( iterLay3 = startLay3; iterLay3 < combinatoricLayers[3].get().size(); ++iterLay3){
                     TEST_HIT_CORRIDOR(3, iterLay3, startLay3);
                     seedHitsFromLayers.emplace_back(std::array{hit0, combinatoricLayers[1].get()[iterLay1], 
                                                            combinatoricLayers[2].get()[iterLay2],
                                                            combinatoricLayers[3].get()[iterLay3]}); 
                 }
             }
         }
     }
 }

◆ declareGaudiProperty() [1/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::declareGaudiProperty	(	Gaudi::Property< T, V, H > &	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, V, H > &	hndl,
		const SG::VarHandleKeyType &
	)

inlineprivateinherited

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

Definition at line 156 of file AthCommonDataStore.h.

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

◆ declareGaudiProperty() [3/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::declareGaudiProperty	(	Gaudi::Property< T, V, H > &	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, V, H > &	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, V, H > & t )

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

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

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

◆ emptyBookKeeper()

CombinatorialNSWSeedFinderAlg::UsedHitMarker_t MuonR4::CombinatorialNSWSeedFinderAlg::emptyBookKeeper ( const HitLayVec & sortedSp ) const

private

Constructs an empty HitMarker from the split space points.

Parameters

sortedSp List of space points sorted by layer

Definition at line 76 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                                                  {
         UsedHitMarker_t emptyKeeper(sortedSp.size());
         for (std::size_t l = 0; l < sortedSp.size(); ++l) {
             emptyKeeper[l].resize(sortedSp[l].size(), 0);
         }
         return emptyKeeper;
 }

◆ 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 432 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);
         if (msgLvl(MSG::VERBOSE)) {
             for(const auto& hitMax : max->getHitsInMax()){
                 ATH_MSG_VERBOSE("Hit "<<m_idHelperSvc->toString(hitMax->identify())<<", "
                                 <<Amg::toString(hitMax->localPosition())<<", dir: "
                                 <<Amg::toString(hitMax->sensorDirection()));
             }
         }
         for (auto &seed : seeds) {
             if (msgLvl(MSG::VERBOSE)){
                 std::stringstream sstr{};
                 sstr<<"Seed tanTheta = "<<seed->tanTheta()<<", y0 = "<<seed->interceptY()
                          <<", tanPhi = "<<seed->tanPhi()<<", x0 = "<<seed->interceptX()<<", hits in the seed "
                          <<seed->getHitsInMax().size()<<std::endl;
         
                 for(const auto& hit : seed->getHitsInMax()){
                     sstr<<" *** Hit "<<m_idHelperSvc->toString(hit->identify())<<", "
                         << Amg::toString(hit->localPosition())<<", dir: "<<Amg::toString(hit->sensorDirection())<<std::endl;
                 }
                 ATH_MSG_VERBOSE(sstr.str());
             }
             if (m_visionTool.isEnabled()) {          
                 m_visionTool->visualizeSeed(ctx, *seed, "#phi-combinatorialSeed");
             }
             writeMaxima->push_back(std::move(seed));
         }
     }
     return StatusCode::SUCCESS;
 }

◆ extendHits()

CombinatorialNSWSeedFinderAlg::HitVec MuonR4::CombinatorialNSWSeedFinderAlg::extendHits	(	const Amg::Vector3D &	startPos,
		const Amg::Vector3D &	direction,
		const HitLaySpan_t &	extensionLayers,
		const UsedHitSpan_t &	usedHits
	)		const

private

Definition at line 231 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 (std::size_t i = 0; i < extensionLayers.size(); ++i) {
         const HitVec& layer{extensionLayers[i].get()};
         const Amg::Vector3D extrapPos = SeedingAux::extrapolateToPlane(startPos, direction, *layer.front());
  
         unsigned int indexOfHit = layer.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 < layer.size(); ++j) {
             if (usedHits[i].get().at(j)) {
                 continue;
             }
             auto hit = layer.at(j);
             const double pull = std::sqrt(SeedingAux::chi2Term(extrapPos, direction, *hit));
             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) {
             const auto* bestCand = layer.at(indexOfHit);
             ATH_MSG_VERBOSE("Extension successfull - hit" << m_idHelperSvc->toString(bestCand->identify())
                           <<", pos: "<<Amg::toString(bestCand->localPosition())
                           <<", dir: "<<Amg::toString(bestCand->sensorDirection())<<" found with pull "<<minPull);
             combinatoricHits.push_back(bestCand);
         }
     }
     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();
   }

◆ findSeedsFromMaximum()

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

private

Definition at line 322 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                                                                                   {
     // first sort the hits per layer from the maximum
     SpacePointPerLayerSplitter hitLayers{max.getHitsInMax()};
  
     const HitLayVec& stripHitsLayers{hitLayers.stripHits()};
     const std::size_t layerSize = stripHitsLayers.size();
     
     std::vector<std::unique_ptr<SegmentSeed>> seeds{};
  
  
     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(SeedingAux::chi2Term(hitPos, hitDir, *sp));
             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));
     }
  
     UsedHitMarker_t allUsedHits = emptyBookKeeper(stripHitsLayers);
     const Amg::Transform3D globToLocal = max.msSector()->globalToLocalTrans(gctx);
     std::array<const SpacePoint*, 4> seedHits{};
  
     InitialSeedVec_t preLimSeeds{};
  
     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 = betaMatrix(seedHits);                   
                     if (std::abs(bMatrix.determinant()) < 1.e-6) {
                         continue;
                     }
                   
                     const HitLaySpan_t layers{stripHitsLayers[i], stripHitsLayers[j], stripHitsLayers[k], stripHitsLayers[l]};
                     UsedHitSpan_t usedHits{allUsedHits[i], allUsedHits[j], allUsedHits[k], allUsedHits[l]};    
                     // each layer may have more than one hit - take the hit combinations                    
                     constructPrelimnarySeeds(globToLocal.translation(), layers, usedHits, preLimSeeds);
  
                      //the layers not participated in the seed build - gonna be used for the extension  
                     HitLaySpan_t extensionLayers{};
                     UsedHitSpan_t usedExtensionHits{};
                     usedExtensionHits.reserve(stripHitsLayers.size());
                     extensionLayers.reserve(stripHitsLayers.size());
                     for (std::size_t e = 0 ; e < stripHitsLayers.size(); ++e) {
                         if (!(e == i || e == j || e == k || e == l)){
                             extensionLayers.emplace_back(stripHitsLayers[e]);
                             usedExtensionHits.emplace_back(allUsedHits[e]);
                         }
                     }
                     // 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 : preLimSeeds) {
                         auto seed = buildSegmentSeed(combinatoricHits, bMatrix, max, extensionLayers, usedExtensionHits);
                         if (seed) {
                             markHitsAsUsed(*seed,stripHitsLayers, allUsedHits);
                             seeds.push_back(std::move(seed));
                         }
                     }
                 }
             }
         }
     }
  
     return seeds;
 }

◆ hitFromIPCorridor()

CombinatorialNSWSeedFinderAlg::HitWindow MuonR4::CombinatorialNSWSeedFinderAlg::hitFromIPCorridor	(	const SpacePoint &	testHit,
		const Amg::Vector3D &	beamSpotPos,
		const Amg::Vector3D &	dirEstUp,
		const Amg::Vector3D &	dirEstDn
	)		const

inlineprivate

The hit is above the predefined corridor.

Tests whether a hit is inside the corridor defined by line connecting the centre of the first candidate hit in the seed and the beam spot. The theta angle is varied by m_windowTheta to define the lower & upper direction etimate. The function tests whether the strip then crosses the corridor.

Parameters

testHit	Reference to the hit to test
beamSpotPos	Position of the beam spot serving as starting point
dirEstUp	Direction vector defining the upper limit of the corridor
dirEstDn	Direction vector defining the lower limit of the corridor

Calculate the strip edges

Check whether the both edges are below the lower estimated muon arrival

Analogous check for the upper edge

No extrapolation needed

Analogous check for the upper edge

Definition at line 105 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                                                        {
  
     const Amg::Vector3D estPlaneArrivalUp = SeedingAux::extrapolateToPlane(beamSpotPos, dirEstUp, testHit);
     const Amg::Vector3D estPlaneArrivalDn = SeedingAux::extrapolateToPlane(beamSpotPos, dirEstDn, testHit); 
  
     bool below{true}, above{true};
     switch (classifyStrip(testHit)) {
         using enum StripOrient;
         case U:
         case V:{
             const double halfLength = 0.5* stripHalfLength(testHit);
             const Amg::Vector3D leftEdge  = testHit.localPosition() - halfLength * testHit.sensorDirection();
             const Amg::Vector3D rightEdge = testHit.localPosition() + halfLength * testHit.sensorDirection();
  
             below = estPlaneArrivalDn.y() > std::max(leftEdge.y(), rightEdge.y());
             above = estPlaneArrivalUp.y() < std::min(leftEdge.y(), rightEdge.y());
             break; 
         } case X:
           case C: {
             const double hY = testHit.localPosition().y();
             below = estPlaneArrivalDn.y() > hY;
             above = estPlaneArrivalUp.y() < hY;
             break;
         }
         case P:{
             break;
         }
         case Unknown:{
             break;
         }
  
     }
     ATH_MSG_VERBOSE("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;
 };

◆ initialize()

StatusCode MuonR4::CombinatorialNSWSeedFinderAlg::initialize ( )

overridevirtual

Definition at line 60 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()}));
  
     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;
 }

◆ markHitsAsUsed()

void MuonR4::CombinatorialNSWSeedFinderAlg::markHitsAsUsed	(	const SegmentSeed &	seed,
		const HitLayVec &	allSortHits,
		UsedHitMarker_t &	usedHitMarker
	)		const

private

That's ultra slow & should be revised

Definition at line 414 of file CombinatorialNSWSeedFinderAlg.cxx.

                                                                                          {
     for (const auto* sp : seed.getHitsInMax()) {
         bool found{false};
         for (std::size_t lIdx = 0; !found && lIdx < allSortHits.size(); ++lIdx) {
             const HitVec& hVec{allSortHits[lIdx]}; 
             for (std::size_t hIdx  = 0 ; hIdx < hVec.size(); ++hIdx) {
                 if (hVec[hIdx] == sp) {
                     usedHitMarker[lIdx][hIdx] = true;
                     found = true;
                     break;
                 }
             }
         }
     }
 }

◆ 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_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 120 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 126 of file CombinatorialNSWSeedFinderAlg.h.

◆ m_idHelperSvc

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

private

Definition at line 129 of file CombinatorialNSWSeedFinderAlg.h.

◆ m_minPullThreshold

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

private

Definition at line 140 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 143 of file CombinatorialNSWSeedFinderAlg.h.

◆ m_windowTheta

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

private

Definition at line 137 of file CombinatorialNSWSeedFinderAlg.h.

◆ m_writeKey

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

private

Definition at line 123 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

◆ HitLaySpan_t

◆ HitLayVec

◆ HitVec

◆ InitialSeed_t

◆ InitialSeedVec_t

◆ StoreGateSvc_t

◆ UsedHitMarker_t

◆ UsedHitSpan_t

Member Enumeration Documentation

◆ HitWindow

◆ StripOrient

Constructor & Destructor Documentation

◆ ~CombinatorialNSWSeedFinderAlg()

Member Function Documentation

◆ buildSegmentSeed()

◆ cardinality()

◆ classifyStrip()

◆ constructPrelimnarySeeds()

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

◆ emptyBookKeeper()

◆ evtStore() [1/2]

◆ evtStore() [2/2]

◆ execute()

◆ extendHits()

◆ extraDeps_update_handler()

◆ extraOutputDeps()

◆ filterPassed()

◆ findSeedsFromMaximum()

◆ hitFromIPCorridor()

◆ initialize()

◆ inputHandles()

◆ isClonable()

◆ markHitsAsUsed()

◆ msg() [1/2]

◆ msg() [2/2]

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ setFilterPassed()

◆ sysExecute()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

Member Data Documentation

◆ m_detStore

◆ m_etaKey

◆ m_evtStore

◆ m_extendedExtraObjects

◆ m_geoCtxKey

◆ m_idHelperSvc

◆ m_minPullThreshold

◆ m_varHandleArraysDeclared

◆ m_vhka

◆ m_visionTool

◆ m_windowTheta

◆ m_writeKey