#include <NavigationTesterAlg.h>

Inheritance diagram for Trig::NavigationTesterAlg:

Collaboration diagram for Trig::NavigationTesterAlg:

Public Member Functions
	NavigationTesterAlg (const std::string &name, ISvcLocator *pSvcLocator)
	~NavigationTesterAlg () override=default
StatusCode	initialize () override
StatusCode	execute (const EventContext &context) const override
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
using	CombinationsVector = std::vector<std::vector<const xAOD::IParticle *>>
using	CombinationsSet = std::set<std::set<const xAOD::IParticle *>>
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
StatusCode	verifyFlatContent (const std::string &chain) const
StatusCode	verifyCombinationsSize (const CombinationsVector &run2, const CombinationsVector &run3, const std::string &chain) const
StatusCode	verifyCombinationsContent (const CombinationsSet &run2, const CombinationsSet &run3, const std::string &chain) const
bool	combinationsEmpty (const CombinationsVector &combs) const
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
PublicToolHandle< Trig::TrigDecisionTool >	m_tdt {this, "TrigDecisionTool", "", "When enabled read navigation from TDT/off by default"}
PublicToolHandle< Trig::TrigDecisionTool >	m_tdtRun3 {this, "TrigDecisionToolRun3", "", "Use for directly accessing objects"}
PublicToolHandle< Trig::TrigDecisionTool >	m_tdtRun2 {this, "TrigDecisionToolRun2", "", "Use for directly accessing objects"}
ToolHandle< Trig::IIParticleRetrievalTool >	m_toolRun2
ToolHandle< Trig::IIParticleRetrievalTool >	m_toolRun3
Gaudi::Property< std::vector< std::string > >	m_chains
Gaudi::Property< bool >	m_failOnDifference
Gaudi::Property< bool >	m_verifyCombinationsSize
Gaudi::Property< bool >	m_verifyCombinations
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 14 of file NavigationTesterAlg.h.

Member Typedef Documentation

◆ CombinationsSet

using Trig::NavigationTesterAlg::CombinationsSet = std::set<std::set<const xAOD::IParticle *>>

private

Definition at line 45 of file NavigationTesterAlg.h.

◆ CombinationsVector

using Trig::NavigationTesterAlg::CombinationsVector = std::vector<std::vector<const xAOD::IParticle *>>

private

Definition at line 44 of file NavigationTesterAlg.h.

◆ StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ NavigationTesterAlg()

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

Definition at line 59 of file NavigationTesterAlg.cxx.

                                                                                            :
        AthReentrantAlgorithm(name, pSvcLocator)
    {}

◆ ~NavigationTesterAlg()

Trig::NavigationTesterAlg::~NavigationTesterAlg ( )

overridedefault

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

◆ combinationsEmpty()

bool Trig::NavigationTesterAlg::combinationsEmpty ( const CombinationsVector & combs ) const

private

Definition at line 257 of file NavigationTesterAlg.cxx.

                                                                                     {
        size_t counter = 0;
        for ( const std::vector<const xAOD::IParticle*>& outerc: combs ) 
            counter += outerc.size();
        return counter == 0;
    }

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

95{ return m_detStore; }

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

StoreGateSvc_t m_detStore

Definition AthCommonDataStore.h:393

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

85{ return m_evtStore; }

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

StoreGateSvc_t m_evtStore

Definition AthCommonDataStore.h:390

◆ execute()

StatusCode Trig::NavigationTesterAlg::execute ( const EventContext & context ) const

override

Definition at line 76 of file NavigationTesterAlg.cxx.

    {
        for (const std::string &chain : m_chains)
        {
            ATH_MSG_DEBUG("Begin testing chain " << chain << (m_tdt->isPassed(chain) ? " and will dive into details as the chain passed " : " but will not do anything as the chain did not pass"));
            if (!m_tdt->isPassed(chain)) continue;
 
            // explicitely excluded chains
            bool isExcluded = false;
            for (const auto& excludedChain : SpecialCases::excludedChains) {
                if (chain == excludedChain) {
                    isExcluded = true;
                    break; // Break out of the exclusion check loop
                }
            }
 
            if (isExcluded) {
                continue; // Skip the current iteration of the main loop
            }
            
            // We assume that the navigation is ultimately a set of element links
            // We're comparing two types of navigation but they should both point to the same
            // objects.
            // We don't care about the order of the combinations, or the order within the
            // combinations, we just care that they are the same. Therefore, we can convert the
            // vectors to sets and just look at the differences between them
            CombinationsVector vecCombinationsRun2;
            ATH_MSG_DEBUG("###### checking features of CHAIN " << chain);
            ATH_CHECK(m_toolRun2->retrieveParticles(vecCombinationsRun2, chain));
            auto combsRun2 = vectorToSet(vecCombinationsRun2);
            ATH_MSG_DEBUG("Run 2 size " << combsRun2.size());
            // if Run 2 size is 0 we discard any further testing
            if (combsRun2.size() == 0)
            {
                ATH_MSG_DEBUG("Chain " << chain << " testing discarded due to detected Run 2 size == 0");
                continue;
            }
            for (auto& c : combsRun2 ) {
                ATH_MSG_DEBUG(c);
            }
            CombinationsVector vecCombinationsRun3;
            ATH_CHECK(m_toolRun3->retrieveParticles(vecCombinationsRun3, chain));
            auto combsRun3 = vectorToSet(vecCombinationsRun3);
            ATH_MSG_DEBUG("Run 3 size " << combsRun3.size());
 
            if (combinationsEmpty(vecCombinationsRun2) and combinationsEmpty(vecCombinationsRun3)) {
                ATH_MSG_DEBUG("Both, Run2 and Run3 combinations are effectively empty");
                continue;
            }
 
 
            for (auto& c : combsRun3 ) {
                ATH_MSG_DEBUG(c);
            }
            if ( std::regex_match(chain, SpecialCases::gammaXeChain) ) {  
                ATH_CHECK(verifyFlatContent(chain));
            } else {
                if ( m_verifyCombinationsSize ) {
                    ATH_CHECK(verifyCombinationsSize(vecCombinationsRun2, vecCombinationsRun3, chain));
                } 
                if ( m_verifyCombinations ) {
                    ATH_CHECK(verifyCombinationsContent(combsRun2, combsRun3, chain));
                }
            }
 
            ATH_MSG_DEBUG("Verified chain " << chain);
        }
        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 Trig::NavigationTesterAlg::initialize ( )

override

Definition at line 63 of file NavigationTesterAlg.cxx.

    {
        ATH_CHECK(m_tdt.retrieve());
        ATH_CHECK(m_tdtRun2.retrieve());
        ATH_CHECK(m_tdtRun3.retrieve());
        ATH_CHECK(m_toolRun2.retrieve());
        ATH_CHECK(m_toolRun3.retrieve());
 
        if (m_chains.size() == 0)
            ATH_MSG_WARNING("No chains provided, algorithm will be no-op");
        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);
      }
    }
  }

◆ verifyCombinationsContent()

StatusCode Trig::NavigationTesterAlg::verifyCombinationsContent	(	const CombinationsSet &	run2,
		const CombinationsSet &	run3,
		const std::string &	chain ) const

private

Definition at line 194 of file NavigationTesterAlg.cxx.

                                                                                                                                                    {
        // compare combinations
 
        using xAODParticle = const xAOD::IParticle;
 
        auto isSubsetPresent = [](const std::set<xAODParticle*>& subset, const CombinationsSet& run2) {
            for (const auto& setInRun2 : run2) {
                // Manual check for all particles in subset
                bool allFound = true;
                for (auto particle : subset) {
                    if (setInRun2.find(particle) == setInRun2.end()) {
                        allFound = false;
                        break; // If any particle is not found, no need to check further
                    }
                }
                if (allFound) return true; // Found all particles in this subset of Run2
            }
            return false; // Did not find the subset
        };
 
 
        auto isAnySubsetPresent = [&isSubsetPresent](const CombinationsSet& run3, const CombinationsSet& run2) {
            for (const auto& subset : run3) {
                if (isSubsetPresent(subset, run2)) {
                    return true; // At least one subset from Run3 is found in Run2
                }
            }
            return false; // No subset from Run3 was found in Run2
        };
        
        bool result { false };
        // hack for "HLT_e26_lhmedium_nod0_mu8noL1" case
        // hack for "HLT_e24_lhmedium_L1EM20VHI_mu8noL1" type case
        // hack for "HLT_mu11_2mu4noL1_nscan03_L1MU11_2MU6" type case
        if ( std::regex_match(chain, SpecialCases::specialEchain) or
             std::regex_match(chain, SpecialCases::specialElMuChain) or
             std::regex_match(chain, SpecialCases::mu2MunoL1Special) ) {  
            result = isAnySubsetPresent(run3, run2);
        } else {
            // now subset checked on a level of objects, instead of group of objects
            result = isAnySubsetPresent(run2, run3);
        }
 
        if (run2 != run3) 
        {
            ATH_MSG_WARNING("Difference in combinations between Run2 and Run3 format for chain: " << chain << " parsed multiplicities " << ChainNameParser::multiplicities(chain));
            ATH_MSG_WARNING("Run2 combs: " << run2);
            ATH_MSG_WARNING("Run3 combs: " << run3);
        }
 
        if (not result) // previous not isSubset, loosened condition
        {
            ATH_MSG_WARNING("NOT PASSED: failed, Run2 objects are not within a subset of Run3 objects for chain: " << chain << " parsed multiplicities " << ChainNameParser::multiplicities(chain));
            ATH_MSG_WARNING("Run2 combs: " << run2);
            ATH_MSG_WARNING("Run3 combs: " << run3);
            if ( m_failOnDifference ) {
                return StatusCode::FAILURE;
            }
        }
 
        return StatusCode::SUCCESS;
    }

◆ verifyCombinationsSize()

StatusCode Trig::NavigationTesterAlg::verifyCombinationsSize	(	const CombinationsVector &	run2,
		const CombinationsVector &	run3,
		const std::string &	chain ) const

private

Definition at line 181 of file NavigationTesterAlg.cxx.

                                                                                                                                                       {
        if (run2.size() > run3.size()) { // in Run3 we do not use decision per RoI but per object. For single RoI there is more than one object we will have more combinations in Run3
            ATH_MSG_WARNING("Issue in combination sizes for chain " << chain  
                        << " using Run 2 navigation " << run2.size() 
                        << " Run 3 navigation " << run3.size());
            ATH_MSG_WARNING("Mismatched sizes of combinations for chain " << chain << " (enable WARNING messages for more details), this may be a false positive if chain is incorrectly decoded");    
            if ( m_failOnDifference ) {
                return StatusCode::FAILURE;
            }
        }
        return StatusCode::SUCCESS;
    }

◆ verifyFlatContent()

StatusCode Trig::NavigationTesterAlg::verifyFlatContent ( const std::string & chain ) const

private

Definition at line 146 of file NavigationTesterAlg.cxx.

                                                                                  {
        const auto &run3 = m_tdtRun3->features<xAOD::IParticleContainer>(chain);
        std::set<const xAOD::IParticle*> particlesRun3;
        for ( auto l: run3) {
            if (  l.link.isValid() )
                particlesRun3.insert(*(l.link));
        }
 
        CombinationsVector vecCombinationsRun2;
        ATH_CHECK(m_toolRun2->retrieveParticles(vecCombinationsRun2, chain));
        std::set<const xAOD::IParticle*> particlesRun2;
        for ( auto& comb: vecCombinationsRun2) {
            for ( auto el: comb) {
                particlesRun2.insert(el);
            }
        }
 
        for ( auto f2: particlesRun2 ) {
            bool found=false;
            for ( auto f3: particlesRun3 ) {
                ATH_MSG_DEBUG("Serial set of features " << f3 );
                if ( f2 == f3)
                    found = true;
            }
            if ( not found ) {
                ATH_MSG_ERROR("Missing feature in Run 3 that is present in Run 2 " <<  f2 << " chain " << chain << " enable DEBUG to see more details" );
                if ( m_failOnDifference ) {
                    return StatusCode::FAILURE;
                } 
            }
        }
        return StatusCode::SUCCESS;
    }

Member Data Documentation

◆ m_chains

Gaudi::Property<std::vector<std::string> > Trig::NavigationTesterAlg::m_chains

private

Initial value:

{

this, "Chains", {}, "The chains to test"}

Definition at line 32 of file NavigationTesterAlg.h.

32 {

33 this, "Chains", {}, "The chains to test"};

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

Gaudi::Property<bool> Trig::NavigationTesterAlg::m_failOnDifference

private

Initial value:

{
            this, "FailOnDifference", false,
            "Return FAILURE if the navigation does not compare equal"}

Definition at line 34 of file NavigationTesterAlg.h.

                                              {
            this, "FailOnDifference", false,
            "Return FAILURE if the navigation does not compare equal"};

◆ m_tdt

PublicToolHandle<Trig::TrigDecisionTool> Trig::NavigationTesterAlg::m_tdt {this, "TrigDecisionTool", "", "When enabled read navigation from TDT/off by default"}

private

Definition at line 24 of file NavigationTesterAlg.h.

24{this, "TrigDecisionTool", "", "When enabled read navigation from TDT/off by default"};

◆ m_tdtRun2

PublicToolHandle<Trig::TrigDecisionTool> Trig::NavigationTesterAlg::m_tdtRun2 {this, "TrigDecisionToolRun2", "", "Use for directly accessing objects"}

private

Definition at line 26 of file NavigationTesterAlg.h.

26{this, "TrigDecisionToolRun2", "", "Use for directly accessing objects"};

◆ m_tdtRun3

PublicToolHandle<Trig::TrigDecisionTool> Trig::NavigationTesterAlg::m_tdtRun3 {this, "TrigDecisionToolRun3", "", "Use for directly accessing objects"}

private

Definition at line 25 of file NavigationTesterAlg.h.

25{this, "TrigDecisionToolRun3", "", "Use for directly accessing objects"};

◆ m_toolRun2

ToolHandle<Trig::IIParticleRetrievalTool> Trig::NavigationTesterAlg::m_toolRun2

private

Initial value:

{

this, "RetrievalToolRun2Nav", "", "The tool configured to use Run 2 format"}

Definition at line 28 of file NavigationTesterAlg.h.

28 {

29 this, "RetrievalToolRun2Nav", "", "The tool configured to use Run 2 format"};

◆ m_toolRun3

ToolHandle<Trig::IIParticleRetrievalTool> Trig::NavigationTesterAlg::m_toolRun3

private

Initial value:

{

this, "RetrievalToolRun3Nav", "", "The tool configured to use Run 3 format"}

Definition at line 30 of file NavigationTesterAlg.h.

30 {

31 this, "RetrievalToolRun3Nav", "", "The tool configured to use Run 3 format"};

◆ m_varHandleArraysDeclared

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

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

◆ m_verifyCombinations

Gaudi::Property<bool> Trig::NavigationTesterAlg::m_verifyCombinations

private

Initial value:

{
            this, "VerifyCombinationsContent", true,
            "Check if combinations are compatible (point to same objects)"}

Definition at line 40 of file NavigationTesterAlg.h.

                                                {
            this, "VerifyCombinationsContent", true,
            "Check if combinations are compatible (point to same objects)"};

◆ m_verifyCombinationsSize

Gaudi::Property<bool> Trig::NavigationTesterAlg::m_verifyCombinationsSize

private

Initial value:

{
            this, "VerifyCombinationsSize", true,
            "Check if combinations have matching size (that is Run2 >= Run3)"}

Definition at line 37 of file NavigationTesterAlg.h.

                                                    {
            this, "VerifyCombinationsSize", true,
            "Check if combinations have matching size (that is Run2 >= Run3)"};

◆ 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

◆ CombinationsSet

◆ CombinationsVector

◆ StoreGateSvc_t

Constructor & Destructor Documentation

◆ NavigationTesterAlg()

◆ ~NavigationTesterAlg()

Member Function Documentation

◆ cardinality()

◆ combinationsEmpty()

◆ declareGaudiProperty()

◆ declareProperty()

◆ detStore()

◆ evtStore()

◆ execute()

◆ extraDeps_update_handler()

◆ extraOutputDeps()

◆ filterPassed()

◆ initialize()

◆ inputHandles()

◆ isClonable()

◆ msg()

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ setFilterPassed()

◆ sysExecute()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

◆ verifyCombinationsContent()

◆ verifyCombinationsSize()

◆ verifyFlatContent()

Member Data Documentation

◆ m_chains

◆ m_detStore

◆ m_evtStore

◆ m_extendedExtraObjects

◆ m_failOnDifference

◆ m_tdt

◆ m_tdtRun2

◆ m_tdtRun3

◆ m_toolRun2

◆ m_toolRun3

◆ m_varHandleArraysDeclared

◆ m_verifyCombinations

◆ m_verifyCombinationsSize

◆ m_vhka