RoRSeqFilter Class Reference

#include <RoRSeqFilter.h>

Inheritance diagram for RoRSeqFilter:

Collaboration diagram for RoRSeqFilter:

Public Member Functions
	RoRSeqFilter (const std::string &name, ISvcLocator *pSvcLocator)
virtual StatusCode	initialize () override final
	Setup input and output handles.
virtual StatusCode	execute (const EventContext &ctx) const override final
	Apply this filter in-between Steps of trigger execution.
virtual StatusCode	sysInitialize () override
	Override sysInitialize.
virtual bool	isClonable () const override
	Specify if the algorithm is clonable.
virtual unsigned int	cardinality () const override
	Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.
virtual StatusCode	sysExecute (const EventContext &ctx) override
	Execute an algorithm.
virtual const DataObjIDColl &	extraOutputDeps () const override
	Return the list of extra output dependencies.
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.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const

Protected Member Functions
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
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.

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
size_t	copyPassing (const TrigCompositeUtils::DecisionContainer &input, TrigCompositeUtils::DecisionContainer &output, const std::set< HLT::Identifier > &topass, const EventContext &ctx) const
	Applies generic filter to input container, keeping only the decision objects with at least one affirmative decision from the previous Stage.
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
SG::ReadHandleKeyArray< TrigCompositeUtils::DecisionContainer >	m_inputKeys { this, "Input", {}, "Inputs to the filter" }
SG::WriteHandleKeyArray< TrigCompositeUtils::DecisionContainer >	m_outputKeys { this, "Output", {}, "Output" }
Gaudi::Property< std::vector< std::string > >	m_chainsProperty { this, "Chains", {}, "Chains of which this filter is concerned" }
std::set< HLT::Identifier >	m_chains
std::vector< std::string >	m_monInputNames
Gaudi::Property< std::vector< std::vector< std::string > > >	m_chainsPerInputProperty { this, "ChainsPerInput", {}, "Chains of which this filter is concerned" }
std::vector< std::set< HLT::Identifier > >	m_chainsPerInput
Gaudi::Property< std::vector< std::vector< unsigned > > >	m_ioMappingProperty { this, "IOMapping", {}, "Maps which inputs should be routed to which output" }
	It can be used to define a custom routing from input to output collections Example: [[0,1,3], [2]] means that inputs 0, 1, and 3 are directed to output 0, and input under the index 2 to aoutput 1 When not set the default is used.
std::vector< std::vector< unsigned > >	m_ioMapping
ToolHandle< GenericMonitoringTool >	m_monTool { this, "MonTool", "", "Filter I/O monitoring" }
DataObjIDColl	m_extendedExtraObjects
	Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default)
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default)
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Detailed Description

Definition at line 47 of file RoRSeqFilter.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

RoRSeqFilter()

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

Definition at line 23 of file RoRSeqFilter.cxx.

                             :
  ::AthReentrantAlgorithm( name, pSvcLocator )
{}

Member Function Documentation

cardinality()

unsigned int AthCommonReentrantAlgorithm< Gaudi::Algorithm >::cardinality ( ) const

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

copyPassing()

size_t RoRSeqFilter::copyPassing ( const TrigCompositeUtils::DecisionContainer & input, TrigCompositeUtils::DecisionContainer & output, const std::set< HLT::Identifier > & topass, const EventContext & ctx ) const

private

Applies generic filter to input container, keeping only the decision objects with at least one affirmative decision from the previous Stage.

Considering only decisions from chains utilising this filter.

Parameters

inputKey	Storegate key of input, needed to link newly created decision objects to their parents.
output	Writeable output container to store copies of decision objects which pass the filter.

Returns

The number of decision objects which passed the filter.

Produced a selective copy of all Decision objects in the input container which possess a positive decision from at least one of the chains which this filter algorithm is configured for. This new object is linked to its parent and stored in the output collection. It will form the starting point for the next Step.

Definition at line 194 of file RoRSeqFilter.cxx.

                                                                  {
  size_t passCounter = 0;
  for (const Decision* inputDecision : input) {
 
    ATH_MSG_DEBUG("Number of positive decisions for this input is " << decisionIDs(inputDecision).size()
                  <<". Applying filter of size " << topass.size());
 
    const DecisionIDContainer& intersection = passedDecisionIDs(inputDecision, topass);
 
    if ( not intersection.empty() ) {      
      // This sets up the 'self' link & the 'seed' link (seeds from inputDecision)
      Decision* decisionCopy = newDecisionIn( &output, inputDecision, filterNodeName(), ctx );
 
      // Copy accross only the DecisionIDs which have passed through this Filter for this Decision object. 
      // WARNING: Still need to 100% confirm if the correct set to propagate forward is objDecisions or intersection.
      // Tim M changing this from inputDecisions (all IDs) -> intersection (only passed IDs) Feb 19
      insertDecisionIDs(intersection, decisionCopy);     
      passCounter ++;
      if (msgLvl(MSG::DEBUG)){
        ATH_MSG_DEBUG("Input satisfied at least one filtering chain. Chain(s) passing:");
        for ( DecisionID id : intersection ) {
           ATH_MSG_DEBUG( " -- " << HLT::Identifier( id ) );
          }
      }
      
    } else {
      ATH_MSG_DEBUG("No Input decisions requested by filtering chains");
    }
  }
  return passCounter;  
}

declareGaudiProperty()

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

declareProperty()

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.

{ return m_detStore; }

evtStore()

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.

{ return m_evtStore; }

execute()

StatusCode RoRSeqFilter::execute ( const EventContext & ctx ) const

finaloverridevirtual

Apply this filter in-between Steps of trigger execution.

Fully implicit inputs, requires Control Flow to unlock. will signal a negative filter result to the Scheduler if zero chains remain active upon termination.

Definition at line 121 of file RoRSeqFilter.cxx.

                                                                {
  ATH_MSG_DEBUG ( "Executing " << name() << "..." );
  if (Athena::Timeout::instance(ctx).reached()) {
    ATH_MSG_ERROR("Timeout reached before " << name());
    return Athena::Status::TIMEOUT;
  }
  auto inputHandles  = m_inputKeys.makeHandles( ctx );
  auto outputHandles = m_outputKeys.makeHandles( ctx );
 
  std::vector<bool> inputStats(inputHandles.size() + 2, false);
  inputStats[0] = true;  // position 0 for number of execs, always true
  bool validInputs = false;
  for ( size_t i=0; i<inputHandles.size(); i++) {
    if( inputHandles[i].isValid() ) { // this is because input is implicit
      validInputs = true;
      inputStats[i+2] = true;
    }
  }
  inputStats[1] = validInputs; // position 1 for number of execes with any collection valid
  auto inputName = Monitored::Collection<std::vector<std::string>>( "name", m_monInputNames );
  auto inputStat = Monitored::Collection<std::vector<bool>>( "stat", inputStats );
  Monitored::Group( m_monTool, inputStat, inputName );
  
  if (!validInputs) {
    setFilterPassed(false, ctx);
    ATH_MSG_DEBUG ( "No valid inputs found, filter failed. Return...." );
    return StatusCode::SUCCESS;
  }
 
  ATH_MSG_DEBUG ( "Running on "<< inputHandles.size() <<" input keys" );
  
  size_t passCounter = 0;
 
  for ( size_t outputIndex = 0; outputIndex < m_ioMapping.size(); ++outputIndex ) {
    bool anyPresent =  false;
    for ( unsigned inputIndex : m_ioMapping[outputIndex] ) {
      if( not inputHandles[inputIndex].isValid() ) {
        ATH_MSG_DEBUG( "InputHandle "<< inputHandles[inputIndex].key() <<" not present" );
      } else if ( inputHandles[inputIndex]->empty() ) {
        ATH_MSG_DEBUG( "InputHandle "<< inputHandles[inputIndex].key() <<" contains all rejected decisions, skipping" );
      } else {
        anyPresent = true;
      }
    }
    if ( anyPresent ) {
      createAndStore(outputHandles[outputIndex]);
      DecisionContainer* output = outputHandles[outputIndex].ptr();
      for ( auto inputIndex : m_ioMapping[outputIndex] ) {
        if ( inputHandles[inputIndex].isValid() and not inputHandles[inputIndex]->empty() ) {
          ATH_MSG_DEBUG( "Checking inputHandle: "<< inputHandles[inputIndex].key() <<" has " << inputHandles[inputIndex]->size() <<" elements");
          if ( not m_chainsPerInput.empty() ) {
            passCounter += copyPassing( *inputHandles[inputIndex], *output, m_chainsPerInput[inputIndex], ctx );
          } else {
            passCounter += copyPassing( *inputHandles[inputIndex], *output, m_chains, ctx );
          }
          ATH_MSG_DEBUG( "Recorded output key " <<  m_outputKeys[ outputIndex ].key() <<" of size "<<output->size()  <<" at index "<< outputIndex);
        }
      }
    }
  }
 
  setFilterPassed( passCounter != 0, ctx );
 
  if ( msgLvl( MSG::DEBUG ) ){
    ATH_MSG_DEBUG( "Filter " << ( filterPassed(ctx) ? "passed" : "rejected" ) );
    for ( auto& output: outputHandles ) {
      if( output.isValid() ) ATH_MSG_DEBUG( " "<<output.key() );
    }
  }
 
  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 ( ) const

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 RoRSeqFilter::initialize ( )

finaloverridevirtual

Setup input and output handles.

Renounce all input handles. Get IDs for all configured chains.

Definition at line 29 of file RoRSeqFilter.cxx.

{
  CHECK( not m_inputKeys.empty() );
  CHECK( not m_outputKeys.empty() );
 
  CHECK( m_inputKeys.initialize() );
  CHECK( m_outputKeys.initialize() );
 
  renounceArray(m_inputKeys);
 
  // default IO mappnig nth input -> nth output
  if ( m_ioMappingProperty.empty()) {
    CHECK( m_inputKeys.size() == m_outputKeys.size() );
    for ( unsigned i = 0; i < m_inputKeys.size(); ++i ) {
      m_ioMapping.push_back( {i} );
    }
    ATH_MSG_DEBUG( "Default I/O collections mapping nth input -> nth output" );
  } else {
    m_ioMapping = m_ioMappingProperty;
    ATH_MSG_DEBUG( "Custom I/O mapping used by the filter" );
  }
 
  for ( size_t i = 0; i < m_ioMapping.size(); ++i ) {
    for ( unsigned inIndex: m_ioMapping[i] ) {
      ATH_MSG_DEBUG("Input collection: " << m_inputKeys[inIndex] );
    }
    ATH_MSG_DEBUG("   Routed to output collection " << m_outputKeys[i] );
  }
 
  // crosscheck mapping (also the default one)
  CHECK( m_ioMapping.size() == m_outputKeys.size() ); // all outputs will be filled
  std::set<int> inIndices;
  for ( auto i: m_ioMapping ) {
    CHECK( not i.empty() ); // all outputs are connected to at least one input
    inIndices.insert( i.begin(), i.end() );
  }
  CHECK( inIndices.size() == m_inputKeys.size() ); // all inputs are routed
  for ( size_t i = 0; i < m_ioMapping.size(); ++i ) {
    auto iset = std::set( m_ioMapping[i].begin(), m_ioMapping[i].end() );
    for ( size_t j = i+1; j < m_ioMapping.size(); ++j ) {
      for ( auto el: m_ioMapping[j] ) {
        if ( iset.count( el ) != 0 ) {
          ATH_MSG_ERROR( "The input index " << el << " directed to two outputs " << m_ioMapping[i] << " " << m_ioMapping[j] );
          return StatusCode::FAILURE;
        }
      }
    }
  }
 
  if (msgLvl(MSG::DEBUG)){
    ATH_MSG_DEBUG("Will consume implicit ReadDH:" );
    for (auto& input: m_inputKeys){  
      ATH_MSG_DEBUG(" - "<<input.key());
    }
    ATH_MSG_DEBUG("Will produce WriteDH: ");
    for (auto& output: m_outputKeys){
      ATH_MSG_DEBUG(" - "<<output.key());
    }
  }
  
  CHECK( not m_chainsProperty.empty() );
  
  for ( const std::string& el: m_chainsProperty ) 
    m_chains.insert( HLT::Identifier( el ).numeric() );
    
 
  m_chainsPerInput.resize( m_chainsPerInputProperty.size() );
  for ( size_t i = 0; i < m_chainsPerInputProperty.size(); ++i ) {
    for ( const std::string& el: m_chainsPerInputProperty[i] )
        m_chainsPerInput[i].insert( HLT::Identifier( el ).numeric() );
  }
 
  if (msgLvl(MSG::DEBUG)){
    ATH_MSG_DEBUG( "Configured to require these chains: ");
    for ( const HLT::Identifier& id: m_chains )
      ATH_MSG_DEBUG( " - " << id );
  }
  
  if ( not m_monTool.name().empty() ) {
    ATH_CHECK( m_monTool.retrieve() );
  }
 
  // Prepare monitoring vector
  m_monInputNames = {"exec", "anyvalid"};
  for (const auto& k : m_inputKeys) {
    m_monInputNames.push_back( k.key() );
  }
  
  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 ( ) const

overridevirtualinherited

Specify if the algorithm is clonable.

Reentrant algorithms are clonable.

Reimplemented in InDet::GNNSeedingTrackMaker, InDet::SCT_Clusterization, InDet::SiSPGNNTrackMaker, InDet::SiSPSeededTrackFinder, InDet::SiTrackerSpacePointFinder, ITkPixelCablingAlg, ITkStripCablingAlg, RoIBResultToxAOD, SCT_ByteStreamErrorsTestAlg, SCT_CablingCondAlgFromCoraCool, SCT_CablingCondAlgFromText, SCT_ConditionsParameterTestAlg, SCT_ConditionsSummaryTestAlg, SCT_ConfigurationConditionsTestAlg, SCT_FlaggedConditionTestAlg, SCT_LinkMaskingTestAlg, SCT_MajorityConditionsTestAlg, SCT_ModuleVetoTestAlg, SCT_MonitorConditionsTestAlg, SCT_PrepDataToxAOD, SCT_RawDataToxAOD, SCT_ReadCalibChipDataTestAlg, SCT_ReadCalibDataTestAlg, SCT_RODVetoTestAlg, SCT_SensorsTestAlg, SCT_SiliconConditionsTestAlg, SCT_StripVetoTestAlg, SCT_TdaqEnabledTestAlg, SCT_TestCablingAlg, SCTEventFlagWriter, SCTRawDataProvider, SCTSiLorentzAngleTestAlg, SCTSiPropertiesTestAlg, and Simulation::BeamEffectsAlg.

Definition at line 68 of file AthCommonReentrantAlgorithm.cxx.

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

msg()

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

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 HypoBase, and InputMakerBase.

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_chains

std::set<HLT::Identifier> RoRSeqFilter::m_chains

private

Definition at line 70 of file RoRSeqFilter.h.

m_chainsPerInput

std::vector<std::set<HLT::Identifier> > RoRSeqFilter::m_chainsPerInput

private

Definition at line 74 of file RoRSeqFilter.h.

m_chainsPerInputProperty

Gaudi::Property<std::vector <std::vector<std::string> > > RoRSeqFilter::m_chainsPerInputProperty { this, "ChainsPerInput", {}, "Chains of which this filter is concerned" }

private

Definition at line 73 of file RoRSeqFilter.h.

{ this, "ChainsPerInput", {}, "Chains of which this filter is concerned" };

m_chainsProperty

Gaudi::Property<std::vector<std::string> > RoRSeqFilter::m_chainsProperty { this, "Chains", {}, "Chains of which this filter is concerned" }

private

Definition at line 69 of file RoRSeqFilter.h.

{ this, "Chains", {}, "Chains of which this filter is concerned" };

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_inputKeys

SG::ReadHandleKeyArray<TrigCompositeUtils::DecisionContainer> RoRSeqFilter::m_inputKeys { this, "Input", {}, "Inputs to the filter" }

private

Definition at line 66 of file RoRSeqFilter.h.

{ this, "Input", {}, "Inputs to the filter" };

m_ioMapping

std::vector<std::vector<unsigned> > RoRSeqFilter::m_ioMapping

private

Definition at line 82 of file RoRSeqFilter.h.

m_ioMappingProperty

Gaudi::Property< std::vector<std::vector<unsigned> > > RoRSeqFilter::m_ioMappingProperty { this, "IOMapping", {}, "Maps which inputs should be routed to which output" }

private

It can be used to define a custom routing from input to output collections Example: [[0,1,3], [2]] means that inputs 0, 1, and 3 are directed to output 0, and input under the index 2 to aoutput 1 When not set the default is used.

I.e. nth input -> nth output

Definition at line 81 of file RoRSeqFilter.h.

{ this, "IOMapping", {}, "Maps which inputs should be routed to which output" };

m_monInputNames

std::vector<std::string> RoRSeqFilter::m_monInputNames

private

Definition at line 71 of file RoRSeqFilter.h.

m_monTool

ToolHandle<GenericMonitoringTool> RoRSeqFilter::m_monTool { this, "MonTool", "", "Filter I/O monitoring" }

private

Definition at line 99 of file RoRSeqFilter.h.

{ this, "MonTool", "", "Filter I/O monitoring" };

m_outputKeys

SG::WriteHandleKeyArray<TrigCompositeUtils::DecisionContainer> RoRSeqFilter::m_outputKeys { this, "Output", {}, "Output" }

private

Definition at line 67 of file RoRSeqFilter.h.

{ this, "Output", {}, "Output" };

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:

• RoRSeqFilter.h
• RoRSeqFilter.cxx