#include <L1CorrelationAlg.h>

Inheritance diagram for L1CorrelationAlg:

Collaboration diagram for L1CorrelationAlg:

Public Member Functions
	L1CorrelationAlg (const std::string &name, ISvcLocator *pSvcLocator)

virtual StatusCode	initialize () override

virtual StatusCode	execute (const EventContext &ctx) const override

virtual StatusCode	start () 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
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
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
ServiceHandle< IROBDataProviderSvc >	m_robDataProviderSvc {this, "ROBDataProviderSvc", "ROBDataProviderSvc", "Name of the ROB data provider"}

SG::WriteHandleKey< xAOD::TrigCompositeContainer >	m_trigCompositeKey {this, "TrigCompositeWriteHandleKey", "L1CorrelationTrigComposite", "Name of TrigComposite write handle"}

SG::WriteDecorHandleKey< xAOD::TrigCompositeContainer >	m_l1AKey {this, "l1AKey", "L1CorrelationTrigComposite.l1a_type", "L1 accept type"}

SG::WriteDecorHandleKey< xAOD::TrigCompositeContainer >	m_otherTypeKey {this, "otherTypeKey", "L1CorrelationTrigComposite.other_type", "Other type"}

SG::WriteDecorHandleKey< xAOD::TrigCompositeContainer >	m_beforeAfterKey {this, "beforeAfterKey", "L1CorrelationTrigComposite.beforeafterflag", "flag if BC is before or after nominal"}

SG::WriteDecorHandleKey< xAOD::TrigCompositeContainer >	m_otherTypeBeforeKey {this, "otherTypeBeforeKey", "L1CorrelationTrigComposite.other_type_before", "Trigger type (1-7) of the first fired BC before the central L1A BCID"}

SG::WriteDecorHandleKey< xAOD::TrigCompositeContainer >	m_otherTypeAfterKey {this, "otherTypeAfterKey", "L1CorrelationTrigComposite.other_type_after", "Trigger type (1-7) of the first fired BC after the central L1A BCID"}

SG::WriteDecorHandleKey< xAOD::TrigCompositeContainer >	m_beforeOffsetKey {this, "beforeOffsetKey", "L1CorrelationTrigComposite.offset_before", "Distance (in BCs) from the L1A to the first earlier neighbor trigger"}

SG::WriteDecorHandleKey< xAOD::TrigCompositeContainer >	m_afterOffsetKey {this, "afterOffsetKey", "L1CorrelationTrigComposite.offset_after", "Distance (in BCs) from the L1A to the first later neighbor trigger"}

SG::WriteDecorHandleKey< xAOD::TrigCompositeContainer >	m_passKey {this, "trigCompPassKey", "L1CorrelationTrigComposite.pass", "Key to indicate TrigComp is passed"}

SG::ReadHandleKey< TrigConf::L1Menu >	m_l1MenuKey {this, "L1MenuKey", "DetectorStore+L1TriggerMenu", "L1 Menu"}

ToolHandle< GenericMonitoringTool >	m_monTool {this, "MonTool", "", "Monitoring tool"}

Gaudi::Property< bool >	m_currentBCincl {this, "currentBCinclusive", true}

Gaudi::Property< std::vector< std::string > >	m_l1itemlist {this, "ItemList", {"L1_EM22VHI", "L1_J400", "L1_MU14FCH"}, "list of l1 items to be used"}

std::vector< uint32_t >	m_bitmasks

std::vector< uint32_t >	m_bitmasks_ele

std::vector< uint32_t >	m_bitmasks_mu

std::vector< uint32_t >	m_bitmasks_jets

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 15 of file L1CorrelationAlg.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

◆ L1CorrelationAlg()

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

Definition at line 13 of file L1CorrelationAlg.cxx.

13 : AthReentrantAlgorithm(name, pSvcLocator) {}

Member Function Documentation

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

◆ 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 L1CorrelationAlg::execute ( const EventContext & ctx ) const

overridevirtual

Definition at line 139 of file L1CorrelationAlg.cxx.

                                                                   {
  
   //TrigComposite Container to record
   SG::WriteHandle<xAOD::TrigCompositeContainer> wh_trigComposite(m_trigCompositeKey, ctx);
   ATH_CHECK(wh_trigComposite.record(std::make_unique<xAOD::TrigCompositeContainer>(), std::make_unique<xAOD::TrigCompositeAuxContainer>()));
   auto trigCompCont = wh_trigComposite.ptr();
  
   SG::WriteDecorHandle<xAOD::TrigCompositeContainer, int> trigCompL1A(m_l1AKey, ctx);
   SG::WriteDecorHandle<xAOD::TrigCompositeContainer, int> trigCompOther(m_otherTypeKey, ctx);
   SG::WriteDecorHandle<xAOD::TrigCompositeContainer, int> trigCompBeforeAfter(m_beforeAfterKey, ctx);
   SG::WriteDecorHandle<xAOD::TrigCompositeContainer, int> trigCompPass(m_passKey, ctx);
   SG::WriteDecorHandle<xAOD::TrigCompositeContainer, int> trigCompOtherBefore(m_otherTypeBeforeKey, ctx);
   SG::WriteDecorHandle<xAOD::TrigCompositeContainer, int> trigCompOtherAfter(m_otherTypeAfterKey, ctx);
   SG::WriteDecorHandle<xAOD::TrigCompositeContainer, int> trigCompBeforeOffset(m_beforeOffsetKey, ctx);
   SG::WriteDecorHandle<xAOD::TrigCompositeContainer, int> trigCompAfterOffset(m_afterOffsetKey, ctx);
  
   //CTP ROB
   std::vector<const OFFLINE_FRAGMENTS_NAMESPACE::ROBFragment*> robFragments;
   std::vector<uint32_t> roblist;
   // magic number!
   roblist.push_back(0x770000); 
   m_robDataProviderSvc->addROBData(ctx, roblist);
   m_robDataProviderSvc->getROBData(ctx, roblist, robFragments);
     if (msgLvl(MSG::DEBUG)) {
     std::ostringstream os;
     for(auto rob : roblist){
       os << std::hex<<rob;
     }
     ATH_MSG_DEBUG(roblist.size() << "/" << robFragments.size()
          << " ROBs requested/retrieved:" << os.str());
   }
   if (robFragments.size()<1){
     ATH_MSG_DEBUG("Could not retrieve ROB!");
     return StatusCode::SUCCESS;
   }
   const eformat::ROBFragment<const uint32_t*>* rbf = robFragments[0];
  
   // L1A index within the CTP readout window (not a BCID).
   // For a symmetric window nBC = 2*k + 1, L1A sits at index k:
   // e.g. ±1 → nBC=3 → l1a_idx=1; ±2 → nBC=5 → l1a_idx=2.
   const int l1a_idx = static_cast<int>(CTPfragment::lvl1AcceptBunch(rbf)); // index in readout window
  
   const int nBC = 2 * l1a_idx + 1; // symmetric by requirement
   const int mid = l1a_idx;         // central element
  
   // Cache TBP/TAP once per BC
   std::vector<std::vector<uint32_t>> tbpWords(nBC), tapWords(nBC);
   for (int i = 0; i < nBC; ++i) {
     const unsigned k = static_cast<unsigned>(i);
     tbpWords[i] = CTPfragment::triggerDecisionBeforePrescales(rbf, k);
     tapWords[i] = CTPfragment::triggerDecisionAfterPrescales (rbf, k);
   }
  
   // Helper: any-bit-on under mask
   auto firedFromWords = [&](const std::vector<uint32_t>& w,
                             const std::vector<uint32_t>& mask) -> uint8_t {
     const std::size_t nw = std::min(w.size(), mask.size()); // (16 by design)
     uint8_t on = 0;
     for (std::size_t iw = 0; iw < nw; ++iw) on |= static_cast<uint8_t>((w[iw] & mask[iw]) != 0u);
     return on;
   };
  
   // Per-BC fired flags (TBP)
   std::vector<uint8_t> firedbc(nBC,0), firedbc_ele(nBC,0), firedbc_mu(nBC,0), firedbc_jet(nBC,0);
   for (int i = 0; i < nBC; ++i) {
     firedbc    [i] = firedFromWords(tbpWords[i], m_bitmasks);
     firedbc_ele[i] = firedFromWords(tbpWords[i], m_bitmasks_ele);
     firedbc_mu [i] = firedFromWords(tbpWords[i], m_bitmasks_mu );
     firedbc_jet[i] = firedFromWords(tbpWords[i], m_bitmasks_jets);
   }
  
   // Central-BC inclusion flag
   if (m_currentBCincl) {
     firedbc[mid] = firedbc_ele[mid] = firedbc_mu[mid] = firedbc_jet[mid] = 1;
   }
  
   // Occupancy maps (delta BC, CTPID) for TBP/TAP
   auto collect_ids_from_words = [this](const std::vector<uint32_t>& words) {
     std::vector<int> ids;
     const std::size_t nw = std::min(words.size(), this->m_bitmasks.size()); // typically 16
     ids.reserve(32u * nw);
     for (std::size_t iw = 0; iw < nw; ++iw) {
       uint32_t w = words[iw];
       if (!w) continue;
       const unsigned base = static_cast<unsigned>(iw * 32u);
       for (unsigned b = 0; b < 32; ++b) if (w & (1u << b)) ids.emplace_back(static_cast<int>(base + b));
     }
     return ids;
   };
  
   std::vector<int> vDeltaBC_all_TBP, vCtpId_all_TBP, vDeltaBC_all_TAP, vCtpId_all_TAP;
   vDeltaBC_all_TBP.reserve(64); vCtpId_all_TBP.reserve(64);
   vDeltaBC_all_TAP.reserve(64); vCtpId_all_TAP.reserve(64);
  
   for (int i = 0; i < nBC; ++i) {
     const int delta = i - mid;
     {
       const auto ids = collect_ids_from_words(tbpWords[i]);
       vDeltaBC_all_TBP.insert(vDeltaBC_all_TBP.end(), ids.size(), delta);
       vCtpId_all_TBP.insert (vCtpId_all_TBP.end(),  ids.begin(), ids.end());
     }
     {
       const auto ids = collect_ids_from_words(tapWords[i]);
       vDeltaBC_all_TAP.insert(vDeltaBC_all_TAP.end(), ids.size(), delta);
       vCtpId_all_TAP.insert (vCtpId_all_TAP.end(),  ids.begin(), ids.end());
     }
   }
  
   // Pass–fail decision: nearest neighbour on each side
   int isPassed = 0;
   int beforeafterflag = 0; // sign: side; abs: offset
   int offset_before = 0, offset_after = 0;
   for (int d = 1; d <= l1a_idx; ++d) {
     if (firedbc[mid] && firedbc[mid - d] && offset_before == 0) { offset_before = d; isPassed = 1; }
     if (firedbc[mid] && firedbc[mid + d] && offset_after  == 0) { offset_after  = d; isPassed = 1; }
     if (offset_before && offset_after) break;
   }
  
   // Classification (legacy 1..7)
   auto classify = [&](int idx)->int {
     if      (firedbc_ele[idx] && !firedbc_mu[idx] && !firedbc_jet[idx]) return 1;
     else if (firedbc_mu [idx] && !firedbc_ele[idx] && !firedbc_jet[idx]) return 2;
     else if (firedbc_jet[idx] && !firedbc_ele[idx] && !firedbc_mu[idx])  return 3;
     else if (firedbc_ele[idx] &&  firedbc_mu[idx] && !firedbc_jet[idx])  return 4;
     else if (firedbc_ele[idx] &&  firedbc_jet[idx] && !firedbc_mu[idx])  return 5;
     else if (firedbc_mu [idx] &&  firedbc_jet[idx] && !firedbc_ele[idx]) return 6;
     else if (firedbc_ele[idx] &&  firedbc_mu[idx] &&  firedbc_jet[idx])  return 7;
     return 0;
   };
  
   int l1a_type = classify(mid);
   int other_type_before = (offset_before > 0) ? classify(mid - offset_before) : 0;
   int other_type_after  = (offset_after  > 0) ? classify(mid + offset_after ) : 0;
  
   // Choose operative side
   if (offset_before > 0 && offset_after > 0) {
     if (offset_before < offset_after) beforeafterflag = -offset_before;
     else if (offset_after < offset_before) beforeafterflag = +offset_after;
     else beforeafterflag = +offset_after; // tie → positive side
   } else if (offset_before > 0) {
     beforeafterflag = -offset_before;
   } else if (offset_after > 0) {
     beforeafterflag = +offset_after;
   }
  
   int other_type = 0;
   if      (beforeafterflag < 0) other_type = other_type_before;
   else if (beforeafterflag > 0) other_type = other_type_after;
  
   // Create TrigComposite only if passed
   if (isPassed) {
     auto trigComp = new xAOD::TrigComposite();
     trigCompCont->push_back(trigComp);
     trigComp->setName("mistimemon_L1Dec");
  
     trigCompL1A         (*trigComp) = l1a_type;
     trigCompOther       (*trigComp) = other_type;
     trigCompBeforeAfter (*trigComp) = beforeafterflag;
     trigCompPass        (*trigComp) = isPassed;
     trigCompOtherBefore (*trigComp) = other_type_before;
     trigCompOtherAfter  (*trigComp) = other_type_after;
     trigCompBeforeOffset(*trigComp) = offset_before;
     trigCompAfterOffset (*trigComp) = offset_after;
   }
  
   // Monitoring: global summary + side-specific
   auto mon_l1a         = Monitored::Scalar<int>("l1Accept", l1a_type);
   auto mon_otherType   = Monitored::Scalar<int>("otherType", other_type);
   auto mon_beforeAfter = Monitored::Scalar<int>("BeforeAfterFlag", beforeafterflag);
   auto monitorIt = Monitored::Group(m_monTool, mon_l1a, mon_otherType, mon_beforeAfter);
  
   if (offset_before > 0 && offset_after > 0) {
     auto mon_offsetBefore = Monitored::Scalar<int>("BeforeOffset", offset_before);
     auto mon_offsetAfter  = Monitored::Scalar<int>("AfterOffset",  offset_after);
     auto mon_otherBefore  = Monitored::Scalar<int>("OtherTypeBefore", other_type_before);
     auto mon_otherAfter   = Monitored::Scalar<int>("OtherTypeAfter",  other_type_after);
     auto gBoth = Monitored::Group(m_monTool, mon_offsetBefore, mon_offsetAfter, mon_otherBefore, mon_otherAfter);
     (void)gBoth;
   } else if (offset_before > 0) {
     auto mon_offsetBefore = Monitored::Scalar<int>("BeforeOffset", offset_before);
     auto mon_otherBefore  = Monitored::Scalar<int>("OtherTypeBefore", other_type_before);
     auto gB = Monitored::Group(m_monTool, mon_offsetBefore, mon_otherBefore);
     (void)gB;
   } else if (offset_after > 0) {
     auto mon_offsetAfter = Monitored::Scalar<int>("AfterOffset",  offset_after);
     auto mon_otherAfter  = Monitored::Scalar<int>("OtherTypeAfter",  other_type_after);
     auto gA = Monitored::Group(m_monTool, mon_offsetAfter, mon_otherAfter);
     (void)gA;
   }
  
   // Full occupancy maps (TBP/TAP)
   auto mon_dbc_all_tbp = Monitored::Collection("DeltaBCAll",      vDeltaBC_all_TBP);
   auto mon_id_all_tbp  = Monitored::Collection("CTPIDAll",        vCtpId_all_TBP);
   auto mon_dbc_all_tap = Monitored::Collection("DeltaBCAll_TAP",  vDeltaBC_all_TAP);
   auto mon_id_all_tap  = Monitored::Collection("CTPIDAll_TAP",    vCtpId_all_TAP);
   auto gMaps = Monitored::Group(m_monTool, mon_dbc_all_tbp, mon_id_all_tbp,
                                             mon_dbc_all_tap, mon_id_all_tap);
   (void)gMaps;
  
   // Pair maps at abs(delta) = 1,2,3... (using cached words)
   const auto ids0_tbp = collect_ids_from_words(tbpWords[mid]);
   const auto ids0_tap = collect_ids_from_words(tapWords[mid]);
  
   auto fill_pair_map = [&](int deltaSel, bool useTAP,
                            const char* varX, const char* varY) {
     const int kN = mid + deltaSel;
     if (kN < 0 || kN >= nBC) return;
  
     const auto &idsN = useTAP ? collect_ids_from_words(tapWords[kN])
                              : collect_ids_from_words(tbpWords[kN]);
     const auto& ids0 = useTAP ? ids0_tap : ids0_tbp;
  
     if (ids0.empty() || idsN.empty()) return;
  
     std::vector<int> vId0; vId0.reserve(ids0.size() * idsN.size());
     std::vector<int> vIdN; vIdN.reserve(vId0.capacity());
     for (int id0 : ids0) for (int idN : idsN) { vId0.emplace_back(id0); vIdN.emplace_back(idN); }
  
     auto mon_x = Monitored::Collection(varX, vId0);
     auto mon_y = Monitored::Collection(varY, vIdN);
     auto g     = Monitored::Group(m_monTool, mon_x, mon_y);
     (void)g;
   };
  
   // TBP: delta = +2, −2, +1, −1
   fill_pair_map(+2, false, "CTPID0tbp_p2", "CTPIDtbp_p2");
   fill_pair_map(-2, false, "CTPID0tbp_m2", "CTPIDtbp_m2");
   fill_pair_map(+1, false, "CTPID0tbp_p1", "CTPIDtbp_p1");
   fill_pair_map(-1, false, "CTPID0tbp_m1", "CTPIDtbp_m1");
  
   // TAP: delta = +2, −2, +1, −1
   fill_pair_map(+2, true , "CTPID0tap_p2", "CTPIDtap_p2");
   fill_pair_map(-2, true , "CTPID0tap_m2", "CTPIDtap_m2");
   fill_pair_map(+1, true , "CTPID0tap_p1", "CTPIDtap_p1");
   fill_pair_map(-1, true , "CTPID0tap_m1", "CTPIDtap_m1");
  
   return StatusCode::SUCCESS;
 }

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

◆ initialize()

StatusCode L1CorrelationAlg::initialize ( )

overridevirtual

Definition at line 15 of file L1CorrelationAlg.cxx.

                                         {
  
   ATH_CHECK(m_robDataProviderSvc.retrieve());
   ATH_CHECK(m_trigCompositeKey.initialize());
   ATH_CHECK(m_l1MenuKey.initialize());
   ATH_CHECK(m_passKey.initialize());
   ATH_CHECK(m_l1AKey.initialize());
   ATH_CHECK(m_otherTypeKey.initialize());
   ATH_CHECK(m_beforeAfterKey.initialize());
   ATH_CHECK(m_otherTypeBeforeKey.initialize());
   ATH_CHECK(m_otherTypeAfterKey.initialize());
   ATH_CHECK(m_beforeOffsetKey.initialize());
   ATH_CHECK(m_afterOffsetKey.initialize());
   ATH_CHECK(m_monTool.retrieve());
  
   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 );
   }

◆ start()

StatusCode L1CorrelationAlg::start ( )

overridevirtual

Definition at line 33 of file L1CorrelationAlg.cxx.

                                   {
  
   //get L1 menu and initialise bitMasks based on l1 em/j/mu triggers
   SG::ReadHandle<TrigConf::L1Menu> rh_l1Menu = SG::makeHandle(m_l1MenuKey);
   ATH_CHECK(rh_l1Menu.isValid());
  
   std::vector<int> ctpids_ele;
   std::vector<int> ctpids_mu;
   std::vector<int> ctpids_jets;
   std::vector<int> ctpids;
  
   for(const TrigConf::L1Item& item : *rh_l1Menu){
     for(unsigned int nl1=0; nl1<m_l1itemlist.size(); nl1++){
       if(m_l1itemlist[nl1].compare(item.name()) == 0 ){
         ATH_MSG_DEBUG("L1CorrAlgInit: Configured to use item:" <<item.name().c_str()<< " CTPID:"<<item.ctpId());
         ctpids.push_back( item.ctpId() );
         if( m_l1itemlist[nl1].find( "L1_EM" )  != std::string::npos ){
           ctpids_ele.push_back( item.ctpId() );
         }
         if( m_l1itemlist[nl1].find( "L1_MU" )  != std::string::npos ){
           ctpids_mu.push_back( item.ctpId() );
         }
         if((  m_l1itemlist[nl1].find( "L1_J")  != std::string::npos ) || ( m_l1itemlist[nl1].find( "L1_jJ" )  != std::string::npos)){
           ctpids_jets.push_back( item.ctpId() );
         }
       }
     }
   }
     
   // init with 0
   m_bitmasks.clear();
   m_bitmasks_ele.clear();
   m_bitmasks_mu.clear();
   m_bitmasks_jets.clear();
   for(int n=0; n<16 ; n++){
     uint32_t tmpword=0;
     m_bitmasks.push_back(tmpword);
     m_bitmasks_ele.push_back(tmpword);
     m_bitmasks_mu.push_back(tmpword);
     m_bitmasks_jets.push_back(tmpword);
   }
  
   //all ctpids
   for(unsigned int n=0; n<ctpids.size()  ; n++){
     // check in which word it belongs
     int cycle =  ctpids[n] / 32;
     int pos = ctpids[n] % 32;
      
     uint32_t currentmask = m_bitmasks[cycle];
     uint32_t tmpmask = 1;
     // shift this pos positions to left
     tmpmask = tmpmask << (pos);
       
     // OR this with the existing mask
     m_bitmasks[cycle] = tmpmask | currentmask;
   }
  
   //electrons
   for(unsigned int n=0; n<ctpids_ele.size()  ; n++){
     // check in which word it belongs
     int cycle =  ctpids_ele[n] / 32;
     int pos = ctpids_ele[n] % 32;
      
     uint32_t currentmask = m_bitmasks_ele[cycle];
     uint32_t tmpmask = 1;
     // shift this pos positions to left
     tmpmask = tmpmask << (pos);
      
     // OR this with the existing mask
     m_bitmasks_ele[cycle] = tmpmask | currentmask;
   }
  
   //muons
   for(unsigned int n=0; n<ctpids_mu.size()  ; n++){
     // check in which word it belongs
     int cycle =  ctpids_mu[n] / 32;
     int pos = ctpids_mu[n] % 32;
     
     uint32_t currentmask = m_bitmasks_mu[cycle];
     uint32_t tmpmask = 1;
     // shift this pos positions to left
     tmpmask = tmpmask << (pos);
     
     // OR this with the existing mask
     m_bitmasks_mu[cycle] = tmpmask | currentmask;
   }  
  
   //jets
   for(unsigned int n=0; n<ctpids_jets.size()  ; n++){
     // check in which word it belongs
     int cycle =  ctpids_jets[n] / 32;
     int pos = ctpids_jets[n] % 32;
     
     uint32_t currentmask = m_bitmasks_jets[cycle];
     uint32_t tmpmask = 1;
     // shift this pos positions to left
     tmpmask = tmpmask << (pos);
      
     // OR this with the existing mask
     m_bitmasks_jets[cycle] = tmpmask | currentmask;
   }  
  
   return StatusCode::SUCCESS;
 }

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

SG::WriteDecorHandleKey<xAOD::TrigCompositeContainer> L1CorrelationAlg::m_afterOffsetKey {this, "afterOffsetKey", "L1CorrelationTrigComposite.offset_after", "Distance (in BCs) from the L1A to the first later neighbor trigger"}

private

Definition at line 32 of file L1CorrelationAlg.h.

◆ m_beforeAfterKey

SG::WriteDecorHandleKey<xAOD::TrigCompositeContainer> L1CorrelationAlg::m_beforeAfterKey {this, "beforeAfterKey", "L1CorrelationTrigComposite.beforeafterflag", "flag if BC is before or after nominal"}

private

Definition at line 28 of file L1CorrelationAlg.h.

◆ m_beforeOffsetKey

SG::WriteDecorHandleKey<xAOD::TrigCompositeContainer> L1CorrelationAlg::m_beforeOffsetKey {this, "beforeOffsetKey", "L1CorrelationTrigComposite.offset_before", "Distance (in BCs) from the L1A to the first earlier neighbor trigger"}

private

Definition at line 31 of file L1CorrelationAlg.h.

◆ m_bitmasks

std::vector<uint32_t> L1CorrelationAlg::m_bitmasks

private

Definition at line 40 of file L1CorrelationAlg.h.

◆ m_bitmasks_ele

std::vector<uint32_t> L1CorrelationAlg::m_bitmasks_ele

private

Definition at line 41 of file L1CorrelationAlg.h.

◆ m_bitmasks_jets

std::vector<uint32_t> L1CorrelationAlg::m_bitmasks_jets

private

Definition at line 43 of file L1CorrelationAlg.h.

◆ m_bitmasks_mu

std::vector<uint32_t> L1CorrelationAlg::m_bitmasks_mu

private

Definition at line 42 of file L1CorrelationAlg.h.

◆ m_currentBCincl

Gaudi::Property<bool> L1CorrelationAlg::m_currentBCincl {this, "currentBCinclusive", true}

private

Definition at line 36 of file L1CorrelationAlg.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_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_l1AKey

SG::WriteDecorHandleKey<xAOD::TrigCompositeContainer> L1CorrelationAlg::m_l1AKey {this, "l1AKey", "L1CorrelationTrigComposite.l1a_type", "L1 accept type"}

private

Definition at line 26 of file L1CorrelationAlg.h.

◆ m_l1itemlist

Gaudi::Property<std::vector<std::string> > L1CorrelationAlg::m_l1itemlist {this, "ItemList", {"L1_EM22VHI", "L1_J400", "L1_MU14FCH"}, "list of l1 items to be used"}

private

Definition at line 37 of file L1CorrelationAlg.h.

◆ m_l1MenuKey

SG::ReadHandleKey<TrigConf::L1Menu> L1CorrelationAlg::m_l1MenuKey {this, "L1MenuKey", "DetectorStore+L1TriggerMenu", "L1 Menu"}

private

Definition at line 34 of file L1CorrelationAlg.h.

◆ m_monTool

ToolHandle<GenericMonitoringTool> L1CorrelationAlg::m_monTool {this, "MonTool", "", "Monitoring tool"}

private

Definition at line 35 of file L1CorrelationAlg.h.

◆ m_otherTypeAfterKey

SG::WriteDecorHandleKey<xAOD::TrigCompositeContainer> L1CorrelationAlg::m_otherTypeAfterKey {this, "otherTypeAfterKey", "L1CorrelationTrigComposite.other_type_after", "Trigger type (1-7) of the first fired BC after the central L1A BCID"}

private

Definition at line 30 of file L1CorrelationAlg.h.

◆ m_otherTypeBeforeKey

SG::WriteDecorHandleKey<xAOD::TrigCompositeContainer> L1CorrelationAlg::m_otherTypeBeforeKey {this, "otherTypeBeforeKey", "L1CorrelationTrigComposite.other_type_before", "Trigger type (1-7) of the first fired BC before the central L1A BCID"}

private

Definition at line 29 of file L1CorrelationAlg.h.

◆ m_otherTypeKey

SG::WriteDecorHandleKey<xAOD::TrigCompositeContainer> L1CorrelationAlg::m_otherTypeKey {this, "otherTypeKey", "L1CorrelationTrigComposite.other_type", "Other type"}

private

Definition at line 27 of file L1CorrelationAlg.h.

◆ m_passKey

SG::WriteDecorHandleKey<xAOD::TrigCompositeContainer> L1CorrelationAlg::m_passKey {this, "trigCompPassKey", "L1CorrelationTrigComposite.pass", "Key to indicate TrigComp is passed"}

private

Definition at line 33 of file L1CorrelationAlg.h.

◆ m_robDataProviderSvc

ServiceHandle<IROBDataProviderSvc> L1CorrelationAlg::m_robDataProviderSvc {this, "ROBDataProviderSvc", "ROBDataProviderSvc", "Name of the ROB data provider"}

private

Definition at line 24 of file L1CorrelationAlg.h.

◆ m_trigCompositeKey

SG::WriteHandleKey<xAOD::TrigCompositeContainer> L1CorrelationAlg::m_trigCompositeKey {this, "TrigCompositeWriteHandleKey", "L1CorrelationTrigComposite", "Name of TrigComposite write handle"}

private

Definition at line 25 of file L1CorrelationAlg.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.

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

◆ L1CorrelationAlg()

Member Function Documentation

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

◆ extraDeps_update_handler()

◆ extraOutputDeps()

◆ filterPassed()

◆ initialize()

◆ inputHandles()

◆ isClonable()

◆ msg() [1/2]

◆ msg() [2/2]

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ setFilterPassed()

◆ start()

◆ sysExecute()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

Member Data Documentation

◆ m_afterOffsetKey

◆ m_beforeAfterKey

◆ m_beforeOffsetKey

◆ m_bitmasks

◆ m_bitmasks_ele

◆ m_bitmasks_jets

◆ m_bitmasks_mu

◆ m_currentBCincl

◆ m_detStore

◆ m_evtStore

◆ m_extendedExtraObjects

◆ m_l1AKey

◆ m_l1itemlist

◆ m_l1MenuKey

◆ m_monTool

◆ m_otherTypeAfterKey

◆ m_otherTypeBeforeKey

◆ m_otherTypeKey

◆ m_passKey

◆ m_robDataProviderSvc

◆ m_trigCompositeKey

◆ m_varHandleArraysDeclared

◆ m_vhka