TrigMultiTrkComboHypo Class Reference

#include <TrigMultiTrkComboHypo.h>

Inheritance diagram for TrigMultiTrkComboHypo:

Collaboration diagram for TrigMultiTrkComboHypo:

Public Member Functions
	TrigMultiTrkComboHypo (const std::string &name, ISvcLocator *pSvcLocator)
	TrigMultiTrkComboHypo ()=delete
virtual StatusCode	initialize () override
virtual StatusCode	execute (const EventContext &context) const override
template<typename T>
StatusCode	mergeLeptonsFromDecisions (TrigMultiTrkState< T > &state) const
template<typename T>
StatusCode	findMultiLeptonCandidates (TrigMultiTrkState< T > &state) const
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
const SG::ReadHandleKeyArray< TrigCompositeUtils::DecisionContainer > &	decisionsInput () const
const SG::WriteHandleKeyArray< TrigCompositeUtils::DecisionContainer > &	decisionsOutput () const
const Combo::MultiplicityReqMap &	triggerMultiplicityMap () const
const Combo::LegMap &	legToInputCollectionMap () const
ToolHandleArray< ComboHypoToolBase > &	hypoTools ()
const ToolHandleArray< ComboHypoToolBase > &	hypoTools () const
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
StatusCode	mergeTracksFromViews (TrigMultiTrkStateBase &) const
	Go through state.previousDecisions() and fetch xAOD::TrackParticle objects associated with the nearest SG::View.
template<typename CONTAINER>
StatusCode	mergeTracksFromDecisions (TrigMultiTrkStateBase &) const
	Go through state.previousDecisions(), fetch xAOD::Muons/xAODElectron objects attached to decisions and save links to the their xAOD::TrackParticle objects in state.tracks().
template<typename CONTAINER>
StatusCode	mergeLeptonsFromDecisions (TrigMultiTrkState< CONTAINER > &) const
	Go through state.previousDecisions(), fetch xAOD::Muons/xAODElectron objects attached to decisions and save links to them in state.leptons().
template<typename CONTAINER>
StatusCode	findMultiLeptonCandidates (TrigMultiTrkState< CONTAINER > &) const
	Make all possible combinations from state.leptons(), fit tracks to the common vertex, create xAOD::TrigBphys objects and put them into state.trigBphysCollection()
StatusCode	filterTrackCombinations (TrigMultiTrkStateBase &) const
	Make all possible combinations from state.tracks(), fit tracks to the common vertex and set state.isEventAccepted to true if at least one good combination is found; no xAOD::TrigBphys objects will be created.
StatusCode	processMergedElectrons (TrigMultiTrkState< xAOD::ElectronContainer > &) const
	Make all possible combinations from electrons originating from the same BPH-0DR3-EM7J15 cluster, only one track should pass e5_lhvloose requirements; initialRoI word will be saved into xAOD::TrigBphys objects.
StatusCode	findMuTrkCandidates (TrigMultiTrkState< xAOD::MuonContainer > &) const
	Build J/psi candidates from muon from SG::View and tracks from the same SG::View, to be used for Tag-and-Probe PEB chains (similar to HLT_mu6_bJpsimutrk_MuonTrkPEB_L1MU5VF)
StatusCode	copyDecisionObjects (TrigMultiTrkStateBase &) const
	All appropriate decisions from state.previousDecisions() will be copied to state.decisions() if flag state.isEventAccepted() is set by filterTrackCombinations() method; to be used only in Streamer mode.
StatusCode	copyAdditionalDecisionObjects (TrigMultiTrkStateBase &) const
	For chains from CombinedSlice (similar to 'HLT_e9_lhvloose_e5_lhvloose_bBeeM6000_mu4_L1BPH-0M9-EM7-EM5_MU6') we have decisionsInput().size() > 1, so that we should copy decisions created by EmptySteps from muon part.
StatusCode	createDecisionObjects (TrigMultiTrkStateBase &) const
	Create a decision for each xAOD::TrigBphys object from state.trigBphysCollection() and save it to state.decisions(); use hypoTools() to assign correct decisionIDs, not compatible with Streamer mode.
std::unique_ptr< xAOD::Vertex >	fit (const std::vector< ElementLink< xAOD::TrackParticleContainer > > &trackParticleLinks, const std::vector< double > &particleMasses, Trk::IVKalState &fitterState) const
	Perform a vertex fit on selected tracks.
xAOD::TrigBphys *	makeTrigBPhys (const xAOD::Vertex &vertex, const std::vector< double > &particleMasses, const xAOD::Vertex &beamSpot, const Trk::IVKalState &fitterState) const
	Construct the trigger object that may be stored for debugging or matching.
bool	isIdenticalTracks (const xAOD::TrackParticle *lhs, const xAOD::TrackParticle *rhs) const
	Attempts to identify identical tracks by selection on DeltaR.
bool	isIdenticalTracks (const xAOD::Muon *lhs, const xAOD::Muon *rhs) const
bool	isIdenticalTracks (const xAOD::Electron *lhs, const xAOD::Electron *rhs) const
bool	isInMassRange (double mass, size_t idx) const
bool	passedDeltaRcut (const std::vector< xAOD::TrackParticle::GenVecFourMom_t > &momenta) const
StatusCode	copyDecisions (const Combo::LegDecisionsMap &passingLegs, const EventContext &context) const
	iterates over the inputs and for every object (no filtering) crates output object linked to input moving the decisions that are mentioned in the passing set
StatusCode	extractFeatureAndRoI (const HLT::Identifier &chainLegId, const ElementLink< TrigCompositeUtils::DecisionContainer > &EL, SG::sgkey_t &featureKey, TrigCompositeUtils::Decision::index_type &featureIndex, SG::sgkey_t &roiKey, TrigCompositeUtils::Decision::index_type &roiIndex, bool &roiFullscan, bool &objectRequestsNoMultiplicityCheck, SG::SGKeyMap< std::set< uint32_t > > &priorFeaturesMap) const
	For a given Decision node from a HypoAlg, extracts type-less identification data on the node's Feature and seeding ROI.
StatusCode	fillDecisionsMap (Combo::LegDecisionsMap &dmap, const EventContext &context) const
	iterates over all inputs, associating inputs to legs
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
SG::ReadHandleKey< xAOD::TrackParticleContainer >	m_trackParticleContainerKey {this, "TrackCollectionKey", "Tracks", "input TrackParticle container name"}
SG::WriteHandleKey< xAOD::TrigBphysContainer >	m_trigBphysContainerKey {this, "TrigBphysCollectionKey", "TrigBphysContainer", "output TrigBphysContainer name"}
SG::ReadCondHandleKey< InDet::BeamSpotData >	m_beamSpotKey {this, "BeamSpotKey", "BeamSpotData", "SG key for beam spot"}
Gaudi::Property< std::vector< unsigned int > >	m_nTrk
Gaudi::Property< std::vector< int > >	m_nTrkCharge
Gaudi::Property< std::vector< std::vector< double > > >	m_trkMass
Gaudi::Property< std::vector< std::vector< double > > >	m_trkPt
Gaudi::Property< std::vector< std::pair< double, double > > >	m_massRange
Gaudi::Property< bool >	m_applyOverlapRemoval
Gaudi::Property< bool >	m_combineInputDecisionCollections
Gaudi::Property< bool >	m_useLeptonMomentum
Gaudi::Property< bool >	m_checkMultiplicity
Gaudi::Property< float >	m_deltaR
Gaudi::Property< float >	m_deltaRMax
Gaudi::Property< float >	m_deltaRMin
Gaudi::Property< float >	m_chi2
Gaudi::Property< bool >	m_isStreamer
Gaudi::Property< bool >	m_isMuTrkMode
Gaudi::Property< bool >	m_doElectrons
Gaudi::Property< std::string >	m_trigLevel
Gaudi::Property< std::vector< std::string > >	m_mergedElectronChains
Gaudi::Property< double >	m_caloClusterEtThreshold
ToolHandle< InDet::VertexPointEstimator >	m_vertexPointEstimator {this, "VertexPointEstimator", "", "tool to find starting point for the vertex fitter"}
ToolHandle< Trk::TrkVKalVrtFitter >	m_vertexFitter {this, "VertexFitter", "", "VKalVrtFitter tool to fit tracks into the common vertex"}
ToolHandle< Trk::V0Tools >	m_v0Tools {this, "V0Tools", "", "tool to calculate Lxy/LxyError of dimuon candidate wrt beam spot"}
ToolHandle< GenericMonitoringTool >	m_monTool {this, "MonTool", "", "monitoring tool"}
TrigCompositeUtils::DecisionIDContainer	m_allowedIDs
TrigCompositeUtils::DecisionIDContainer	m_resolvedElectronIDs
TrigCompositeUtils::DecisionIDContainer	m_mergedElectronIDs
double	m_trkPtMin = 0.0
SG::ReadHandleKeyArray< TrigCompositeUtils::DecisionContainer >	m_inputs { this, "HypoInputDecisions", {}, "Input Decisions" }
SG::WriteHandleKeyArray< TrigCompositeUtils::DecisionContainer >	m_outputs { this, "HypoOutputDecisions", {}, "Output Decisions" }
Gaudi::Property< bool >	m_requireUniqueROI
Gaudi::Property< Combo::MultiplicityReqMap >	m_multiplicitiesReqMap
Gaudi::Property< Combo::LegMap >	m_legToInputCollectionMap
Gaudi::Property< bool >	m_checkMultiplicityMap
ToolHandleArray< ComboHypoToolBase >	m_hypoTools {this, "ComboHypoTools", {}, "Tools to perform selection"}
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 138 of file TrigMultiTrkComboHypo.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

TrigMultiTrkComboHypo() [1/2]

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

Definition at line 67 of file TrigMultiTrkComboHypo.cxx.

    : ::ComboHypo(name, pSvcLocator) {}

TrigMultiTrkComboHypo() [2/2]

TrigMultiTrkComboHypo::TrigMultiTrkComboHypo ( )

delete

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

copyAdditionalDecisionObjects()

StatusCode TrigMultiTrkComboHypo::copyAdditionalDecisionObjects ( TrigMultiTrkStateBase & state ) const

private

For chains from CombinedSlice (similar to 'HLT_e9_lhvloose_e5_lhvloose_bBeeM6000_mu4_L1BPH-0M9-EM7-EM5_MU6') we have decisionsInput().size() > 1, so that we should copy decisions created by EmptySteps from muon part.

Definition at line 898 of file TrigMultiTrkComboHypo.cxx.

                                                                                                  {
 
  if (decisionsInput().size() > 1) {
    ATH_MSG_DEBUG( "Found more than one decision input key, decisionsInput().size = " << decisionsInput().size() );
    for (size_t i = 1; i < decisionsInput().size(); ++i) {
      ATH_MSG_DEBUG( "Copying decisions from " << decisionsInput().at(i).key() << " to " << decisionsOutput().at(i).key() );
      auto previousDecisionsHandle = SG::makeHandle(decisionsInput().at(i), state.context());
      CHECK( previousDecisionsHandle.isValid() );
      ATH_MSG_DEBUG( "Running with "<< previousDecisionsHandle->size() << " previous decisions" );
      SG::WriteHandle<DecisionContainer> outputDecisionsHandle = TrigCompositeUtils::createAndStore(decisionsOutput().at(i), state.context());
      for (const Decision* previousDecision : *previousDecisionsHandle) {
        if (!TrigCompositeUtils::isAnyIDPassing(previousDecision, m_allowedIDs)) continue;
 
        DecisionIDContainer previousDecisionIDs;
        TrigCompositeUtils::decisionIDs(previousDecision, previousDecisionIDs);
        DecisionIDContainer decisionIDs;
        std::set_intersection(previousDecisionIDs.begin(), previousDecisionIDs.end(), m_allowedIDs.begin(), m_allowedIDs.end(),
                              std::inserter(decisionIDs, decisionIDs.begin()));
 
        Decision* decision = TrigCompositeUtils::newDecisionIn(outputDecisionsHandle.ptr(), TrigCompositeUtils::comboHypoAlgNodeName());
        TrigCompositeUtils::linkToPrevious(decision, previousDecision, state.context());
        TrigCompositeUtils::insertDecisionIDs(decisionIDs, decision);
      }
    }
  }
  return StatusCode::SUCCESS;
}

copyDecisionObjects()

StatusCode TrigMultiTrkComboHypo::copyDecisionObjects ( TrigMultiTrkStateBase & state ) const

private

All appropriate decisions from state.previousDecisions() will be copied to state.decisions() if flag state.isEventAccepted() is set by filterTrackCombinations() method; to be used only in Streamer mode.

Definition at line 834 of file TrigMultiTrkComboHypo.cxx.

                                                                                        {
 
  if (state.isEventAccepted()) {
    ATH_MSG_DEBUG( "Copying decisions from " << decisionsInput().at(0).key() << " to " << decisionsOutput().at(0).key() );
    for (const Decision* previousDecision : state.previousDecisions()) {
      if (!TrigCompositeUtils::isAnyIDPassing(previousDecision, m_allowedIDs)) continue;
 
      DecisionIDContainer previousDecisionIDs;
      TrigCompositeUtils::decisionIDs(previousDecision, previousDecisionIDs);
      DecisionIDContainer decisionIDs;
      std::set_intersection(previousDecisionIDs.begin(), previousDecisionIDs.end(), m_allowedIDs.begin(), m_allowedIDs.end(),
                            std::inserter(decisionIDs, decisionIDs.begin()));
 
      Decision* decision = TrigCompositeUtils::newDecisionIn(&state.decisions(), TrigCompositeUtils::comboHypoAlgNodeName());
      TrigCompositeUtils::linkToPrevious(decision, previousDecision, state.context());
      TrigCompositeUtils::insertDecisionIDs(decisionIDs, decision);
    }
 
    // copy additional decisions for combined chains, as 'HLT_e9_lhvloose_e5_lhvloose_bBeeM6000_mu4_L1BPH-0M9-EM7-EM5_MU6'
    if (!m_combineInputDecisionCollections) ATH_CHECK( copyAdditionalDecisionObjects(state) );
  }
  return StatusCode::SUCCESS;
}

copyDecisions()

StatusCode ComboHypo::copyDecisions ( const Combo::LegDecisionsMap & passingLegs, const EventContext & context ) const

privateinherited

iterates over the inputs and for every object (no filtering) crates output object linked to input moving the decisions that are mentioned in the passing set

Definition at line 86 of file ComboHypo.cxx.

                                                                                                                 {
 DecisionIDContainer passing;
  for (auto const& element : passingLegs) {
    passing.insert(element.first);
  }
  
  ATH_MSG_DEBUG( "Copying "<<passing.size()<<" positive decision IDs to outputs");
 
  for ( size_t input_counter = 0; input_counter < m_inputs.size(); ++input_counter ) {
    // new output decisions
    SG::WriteHandle<DecisionContainer> outputHandle = createAndStore(m_outputs.at(input_counter), context ); 
    auto outDecisions = outputHandle.ptr();    
    auto inputHandle = SG::makeHandle( m_inputs.at(input_counter), context );
    if ( inputHandle.isValid() ) {
 
      for (const Decision* inputDecision : *inputHandle) {
        auto thisEL = TrigCompositeUtils::decisionToElementLink(inputDecision, context);
 
        // from all positive decision in the input only the ones that survived counting are passed over
        const DecisionIDContainer& common = passedDecisionIDs(inputDecision, passing);
 
        // check if this EL is in the combination map for the passing decIDs:
        ATH_MSG_DEBUG("Searching this element in the map: ("<<thisEL.dataID() << " , " << thisEL.index()<<")");
        DecisionIDContainer finalIds;   
        for (const DecisionID c : common){
          const HLT::Identifier cID = HLT::Identifier(c);
          // add the decID only if this candidate passed the combination selection
          const std::vector<ElementLink<DecisionContainer>>& Comb=passingLegs.at(c);
          if(std::find(Comb.begin(), Comb.end(), thisEL) == Comb.end()) {
            continue;
          }
          ATH_MSG_DEBUG("  Adding "<< cID <<" because EL is found in the passingLegs map");
          finalIds.insert( cID.numeric() ); // all Ids used by the Filter, including legs
          if (TrigCompositeUtils::isLegId ( cID )){
            const HLT::Identifier mainChain = TrigCompositeUtils::getIDFromLeg( cID );
            finalIds.insert( mainChain.numeric() );
            ATH_MSG_DEBUG("  Adding "<< mainChain <<" consequently");
          }
        }
 
        Decision* newDec = newDecisionIn( outDecisions, inputDecision, comboHypoAlgNodeName(), context );
        ATH_MSG_DEBUG("New decision (Container Index:" << input_counter << ", Element Index:"<< newDec->index() <<") has "
          << (TrigCompositeUtils::findLink<TrigRoiDescriptorCollection>(newDec, initialRoIString())).isValid()
          << " valid initialRoI, "<< TrigCompositeUtils::getLinkToPrevious(newDec).size() <<" previous decisions and "<<finalIds.size()<<" decision IDs") ;   
        insertDecisionIDs( finalIds, newDec );
 
      }
    }
 
    if (msgLvl(MSG::DEBUG)) {
      ATH_MSG_DEBUG("Output Handle " << m_outputs.at(input_counter).key() << " with " << outputHandle->size() <<" Decision objects");
      for (const Decision* d : *outputHandle){
        DecisionIDContainer objDecisions;      
        decisionIDs( d, objDecisions );
        ATH_MSG_DEBUG("  Decision object #" << d->index() << " with " << objDecisions.size()<<" positive decision IDs");
        for (const TrigCompositeUtils::DecisionID id : objDecisions ) {
          ATH_MSG_DEBUG("   --- Passes: " << HLT::Identifier( id ));
        }  
      }
    }
  }
 
  return StatusCode::SUCCESS;
}

createDecisionObjects()

StatusCode TrigMultiTrkComboHypo::createDecisionObjects ( TrigMultiTrkStateBase & state ) const

private

Create a decision for each xAOD::TrigBphys object from state.trigBphysCollection() and save it to state.decisions(); use hypoTools() to assign correct decisionIDs, not compatible with Streamer mode.

Definition at line 859 of file TrigMultiTrkComboHypo.cxx.

                                                                                          {
 
  size_t idx = 0;
  for (const xAOD::TrigBphys* triggerObject : state.trigBphysCollection()) {
    ATH_MSG_DEBUG( "Found xAOD::TrigBphys: mass / chi2 = " << triggerObject->mass() << " / " << triggerObject->fitchi2() );
 
    auto triggerObjectEL = ElementLink<xAOD::TrigBphysContainer>(state.trigBphysCollection(), triggerObject->index());
    ATH_CHECK( triggerObjectEL.isValid() );
 
    // create a new output Decision object, backed by the 'decisions' container.
    Decision* decision = TrigCompositeUtils::newDecisionIn(&state.decisions(), TrigCompositeUtils::comboHypoAlgNodeName());
 
    std::vector<const DecisionIDContainer*> previousDecisionIDs;
    for (const size_t& i : state.getTrigBphysLegIndices(idx)) {
 
      // attach all previous decisions: if the same previous decision is called twice, that's fine - internally takes care of that
      // we already have an array of links to the previous decisions, so there is no need to use TrigCompositeUtils::linkToPrevious()
      decision->addObjectCollectionLinks(TrigCompositeUtils::seedString(), state.getDecisionLinks(i));
      previousDecisionIDs.push_back(&state.getDecisionIDs(i));
    }
 
    // set mandatory feature ElementLink to xAOD::TrigBphys object
    decision->setObjectLink<xAOD::TrigBphysContainer>(TrigCompositeUtils::featureString(), triggerObjectEL);
    decision->setDetail<int32_t>("noCombo", 1);
 
    for (const auto& tool : hypoTools()) {
      ATH_MSG_DEBUG( "Go to " << tool );
      if (!m_checkMultiplicity || state.checkMultiplicity(tool->legMultiplicity(), tool->legDecisionIds())) ATH_CHECK( tool->decideOnSingleObject(decision, previousDecisionIDs) );
    }
    ++idx;
  }
 
  // copy additional decisions from Empty muon step for Combined chains, as 'HLT_e9_lhvloose_e5_lhvloose_bBeeM6000_mu4_L1BPH-0M9-EM7-EM5_MU6'
  ATH_CHECK( copyAdditionalDecisionObjects(state) );
 
  return StatusCode::SUCCESS;
}

decisionsInput()

const SG::ReadHandleKeyArray< TrigCompositeUtils::DecisionContainer > & ComboHypo::decisionsInput ( ) const

inlineprotectedinherited

Definition at line 41 of file ComboHypo.h.

{ return m_inputs; }

decisionsOutput()

const SG::WriteHandleKeyArray< TrigCompositeUtils::DecisionContainer > & ComboHypo::decisionsOutput ( ) const

inlineprotectedinherited

Definition at line 42 of file ComboHypo.h.

{ return m_outputs; }

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 TrigMultiTrkComboHypo::execute ( const EventContext & context ) const

overridevirtual

Reimplemented from ComboHypo.

Definition at line 210 of file TrigMultiTrkComboHypo.cxx.

                                                                           {
 
  ATH_MSG_DEBUG( "TrigMultiTrkHypo::execute() starts" );
 
  ATH_MSG_DEBUG( "decision input key: " << decisionsInput().at(0).key() );
  auto previousDecisionsHandle = SG::makeHandle(decisionsInput().at(0), context);
  CHECK( previousDecisionsHandle.isValid() );
  ATH_MSG_DEBUG( "Running with "<< previousDecisionsHandle->size() << " previous decisions" );
 
  SG::WriteHandle<DecisionContainer> outputDecisionsHandle = TrigCompositeUtils::createAndStore(decisionsOutput().at(0), context);
 
  const InDet::BeamSpotData* beamSpotData = nullptr;
  if (!m_isStreamer) {
    SG::ReadCondHandle<InDet::BeamSpotData> beamSpotHandle {m_beamSpotKey, context};
    ATH_CHECK( beamSpotHandle.isValid() );
    beamSpotData = *beamSpotHandle;
  }
 
  std::unique_ptr<TrigMultiTrkState<xAOD::MuonContainer>> muonState;
  std::unique_ptr<TrigMultiTrkState<xAOD::ElectronContainer>> electronState;
  TrigMultiTrkStateBase* commonState = nullptr;
  if (m_doElectrons) {
    electronState = std::make_unique<TrigMultiTrkState<xAOD::ElectronContainer>>(context, *previousDecisionsHandle, *outputDecisionsHandle, nullptr, beamSpotData);
    commonState = electronState.get();
  }
  else {
    muonState = std::make_unique<TrigMultiTrkState<xAOD::MuonContainer>>(context, *previousDecisionsHandle, *outputDecisionsHandle, nullptr, beamSpotData);
    commonState = muonState.get();
  }
 
  if (m_isStreamer) {
    if (m_trigLevel == "L2") {
      ATH_CHECK( mergeTracksFromViews(*commonState) );
    }
    else if (m_trigLevel == "L2IO" || m_trigLevel == "L2MT") {
      ATH_CHECK( mergeTracksFromDecisions<xAOD::L2CombinedMuonContainer>(*commonState) );
    }
    else if (m_trigLevel == "EF") {
      ATH_CHECK( (m_doElectrons ? mergeTracksFromDecisions<xAOD::ElectronContainer>(*commonState) : mergeTracksFromDecisions<xAOD::MuonContainer>(*commonState)) );
    }
    ATH_CHECK( filterTrackCombinations(*commonState) );
    ATH_CHECK( copyDecisionObjects(*commonState) );
  }
  else {
    auto trigBphysHandle = SG::makeHandle(m_trigBphysContainerKey, context);
    ATH_CHECK( trigBphysHandle.record(std::make_unique<xAOD::TrigBphysContainer>(),
                                      std::make_unique<xAOD::TrigBphysAuxContainer>()) );
    commonState->setTrigBphysCollection(trigBphysHandle.ptr());
 
    if (m_doElectrons) {
      ATH_CHECK( mergeLeptonsFromDecisions(*electronState) );
      ATH_CHECK( findMultiLeptonCandidates(*electronState) );
      ATH_CHECK( processMergedElectrons(*electronState) );
    }
    else if (m_isMuTrkMode) {
      ATH_CHECK( findMuTrkCandidates(*muonState) );
    }
    else {
      ATH_CHECK( mergeLeptonsFromDecisions(*muonState) );
      ATH_CHECK( findMultiLeptonCandidates(*muonState) );
    }
    ATH_CHECK( createDecisionObjects(*commonState) );
  }
 
  ATH_MSG_DEBUG( "TrigMultiTrkHypo::execute() terminates with StatusCode::SUCCESS" );
  return StatusCode::SUCCESS;
}

extractFeatureAndRoI()

StatusCode ComboHypo::extractFeatureAndRoI ( const HLT::Identifier & chainLegId, const ElementLink< TrigCompositeUtils::DecisionContainer > & EL, SG::sgkey_t & featureKey, TrigCompositeUtils::Decision::index_type & featureIndex, SG::sgkey_t & roiKey, TrigCompositeUtils::Decision::index_type & roiIndex, bool & roiFullscan, bool & objectRequestsNoMultiplicityCheck, SG::SGKeyMap< std::set< uint32_t > > & priorFeaturesMap ) const

privateinherited

For a given Decision node from a HypoAlg, extracts type-less identification data on the node's Feature and seeding ROI.

Parameters

[in]	chainLegId	The HLT::Identifer of the chain (leg) we're extracting features for.
[in]	EL	The Decision node from the HypoAlg, expected to have a "feature" link attached to it. Expected to be able to locate a "initialRoI" in its history if RequireUniqueROI=True.
[out]	featureKey	Type-less SG Key hash of the collection hosting the Decision node's feature .
[out]	featureIndex	Index inside the featureKey collection.
[out]	roiKey	Type-less SG Key hash of the collection hosting the Decision node's initial ROI collection.
[out]	roiIndex	Index inside the roiKey collection.
[out]	roiIsFullscan	Flag indicating if the located initial ROI has the FullScan flag enabled. Triggers special behaviour allowing the ROI to satisfy arbitrary multiplicities in an arbitrary number of legs.
[out]	objectRequestsNoMultiplicityCheck	Flag indicating of the DecisionObject requested not be included in the multiplicity computation. Triggers special behaviour allowing the DecisionObject to satisfy arbitrary multiplicities in an arbitrary number of legs.
[in,out]	priorFeaturesMap	Data structure collating for a given feature (key) what the prior features were integrated over all previous steps (value set).

Definition at line 378 of file ComboHypo.cxx.

{
  // Return collections for the findLinks call. 
  // While we will be focusing on the most recent feature, for tag-and-probe we need to keep a record of the features from the prior steps too.
 
  // Construct a sub-graph following just this leg back through the nav
  DecisionIDContainer chainLegIdSet = {chainLegId.numeric()};
  TrigCompositeUtils::NavGraph subGraph;
  recursiveGetDecisions((*dEL), subGraph, chainLegIdSet, /*enforceDecisionOnStartNode =*/ true);
 
  if (subGraph.finalNodes().size() != 1) {
    ATH_MSG_ERROR("We are only expecting to search from a single navigation node in extractFeatureAndRoI");
    return StatusCode::FAILURE;
  }
  const NavGraphNode* start = *(subGraph.finalNodes().begin());
 
  std::vector<SG::sgkey_t> keys;
  std::vector<uint32_t> clids; // We don't care about the class ID. This part gets ignored.
  std::vector<Decision::index_type> indicies;
  std::vector<const Decision*> sources;
 
  std::set<const Decision*> fullyExploredFrom; // This is a cache which typelessFindLinks will use to avoid re-visiting already explored regions of the graph
  // Note: This call to typelessFindLinks is exploring from a NavGraphNode* rather than a Decision*,
  // this indicates that the search is restricted to a sub-graph (specifically, only following one chain-leg)
  const bool foundFeature = typelessFindLinks(start, featureString(), keys, clids, indicies, sources, TrigDefs::allFeaturesOfType, &fullyExploredFrom);
 
  const Decision* featureSource = nullptr;
  // The "most recent" feature (from the step just run) is the one we find first. Hence it's at index 0
  if (foundFeature) {
    featureKey = keys.at(0);
    featureIndex = indicies.at(0);
    featureSource = sources.at(0);
  }
 
  objectRequestsNoMultiplicityCheck = (featureSource and featureSource->hasDetail<int32_t>("noCombo") and featureSource->getDetail<int32_t>("noCombo") == 1);
 
  if (foundFeature and priorFeaturesMap.count(featureKey + featureIndex) == 0) {
    const std::string* key_str = evtStore()->keyToString(featureKey);
    ATH_MSG_DEBUG("Note: Will use feature hash " << featureKey + featureIndex << ", for " << (key_str ? *key_str : "UNKNOWN") << " index=" << featureIndex);
    // Use the deep-search data to look further back than .at(0)
    // Here's where we keep the record of the features in previous steps. Step ordering is unimportant, we can use a set.
    if (keys.size() > 1) {
      for (size_t i = 1; i < keys.size(); ++i) { // Skip the 1st entry, this will be equal to featureKey and featureIndex from typelessFindLink above.
        // featureKey + featureIndex should be considered as equivalent to a per-feature hash (featureKey is a real hash, featureIndex is an offset index)
        if (featureKey + featureIndex == keys.at(i) + indicies.at(i)) {
          continue; // Do not add the case where a feature is re-attached to more than one step.
        }
        priorFeaturesMap[featureKey + featureIndex].insert(keys.at(i) + indicies.at(i));
      }
    } else { // Exactly one feature. Make a note of this by inserting an empty set, such that we don't do this search again.
      priorFeaturesMap.insert( std::pair<uint32_t, std::set<uint32_t>>(featureKey + featureIndex, std::set<uint32_t>()) );
    }
  }
 
  // Try and get seeding ROI data too.
  uint32_t roiClid{0}; // Unused
  const Decision* roiSource{nullptr}; // Unused
  const bool foundROI = typelessFindLink(subGraph, initialRoIString(), roiKey, roiClid, roiIndex, roiSource);
  if (foundROI) {
    ElementLink<TrigRoiDescriptorCollection> roiEL(roiKey, roiIndex);
    ATH_CHECK( roiEL.isValid() );
    roiIsFullscan = (*(roiEL))->isFullscan();
    if (!foundFeature) {
      const std::string* roi_str = evtStore()->keyToString(roiKey);
      ATH_MSG_DEBUG("Note: Located fallback-ROI, if used this will have feature hash =" << roiKey + roiIndex << ", for " << (roi_str ? *roi_str : "UNKNOWN") << " index=" << roiIndex);
    }
  }
 
  if (!foundFeature && !foundROI) {
    ATH_MSG_WARNING("Did not find the feature or initialRoI for " << dEL.dataID() << " index " << dEL.index());
  }
 
  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();
}

fillDecisionsMap()

StatusCode ComboHypo::fillDecisionsMap ( Combo::LegDecisionsMap & dmap, const EventContext & context ) const

privateinherited

iterates over all inputs, associating inputs to legs

Definition at line 462 of file ComboHypo.cxx.

                                                                                                       {
  for ( size_t inputContainerIndex = 0; inputContainerIndex < m_inputs.size(); ++inputContainerIndex ) {   
    auto inputHandle = SG::makeHandle( m_inputs.at(inputContainerIndex), context );
    if ( !inputHandle.isValid() ) {
      ATH_MSG_ERROR( "No input ReadHandle from " << inputHandle.key() );
      return StatusCode::FAILURE;
    }
    ATH_MSG_DEBUG( "-- Found ReadHandle from " << inputHandle.key() <<" with "<< inputHandle->size() << " elements:"  );
    for ( const Decision* decision : *inputHandle ) {
      ATH_MSG_DEBUG( "-- -- Input Decision #"<< decision->index() <<" with "<< decisionIDs( decision ).size() << " active IDs. Populating the multiplicity map:" );
      for ( const DecisionID id: decisionIDs( decision ) ) {
 
        // Handles regular and multi-leg case
        const auto& [chainName, chainLeg] = getNameAndIndexFromLeg(HLT::Identifier(id).name());
 
        // We need to check if we are configured to accept DecisionObjects passing 'chainName' ...
        Combo::LegMap::const_iterator it = m_legToInputCollectionMap.find(chainName);
        if (it == m_legToInputCollectionMap.end()) {
          ATH_MSG_VERBOSE("-- -- -- Ignoring the DecsionID " << id << " on leg " << chainLeg << " as it does not correspond to any of the " << m_legToInputCollectionMap.size() << " chains this Alg is processing.");
          continue;
        }
 
        // ... and if so we need to further check that we are accepting passing IDs for chainLeg on the current inputContainerIndex
        const std::vector<int>& legToInputCollectionIndex = it->second;
        const size_t requiredInputContainerIndex = static_cast<size_t>(legToInputCollectionIndex.at(chainLeg));
        if (requiredInputContainerIndex != inputContainerIndex) {
          ATH_MSG_VERBOSE("-- -- -- Ignoring the DecisionID " << id << " on leg " << chainLeg << " as we are only permitted to accept passing objects on leg #" << chainLeg << " of " << chainName
            << " which come from input collection index " << requiredInputContainerIndex << " (which is " << m_inputs.at(requiredInputContainerIndex).key() << ")"
            << ". Not the current index " << inputContainerIndex << " (which is " << m_inputs.at(inputContainerIndex).key() << ")");    
          continue;
        }
 
        ATH_MSG_DEBUG( " ++++ " << HLT::Identifier( id ) );
        dmap[id].push_back( TrigCompositeUtils::decisionToElementLink(decision, context) );
      }
    }
  }
 
  if (msgLvl(MSG::DEBUG)){
    ATH_MSG_DEBUG( "Decision map filled :" );
    size_t legCount = 0;
    for (const auto& entry: dmap){
      ATH_MSG_DEBUG("leg ["<<legCount<<"]: ");
      const std::vector<ElementLink<DecisionContainer>>& decisions = entry.second;
      ATH_MSG_DEBUG(" ++++ " << HLT::Identifier( entry.first ) <<" Number Decisions: "<< decisions.size());
      for (const ElementLink<DecisionContainer>& d : decisions){
        ATH_MSG_DEBUG("     Decision: (ContainerKey:"<<d.dataID()<<", DecisionElementIndex:"<<d.index()<<")");
      }
      legCount++;
    }
  }
 
 
  return StatusCode::SUCCESS;
}

filterPassed()

virtual bool AthCommonReentrantAlgorithm< Gaudi::Algorithm >::filterPassed ( const EventContext & ctx ) const

inlinevirtualinherited

Definition at line 96 of file AthCommonReentrantAlgorithm.h.

                                                           {
    return execState( ctx ).filterPassed();
  }

filterTrackCombinations()

StatusCode TrigMultiTrkComboHypo::filterTrackCombinations ( TrigMultiTrkStateBase & state ) const

private

Make all possible combinations from state.tracks(), fit tracks to the common vertex and set state.isEventAccepted to true if at least one good combination is found; no xAOD::TrigBphys objects will be created.

Definition at line 492 of file TrigMultiTrkComboHypo.cxx.

                                                                                            {
 
  const auto& tracks = state.tracks();
  state.setEventAccepted(false);
 
  // monitored variables
  auto mon_nAcceptedTrk = Monitored::Scalar<int>("nAcceptedTrk", tracks.size());
  auto mon_nVertexFitterCalls = Monitored::Scalar<int>("nVertexFitterCalls", 0);
  auto mon_isEventAccepted = Monitored::Scalar<int>("acceptance", 0);
  auto mon_timer = Monitored::Timer( "TIME_all" );
 
  auto group = Monitored::Group(m_monTool,
    mon_nAcceptedTrk, mon_nVertexFitterCalls, mon_isEventAccepted,
    mon_timer);
 
  for (size_t iTrk = 0; iTrk < m_nTrk.size(); ++iTrk) {
    if (state.isEventAccepted()) break;
    size_t nTrk = m_nTrk[iTrk];
 
    if (tracks.size() < nTrk) {
      ATH_MSG_DEBUG( "Could not build a subset of " << nTrk << " tracks from collection which contains only " << tracks.size() << " objects" );
      continue;
    }
    ATH_MSG_DEBUG( "Consider combinations of " << nTrk << " tracks from collection which contains " << tracks.size() << " objects until find a good one" );
 
    std::vector<ElementLink<xAOD::TrackParticleContainer>> tracklist(nTrk);
    std::vector<xAOD::TrackParticle::GenVecFourMom_t> p(nTrk);
 
    // tracks from the current combination will have non-zero value against their position in the 'idx' vector
    // consider first nTrk tracks as an initial combination, then get the next one with std::prev_permutation()
    std::vector<char> idx(tracks.size(), 0);
    std::fill(idx.begin(), idx.begin() + nTrk, 1);
    do {
      // fill tracklist and momenta of tracks, also check that the track pT passes the threshold value
      bool isValidCombination = true;
      int totalCharge = 0;
      size_t j = 0;
      for (size_t i = 0; i < idx.size(); ++i) {
        if (!idx[i]) continue;
        const auto& trackEL = tracks[i];
        tracklist[j] = trackEL;
        const auto track = *trackEL;
        p[j] = track->genvecP4();
        p[j].SetM(m_trkMass[iTrk][j]);
        totalCharge += static_cast<int>(track->charge());
        if (p[j].Pt() < m_trkPt[iTrk][j]) {
          isValidCombination = false;
          break;
        }
        ++j;
      }
      if (!isValidCombination || (m_nTrkCharge[iTrk] >= 0 && totalCharge != m_nTrkCharge[iTrk]) || !passedDeltaRcut(p)) continue;
 
      if (msgLvl(MSG::DEBUG)) {
        ATH_MSG_DEBUG( "Dump found tracks before vertex fit: pT / eta / phi / charge" );
        for (size_t i = 0; i < tracklist.size(); ++i) {
          const auto track = *tracklist[i];
          ATH_MSG_DEBUG( "track " << i + 1 << ": " << p[i].Pt() << " / " << p[i].Eta() << " / " << p[i].Phi() << " / " << track->charge() );
        }
      }
 
      auto mass = (std::accumulate(p.begin(), p.end(), xAOD::TrackParticle::GenVecFourMom_t())).M();
      ATH_MSG_DEBUG( "invariant mass: " << mass );
 
      if (!isInMassRange(mass, iTrk)) continue;
 
      auto fitterState = m_vertexFitter->makeState(state.context());
      auto vertex = fit(tracklist, m_trkMass[iTrk], *fitterState);
      ++mon_nVertexFitterCalls;
      if (!vertex) continue;
 
      ATH_MSG_DEBUG( "Filter found a subset of tracks which passed the rough selection: stop looking for other combinations" );
      state.setEventAccepted(true);
      break;
 
    } while (prev_perm(idx));
  }
 
  if (!state.isEventAccepted()) {
    ATH_MSG_DEBUG( "Filter could not find a good subset of tracks" );
  }
 
  mon_isEventAccepted = state.isEventAccepted();
 
  return StatusCode::SUCCESS;
}

findMultiLeptonCandidates() [1/2]

template<typename CONTAINER>

StatusCode TrigMultiTrkComboHypo::findMultiLeptonCandidates ( TrigMultiTrkState< CONTAINER > & ) const

private

Make all possible combinations from state.leptons(), fit tracks to the common vertex, create xAOD::TrigBphys objects and put them into state.trigBphysCollection()

combination is a selection of items from a collection, such that the order of items does not matter leptons/tracks have already been sorted over pT, the algorithm will keep this order in created subsets of tracks, i.e. for nTrk = 2 combinations are [0, 1], [0, 2], ..., [1, 2], [1, 3], ... for nTrk = 3 combinations are [0, 1, 2], [0, 1, 3], ..., [0, 2, 3], [0, 2, 4], ..., [1, 2, 3], [1, 2, 4], ...

findMultiLeptonCandidates() [2/2]

template<typename T>

StatusCode TrigMultiTrkComboHypo::findMultiLeptonCandidates

(

TrigMultiTrkState< T > &

state

)

const

Definition at line 581 of file TrigMultiTrkComboHypo.cxx.

                                                                                             {
 
  state.trigBphysLegIndices().clear();
  const auto& leptons = state.leptons();
 
  // monitored variables
  auto mon_nAcceptedTrk = Monitored::Scalar<int>("nAcceptedTrk", leptons.size());
  auto mon_nCombination = Monitored::Scalar<int>("nCombination", 0);
  auto mon_nCombinationBeforeFit = Monitored::Scalar<int>("nCombinationBeforeFit", 0);
  auto mon_nBPhysObject = Monitored::Scalar<int>("nBPhysObject", 0);
 
  std::vector<float> trkMassBeforeFit;
  std::vector<float> bphysMass;
  std::vector<float> d0track1, d0track2;
  std::vector<float> pttrack1, pttrack2;
  std::vector<float> etatrack1, etatrack2;
  std::vector<int> bphysCharge;
  auto mon_trkMassBeforeFit = Monitored::Collection("trkMassBeforeFit", trkMassBeforeFit);
  auto mon_bphysChi2 = Monitored::Collection("bphysChi2", state.trigBphysCollection(), &xAOD::TrigBphys::fitchi2);
  auto mon_bphysLxy = Monitored::Collection("bphysLxy", state.trigBphysCollection(), &xAOD::TrigBphys::lxy);
  auto mon_bphysFitMass = Monitored::Collection("bphysFitMass", state.trigBphysCollection(), [](const xAOD::TrigBphys* x){ return x->fitmass()*0.001; });
  auto mon_bphysMass = Monitored::Collection("bphysMass", bphysMass);
  auto mon_d0track1 = Monitored::Collection("bphysd0_trk1", d0track1);
  auto mon_d0track2 = Monitored::Collection("bphysd0_trk2", d0track2);
  auto mon_pttrack1 = Monitored::Collection("bphysPt_trk1", pttrack1);
  auto mon_pttrack2 = Monitored::Collection("bphysPt_trk2", pttrack2);
  auto mon_etatrack1 = Monitored::Collection("bphysEtatrack1", etatrack1);
  auto mon_etatrack2 = Monitored::Collection("bphysEtatrack2", etatrack2);
  auto mon_bphysCharge = Monitored::Collection("bphysCharge", bphysCharge);
 
  auto mon_timer = Monitored::Timer( "TIME_all" );
 
  auto group = Monitored::Group(m_monTool,
    mon_nAcceptedTrk, mon_nCombination, mon_nCombinationBeforeFit, mon_nBPhysObject,
    mon_trkMassBeforeFit, mon_bphysChi2, mon_bphysLxy, mon_bphysFitMass, mon_bphysMass, mon_bphysCharge, mon_d0track1, mon_d0track2,
    mon_timer, mon_pttrack1, mon_pttrack2, mon_etatrack1, mon_etatrack2);
 
  for (size_t iTrk = 0; iTrk < m_nTrk.size(); ++iTrk) {
    size_t nTrk = m_nTrk[iTrk];
 
    if (leptons.size() < nTrk) {
      ATH_MSG_DEBUG( "Could not build a subset of " << nTrk << " legs from collection which contains only " << leptons.size() << " objects" );
      continue;
    }
    ATH_MSG_DEBUG( "Consider all combinations of " << nTrk << " legs from collection which contains " << leptons.size() << " objects" );
 
    std::vector<size_t> leptonIndices(nTrk);
    std::vector<ElementLink<xAOD::TrackParticleContainer>> tracklist(nTrk);
    std::vector<xAOD::TrackParticle::GenVecFourMom_t> p(nTrk);
 
    std::vector<char> combination(leptons.size(), 0);
    std::fill(combination.begin(), combination.begin() + nTrk, 1);
    do {
      // fill tracklist and momenta of muons in the current subset
      bool isValidCombination = true;
      int charge = 0;
      size_t j = 0;
      for (size_t i = 0; i < combination.size(); ++i) {
        if (!combination[i]) continue;
        leptonIndices[j] = i;
        auto leg = *leptons[i].link;
        charge += static_cast<int>(lround(leg->charge()));
        ElementLink<xAOD::TrackParticleContainer> trackEL;
        if constexpr(std::is_same<T, xAOD::MuonContainer>::value) {
          trackEL = leg->inDetTrackParticleLink();
        }
        else {
          trackEL = leg->trackParticleLink();
        }
        tracklist[j] = trackEL;
        if (m_useLeptonMomentum) {
          p[j] = leg->genvecP4();
          p[j].SetM(0.);  // to keep consistency with TrigComboHypoTool::compute()
        }
        else {
          p[j] = (*trackEL)->genvecP4();
          p[j].SetM(m_trkMass[iTrk][j]);
        }
        if (p[j].Pt() < m_trkPt[iTrk][j]) {
          isValidCombination = false;
          break;
        }
        ++j;
      }
      if (!isValidCombination || (m_nTrkCharge[iTrk] >= 0 && charge != m_nTrkCharge[iTrk]) || !passedDeltaRcut(p)) continue;
 
      if (msgLvl(MSG::DEBUG)) {
        ATH_MSG_DEBUG( "Dump found leptons before vertex fit: pT / eta / phi / charge" );
        for (size_t i = 0; i < tracklist.size(); ++i) {
          const auto track = *tracklist[i];
          ATH_MSG_DEBUG( "legs " << i + 1 << ": " << p[i].Pt() << " / " << p[i].Eta() << " / " << p[i].Phi() << " / " << track->charge() );
        }
      }
 
      auto mass = (std::accumulate(p.begin(), p.end(), xAOD::TrackParticle::GenVecFourMom_t())).M();
      ATH_MSG_DEBUG( "invariant mass: " << mass );
 
      mon_nCombination++;
      trkMassBeforeFit.push_back(mass * 0.001);
      if (!isInMassRange(mass, iTrk)) continue;
 
      mon_nCombinationBeforeFit++;
      auto fitterState = m_vertexFitter->makeState(state.context());
      auto vertex = fit(tracklist, m_trkMass[iTrk], *fitterState);
      if (!vertex) continue;
      xAOD::TrigBphys* trigBphys = makeTrigBPhys(*vertex, m_trkMass[iTrk], state.beamSpot(), *fitterState);
      if (m_useLeptonMomentum) trigBphys->setMass(mass);
      state.addTrigBphysObject(trigBphys, leptonIndices);
 
      mon_nBPhysObject++;
      bphysMass.push_back(mass * 0.001);
      bphysCharge.push_back(charge);
      d0track1.push_back((*tracklist[0])->d0());
      d0track2.push_back((*tracklist[1])->d0());
      pttrack1.push_back((*tracklist[0])->pt() * 0.001);
      pttrack2.push_back((*tracklist[1])->pt() * 0.001);
      etatrack1.push_back((*tracklist[0])->eta());
      etatrack2.push_back((*tracklist[1])->eta());
 
    } while (prev_perm(combination));
  }
  return StatusCode::SUCCESS;
}

findMuTrkCandidates()

StatusCode TrigMultiTrkComboHypo::findMuTrkCandidates ( TrigMultiTrkState< xAOD::MuonContainer > & state ) const

private

Build J/psi candidates from muon from SG::View and tracks from the same SG::View, to be used for Tag-and-Probe PEB chains (similar to HLT_mu6_bJpsimutrk_MuonTrkPEB_L1MU5VF)

Definition at line 766 of file TrigMultiTrkComboHypo.cxx.

                                                                                                       {
 
  ATH_MSG_DEBUG( "Try to find muon + track combinations from the same SG::View" );
 
  auto& muons = state.leptons();
  muons.clear();
 
  const std::vector<double> particleMasses(2, PDG::mMuon);
 
  for (const Decision* decision : state.previousDecisions()) {
    if (!TrigCompositeUtils::isAnyIDPassing(decision, m_allowedIDs)) continue;
 
    auto decisionEL = TrigCompositeUtils::decisionToElementLink(decision, state.context());
    ATH_CHECK( decision->hasObjectLink(TrigCompositeUtils::featureString(), ClassID_traits<xAOD::MuonContainer>::ID()) );
    auto muonEL = decision->objectLink<xAOD::MuonContainer>(TrigCompositeUtils::featureString());
    const auto muon = *muonEL;
    if (!muon->trackParticle(xAOD::Muon::TrackParticleType::CombinedTrackParticle)) continue;
    if (!muon->trackParticle(xAOD::Muon::TrackParticleType::InnerDetectorTrackParticle)) continue;
    const auto muonInDetTrack = muon->trackParticle(xAOD::Muon::TrackParticleType::InnerDetectorTrackParticle);
    auto muonMomentum = muonInDetTrack->genvecP4();
    muonMomentum.SetM(PDG::mMuon);
 
    // add muon from decision to state.leptons
    DecisionIDContainer decisionIDs;
    TrigCompositeUtils::decisionIDs(decision, decisionIDs);
    muons.push_back({muonEL, std::vector<ElementLink<DecisionContainer>>(1, decisionEL), decisionIDs});
 
    ATH_MSG_DEBUG( "Found muon (CombinedTrackParticle): " << muon->pt() << " / " << muon->eta() << " / " << muon->phi() << " / " << muon->charge() );
 
    auto viewLinkInfo = TrigCompositeUtils::findLink<ViewContainer>(decision, TrigCompositeUtils::viewString(), true);
    ATH_CHECK( viewLinkInfo.isValid() );
    auto view = *viewLinkInfo.link;
 
    auto tracksHandle = ViewHelper::makeHandle(view, m_trackParticleContainerKey, state.context());
    ATH_CHECK( tracksHandle.isValid() );
    ATH_MSG_DEBUG( "Tracks container " << m_trackParticleContainerKey << " size: " << tracksHandle->size() );
 
    // try to fit muon and track into common vertex: first track is always muon, second tracks comes from the same SG::View
    std::vector<ElementLink<xAOD::TrackParticleContainer>> tracklist(2);
    tracklist[0] = muon->inDetTrackParticleLink();
    for (size_t idx = 0; idx < tracksHandle->size(); ++idx) {
      const xAOD::TrackParticle* track = tracksHandle->at(idx);
 
      if (track->pt() < m_trkPt[0][1] || isIdenticalTracks(track, muonInDetTrack)) continue;
      auto trackMomentum = track->genvecP4();
      trackMomentum.SetM(PDG::mMuon);
      if (!isInMassRange((muonMomentum + trackMomentum).M(), 0)) continue;
      if (m_nTrkCharge[0] >= 0 && muonInDetTrack->charge() * track->charge() > 0.) continue;
 
      tracklist[1] = ViewHelper::makeLink<xAOD::TrackParticleContainer>(view, tracksHandle, idx);
 
      ATH_MSG_DEBUG( "Dump found muon+track pair before vertex fit: pT / eta / phi / charge" << endmsg <<
                     "   muon:  " << muonMomentum.Pt() << " / " << muonMomentum.Eta() << " / " << muonMomentum.Phi() << " / " << muon->charge() << endmsg <<
                     "   track: " << trackMomentum.Pt() << " / " << trackMomentum.Eta() << " / " << trackMomentum.Phi() << " / " << track->charge() );
 
      auto fitterState = m_vertexFitter->makeState(state.context());
      auto vertex = fit(tracklist, particleMasses, *fitterState);
      if (!vertex) continue;
      xAOD::TrigBphys* trigBphys = makeTrigBPhys(*vertex, particleMasses, state.beamSpot(), *fitterState);
      // trigBphys->setRoiId(initialRoI->roiWord());
      state.addTrigBphysObject(trigBphys, std::vector<size_t>(1, muons.size() - 1));
    }
  }
 
  return StatusCode::SUCCESS;
}

fit()

std::unique_ptr< xAOD::Vertex > TrigMultiTrkComboHypo::fit ( const std::vector< ElementLink< xAOD::TrackParticleContainer > > & trackParticleLinks, const std::vector< double > & particleMasses, Trk::IVKalState & fitterState ) const

private

Perform a vertex fit on selected tracks.

Parameters

trackParticleLinks	the trackParticles to fit
trkMass	Track mass hypothesis for mass calculations
fitterState	The temporary state object

Returns

The fitted vertex - null if fit fails or is very low quality

Definition at line 927 of file TrigMultiTrkComboHypo.cxx.

                                      {
 
  ATH_MSG_DEBUG( "Perform vertex fit" );
  std::vector<const xAOD::TrackParticle*> tracklist(trackParticleLinks.size(), nullptr);
  std::transform(trackParticleLinks.begin(), trackParticleLinks.end(), tracklist.begin(),
                 [](const ElementLink<xAOD::TrackParticleContainer>& link){ return *link; });
 
  const Trk::Perigee& perigee1 = tracklist[0]->perigeeParameters();
  const Trk::Perigee& perigee2 = tracklist[1]->perigeeParameters();
  int flag = 0;
  int errorcode = 0;
  Amg::Vector3D startingPoint = m_vertexPointEstimator->getCirclesIntersectionPoint(&perigee1, &perigee2, flag, errorcode);
  if (errorcode != 0) startingPoint = Amg::Vector3D::Zero(3);
  ATH_MSG_DEBUG( "Starting point: (" << startingPoint(0) << ", " << startingPoint(1) << ", " << startingPoint(2) << ")" );
 
  m_vertexFitter->setMassInputParticles(particleMasses, fitterState);
  std::unique_ptr<xAOD::Vertex> vertex(m_vertexFitter->fit(tracklist, startingPoint, fitterState));
  if (!vertex) {
    ATH_MSG_DEBUG( "Vertex fit fails" );
    return vertex;
  }
  if (vertex->chiSquared() > m_chi2) {
    ATH_MSG_DEBUG( "Fit is successful, but vertex chi2 is too high, we are not going to save it (chi2 = " << vertex->chiSquared() << " > " << m_chi2.value() << ")" );
    vertex.reset();
    return vertex;
  }
  ATH_MSG_DEBUG( "Fit is successful" );
  vertex->clearTracks();
  vertex->setTrackParticleLinks(trackParticleLinks);
  return vertex;
}

hypoTools() [1/2]

ToolHandleArray< ComboHypoToolBase > & ComboHypo::hypoTools ( )

inlineprotectedinherited

Definition at line 45 of file ComboHypo.h.

{ return m_hypoTools; }

hypoTools() [2/2]

const ToolHandleArray< ComboHypoToolBase > & ComboHypo::hypoTools ( ) const

inlineprotectedinherited

Definition at line 46 of file ComboHypo.h.

{ return m_hypoTools; }

initialize()

StatusCode TrigMultiTrkComboHypo::initialize ( )

overridevirtual

Reimplemented from ComboHypo.

Definition at line 71 of file TrigMultiTrkComboHypo.cxx.

                                             {
  ATH_MSG_DEBUG( "TrigMultiTrkHypo::initialize()" );
 
  ATH_CHECK( ::ComboHypo::initialize() );
 
  // check consistency of the properties
  ATH_CHECK( !m_nTrk.empty() );
 
  if (m_nTrkCharge.empty()) {
    ATH_MSG_INFO( "totalCharge value is not specified, no charge selection for track combinations will be used" );
    m_nTrkCharge = std::vector<int>(m_nTrk.size(), -1);
  }
 
  if (m_trkMass.empty()) {
    ATH_MSG_INFO( "trackMasses value is not specified, muon/electron mass will be used" );
    for (const auto& n : m_nTrk) {
      m_trkMass.value().emplace_back(std::vector<double>(n, (m_doElectrons ? PDG::mElectron : PDG::mMuon)));
    }
  }
  if (m_trkPt.empty()) {
    ATH_MSG_INFO( "trackPtThresholds value is not specified" );
    for (const auto& n : m_nTrk) {
      m_trkPt.value().emplace_back(std::vector<double>(n, -100.));
    }
  }
  m_trkPtMin = m_trkPt[0].back();
  for (size_t i = 0; i < m_trkPt.size(); ++i) {
    m_trkPtMin = std::min(m_trkPtMin, m_trkPt[i].back());
  }
 
  ATH_CHECK( m_trkMass.size() == m_nTrk.size() );
  ATH_CHECK( m_trkPt.size() == m_nTrk.size() );
 
  for (size_t i = 0; i < m_nTrk.size(); ++i) {
    ATH_CHECK( m_trkMass[i].size() == m_nTrk[i] );
    ATH_CHECK( m_trkPt[i].size() == m_nTrk[i] );
    ATH_CHECK( std::is_sorted(m_trkPt[i].begin(), m_trkPt[i].end(), std::greater<>()) );
  }
 
  for (const auto& range : m_massRange.value()) {
    ATH_CHECK( range.first < range.second );
  }
 
  // dump numerical values
  if (msgLvl(MSG::DEBUG)) {
    for (size_t i = 0; i < m_nTrk.size(); ++i) {
      ATH_MSG_DEBUG( "vertex topology: nTrk = " << m_nTrk[i] );
      for (size_t j = 0; j < m_nTrk[i]; ++j) {
        ATH_MSG_DEBUG( "  " << j + 1 << "  trk: mass = " <<  m_trkMass[i][j] << ", Pt > " << m_trkPt[i][j] );
      }
    }
    msg() << MSG::DEBUG << "  mass range: {";
    for (const auto& range : m_massRange.value()) {
      msg() << MSG::DEBUG << " { " << range.first << ", " << range.second << " }";
    }
    msg() << MSG::DEBUG << " }" << std::endl;
  }
 
  if (m_isStreamer) {
    ATH_MSG_DEBUG( "Configured to run in a streamer mode: no trigger objects will be created" );
  }
  if (!m_isStreamer && m_trigLevel != "EF") {
    ATH_MSG_ERROR( "Could not create trigger objects from tracks or L2 CB muons, use the streamer mode for L2 step" );
    return StatusCode::FAILURE;
  }
 
  ATH_CHECK( !((m_trigLevel == "L2IO" || m_trigLevel == "L2MT") && m_doElectrons) );
 
  if (m_trigLevel == "L2" || (m_trigLevel == "EF" && m_isMuTrkMode)) {
    ATH_CHECK( m_trackParticleContainerKey.initialize() );
    renounce(m_trackParticleContainerKey);
  }
  else if (m_trigLevel == "L2IO" || m_trigLevel == "L2MT" || m_trigLevel == "EF") {
    ATH_CHECK( m_trackParticleContainerKey.initialize(false) );
  }
  else {
    ATH_MSG_ERROR( "trigLevel should be L2, L2IO, L2MT or EF, but " << m_trigLevel << " provided" );
    return StatusCode::FAILURE;
  }
 
  ATH_CHECK( m_trigBphysContainerKey.initialize(!m_isStreamer.value()) );
  ATH_CHECK( m_beamSpotKey.initialize(!m_isStreamer.value()) );  // need beamSpot only to create xAOD::TrigBphys object
 
  ATH_CHECK( m_vertexFitter.retrieve() );
  ATH_CHECK( m_vertexPointEstimator.retrieve() );
  ATH_CHECK( m_v0Tools.retrieve() );
 
  // allowed IDs to filter out incoming decisions at L2 level
  for (const auto& item : triggerMultiplicityMap()) {
    const HLT::Identifier id = HLT::Identifier(item.first);
    m_allowedIDs.insert(id.numeric());
    if (item.second.size() > 1) {
      for (size_t i = 0; i < item.second.size(); i++) {
        m_allowedIDs.insert(TrigCompositeUtils::createLegName(id, i).numeric());
      }
    }
  }
  if (msgLvl(MSG::DEBUG)) {
    ATH_MSG_DEBUG( "Allowed decisions:" );
    for (const DecisionID& id : m_allowedIDs) {
      ATH_MSG_DEBUG( " +++ " << HLT::Identifier(id) );
    }
  }
  if (m_doElectrons) {
    for (const DecisionID& id : m_allowedIDs) {
      std::string name = HLT::Identifier(id).name();
      bool isMergedElectronChain = false;
      for (size_t i = 0; i < m_mergedElectronChains.size(); ++i) {
        if (name.find(m_mergedElectronChains.value().at(i)) != std::string::npos) {
          isMergedElectronChain = true;
          break;
        }
      }
      (isMergedElectronChain ? m_mergedElectronIDs.insert(id) : m_resolvedElectronIDs.insert(id));
    }
    if (msgLvl(MSG::DEBUG)) {
      ATH_MSG_DEBUG( "Well-separated electron decisions:" );
      for (const DecisionID& id : m_resolvedElectronIDs) {
        ATH_MSG_DEBUG( " +++ " << HLT::Identifier(id) );
      }
      ATH_MSG_DEBUG( "Overlapping electron decisions:" );
      for (const DecisionID& id : m_mergedElectronIDs) {
        ATH_MSG_DEBUG( " +++ " << HLT::Identifier(id) );
      }
    }
  }
 
  if (!m_monTool.empty()) {
    ATH_CHECK( m_monTool.retrieve() );
    ATH_MSG_DEBUG( "GenericMonitoringTool name:" << m_monTool );
  }
  else {
    ATH_MSG_DEBUG( "No GenericMonitoringTool configured: no monitoring histograms will be available" );
  }
 
  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 HiveAlgBase, 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;
}

isIdenticalTracks() [1/3]

bool TrigMultiTrkComboHypo::isIdenticalTracks ( const xAOD::Electron * lhs, const xAOD::Electron * rhs ) const

private

Definition at line 1027 of file TrigMultiTrkComboHypo.cxx.

                                                                                                    {
 
  return isIdenticalTracks(*lhs->trackParticleLink(), *rhs->trackParticleLink());
}

isIdenticalTracks() [2/3]

bool TrigMultiTrkComboHypo::isIdenticalTracks ( const xAOD::Muon * lhs, const xAOD::Muon * rhs ) const

private

isIdenticalTracks() [3/3]

bool TrigMultiTrkComboHypo::isIdenticalTracks ( const xAOD::TrackParticle * lhs, const xAOD::TrackParticle * rhs ) const

private

Attempts to identify identical tracks by selection on DeltaR.

Returns

true if 'identical', false otherwise

Definition at line 1015 of file TrigMultiTrkComboHypo.cxx.

                                                                                                              {
 
  if (lhs->charge() * rhs->charge() < 0.) return false;
  return (ROOT::Math::VectorUtil::DeltaR(lhs->genvecP4(), rhs->genvecP4()) < m_deltaR);
}

isInMassRange()

bool TrigMultiTrkComboHypo::isInMassRange ( double mass, size_t idx ) const

private

Definition at line 1033 of file TrigMultiTrkComboHypo.cxx.

                                                                       {
 
  const auto& range = m_massRange[idx];
  return (mass > range.first && mass < range.second);
}

legToInputCollectionMap()

const Combo::LegMap & ComboHypo::legToInputCollectionMap ( ) const

inlineprotectedinherited

Definition at line 44 of file ComboHypo.h.

{ return m_legToInputCollectionMap.value(); }

makeTrigBPhys()

xAOD::TrigBphys * TrigMultiTrkComboHypo::makeTrigBPhys ( const xAOD::Vertex & vertex, const std::vector< double > & particleMasses, const xAOD::Vertex & beamSpot, const Trk::IVKalState & fitterState ) const

private

Construct the trigger object that may be stored for debugging or matching.

Parameters

vertex	Fitted Vertex object
particleMasses	Track mass hypothesis for mass calculations
beamSpot	The beamspot vertex
fitterState	Vertexer state object

Returns

Pointer to the TrigBphys object

Definition at line 963 of file TrigMultiTrkComboHypo.cxx.

                                            {
 
  double invariantMass = 0.;
  double invariantMassError = 0.;
  if (!m_vertexFitter->VKalGetMassError(invariantMass, invariantMassError, fitterState).isSuccess()) {
    ATH_MSG_DEBUG( "Warning from TrkVKalVrtFitter: can not calculate uncertainties" );
    invariantMass = -9999.;
  }
 
  xAOD::TrackParticle::GenVecFourMom_t momentum;
  for (size_t i = 0; i < vertex.nTrackParticles(); ++i) {
    auto p = vertex.trackParticle(i)->genvecP4();
    p.SetM(particleMasses[i]);
    momentum += p;
  }
 
  xAOD::TrigBphys* result = new xAOD::TrigBphys();
  result->makePrivateStore();
  result->initialise(0, momentum.Eta(), momentum.Phi(), momentum.Pt(), xAOD::TrigBphys::MULTIMU, momentum.M(), xAOD::TrigBphys::EF);
 
  if (m_doElectrons) result->setParticleType(xAOD::TrigBphys::JPSIEE);
  result->setFitmass(invariantMass);
  result->setFitchi2(vertex.chiSquared());
  result->setFitndof(vertex.numberDoF());
  result->setFitx(vertex.x());
  result->setFity(vertex.y());
  result->setFitz(vertex.z());
  result->setTrackParticleLinks(vertex.trackParticleLinks());
  result->setLxy(m_v0Tools->lxy(&vertex, &beamSpot));
  result->setLxyError(m_v0Tools->lxyError(&vertex, &beamSpot));
 
  ATH_MSG_DEBUG(
    "TrigBphys objects:\n\t  " <<
    "roiId:         " << result->roiId()  << "\n\t  " <<
    "particleType:  " << result->particleType() << "\n\t  " <<
    "level:         " << result->level() << "\n\t  " <<
    "eta:           " << result->eta() << "\n\t  " <<
    "phi:           " << result->phi() << "\n\t  " <<
    "mass:          " << result->mass() << "\n\t  " <<
    "fitmass:       " << result->fitmass() << "\n\t  " <<
    "chi2/NDF:      " << result->fitchi2() << " / " << result->fitndof() << "\n\t  " <<
    "vertex:        (" << result->fitx() << ", " << result->fity() << ", " << result->fitz() << ")\n\t  " <<
    "Lxy/LxyError:  " << result->lxy() << " / " << result->lxyError() );
 
  return result;
}

mergeLeptonsFromDecisions() [1/2]

template<typename CONTAINER>

StatusCode TrigMultiTrkComboHypo::mergeLeptonsFromDecisions ( TrigMultiTrkState< CONTAINER > & ) const

private

Go through state.previousDecisions(), fetch xAOD::Muons/xAODElectron objects attached to decisions and save links to them in state.leptons().

mergeLeptonsFromDecisions() [2/2]

template<typename T>

StatusCode TrigMultiTrkComboHypo::mergeLeptonsFromDecisions

(

TrigMultiTrkState< T > &

state

)

const

Definition at line 280 of file TrigMultiTrkComboHypo.cxx.

                                                                                             {
 
  auto& leptons = state.leptons();
  leptons.clear();
 
  std::vector<const Decision*> previousDecisions(state.previousDecisions().begin(), state.previousDecisions().end());
  std::map<const Decision*, int> decisionToInputCollectionIndexMap;
  for (const auto& decision : previousDecisions) decisionToInputCollectionIndexMap.emplace(decision, 0);
  if (m_combineInputDecisionCollections && decisionsInput().size() > 1) {
    for (size_t k = 1; k < decisionsInput().size(); ++k) {
      auto previousDecisionsHandle = SG::makeHandle(decisionsInput().at(k), state.context());
      CHECK( previousDecisionsHandle.isValid() );
      ATH_MSG_DEBUG( "Adding " << previousDecisionsHandle->size() << " decisions from " << decisionsInput().at(k).key() );
      for (const Decision* decision : *previousDecisionsHandle) {
        previousDecisions.push_back(decision);
        decisionToInputCollectionIndexMap.emplace(decision, static_cast<int>(k));
      }
    }
  }
 
  // all muons/electrons from views are already connected with previous decisions by TrigMuonEFHypoAlg
  for (const Decision* decision : previousDecisions) {
    if (!TrigCompositeUtils::isAnyIDPassing(decision, (m_doElectrons ? m_resolvedElectronIDs : m_allowedIDs))) continue;
 
    ElementLink<T> leptonEL;
    if (decision->hasObjectLink(TrigCompositeUtils::featureString(), ClassID_traits<T>::ID())) {
      leptonEL = decision->objectLink<T>(TrigCompositeUtils::featureString());
    }
    else {
      auto leptonLinkInfo = TrigCompositeUtils::findLink<T>(decision, TrigCompositeUtils::featureString(), true);
      ATH_CHECK( leptonLinkInfo.isValid() );
      leptonEL = leptonLinkInfo.link;
    }
 
    const auto lepton = *leptonEL;
    if constexpr(std::is_same<T, xAOD::MuonContainer>::value) {
      if (!lepton->trackParticle(xAOD::Muon::TrackParticleType::CombinedTrackParticle)) continue;
      if (!lepton->trackParticle(xAOD::Muon::TrackParticleType::InnerDetectorTrackParticle)) continue;
    }
    else if constexpr(std::is_same<T, xAOD::ElectronContainer>::value) {
      if (!lepton->trackParticle()) continue;
    }
    else {
      ATH_MSG_ERROR( "mergeLeptonsFromDecisions(): no scenario for the provided CONTAINER is specified" );
      return StatusCode::FAILURE;
    }
    auto decisionEL = TrigCompositeUtils::decisionToElementLink(decision, state.context());
 
    auto itr = leptons.end();
    if (m_applyOverlapRemoval) {
      itr = std::find_if(leptons.begin(), leptons.end(),
                         [this, lepton = lepton](const auto& x){ return this->isIdenticalTracks(lepton, *x.link); });
    }
    if (itr == leptons.end()) {
      leptons.push_back({leptonEL, std::vector<ElementLink<DecisionContainer>>(1, decisionEL), DecisionIDContainer()});
    }
    else {
      (*itr).decisionLinks.push_back(decisionEL);
    }
  }
 
  // muon->pt() is equal to muon->trackParticle(xAOD::Muon::TrackParticleType::CombinedTrackParticle)->pt()
  // and the later is used by TrigMuonEFHypoTool for classification of muEFCB candidates
  std::sort(leptons.begin(), leptons.end(), [](const auto& lhs, const auto& rhs){ return ((*lhs.link)->pt() > (*rhs.link)->pt()); });
 
  // for each muon we extract DecisionIDs stored in the associated Decision objects and copy them at muon.decisionIDs
  const auto& legToInputCollectionIndexMap = legToInputCollectionMap();
  for (auto& item : leptons) {
    for (const ElementLink<xAOD::TrigCompositeContainer>& decisionEL : item.decisionLinks) {
      if (m_combineInputDecisionCollections) {
        auto decisionIndex = decisionToInputCollectionIndexMap[*decisionEL];
        for (const auto& id : TrigCompositeUtils::decisionIDs(*decisionEL)) {
          if (!TrigCompositeUtils::passed(id, m_allowedIDs) || !TrigCompositeUtils::isLegId(id)) continue;
          auto legIndex = static_cast<size_t>(TrigCompositeUtils::getIndexFromLeg(id));
          std::string chain = TrigCompositeUtils::getIDFromLeg(id).name();
          if (legToInputCollectionIndexMap.at(chain).at(legIndex) == decisionIndex) item.decisionIDs.insert(id);
        }
      }
      else {
        TrigCompositeUtils::decisionIDs(*decisionEL, item.decisionIDs);
      }
    }
  }
 
  if (msgLvl(MSG::DEBUG)) {
    ATH_MSG_DEBUG( "Dump found leptons before vertex fit: " << leptons.size() << " candidates" );
    for (const auto& item : leptons) {
      const auto lepton = *item.link;
      const xAOD::TrackParticle* track;
      if constexpr(std::is_same<T, xAOD::MuonContainer>::value) {
        track = lepton->trackParticle(xAOD::Muon::TrackParticleType::InnerDetectorTrackParticle);
      }
      else {
        track = lepton->trackParticle();
      }
      ATH_MSG_DEBUG( " -- lepton InDetTrackParticle pt/eta/phi/q: " << track->pt() << " / " << track->eta() << " / " << track->phi() << " / " << track->charge() );
      ATH_MSG_DEBUG( "    lepton pt (muon: CombinedTrackParticle): " << lepton->pt() << " / " << lepton->eta() << " / " << lepton->phi() << " / " << lepton->charge() );
      ATH_MSG_DEBUG( "    allowed decisions:" );
      for (const DecisionID& id : item.decisionIDs) {
        ATH_MSG_DEBUG( "    +++ " << HLT::Identifier(id) );
      }
    }
  }
 
  return StatusCode::SUCCESS;
}

mergeTracksFromDecisions()

template<typename CONTAINER>

StatusCode TrigMultiTrkComboHypo::mergeTracksFromDecisions ( TrigMultiTrkStateBase & state ) const

private

Go through state.previousDecisions(), fetch xAOD::Muons/xAODElectron objects attached to decisions and save links to the their xAOD::TrackParticle objects in state.tracks().

Definition at line 439 of file TrigMultiTrkComboHypo.cxx.

                                                                                             {
 
  auto& tracks = state.tracks();
  tracks.clear();
 
  // all muons/electrons from views are already connected with previous decisions by TrigMuonEFHypoAlg or by TrigEgammaPrecisionElectronHypoAlg
  for (const Decision* decision : state.previousDecisions()) {
    if (!TrigCompositeUtils::isAnyIDPassing(decision, m_allowedIDs)) continue;
 
    ATH_CHECK( decision->hasObjectLink(TrigCompositeUtils::featureString(), ClassID_traits<CONTAINER>::ID()) );
    auto leptonEL = decision->objectLink<CONTAINER>(TrigCompositeUtils::featureString());
    const auto lepton = *leptonEL;
 
    ElementLink<xAOD::TrackParticleContainer> trackEL;
    if constexpr(std::is_same<CONTAINER, xAOD::MuonContainer>::value) {
      if (!lepton->trackParticle(xAOD::Muon::TrackParticleType::CombinedTrackParticle)) continue;
      if (!lepton->trackParticle(xAOD::Muon::TrackParticleType::InnerDetectorTrackParticle)) continue;
      trackEL = lepton->inDetTrackParticleLink();
    }
    else if constexpr(std::is_same<CONTAINER, xAOD::L2CombinedMuonContainer>::value) {
      if (!lepton->idTrack()) continue;
      trackEL = lepton->idTrackLink();
    }
    else if constexpr(std::is_same<CONTAINER, xAOD::ElectronContainer>::value) {
      if (!lepton->trackParticle()) continue;
      trackEL = lepton->trackParticleLink();
    }
    else {
      ATH_MSG_ERROR( "mergeTracksFromDecisions(): no scenario for the provided CONTAINER is specified" );
      return StatusCode::FAILURE;
    }
 
    if (!trackEL.isValid()) continue;
    if (!m_applyOverlapRemoval ||
        std::find_if(tracks.begin(), tracks.end(),
                     [this, track = *trackEL](const auto& x){ return this->isIdenticalTracks(track, *x); }) == tracks.end()) {
      tracks.emplace_back(trackEL);
    }
  }
  std::sort(tracks.begin(), tracks.end(), [](const auto& lhs, const auto& rhs){ return ((*lhs)->pt() > (*rhs)->pt()); });
 
  if (msgLvl(MSG::DEBUG)) {
    ATH_MSG_DEBUG( "Dump found tracks before vertex fit: " << tracks.size() << " candidates" );
    for (const auto& trackEL : tracks) {
      const xAOD::TrackParticle* track = *trackEL;
      ATH_MSG_DEBUG( " -- track pt/eta/phi/q: " << track->pt() << " / " << track->eta() << " / " << track->phi() << " / " << track->charge() );
    }
  }
 
  return StatusCode::SUCCESS;
}

mergeTracksFromViews()

StatusCode TrigMultiTrkComboHypo::mergeTracksFromViews ( TrigMultiTrkStateBase & state ) const

private

Go through state.previousDecisions() and fetch xAOD::TrackParticle objects associated with the nearest SG::View.

Enable overlap removal to get collection of unique objects at state.tracks().

Definition at line 388 of file TrigMultiTrkComboHypo.cxx.

                                                                                         {
 
  auto& tracks = state.tracks();
  tracks.clear();
 
  std::set<const SG::View*> views;
  for (const Decision* decision : state.previousDecisions()) {
    if (!TrigCompositeUtils::isAnyIDPassing(decision, m_allowedIDs)) continue;
 
    auto viewLinkInfo = TrigCompositeUtils::findLink<ViewContainer>(decision, TrigCompositeUtils::viewString(), true);
    ATH_CHECK( viewLinkInfo.isValid() );
    const SG::View* view = *viewLinkInfo.link;
    if (views.find(view) != views.end()) continue;  // tracks from this view have already been fetched
 
    auto tracksHandle = ViewHelper::makeHandle(view, m_trackParticleContainerKey, state.context());
    ATH_CHECK( tracksHandle.isValid() );
    ATH_MSG_DEBUG( "tracks handle " << m_trackParticleContainerKey << " size: " << tracksHandle->size() );
 
    std::vector<ElementLink<xAOD::TrackParticleContainer>> tracksFromView;
    tracksFromView.reserve(tracksHandle->size());
    for (size_t idx = 0; idx < tracksHandle->size(); ++idx) {
      tracksFromView.emplace_back(ViewHelper::makeLink<xAOD::TrackParticleContainer>(view, tracksHandle, idx));
    }
 
    for (const auto& trackEL : tracksFromView) {
      const xAOD::TrackParticle* track = *trackEL;
      if (track->definingParametersCovMatrixVec().empty() || track->pt() < m_trkPtMin) continue;
 
      if (views.empty() || !m_applyOverlapRemoval ||
          std::find_if(tracks.begin(), tracks.end(),
                       [this, track](const auto& x){ return isIdenticalTracks(track, *x); }) == tracks.end()) {
        tracks.emplace_back(trackEL);
      }
    }
    views.insert(view);
  }
  std::sort(tracks.begin(), tracks.end(), [](const auto& lhs, const auto& rhs){ return ((*lhs)->pt() > (*rhs)->pt()); });
 
  if (msgLvl(MSG::DEBUG)) {
    ATH_MSG_DEBUG( "Dump found tracks before vertex fit: " << tracks.size() << " candidates" );
    for (const auto& trackEL : tracks) {
      const xAOD::TrackParticle* track = *trackEL;
      ATH_MSG_DEBUG( " -- track pt/eta/phi/q: " << track->pt() << " / " << track->eta() << " / " << track->phi() << " / " << track->charge() );
    }
  }
 
  return StatusCode::SUCCESS;
}

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.

passedDeltaRcut()

bool TrigMultiTrkComboHypo::passedDeltaRcut ( const std::vector< xAOD::TrackParticle::GenVecFourMom_t > & momenta ) const

private

Definition at line 1040 of file TrigMultiTrkComboHypo.cxx.

                                                                                                      {
 
  if (m_deltaRMax == std::numeric_limits<float>::max() && m_deltaRMin == std::numeric_limits<float>::lowest()) {
    return true;
  }
  for (size_t i = 0; i < p.size(); ++i) {
    for (size_t j = i + 1; j < p.size(); ++j) {
      double deltaR = ROOT::Math::VectorUtil::DeltaR(p[i], p[j]);
      if (deltaR > m_deltaRMax || deltaR < m_deltaRMin) return false;
    }
  }
  return true;
}

processMergedElectrons()

StatusCode TrigMultiTrkComboHypo::processMergedElectrons ( TrigMultiTrkState< xAOD::ElectronContainer > & state ) const

private

Make all possible combinations from electrons originating from the same BPH-0DR3-EM7J15 cluster, only one track should pass e5_lhvloose requirements; initialRoI word will be saved into xAOD::TrigBphys objects.

Definition at line 706 of file TrigMultiTrkComboHypo.cxx.

                                                                                                              {
 
  ATH_MSG_DEBUG( "Try to find electrons originating from the same EM cluster" );
 
  // some electrons can be already attached to the list, add electrons from BPH-0DR3-EM7J15 clusters to the end
  auto& leptons = state.leptons();
 
  if (m_mergedElectronIDs.empty()) {
    ATH_MSG_DEBUG( "no chains similar to BPH-0DR3-EM7J15 have been requested, should not look for close-by electrons" );
    return StatusCode::SUCCESS;
  }
 
  const std::vector<double> particleMasses(2, PDG::mElectron);
 
  for (const Decision* decision : state.previousDecisions()) {
    if (!TrigCompositeUtils::isAnyIDPassing(decision, m_mergedElectronIDs)) continue;
 
    auto decisionEL = TrigCompositeUtils::decisionToElementLink(decision, state.context());
    ATH_CHECK( decision->hasObjectLink(TrigCompositeUtils::featureString(), ClassID_traits<xAOD::ElectronContainer>::ID()) );
    auto electronEL = decision->objectLink<xAOD::ElectronContainer>(TrigCompositeUtils::featureString());
    const auto electron = *electronEL;
    if (!electron->trackParticle()) continue;
 
    // get all electrons from the same SG::View, i.e. from the same initialRoI
    const auto electronContainer = electronEL.getStorableObjectPointer();
    if (electronContainer->size() <= 1) continue;
 
    // add electron from decision to state.leptons
    DecisionIDContainer decisionIDs;
    TrigCompositeUtils::decisionIDs(decision, decisionIDs);
    leptons.push_back({electronEL, std::vector<ElementLink<DecisionContainer>>(1, decisionEL), decisionIDs});
 
    // get initialRoI this electron originating from
    auto roiInfo = TrigCompositeUtils::findLink<TrigRoiDescriptorCollection>(decision, TrigCompositeUtils::initialRoIString(), true);
    ATH_CHECK( roiInfo.isValid() );
    auto initialRoI = *roiInfo.link;
 
    // try to build di-electron pairs: first electron is always from decision, second from the same SG::View
    std::vector<ElementLink<xAOD::TrackParticleContainer>> tracklist(2);
    tracklist[0] = electron->trackParticleLink();
    for (size_t i = 0; i < electronContainer->size(); ++i) {
      const auto electronFromView = electronContainer->at(i);
      if (electronFromView == electron) continue;
      if (!electronFromView->trackParticle()) continue;
      if (!electronFromView->caloCluster() || electronFromView->caloCluster()->et() < m_caloClusterEtThreshold) continue;
      tracklist[1] = electronFromView->trackParticleLink();
 
      auto fitterState = m_vertexFitter->makeState(state.context());
      auto vertex = fit(tracklist, particleMasses, *fitterState);
      if (!vertex) continue;
      xAOD::TrigBphys* trigBphys = makeTrigBPhys(*vertex, particleMasses, state.beamSpot(), *fitterState);
      trigBphys->setRoiId(initialRoI->roiWord());
      state.addTrigBphysObject(trigBphys, std::vector<size_t>(1, leptons.size() - 1));
    }
  }
 
  return StatusCode::SUCCESS;
}

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.

triggerMultiplicityMap()

const Combo::MultiplicityReqMap & ComboHypo::triggerMultiplicityMap ( ) const

inlineprotectedinherited

Definition at line 43 of file ComboHypo.h.

{ return m_multiplicitiesReqMap.value(); }

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_allowedIDs

TrigCompositeUtils::DecisionIDContainer TrigMultiTrkComboHypo::m_allowedIDs

private

Definition at line 309 of file TrigMultiTrkComboHypo.h.

m_applyOverlapRemoval

Gaudi::Property<bool> TrigMultiTrkComboHypo::m_applyOverlapRemoval

private

Initial value:

{this, "applyOverlapRemoval", true,
    "apply overlap removal for the close-by same-sign objects from different views"}

Definition at line 274 of file TrigMultiTrkComboHypo.h.

                                            {this, "applyOverlapRemoval", true,
    "apply overlap removal for the close-by same-sign objects from different views"};

m_beamSpotKey

SG::ReadCondHandleKey<InDet::BeamSpotData> TrigMultiTrkComboHypo::m_beamSpotKey {this, "BeamSpotKey", "BeamSpotData", "SG key for beam spot"}

private

Definition at line 262 of file TrigMultiTrkComboHypo.h.

{this, "BeamSpotKey", "BeamSpotData", "SG key for beam spot"};

m_caloClusterEtThreshold

Gaudi::Property<double> TrigMultiTrkComboHypo::m_caloClusterEtThreshold

private

Initial value:

{this, "caloClusterEtThreshold", 5.,
    "minimum transverse energy of the cluster, associated with close-by electron"}

Definition at line 300 of file TrigMultiTrkComboHypo.h.

                                                 {this, "caloClusterEtThreshold", 5.,
    "minimum transverse energy of the cluster, associated with close-by electron"};

m_checkMultiplicity

Gaudi::Property<bool> TrigMultiTrkComboHypo::m_checkMultiplicity

private

Initial value:

{this, "checkMultiplicity", false,
    "check that we have enough leptons to fire the chain, needed for HLT_mu6_2mu4_bJpsi_L1MU5VF_3MU3VF"}

Definition at line 280 of file TrigMultiTrkComboHypo.h.

                                          {this, "checkMultiplicity", false,
    "check that we have enough leptons to fire the chain, needed for HLT_mu6_2mu4_bJpsi_L1MU5VF_3MU3VF"};

m_checkMultiplicityMap

Gaudi::Property<bool> ComboHypo::m_checkMultiplicityMap

privateinherited

Initial value:

{ this, "CheckMultiplicityMap", true,
    "Perform a consistency check of the MultiplicitiesMap"}

Definition at line 62 of file ComboHypo.h.

                                             { this, "CheckMultiplicityMap", true,
    "Perform a consistency check of the MultiplicitiesMap"};

m_chi2

Gaudi::Property<float> TrigMultiTrkComboHypo::m_chi2

private

Initial value:

{this, "chi2", 150.,
    "chi2 cut for the fitted vertex"}

Definition at line 288 of file TrigMultiTrkComboHypo.h.

                              {this, "chi2", 150.,
    "chi2 cut for the fitted vertex"};

m_combineInputDecisionCollections

Gaudi::Property<bool> TrigMultiTrkComboHypo::m_combineInputDecisionCollections

private

Initial value:

{this, "combineInputDecisionCollections", false,
    "combine objects attached to decisions from different input collections, needed for HLT_mu4_ivarloose_mu4_b10invmAB120vtx20_L12MU3V chains"}

Definition at line 276 of file TrigMultiTrkComboHypo.h.

                                                        {this, "combineInputDecisionCollections", false,
    "combine objects attached to decisions from different input collections, needed for HLT_mu4_ivarloose_mu4_b10invmAB120vtx20_L12MU3V chains"};

m_deltaR

Gaudi::Property<float> TrigMultiTrkComboHypo::m_deltaR

private

Initial value:

{this, "deltaR", 0.01,
    "minimum deltaR between same-sign tracks (overlap removal)"}

Definition at line 282 of file TrigMultiTrkComboHypo.h.

                                {this, "deltaR", 0.01,
    "minimum deltaR between same-sign tracks (overlap removal)"};

m_deltaRMax

Gaudi::Property<float> TrigMultiTrkComboHypo::m_deltaRMax

private

Initial value:

{this, "deltaRMax", std::numeric_limits<float>::max(),
    "maximum deltaR between tracks in a candidate"}

Definition at line 284 of file TrigMultiTrkComboHypo.h.

                                   {this, "deltaRMax", std::numeric_limits<float>::max(),
    "maximum deltaR between tracks in a candidate"};

m_deltaRMin

Gaudi::Property<float> TrigMultiTrkComboHypo::m_deltaRMin

private

Initial value:

{this, "deltaRMin", std::numeric_limits<float>::lowest(),
    "maximum deltaR between tracks in a candidate"}

Definition at line 286 of file TrigMultiTrkComboHypo.h.

                                   {this, "deltaRMin", std::numeric_limits<float>::lowest(),
    "maximum deltaR between tracks in a candidate"};

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_doElectrons

Gaudi::Property<bool> TrigMultiTrkComboHypo::m_doElectrons

private

Initial value:

{this, "doElectrons", false,
    "use electrons if true, otherwise use muons"}

Definition at line 294 of file TrigMultiTrkComboHypo.h.

                                    {this, "doElectrons", false,
    "use electrons if true, otherwise use muons"};

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_hypoTools

ToolHandleArray< ComboHypoToolBase > ComboHypo::m_hypoTools {this, "ComboHypoTools", {}, "Tools to perform selection"}

privateinherited

Definition at line 104 of file ComboHypo.h.

{this, "ComboHypoTools", {}, "Tools to perform selection"};

m_inputs

SG::ReadHandleKeyArray<TrigCompositeUtils::DecisionContainer> ComboHypo::m_inputs { this, "HypoInputDecisions", {}, "Input Decisions" }

privateinherited

Definition at line 50 of file ComboHypo.h.

{ this, "HypoInputDecisions", {}, "Input Decisions" };

m_isMuTrkMode

Gaudi::Property<bool> TrigMultiTrkComboHypo::m_isMuTrkMode

private

Initial value:

{this, "isMuTrkMode", false,
    "make pairs between muon from SG::View and tracks from the same SG::View"}

Definition at line 292 of file TrigMultiTrkComboHypo.h.

                                    {this, "isMuTrkMode", false,
    "make pairs between muon from SG::View and tracks from the same SG::View"};

m_isStreamer

Gaudi::Property<bool> TrigMultiTrkComboHypo::m_isStreamer

private

Initial value:

{this, "isStreamer", false,
    "if true we do not create trigger objects, just copy all appropriate decisions to the next step or break the chain"}

Definition at line 290 of file TrigMultiTrkComboHypo.h.

                                   {this, "isStreamer", false,
    "if true we do not create trigger objects, just copy all appropriate decisions to the next step or break the chain"};

m_legToInputCollectionMap

Gaudi::Property< Combo::LegMap > ComboHypo::m_legToInputCollectionMap

privateinherited

Initial value:

{this, "LegToInputCollectionMap", {},
    "Map from the chain name to the per-leg index in this algorithm's ReadHandleKeyArray which should be used as the source of incoming Decision Objects on the leg."}

Definition at line 59 of file ComboHypo.h.

                                                        {this, "LegToInputCollectionMap", {},
    "Map from the chain name to the per-leg index in this algorithm's ReadHandleKeyArray which should be used as the source of incoming Decision Objects on the leg."};

m_massRange

Gaudi::Property<std::vector<std::pair<double, double> > > TrigMultiTrkComboHypo::m_massRange

private

Initial value:

{this, "massRange", { {0., 100000.} },
    "range of the invariant mass of the track combinations"}

Definition at line 272 of file TrigMultiTrkComboHypo.h.

                                                                {this, "massRange", { {0., 100000.} },
    "range of the invariant mass of the track combinations"};

m_mergedElectronChains

Gaudi::Property<std::vector<std::string> > TrigMultiTrkComboHypo::m_mergedElectronChains

private

Initial value:

{this, "mergedElectronChains", {"BPH-0DR3-EM7J15"},
    "patterns for BPH-0DR3-EM7J15 like chains"}

Definition at line 298 of file TrigMultiTrkComboHypo.h.

                                                             {this, "mergedElectronChains", {"BPH-0DR3-EM7J15"},
    "patterns for BPH-0DR3-EM7J15 like chains"};

m_mergedElectronIDs

TrigCompositeUtils::DecisionIDContainer TrigMultiTrkComboHypo::m_mergedElectronIDs

private

Definition at line 311 of file TrigMultiTrkComboHypo.h.

m_monTool

ToolHandle<GenericMonitoringTool> TrigMultiTrkComboHypo::m_monTool {this, "MonTool", "", "monitoring tool"}

private

Definition at line 307 of file TrigMultiTrkComboHypo.h.

{this, "MonTool", "", "monitoring tool"};

m_multiplicitiesReqMap

Gaudi::Property< Combo::MultiplicityReqMap > ComboHypo::m_multiplicitiesReqMap

privateinherited

Initial value:

{this, "MultiplicitiesMap", {}, 
    "Map from the chain name to multiplicities required at each input"}

Definition at line 56 of file ComboHypo.h.

                                                                 {this, "MultiplicitiesMap", {}, 
    "Map from the chain name to multiplicities required at each input"};

m_nTrk

Gaudi::Property<std::vector<unsigned int> > TrigMultiTrkComboHypo::m_nTrk

private

Initial value:

{this, "nTracks", {2},
    "number of tracks to be fitted into the common vertex"}

Definition at line 264 of file TrigMultiTrkComboHypo.h.

                                                {this, "nTracks", {2},
    "number of tracks to be fitted into the common vertex"};

m_nTrkCharge

Gaudi::Property<std::vector<int> > TrigMultiTrkComboHypo::m_nTrkCharge

private

Initial value:

{this, "totalCharge", {},
    "magnitude of the total charge to accept, negative is none"}

Definition at line 266 of file TrigMultiTrkComboHypo.h.

                                             {this, "totalCharge", {},
    "magnitude of the total charge to accept, negative is none"};

m_outputs

SG::WriteHandleKeyArray<TrigCompositeUtils::DecisionContainer> ComboHypo::m_outputs { this, "HypoOutputDecisions", {}, "Output Decisions" }

privateinherited

Definition at line 51 of file ComboHypo.h.

{ this, "HypoOutputDecisions", {}, "Output Decisions" };

m_requireUniqueROI

Gaudi::Property<bool> ComboHypo::m_requireUniqueROI

privateinherited

Initial value:

{this, "RequireUniqueROI", false,
    "Require each Feature in each leg of the combination to come from a unique L1 seeding ROI."}

Definition at line 53 of file ComboHypo.h.

                                         {this, "RequireUniqueROI", false,
    "Require each Feature in each leg of the combination to come from a unique L1 seeding ROI."};

m_resolvedElectronIDs

TrigCompositeUtils::DecisionIDContainer TrigMultiTrkComboHypo::m_resolvedElectronIDs

private

Definition at line 310 of file TrigMultiTrkComboHypo.h.

m_trackParticleContainerKey

SG::ReadHandleKey<xAOD::TrackParticleContainer> TrigMultiTrkComboHypo::m_trackParticleContainerKey {this, "TrackCollectionKey", "Tracks", "input TrackParticle container name"}

private

Definition at line 256 of file TrigMultiTrkComboHypo.h.

{this, "TrackCollectionKey", "Tracks", "input TrackParticle container name"};

m_trigBphysContainerKey

SG::WriteHandleKey<xAOD::TrigBphysContainer> TrigMultiTrkComboHypo::m_trigBphysContainerKey {this, "TrigBphysCollectionKey", "TrigBphysContainer", "output TrigBphysContainer name"}

private

Definition at line 259 of file TrigMultiTrkComboHypo.h.

{this, "TrigBphysCollectionKey", "TrigBphysContainer", "output TrigBphysContainer name"};

m_trigLevel

Gaudi::Property<std::string> TrigMultiTrkComboHypo::m_trigLevel

private

Initial value:

{this, "trigLevel", "EF",
    "trigger Level to set for created TrigBphys objects: L2, L2IO, L2MT or EF"}

Definition at line 296 of file TrigMultiTrkComboHypo.h.

                                       {this, "trigLevel", "EF",
    "trigger Level to set for created TrigBphys objects: L2, L2IO, L2MT or EF"};

m_trkMass

Gaudi::Property<std::vector<std::vector<double> > > TrigMultiTrkComboHypo::m_trkMass

private

Initial value:

{this, "trackMasses", {},
    "track masses for vertex reco (one per track); muon mass is used by default"}

Definition at line 268 of file TrigMultiTrkComboHypo.h.

                                                        {this, "trackMasses", {},
    "track masses for vertex reco (one per track); muon mass is used by default"};

m_trkPt

Gaudi::Property<std::vector<std::vector<double> > > TrigMultiTrkComboHypo::m_trkPt

private

Initial value:

{this, "trackPtThresholds", { {3650., 3650.} },
    "minimum track transverse momenta (one per track, sorted descending)"}

Definition at line 270 of file TrigMultiTrkComboHypo.h.

                                                      {this, "trackPtThresholds", { {3650., 3650.} },
    "minimum track transverse momenta (one per track, sorted descending)"};

m_trkPtMin

double TrigMultiTrkComboHypo::m_trkPtMin = 0.0

private

Definition at line 313 of file TrigMultiTrkComboHypo.h.

m_useLeptonMomentum

Gaudi::Property<bool> TrigMultiTrkComboHypo::m_useLeptonMomentum

private

Initial value:

{this, "useLeptonMomentum", false,
    "use 4-momentum of the xAOD::Muon to make fast calculation of the xAOD::TrigBphys mass, needed for consistency with TrigComboHypoTool::compute()"}

Definition at line 278 of file TrigMultiTrkComboHypo.h.

                                          {this, "useLeptonMomentum", false,
    "use 4-momentum of the xAOD::Muon to make fast calculation of the xAOD::TrigBphys mass, needed for consistency with TrigComboHypoTool::compute()"};

m_v0Tools

ToolHandle<Trk::V0Tools> TrigMultiTrkComboHypo::m_v0Tools {this, "V0Tools", "", "tool to calculate Lxy/LxyError of dimuon candidate wrt beam spot"}

private

Definition at line 305 of file TrigMultiTrkComboHypo.h.

{this, "V0Tools", "", "tool to calculate Lxy/LxyError of dimuon candidate wrt beam spot"};

m_varHandleArraysDeclared

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

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vertexFitter

ToolHandle<Trk::TrkVKalVrtFitter> TrigMultiTrkComboHypo::m_vertexFitter {this, "VertexFitter", "", "VKalVrtFitter tool to fit tracks into the common vertex"}

private

Definition at line 304 of file TrigMultiTrkComboHypo.h.

{this, "VertexFitter", "", "VKalVrtFitter tool to fit tracks into the common vertex"};

m_vertexPointEstimator

ToolHandle<InDet::VertexPointEstimator> TrigMultiTrkComboHypo::m_vertexPointEstimator {this, "VertexPointEstimator", "", "tool to find starting point for the vertex fitter"}

private

Definition at line 303 of file TrigMultiTrkComboHypo.h.

{this, "VertexPointEstimator", "", "tool to find starting point for the vertex fitter"};

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:

• TrigMultiTrkComboHypo.h
• TrigMultiTrkComboHypo.cxx