DisplacedJetRankComboHypoTool Class Reference

#include <DisplacedJetRankComboHypoTool.h>

Inheritance diagram for DisplacedJetRankComboHypoTool:

Collaboration diagram for DisplacedJetRankComboHypoTool:

Public Member Functions
	DisplacedJetRankComboHypoTool (const std::string &type, const std::string &name, const IInterface *parent)
virtual StatusCode	initialize () override
virtual StatusCode	decide (Combo::LegDecisionsMap &passingLegs, const EventContext &ctx) const override
	retrieves the decisions associated to this decId, make their combinations and apply the algorithm More...
virtual HLT::Identifier	decisionId () const
	retrieves this ComboHypoTool's chain's decision ID More...
StatusCode	setLegMultiplicity (const Combo::MultiplicityReqMap &multiplicityRequiredMap)
	Sets the number of legs and the multiplicity required on each leg. More...
const std::vector< int > &	legMultiplicity () const
	Gets the number of legs and the multiplicity required on each leg. More...
HLT::Identifier	legDecisionId (size_t i) const
	Retrieves this ComboHypoTool's chain's decision ID for a given leg. More...
const std::vector< HLT::Identifier > &	legDecisionIds () const
	Retrieves this ComboHypoTool's chain's decision IDs for all legs. More...
virtual StatusCode	decideOnSingleObject (TrigCompositeUtils::Decision *, const std::vector< const TrigCompositeUtils::DecisionIDContainer * > &) const
	Alternate method called by BPhysics ComboHypoAlgs instead of the base method decide(...). More...

Protected Member Functions
virtual bool	executeAlg (const std::vector< Combo::LegDecision > &combination) const
	Only a dummy implementation exists in ComboHypoToolBase. More...
StatusCode	selectLegs (const Combo::LegDecisionsMap &IDCombMap, std::vector< std::vector< Combo::LegDecision >> &leg_decisions) const
	Creates the per-leg vectors of Decision objects starting from the initial LegDecision map, storing only those concerning this HypoTool's chain Pack the Decision objects in std::pair<DecisionID, ElementLink<Decision>> so the derived class' executeAlg function knows which leg each object is on. More...
void	updateLegDecisionsMap (const std::vector< std::vector< Combo::LegDecision >> &passing_comb, Combo::LegDecisionsMap &passingLegs) const
	For when the tool accepts some/all combinations. More...
void	eraseFromLegDecisionsMap (Combo::LegDecisionsMap &passingLegs) const
	For when the tool rejects all combinations. More...
StatusCode	printDebugInformation (const Combo::LegDecisionsMap &passingLegs) const
	Print the output of the tool, after having removed failed Decision Objects. More...

Protected Attributes
Gaudi::Property< size_t >	m_combinationsThresholdWarn
Gaudi::Property< size_t >	m_combinationsThresholdBreak
Gaudi::Property< bool >	m_modeOR
Gaudi::Property< bool >	m_enableOverride

Private Attributes
Gaudi::Property< unsigned int >	m_rankcut {this, "max_jet_rank",{2}, "Maximum jet rank which will be processed, counts from 0"}
Gaudi::Property< unsigned int >	m_maxjets {this, "max_jets",{0}, "Maximum number of jets allowed in the event"}
HLT::Identifier	m_decisionId
	The DecisionID of the chain, obtained from the Tool's name. More...
std::vector< HLT::Identifier >	m_legDecisionIds
	The DecisionIDs of the individual legs, derived from both m_decisionId and m_legMultiplicities. More...
std::vector< int >	m_legMultiplicities
	The number of legs, and the required multiplicity on each leg. More...

Detailed Description

Definition at line 8 of file DisplacedJetRankComboHypoTool.h.

Constructor & Destructor Documentation

DisplacedJetRankComboHypoTool()

DisplacedJetRankComboHypoTool::DisplacedJetRankComboHypoTool	(	const std::string &	type,
		const std::string &	name,
		const IInterface *	parent
	)

Definition at line 5 of file DisplacedJetRankComboHypoTool.cxx.

: ComboHypoToolBase(type, name, parent) {}

Member Function Documentation

decide()

StatusCode DisplacedJetRankComboHypoTool::decide ( Combo::LegDecisionsMap &  passingLegs, const EventContext &    ) const

overridevirtual

retrieves the decisions associated to this decId, make their combinations and apply the algorithm

Parameters

[in]	LegDecisionsMap	that lists all the passing decisions, to be updated by the tool depending on the outcome of executeAlg
[in]	Event	Context, currently unused

Reimplemented from ComboHypoToolBase.

Definition at line 11 of file DisplacedJetRankComboHypoTool.cxx.

                                                                                                              {
    // if no combinations passed, then exit 
    if (passingLegs.size() == 0) {
        return StatusCode::SUCCESS;
    }
 
    std::vector<std::vector<Combo::LegDecision>> legDecisions;
    ATH_CHECK(selectLegs(passingLegs, legDecisions));
 
    //get all the passing jets across all legs
    //also fill a map of jet -> decisions
    //derive ranks for these jets
    //get the list of decision objects which can go on
 
    //need to establish which leg ids come from the displaced jet trigger
    std::unordered_set<TrigCompositeUtils::DecisionID> dispj_leg_ids;
 
    ATH_MSG_DEBUG("Have "<<passingLegs.size()<<" passing legs in");
 
    for(auto it : passingLegs){
        if(it.second.size() == 0) continue; //empty set of decisions
        //only need to look at the first decision
        const TrigCompositeUtils::Decision* decision(*(it.second[0]));
        if(decision->hasObjectLink("djtrig_counts")){
            dispj_leg_ids.insert(it.first);
        }
    }
 
    ATH_MSG_DEBUG("Have "<<dispj_leg_ids.size()<<" dispjet legs");
 
    std::vector<const xAOD::Jet*> input_jets;
    std::map<const xAOD::Jet*, std::vector<Combo::LegDecision>> jet_decisions;
 
    //populate jet decision map first
    for(const auto& leg_decs : legDecisions){
        for(auto dec_pair : leg_decs){
            const TrigCompositeUtils::Decision* decision(*(dec_pair.second));
 
            //this leg is not a displaced jet leg
            //this tool should ignore it
            if(dispj_leg_ids.count(dec_pair.first) == 0) continue;
 
            //find the jet feature
            std::vector<TrigCompositeUtils::LinkInfo<xAOD::JetContainer>> jet_feature_links = TrigCompositeUtils::findLinks<xAOD::JetContainer>(decision, TrigCompositeUtils::featureString(), TrigDefs::lastFeatureOfType);
            if(jet_feature_links.size() == 0) continue; //verify that we get a jet
            ATH_CHECK(jet_feature_links.size() == 1); //ensure we only have 1 link
            const TrigCompositeUtils::LinkInfo<xAOD::JetContainer> jet_feature_link = jet_feature_links.at(0);
            //verify if the feature link is valid
            ATH_CHECK(jet_feature_link.isValid());
            const xAOD::Jet* jet = *(jet_feature_link.link);
 
            jet_decisions[jet].push_back(dec_pair);
        }
    }
 
    ATH_MSG_DEBUG("Have "<<jet_decisions.size()<<" jets");
 
 
    //fill the input_jets vector
    //filled from the map key which ensures it only gets one entry per jet
    for(auto pair: jet_decisions){
        input_jets.push_back(pair.first);
    }
 
    if(input_jets.size() == 0){
        //reject all legs
        //this should not happen
        ATH_MSG_DEBUG("No input jets, rejecting all legs");
        eraseFromLegDecisionsMap(passingLegs);
        return StatusCode::SUCCESS;
    }
    
    //apply max jet cut to the number of input passing jets
    if(m_maxjets > 0 && input_jets.size() > m_maxjets){
        //max jets cut
        //event fails
        ATH_MSG_DEBUG("Reject event as it has "<<input_jets.size()<<" input passing jets but max jet cut is "<<m_maxjets);
        eraseFromLegDecisionsMap(passingLegs);
        return StatusCode::SUCCESS;
    }
 
 
    //rank jets by pt
    std::sort(input_jets.begin(), input_jets.end(), [](const xAOD::Jet* a, const xAOD::Jet* b) -> bool
        { 
            return a->pt() > b->pt();
        }
    );
 
    //map of legid -> vector of passing decisions
    Combo::LegDecisionsMap accepted_decisions_by_leg;
 
    unsigned int n_jets_passed = 0;
    //make a list of all decisions which are associated with passed jets
    for(size_t i = 0; i<input_jets.size(); i++){
        if(i > m_rankcut) continue; //skip jet as it is outside the rank cut
        n_jets_passed += 1;
 
        //get all the decisions pairs [legId, decision] for this jet
        for(auto leg_dec_pair: jet_decisions.at(input_jets.at(i))){
            accepted_decisions_by_leg[leg_dec_pair.first].push_back(leg_dec_pair.second);
            ATH_MSG_DEBUG("Accepting decision for jet "<<input_jets.at(i)->pt()/1000.0);
        }
    }
 
 
    if(n_jets_passed < input_jets.size()){
        //check that the number of jets has changed
        //this is an optimisation to avoid a needless loop when all jets pass
        //update the legs to only pass the decisions which are associated with passing jets
        for (auto& legIt : passingLegs) {
            if(dispj_leg_ids.count(legIt.first) == 0) continue; //do not do anything with none dispj legs
 
            auto accepted_decisions_on_leg = accepted_decisions_by_leg.find(legIt.first);
 
            if(accepted_decisions_on_leg != accepted_decisions_by_leg.end()){
                //update the list of decisions
                legIt.second = accepted_decisions_on_leg->second;
                ATH_MSG_DEBUG("Updating leg "<<legIt.first<<" with "<<accepted_decisions_on_leg->second.size()<<" decisions");
            }else{
                //no jets pass this leg and the pt rank cut
                //empty the leg
                ATH_MSG_DEBUG("Updating leg "<<legIt.first<<"; clearing decisions");
                legIt.second.clear();
            }
        }
    }
 
    //apply the multiplicity rules
    auto lm = legMultiplicity();
    for(size_t i=0; i<lm.size(); i++){
        auto legId = legDecisionId(i);
 
        if(passingLegs[legId].size() < (size_t)(lm.at(i))){
            //leg has not got enough passes
            //whole event fails as a leg does not pass
            ATH_MSG_DEBUG("Leg "<<legId<<" fails mulitplicity check, rejecting event");
            eraseFromLegDecisionsMap(passingLegs);
            return StatusCode::SUCCESS;
        }
    }
 
    return StatusCode::SUCCESS;
}

decideOnSingleObject()

StatusCode ComboHypoToolBase::decideOnSingleObject ( TrigCompositeUtils::Decision *  , const std::vector< const TrigCompositeUtils::DecisionIDContainer * > &    ) const

virtualinherited

Alternate method called by BPhysics ComboHypoAlgs instead of the base method decide(...).

This function should be considered a specialist use-case only. It must be over-ridden to do anything useful.

Reimplemented in TrigMultiTrkComboHypoTool, and TrigBmumuxComboHypoTool.

Definition at line 284 of file ComboHypoToolBase.cxx.

                                                                                                                                  {
  ATH_MSG_ERROR("Do not use ComboHypoToolBase on its own, inherit this class and override decideOnSingleObject.");
  ATH_MSG_ERROR("NOTE: Only if you are also supplying your own decide(...) implimentation, or similar.");
  ATH_MSG_ERROR("NOTE: Most uses cases should only need to override executeAlg(...).");
  return StatusCode::FAILURE;
}

decisionId()

virtual HLT::Identifier ComboHypoToolBase::decisionId ( ) const

inlinevirtualinherited

retrieves this ComboHypoTool's chain's decision ID

Definition at line 41 of file ComboHypoToolBase.h.

{ return m_decisionId; }

eraseFromLegDecisionsMap()

void ComboHypoToolBase::eraseFromLegDecisionsMap ( Combo::LegDecisionsMap &  passingLegs ) const

protectedinherited

For when the tool rejects all combinations.

Remove all Decision Objects from all the legs of this HypoTool's chain.

Definition at line 253 of file ComboHypoToolBase.cxx.

                                                                                        {
  for (auto& it : passingLegs) {
    DecisionID id = it.first;
    if (id == m_decisionId or (isLegId(id) and getIDFromLeg(id) == m_decisionId)) {
      const size_t nDecisionObjects = it.second.size();
      it.second.clear();
      ATH_MSG_VERBOSE("-- Removed " << nDecisionObjects << " from " << id);
    }
  }
}

executeAlg()

bool ComboHypoToolBase::executeAlg ( const std::vector< Combo::LegDecision > &  combination ) const

protectedvirtualinherited

Only a dummy implementation exists in ComboHypoToolBase.

This should be over-ridden by a derived class. The derived class should return a boolean pass/fail for each possible combination in the event. param[in] combination A single combination of objects to be discriminated against. Vector contains the required number of objects over all legs. Use the pair.first to tell which leg a given pair.second decision object belongs to in the current combination.

Reimplemented in TrigEgammaTopoHypoTool, TrigAFPDijetComboHypoTool, DebugComboHypoTool, DeltaRRoIComboHypoTool, TrigMuonEFIdtpInvMassHypoTool, TrigMuonEFInvMassHypoTool, TrigMultiTrkComboHypoTool, and TrigBmumuxComboHypoTool.

Definition at line 279 of file ComboHypoToolBase.cxx.

                                                                             {
  ATH_MSG_ERROR("Do not use ComboHypoToolBase on its own, inherit this class and override executeAlg.");
  return false;
}

initialize()

StatusCode DisplacedJetRankComboHypoTool::initialize ( )

overridevirtual

Definition at line 7 of file DisplacedJetRankComboHypoTool.cxx.

                                                    {
    return StatusCode::SUCCESS;
}

legDecisionId()

HLT::Identifier ComboHypoToolBase::legDecisionId ( size_t  i ) const

inlineinherited

Retrieves this ComboHypoTool's chain's decision ID for a given leg.

Only populated for chains with more than one leg. For chains with one leg, use decisionId()

Definition at line 60 of file ComboHypoToolBase.h.

{ return m_legDecisionIds.at(i); }

legDecisionIds()

const std::vector<HLT::Identifier>& ComboHypoToolBase::legDecisionIds ( ) const

inlineinherited

Retrieves this ComboHypoTool's chain's decision IDs for all legs.

Only populated for chains with more than one leg. For chains with one leg, use decisionId()

Definition at line 66 of file ComboHypoToolBase.h.

{ return m_legDecisionIds; }

legMultiplicity()

const std::vector<int>& ComboHypoToolBase::legMultiplicity ( ) const

inlineinherited

Gets the number of legs and the multiplicity required on each leg.

Definition at line 54 of file ComboHypoToolBase.h.

{ return m_legMultiplicities; }

printDebugInformation()

StatusCode ComboHypoToolBase::printDebugInformation ( const Combo::LegDecisionsMap &  passingLegs ) const

protectedinherited

Print the output of the tool, after having removed failed Decision Objects.

Restricted to the ComboHypoTool's chain's legs.

Definition at line 264 of file ComboHypoToolBase.cxx.

                                                                                                 {
  ATH_MSG_DEBUG("ComboHypoToolBase: End of " << m_decisionId << ", passing elements are: ");
  for (const auto& [id, ELV] : passingLegs) {
    // Only print for this chain
    if (id == m_decisionId or (isLegId(id) and m_decisionId == getIDFromLeg(id))) { 
      ATH_MSG_DEBUG("-- " << HLT::Identifier(id) << " with " << ELV.size() << " elements");
      for (const auto& EL : ELV) {
        ATH_MSG_DEBUG("-- -- container:" << EL.dataID() << ", index:" << EL.index());
      }
    }
  }
  return StatusCode::SUCCESS;
}

selectLegs()

StatusCode ComboHypoToolBase::selectLegs ( const Combo::LegDecisionsMap &  IDCombMap, std::vector< std::vector< Combo::LegDecision >> &  leg_decisions  ) const

protectedinherited

Creates the per-leg vectors of Decision objects starting from the initial LegDecision map, storing only those concerning this HypoTool's chain Pack the Decision objects in std::pair<DecisionID, ElementLink<Decision>> so the derived class' executeAlg function knows which leg each object is on.

Definition at line 172 of file ComboHypoToolBase.cxx.

{
  /*
    legDecisions: nested vector like:
    [(leg0, el0), (leg0, el1), (leg0, el2), (leg0, el3)], <-- All leg0 objects are in legDecisions[0][X]
    [(leg1, mu0), (leg1, mu1)] <-- All leg1 objects are in legDecisions[1][X]
    We keep the legID in the std::pair inside the inner vector as these pairs will be flattened into a single vector
    when individual combinations of objects are passed to executeAlg, pair.first then contains the leg, with pair.second containing the Decision Object.
  */
 
  // Extract from IDCombMap the features for this chain. Wrap the features up in a pair along with their leg ID
  for (size_t legIndex = 0; legIndex < m_legMultiplicities.size(); ++ legIndex) {
 
    // If the chain has more than one leg, then we have per-leg IDs. Otherwise we just use the chain's ID
    const HLT::Identifier& legIdentifier = (m_legMultiplicities.size() > 1 ? m_legDecisionIds.at(legIndex) : m_decisionId);
 
    // Combo::LegDecision is a pair of <DecisionID, ElementLink<Decision>>
    std::vector<Combo::LegDecision> decisionObjectsOnLeg;
 
    // Find physics objects on this leg. May be zero.
    const Combo::LegDecisionsMap::const_iterator it = IDCombMap.find(legIdentifier.numeric());
 
    if (it != IDCombMap.end()) {
      for (const ElementLink<DecisionContainer>& el : it->second) {
        decisionObjectsOnLeg.emplace_back(legIdentifier, el);
      }
    }
 
    legDecisions.push_back(std::move(decisionObjectsOnLeg));
  }
 
  if (msgLvl(MSG::DEBUG)) {
    ATH_MSG_DEBUG("Getting " << legDecisions.size() << " legs to combine, for ID: " << decisionId());
    size_t count = 0;
    for (const auto& leg : legDecisions) {
      ATH_MSG_DEBUG("Leg " << count++ << " --");
      for (const auto& dEL : leg) {
        ATH_MSG_DEBUG("-- " << HLT::Identifier(dEL.first) << " container:" << dEL.second.dataID() << ", index:" << dEL.second.index());
      }
    }
  }
  return StatusCode::SUCCESS;
}

setLegMultiplicity()

StatusCode ComboHypoToolBase::setLegMultiplicity ( const Combo::MultiplicityReqMap &  multiplicityRequiredMap )

inherited

Sets the number of legs and the multiplicity required on each leg.

This should be called when the Tool is retrieved by its parent ComboHypo alg. This also sets the leg Decision IDs at the same time param[in] multiplicityRequiredMap: Mapping of chains to required multiplicity per leg.

Definition at line 16 of file ComboHypoToolBase.cxx.

                                                                                                       {
  const std::string nameOfToolsChain = m_decisionId.name();
  const Combo::MultiplicityReqMap::const_iterator it = multiplicityRequiredMap.find(nameOfToolsChain);
 
  if (it == multiplicityRequiredMap.end()) {
    ATH_MSG_ERROR("ComboHypoTool for " << m_decisionId << " could not find its required multiplcity data in the map supplied by its parent alg.");
    return StatusCode::FAILURE;
  }
 
  m_legMultiplicities = it->second;
  if (m_legMultiplicities.size() == 0) {
    ATH_MSG_ERROR("ComboHypoTool for " << m_decisionId << " was listed in the supplied multiplicityRequiredMap, but data was not supplied for any legs.");
    return StatusCode::FAILURE;
  }
 
  m_legDecisionIds.clear();
  for (size_t i = 0; i < m_legMultiplicities.size(); ++i) {
    if(m_legMultiplicities.at(i) <= 0) {
      ATH_MSG_ERROR("ComboHypoTool for " << m_decisionId << " has been configured with an impossible multiplicity requirement of " << m_legMultiplicities.at(i) << " on leg " << i);
      return StatusCode::FAILURE;
    }
    ATH_MSG_DEBUG("ComboHypoTool for " << m_decisionId << " will require multiplicity " << m_legMultiplicities.at(i) << " on leg " << i);
    if (m_legMultiplicities.size() > 1) { // We only have per-leg IDs when there is more than one leg
      m_legDecisionIds.push_back(createLegName(m_decisionId, i));
    } else {  // For one leg, just repete the chain's ID
      m_legDecisionIds.push_back(m_decisionId);
    }
  }
 
  return StatusCode::SUCCESS;
}

updateLegDecisionsMap()

void ComboHypoToolBase::updateLegDecisionsMap ( const std::vector< std::vector< Combo::LegDecision >> &  passing_comb, Combo::LegDecisionsMap &  passingLegs  ) const

protectedinherited

For when the tool accepts some/all combinations.

Remove Decision Objects from legs of this HypoTool's chain which participated in NONE of combinations which were flagged as accepting the event.

Definition at line 216 of file ComboHypoToolBase.cxx.

                                                                                                                                                {
  if (msgLvl(MSG::DEBUG)) {
    size_t count = 0;
    for (const std::vector<Combo::LegDecision>& comb : passingComb) {
      ATH_MSG_DEBUG("-- Passing combination " << count++ << " of " << passingComb.size());
      for (const auto& [id, EL] : comb) {
        ATH_MSG_DEBUG("-- -- " << HLT::Identifier(id) << " container:" << EL.dataID() << ", index:" << EL.index());
      }
    }
  }
 
  // remove combinations that didn't pass from the final map passingLegs
  for (auto& it : passingLegs) {
    DecisionID legId = it.first;
    if (not(legId == m_decisionId or (isLegId(legId) and getIDFromLeg(legId) == m_decisionId))) {
      continue; // Some other chain, ignore it to get faster execution.
    } 
    std::vector<ElementLink<DecisionContainer>> updatedDecisionObjectsOnLeg;
    bool update = false;
    // Loop over all passing combinations, and all Decision Objects in each passing combination. Find Decision Objects on this leg.
    for (const std::vector<Combo::LegDecision>& comb : passingComb) {
      for (const auto& [id, EL] : comb) {
        // Check that this Decision Object is on the correct leg, and that we haven't collated it already from another combination.
        if (id == legId and std::find(updatedDecisionObjectsOnLeg.begin(), updatedDecisionObjectsOnLeg.end(), EL) == updatedDecisionObjectsOnLeg.end()) {
          ATH_MSG_VERBOSE("Keeping on leg " << HLT::Identifier(id) << " the Decision Object container:" << EL.dataID() << ", index:" << EL.index());
          updatedDecisionObjectsOnLeg.push_back(EL);
          update = true;
        }
      }
    }
    // only update those concerning this tool ID
    if (update){ 
      it.second = updatedDecisionObjectsOnLeg;
    }
  }
}

Member Data Documentation

m_combinationsThresholdBreak

Gaudi::Property<size_t> ComboHypoToolBase::m_combinationsThresholdBreak

protectedinherited

Initial value:

{this, "CombinationsThresholdBreak", 10000,
    "Events processing this many combinations will generate a second WARNING message, and the loop over combinations will be terminated at this point."}

Definition at line 109 of file ComboHypoToolBase.h.

m_combinationsThresholdWarn

Gaudi::Property<size_t> ComboHypoToolBase::m_combinationsThresholdWarn

protectedinherited

Initial value:

{this, "CombinationsThresholdWarn", 1000,
    "Events processing this many combinations will generate a WARNING message."}

Definition at line 106 of file ComboHypoToolBase.h.

m_decisionId

HLT::Identifier ComboHypoToolBase::m_decisionId

privateinherited

The DecisionID of the chain, obtained from the Tool's name.

Definition at line 122 of file ComboHypoToolBase.h.

m_enableOverride

Gaudi::Property<bool> ComboHypoToolBase::m_enableOverride

protectedinherited

Initial value:

{this, "EnableOverride", false,
    "Stops processing combinations as soon as a valid combination is found in OR mode, or as soon as an invalid combination is found in AND mode. This is to save CPU."}

Definition at line 115 of file ComboHypoToolBase.h.

m_legDecisionIds

std::vector<HLT::Identifier> ComboHypoToolBase::m_legDecisionIds

privateinherited

The DecisionIDs of the individual legs, derived from both m_decisionId and m_legMultiplicities.

Definition at line 123 of file ComboHypoToolBase.h.

m_legMultiplicities

std::vector<int> ComboHypoToolBase::m_legMultiplicities

privateinherited

The number of legs, and the required multiplicity on each leg.

Definition at line 124 of file ComboHypoToolBase.h.

m_maxjets

Gaudi::Property<unsigned int> DisplacedJetRankComboHypoTool::m_maxjets {this, "max_jets",{0}, "Maximum number of jets allowed in the event"}

private

Definition at line 18 of file DisplacedJetRankComboHypoTool.h.

m_modeOR

Gaudi::Property<bool> ComboHypoToolBase::m_modeOR

protectedinherited

Initial value:

{this, "ModeOR", true,
    "Accepts based on the logical OR over all calls to executeAlg. If this flag is set to false then the logical AND is required instead."}

Definition at line 112 of file ComboHypoToolBase.h.

m_rankcut

Gaudi::Property<unsigned int> DisplacedJetRankComboHypoTool::m_rankcut {this, "max_jet_rank",{2}, "Maximum jet rank which will be processed, counts from 0"}

private

Definition at line 17 of file DisplacedJetRankComboHypoTool.h.

---

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

• DisplacedJetRankComboHypoTool.h
• DisplacedJetRankComboHypoTool.cxx