ATLAS Offline Software
Loading...
Searching...
No Matches
TrigBmumuxComboHypo Class Reference

EF hypothesis algorithm for B -> mu+ mu- X decays: B+ -> mu+ mu- K+ B_c+ -> J/psi(-> mu+ mu-) pi+ B_s0 -> mu+ mu- phi1020(-> K+, K-) B0 -> mu+ mu- K*0(-> K+ pi-) Lambda_b0 -> J/psi(-> mu+ mu-) p K- B_c+ -> J/psi(-> mu+ mu-) D_s+(->phi(-> K+ K-) pi+) B_c+ -> J/psi(-> mu+ mu-) D+(-> K- pi+ pi+) B_c+ -> J/psi(-> mu+ mu-) D*+(-> D0(-> K- pi+) pi+) partial (lost pion from D*+) and full reconstruction. More...

#include <TrigBmumuxComboHypo.h>

Inheritance diagram for TrigBmumuxComboHypo:
Collaboration diagram for TrigBmumuxComboHypo:

Public Types

enum  Decay : size_t {
  kPsi_2mu , kB_2mu1trk , kB_2mu2trk , kDs ,
  kDplus , kD0 , kB_PsiPi , kFastFit_2trk ,
  kFastFit_2mu1trk
}

Public Member Functions

 TrigBmumuxComboHypo (const std::string &name, ISvcLocator *pSvcLocator)
 TrigBmumuxComboHypo ()=delete
virtual StatusCode initialize () override
virtual StatusCode execute (const EventContext &context) const override
virtual StatusCode sysInitialize () override
 Override sysInitialize.
virtual bool isClonable () const override
 Specify if the algorithm is clonable.
virtual unsigned int cardinality () const override
 Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.
virtual StatusCode sysExecute (const EventContext &ctx) override
 Execute an algorithm.
virtual const DataObjIDColl & extraOutputDeps () const override
 Return the list of extra output dependencies.
virtual bool filterPassed (const EventContext &ctx) const
virtual void setFilterPassed (bool state, const EventContext &ctx) const
ServiceHandle< StoreGateSvc > & evtStore ()
 The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > & detStore () const
 The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode sysStart () override
 Handle START transition.
virtual std::vector< Gaudi::DataHandle * > inputHandles () const override
 Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * > outputHandles () const override
 Return this algorithm's output handles.
Gaudi::Details::PropertyBase & declareProperty (Gaudi::Property< T, V, H > &t)
void updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream & msg () const
bool msgLvl (const MSG::Level lvl) const

Protected Member Functions

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< StoreGateSvcStoreGateSvc_t

Private Member Functions

StatusCode mergeMuonsFromDecisions (TrigBmumuxState &) const
 Go through state.previousDecisions(), fetch xAOD::Muons objects attached to decisions and save links to them in state.muons().
StatusCode mergeTracksFromViews (TrigBmumuxState &) const
 Go through state.previousDecisions() and fetch xAOD::TrackParticle objects associated with the nearest SG::View.
StatusCode findDimuonCandidates (TrigBmumuxState &) const
 Make all possible dimuon combinations from state.muons(), fit muon InDet tracks to the common vertex, dimuon vertices are stored in state.dimuons() and in state.trigBphysCollection() (as xAOD::TrigBphys objects).
StatusCode findBmumuxCandidates (TrigBmumuxState &) const
 Find B decays by appling next three subprocedures to each found dimuon candidate.
StatusCode findBmumuxCandidates_selectTracks (TrigBmumuxState &, size_t dimuonIndex) const
 Select tracks in vicinity of given dimuon vertex.
StatusCode findBmumuxCandidates_fastFit (TrigBmumuxState &, size_t dimuonIndex) const
 Go through (dimuon+track) and (track+track) combinations found by findBmumuxCandidates_fit(makeCombinations = true) Perform fast fit if combination occurred more than five times.
StatusCode findBmumuxCandidates_fit (TrigBmumuxState &, size_t dimuonIndex, bool makeCombinations=false) const
 Perform fit of B decays for the topologies described above if makeCombinations = false.
StatusCode createDecisionObjects (TrigBmumuxState &) const
 Create a decision for each xAOD::TrigBphys object from state.trigBphysCollection() and save it to state.decisions(); use hypoTools() to assign correct decisionIDs according to xAOD::TrigBphys::particleType()
std::unique_ptr< xAOD::Vertexfit (const EventContext &context, const std::vector< ElementLink< xAOD::TrackParticleContainer > > &trackParticleLinks, Decay decay=kPsi_2mu, const xAOD::Vertex *dimuon=nullptr) const
 Perform a vertex fit on selected tracks.
xAOD::TrigBphysmakeTriggerObject (TrigBmumuxState &state, const xAOD::Vertex &vertex, xAOD::TrigBphys::pType type=xAOD::TrigBphys::MULTIMU, const std::vector< double > &trkMass={PDG::mMuon, PDG::mMuon}, const ElementLink< xAOD::TrigBphysContainer > &dimuonLink=ElementLink< xAOD::TrigBphysContainer >()) 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 isInSameRoI (const xAOD::Muon *, const xAOD::TrackParticle *) const
 Attempts to identify if the track is in the same RoI as the muon by comparing the angle with the RoI limits.
bool passDimuonTrigger (const std::vector< const TrigCompositeUtils::DecisionIDContainer * > &previousDecisionIDs) const
bool isInMassRange (double mass, const std::pair< double, double > &range) const
 Checks that the given mass value falls into the specified range.
double Lxy (const Amg::Vector3D &productionVertex, const xAOD::Vertex &decayVertex) const
 Calculate the Lxy (~distance between vertices) It is defined as the transverse distance between the production and decay vertices projected along the transverse momentum of the particle.
xAOD::TrackParticle::GenVecFourMom_t momentum (const xAOD::Vertex &vertex, const std::vector< double > &trkMass) const
 Calculate 4-momentum of the fitted vertex particle assuming the given masses.
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::TrackParticleContainerm_trackParticleContainerKey
SG::ReadHandleKey< xAOD::MuonContainerm_muonContainerKey
SG::WriteHandleKey< xAOD::TrigBphysContainerm_trigBphysContainerKey
SG::ReadCondHandleKey< InDet::BeamSpotDatam_beamSpotKey {this, "BeamSpotKey", "BeamSpotData", "SG key for beam spot"}
Gaudi::Property< double > m_deltaR
Gaudi::Property< double > m_trkZ0
Gaudi::Property< double > m_roiEtaWidth
Gaudi::Property< double > m_roiPhiWidth
Gaudi::Property< size_t > m_fitAttemptsWarningThreshold
Gaudi::Property< size_t > m_fitAttemptsBreakThreshold
Gaudi::Property< double > m_fastFit_2trk_chi2
Gaudi::Property< double > m_fastFit_2mu1trk_chi2
Gaudi::Property< bool > m_dimuon_rejectSameChargeTracks
Gaudi::Property< std::pair< double, double > > m_dimuon_massRange
Gaudi::Property< double > m_dimuon_chi2
Gaudi::Property< bool > m_BplusToMuMuKaon
Gaudi::Property< double > m_BplusToMuMuKaon_minKaonPt
Gaudi::Property< std::pair< double, double > > m_BplusToMuMuKaon_massRange
Gaudi::Property< float > m_BplusToMuMuKaon_chi2
Gaudi::Property< bool > m_BplusToMuMuKaon_useFastFit
Gaudi::Property< bool > m_BcToMuMuPion
Gaudi::Property< double > m_BcToMuMuPion_minPionPt
Gaudi::Property< std::pair< double, double > > m_BcToMuMuPion_dimuonMassRange
Gaudi::Property< std::pair< double, double > > m_BcToMuMuPion_massRange
Gaudi::Property< float > m_BcToMuMuPion_chi2
Gaudi::Property< bool > m_BcToMuMuPion_useFastFit
Gaudi::Property< bool > m_BsToMuMuPhi1020
Gaudi::Property< bool > m_BsToMuMuPhi1020_rejectSameChargeTracks
Gaudi::Property< double > m_BsToMuMuPhi1020_minKaonPt
Gaudi::Property< std::pair< double, double > > m_BsToMuMuPhi1020_massRange
Gaudi::Property< std::pair< double, double > > m_BsToMuMuPhi1020_phiMassRange
Gaudi::Property< float > m_BsToMuMuPhi1020_chi2
Gaudi::Property< bool > m_BsToMuMuPhi1020_useFastFit
Gaudi::Property< bool > m_BdToMuMuKstar0
Gaudi::Property< bool > m_BdToMuMuKstar0_rejectSameChargeTracks
Gaudi::Property< double > m_BdToMuMuKstar0_minKaonPt
Gaudi::Property< double > m_BdToMuMuKstar0_minPionPt
Gaudi::Property< std::pair< double, double > > m_BdToMuMuKstar0_massRange
Gaudi::Property< std::pair< double, double > > m_BdToMuMuKstar0_KstarMassRange
Gaudi::Property< float > m_BdToMuMuKstar0_chi2
Gaudi::Property< bool > m_BdToMuMuKstar0_useFastFit
Gaudi::Property< bool > m_LambdaBToMuMuProtonKaon
Gaudi::Property< bool > m_LambdaBToMuMuProtonKaon_rejectSameChargeTracks
Gaudi::Property< double > m_LambdaBToMuMuProtonKaon_minProtonPt
Gaudi::Property< double > m_LambdaBToMuMuProtonKaon_minKaonPt
Gaudi::Property< double > m_LambdaBToMuMuProtonKaon_minKstarMass
Gaudi::Property< std::pair< double, double > > m_LambdaBToMuMuProtonKaon_dimuonMassRange
Gaudi::Property< std::pair< double, double > > m_LambdaBToMuMuProtonKaon_massRange
Gaudi::Property< float > m_LambdaBToMuMuProtonKaon_chi2
Gaudi::Property< bool > m_LambdaBToMuMuProtonKaon_useFastFit
Gaudi::Property< bool > m_BcToDsMuMu
Gaudi::Property< double > m_BcToDsMuMu_minKaonPt
Gaudi::Property< double > m_BcToDsMuMu_minPionPt
Gaudi::Property< std::pair< double, double > > m_BcToDsMuMu_massRange
Gaudi::Property< std::pair< double, double > > m_BcToDsMuMu_dimuonMassRange
Gaudi::Property< std::pair< double, double > > m_BcToDsMuMu_phiMassRange
Gaudi::Property< std::pair< double, double > > m_BcToDsMuMu_DsMassRange
Gaudi::Property< float > m_BcToDsMuMu_chi2
Gaudi::Property< bool > m_BcToDsMuMu_useFastFit
Gaudi::Property< bool > m_BcToDplusMuMu
Gaudi::Property< double > m_BcToDplusMuMu_minKaonPt
Gaudi::Property< double > m_BcToDplusMuMu_minPionPt
Gaudi::Property< std::pair< double, double > > m_BcToDplusMuMu_massRange
Gaudi::Property< std::pair< double, double > > m_BcToDplusMuMu_dimuonMassRange
Gaudi::Property< std::pair< double, double > > m_BcToDplusMuMu_DplusMassRange
Gaudi::Property< float > m_BcToDplusMuMu_chi2
Gaudi::Property< bool > m_BcToDplusMuMu_useFastFit
Gaudi::Property< bool > m_BcToDstarMuMu
Gaudi::Property< bool > m_BcToDstarMuMu_makeDstar
Gaudi::Property< double > m_BcToDstarMuMu_minD0KaonPt
Gaudi::Property< double > m_BcToDstarMuMu_minD0PionPt
Gaudi::Property< double > m_BcToDstarMuMu_minDstarPionPt
Gaudi::Property< double > m_BcToDstarMuMu_maxDstarPionZ0
Gaudi::Property< std::pair< double, double > > m_BcToDstarMuMu_massRange
Gaudi::Property< std::pair< double, double > > m_BcToDstarMuMu_dimuonMassRange
Gaudi::Property< std::pair< double, double > > m_BcToDstarMuMu_D0MassRange
Gaudi::Property< std::pair< double, double > > m_BcToDstarMuMu_DstarMassRange
Gaudi::Property< float > m_BcToDstarMuMu_chi2
ToolHandle< InDet::VertexPointEstimatorm_vertexPointEstimator
ToolHandle< Trk::TrkVKalVrtFitterm_vertexFitter
ToolHandle< Reco::ITrackToVertexm_trackToVertexTool
ToolHandle< GenericMonitoringToolm_monTool
TrigCompositeUtils::DecisionIDContainer m_allowedIDs
SG::ReadHandleKeyArray< TrigCompositeUtils::DecisionContainerm_inputs { this, "HypoInputDecisions", {}, "Input Decisions" }
SG::WriteHandleKeyArray< TrigCompositeUtils::DecisionContainerm_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< ComboHypoToolBasem_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

Static Private Attributes

static const std::vector< std::vector< double > > s_trkMass

Detailed Description

EF hypothesis algorithm for B -> mu+ mu- X decays: B+ -> mu+ mu- K+ B_c+ -> J/psi(-> mu+ mu-) pi+ B_s0 -> mu+ mu- phi1020(-> K+, K-) B0 -> mu+ mu- K*0(-> K+ pi-) Lambda_b0 -> J/psi(-> mu+ mu-) p K- B_c+ -> J/psi(-> mu+ mu-) D_s+(->phi(-> K+ K-) pi+) B_c+ -> J/psi(-> mu+ mu-) D+(-> K- pi+ pi+) B_c+ -> J/psi(-> mu+ mu-) D*+(-> D0(-> K- pi+) pi+) partial (lost pion from D*+) and full reconstruction.

Definition at line 115 of file TrigBmumuxComboHypo.h.

Member Typedef Documentation

◆ StoreGateSvc_t

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

Definition at line 388 of file AthCommonDataStore.h.

Member Enumeration Documentation

◆ Decay

Enumerator
kPsi_2mu 
kB_2mu1trk 
kB_2mu2trk 
kDs 
kDplus 
kD0 
kB_PsiPi 
kFastFit_2trk 
kFastFit_2mu1trk 

Definition at line 123 of file TrigBmumuxComboHypo.h.

123 : size_t {
124 kPsi_2mu, // psi -> mu+ mu-
125 kB_2mu1trk, // B -> mu+ mu- trk1
126 kB_2mu2trk, // B -> mu+ mu- trk1 trk2
127 kDs, // D_s+ -> K+ K- pi+
128 kDplus, // D+ -> K- pi+ pi+
129 kD0, // D0 -> K- pi+
130 kB_PsiPi, // psi + pion from D*+
131 kFastFit_2trk, // trk1 + trk2
132 kFastFit_2mu1trk // dimuon + trk1
133 };

Constructor & Destructor Documentation

◆ TrigBmumuxComboHypo() [1/2]

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

Definition at line 51 of file TrigBmumuxComboHypo.cxx.

52 : ::ComboHypo(name, pSvcLocator) {}
ComboHypo(const std::string &name, ISvcLocator *pSvcLocator)
Definition ComboHypo.cxx:13

◆ TrigBmumuxComboHypo() [2/2]

TrigBmumuxComboHypo::TrigBmumuxComboHypo ( )
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.

64{
65 return 0;
66}

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

86 {
87 DecisionIDContainer passing;
88 for (auto const& element : passingLegs) {
89 passing.insert(element.first);
90 }
91
92 ATH_MSG_DEBUG( "Copying "<<passing.size()<<" positive decision IDs to outputs");
93
94 for ( size_t input_counter = 0; input_counter < m_inputs.size(); ++input_counter ) {
95 // new output decisions
96 SG::WriteHandle<DecisionContainer> outputHandle = createAndStore(m_outputs.at(input_counter), context );
97 auto outDecisions = outputHandle.ptr();
98 auto inputHandle = SG::makeHandle( m_inputs.at(input_counter), context );
99 if ( inputHandle.isValid() ) {
100
101 for (const Decision* inputDecision : *inputHandle) {
102 auto thisEL = TrigCompositeUtils::decisionToElementLink(inputDecision, context);
103
104 // from all positive decision in the input only the ones that survived counting are passed over
105 const DecisionIDContainer& common = passedDecisionIDs(inputDecision, passing);
106
107 // check if this EL is in the combination map for the passing decIDs:
108 ATH_MSG_DEBUG("Searching this element in the map: ("<<thisEL.dataID() << " , " << thisEL.index()<<")");
109 DecisionIDContainer finalIds;
110 for (const DecisionID c : common){
111 const HLT::Identifier cID = HLT::Identifier(c);
112 // add the decID only if this candidate passed the combination selection
113 const std::vector<ElementLink<DecisionContainer>>& Comb=passingLegs.at(c);
114 if(std::find(Comb.begin(), Comb.end(), thisEL) == Comb.end()) {
115 continue;
116 }
117 ATH_MSG_DEBUG(" Adding "<< cID <<" because EL is found in the passingLegs map");
118 finalIds.insert( cID.numeric() ); // all Ids used by the Filter, including legs
119 if (TrigCompositeUtils::isLegId ( cID )){
120 const HLT::Identifier mainChain = TrigCompositeUtils::getIDFromLeg( cID );
121 finalIds.insert( mainChain.numeric() );
122 ATH_MSG_DEBUG(" Adding "<< mainChain <<" consequently");
123 }
124 }
125
126 Decision* newDec = newDecisionIn( outDecisions, inputDecision, comboHypoAlgNodeName(), context );
127 ATH_MSG_DEBUG("New decision (Container Index:" << input_counter << ", Element Index:"<< newDec->index() <<") has "
129 << " valid initialRoI, "<< TrigCompositeUtils::getLinkToPrevious(newDec).size() <<" previous decisions and "<<finalIds.size()<<" decision IDs") ;
130 insertDecisionIDs( finalIds, newDec );
131
132 }
133 }
134
135 if (msgLvl(MSG::DEBUG)) {
136 ATH_MSG_DEBUG("Output Handle " << m_outputs.at(input_counter).key() << " with " << outputHandle->size() <<" Decision objects");
137 for (const Decision* d : *outputHandle){
138 DecisionIDContainer objDecisions;
139 decisionIDs( d, objDecisions );
140 ATH_MSG_DEBUG(" Decision object #" << d->index() << " with " << objDecisions.size()<<" positive decision IDs");
141 for (const TrigCompositeUtils::DecisionID id : objDecisions ) {
142 ATH_MSG_DEBUG(" --- Passes: " << HLT::Identifier( id ));
143 }
144 }
145 }
146 }
147
148 return StatusCode::SUCCESS;
149}
#define ATH_MSG_DEBUG(x)
bool isValid(const T &p)
Av: we implement here an ATLAS-sepcific convention: all particles which are 99xxxxx are fine.
Definition AtlasPID.h:878
bool msgLvl(const MSG::Level lvl) const
SG::WriteHandleKeyArray< TrigCompositeUtils::DecisionContainer > m_outputs
Definition ComboHypo.h:51
SG::ReadHandleKeyArray< TrigCompositeUtils::DecisionContainer > m_inputs
Definition ComboHypo.h:50
TrigCompositeUtils::DecisionID numeric() const
numeric ID
size_t index() const
Return the index of this element within its container.
pointer_type ptr()
Dereference the pointer.
SG::ReadCondHandle< T > makeHandle(const SG::ReadCondHandleKey< T > &key, const EventContext &ctx=Gaudi::Hive::currentContext())
unsigned int DecisionID
void insertDecisionIDs(const Decision *src, Decision *dest)
Appends the decision IDs of src to the dest decision object.
Decision * newDecisionIn(DecisionContainer *dc, const std::string &name)
Helper method to create a Decision object, place it in the container and return a pointer to it.
const std::vector< ElementLink< DecisionContainer > > getLinkToPrevious(const Decision *d)
returns links to previous decision object 'seed'
DecisionIDContainer passedDecisionIDs(const Decision *d, const T &required)
return DecisionIDs in Decision object that match the required ones
HLT::Identifier getIDFromLeg(const HLT::Identifier &legIdentifier)
Generate the HLT::Identifier which corresponds to the chain name from the leg name.
const std::string & comboHypoAlgNodeName()
std::set< DecisionID > DecisionIDContainer
SG::WriteHandle< DecisionContainer > createAndStore(const SG::WriteHandleKey< DecisionContainer > &key, const EventContext &ctx)
Creates and right away records the DecisionContainer with the key.
LinkInfo< T > findLink(const Decision *start, const std::string &linkName, const bool suppressMultipleLinksWarning=false)
Perform a recursive search for ElementLinks of type T and name 'linkName', starting from Decision obj...
const std::string & initialRoIString()
void decisionIDs(const Decision *d, DecisionIDContainer &destination)
Extracts DecisionIDs stored in the Decision object.
ElementLink< DecisionContainer > decisionToElementLink(const Decision *d, const EventContext &ctx)
Takes a raw pointer to a Decision and returns an ElementLink to the Decision.
bool isLegId(const HLT::Identifier &legIdentifier)
Recognise whether the chain ID is a leg ID.

◆ createDecisionObjects()

StatusCode TrigBmumuxComboHypo::createDecisionObjects ( TrigBmumuxState & 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 according to xAOD::TrigBphys::particleType()

Definition at line 816 of file TrigBmumuxComboHypo.cxx.

816 {
817
818 for (const xAOD::TrigBphys* triggerObject : state.trigBphysCollection()) {
819 // skip the first vertex of the cascade decay B_c+(-> mu+ mu- D*+), it is already linked to the xAOD::TrigBphys::BCDSTMUMU trigger object via lowerChainLink()
820 if (triggerObject->particleType() == xAOD::TrigBphys::DSTDZPI) continue;
821
822 ATH_MSG_DEBUG( "Found xAOD::TrigBphys object: mass = " << triggerObject->mass() );
823
824 auto triggerObjectEL = ElementLink<xAOD::TrigBphysContainer>(state.trigBphysCollection(), triggerObject->index());
825 ATH_CHECK( triggerObjectEL.isValid() );
826
827 const xAOD::TrigBphys* dimuonTriggerObject = (triggerObject->particleType() == xAOD::TrigBphys::MULTIMU ? triggerObject : triggerObject->lowerChain());
828 if (triggerObject->particleType() == xAOD::TrigBphys::BCDSTMUMU && dimuonTriggerObject) dimuonTriggerObject = dimuonTriggerObject->lowerChain();
829 if (!dimuonTriggerObject) {
830 ATH_MSG_ERROR( "Failed to found a valid link for preceding dimuon trigger object" );
831 return StatusCode::FAILURE;
832 }
833
834 // need to get the references to the original muon objects used to build the dimuon vertex
835 // the position of this vertex in state.dimuons container is the same as for dimuonTriggerObject in trigBphysCollection
836 // dimuon vertex has already been decorated with muon indices
837 auto dimuonIndex = dimuonTriggerObject->index();
838 const xAOD::Vertex* dimuon = state.dimuons.get(dimuonIndex);
839 if ( !dimuon || dimuonIndex >= state.trigBphysMuonIndices.size() ) {
840 ATH_MSG_ERROR( "Failed to find original muons the dimuon vertex had been built from" );
841 return StatusCode::FAILURE;
842 }
843
844 // create a new output Decision object, backed by the 'decisions' container.
846
847 std::vector<const DecisionIDContainer*> previousDecisionIDs;
848 for (const size_t& i : state.trigBphysMuonIndices.at(dimuonIndex)) {
849 const auto& muon = state.muons.at(i);
850 // attach all previous decisions: if the same previous decision is called twice, that's fine - internally takes care of that
851 // we already have an array of links to the previous decisions, so there is no need to use TrigCompositeUtils::linkToPrevious()
853 previousDecisionIDs.push_back(&muon.decisionIDs);
854 }
855
856 // set mandatory link to the trigger object
858
859 for (const auto& tool : hypoTools()) {
860 ATH_MSG_DEBUG( "Go to " << tool );
861 ATH_CHECK( tool->decideOnSingleObject(decision, previousDecisionIDs) );
862 }
863 }
864
865 return StatusCode::SUCCESS;
866}
#define ATH_CHECK
Evaluate an expression and check for errors.
#define ATH_MSG_ERROR(x)
ToolHandleArray< ComboHypoToolBase > & hypoTools()
Definition ComboHypo.h:45
const T * get(size_type n) const
Access an element, as an rvalue.
TrigCompositeUtils::DecisionContainer & decisions()
xAOD::TrigBphysContainer & trigBphysCollection()
std::vector< Muon > muons
xAOD::VertexContainer dimuons
std::vector< std::array< size_t, 2 > > trigBphysMuonIndices
const TrigBphys_v1 * lowerChain() const
accessor method: lowerChain decay particle
bool setObjectLink(const std::string &name, const ElementLink< CONTAINER > &link)
Set the link to an object.
bool addObjectCollectionLinks(const std::string &collectionName, const std::vector< ElementLink< CONTAINER > > &links)
Add links to multiple objects within a collection. Performs de-duplication.
const std::string & featureString()
const std::string & seedString()
TrigBphys_v1 TrigBphys
Definition TrigBphys.h:18
Vertex_v1 Vertex
Define the latest version of the vertex class.
TrigBphysContainer_v1 TrigBphysContainer

◆ decisionsInput()

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

Definition at line 41 of file ComboHypo.h.

41{ return m_inputs; }

◆ decisionsOutput()

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

Definition at line 42 of file ComboHypo.h.

42{ 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.

158 {
160 hndl.value(),
161 hndl.documentation());
162
163 }
Gaudi::Details::PropertyBase & declareProperty(Gaudi::Property< T, V, H > &t)

◆ declareProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::declareProperty ( Gaudi::Property< T, V, H > & t)
inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

145 {
146 typedef typename SG::HandleClassifier<T>::type htype;
148 }
Gaudi::Details::PropertyBase & declareGaudiProperty(Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
specialization for handling Gaudi::Property<SG::VarHandleKey>

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

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

◆ execute()

StatusCode TrigBmumuxComboHypo::execute ( const EventContext & context) const
overridevirtual

Reimplemented from ComboHypo.

Definition at line 100 of file TrigBmumuxComboHypo.cxx.

100 {
101
102 ATH_MSG_DEBUG( "TrigBmumuxComboHypo::execute() starts" );
103
104 ATH_MSG_DEBUG( "decision input key: " << decisionsInput().at(0).key() );
105 auto previousDecisionsHandle = SG::makeHandle(decisionsInput().at(0), context);
106 ATH_CHECK( previousDecisionsHandle.isValid() );
107 ATH_MSG_DEBUG( "Running with " << previousDecisionsHandle->size() << " previous decisions" );
108
109 SG::WriteHandle<DecisionContainer> outputDecisionsHandle = TrigCompositeUtils::createAndStore(decisionsOutput().at(0), context);
110
111 auto trigBphysHandle = SG::makeHandle(m_trigBphysContainerKey, context);
112 ATH_CHECK( trigBphysHandle.record(std::make_unique<xAOD::TrigBphysContainer>(),
113 std::make_unique<xAOD::TrigBphysAuxContainer>()) );
114
115 SG::ReadCondHandle<InDet::BeamSpotData> beamSpotHandle {m_beamSpotKey, context};
116 ATH_CHECK( beamSpotHandle.isValid() );
117
118 auto state = std::make_unique<TrigBmumuxState>(context, *previousDecisionsHandle, *outputDecisionsHandle, trigBphysHandle.ptr(), *beamSpotHandle);
119
122
123 if (!state->dimuons.empty()) {
127 }
128
129 ATH_MSG_DEBUG( "TrigBmumuxComboHypo::execute() terminates with StatusCode::SUCCESS" );
130 return StatusCode::SUCCESS;
131}
const SG::WriteHandleKeyArray< TrigCompositeUtils::DecisionContainer > & decisionsOutput() const
Definition ComboHypo.h:42
const SG::ReadHandleKeyArray< TrigCompositeUtils::DecisionContainer > & decisionsInput() const
Definition ComboHypo.h:41
SG::ReadCondHandleKey< InDet::BeamSpotData > m_beamSpotKey
SG::WriteHandleKey< xAOD::TrigBphysContainer > m_trigBphysContainerKey
StatusCode findBmumuxCandidates(TrigBmumuxState &) const
Find B decays by appling next three subprocedures to each found dimuon candidate.
StatusCode mergeMuonsFromDecisions(TrigBmumuxState &) const
Go through state.previousDecisions(), fetch xAOD::Muons objects attached to decisions and save links ...
StatusCode mergeTracksFromViews(TrigBmumuxState &) const
Go through state.previousDecisions() and fetch xAOD::TrackParticle objects associated with the neares...
StatusCode createDecisionObjects(TrigBmumuxState &) const
Create a decision for each xAOD::TrigBphys object from state.trigBphysCollection() and save it to sta...
StatusCode findDimuonCandidates(TrigBmumuxState &) const
Make all possible dimuon combinations from state.muons(), fit muon InDet tracks to the common vertex,...

◆ 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]chainLegIdThe HLT::Identifer of the chain (leg) we're extracting features for.
[in]ELThe 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]featureKeyType-less SG Key hash of the collection hosting the Decision node's feature .
[out]featureIndexIndex inside the featureKey collection.
[out]roiKeyType-less SG Key hash of the collection hosting the Decision node's initial ROI collection.
[out]roiIndexIndex inside the roiKey collection.
[out]roiIsFullscanFlag 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]objectRequestsNoMultiplicityCheckFlag 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]priorFeaturesMapData 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.

387{
388 // Return collections for the findLinks call.
389 // 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.
390
391 // Construct a sub-graph following just this leg back through the nav
392 DecisionIDContainer chainLegIdSet = {chainLegId.numeric()};
393 TrigCompositeUtils::NavGraph subGraph;
394 recursiveGetDecisions((*dEL), subGraph, chainLegIdSet, /*enforceDecisionOnStartNode =*/ true);
395
396 if (subGraph.finalNodes().size() != 1) {
397 ATH_MSG_ERROR("We are only expecting to search from a single navigation node in extractFeatureAndRoI");
398 return StatusCode::FAILURE;
399 }
400 const NavGraphNode* start = *(subGraph.finalNodes().begin());
401
402 std::vector<SG::sgkey_t> keys;
403 std::vector<uint32_t> clids; // We don't care about the class ID. This part gets ignored.
404 std::vector<Decision::index_type> indicies;
405 std::vector<const Decision*> sources;
406
407 std::set<const Decision*> fullyExploredFrom; // This is a cache which typelessFindLinks will use to avoid re-visiting already explored regions of the graph
408 // Note: This call to typelessFindLinks is exploring from a NavGraphNode* rather than a Decision*,
409 // this indicates that the search is restricted to a sub-graph (specifically, only following one chain-leg)
410 const bool foundFeature = typelessFindLinks(start, featureString(), keys, clids, indicies, sources, TrigDefs::allFeaturesOfType, &fullyExploredFrom);
411
412 const Decision* featureSource = nullptr;
413 // The "most recent" feature (from the step just run) is the one we find first. Hence it's at index 0
414 if (foundFeature) {
415 featureKey = keys.at(0);
416 featureIndex = indicies.at(0);
417 featureSource = sources.at(0);
418 }
419
420 objectRequestsNoMultiplicityCheck = (featureSource and featureSource->hasDetail<int32_t>("noCombo") and featureSource->getDetail<int32_t>("noCombo") == 1);
421
422 if (foundFeature and priorFeaturesMap.count(featureKey + featureIndex) == 0) {
423 const std::string* key_str = evtStore()->keyToString(featureKey);
424 ATH_MSG_DEBUG("Note: Will use feature hash " << featureKey + featureIndex << ", for " << (key_str ? *key_str : "UNKNOWN") << " index=" << featureIndex);
425 // Use the deep-search data to look further back than .at(0)
426 // Here's where we keep the record of the features in previous steps. Step ordering is unimportant, we can use a set.
427 if (keys.size() > 1) {
428 for (size_t i = 1; i < keys.size(); ++i) { // Skip the 1st entry, this will be equal to featureKey and featureIndex from typelessFindLink above.
429 // featureKey + featureIndex should be considered as equivalent to a per-feature hash (featureKey is a real hash, featureIndex is an offset index)
430 if (featureKey + featureIndex == keys.at(i) + indicies.at(i)) {
431 continue; // Do not add the case where a feature is re-attached to more than one step.
432 }
433 priorFeaturesMap[featureKey + featureIndex].insert(keys.at(i) + indicies.at(i));
434 }
435 } else { // Exactly one feature. Make a note of this by inserting an empty set, such that we don't do this search again.
436 priorFeaturesMap.insert( std::pair<uint32_t, std::set<uint32_t>>(featureKey + featureIndex, std::set<uint32_t>()) );
437 }
438 }
439
440 // Try and get seeding ROI data too.
441 uint32_t roiClid{0}; // Unused
442 const Decision* roiSource{nullptr}; // Unused
443 const bool foundROI = typelessFindLink(subGraph, initialRoIString(), roiKey, roiClid, roiIndex, roiSource);
444 if (foundROI) {
445 ElementLink<TrigRoiDescriptorCollection> roiEL(roiKey, roiIndex);
446 ATH_CHECK( roiEL.isValid() );
447 roiIsFullscan = (*(roiEL))->isFullscan();
448 if (!foundFeature) {
449 const std::string* roi_str = evtStore()->keyToString(roiKey);
450 ATH_MSG_DEBUG("Note: Located fallback-ROI, if used this will have feature hash =" << roiKey + roiIndex << ", for " << (roi_str ? *roi_str : "UNKNOWN") << " index=" << roiIndex);
451 }
452 }
453
454 if (!foundFeature && !foundROI) {
455 ATH_MSG_WARNING("Did not find the feature or initialRoI for " << dEL.dataID() << " index " << dEL.index());
456 }
457
458 return StatusCode::SUCCESS;
459}
#define ATH_MSG_WARNING(x)
const std::vector< NavGraphNode * > & finalNodes() const
Get all final nodes.
Definition NavGraph.cxx:99
bool hasDetail(const std::string &name) const
Check if a given type of detail is available.
bool getDetail(const std::string &name, TYPE &value) const
Get an TYPE detail from the object.
void recursiveGetDecisions(const Decision *start, NavGraph &navGraph, const DecisionIDContainer &ids, const bool enforceDecisionOnStartNode)
Search back in time from "node" and locate all paths back through Decision objects for a given chain.
bool typelessFindLinks(const Decision *start, const std::string &linkName, std::vector< sgkey_t > &keyVec, std::vector< CLID > &clidVec, std::vector< Decision::index_type > &indexVec, std::vector< const Decision * > &sourceVec, const unsigned int behaviour, std::set< const Decision * > *fullyExploredFrom)
search back the TC links for the object of type T linked to the one of TC (recursively) Returns the l...
bool typelessFindLink(const Decision *start, const std::string &linkName, sgkey_t &key, CLID &clid, Decision::index_type &index, const Decision *&source, const bool suppressMultipleLinksWarning)
Perform a recursive search for ElementLinks of any time and name 'linkName', starting from Decision o...
static const unsigned int allFeaturesOfType
Run 3 "enum". Return all features along legs (still with type and container checks)
setEventNumber uint32_t

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

90{
91 // If we didn't find any symlinks to add, just return the collection
92 // from the base class. Otherwise, return the extended collection.
93 if (!m_extendedExtraObjects.empty()) {
95 }
97}
An algorithm that can be simultaneously executed in multiple threads.

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

462 {
463 for ( size_t inputContainerIndex = 0; inputContainerIndex < m_inputs.size(); ++inputContainerIndex ) {
464 auto inputHandle = SG::makeHandle( m_inputs.at(inputContainerIndex), context );
465 if ( !inputHandle.isValid() ) {
466 ATH_MSG_ERROR( "No input ReadHandle from " << inputHandle.key() );
467 return StatusCode::FAILURE;
468 }
469 ATH_MSG_DEBUG( "-- Found ReadHandle from " << inputHandle.key() <<" with "<< inputHandle->size() << " elements:" );
470 for ( const Decision* decision : *inputHandle ) {
471 ATH_MSG_DEBUG( "-- -- Input Decision #"<< decision->index() <<" with "<< decisionIDs( decision ).size() << " active IDs. Populating the multiplicity map:" );
472 for ( const DecisionID id: decisionIDs( decision ) ) {
473
474 // Handles regular and multi-leg case
475 const auto& [chainName, chainLeg] = getNameAndIndexFromLeg(HLT::Identifier(id).name());
476
477 // We need to check if we are configured to accept DecisionObjects passing 'chainName' ...
478 Combo::LegMap::const_iterator it = m_legToInputCollectionMap.find(chainName);
479 if (it == m_legToInputCollectionMap.end()) {
480 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.");
481 continue;
482 }
483
484 // ... and if so we need to further check that we are accepting passing IDs for chainLeg on the current inputContainerIndex
485 const std::vector<int>& legToInputCollectionIndex = it->second;
486 const size_t requiredInputContainerIndex = static_cast<size_t>(legToInputCollectionIndex.at(chainLeg));
487 if (requiredInputContainerIndex != inputContainerIndex) {
488 ATH_MSG_VERBOSE("-- -- -- Ignoring the DecisionID " << id << " on leg " << chainLeg << " as we are only permitted to accept passing objects on leg #" << chainLeg << " of " << chainName
489 << " which come from input collection index " << requiredInputContainerIndex << " (which is " << m_inputs.at(requiredInputContainerIndex).key() << ")"
490 << ". Not the current index " << inputContainerIndex << " (which is " << m_inputs.at(inputContainerIndex).key() << ")");
491 continue;
492 }
493
494 ATH_MSG_DEBUG( " ++++ " << HLT::Identifier( id ) );
495 dmap[id].push_back( TrigCompositeUtils::decisionToElementLink(decision, context) );
496 }
497 }
498 }
499
500 if (msgLvl(MSG::DEBUG)){
501 ATH_MSG_DEBUG( "Decision map filled :" );
502 size_t legCount = 0;
503 for (const auto& entry: dmap){
504 ATH_MSG_DEBUG("leg ["<<legCount<<"]: ");
505 const std::vector<ElementLink<DecisionContainer>>& decisions = entry.second;
506 ATH_MSG_DEBUG(" ++++ " << HLT::Identifier( entry.first ) <<" Number Decisions: "<< decisions.size());
507 for (const ElementLink<DecisionContainer>& d : decisions){
508 ATH_MSG_DEBUG(" Decision: (ContainerKey:"<<d.dataID()<<", DecisionElementIndex:"<<d.index()<<")");
509 }
510 legCount++;
511 }
512 }
513
514
515 return StatusCode::SUCCESS;
516}
#define ATH_MSG_VERBOSE(x)
Gaudi::Property< Combo::LegMap > m_legToInputCollectionMap
Definition ComboHypo.h:59
std::pair< std::string, int32_t > getNameAndIndexFromLeg(const std::string &name)
Extract the name and numeric index of a leg identifier.

◆ filterPassed()

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

Definition at line 96 of file AthCommonReentrantAlgorithm.h.

96 {
97 return execState( ctx ).filterPassed();
98 }
virtual bool filterPassed(const EventContext &ctx) const

◆ findBmumuxCandidates()

StatusCode TrigBmumuxComboHypo::findBmumuxCandidates ( TrigBmumuxState & state) const
private

Find B decays by appling next three subprocedures to each found dimuon candidate.

Definition at line 311 of file TrigBmumuxComboHypo.cxx.

311 {
312
313 std::vector<int> nSelectedTrk;
314 auto mon_nTrk = Monitored::Scalar<int>("nTrk", 0);
315 auto mon_nSelectedTrk = Monitored::Collection("nSelectedTrk", nSelectedTrk);
316 auto mon_nBPhysObject = Monitored::Scalar<int>("nBPhysObject", 0);
317 auto group = Monitored::Group(m_monTool, mon_nTrk, mon_nSelectedTrk, mon_nBPhysObject);
318
319 for (size_t dimuonIndex = 0; dimuonIndex < state.dimuons.size(); ++dimuonIndex) {
320
321 ATH_CHECK( findBmumuxCandidates_selectTracks(state, dimuonIndex) );
322 if (state.selectedTracks.empty()) continue;
323 nSelectedTrk.push_back(state.selectedTracks.size());
324
325 ATH_CHECK( findBmumuxCandidates_fit(state, dimuonIndex, true) );
326 ATH_CHECK( findBmumuxCandidates_fastFit(state, dimuonIndex) );
327 ATH_CHECK( findBmumuxCandidates_fit(state, dimuonIndex) );
328 }
329
330 mon_nTrk = state.tracks.size();
331 mon_nBPhysObject = state.trigBphysCollection().size() - state.dimuons.size();
332
333 return StatusCode::SUCCESS;
334}
size_type size() const noexcept
Returns the number of elements in the collection.
StatusCode findBmumuxCandidates_fit(TrigBmumuxState &, size_t dimuonIndex, bool makeCombinations=false) const
Perform fit of B decays for the topologies described above if makeCombinations = false.
StatusCode findBmumuxCandidates_selectTracks(TrigBmumuxState &, size_t dimuonIndex) const
Select tracks in vicinity of given dimuon vertex.
StatusCode findBmumuxCandidates_fastFit(TrigBmumuxState &, size_t dimuonIndex) const
Go through (dimuon+track) and (track+track) combinations found by findBmumuxCandidates_fit(makeCombin...
ToolHandle< GenericMonitoringTool > m_monTool
std::vector< ElementLink< xAOD::TrackParticleContainer > > selectedTracks
std::vector< ElementLink< xAOD::TrackParticleContainer > > tracks
ValuesCollection< T > Collection(std::string name, const T &collection)
Declare a monitored (double-convertible) collection.

◆ findBmumuxCandidates_fastFit()

StatusCode TrigBmumuxComboHypo::findBmumuxCandidates_fastFit ( TrigBmumuxState & state,
size_t dimuonIndex ) const
private

Go through (dimuon+track) and (track+track) combinations found by findBmumuxCandidates_fit(makeCombinations = true) Perform fast fit if combination occurred more than five times.

If fast fit fails, put combination into state.badTrackCombinations().

Definition at line 776 of file TrigBmumuxComboHypo.cxx.

776 {
777
778 state.badTrackCombinations.clear();
779
780 const xAOD::Vertex* dimuon = state.dimuons.get(dimuonIndex);
781
782 // {mu1, mu2, trk1}
783 std::vector<ElementLink<xAOD::TrackParticleContainer>> trackParticleLinks_2mu1trk(dimuon->trackParticleLinks());
784 trackParticleLinks_2mu1trk.emplace_back();
785
786 // {trk1, trk2}
787 std::vector<ElementLink<xAOD::TrackParticleContainer>> trackParticleLinks_2trk(2);
788
789 size_t n = state.selectedTracks.size();
790 size_t iterations = 0;
791 for (const auto& item : state.trackCombinations) {
792 if (item.second < 5) continue;
793
794 size_t key = item.first;
795 if (key < n) { // dimuon + track
796 trackParticleLinks_2mu1trk[2] = state.selectedTracks[key];
797 auto vertex = fit(state.context(), trackParticleLinks_2mu1trk, kFastFit_2mu1trk, dimuon);
798 iterations++;
799 if (!vertex || vertex->chiSquared() > m_fastFit_2mu1trk_chi2) state.badTrackCombinations.push_back(key);
800 }
801 else { // track + track
802 trackParticleLinks_2trk[0] = state.selectedTracks[key % n];
803 trackParticleLinks_2trk[1] = state.selectedTracks[key / n];
804 auto vertex = fit(state.context(), trackParticleLinks_2trk, kFastFit_2trk);
805 iterations++;
806 if (!vertex || vertex->chiSquared() > m_fastFit_2trk_chi2) state.badTrackCombinations.push_back(key);
807 }
808 }
809 std::sort(state.badTrackCombinations.begin(), state.badTrackCombinations.end());
810 ATH_MSG_DEBUG( "Fast fit found " << state.badTrackCombinations.size() << " bad combinations after " << iterations << " iterations" );
811
812 return StatusCode::SUCCESS;
813}
const EventContext & context() const
std::unique_ptr< xAOD::Vertex > fit(const EventContext &context, const std::vector< ElementLink< xAOD::TrackParticleContainer > > &trackParticleLinks, Decay decay=kPsi_2mu, const xAOD::Vertex *dimuon=nullptr) const
Perform a vertex fit on selected tracks.
Gaudi::Property< double > m_fastFit_2mu1trk_chi2
Gaudi::Property< double > m_fastFit_2trk_chi2
std::map< size_t, size_t > trackCombinations
std::vector< size_t > badTrackCombinations
const TrackParticleLinks_t & trackParticleLinks() const
Get all the particles associated with the vertex.
void sort(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
Specialization of sort for DataVector/List.

◆ findBmumuxCandidates_fit()

StatusCode TrigBmumuxComboHypo::findBmumuxCandidates_fit ( TrigBmumuxState & state,
size_t dimuonIndex,
bool makeCombinations = false ) const
private

Perform fit of B decays for the topologies described above if makeCombinations = false.

Otherwise add simple combinations to state.trackCombinations().

Definition at line 394 of file TrigBmumuxComboHypo.cxx.

394 {
395
396 const auto& selectedTracks = state.selectedTracks;
397 if (makeCombinations) state.trackCombinations.clear();
398
399 const xAOD::Vertex* dimuon = state.dimuons.get(dimuonIndex);
400 auto dimuonTriggerObjectEL = ElementLink<xAOD::TrigBphysContainer>(state.trigBphysCollection(), dimuonIndex);
401 ATH_CHECK( dimuonTriggerObjectEL.isValid() );
402
403 // vtx1 = {mu1, mu2, trk1}
404 std::vector<ElementLink<xAOD::TrackParticleContainer>> trackParticleLinks_vtx1(dimuon->trackParticleLinks());
405 trackParticleLinks_vtx1.emplace_back();
406
407 // vtx2 = {mu1, mu2, trk1, trk2}
408 std::vector<ElementLink<xAOD::TrackParticleContainer>> trackParticleLinks_vtx2(trackParticleLinks_vtx1);
409 trackParticleLinks_vtx2.emplace_back();
410
411 // vtx3 = {trk1, trk2, trk3}
412 std::vector<ElementLink<xAOD::TrackParticleContainer>> trackParticleLinks_vtx3(3);
413
414 const xAOD::TrackParticle* mu1 = *trackParticleLinks_vtx1[0];
415 const xAOD::TrackParticle* mu2 = *trackParticleLinks_vtx1[1];
416 auto p_dimuon = mu1->genvecP4().SetM(PDG::mMuon) + mu2->genvecP4().SetM(PDG::mMuon);
417
418 size_t iterations = 0;
419 size_t nTrigBphysObjects = state.trigBphysCollection().size();
420 bool isOverWarningThreshold = false;
421 // dimuon + 1 track
422 for (size_t itrk1 = 0; itrk1 < selectedTracks.size(); ++itrk1) {
423 const xAOD::TrackParticle* trk1 = *selectedTracks[itrk1];
424
425 trackParticleLinks_vtx1[2] = selectedTracks[itrk1];
426 auto p_trk1 = trk1->genvecP4();
427 auto charge1 = trk1->charge();
428
429 std::unique_ptr<xAOD::Vertex> vtx1;
430 bool makeFit_vtx1 = !makeCombinations;
431 bool passFastFit_vtx1 = (!makeCombinations && !state.isBadCombination(itrk1));
432
433 // B+ -> mu+ mu- K+
434 if (m_BplusToMuMuKaon &&
435 p_trk1.Pt() > m_BplusToMuMuKaon_minKaonPt &&
436 isInMassRange((p_dimuon + p_trk1.SetM(PDG::mKaon)).M(), m_BplusToMuMuKaon_massRange)) {
437
438 if (makeCombinations && m_BplusToMuMuKaon_useFastFit) state.addTrackCombination(itrk1);
439 if (!vtx1 && makeFit_vtx1 && (passFastFit_vtx1 || !m_BplusToMuMuKaon_useFastFit)) {
440 vtx1 = fit(state.context(), trackParticleLinks_vtx1, kB_2mu1trk, dimuon);
441 makeFit_vtx1 = false;
442 ++iterations;
443 }
444 if (vtx1 && vtx1->chiSquared() < m_BplusToMuMuKaon_chi2) {
445 xAOD::TrigBphys* trigBphys = makeTriggerObject(state, *vtx1, xAOD::TrigBphys::BKMUMU, {PDG::mMuon, PDG::mMuon, PDG::mKaon}, dimuonTriggerObjectEL);
446 ATH_CHECK( state.addTriggerObject(trigBphys) );
447 }
448 }
449
450 // B_c+ -> J/psi(-> mu+ mu-) pi+
451 if (m_BcToMuMuPion &&
452 p_trk1.Pt() > m_BcToMuMuPion_minPionPt &&
454 isInMassRange((p_dimuon + p_trk1.SetM(PDG::mPion)).M() - p_dimuon.M() + PDG::mJpsi, m_BcToMuMuPion_massRange)) {
455
456 if (makeCombinations && m_BcToMuMuPion_useFastFit) state.addTrackCombination(itrk1);
457 if (!vtx1 && makeFit_vtx1 && (passFastFit_vtx1 || !m_BcToMuMuPion_useFastFit)) {
458 vtx1 = fit(state.context(), trackParticleLinks_vtx1, kB_2mu1trk, dimuon);
459 makeFit_vtx1 = false;
460 ++iterations;
461 }
462 if (vtx1 && vtx1->chiSquared() < m_BcToMuMuPion_chi2) {
463 xAOD::TrigBphys* trigBphys = makeTriggerObject(state, *vtx1, xAOD::TrigBphys::BCPIMUMU, {PDG::mMuon, PDG::mMuon, PDG::mPion}, dimuonTriggerObjectEL);
464 ATH_CHECK( state.addTriggerObject(trigBphys) );
465 }
466 }
467 vtx1.reset();
468
469 // dimuon + 2 tracks
470 for (size_t itrk2 = itrk1 + 1; itrk2 < selectedTracks.size(); ++itrk2) {
471 const xAOD::TrackParticle* trk2 = *selectedTracks[itrk2];
472
473 trackParticleLinks_vtx2[2] = selectedTracks[itrk1];
474 trackParticleLinks_vtx2[3] = selectedTracks[itrk2];
475 auto p_trk2 = trk2->genvecP4();
476 auto charge2 = trk2->charge();
477
478 std::unique_ptr<xAOD::Vertex> vtx2;
479 bool makeFit_vtx2 = !makeCombinations;
480 bool passFastFit_vtx2 = (!makeCombinations && !state.isBadCombination(itrk1) && !state.isBadCombination(itrk2));
481
482 // B_s0 -> mu+ mu- phi(-> K+ K-)
483 if (m_BsToMuMuPhi1020 &&
484 (!m_BsToMuMuPhi1020_rejectSameChargeTracks || charge1 * charge2 < 0.) &&
485 p_trk1.Pt() > m_BsToMuMuPhi1020_minKaonPt &&
486 p_trk2.Pt() > m_BsToMuMuPhi1020_minKaonPt &&
487 isInMassRange((p_trk1.SetM(PDG::mKaon) + p_trk2.SetM(PDG::mKaon)).M(), m_BsToMuMuPhi1020_phiMassRange) &&
488 isInMassRange((p_dimuon + p_trk1.SetM(PDG::mKaon) + p_trk2.SetM(PDG::mKaon)).M(), m_BsToMuMuPhi1020_massRange)) {
489
490 if (makeCombinations && m_BsToMuMuPhi1020_useFastFit) {
491 state.addTrackCombination(itrk1);
492 state.addTrackCombination(itrk2);
493 }
494 if (!vtx2 && makeFit_vtx2 && (passFastFit_vtx2 || !m_BsToMuMuPhi1020_useFastFit)) {
495 vtx2 = fit(state.context(), trackParticleLinks_vtx2, kB_2mu2trk, dimuon);
496 makeFit_vtx2 = false;
497 ++iterations;
498 }
499 if (vtx2 && vtx2->chiSquared() < m_BsToMuMuPhi1020_chi2) {
500 xAOD::TrigBphys* trigBphys = makeTriggerObject(state, *vtx2, xAOD::TrigBphys::BSPHIMUMU, {PDG::mMuon, PDG::mMuon, PDG::mKaon, PDG::mKaon}, dimuonTriggerObjectEL);
501 ATH_CHECK( state.addTriggerObject(trigBphys) );
502 }
503 }
504
505 // B0 -> mu+ mu- K*0(-> K+ pi-)
506 if (m_BdToMuMuKstar0 &&
507 (!m_BdToMuMuKstar0_rejectSameChargeTracks || charge1 * charge2 < 0.) &&
508 p_trk1.Pt() > m_BdToMuMuKstar0_minKaonPt &&
509 p_trk2.Pt() > m_BdToMuMuKstar0_minPionPt &&
510 isInMassRange((p_trk1.SetM(PDG::mKaon) + p_trk2.SetM(PDG::mPion)).M(), m_BdToMuMuKstar0_KstarMassRange) &&
511 isInMassRange((p_dimuon + p_trk1.SetM(PDG::mKaon) + p_trk2.SetM(PDG::mPion)).M(), m_BdToMuMuKstar0_massRange)) {
512
513 if (makeCombinations && m_BdToMuMuKstar0_useFastFit) {
514 state.addTrackCombination(itrk1);
515 state.addTrackCombination(itrk2);
516 }
517 if (!vtx2 && makeFit_vtx2 && (passFastFit_vtx2 || !m_BdToMuMuKstar0_useFastFit)) {
518 vtx2 = fit(state.context(), trackParticleLinks_vtx2, kB_2mu2trk, dimuon);
519 makeFit_vtx2 = false;
520 ++iterations;
521 }
522 if (vtx2 && vtx2->chiSquared() < m_BdToMuMuKstar0_chi2) {
523 xAOD::TrigBphys* trigBphys = makeTriggerObject(state, *vtx2, xAOD::TrigBphys::BDKSTMUMU, {PDG::mMuon, PDG::mMuon, PDG::mKaon, PDG::mPion}, dimuonTriggerObjectEL);
524 ATH_CHECK( state.addTriggerObject(trigBphys) );
525 }
526 }
527 // anti-B0 -> mu+ mu- anti-K*0(-> K- pi+)
528 if (m_BdToMuMuKstar0 &&
529 (!m_BdToMuMuKstar0_rejectSameChargeTracks || charge1 * charge2 < 0.) &&
530 p_trk1.Pt() > m_BdToMuMuKstar0_minPionPt &&
531 p_trk2.Pt() > m_BdToMuMuKstar0_minKaonPt &&
532 isInMassRange((p_trk1.SetM(PDG::mPion) + p_trk2.SetM(PDG::mKaon)).M(), m_BdToMuMuKstar0_KstarMassRange) &&
533 isInMassRange((p_dimuon + p_trk1.SetM(PDG::mPion) + p_trk2.SetM(PDG::mKaon)).M(), m_BdToMuMuKstar0_massRange)) {
534
535 if (makeCombinations && m_BdToMuMuKstar0_useFastFit) {
536 state.addTrackCombination(itrk1);
537 state.addTrackCombination(itrk2);
538 }
539 if (!vtx2 && makeFit_vtx2 && (passFastFit_vtx2 || !m_BdToMuMuKstar0_useFastFit)) {
540 vtx2 = fit(state.context(), trackParticleLinks_vtx2, kB_2mu2trk, dimuon);
541 makeFit_vtx2 = false;
542 ++iterations;
543 }
544 if (vtx2 && vtx2->chiSquared() < m_BdToMuMuKstar0_chi2) {
545 xAOD::TrigBphys* trigBphys = makeTriggerObject(state, *vtx2, xAOD::TrigBphys::BDKSTMUMU, {PDG::mMuon, PDG::mMuon, PDG::mPion, PDG::mKaon}, dimuonTriggerObjectEL);
546 ATH_CHECK( state.addTriggerObject(trigBphys) );
547 }
548 }
549
550 // Lambda_b0 -> J/psi(-> mu+ mu-) p K-
554 (p_trk1.SetM(PDG::mKaon) + p_trk2.SetM(PDG::mPion)).M() > m_LambdaBToMuMuProtonKaon_minKstarMass &&
555 (p_trk1.SetM(PDG::mPion) + p_trk2.SetM(PDG::mKaon)).M() > m_LambdaBToMuMuProtonKaon_minKstarMass &&
557 isInMassRange((p_dimuon + p_trk1.SetM(PDG::mProton) + p_trk2.SetM(PDG::mKaon)).M() - p_dimuon.M() + PDG::mJpsi, m_LambdaBToMuMuProtonKaon_massRange)) {
558
559 if (makeCombinations && m_LambdaBToMuMuProtonKaon_useFastFit) {
560 state.addTrackCombination(itrk1);
561 state.addTrackCombination(itrk2);
562 }
563 if (!vtx2 && makeFit_vtx2 && (passFastFit_vtx2 || !m_LambdaBToMuMuProtonKaon_useFastFit)) {
564 vtx2 = fit(state.context(), trackParticleLinks_vtx2, kB_2mu2trk, dimuon);
565 makeFit_vtx2 = false;
566 ++iterations;
567 }
568 if (vtx2 && vtx2->chiSquared() < m_LambdaBToMuMuProtonKaon_chi2 && Lxy(state.beamSpotPosition(), *vtx2) > 0.) {
569 xAOD::TrigBphys* trigBphys = makeTriggerObject(state, *vtx2, xAOD::TrigBphys::LBPQMUMU, {PDG::mMuon, PDG::mMuon, PDG::mProton, PDG::mKaon}, dimuonTriggerObjectEL);
570 ATH_CHECK( state.addTriggerObject(trigBphys) );
571 }
572 }
573 // anti-Lambda_b0 -> J/psi(-> mu+ mu-) anti-p K+
577 (p_trk1.SetM(PDG::mKaon) + p_trk2.SetM(PDG::mPion)).M() > m_LambdaBToMuMuProtonKaon_minKstarMass &&
578 (p_trk1.SetM(PDG::mPion) + p_trk2.SetM(PDG::mKaon)).M() > m_LambdaBToMuMuProtonKaon_minKstarMass &&
580 isInMassRange((p_dimuon + p_trk1.SetM(PDG::mKaon) + p_trk2.SetM(PDG::mProton)).M() - p_dimuon.M() + PDG::mJpsi, m_LambdaBToMuMuProtonKaon_massRange)) {
581
582 if (makeCombinations && m_LambdaBToMuMuProtonKaon_useFastFit) {
583 state.addTrackCombination(itrk1);
584 state.addTrackCombination(itrk2);
585 }
586 if (!vtx2 && makeFit_vtx2 && (passFastFit_vtx2 || !m_LambdaBToMuMuProtonKaon_useFastFit)) {
587 vtx2 = fit(state.context(), trackParticleLinks_vtx2, kB_2mu2trk, dimuon);
588 makeFit_vtx2 = false;
589 ++iterations;
590 }
591 if (vtx2 && vtx2->chiSquared() < m_LambdaBToMuMuProtonKaon_chi2 && Lxy(state.beamSpotPosition(), *vtx2) > 0.) {
592 xAOD::TrigBphys* trigBphys = makeTriggerObject(state, *vtx2, xAOD::TrigBphys::LBPQMUMU, {PDG::mMuon, PDG::mMuon, PDG::mKaon, PDG::mProton}, dimuonTriggerObjectEL);
593 ATH_CHECK( state.addTriggerObject(trigBphys) );
594 }
595 }
596 vtx2.reset();
597
598 for (size_t itrk3 = 0; itrk3 < selectedTracks.size(); ++itrk3) {
599 const xAOD::TrackParticle* trk3 = *selectedTracks[itrk3];
600 if (itrk3 == itrk1 || itrk3 == itrk2) continue;
601
602 trackParticleLinks_vtx3[0] = selectedTracks[itrk1];
603 trackParticleLinks_vtx3[1] = selectedTracks[itrk2];
604 trackParticleLinks_vtx3[2] = selectedTracks[itrk3];
605 auto p_trk3 = trk3->genvecP4();
606 auto charge3 = trk3->charge();
607
608 std::unique_ptr<xAOD::Vertex> vtx3;
609 bool makeFit_vtx3 = !makeCombinations;
610 bool passFastFit_vtx3 = (!makeCombinations && !state.isBadCombination(itrk1, itrk2, itrk3));
611
612 // B_c+ -> J/psi(-> mu+ mu-) D_s+(->phi(-> K+ K-) pi+)
613 p_trk1.SetM(PDG::mKaon); // D_s+.phi.K+
614 p_trk2.SetM(PDG::mKaon); // D_s+.phi.K-
615 p_trk3.SetM(PDG::mPion); // D_s+.pi+
616 if (m_BcToDsMuMu &&
617 charge1 * charge2 < 0. &&
618 p_trk1.Pt() > m_BcToDsMuMu_minKaonPt &&
619 p_trk2.Pt() > m_BcToDsMuMu_minKaonPt &&
620 p_trk3.Pt() > m_BcToDsMuMu_minPionPt &&
622 isInMassRange((p_trk1 + p_trk2).M(), m_BcToDsMuMu_phiMassRange) &&
623 isInMassRange((p_trk1 + p_trk2 + p_trk3).M(), m_BcToDsMuMu_DsMassRange) &&
624 isInMassRange((p_dimuon + p_trk1 + p_trk2 + p_trk3).M() - p_dimuon.M() + PDG::mJpsi, m_BcToDsMuMu_massRange)) {
625
626 if (makeCombinations && m_BcToDsMuMu_useFastFit) state.addTrackCombination(itrk1, itrk2, itrk3);
627 if (!vtx3 && makeFit_vtx3 && (passFastFit_vtx3 || !m_BcToDsMuMu_useFastFit)) {
628 vtx3 = fit(state.context(), trackParticleLinks_vtx3, kDs, dimuon);
629 makeFit_vtx3 = false;
630 ++iterations;
631 }
632 if (vtx3 && vtx3->chiSquared() < m_BcToDsMuMu_chi2) {
633 xAOD::TrigBphys* trigBphys = makeTriggerObject(state, *vtx3, xAOD::TrigBphys::BCDSMUMU, {PDG::mKaon, PDG::mKaon, PDG::mPion}, dimuonTriggerObjectEL);
634 ATH_CHECK( state.addTriggerObject(trigBphys) );
635 }
636 }
637
638 // B_c+ -> J/psi(-> mu+ mu-) D+(-> K- pi+ pi+)
639 p_trk1.SetM(PDG::mPion); // D+.pi+
640 p_trk2.SetM(PDG::mPion); // D+.pi+
641 p_trk3.SetM(PDG::mKaon); // D+.K-
642 if (m_BcToDplusMuMu &&
643 charge1 * charge2 > 0. && charge1 * charge3 < 0. &&
644 p_trk1.Pt() > m_BcToDplusMuMu_minPionPt &&
645 p_trk2.Pt() > m_BcToDplusMuMu_minPionPt &&
646 p_trk3.Pt() > m_BcToDplusMuMu_minKaonPt &&
648 isInMassRange((p_trk1 + p_trk2 + p_trk3).M(), m_BcToDplusMuMu_DplusMassRange) &&
649 isInMassRange((p_dimuon + p_trk1 + p_trk2 + p_trk3).M() - p_dimuon.M() + PDG::mJpsi, m_BcToDplusMuMu_massRange)) {
650
651 if (makeCombinations && m_BcToDplusMuMu_useFastFit) state.addTrackCombination(itrk1, itrk2, itrk3);
652 if (!vtx3 && makeFit_vtx3 && (passFastFit_vtx3 || !m_BcToDplusMuMu_useFastFit)) {
653 vtx3 = fit(state.context(), trackParticleLinks_vtx3, kDplus, dimuon);
654 makeFit_vtx3 = false;
655 ++iterations;
656 }
657 if (vtx3 && vtx3->chiSquared() < m_BcToDplusMuMu_chi2 && Lxy(dimuon->position(), *vtx3) > 0.) {
658 xAOD::TrigBphys* trigBphys = makeTriggerObject(state, *vtx3, xAOD::TrigBphys::BCDPMUMU, {PDG::mPion, PDG::mPion, PDG::mKaon}, dimuonTriggerObjectEL);
659 ATH_CHECK( state.addTriggerObject(trigBphys) );
660 }
661 }
662 vtx3.reset();
663
664 }
665 }
666
667 if (iterations > m_fitAttemptsWarningThreshold && !isOverWarningThreshold) {
668 ATH_MSG_WARNING( "Dimuon + tracks: " << state.trigBphysCollection().size() - nTrigBphysObjects << " vertices created after " << iterations << " vertex fitter calls" );
669 isOverWarningThreshold = true;
670 }
671 if (iterations > m_fitAttemptsBreakThreshold) {
672 ATH_MSG_WARNING( "Dimuon + tracks: the number of fit attempts has exceeded the limit; breaking the loop at this point" );
673 break;
674 }
675 }
676 ATH_MSG_DEBUG( "Dimuon + tracks: " << state.trigBphysCollection().size() - nTrigBphysObjects << " vertices created after " << iterations << " vertex fitter calls" );
677
678 iterations = 0;
679 nTrigBphysObjects = state.trigBphysCollection().size();
680 isOverWarningThreshold = false;
681 // B_c+ -> J/psi(-> mu+ mu-) D*+(-> D0(-> K- pi+) pi+)
682 if (!makeCombinations && m_BcToDstarMuMu && isInMassRange(p_dimuon.M(), m_BcToDstarMuMu_dimuonMassRange)) {
683 std::vector<ElementLink<xAOD::TrackParticleContainer>> trackParticleLinks_D0(2); // {K-, pi+}
684
685 for (size_t itrk1 = 0; itrk1 < selectedTracks.size(); ++itrk1) {
686 const xAOD::TrackParticle* trk1 = *selectedTracks[itrk1];
687
688 trackParticleLinks_D0[0] = selectedTracks[itrk1];
689 auto p_trk1 = trk1->genvecP4();
690 p_trk1.SetM(PDG::mKaon);
691 auto charge1 = trk1->charge();
692
693 for (size_t itrk2 = 0; itrk2 < selectedTracks.size(); ++itrk2) {
694 if (itrk2 == itrk1) continue;
695 const xAOD::TrackParticle* trk2 = *selectedTracks[itrk2];
696
697 trackParticleLinks_D0[1] = selectedTracks[itrk2];
698 auto p_trk2 = trk2->genvecP4();
699 p_trk2.SetM(PDG::mPion);
700 auto charge2 = trk2->charge();
701
702 std::unique_ptr<xAOD::Vertex> D0;
703 if (charge1 * charge2 < 0. &&
704 p_trk1.Pt() > m_BcToDstarMuMu_minD0KaonPt &&
705 p_trk2.Pt() > m_BcToDstarMuMu_minD0PionPt &&
706 isInMassRange((p_trk1 + p_trk2).M(), m_BcToDstarMuMu_D0MassRange) &&
707 isInMassRange((p_dimuon + p_trk1 + p_trk2).M() - p_dimuon.M() + PDG::mJpsi, m_BcToDstarMuMu_massRange)) {
708 D0 = fit(state.context(), trackParticleLinks_D0, kD0, dimuon);
709 ++iterations;
710 }
711 bool isValidD0 = false;
712 if (D0 && D0->chiSquared() < m_BcToDstarMuMu_chi2 && Lxy(dimuon->position(), *D0) > 0.) {
713 isValidD0 = true;
714 ATH_MSG_DEBUG( "Partially reconstructed B_c+(-> mu+ mu- D0 X) candidate has been created" );
715 xAOD::TrigBphys* trigBphys = makeTriggerObject(state, *D0, xAOD::TrigBphys::DZKPI, s_trkMass[kD0], dimuonTriggerObjectEL);
716 ATH_CHECK( state.addTriggerObject(trigBphys) );
717 }
718
719 if (m_BcToDstarMuMu_makeDstar && isValidD0) { // full B_c+ reconstruction
721
722 for (size_t itrk3 = 0; itrk3 < selectedTracks.size(); ++itrk3) {
723 const xAOD::TrackParticle* trk3 = *selectedTracks[itrk3];
724 if (itrk3 == itrk1 || itrk3 == itrk2) continue;
725
726 // J/psi + pion from D*+
727 trackParticleLinks_vtx1[2] = selectedTracks[itrk3];
728 auto p_trk3 = trk3->genvecP4();
729 p_trk3.SetM(PDG::mPion);
730
731 if (p_trk3.Pt() > m_BcToDstarMuMu_minDstarPionPt &&
733 isInMassRange((p_D0 + p_trk3).M() - p_D0.M() + PDG::mD0, m_BcToDstarMuMu_DstarMassRange)) {
734 auto Bc_vtx1 = fit(state.context(), trackParticleLinks_vtx1, kB_PsiPi);
735 ++iterations;
736
737 if (Bc_vtx1 && Bc_vtx1->chiSquared() < m_BcToDstarMuMu_chi2) {
738 ATH_MSG_DEBUG( "Decay vertex(mu+ mu- D*+.pi+) for B_c+ candidate has been created" );
739 xAOD::TrigBphys* triggerObject_vtx1 = makeTriggerObject(state, *Bc_vtx1, xAOD::TrigBphys::DSTDZPI, s_trkMass[kB_PsiPi], dimuonTriggerObjectEL);
740 auto triggerObjectEL_vtx1 = ElementLink<xAOD::TrigBphysContainer>(state.trigBphysCollection(), state.trigBphysCollection().size());
741 ATH_CHECK( state.addTriggerObject(triggerObject_vtx1) );
742 ATH_CHECK( triggerObjectEL_vtx1.isValid() );
743
744 // refit D0 vertex
745 auto Bc_vtx2 = fit(state.context(), trackParticleLinks_D0, kD0, Bc_vtx1.get());
746 ++iterations;
747 if (Bc_vtx2 && Bc_vtx2->chiSquared() < m_BcToDstarMuMu_chi2) {
748 ATH_MSG_DEBUG( "Fully reconstructed B_c+(-> mu+ mu- D*+) candidate has been created" );
749 xAOD::TrigBphys* triggerObject_vtx2 = makeTriggerObject(state, *Bc_vtx2, xAOD::TrigBphys::BCDSTMUMU, s_trkMass[kD0], triggerObjectEL_vtx1);
750 ATH_CHECK( state.addTriggerObject(triggerObject_vtx2) );
751 }
752 }
753 }
754 }
755 } // end of full B_c+ reconstruction
756
757 }
758
759 if (iterations > m_fitAttemptsWarningThreshold && !isOverWarningThreshold) {
760 ATH_MSG_WARNING( "B_c+ -> mu+ mu- D*+: " << state.trigBphysCollection().size() - nTrigBphysObjects << " vertices created after " << iterations << " vertex fitter calls" );
761 isOverWarningThreshold = true;
762 }
763 if (iterations > m_fitAttemptsBreakThreshold) {
764 ATH_MSG_WARNING( "B_c+ -> mu+ mu- D*+: the number of fit attempts has exceeded the limit; breaking the loop at this point" );
765 break;
766 }
767 }
768 ATH_MSG_DEBUG( "B_c+ -> mu+ mu- D*+: " << state.trigBphysCollection().size() - nTrigBphysObjects << " vertices created after " << iterations << " vertex fitter calls" );
769
770 } // end of B_c+ -> J/psi D*+ topology
771
772 return StatusCode::SUCCESS;
773}
static const int D0
Definition AtlasPID.h:119
int charge3(const T &p)
Definition AtlasPID.h:995
Amg::Vector3D beamSpotPosition() const
Gaudi::Property< bool > m_BcToDplusMuMu_useFastFit
Gaudi::Property< std::pair< double, double > > m_BcToMuMuPion_massRange
Gaudi::Property< float > m_BdToMuMuKstar0_chi2
Gaudi::Property< bool > m_BdToMuMuKstar0_rejectSameChargeTracks
Gaudi::Property< bool > m_BdToMuMuKstar0_useFastFit
Gaudi::Property< double > m_BdToMuMuKstar0_minPionPt
Gaudi::Property< std::pair< double, double > > m_BcToDplusMuMu_massRange
Gaudi::Property< std::pair< double, double > > m_BcToDsMuMu_phiMassRange
Gaudi::Property< std::pair< double, double > > m_BcToDstarMuMu_D0MassRange
Gaudi::Property< std::pair< double, double > > m_BcToDplusMuMu_DplusMassRange
Gaudi::Property< bool > m_BcToDsMuMu
Gaudi::Property< bool > m_BcToMuMuPion
Gaudi::Property< double > m_BplusToMuMuKaon_minKaonPt
Gaudi::Property< std::pair< double, double > > m_BsToMuMuPhi1020_massRange
Gaudi::Property< double > m_BcToDsMuMu_minPionPt
Gaudi::Property< std::pair< double, double > > m_BdToMuMuKstar0_massRange
Gaudi::Property< bool > m_LambdaBToMuMuProtonKaon
Gaudi::Property< double > m_BcToMuMuPion_minPionPt
Gaudi::Property< float > m_BsToMuMuPhi1020_chi2
Gaudi::Property< bool > m_BcToDsMuMu_useFastFit
Gaudi::Property< double > m_BsToMuMuPhi1020_minKaonPt
Gaudi::Property< std::pair< double, double > > m_BsToMuMuPhi1020_phiMassRange
Gaudi::Property< float > m_BcToDsMuMu_chi2
Gaudi::Property< std::pair< double, double > > m_BplusToMuMuKaon_massRange
Gaudi::Property< std::pair< double, double > > m_BcToDsMuMu_DsMassRange
Gaudi::Property< float > m_BcToMuMuPion_chi2
Gaudi::Property< double > m_BcToDstarMuMu_minD0KaonPt
Gaudi::Property< double > m_BdToMuMuKstar0_minKaonPt
double Lxy(const Amg::Vector3D &productionVertex, const xAOD::Vertex &decayVertex) const
Calculate the Lxy (~distance between vertices) It is defined as the transverse distance between the p...
Gaudi::Property< bool > m_LambdaBToMuMuProtonKaon_useFastFit
Gaudi::Property< std::pair< double, double > > m_LambdaBToMuMuProtonKaon_massRange
Gaudi::Property< float > m_BplusToMuMuKaon_chi2
Gaudi::Property< bool > m_BsToMuMuPhi1020
Gaudi::Property< double > m_LambdaBToMuMuProtonKaon_minKaonPt
Gaudi::Property< bool > m_BplusToMuMuKaon
Gaudi::Property< bool > m_BdToMuMuKstar0
Gaudi::Property< double > m_BcToDstarMuMu_minD0PionPt
Gaudi::Property< std::pair< double, double > > m_BcToDstarMuMu_DstarMassRange
xAOD::TrigBphys * makeTriggerObject(TrigBmumuxState &state, const xAOD::Vertex &vertex, xAOD::TrigBphys::pType type=xAOD::TrigBphys::MULTIMU, const std::vector< double > &trkMass={PDG::mMuon, PDG::mMuon}, const ElementLink< xAOD::TrigBphysContainer > &dimuonLink=ElementLink< xAOD::TrigBphysContainer >()) const
Construct the trigger object that may be stored for debugging or matching.
Gaudi::Property< double > m_BcToDstarMuMu_minDstarPionPt
Gaudi::Property< std::pair< double, double > > m_LambdaBToMuMuProtonKaon_dimuonMassRange
Gaudi::Property< bool > m_BplusToMuMuKaon_useFastFit
Gaudi::Property< bool > m_BsToMuMuPhi1020_useFastFit
Gaudi::Property< std::pair< double, double > > m_BcToDplusMuMu_dimuonMassRange
Gaudi::Property< std::pair< double, double > > m_BcToDsMuMu_massRange
Gaudi::Property< double > m_BcToDplusMuMu_minPionPt
Gaudi::Property< bool > m_BcToDstarMuMu
Gaudi::Property< std::pair< double, double > > m_BdToMuMuKstar0_KstarMassRange
static const std::vector< std::vector< double > > s_trkMass
Gaudi::Property< bool > m_BcToDstarMuMu_makeDstar
Gaudi::Property< std::pair< double, double > > m_BcToDstarMuMu_massRange
Gaudi::Property< double > m_BcToDstarMuMu_maxDstarPionZ0
Gaudi::Property< bool > m_BcToDplusMuMu
Gaudi::Property< double > m_LambdaBToMuMuProtonKaon_minProtonPt
Gaudi::Property< bool > m_BcToMuMuPion_useFastFit
Gaudi::Property< size_t > m_fitAttemptsBreakThreshold
Gaudi::Property< std::pair< double, double > > m_BcToDsMuMu_dimuonMassRange
Gaudi::Property< float > m_BcToDstarMuMu_chi2
Gaudi::Property< size_t > m_fitAttemptsWarningThreshold
Gaudi::Property< float > m_LambdaBToMuMuProtonKaon_chi2
Gaudi::Property< std::pair< double, double > > m_BcToMuMuPion_dimuonMassRange
Gaudi::Property< bool > m_BsToMuMuPhi1020_rejectSameChargeTracks
Gaudi::Property< float > m_BcToDplusMuMu_chi2
bool isInMassRange(double mass, const std::pair< double, double > &range) const
Checks that the given mass value falls into the specified range.
Gaudi::Property< double > m_BcToDplusMuMu_minKaonPt
Gaudi::Property< double > m_LambdaBToMuMuProtonKaon_minKstarMass
Gaudi::Property< std::pair< double, double > > m_BcToDstarMuMu_dimuonMassRange
Gaudi::Property< double > m_BcToDsMuMu_minKaonPt
xAOD::TrackParticle::GenVecFourMom_t momentum(const xAOD::Vertex &vertex, const std::vector< double > &trkMass) const
Calculate 4-momentum of the fitted vertex particle assuming the given masses.
std::map< const xAOD::TrackParticle *, double > selectedTrackZ0
void addTrackCombination(size_t i1)
bool isBadCombination(size_t i1) const
StatusCode addTriggerObject(xAOD::TrigBphys *triggerObject)
ROOT::Math::LorentzVector< ROOT::Math::PxPyPzM4D< double > > GenVecFourMom_t
Base 4 Momentum type for TrackParticle.
GenVecFourMom_t genvecP4() const
The full 4-momentum of the particle : GenVector form.
float charge() const
Returns the charge.
const Amg::Vector3D & position() const
Returns the 3-pos.
TrackParticle_v1 TrackParticle
Reference the current persistent version:

◆ findBmumuxCandidates_selectTracks()

StatusCode TrigBmumuxComboHypo::findBmumuxCandidates_selectTracks ( TrigBmumuxState & state,
size_t dimuonIndex ) const
private

Select tracks in vicinity of given dimuon vertex.

Definition at line 337 of file TrigBmumuxComboHypo.cxx.

337 {
338
339 auto& selectedTracks = state.selectedTracks;
340 auto& selectedTrackZ0 = state.selectedTrackZ0;
341
342 selectedTracks.clear();
343 selectedTrackZ0.clear();
344
345 const xAOD::Vertex* dimuon = state.dimuons.get(dimuonIndex);
346
347 std::vector<const xAOD::Muon*> muons(2, nullptr);
348 const auto& muonIndices = state.trigBphysMuonIndices.at(dimuonIndex);
349 for (size_t i = 0; i < 2; ++i) {
350 const auto& muon = state.muons.at(muonIndices[i]);
351 muons[i] = *muon.link;
352 }
353
354 const xAOD::TrackParticle* mu1 = dimuon->trackParticle(0);
355 const xAOD::TrackParticle* mu2 = dimuon->trackParticle(1);
356
357 // check impact parameter of the track with respect to the fitted dimuon vertex
358 // we can safely omit tracks with large z0
359 state.selectedTracks.reserve(state.tracks.size());
360 for (const auto& trackEL : state.tracks) {
361 if (state.isCompositeRoI && !isInSameRoI(muons[0], *trackEL) && !isInSameRoI(muons[1], *trackEL)) continue;
362 if (m_trkZ0 > 0.) {
363 std::unique_ptr<const Trk::Perigee> perigee(m_trackToVertexTool->perigeeAtVertex(state.context(), **trackEL, dimuon->position()));
364 if (perigee && std::abs(perigee->parameters()[Trk::z0]) < m_trkZ0) {
365 selectedTracks.push_back(trackEL);
366 selectedTrackZ0[*trackEL] = perigee->parameters()[Trk::z0];
367 }
368 }
369 else {
370 selectedTracks.push_back(trackEL);
371 selectedTrackZ0[*trackEL] = -1000.;
372 }
373 }
374
375 // remove muon duplicates
376 if (selectedTracks.size() < 2) {
377 ATH_MSG_DEBUG( "Found no tracks consistent with dimuon vertex " << dimuonIndex );
378 selectedTracks.clear();
379 selectedTrackZ0.clear();
380 return StatusCode::SUCCESS;
381 }
382 std::sort(selectedTracks.begin(), selectedTracks.end(), [p_mu=mu1->genvecP4()](const auto& lhs, const auto& rhs){ return ROOT::Math::VectorUtil::DeltaR(p_mu, (*lhs)->genvecP4()) > ROOT::Math::VectorUtil::DeltaR(p_mu, (*rhs)->genvecP4()); });
383 if (isIdenticalTracks(mu1, *selectedTracks.back())) selectedTracks.pop_back();
384 std::sort(selectedTracks.begin(), selectedTracks.end(), [p_mu=mu2->genvecP4()](const auto& lhs, const auto& rhs){ return ROOT::Math::VectorUtil::DeltaR(p_mu, (*lhs)->genvecP4()) > ROOT::Math::VectorUtil::DeltaR(p_mu, (*rhs)->genvecP4()); });
385 if (isIdenticalTracks(mu2, *selectedTracks.back())) selectedTracks.pop_back();
386 std::sort(selectedTracks.begin(), selectedTracks.end(), [](const auto& lhs, const auto& rhs){ return ((*lhs)->pt() > (*rhs)->pt()); });
387
388 ATH_MSG_DEBUG( "Found " << selectedTracks.size() << " tracks consistent with dimuon vertex " << dimuonIndex );
389
390 return StatusCode::SUCCESS;
391}
ToolHandle< Reco::ITrackToVertex > m_trackToVertexTool
bool isInSameRoI(const xAOD::Muon *, const xAOD::TrackParticle *) const
Attempts to identify if the track is in the same RoI as the muon by comparing the angle with the RoI ...
bool isIdenticalTracks(const xAOD::TrackParticle *lhs, const xAOD::TrackParticle *rhs) const
Attempts to identify identical tracks by selection on DeltaR.
Gaudi::Property< double > m_trkZ0
const TrackParticle * trackParticle(size_t i) const
Get the pointer to a given track that was used in vertex reco.
@ z0
Definition ParamDefs.h:64

◆ findDimuonCandidates()

StatusCode TrigBmumuxComboHypo::findDimuonCandidates ( TrigBmumuxState & state) const
private

Make all possible dimuon combinations from state.muons(), fit muon InDet tracks to the common vertex, dimuon vertices are stored in state.dimuons() and in state.trigBphysCollection() (as xAOD::TrigBphys objects).

Definition at line 239 of file TrigBmumuxComboHypo.cxx.

239 {
240
241 auto mon_nDimuon = Monitored::Scalar<int>("nDimuon", 0);
242 auto group = Monitored::Group(m_monTool, mon_nDimuon);
243
244 const auto& muons = state.muons;
245 std::vector<ElementLink<xAOD::TrackParticleContainer>> trackParticleLinks(2);
246 std::vector<const DecisionIDContainer*> previousDecisionIDs(2, nullptr);
247
248 for (size_t itrk1 = 0; itrk1 < muons.size(); ++itrk1) {
249 const xAOD::Muon* mu1 = *muons[itrk1].link;
251 previousDecisionIDs[0] = &muons[itrk1].decisionIDs;
252 const xAOD::TrackParticle* trk1 = *trackParticleLinks[0];
253 auto p1 = trk1->genvecP4();
254 p1.SetM(PDG::mMuon);
255 auto charge1 = trk1->charge();
256
257 for (size_t itrk2 = itrk1 + 1; itrk2 < muons.size(); ++itrk2) {
258 const xAOD::Muon* mu2 = *muons[itrk2].link;
260 previousDecisionIDs[1] = &muons[itrk2].decisionIDs;
261 const xAOD::TrackParticle* trk2 = *trackParticleLinks[1];
262 auto p2 = trk2->genvecP4();
263 p2.SetM(PDG::mMuon);
264 auto charge2 = trk2->charge();
265
266 double mass = (p1 + p2).M();
267
268 ATH_MSG_DEBUG( "muon 1: " << p1.Pt()<< " / " << p1.Eta() << " / " << p1.Phi() << " / " << trk1->charge() );
269 ATH_MSG_DEBUG( "muon 2: " << p2.Pt()<< " / " << p2.Eta() << " / " << p2.Phi() << " / " << trk2->charge() );
270 ATH_MSG_DEBUG( "track pair mass: " << mass );
271
272 if (m_dimuon_rejectSameChargeTracks && charge1 * charge2 > 0.) {
273 ATH_MSG_DEBUG( "muon pair is rejected by opposite charge check" );
274 continue;
275 }
276
277 if (!passDimuonTrigger(previousDecisionIDs)) {
278 ATH_MSG_DEBUG( "muon pair did not pass passDimuonTrigger() check" );
279 continue;
280 }
281
282 if (!isInMassRange(mass, m_dimuon_massRange)) {
283 ATH_MSG_DEBUG( "muon pair is out of the requested mass range" );
284 continue;
285 }
286
287 // fit muons to the common vertex and pass this vertex to the dimuons collection which also takes the ownership of the created object
288 auto vertex = fit(state.context(), trackParticleLinks);
289 if (!vertex) continue;
290
291 // convert vertex to trigger object and add it to the output xAOD::TrigBphysContainer
292 xAOD::TrigBphys* trigBphys = makeTriggerObject(state, *vertex);
293 if (!trigBphys) {
294 ATH_MSG_ERROR( "xAOD::Vertex could not be converted to xAOD::TrigBphys object: please enable MakeExtendedVertex option in vertex fitter " << m_vertexFitter->name() );
295 return StatusCode::FAILURE;
296 }
297
298 // the dimuon vertex in the xAOD::TrigBphysContainer is used as a reference for the upcoming B-candidates and to fire bBmumux_idperf chain
299 state.dimuons.push_back(vertex.release());
300 state.trigBphysMuonIndices.emplace_back(std::array<size_t, 2>{itrk1, itrk2});
301 state.trigBphysCollection().push_back(trigBphys);
302 }
303 }
304 mon_nDimuon = state.dimuons.size();
305 ATH_MSG_DEBUG( "Found " << state.dimuons.size() << " dimuon candidates" );
306
307 return StatusCode::SUCCESS;
308}
value_type push_back(value_type pElem)
Add an element to the end of the collection.
Gaudi::Property< bool > m_dimuon_rejectSameChargeTracks
ToolHandle< Trk::TrkVKalVrtFitter > m_vertexFitter
bool passDimuonTrigger(const std::vector< const TrigCompositeUtils::DecisionIDContainer * > &previousDecisionIDs) const
Gaudi::Property< std::pair< double, double > > m_dimuon_massRange
const ElementLink< TrackParticleContainer > & inDetTrackParticleLink() const
Returns an ElementLink to the InnerDetector TrackParticle used in identification of this muon.
std::vector< ElementLink< xAOD::TrackParticleContainer > > trackParticleLinks(const xAOD::TauJet *tau, xAOD::TauJetParameters::TauTrackFlag flag=xAOD::TauJetParameters::TauTrackFlag::classifiedCharged)
Muon_v1 Muon
Reference the current persistent version:

◆ fit()

std::unique_ptr< xAOD::Vertex > TrigBmumuxComboHypo::fit ( const EventContext & context,
const std::vector< ElementLink< xAOD::TrackParticleContainer > > & trackParticleLinks,
Decay decay = kPsi_2mu,
const xAOD::Vertex * dimuon = nullptr ) const
private

Perform a vertex fit on selected tracks.

Parameters
contextthe event context used to make the vertex threadsafe.
trackParticleLinksthe trackParticles to fit
decaythe decay enumerator to specify the mass contraints
dimuonThe dimuon vertex position can be used as the initial position to increase effeciency
Returns
The fitted vertex - null if fit fails or is very low quality

Definition at line 869 of file TrigBmumuxComboHypo.cxx.

873 {
874
875 ATH_MSG_VERBOSE( "Perform vertex fit" );
876
877 if (trackParticleLinks.size() < 2) {
878 ATH_MSG_WARNING( "At least two tracks should be given to the vertex fitter" );
879 return nullptr;
880 }
881
882 std::vector<const xAOD::TrackParticle*> tracklist(trackParticleLinks.size(), nullptr);
883 std::transform(trackParticleLinks.begin(), trackParticleLinks.end(), tracklist.begin(),
884 [](const ElementLink<xAOD::TrackParticleContainer>& link){ return *link; });
885
886 Amg::Vector3D startingPoint = Amg::Vector3D::Zero(3);
887 if (dimuon) {
888 startingPoint = Amg::Vector3D(dimuon->x(), dimuon->y(), dimuon->z());
889 }
890 else {
891 if (decay != Decay::kPsi_2mu && decay != Decay::kB_PsiPi && decay != Decay::kFastFit_2trk) {
892 ATH_MSG_WARNING( "Already fitted dimuon vertex should be provided for B -> mu1 mu2 trk1 .. trkN decay as a starting point for fitter" );
893 }
894 int flag = 0;
895 int errorcode = 0;
896 const Trk::Perigee& perigee1 = tracklist[0]->perigeeParameters();
897 const Trk::Perigee& perigee2 = tracklist[1]->perigeeParameters();
898 startingPoint = m_vertexPointEstimator->getCirclesIntersectionPoint(&perigee1, &perigee2, flag, errorcode);
899 if (errorcode != 0) startingPoint = Amg::Vector3D::Zero(3);
900 }
901 ATH_MSG_VERBOSE( "Starting point: (" << startingPoint(0) << ", " << startingPoint(1) << ", " << startingPoint(2) << ")" );
902
903 auto fitterState = m_vertexFitter->makeState(context);
904 m_vertexFitter->setMassInputParticles(s_trkMass[static_cast<size_t>(decay)], *fitterState);
905
906 // the combined momentum of D+/D_s+ candidate is constrained to point to the dimuon vertex
907 if (decay == Decay::kDs || decay == Decay::kDplus || decay == Decay::kD0) {
908 m_vertexFitter->setVertexForConstraint(*dimuon, *fitterState);
909 m_vertexFitter->setCnstType(8, *fitterState);
910 }
911
912 std::unique_ptr<xAOD::Vertex> vertex(m_vertexFitter->fit(tracklist, startingPoint, *fitterState));
913 if (!vertex) {
914 ATH_MSG_VERBOSE( "Vertex fit fails" );
915 return vertex;
916 }
917 if (vertex->chiSquared() > 150. || (decay == Decay::kPsi_2mu && vertex->chiSquared() > m_dimuon_chi2)) {
918 ATH_MSG_VERBOSE( "Fit is successful, but vertex chi2 is too high, we are not going to save it (chi2 = " << vertex->chiSquared() << ")" );
919 vertex.reset();
920 return vertex;
921 }
922 ATH_MSG_VERBOSE( "Fit is successful" );
923
924 // update trackParticleLinks()
925 vertex->clearTracks();
926 vertex->setTrackParticleLinks(trackParticleLinks);
927
928 return vertex;
929}
Gaudi::Property< double > m_dimuon_chi2
ToolHandle< InDet::VertexPointEstimator > m_vertexPointEstimator
float z() const
Returns the z position.
float y() const
Returns the y position.
float x() const
Returns the x position.
Eigen::Matrix< double, 3, 1 > Vector3D
ParametersT< TrackParametersDim, Charged, PerigeeSurface > Perigee
bool flag
Definition master.py:29

◆ hypoTools() [1/2]

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

Definition at line 45 of file ComboHypo.h.

45{ return m_hypoTools; }
ToolHandleArray< ComboHypoToolBase > m_hypoTools
Definition ComboHypo.h:104

◆ hypoTools() [2/2]

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

Definition at line 46 of file ComboHypo.h.

46{ return m_hypoTools; }

◆ initialize()

StatusCode TrigBmumuxComboHypo::initialize ( )
overridevirtual

Reimplemented from ComboHypo.

Definition at line 55 of file TrigBmumuxComboHypo.cxx.

55 {
56 ATH_MSG_DEBUG( "TrigBmumuxComboHypo::initialize()" );
57
59
60 ATH_CHECK( m_muonContainerKey.initialize() );
64 ATH_CHECK( m_trigBphysContainerKey.initialize() );
65 ATH_CHECK( m_beamSpotKey.initialize() );
66
67 ATH_CHECK( m_vertexFitter.retrieve() );
69 ATH_CHECK( m_trackToVertexTool.retrieve() );
70
71 // allowed IDs to filter out incoming decisions at L2 level
72 for (const auto& item : triggerMultiplicityMap()) {
73 const HLT::Identifier id = HLT::Identifier(item.first);
74 m_allowedIDs.insert(id.numeric());
75 if (item.second.size() > 1) {
76 for (size_t i = 0; i < item.second.size(); i++) {
77 m_allowedIDs.insert(TrigCompositeUtils::createLegName(id, i).numeric());
78 }
79 }
80 }
81 if (msgLvl(MSG::DEBUG)) {
82 ATH_MSG_DEBUG( "Allowed decisions:" );
83 for (const DecisionID& id : m_allowedIDs) {
84 ATH_MSG_DEBUG( " +++ " << HLT::Identifier(id) );
85 }
86 }
87
88 if (!m_monTool.empty()) {
89 ATH_CHECK( m_monTool.retrieve() );
90 ATH_MSG_DEBUG( "GenericMonitoringTool name:" << m_monTool );
91 }
92 else {
93 ATH_MSG_DEBUG( "No GenericMonitoringTool configured: no monitoring histograms will be available" );
94 }
95
96 return StatusCode::SUCCESS;
97}
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)
const Combo::MultiplicityReqMap & triggerMultiplicityMap() const
Definition ComboHypo.h:43
virtual StatusCode initialize() override
Definition ComboHypo.cxx:22
TrigCompositeUtils::DecisionIDContainer m_allowedIDs
SG::ReadHandleKey< xAOD::TrackParticleContainer > m_trackParticleContainerKey
SG::ReadHandleKey< xAOD::MuonContainer > m_muonContainerKey
HLT::Identifier createLegName(const HLT::Identifier &chainIdentifier, size_t counter)
Generate the HLT::Identifier which corresponds to a specific leg of a given chain.

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

◆ isIdenticalTracks() [1/2]

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

◆ isIdenticalTracks() [2/2]

bool TrigBmumuxComboHypo::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 1005 of file TrigBmumuxComboHypo.cxx.

1005 {
1006
1007 if (lhs->charge() * rhs->charge() < 0.) return false;
1008 return (ROOT::Math::VectorUtil::DeltaR(lhs->genvecP4(), rhs->genvecP4()) < m_deltaR);
1009}
Gaudi::Property< double > m_deltaR

◆ isInMassRange()

bool TrigBmumuxComboHypo::isInMassRange ( double mass,
const std::pair< double, double > & range ) const
inlineprivate

Checks that the given mass value falls into the specified range.

Definition at line 229 of file TrigBmumuxComboHypo.h.

229{ return (mass > range.first && mass < range.second); }

◆ isInSameRoI()

bool TrigBmumuxComboHypo::isInSameRoI ( const xAOD::Muon * muon,
const xAOD::TrackParticle * track ) const
private

Attempts to identify if the track is in the same RoI as the muon by comparing the angle with the RoI limits.

Returns
true if in same RoI

Definition at line 1018 of file TrigBmumuxComboHypo.cxx.

1018 {
1019
1020 auto p_mu = muon->genvecP4();
1021 auto p_trk = track->genvecP4();
1022 return (ROOT::Math::VectorUtil::DeltaPhi(p_mu, p_trk) < m_roiPhiWidth && std::abs(p_mu.eta() - p_trk.eta()) < m_roiEtaWidth);
1023}
Gaudi::Property< double > m_roiPhiWidth
Gaudi::Property< double > m_roiEtaWidth

◆ legToInputCollectionMap()

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

Definition at line 44 of file ComboHypo.h.

44{ return m_legToInputCollectionMap.value(); }

◆ Lxy()

double TrigBmumuxComboHypo::Lxy ( const Amg::Vector3D & productionVertex,
const xAOD::Vertex & decayVertex ) const
private

Calculate the Lxy (~distance between vertices) It is defined as the transverse distance between the production and decay vertices projected along the transverse momentum of the particle.

Returns
The Lxy value in [mm]

Definition at line 1026 of file TrigBmumuxComboHypo.cxx.

1026 {
1027
1028 XYVector R(decayVertex.x() - productionVertex.x(), decayVertex.y() - productionVertex.y());
1029 XYVector pT;
1030
1031 if (!decayVertex.vxTrackAtVertexAvailable()) return -100.;
1032 const auto& tracks = decayVertex.vxTrackAtVertex();
1033 for (const auto& track : tracks) {
1034 const Trk::TrackParameters* perigee = track.perigeeAtVertex();
1035 if (!perigee) return -100.;
1036 const Amg::Vector3D& momentum = perigee->momentum();
1037 pT += XYVector(momentum.x(), momentum.y());
1038 }
1039 return R.Dot(pT.unit());
1040}
const Amg::Vector3D & momentum() const
Access method for the momentum.
bool vxTrackAtVertexAvailable() const
Check if VxTrackAtVertices are attached to the object.
std::vector< Trk::VxTrackAtVertex > & vxTrackAtVertex()
Non-const access to the VxTrackAtVertex vector.
double R(const INavigable4Momentum *p1, const double v_eta, const double v_phi)
ParametersBase< TrackParametersDim, Charged > TrackParameters

◆ makeTriggerObject()

xAOD::TrigBphys * TrigBmumuxComboHypo::makeTriggerObject ( TrigBmumuxState & state,
const xAOD::Vertex & vertex,
xAOD::TrigBphys::pType type = xAOD::TrigBphys::MULTIMU,
const std::vector< double > & trkMass = {PDG::mMuonPDG::mMuon},
const ElementLink< xAOD::TrigBphysContainer > & dimuonLink = ElementLink<xAOD::TrigBphysContainer>() ) const
private

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

Parameters
stateEvent object containing the current events selections
typedecay type enumerator. Corresponds to EDM definitions
trkMassTrack mass hypothesis for mass calculations
dimuonLinkAssociated dimuon container
Returns
Pointer to the TrigBphys object

Definition at line 932 of file TrigBmumuxComboHypo.cxx.

937 {
938
939 const xAOD::TrigBphys* dimuon = (type != xAOD::TrigBphys::MULTIMU ? *dimuonLink : nullptr);
941
942 // refitted track momentum as a 4-vector for mass hypothesis defined by the given decay value
944 std::vector<xAOD::TrackParticle::GenVecFourMom_t> momenta;
945 if (!vertex.vxTrackAtVertexAvailable()) return nullptr;
946 for (size_t i = 0; i < vertex.vxTrackAtVertex().size(); ++i) {
947 const Trk::TrackParameters* perigee = vertex.vxTrackAtVertex()[i].perigeeAtVertex();
948 if (!perigee) return nullptr;
949 const Amg::Vector3D& p = perigee->momentum();
950 momenta.emplace_back(p.x(), p.y(), p.z(), trkMass[i]);
951 momentum += momenta.back();
952 }
953 if (isCascadeDecay) {
954 momentum += ROOT::Math::PtEtaPhiMVector(dimuon->pt(), dimuon->eta(), dimuon->phi(), dimuon->mass());
955 }
956
957 auto result = new xAOD::TrigBphys();
958 result->makePrivateStore();
959
960 float mass = momentum.M();
961 if (type == xAOD::TrigBphys::BCDSTMUMU) {
962 mass += PDG::mD0 - (momenta[0] + momenta[1]).M();
963 }
964 else if (type != xAOD::TrigBphys::MULTIMU) {
965 mass += PDG::mJpsi - (isCascadeDecay ? dimuon->mass() : (momenta[0] + momenta[1]).M());
966 }
967
968 result->initialise(0, momentum.Eta(), momentum.Phi(), momentum.Pt(), type, mass, xAOD::TrigBphys::EF);
969
970 result->setFitmass(momentum.M());
971 result->setFitx(vertex.x());
972 result->setFity(vertex.y());
973 result->setFitz(vertex.z());
974 result->setFitchi2(vertex.chiSquared());
975 result->setFitndof(vertex.numberDoF());
976
977 Amg::Vector3D productionVertex = (isCascadeDecay ? Amg::Vector3D(dimuon->fitx(), dimuon->fity(), dimuon->fitz()) : state.beamSpotPosition());
978 result->setLxy(Lxy(productionVertex, vertex));
979
980 // set all the particles associated with the decay
981 result->setTrackParticleLinks(vertex.trackParticleLinks());
982
983 // use lowerChainLink() as a link to the preceding dimuon trigger object
984 if (type != xAOD::TrigBphys::MULTIMU) {
985 result->setLowerChainLink(dimuonLink);
986 }
987
989 "TrigBphys object:\n\t " <<
990 "roiId: " << result->roiId() << "\n\t " <<
991 "particleType: " << result->particleType() << "\n\t " <<
992 "level: " << result->level() << "\n\t " <<
993 "eta: " << result->eta() << "\n\t " <<
994 "phi: " << result->phi() << "\n\t " <<
995 "mass: " << result->mass() << "\n\t " <<
996 "fitmass: " << result->fitmass() << "\n\t " <<
997 "chi2/NDF: " << result->fitchi2() << " / " << result->fitndof() << "\n\t " <<
998 "vertex: (" << result->fitx() << ", " << result->fity() << ", " << result->fitz() << ")" << "\n\t " <<
999 "Lxy: " << result->lxy() );
1000
1001 return result;
1002}
if(febId1==febId2)
float pt() const
accessor method: pt
float eta() const
accessor method: eta
float phi() const
accessor method: phi
float fitx() const
accessor method: x position of vertex
float fitz() const
accessor method: z position of vertex
float mass() const
accessor method: mass
float fity() const
accessor method: y position of vertex

◆ mergeMuonsFromDecisions()

StatusCode TrigBmumuxComboHypo::mergeMuonsFromDecisions ( TrigBmumuxState & state) const
private

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

Definition at line 134 of file TrigBmumuxComboHypo.cxx.

134 {
135
136 auto& muons = state.muons;
137 muons.clear();
138
139 // all muons from views are already connected with previous decisions by TrigMuonEFHypoAlg
140 for (const Decision* decision : state.previousDecisions()) {
142 auto muonEL = decision->objectLink<xAOD::MuonContainer>(TrigCompositeUtils::featureString());
143 const xAOD::Muon* muon = *muonEL;
144 if (!muon->trackParticle(xAOD::Muon::TrackParticleType::CombinedTrackParticle)) continue;
145
146 auto decisionEL = TrigCompositeUtils::decisionToElementLink(decision, state.context());
147 auto itr = std::find_if(muons.begin(), muons.end(), [this, muon](const auto& x){ return isIdenticalTracks(muon, *x.link); });
148 if (itr == muons.end()) {
149 muons.push_back({muonEL, std::vector<ElementLink<DecisionContainer>>(1, decisionEL), DecisionIDContainer()});
150 }
151 else {
152 (*itr).decisionLinks.push_back(decisionEL);
153 }
154 }
155
156 // muon->pt() is equal to muon->trackParticle(xAOD::Muon::TrackParticleType::CombinedTrackParticle)->pt()
157 // and the later is used by TrigMuonEFHypoTool for classification of muEFCB candidates
158 std::sort(muons.begin(), muons.end(), [](const auto& lhs, const auto& rhs){ return ((*lhs.link)->pt() > (*rhs.link)->pt()); });
159
160 // for each muon we extract DecisionIDs stored in the associated Decision objects and copy them at muon.decisionIDs
161 for (auto& item : muons) {
162 for (const ElementLink<xAOD::TrigCompositeContainer>& decisionEL : item.decisionLinks) {
163 TrigCompositeUtils::decisionIDs(*decisionEL, item.decisionIDs);
164 }
165 }
166
167 if (msgLvl(MSG::DEBUG)) {
168 ATH_MSG_DEBUG( "Dump found muons before vertex fit: " << muons.size() << " candidates" );
169 for (const auto& item : muons) {
170 const xAOD::Muon* muon = *item.link;
171 const xAOD::TrackParticle* track = *muon->inDetTrackParticleLink();
172 ATH_MSG_DEBUG( " -- muon InDetTrackParticle pt/eta/phi/q: " << track->pt() << " / " << track->eta() << " / " << track->phi() << " / " << track->charge() );
173 ATH_MSG_DEBUG( " muon CombinedTrackParticle pt: " << muon->pt() );
174 ATH_MSG_DEBUG( " allowed decisions:" );
175 for (const DecisionID& id : item.decisionIDs) {
176 ATH_MSG_DEBUG( " +++ " << HLT::Identifier(id) );
177 }
178 }
179 }
180
181 return StatusCode::SUCCESS;
182}
#define x
const TrigCompositeUtils::DecisionContainer & previousDecisions() const
MuonContainer_v1 MuonContainer
Definition of the current "Muon container version".

◆ mergeTracksFromViews()

StatusCode TrigBmumuxComboHypo::mergeTracksFromViews ( TrigBmumuxState & 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 185 of file TrigBmumuxComboHypo.cxx.

185 {
186
187 auto& tracks = state.tracks;
188 tracks.clear();
189
190 size_t viewCounter = 0;
191 for (const Decision* decision : state.previousDecisions()) {
193 ATH_CHECK( viewLinkInfo.isValid() );
194 auto view = *viewLinkInfo.link;
195
197 ATH_CHECK( roiLinkInfo.isValid() );
198 const auto roi = *roiLinkInfo.link;
199
200 auto tracksHandle = ViewHelper::makeHandle(view, m_trackParticleContainerKey, state.context());
201 ATH_CHECK( tracksHandle.isValid() );
202 ATH_MSG_DEBUG( "tracks handle " << m_trackParticleContainerKey << " size: " << tracksHandle->size() );
203
204 std::vector<ElementLink<xAOD::TrackParticleContainer>> tracksFromView;
205 tracksFromView.reserve(tracksHandle->size());
206 for (size_t idx = 0; idx < tracksHandle->size(); ++idx) {
207 tracksFromView.emplace_back(ViewHelper::makeLink<xAOD::TrackParticleContainer>(view, tracksHandle, idx));
208 }
209
210 for (const auto& trackEL : tracksFromView) {
211 const xAOD::TrackParticle* track = *trackEL;
212 if (track->definingParametersCovMatrixVec().empty()) continue;
213
214 if (viewCounter == 0 ||
215 std::find_if(tracks.begin(), tracks.end(),
216 [this, track](const auto& x){ return isIdenticalTracks(track, *x); }) == tracks.end()) {
217 tracks.emplace_back(trackEL);
218 }
219 }
220 viewCounter++;
221 if (roi->composite()) {
222 state.isCompositeRoI = true;
223 break;
224 }
225 }
226 std::sort(tracks.begin(), tracks.end(), [](const auto& lhs, const auto& rhs){ return ((*lhs)->pt() > (*rhs)->pt()); });
227
228 if (msgLvl(MSG::DEBUG)) {
229 ATH_MSG_DEBUG( "Dump found tracks before vertex fit: " << tracks.size() << " candidates" );
230 for (const auto& trackEL : tracks) {
231 const xAOD::TrackParticle* track = *trackEL;
232 ATH_MSG_DEBUG( " -- track pt/eta/phi/q: " << track->pt() << " / " << track->eta() << " / " << track->phi() << " / " << track->charge() );
233 }
234 }
235 return StatusCode::SUCCESS;
236}
const std::string & viewString()
const std::string & roiString()
ElementLink< T > makeLink(const SG::View *view, const SG::ReadHandle< T > &handle, size_t index)
Create EL to a collection in view.
Definition ViewHelper.h:309
auto makeHandle(const SG::View *view, const KEY &key, const EventContext &ctx)
Create a view handle from a handle key.
Definition ViewHelper.h:273

◆ momentum()

xAOD::TrackParticle::GenVecFourMom_t TrigBmumuxComboHypo::momentum ( const xAOD::Vertex & vertex,
const std::vector< double > & trkMass ) const
private

Calculate 4-momentum of the fitted vertex particle assuming the given masses.

Parameters
vertexthe fitted vertex linking to the original tracks
themass hypothesis for the given tracks in the vertex
Returns
The 4-momentum of the vertexed hypothesis

Definition at line 1043 of file TrigBmumuxComboHypo.cxx.

1043 {
1044
1046 for (size_t i = 0; i < vertex.vxTrackAtVertex().size(); ++i) {
1047 const Trk::TrackParameters* perigee = vertex.vxTrackAtVertex()[i].perigeeAtVertex();
1048 const Amg::Vector3D& p = perigee->momentum();
1049 momentum += xAOD::TrackParticle::GenVecFourMom_t(p.x(), p.y(), p.z(), trkMass[i]);
1050 }
1051 return momentum;
1052}

◆ msg()

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

Definition at line 24 of file AthCommonMsg.h.

24 {
25 return this->msgStream();
26 }

◆ msgLvl()

bool AthCommonMsg< Gaudi::Algorithm >::msgLvl ( const MSG::Level lvl) const
inlineinherited

Definition at line 30 of file AthCommonMsg.h.

30 {
31 return this->msgLevel(lvl);
32 }

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

◆ passDimuonTrigger()

bool TrigBmumuxComboHypo::passDimuonTrigger ( const std::vector< const TrigCompositeUtils::DecisionIDContainer * > & previousDecisionIDs) const
private

Definition at line 1055 of file TrigBmumuxComboHypo.cxx.

1055 {
1056
1057 if (previousDecisionIDs.size() != 2) {
1058 ATH_MSG_WARNING( "TrigBmumuxComboHypo::passDimuonTrigger() expects exactly two containers with previous decision IDs" );
1059 return false;
1060 }
1061
1062 for (const auto& tool : hypoTools()) {
1063 const std::vector<HLT::Identifier>& legDecisionIDs = tool->legDecisionIds();
1064 if (legDecisionIDs.size() == 1 && tool->legMultiplicity().at(0) >= 2) {
1065 // trigger with symmetric legs like HLT_2mu4_bBmumux_BsmumuPhi_L12MU4
1066 const DecisionID id = legDecisionIDs[0].numeric();
1067 if (TrigCompositeUtils::passed(id, *previousDecisionIDs[0]) && TrigCompositeUtils::passed(id, *previousDecisionIDs[1])) return true;
1068 }
1069 else if (legDecisionIDs.size() == 2) {
1070 // trigger with asymmetric legs like HLT_mu6_mu4_bBmumux_BsmumuPhi_L1MU6_2MU4
1071 bool direct = true;
1072 bool inverse = true;
1073 for (size_t i = 0; i < 2; ++i) {
1074 if (direct && !TrigCompositeUtils::passed(legDecisionIDs[i].numeric(), *previousDecisionIDs[i])) direct = false;
1075 if (inverse && !TrigCompositeUtils::passed(legDecisionIDs[i].numeric(), *previousDecisionIDs[1-i])) inverse = false;
1076 }
1077 if (direct || inverse) return true;
1078 }
1079 else {
1080 ATH_MSG_WARNING( "TrigBmumuxComboHypo can not check decisions for " << tool->name() );
1081 }
1082 }
1083 return false;
1084}
bool passed(DecisionID id, const DecisionIDContainer &idSet)
checks if required decision ID is in the set of IDs in the container

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

381 {
382 h.renounce();
384 }

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

364 {
366 }

◆ setFilterPassed()

virtual void AthCommonReentrantAlgorithm< Gaudi::Algorithm >::setFilterPassed ( bool state,
const EventContext & ctx ) const
inlinevirtualinherited

Definition at line 100 of file AthCommonReentrantAlgorithm.h.

100 {
102 }
virtual void setFilterPassed(bool state, const EventContext &ctx) const

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

77{
78 return BaseAlg::sysExecute (ctx);
79}

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

107 {
109
110 if (sc.isFailure()) {
111 return sc;
112 }
113
114 ServiceHandle<ICondSvc> cs("CondSvc",name());
115 for (auto h : outputHandles()) {
116 if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
117 // do this inside the loop so we don't create the CondSvc until needed
118 if ( cs.retrieve().isFailure() ) {
119 ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
120 return StatusCode::SUCCESS;
121 }
122 if (cs->regHandle(this,*h).isFailure()) {
124 ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
125 << " with CondSvc");
126 }
127 }
128 }
129 return sc;
130}
virtual std::vector< Gaudi::DataHandle * > outputHandles() const override

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

43{ return m_multiplicitiesReqMap.value(); }
Gaudi::Property< Combo::MultiplicityReqMap > m_multiplicitiesReqMap
Definition ComboHypo.h:56

◆ updateVHKA()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::updateVHKA ( Gaudi::Details::PropertyBase & )
inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

308 {
309 // debug() << "updateVHKA for property " << p.name() << " " << p.toString()
310 // << " size: " << m_vhka.size() << endmsg;
311 for (auto &a : m_vhka) {
313 for (auto k : keys) {
314 k->setOwner(this);
315 }
316 }
317 }

Member Data Documentation

◆ m_allowedIDs

TrigCompositeUtils::DecisionIDContainer TrigBmumuxComboHypo::m_allowedIDs
private

Definition at line 432 of file TrigBmumuxComboHypo.h.

◆ m_BcToDplusMuMu

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BcToDplusMuMu
private
Initial value:
{this,
"BcToDplusMuMu", true, "switch on/off B_c+ -> J/psi(-> mu+ mu-) D+(-> K- pi+ pi+) decay"}

Definition at line 381 of file TrigBmumuxComboHypo.h.

381 {this,
382 "BcToDplusMuMu", true, "switch on/off B_c+ -> J/psi(-> mu+ mu-) D+(-> K- pi+ pi+) decay"};

◆ m_BcToDplusMuMu_chi2

Gaudi::Property<float> TrigBmumuxComboHypo::m_BcToDplusMuMu_chi2
private
Initial value:
{this,
"BcToDplusMuMu_chi2", 60., "maximum chi2 of the fitted B_c+ vertex"}

Definition at line 393 of file TrigBmumuxComboHypo.h.

393 {this,
394 "BcToDplusMuMu_chi2", 60., "maximum chi2 of the fitted B_c+ vertex"};

◆ m_BcToDplusMuMu_dimuonMassRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BcToDplusMuMu_dimuonMassRange
private
Initial value:
{this,
"BcToDplusMuMu_dimuonMassRange", {2500., 4300.}, "dimuon mass range for B_c+ -> J/psi D+ decay"}

Definition at line 389 of file TrigBmumuxComboHypo.h.

389 {this,
390 "BcToDplusMuMu_dimuonMassRange", {2500., 4300.}, "dimuon mass range for B_c+ -> J/psi D+ decay"};

◆ m_BcToDplusMuMu_DplusMassRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BcToDplusMuMu_DplusMassRange
private
Initial value:
{this,
"BcToDplusMuMu_DplusMassRange", {1750., 2000.}, "D+ mass range"}

Definition at line 391 of file TrigBmumuxComboHypo.h.

391 {this,
392 "BcToDplusMuMu_DplusMassRange", {1750., 2000.}, "D+ mass range"};

◆ m_BcToDplusMuMu_massRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BcToDplusMuMu_massRange
private
Initial value:
{this,
"BcToDplusMuMu_massRange", {5500., 7300.}, "B_c+ mass range"}

Definition at line 387 of file TrigBmumuxComboHypo.h.

387 {this,
388 "BcToDplusMuMu_massRange", {5500., 7300.}, "B_c+ mass range"};

◆ m_BcToDplusMuMu_minKaonPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_BcToDplusMuMu_minKaonPt
private
Initial value:
{this,
"BcToDplusMuMu_minKaonPt", 1000., "minimum pT of kaon track from D+"}

Definition at line 383 of file TrigBmumuxComboHypo.h.

383 {this,
384 "BcToDplusMuMu_minKaonPt", 1000., "minimum pT of kaon track from D+"};

◆ m_BcToDplusMuMu_minPionPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_BcToDplusMuMu_minPionPt
private
Initial value:
{this,
"BcToDplusMuMu_minPionPt", 1000., "minimum pT of pion track from D+"}

Definition at line 385 of file TrigBmumuxComboHypo.h.

385 {this,
386 "BcToDplusMuMu_minPionPt", 1000., "minimum pT of pion track from D+"};

◆ m_BcToDplusMuMu_useFastFit

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BcToDplusMuMu_useFastFit
private
Initial value:
{this,
"BcToDplusMuMu_useFastFit", true, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"}

Definition at line 395 of file TrigBmumuxComboHypo.h.

395 {this,
396 "BcToDplusMuMu_useFastFit", true, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"};

◆ m_BcToDsMuMu

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BcToDsMuMu
private
Initial value:
{this,
"BcToDsMuMu", true, "switch on/off B_c+ -> J/psi(-> mu+ mu-) D_s+(->phi(-> K+ K-) pi+) decay"}

Definition at line 361 of file TrigBmumuxComboHypo.h.

361 {this,
362 "BcToDsMuMu", true, "switch on/off B_c+ -> J/psi(-> mu+ mu-) D_s+(->phi(-> K+ K-) pi+) decay"};

◆ m_BcToDsMuMu_chi2

Gaudi::Property<float> TrigBmumuxComboHypo::m_BcToDsMuMu_chi2
private
Initial value:
{this,
"BcToDsMuMu_chi2", 60., "maximum chi2 of the fitted B_c+ vertex"}

Definition at line 375 of file TrigBmumuxComboHypo.h.

375 {this,
376 "BcToDsMuMu_chi2", 60., "maximum chi2 of the fitted B_c+ vertex"};

◆ m_BcToDsMuMu_dimuonMassRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BcToDsMuMu_dimuonMassRange
private
Initial value:
{this,
"BcToDsMuMu_dimuonMassRange", {2500., 4300.}, "dimuon mass range for B_c+ -> J/psi D_s+ decay"}

Definition at line 369 of file TrigBmumuxComboHypo.h.

369 {this,
370 "BcToDsMuMu_dimuonMassRange", {2500., 4300.}, "dimuon mass range for B_c+ -> J/psi D_s+ decay"};

◆ m_BcToDsMuMu_DsMassRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BcToDsMuMu_DsMassRange
private
Initial value:
{this,
"BcToDsMuMu_DsMassRange", {1750., 2100.}, "D_s+ mass range"}

Definition at line 373 of file TrigBmumuxComboHypo.h.

373 {this,
374 "BcToDsMuMu_DsMassRange", {1750., 2100.}, "D_s+ mass range"};

◆ m_BcToDsMuMu_massRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BcToDsMuMu_massRange
private
Initial value:
{this,
"BcToDsMuMu_massRange", {5500., 7300.}, "B_c+ mass range"}

Definition at line 367 of file TrigBmumuxComboHypo.h.

367 {this,
368 "BcToDsMuMu_massRange", {5500., 7300.}, "B_c+ mass range"};

◆ m_BcToDsMuMu_minKaonPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_BcToDsMuMu_minKaonPt
private
Initial value:
{this,
"BcToDsMuMu_minKaonPt", 1000., "minimum pT of kaon track from phi(1020)"}

Definition at line 363 of file TrigBmumuxComboHypo.h.

363 {this,
364 "BcToDsMuMu_minKaonPt", 1000., "minimum pT of kaon track from phi(1020)"};

◆ m_BcToDsMuMu_minPionPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_BcToDsMuMu_minPionPt
private
Initial value:
{this,
"BcToDsMuMu_minPionPt", 1000., "minimum pT of pion track from D_s+"}

Definition at line 365 of file TrigBmumuxComboHypo.h.

365 {this,
366 "BcToDsMuMu_minPionPt", 1000., "minimum pT of pion track from D_s+"};

◆ m_BcToDsMuMu_phiMassRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BcToDsMuMu_phiMassRange
private
Initial value:
{this,
"BcToDsMuMu_phiMassRange", {940., 1100.}, "phi(1020) mass range"}

Definition at line 371 of file TrigBmumuxComboHypo.h.

371 {this,
372 "BcToDsMuMu_phiMassRange", {940., 1100.}, "phi(1020) mass range"};

◆ m_BcToDsMuMu_useFastFit

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BcToDsMuMu_useFastFit
private
Initial value:
{this,
"BcToDsMuMu_useFastFit", true, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"}

Definition at line 377 of file TrigBmumuxComboHypo.h.

377 {this,
378 "BcToDsMuMu_useFastFit", true, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"};

◆ m_BcToDstarMuMu

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BcToDstarMuMu
private
Initial value:
{this,
"BcToDstarMuMu", true, "switch on/off partial reconstruction of B_c+ -> J/psi(-> mu+ mu-) D0(-> K- pi+) X decay"}

Definition at line 399 of file TrigBmumuxComboHypo.h.

399 {this,
400 "BcToDstarMuMu", true, "switch on/off partial reconstruction of B_c+ -> J/psi(-> mu+ mu-) D0(-> K- pi+) X decay"};

◆ m_BcToDstarMuMu_chi2

Gaudi::Property<float> TrigBmumuxComboHypo::m_BcToDstarMuMu_chi2
private
Initial value:
{this,
"BcToDstarMuMu_chi2", 60., "maximum chi2 of the fitted B_c+ vertex"}

Definition at line 419 of file TrigBmumuxComboHypo.h.

419 {this,
420 "BcToDstarMuMu_chi2", 60., "maximum chi2 of the fitted B_c+ vertex"};

◆ m_BcToDstarMuMu_D0MassRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BcToDstarMuMu_D0MassRange
private
Initial value:
{this,
"BcToDstarMuMu_D0MassRange", {1750., 2000.}, "D0 mass range"}

Definition at line 415 of file TrigBmumuxComboHypo.h.

415 {this,
416 "BcToDstarMuMu_D0MassRange", {1750., 2000.}, "D0 mass range"};

◆ m_BcToDstarMuMu_dimuonMassRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BcToDstarMuMu_dimuonMassRange
private
Initial value:
{this,
"BcToDstarMuMu_dimuonMassRange", {2500., 4300.}, "dimuon mass range for B_c+ -> J/psi D+ decay"}

Definition at line 413 of file TrigBmumuxComboHypo.h.

413 {this,
414 "BcToDstarMuMu_dimuonMassRange", {2500., 4300.}, "dimuon mass range for B_c+ -> J/psi D+ decay"};

◆ m_BcToDstarMuMu_DstarMassRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BcToDstarMuMu_DstarMassRange
private
Initial value:
{this,
"BcToDstarMuMu_DstarMassRange", {-1., 2110.}, "D*+ mass range"}

Definition at line 417 of file TrigBmumuxComboHypo.h.

417 {this,
418 "BcToDstarMuMu_DstarMassRange", {-1., 2110.}, "D*+ mass range"};

◆ m_BcToDstarMuMu_makeDstar

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BcToDstarMuMu_makeDstar
private
Initial value:
{this,
"BcToDstarMuMu_makeDstar", true, "switch on/off full reconstruction of B_c+ -> J/psi(-> mu+ mu-) D*+(-> D0(-> K- pi+) pi+) decay"}

Definition at line 401 of file TrigBmumuxComboHypo.h.

401 {this,
402 "BcToDstarMuMu_makeDstar", true, "switch on/off full reconstruction of B_c+ -> J/psi(-> mu+ mu-) D*+(-> D0(-> K- pi+) pi+) decay"};

◆ m_BcToDstarMuMu_massRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BcToDstarMuMu_massRange
private
Initial value:
{this,
"BcToDstarMuMu_massRange", {5500., 7300.}, "B_c+ mass range"}

Definition at line 411 of file TrigBmumuxComboHypo.h.

411 {this,
412 "BcToDstarMuMu_massRange", {5500., 7300.}, "B_c+ mass range"};

◆ m_BcToDstarMuMu_maxDstarPionZ0

Gaudi::Property<double> TrigBmumuxComboHypo::m_BcToDstarMuMu_maxDstarPionZ0
private
Initial value:
{this,
"BcToDstarMuMu_maxDstarPionZ0", 5., "maximum z0 impact parameter of the pion track from D*+ wrt the fitted dimuon vertex; no preselection if negative"}

Definition at line 409 of file TrigBmumuxComboHypo.h.

409 {this,
410 "BcToDstarMuMu_maxDstarPionZ0", 5., "maximum z0 impact parameter of the pion track from D*+ wrt the fitted dimuon vertex; no preselection if negative"};

◆ m_BcToDstarMuMu_minD0KaonPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_BcToDstarMuMu_minD0KaonPt
private
Initial value:
{this,
"BcToDstarMuMu_minD0KaonPt", 1000., "minimum pT of kaon track from D0"}

Definition at line 403 of file TrigBmumuxComboHypo.h.

403 {this,
404 "BcToDstarMuMu_minD0KaonPt", 1000., "minimum pT of kaon track from D0"};

◆ m_BcToDstarMuMu_minD0PionPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_BcToDstarMuMu_minD0PionPt
private
Initial value:
{this,
"BcToDstarMuMu_minD0PionPt", 1000., "minimum pT of pion track from D0"}

Definition at line 405 of file TrigBmumuxComboHypo.h.

405 {this,
406 "BcToDstarMuMu_minD0PionPt", 1000., "minimum pT of pion track from D0"};

◆ m_BcToDstarMuMu_minDstarPionPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_BcToDstarMuMu_minDstarPionPt
private
Initial value:
{this,
"BcToDstarMuMu_minDstarPionPt", 500., "minimum pT of pion track from D*+"}

Definition at line 407 of file TrigBmumuxComboHypo.h.

407 {this,
408 "BcToDstarMuMu_minDstarPionPt", 500., "minimum pT of pion track from D*+"};

◆ m_BcToMuMuPion

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BcToMuMuPion
private
Initial value:
{this,
"BcToMuMuPion", true, "switch on/off B_c+ -> J/psi(-> mu+ mu-) pi+ decay"}

Definition at line 293 of file TrigBmumuxComboHypo.h.

293 {this,
294 "BcToMuMuPion", true, "switch on/off B_c+ -> J/psi(-> mu+ mu-) pi+ decay"};

◆ m_BcToMuMuPion_chi2

Gaudi::Property<float> TrigBmumuxComboHypo::m_BcToMuMuPion_chi2
private
Initial value:
{this,
"BcToMuMuPion_chi2", 50., "maximum chi2 of the fitted B_c+ vertex"}

Definition at line 301 of file TrigBmumuxComboHypo.h.

301 {this,
302 "BcToMuMuPion_chi2", 50., "maximum chi2 of the fitted B_c+ vertex"};

◆ m_BcToMuMuPion_dimuonMassRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BcToMuMuPion_dimuonMassRange
private
Initial value:
{this,
"BcToMuMuPion_dimuonMassRange", {2500., 4300.}, "dimuon mass range for B_c+ decay"}

Definition at line 297 of file TrigBmumuxComboHypo.h.

297 {this,
298 "BcToMuMuPion_dimuonMassRange", {2500., 4300.}, "dimuon mass range for B_c+ decay"};

◆ m_BcToMuMuPion_massRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BcToMuMuPion_massRange
private
Initial value:
{this,
"BcToMuMuPion_massRange", {5500., 7300.}, "B_c+ mass range"}

Definition at line 299 of file TrigBmumuxComboHypo.h.

299 {this,
300 "BcToMuMuPion_massRange", {5500., 7300.}, "B_c+ mass range"};

◆ m_BcToMuMuPion_minPionPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_BcToMuMuPion_minPionPt
private
Initial value:
{this,
"BcToMuMuPion_minPionPt", 2000., "minimum pT of pion track"}

Definition at line 295 of file TrigBmumuxComboHypo.h.

295 {this,
296 "BcToMuMuPion_minPionPt", 2000., "minimum pT of pion track"};

◆ m_BcToMuMuPion_useFastFit

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BcToMuMuPion_useFastFit
private
Initial value:
{this,
"BcToMuMuPion_useFastFit", false, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"}

Definition at line 303 of file TrigBmumuxComboHypo.h.

303 {this,
304 "BcToMuMuPion_useFastFit", false, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"};

◆ m_BdToMuMuKstar0

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BdToMuMuKstar0
private
Initial value:
{this,
"BdToMuMuKstar0", true, "switch on/off B0 -> mu+ mu- K*0(-> K+ pi-) decay"}

Definition at line 323 of file TrigBmumuxComboHypo.h.

323 {this,
324 "BdToMuMuKstar0", true, "switch on/off B0 -> mu+ mu- K*0(-> K+ pi-) decay"};

◆ m_BdToMuMuKstar0_chi2

Gaudi::Property<float> TrigBmumuxComboHypo::m_BdToMuMuKstar0_chi2
private
Initial value:
{this,
"BdToMuMuKstar0_chi2", 60., "maximum chi2 of the fitted B0 vertex"}

Definition at line 335 of file TrigBmumuxComboHypo.h.

335 {this,
336 "BdToMuMuKstar0_chi2", 60., "maximum chi2 of the fitted B0 vertex"};

◆ m_BdToMuMuKstar0_KstarMassRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BdToMuMuKstar0_KstarMassRange
private
Initial value:
{this,
"BdToMuMuKstar0_KstarMassRange", {700., 1100.}, "K*0 mass range"}

Definition at line 333 of file TrigBmumuxComboHypo.h.

333 {this,
334 "BdToMuMuKstar0_KstarMassRange", {700., 1100.}, "K*0 mass range"};

◆ m_BdToMuMuKstar0_massRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BdToMuMuKstar0_massRange
private
Initial value:
{this,
"BdToMuMuKstar0_massRange", {4600., 5900.}, "B0 mass range"}

Definition at line 331 of file TrigBmumuxComboHypo.h.

331 {this,
332 "BdToMuMuKstar0_massRange", {4600., 5900.}, "B0 mass range"};

◆ m_BdToMuMuKstar0_minKaonPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_BdToMuMuKstar0_minKaonPt
private
Initial value:
{this,
"BdToMuMuKstar0_minKaonPt", 100., "minimum pT of kaon track"}

Definition at line 327 of file TrigBmumuxComboHypo.h.

327 {this,
328 "BdToMuMuKstar0_minKaonPt", 100., "minimum pT of kaon track"};

◆ m_BdToMuMuKstar0_minPionPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_BdToMuMuKstar0_minPionPt
private
Initial value:
{this,
"BdToMuMuKstar0_minPionPt", 100., "minimum pT of pion track"}

Definition at line 329 of file TrigBmumuxComboHypo.h.

329 {this,
330 "BdToMuMuKstar0_minPionPt", 100., "minimum pT of pion track"};

◆ m_BdToMuMuKstar0_rejectSameChargeTracks

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BdToMuMuKstar0_rejectSameChargeTracks
private
Initial value:
{this,
"BdToMuMuKstar0_rejectSameChargeTracks", true, "if true, the only (K+, pi-) and (K-, pi+) pairs will be kept (no wrong-charge combinations)"}

Definition at line 325 of file TrigBmumuxComboHypo.h.

325 {this,
326 "BdToMuMuKstar0_rejectSameChargeTracks", true, "if true, the only (K+, pi-) and (K-, pi+) pairs will be kept (no wrong-charge combinations)"};

◆ m_BdToMuMuKstar0_useFastFit

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BdToMuMuKstar0_useFastFit
private
Initial value:
{this,
"BdToMuMuKstar0_useFastFit", true, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"}

Definition at line 337 of file TrigBmumuxComboHypo.h.

337 {this,
338 "BdToMuMuKstar0_useFastFit", true, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"};

◆ m_beamSpotKey

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

Definition at line 252 of file TrigBmumuxComboHypo.h.

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

◆ m_BplusToMuMuKaon

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BplusToMuMuKaon
private
Initial value:
{this,
"BplusToMuMuKaon", true, "switch on/off B+ -> mu+ mu- K+ decay"}

Definition at line 281 of file TrigBmumuxComboHypo.h.

281 {this,
282 "BplusToMuMuKaon", true, "switch on/off B+ -> mu+ mu- K+ decay"};

◆ m_BplusToMuMuKaon_chi2

Gaudi::Property<float> TrigBmumuxComboHypo::m_BplusToMuMuKaon_chi2
private
Initial value:
{this,
"BplusToMuMuKaon_chi2", 50., "maximum chi2 of the fitted B+ vertex"}

Definition at line 287 of file TrigBmumuxComboHypo.h.

287 {this,
288 "BplusToMuMuKaon_chi2", 50., "maximum chi2 of the fitted B+ vertex"};

◆ m_BplusToMuMuKaon_massRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BplusToMuMuKaon_massRange
private
Initial value:
{this,
"BplusToMuMuKaon_massRange", {4500., 5900.}, "B+ mass range"}

Definition at line 285 of file TrigBmumuxComboHypo.h.

285 {this,
286 "BplusToMuMuKaon_massRange", {4500., 5900.}, "B+ mass range"};

◆ m_BplusToMuMuKaon_minKaonPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_BplusToMuMuKaon_minKaonPt
private
Initial value:
{this,
"BplusToMuMuKaon_minKaonPt", 100., "minimum pT of kaon track"}

Definition at line 283 of file TrigBmumuxComboHypo.h.

283 {this,
284 "BplusToMuMuKaon_minKaonPt", 100., "minimum pT of kaon track"};

◆ m_BplusToMuMuKaon_useFastFit

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BplusToMuMuKaon_useFastFit
private
Initial value:
{this,
"BplusToMuMuKaon_useFastFit", false, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"}

Definition at line 289 of file TrigBmumuxComboHypo.h.

289 {this,
290 "BplusToMuMuKaon_useFastFit", false, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"};

◆ m_BsToMuMuPhi1020

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BsToMuMuPhi1020
private
Initial value:
{this,
"BsToMuMuPhi1020", true, "switch on/off B_s0 -> mu+ mu- phi(-> K+ K-) decay"}

Definition at line 307 of file TrigBmumuxComboHypo.h.

307 {this,
308 "BsToMuMuPhi1020", true, "switch on/off B_s0 -> mu+ mu- phi(-> K+ K-) decay"};

◆ m_BsToMuMuPhi1020_chi2

Gaudi::Property<float> TrigBmumuxComboHypo::m_BsToMuMuPhi1020_chi2
private
Initial value:
{this,
"BsToMuMuPhi1020_chi2", 60., "maximum chi2 of the fitted B+ vertex"}

Definition at line 317 of file TrigBmumuxComboHypo.h.

317 {this,
318 "BsToMuMuPhi1020_chi2", 60., "maximum chi2 of the fitted B+ vertex"};

◆ m_BsToMuMuPhi1020_massRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BsToMuMuPhi1020_massRange
private
Initial value:
{this,
"BsToMuMuPhi1020_massRange", {4800., 5800.}, "B_s0 mass range"}

Definition at line 313 of file TrigBmumuxComboHypo.h.

313 {this,
314 "BsToMuMuPhi1020_massRange", {4800., 5800.}, "B_s0 mass range"};

◆ m_BsToMuMuPhi1020_minKaonPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_BsToMuMuPhi1020_minKaonPt
private
Initial value:
{this,
"BsToMuMuPhi1020_minKaonPt", 100., "minimum pT of kaon tracks"}

Definition at line 311 of file TrigBmumuxComboHypo.h.

311 {this,
312 "BsToMuMuPhi1020_minKaonPt", 100., "minimum pT of kaon tracks"};

◆ m_BsToMuMuPhi1020_phiMassRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_BsToMuMuPhi1020_phiMassRange
private
Initial value:
{this,
"BsToMuMuPhi1020_phiMassRange", {940., 1100.}, "phi1020 mass range"}

Definition at line 315 of file TrigBmumuxComboHypo.h.

315 {this,
316 "BsToMuMuPhi1020_phiMassRange", {940., 1100.}, "phi1020 mass range"};

◆ m_BsToMuMuPhi1020_rejectSameChargeTracks

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BsToMuMuPhi1020_rejectSameChargeTracks
private
Initial value:
{this,
"BsToMuMuPhi1020_rejectSameChargeTracks", true, "if true, the only (K+, K-) pairs will be kept (no wrong-charge combinations)"}

Definition at line 309 of file TrigBmumuxComboHypo.h.

309 {this,
310 "BsToMuMuPhi1020_rejectSameChargeTracks", true, "if true, the only (K+, K-) pairs will be kept (no wrong-charge combinations)"};

◆ m_BsToMuMuPhi1020_useFastFit

Gaudi::Property<bool> TrigBmumuxComboHypo::m_BsToMuMuPhi1020_useFastFit
private
Initial value:
{this,
"BsToMuMuPhi1020_useFastFit", false, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"}

Definition at line 319 of file TrigBmumuxComboHypo.h.

319 {this,
320 "BsToMuMuPhi1020_useFastFit", false, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"};

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

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

◆ m_deltaR

Gaudi::Property<double> TrigBmumuxComboHypo::m_deltaR
private
Initial value:
{this,
"DeltaR", 0.01, "minimum deltaR between same-sign tracks (overlap removal)"}

Definition at line 255 of file TrigBmumuxComboHypo.h.

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

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

Gaudi::Property<double> TrigBmumuxComboHypo::m_dimuon_chi2
private
Initial value:
{this,
"Dimuon_chi2", 20., "maximum chi2 of the dimuon vertex"}

Definition at line 277 of file TrigBmumuxComboHypo.h.

277 {this,
278 "Dimuon_chi2", 20., "maximum chi2 of the dimuon vertex"};

◆ m_dimuon_massRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_dimuon_massRange
private
Initial value:
{this,
"Dimuon_massRange", {100., 5500.}, "dimuon mass range"}

Definition at line 275 of file TrigBmumuxComboHypo.h.

275 {this,
276 "Dimuon_massRange", {100., 5500.}, "dimuon mass range"};

◆ m_dimuon_rejectSameChargeTracks

Gaudi::Property<bool> TrigBmumuxComboHypo::m_dimuon_rejectSameChargeTracks
private
Initial value:
{this,
"Dimuon_rejectSameChargeTracks", true, "if true, the only (mu+, mu-) pairs will be kept (no wrong-charge combinations)"}

Definition at line 273 of file TrigBmumuxComboHypo.h.

273 {this,
274 "Dimuon_rejectSameChargeTracks", true, "if true, the only (mu+, mu-) pairs will be kept (no wrong-charge combinations)"};

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

Gaudi::Property<double> TrigBmumuxComboHypo::m_fastFit_2mu1trk_chi2
private
Initial value:
{this,
"FastFit_2mu1trk_chi2", 60., "maximum chi2 for fast fit of dimuon + trk1"}

Definition at line 269 of file TrigBmumuxComboHypo.h.

269 {this,
270 "FastFit_2mu1trk_chi2", 60., "maximum chi2 for fast fit of dimuon + trk1"};

◆ m_fastFit_2trk_chi2

Gaudi::Property<double> TrigBmumuxComboHypo::m_fastFit_2trk_chi2
private
Initial value:
{this,
"FastFit_2trk_chi2", 50., "maximum chi2 for fast fit of trk1 + trk2"}

Definition at line 267 of file TrigBmumuxComboHypo.h.

267 {this,
268 "FastFit_2trk_chi2", 50., "maximum chi2 for fast fit of trk1 + trk2"};

◆ m_fitAttemptsBreakThreshold

Gaudi::Property<size_t> TrigBmumuxComboHypo::m_fitAttemptsBreakThreshold
private
Initial value:
{this,
"FitAttemptsBreakThreshold", 1000, "Events processing this many calls of the vertex fitter will generate a second WARNING message and the loop over combinations will be terminated at this point (time-out protect)"}

Definition at line 265 of file TrigBmumuxComboHypo.h.

265 {this,
266 "FitAttemptsBreakThreshold", 1000, "Events processing this many calls of the vertex fitter will generate a second WARNING message and the loop over combinations will be terminated at this point (time-out protect)"};

◆ m_fitAttemptsWarningThreshold

Gaudi::Property<size_t> TrigBmumuxComboHypo::m_fitAttemptsWarningThreshold
private
Initial value:
{this,
"FitAttemptsWarningThreshold", 200, "Events processing this many calls of the vertex fitter will generate a WARNING message (time-out protect)"}

Definition at line 263 of file TrigBmumuxComboHypo.h.

263 {this,
264 "FitAttemptsWarningThreshold", 200, "Events processing this many calls of the vertex fitter will generate a WARNING message (time-out protect)"};

◆ m_hypoTools

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

Definition at line 104 of file ComboHypo.h.

104{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.

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

◆ m_LambdaBToMuMuProtonKaon

Gaudi::Property<bool> TrigBmumuxComboHypo::m_LambdaBToMuMuProtonKaon
private
Initial value:
{this,
"LambdaBToMuMuProtonKaon", true, "switch on/off Lambda_b0 -> J/psi(-> mu+ mu-) p K- decay"}

Definition at line 341 of file TrigBmumuxComboHypo.h.

341 {this,
342 "LambdaBToMuMuProtonKaon", true, "switch on/off Lambda_b0 -> J/psi(-> mu+ mu-) p K- decay"};

◆ m_LambdaBToMuMuProtonKaon_chi2

Gaudi::Property<float> TrigBmumuxComboHypo::m_LambdaBToMuMuProtonKaon_chi2
private
Initial value:
{this,
"LambdaBToMuMuProtonKaon_chi2", 60., "maximum chi2 of the fitted Lambda_b0 vertex"}

Definition at line 355 of file TrigBmumuxComboHypo.h.

355 {this,
356 "LambdaBToMuMuProtonKaon_chi2", 60., "maximum chi2 of the fitted Lambda_b0 vertex"};

◆ m_LambdaBToMuMuProtonKaon_dimuonMassRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_LambdaBToMuMuProtonKaon_dimuonMassRange
private
Initial value:
{this,
"LambdaBToMuMuProtonKaon_dimuonMassRange", {2500., 4300.}, "dimuon mass range for Lambda_b0 decay"}

Definition at line 351 of file TrigBmumuxComboHypo.h.

351 {this,
352 "LambdaBToMuMuProtonKaon_dimuonMassRange", {2500., 4300.}, "dimuon mass range for Lambda_b0 decay"};

◆ m_LambdaBToMuMuProtonKaon_massRange

Gaudi::Property<std::pair<double, double> > TrigBmumuxComboHypo::m_LambdaBToMuMuProtonKaon_massRange
private
Initial value:
{this,
"LambdaBToMuMuProtonKaon_massRange", {4800., 6400.}, "Lambda_b0 mass range"}

Definition at line 353 of file TrigBmumuxComboHypo.h.

353 {this,
354 "LambdaBToMuMuProtonKaon_massRange", {4800., 6400.}, "Lambda_b0 mass range"};

◆ m_LambdaBToMuMuProtonKaon_minKaonPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_LambdaBToMuMuProtonKaon_minKaonPt
private
Initial value:
{this,
"LambdaBToMuMuProtonKaon_minKaonPt", 1000., "minimum pT of kaon track"}

Definition at line 347 of file TrigBmumuxComboHypo.h.

347 {this,
348 "LambdaBToMuMuProtonKaon_minKaonPt", 1000., "minimum pT of kaon track"};

◆ m_LambdaBToMuMuProtonKaon_minKstarMass

Gaudi::Property<double> TrigBmumuxComboHypo::m_LambdaBToMuMuProtonKaon_minKstarMass
private
Initial value:
{this,
"LambdaBToMuMuProtonKaon_minKstarMass", 1300., "min value for both mass(trk1=kaon, trk2=pion) and mass(trk1=pion, trk2=kaon)"}

Definition at line 349 of file TrigBmumuxComboHypo.h.

349 {this,
350 "LambdaBToMuMuProtonKaon_minKstarMass", 1300., "min value for both mass(trk1=kaon, trk2=pion) and mass(trk1=pion, trk2=kaon)"};

◆ m_LambdaBToMuMuProtonKaon_minProtonPt

Gaudi::Property<double> TrigBmumuxComboHypo::m_LambdaBToMuMuProtonKaon_minProtonPt
private
Initial value:
{this,
"LambdaBToMuMuProtonKaon_minProtonPt", 1000., "minimum pT of proton track"}

Definition at line 345 of file TrigBmumuxComboHypo.h.

345 {this,
346 "LambdaBToMuMuProtonKaon_minProtonPt", 1000., "minimum pT of proton track"};

◆ m_LambdaBToMuMuProtonKaon_rejectSameChargeTracks

Gaudi::Property<bool> TrigBmumuxComboHypo::m_LambdaBToMuMuProtonKaon_rejectSameChargeTracks
private
Initial value:
{this,
"LambdaBToMuMuProtonKaon_rejectSameChargeTracks", false, "if true, the only (p, K-) and (anti-p, K+) pairs will be kept (no wrong-charge combinations)"}

Definition at line 343 of file TrigBmumuxComboHypo.h.

343 {this,
344 "LambdaBToMuMuProtonKaon_rejectSameChargeTracks", false, "if true, the only (p, K-) and (anti-p, K+) pairs will be kept (no wrong-charge combinations)"};

◆ m_LambdaBToMuMuProtonKaon_useFastFit

Gaudi::Property<bool> TrigBmumuxComboHypo::m_LambdaBToMuMuProtonKaon_useFastFit
private
Initial value:
{this,
"LambdaBToMuMuProtonKaon_useFastFit", true, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"}

Definition at line 357 of file TrigBmumuxComboHypo.h.

357 {this,
358 "LambdaBToMuMuProtonKaon_useFastFit", true, "true: perform vertex fit depending on only if fast fit; false: always perform vertex fit"};

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

59 {this, "LegToInputCollectionMap", {},
60 "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_monTool

ToolHandle<GenericMonitoringTool> TrigBmumuxComboHypo::m_monTool
private
Initial value:
{this,
"MonTool", "", "monitoring tool"}

Definition at line 429 of file TrigBmumuxComboHypo.h.

429 {this,
430 "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.

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

◆ m_muonContainerKey

SG::ReadHandleKey<xAOD::MuonContainer> TrigBmumuxComboHypo::m_muonContainerKey
private
Initial value:
{this,
"MuonCollectionKey", "Muons", "input EF Muon container name"}

Definition at line 247 of file TrigBmumuxComboHypo.h.

247 {this,
248 "MuonCollectionKey", "Muons", "input EF Muon container name"};

◆ m_outputs

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

Definition at line 51 of file ComboHypo.h.

51{ 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.

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

◆ m_roiEtaWidth

Gaudi::Property<double> TrigBmumuxComboHypo::m_roiEtaWidth
private
Initial value:
{this,
"RoiEtaWidth", 0.75, "extent of the RoI in eta from initial muon, to be check for SuperRoI"}

Definition at line 259 of file TrigBmumuxComboHypo.h.

259 {this,
260 "RoiEtaWidth", 0.75, "extent of the RoI in eta from initial muon, to be check for SuperRoI"};

◆ m_roiPhiWidth

Gaudi::Property<double> TrigBmumuxComboHypo::m_roiPhiWidth
private
Initial value:
{this,
"RoiPhiWidth", 0.75, "extent of the RoI in phi from initial muon, to be check for SuperRoI"}

Definition at line 261 of file TrigBmumuxComboHypo.h.

261 {this,
262 "RoiPhiWidth", 0.75, "extent of the RoI in phi from initial muon, to be check for SuperRoI"};

◆ m_trackParticleContainerKey

SG::ReadHandleKey<xAOD::TrackParticleContainer> TrigBmumuxComboHypo::m_trackParticleContainerKey
private
Initial value:
{this,
"TrackCollectionKey", "InDetTrackParticles", "input TrackParticle container name"}

Definition at line 245 of file TrigBmumuxComboHypo.h.

245 {this,
246 "TrackCollectionKey", "InDetTrackParticles", "input TrackParticle container name"};

◆ m_trackToVertexTool

ToolHandle<Reco::ITrackToVertex> TrigBmumuxComboHypo::m_trackToVertexTool
private
Initial value:
{this,
"TrackToVertexTool", "", "tool to extrapolate track to vertex or beamspot"}

Definition at line 427 of file TrigBmumuxComboHypo.h.

427 {this,
428 "TrackToVertexTool", "", "tool to extrapolate track to vertex or beamspot"};

◆ m_trigBphysContainerKey

SG::WriteHandleKey<xAOD::TrigBphysContainer> TrigBmumuxComboHypo::m_trigBphysContainerKey
private
Initial value:
{this,
"TrigBphysCollectionKey", "TrigBphysContainer", "output TrigBphysContainer name"}

Definition at line 249 of file TrigBmumuxComboHypo.h.

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

◆ m_trkZ0

Gaudi::Property<double> TrigBmumuxComboHypo::m_trkZ0
private
Initial value:
{this,
"TrkZ0", 50., "maximum z0 impact parameter of the track wrt the fitted dimuon vertex; no preselection if negative"}

Definition at line 257 of file TrigBmumuxComboHypo.h.

257 {this,
258 "TrkZ0", 50., "maximum z0 impact parameter of the track wrt the fitted dimuon vertex; no preselection if negative"};

◆ m_varHandleArraysDeclared

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

Definition at line 399 of file AthCommonDataStore.h.

◆ m_vertexFitter

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

Definition at line 425 of file TrigBmumuxComboHypo.h.

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

◆ m_vertexPointEstimator

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

Definition at line 423 of file TrigBmumuxComboHypo.h.

423 {this,
424 "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.

◆ s_trkMass

const std::vector< std::vector< double > > TrigBmumuxComboHypo::s_trkMass
staticprivate
Initial value:

Definition at line 39 of file TrigBmumuxComboHypo.h.

45 : public ::ITrigBphysState {
46 public:
47 TrigBmumuxState() = delete;
48 TrigBmumuxState(const EventContext& context,
49 const TrigCompositeUtils::DecisionContainer& previousDecisions,

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