TrigHitDVHypoAlg Class Reference

Implements Hypo selection on triggering displaced vertex. More...

#include <TrigHitDVHypoAlg.h>

Inheritance diagram for TrigHitDVHypoAlg:

Collaboration diagram for TrigHitDVHypoAlg:

Public Member Functions
	TrigHitDVHypoAlg (const std::string &name, ISvcLocator *pSvcLocator)
virtual StatusCode	initialize () override
virtual StatusCode	execute (const EventContext &context) const override
virtual StatusCode	sysInitialize () override
	initialise this base class
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

Static Public Member Functions
static StatusCode	runtimeValidation (SG::WriteHandle< TrigCompositeUtils::DecisionContainer > &outputHandle, MsgStream &msg, bool onlyValidateOneStep=true, bool runTwoConversion=false)
	Executes all individual runtime tests.

Protected Member Functions
const SG::ReadHandleKey< TrigCompositeUtils::DecisionContainer > &	decisionInput () const
	methods for derived classes to access handles of the base class input other read/write handles may be implemented by derived classes
const SG::WriteHandleKey< TrigCompositeUtils::DecisionContainer > &	decisionOutput () const
	methods for derived classes to access handles of the base class output other read/write handles may be implemented by derived classes
StatusCode	hypoBaseOutputProcessing (SG::WriteHandle< TrigCompositeUtils::DecisionContainer > &outputHandle, MSG::Level lvl=MSG::DEBUG) const
	Base class function to be called once slice specific code has finished. Handles debug printing and validation.
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.

Private Types
using	SeedType = TrigHitDVHypoTool::SeedType
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
StatusCode	doMonitor (const xAOD::TrigCompositeContainer *) const
float	deltaR2 (float, float, float, float) const
int	getSPLayer (int, float) const
StatusCode	findSPSeeds (const EventContext &, const std::vector< HitDVSpacePoint > &, std::vector< float > &, std::vector< float > &) const
StatusCode	findJetSeeds (const xAOD::JetContainer *, const float, const float, std::vector< float > &, std::vector< float > &, std::vector< float > &) const
StatusCode	selectSeedsNearby (const std::vector< HitDVSeed > &hitDVSeedsContainer, std::vector< float > &jetSeeds_eta, std::vector< float > &jetSeeds_phi, std::vector< float > &jetSeeds_pt) const
StatusCode	calculateBDT (const std::vector< HitDVSpacePoint > &, const std::vector< HitDVTrk > &, const std::vector< float > &, const std::vector< float > &, const std::vector< float > &, const float &, const int, xAOD::TrigCompositeContainer *, int &) const
StatusCode	findSPSeeds (const EventContext &ctx, const std::vector< float > &v_sp_eta, const std::vector< float > &v_sp_phi, const std::vector< int > &v_sp_layer, const std::vector< int > &v_sp_usedTrkId, std::vector< float > &seeds_eta, std::vector< float > &seeds_phi) const
StatusCode	findHitDV (const EventContext &ctx, const std::vector< TrigSiSpacePointBase > &convertedSpacePoints, const DataVector< Trk::Track > &tracks, std::vector< HitDVSeed > &hitDVSeedsContainer, std::vector< HitDVTrk > &hitDVTrksContainer, std::vector< HitDVSpacePoint > &hitDVSPContainer) const
StatusCode	printDebugInformation (SG::WriteHandle< TrigCompositeUtils::DecisionContainer > &outputHandle, MSG::Level lvl) const
	Common base function to print information on chains passed by objects considered in the hypo.
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
ToolHandle< ITrigSpacePointConversionTool >	m_spacePointTool {this, "SpacePointProviderTool", "TrigSpacePointConversionTool"}
ToolHandleArray< TrigHitDVHypoTool >	m_hypoTools {this, "HypoTools", {}, "Tools to perform selection"}
SG::ReadHandleKey< xAOD::JetContainer >	m_jetsKey {this, "Jets", "HLT_AntiKt4EMTopoJets_subjesIS", ""}
SG::WriteHandleKey< xAOD::TrigCompositeContainer >	m_hitDVKey {this, "HitDV", "HLT_HitDV", ""}
SG::ReadHandleKey< TrackCollection >	m_tracksKey {this, "HitDVTracks", "HLT_IDTrkTrack_FS_FTF", ""}
ToolHandle< ILumiBlockMuTool >	m_lumiBlockMuTool
SG::ReadCondHandleKey< LuminosityCondData >	m_lumiDataKey {this, "LuminosityCondDataKey", "LuminosityCondData", ""}
Gaudi::Property< bool >	m_isMC {this, "isMC", false, "Real data or MC"}
Gaudi::Property< float >	m_jetSeed_ptMin {this, "jetSeed_ptMin", 50.0, "Minimum pT for jet seed"}
Gaudi::Property< float >	m_jetSeed_etaMax {this, "jetSeed_etaMin", 2.0, "Maximum eta for jet seed"}
Gaudi::Property< std::string >	m_hitDVLinkName {this, "hitDVLinkName", "HitDVSeedLink", "Name of the link to HitDVContainer. Used by ViewCreatorROITool."}
ToolHandle< GenericMonitoringTool >	m_monTool { this, "MonTool", "", "Monitoring tool" }
std::unique_ptr< MVAUtils::BDT >	m_bdt_eta [2]
int	m_tools_lowest_jetEt = 1000
int	m_tools_loosest_wp = 0
bool	m_useBeamSpot = true
bool	m_doHitDV_Seeding = true
SG::ReadHandleKey< xAOD::jFexSRJetRoIContainer >	m_jetRoiCollectionKey {this, "jFexSRJetRoI", "", ""}
SG::ReadCondHandleKey< InDet::BeamSpotData >	m_beamSpotKey { this, "BeamSpotKey", "BeamSpotData", "SG key for beam spot" }
SG::ReadHandleKey< TrigCompositeUtils::DecisionContainer >	m_input { this, "HypoInputDecisions", "UNSPECIFIED_INPUT", "Input Decision (implicit)" }
	input decisions
SG::WriteHandleKey< TrigCompositeUtils::DecisionContainer >	m_output { this, "HypoOutputDecisions", "UNSPECIFIED_OUTPUT", "Ouput Decision" }
	output decisions
Gaudi::Property< bool >	m_runtimeValidation { this, "RuntimeValidation", false, "Enable detailed runtime validation of HypoAlg output, and upstream Decisions." }
	Enabling of detailed validation checks for use during development.
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

Runtime validation methods
enum	LogicalFlowCheckMode { kRequireOne , kRequireAll }
static StatusCode	validateHasLinks (const ElementLink< TrigCompositeUtils::DecisionContainer > &dEL, MsgStream &msg)
	Ensure all Decisions have the named ElementLink graph edges which they are required to by spec.
static StatusCode	validateLogicalFlow (const ElementLink< TrigCompositeUtils::DecisionContainer > &dEL, MsgStream &msg, const LogicalFlowCheckMode mode)
	Ensure that all DecisionIDs have propagated correctly from their parent.
static StatusCode	validateDuplicatedDecisionID (const ElementLink< TrigCompositeUtils::DecisionContainer > &dEL, MsgStream &msg)
	Ensure that no space is being wasted by duplicated DecisionIDs in any Decision objects.
static StatusCode	validateDecisionIDs (const ElementLink< TrigCompositeUtils::DecisionContainer > &dEL, MsgStream &msg)
	Ensure that all present IDs correspond to configured chains.
static StatusCode	validateParentLinking (const ElementLink< TrigCompositeUtils::DecisionContainer > &dEL, MsgStream &msg, bool runTwoConversion)
	Ensure that the Decision has at least one valid parent, unless it is a initial Decision from the HLTSeeding.
static StatusCode	recursiveValidateGraph (const ElementLink< TrigCompositeUtils::DecisionContainer > &dEL, MsgStream &msg, bool onlyValidateOneStep, bool runTwoConversion, size_t callDepth, std::set< const TrigCompositeUtils::Decision * > &fullyExploredFrom)
	Execute all checks on one node in the graph, d, then recursive call self on all parent nodes up to L1.
static void	printBangs (MsgStream &msg)
	Print header line.
static void	printErrorHeader (const ElementLink< TrigCompositeUtils::DecisionContainer > &dEL, MsgStream &msg)
	A problem was found, print common output data.

Detailed Description

Implements Hypo selection on triggering displaced vertex.

Author

Kunihiro Nagano kunih.nosp@m.iro..nosp@m.nagan.nosp@m.o@ce.nosp@m.rn.ch - KEK

Definition at line 63 of file TrigHitDVHypoAlg.h.

Member Typedef Documentation

SeedType

using TrigHitDVHypoAlg::SeedType = TrigHitDVHypoTool::SeedType

private

Definition at line 94 of file TrigHitDVHypoAlg.h.

StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Member Enumeration Documentation

LogicalFlowCheckMode

enum HypoBase::LogicalFlowCheckMode

privateinherited

Enumerator
kRequireOne	Require all DecisionIDs to be present in at least one of my parent Decision objects.
kRequireAll

Definition at line 52 of file HypoBase.h.

                            { 
    kRequireOne, 
    kRequireAll //<! Require all DecisionIDs to be present in all of my parent Decision objects
  };

Constructor & Destructor Documentation

TrigHitDVHypoAlg()

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

Definition at line 46 of file TrigHitDVHypoAlg.cxx.

                                               :
   ::HypoBase( name, pSvcLocator ),
   m_lumiBlockMuTool("LumiBlockMuTool/LumiBlockMuTool") 
{}

Member Function Documentation

calculateBDT()

StatusCode TrigHitDVHypoAlg::calculateBDT ( const std::vector< HitDVSpacePoint > & spsContainer, const std::vector< HitDVTrk > & trksContainer, const std::vector< float > & seeds_pt, const std::vector< float > & seeds_eta, const std::vector< float > & seeds_phi, const float & cutBDTthreshold, const int seed_type, xAOD::TrigCompositeContainer * dvContainer, int & n_passed ) const

private

Definition at line 508 of file TrigHitDVHypoAlg.cxx.

{
   if( seeds_eta.size() != seeds_phi.size() ) return StatusCode::SUCCESS;
   n_passed = 0;
 
   for(unsigned int iseed=0; iseed<seeds_eta.size(); iseed++) {
 
      float seed_eta = seeds_eta[iseed];
      float seed_phi = seeds_phi[iseed];
 
      ATH_MSG_VERBOSE("+++++ seed eta: " << seed_eta << ", phi:" << seed_phi << " +++++");
 
      // loop on space points
      const int   N_LAYER = 8;
      const float DR_SQUARED_TO_REF_CUT = 0.16; // const float DR_TO_REF_CUT = 0.4;
 
      int n_sp_injet = 0;
      int n_sp_injet_usedByTrk = 0;
      int v_n_sp_injet[N_LAYER];
      int v_n_sp_injet_usedByTrk[N_LAYER];
      for(int i=0; i<N_LAYER; i++) { v_n_sp_injet[i]=0; v_n_sp_injet_usedByTrk[i]=0; }
 
      for ( const auto & spData : spsContainer ) {
     // match within dR
     float sp_eta = spData.eta;
     float sp_phi = spData.phi;
     float dR2 = deltaR2(sp_eta,sp_phi,seed_eta,seed_phi);
     if( dR2 > DR_SQUARED_TO_REF_CUT ) continue;
 
     //
     int sp_layer = (int)spData.layer;
     int sp_trkid = (int)spData.usedTrkId;
     bool isUsedByTrk = (sp_trkid != -1);
 
     int ilayer = getSPLayer(sp_layer,sp_eta);
 
     if( ilayer<=7  ) { // Pixel barrel or Sct barrel
        n_sp_injet++;
        v_n_sp_injet[ilayer]++;
        if( isUsedByTrk ) {
           n_sp_injet_usedByTrk++;
           v_n_sp_injet_usedByTrk[ilayer]++;
        }
     }
      }
      ATH_MSG_VERBOSE("nr of SPs in jet: usedByTrk / all = " << n_sp_injet_usedByTrk << " / " << n_sp_injet);
      float v_ly_sp_frac[N_LAYER];
      for(int i=0; i<N_LAYER; i++) {
     float frac = 0.;
     if( v_n_sp_injet[i] > 0 ) frac = 1.0 - static_cast<float>(v_n_sp_injet_usedByTrk[i]) / static_cast<float>(v_n_sp_injet[i]);
     v_ly_sp_frac[i] = frac;
     ATH_MSG_VERBOSE("Layer " << i << ": frac=" << v_ly_sp_frac[i] << ", n used / all = " << v_n_sp_injet_usedByTrk[i] << " / " << v_n_sp_injet[i]);
      }
 
      // loop on tracks
      const float TRK_PT_GEV_CUT = 2.0;
 
      unsigned int n_qtrk_injet = 0;
      for ( const auto& trk : trksContainer ) {
     float trk_ptGeV  = trk.pt;
     trk_ptGeV /= Gaudi::Units::GeV;
     if( trk_ptGeV < TRK_PT_GEV_CUT ) continue;
     float dR2 = deltaR2(trk.eta,trk.phi,seed_eta,seed_phi);
     if( dR2 > DR_SQUARED_TO_REF_CUT ) continue;
     n_qtrk_injet++;
      }
      ATH_MSG_DEBUG("nr of all / quality tracks matched = " << trksContainer.size() << " / " << n_qtrk_injet);
 
      // evaluate BDT
      bool isSeedOutOfRange = false;
      if( n_qtrk_injet == 0 ) {
     isSeedOutOfRange = true;
     for(int i=0; i<N_LAYER; i++) {
        if( std::fabs(v_ly_sp_frac[i]) > 1e-3 ) {
           isSeedOutOfRange = false; break;
        }
     }
      }
      float bdt_score = -2.0;
      if( ! isSeedOutOfRange ) {
     const std::vector<float> input_values = {
       static_cast<float>(n_qtrk_injet),
       v_ly_sp_frac[0],
       v_ly_sp_frac[1],
       v_ly_sp_frac[2],
       v_ly_sp_frac[3],
       v_ly_sp_frac[4],
       v_ly_sp_frac[5],
       v_ly_sp_frac[6],
       v_ly_sp_frac[7] };
 
         if ( std::abs(seed_eta) < 1 ) {
        bdt_score = m_bdt_eta[0]->GetClassification(input_values);
         } else if ( std::abs(seed_eta) < 2 ) {
        bdt_score = m_bdt_eta[1]->GetClassification(input_values);
         }
      }
 
      // BDT threshold
      if( bdt_score < cutBDTthreshold ) continue;
 
      // passed selection
      ATH_MSG_VERBOSE("Passed selection");
      n_passed++;
 
      // create EDM object
      xAOD::TrigComposite *dv = new xAOD::TrigComposite();
      dv->makePrivateStore();
      dvContainer->push_back(dv);
 
      float seed_pt = 0;
      if ( seed_type == SeedType::HLTJet ) seed_pt = seeds_pt[iseed];
      dv->setDetail<float>("hitDV_seed_pt",      seed_pt);
      dv->setDetail<float>("hitDV_seed_eta",     seed_eta);
      dv->setDetail<float>("hitDV_seed_phi",     seed_phi);
      dv->setDetail<int>  ("hitDV_seed_type",    seed_type);
      dv->setDetail<int>  ("hitDV_n_track_qual", n_qtrk_injet);
      dv->setDetail<float>("hitDV_ly0_sp_frac",  v_ly_sp_frac[0]);
      dv->setDetail<float>("hitDV_ly1_sp_frac",  v_ly_sp_frac[1]);
      dv->setDetail<float>("hitDV_ly2_sp_frac",  v_ly_sp_frac[2]);
      dv->setDetail<float>("hitDV_ly3_sp_frac",  v_ly_sp_frac[3]);
      dv->setDetail<float>("hitDV_ly4_sp_frac",  v_ly_sp_frac[4]);
      dv->setDetail<float>("hitDV_ly5_sp_frac",  v_ly_sp_frac[5]);
      dv->setDetail<float>("hitDV_ly6_sp_frac",  v_ly_sp_frac[6]);
      dv->setDetail<float>("hitDV_ly7_sp_frac",  v_ly_sp_frac[7]);
      dv->setDetail<float>("hitDV_bdt_score",    bdt_score);
 
      ATH_MSG_VERBOSE("Created a new entry EDM");
   }
   ATH_MSG_DEBUG("nr of BDT passed = " << n_passed);
 
   //
   return StatusCode::SUCCESS;
}

cardinality()

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

overridevirtualinherited

Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.

Override this to return 0 for reentrant algorithms.

Definition at line 75 of file AthCommonReentrantAlgorithm.cxx.

{
  return 0;
}

decisionInput()

const SG::ReadHandleKey< TrigCompositeUtils::DecisionContainer > & HypoBase::decisionInput ( ) const

protectedinherited

methods for derived classes to access handles of the base class input other read/write handles may be implemented by derived classes

Definition at line 18 of file HypoBase.cxx.

                                                                                         {
  return m_input;
}

decisionOutput()

const SG::WriteHandleKey< TrigCompositeUtils::DecisionContainer > & HypoBase::decisionOutput ( ) const

protectedinherited

methods for derived classes to access handles of the base class output other read/write handles may be implemented by derived classes

Definition at line 22 of file HypoBase.cxx.

                                                                                           {
  return m_output;
}

declareGaudiProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::declareGaudiProperty ( Gaudi::Property< T, V, H > & hndl, const SG::VarHandleKeyType &  )

inlineprivateinherited

specialization for handling Gaudi::Property<SG::VarHandleKey>

Definition at line 156 of file AthCommonDataStore.h.

  {
    return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
                                                       hndl.value(), 
                                                       hndl.documentation());
 
  }

declareProperty()

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

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

                                                                     {
    typedef typename SG::HandleClassifier<T>::type htype;
    return AthCommonDataStore<PBASE>::declareGaudiProperty(t, htype());
  }

deltaR2()

float TrigHitDVHypoAlg::deltaR2 ( float eta_1, float phi_1, float eta_2, float phi_2 ) const

private

Definition at line 323 of file TrigHitDVHypoAlg.cxx.

                                                                                        {
   float dPhi = CxxUtils::wrapToPi(phi_1 - phi_2);
   float dEta = eta_1 - eta_2;
   return (dPhi*dPhi)+(dEta*dEta);
}

detStore()

const ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::detStore ( ) const

inlineinherited

The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

doMonitor()

StatusCode TrigHitDVHypoAlg::doMonitor ( const xAOD::TrigCompositeContainer * dvContainer ) const

private

Definition at line 456 of file TrigHitDVHypoAlg.cxx.

{
   auto mon_ly0_spfr  = Monitored::Collection(
      "ly0_spfr", *dvContainer, [&](const Decision* d){ return d->getDetail<float>("hitDV_ly0_sp_frac"); });
   auto mon_ly1_spfr  = Monitored::Collection(
      "ly1_spfr", *dvContainer, [&](const Decision* d){ return d->getDetail<float>("hitDV_ly1_sp_frac"); });
   auto mon_ly2_spfr  = Monitored::Collection(
      "ly2_spfr", *dvContainer, [&](const Decision* d){ return d->getDetail<float>("hitDV_ly2_sp_frac"); });
   auto mon_ly3_spfr  = Monitored::Collection(
      "ly3_spfr", *dvContainer, [&](const Decision* d){ return d->getDetail<float>("hitDV_ly3_sp_frac"); });
   auto mon_ly4_spfr  = Monitored::Collection(
      "ly4_spfr", *dvContainer, [&](const Decision* d){ return d->getDetail<float>("hitDV_ly4_sp_frac"); });
   auto mon_ly5_spfr  = Monitored::Collection(
      "ly5_spfr", *dvContainer, [&](const Decision* d){ return d->getDetail<float>("hitDV_ly5_sp_frac"); });
   auto mon_ly6_spfr  = Monitored::Collection(
      "ly6_spfr", *dvContainer, [&](const Decision* d){ return d->getDetail<float>("hitDV_ly6_sp_frac"); });
   auto mon_ly7_spfr  = Monitored::Collection(
      "ly7_spfr", *dvContainer, [&](const Decision* d){ return d->getDetail<float>("hitDV_ly7_sp_frac"); });
   auto mon_bdtscore  = Monitored::Collection(
      "bdtscore", *dvContainer, [&](const Decision* d){ return d->getDetail<float>("hitDV_bdt_score"); });
   auto mon_n_qtrk    = Monitored::Collection(
      "n_qtrk", *dvContainer, [&](const Decision* d){ return d->getDetail<int>("hitDV_n_track_qual"); });
 
   // fill CutMask to split spacespoints into eta regions
   std::vector<char> mask_eta1(dvContainer->size(), 0);
   std::vector<char> mask_1eta2(dvContainer->size(), 0);
   auto mon_eta1_mask  = Monitored::Collection( "cutEta1", mask_eta1 );
   auto mon_1eta2_mask = Monitored::Collection( "cut1Eta2", mask_1eta2 );
 
   for (size_t i = 0; i<dvContainer->size(); ++i) {
      const Decision* dv = (*dvContainer)[i];
 
      // do not fill sp-seeded candidates
      if( dv->getDetail<int>("hitDV_seed_type") == SeedType::SP ) continue;
 
      // fill the cut mask according to eta range
      const float abs_eta = std::abs(dv->getDetail<float>("hitDV_seed_eta"));
      if     ( abs_eta < 1.0 ) mask_eta1[i] = 1;
      else if( abs_eta < 2.0 ) mask_1eta2[i] = 1;
   }
 
   auto monitorIt = Monitored::Group( m_monTool,
                                      mon_ly0_spfr, mon_ly1_spfr, mon_ly2_spfr, mon_ly3_spfr,
                                      mon_ly4_spfr, mon_ly5_spfr, mon_ly6_spfr, mon_ly7_spfr,
                                      mon_n_qtrk, mon_bdtscore, mon_eta1_mask, mon_1eta2_mask );
 
   return StatusCode::SUCCESS;
}

evtStore()

ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::evtStore ( )

inlineinherited

The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

execute()

StatusCode TrigHitDVHypoAlg::execute ( const EventContext & context ) const

overridevirtual

Definition at line 117 of file TrigHitDVHypoAlg.cxx.

{
 
   const TrigRoiDescriptor roi = TrigRoiDescriptor(0, -4.5, 4.5, 0, -M_PI, M_PI, 0, -168.0, 168.0);
   std::vector<TrigSiSpacePointBase> convertedSpacePoints;
   convertedSpacePoints.reserve(5000);
   int mnt_roi_nSPsPIX;
   int mnt_roi_nSPsSCT;
   ATH_CHECK(m_spacePointTool->getSpacePoints(roi, convertedSpacePoints, mnt_roi_nSPsPIX, mnt_roi_nSPsSCT, context));
 
   // monitoring
   auto mon_n_dvtrks     = Monitored::Scalar<int>( "n_dvtrks",     0 );
   auto mon_n_dvsps      = Monitored::Scalar<int>( "n_dvsps",      0 );
   auto mon_n_jetseeds   = Monitored::Scalar<int>( "n_jetseeds",   0 );
   auto mon_n_jetseedsdel= Monitored::Scalar<int>( "n_jetseedsdel",0 );
   auto mon_n_spseeds    = Monitored::Scalar<int>( "n_spseeds",    0 );
   auto mon_n_spseedsdel = Monitored::Scalar<int>( "n_spseedsdel", 0 );
   auto mon_average_mu   = Monitored::Scalar<float>( "average_mu", 0.);
   auto monitorIt        = Monitored::Group( m_monTool, mon_n_dvtrks, mon_n_dvsps, mon_n_jetseeds, mon_n_jetseedsdel, mon_n_spseeds, mon_n_spseedsdel, mon_average_mu );
 
   // previous decisions
   ATH_MSG_DEBUG( "Retrieving pervious decision: \"" << decisionInput().key() << "\"" );
   auto previousDecisionsHandle = SG::makeHandle( decisionInput(), context );
   ATH_CHECK( previousDecisionsHandle.isValid() );
 
   ATH_MSG_DEBUG( "Running with " << previousDecisionsHandle->size() << " previous decisions" );
   if( previousDecisionsHandle->size()!=1 ) {
      ATH_MSG_ERROR( "Previous decision handle size is not 1. It is" << previousDecisionsHandle->size() );
      return StatusCode::FAILURE;
   }
   const Decision * previousDecision = previousDecisionsHandle->at(0);
 
   TrigCompositeUtils::DecisionIDContainer previousDecisionIDs;
   TrigCompositeUtils::decisionIDs(previousDecision, previousDecisionIDs);
   ATH_MSG_DEBUG( "IDs of active legs:" );
   for(auto decisionID: previousDecisionIDs) { ATH_MSG_DEBUG( "    " << decisionID ); }
 
   // new output decisions
   ATH_MSG_DEBUG( "Creating new output decision handle" );
   SG::WriteHandle<DecisionContainer> outputHandle = createAndStore(decisionOutput(), context );
   auto outputDecisions = outputHandle.ptr();
 
   // input objects
 
   // jets
   auto jetsHandle = SG::makeHandle(m_jetsKey, context );
   ATH_CHECK( jetsHandle.isValid() );
   ATH_MSG_DEBUG( "jet handle size: " << jetsHandle->size() );
 
   const xAOD::JetContainer* jetsContainer = jetsHandle.get();
   if( jetsContainer == nullptr ) {
      ATH_MSG_ERROR( "ERROR Cannot get jet container" );
      return StatusCode::FAILURE;
   }
   bool isJetEtPassToolsCut  = false;
   float jetEtaToolsCut = 2.0;
   if( m_tools_loosest_wp >= 3 ) jetEtaToolsCut = 1.0;
   for ( const xAOD::Jet* jet : *jetsContainer ) {
      float jet_pt  = static_cast<float>(jet->pt() / Gaudi::Units::GeV );
      float jet_eta = static_cast<float>(jet->eta());
      if( jet_pt >= m_tools_lowest_jetEt && std::abs(jet_eta)<=jetEtaToolsCut ) {
     isJetEtPassToolsCut = true;
     break;
      }
   }
 
   auto tracks = SG::makeHandle( m_tracksKey, context );
   ATH_CHECK(tracks.isValid());
 
   std::vector<HitDVSeed> hitDVSeedsContainer;
   std::vector<HitDVTrk> hitDVTrksContainer;
   std::vector<HitDVSpacePoint> hitDVSPsContainer;
 
 
   ATH_CHECK( findHitDV(context, convertedSpacePoints, *tracks, hitDVSeedsContainer, hitDVTrksContainer, hitDVSPsContainer) );
 
   mon_n_dvtrks = hitDVTrksContainer.size();
   mon_n_dvsps  = hitDVSPsContainer.size();
   const unsigned int N_MAX_SP_STORED = 100000;
   bool isSPOverflow = false;
   if( hitDVSPsContainer.size() >= N_MAX_SP_STORED ) isSPOverflow = true;
   ATH_MSG_DEBUG( "hitDVSP size=" << mon_n_dvsps );
 
   // average mu
   float averageMu = 0;
   if( m_isMC ) {
      if( m_lumiBlockMuTool ) {
     averageMu = static_cast<float>(m_lumiBlockMuTool->averageInteractionsPerCrossing(context));
     ATH_MSG_DEBUG( "offline averageMu = " << averageMu );
      }
   }
   else {
      SG::ReadCondHandle<LuminosityCondData> lcd (m_lumiDataKey,context);
      averageMu = lcd.cptr()->lbAverageInteractionsPerCrossing();
      ATH_MSG_DEBUG( "online averageMu = " << averageMu );
   }
   mon_average_mu = averageMu;
 
   // find seeds based on HLT jets
   std::vector<float> jetSeeds_pt;
   std::vector<float> jetSeeds_eta;
   std::vector<float> jetSeeds_phi;
   ATH_CHECK( findJetSeeds(jetsContainer, m_jetSeed_ptMin, m_jetSeed_etaMax, jetSeeds_pt, jetSeeds_eta, jetSeeds_phi) );
   int n_alljetseeds = jetSeeds_eta.size();
   ATH_CHECK( selectSeedsNearby(hitDVSeedsContainer, jetSeeds_eta, jetSeeds_phi, jetSeeds_pt) );
   mon_n_jetseeds = jetSeeds_eta.size();
   mon_n_jetseedsdel = n_alljetseeds - jetSeeds_eta.size();
 
   // find seeds based on SP frac itself
   std::vector<float> spSeeds_eta;
   std::vector<float> spSeeds_phi;
   std::vector<float> void_pt;
   int n_allspseeds = 0;
   if( m_tools_loosest_wp <= 1 ) {
      ATH_CHECK( findSPSeeds(context, hitDVSPsContainer, spSeeds_eta, spSeeds_phi) );
      n_allspseeds  = spSeeds_eta.size();
      ATH_CHECK( selectSeedsNearby(hitDVSeedsContainer, spSeeds_eta, spSeeds_phi, void_pt) );
      mon_n_spseeds = spSeeds_eta.size();
      mon_n_spseedsdel = n_allspseeds - spSeeds_eta.size();
   }
   else {
      mon_n_spseeds    = 0;
      mon_n_spseedsdel = 0;
   }
 
   // output EDM object
   auto hitDVContainer    = std::make_unique<xAOD::TrigCompositeContainer>();
   auto hitDVContainerAux = std::make_unique<xAOD::TrigCompositeAuxContainer>();
   hitDVContainer->setStore(hitDVContainerAux.get());
 
   xAOD::TrigCompositeContainer* dvContainer = hitDVContainer.get();
   std::vector<TrigHitDVHypoTool::HitDVHypoInfo>  hitDVHypoInputs;
   std::unordered_map<Decision*, size_t>          mapDecIdx;
 
   // calculate BDT and create hitDVContainer EDM
   if( isJetEtPassToolsCut ) {
      const float preselBDTthreshold = -0.6;
 
      int n_passed_jet = 0;
      int seed_type = SeedType::HLTJet;
      ATH_CHECK( calculateBDT(hitDVSPsContainer, hitDVTrksContainer, jetSeeds_pt, jetSeeds_eta, jetSeeds_phi, preselBDTthreshold, seed_type, dvContainer, n_passed_jet) );
 
      int n_passed_sp = 0;
      if( m_tools_loosest_wp <= 1 ) {
     seed_type = SeedType::SP;
     ATH_CHECK( calculateBDT(hitDVSPsContainer, hitDVTrksContainer, void_pt, spSeeds_eta, spSeeds_phi, preselBDTthreshold, seed_type, dvContainer, n_passed_sp) );
      }
 
      ATH_MSG_DEBUG( "nr of dv container / jet-seeded / sp-seed candidates = " << dvContainer->size() << " / " << n_passed_jet << " / " << n_passed_sp );
 
      // Prepare inputs to HypoTool
      for ( auto dv : *dvContainer ) {
     Decision* newDecision = TrigCompositeUtils::newDecisionIn( outputDecisions, previousDecision, TrigCompositeUtils::hypoAlgNodeName(), context);
     mapDecIdx.emplace( newDecision, dv->index() );
     TrigHitDVHypoTool::HitDVHypoInfo hypoInfo{ newDecision, isSPOverflow, averageMu, dv, previousDecisionIDs };
     hitDVHypoInputs.push_back( hypoInfo );
      }
   }
 
   // monitor
   ATH_CHECK( doMonitor(dvContainer) );
 
   // Loop over all hypoToolinputs and get their decisions
   for ( auto & tool: m_hypoTools ) {
      ATH_MSG_DEBUG( "+++++ Now computing decision for " << tool->name() );
      ATH_CHECK( tool->decide( hitDVHypoInputs ) );
   }
 
   // record hitDV object
   SG::WriteHandle<xAOD::TrigCompositeContainer> hitDVHandle(m_hitDVKey, context);
   ATH_CHECK( hitDVHandle.record( std::move( hitDVContainer ), std::move( hitDVContainerAux ) ) );
   ATH_MSG_DEBUG( "recorded hitDV object to SG" );
 
   DecisionContainer::iterator it = outputDecisions->begin();
   while(it != outputDecisions->end()) {
      ATH_MSG_DEBUG( "+++++ outputDecision: " << *it << " +++++" );
      if ( allFailed( *it ) ) {
         ATH_MSG_DEBUG( "---> all failed, erasing" );
         it = outputDecisions->erase(it);
      } else {
         ATH_MSG_DEBUG( "---> not all failed" );
 
         // Link hitDV object
         auto     decision = *it;
         size_t   idx = mapDecIdx.at(*it);
 
         ElementLink<xAOD::TrigCompositeContainer> dvEL = ElementLink<xAOD::TrigCompositeContainer>(*hitDVHandle, idx, context);
         ATH_CHECK( dvEL.isValid() );
 
         ATH_CHECK( decision->setObjectLink<xAOD::TrigCompositeContainer>(featureString(), dvEL) );
 
         ATH_MSG_DEBUG(*decision);
         ++it;
      }
   }
 
   //
   ATH_CHECK( hypoBaseOutputProcessing(outputHandle) );
 
   //
   return StatusCode::SUCCESS;
}

extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::extraDeps_update_handler ( Gaudi::Details::PropertyBase & ExtraDeps )

protectedinherited

Add StoreName to extra input/output deps as needed.

use the logic of the VarHandleKey to parse the DataObjID keys supplied via the ExtraInputs and ExtraOuputs Properties to add the StoreName if it's not explicitly given

extraOutputDeps()

const DataObjIDColl & AthCommonReentrantAlgorithm< Gaudi::Algorithm >::extraOutputDeps ( ) const

overridevirtualinherited

Return the list of extra output dependencies.

This list is extended to include symlinks implied by inheritance relations.

Definition at line 94 of file AthCommonReentrantAlgorithm.cxx.

{
  // If we didn't find any symlinks to add, just return the collection
  // from the base class.  Otherwise, return the extended collection.
  if (!m_extendedExtraObjects.empty()) {
    return m_extendedExtraObjects;
  }
  return BaseAlg::extraOutputDeps();
}

filterPassed()

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

inlinevirtualinherited

Definition at line 96 of file AthCommonReentrantAlgorithm.h.

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

findHitDV()

StatusCode TrigHitDVHypoAlg::findHitDV ( const EventContext & ctx, const std::vector< TrigSiSpacePointBase > & convertedSpacePoints, const DataVector< Trk::Track > & tracks, std::vector< HitDVSeed > & hitDVSeedsContainer, std::vector< HitDVTrk > & hitDVTrksContainer, std::vector< HitDVSpacePoint > & hitDVSPContainer ) const

private

Definition at line 1119 of file TrigHitDVHypoAlg.cxx.

{
   std::vector<int>   v_dvtrk_id;
   std::vector<float> v_dvtrk_pt;
   std::vector<float> v_dvtrk_eta;
   std::vector<float> v_dvtrk_phi;
   std::vector<int>   v_dvtrk_n_hits_inner;
   std::vector<int>   v_dvtrk_n_hits_pix;
   std::vector<int>   v_dvtrk_n_hits_sct;
   std::vector<float> v_dvtrk_a0beam;
   std::unordered_map<Identifier, int> umap_fittedTrack_identifier;
   int fittedTrack_id = -1;
 
   static constexpr float TRKCUT_PTGEV_HITDV = 0.5;
 
   for (const auto track: tracks) {
      float shift_x = 0; float shift_y = 0;
      if(m_useBeamSpot) {
         SG::ReadCondHandle<InDet::BeamSpotData> beamSpotHandle { m_beamSpotKey, ctx };
        FTF::getBeamSpotShift(shift_x, shift_y, **beamSpotHandle);
      }
      trackInfo theTrackInfo;
      bool igt = FTF::isGoodTrackUTT(track, theTrackInfo, shift_x, shift_y, TRKCUT_PTGEV_HITDV);
      if (not igt) {continue;}
 
      fittedTrack_id++;
      ATH_MSG_DEBUG("Selected track pT = " << theTrackInfo.ptGeV << " GeV");
      
 
      DataVector<const Trk::MeasurementBase>::const_iterator
     m  = track->measurementsOnTrack()->begin(),
     me = track->measurementsOnTrack()->end  ();
      for(; m!=me; ++m ) {
     const Trk::PrepRawData* prd = ((const Trk::RIO_OnTrack*)(*m))->prepRawData();
     if( prd == nullptr ) continue;
     Identifier id_prd = prd->identify();
     if( umap_fittedTrack_identifier.find(id_prd) == umap_fittedTrack_identifier.end() ) {
        umap_fittedTrack_identifier.insert(std::make_pair(id_prd,fittedTrack_id));
     }
      }
      float phi = track->perigeeParameters()->parameters()[Trk::phi];
      v_dvtrk_id.push_back(fittedTrack_id);
      v_dvtrk_pt.push_back(theTrackInfo.ptGeV*Gaudi::Units::GeV);
      v_dvtrk_eta.push_back(theTrackInfo.eta);
      v_dvtrk_phi.push_back(phi);
      v_dvtrk_n_hits_inner.push_back(theTrackInfo.n_hits_inner);
      v_dvtrk_n_hits_pix.push_back(theTrackInfo.n_hits_pix);
      v_dvtrk_n_hits_sct.push_back(theTrackInfo.n_hits_sct);
      v_dvtrk_a0beam.push_back(theTrackInfo.a0beam);
   }
   ATH_MSG_DEBUG("Nr of selected tracks / all = " << fittedTrack_id << " / " << tracks.size());
   ATH_MSG_DEBUG("Nr of Identifiers used by selected tracks = " << umap_fittedTrack_identifier.size());
 
   // space points
   int n_sp           = 0;
   int n_sp_usedByTrk = 0;
 
   std::unordered_map<Identifier, int> umap_sp_identifier;
   umap_sp_identifier.reserve(1.3*convertedSpacePoints.size());//up to 2 Identifiers per spacepoint, end up with 1.3 from measurements
 
   auto add_to_sp_map = [&](const Trk::PrepRawData* prd) {
     if (prd) {
       Identifier id_prd =  prd->identify();
       if( umap_sp_identifier.find(id_prd) == umap_sp_identifier.end() ) {
         umap_sp_identifier.insert(std::make_pair(id_prd,-1));
       }
     }
   };
 
   for(unsigned int iSp=0; iSp<convertedSpacePoints.size(); ++iSp) {
      bool isPix = convertedSpacePoints[iSp].isPixel();
      bool isSct = convertedSpacePoints[iSp].isSCT();
      if( ! isPix && ! isSct ) continue;
      const Trk::SpacePoint* sp = convertedSpacePoints[iSp].offlineSpacePoint();
      add_to_sp_map(sp->clusterList().first);
      add_to_sp_map(sp->clusterList().second);
   }
   int n_id_usedByTrack = 0;
   for(auto it=umap_sp_identifier.begin(); it!=umap_sp_identifier.end(); ++it) {
     Identifier id_sp = it->first;
     if( umap_fittedTrack_identifier.find(id_sp) != umap_fittedTrack_identifier.end() ) {
       umap_sp_identifier[id_sp] = umap_fittedTrack_identifier[id_sp];
       ++n_id_usedByTrack;
     }
   }
   ATH_MSG_DEBUG("Nr of SPs / Identifiers (all) / Identifiers (usedByTrack) = " << convertedSpacePoints.size() << " / " << umap_sp_identifier.size() << " / " << n_id_usedByTrack);
 
   auto sp_map_used_id = [&](const Trk::PrepRawData* prd) {
     int usedTrack_id = -1;
     if (prd) {
       Identifier id_prd =  prd->identify();
       if( umap_sp_identifier.find(id_prd) != umap_sp_identifier.end() ) {
         usedTrack_id = umap_sp_identifier[id_prd];
       }
     }
     return usedTrack_id;
   };
 
   std::vector<float> v_sp_eta;
   v_sp_eta.reserve(convertedSpacePoints.size());
   std::vector<float> v_sp_r;
   v_sp_r.reserve(convertedSpacePoints.size());
   std::vector<float> v_sp_phi;
   v_sp_phi.reserve(convertedSpacePoints.size());
   std::vector<int>   v_sp_layer;
   v_sp_layer.reserve(convertedSpacePoints.size());
   std::vector<bool>  v_sp_isPix;
   v_sp_isPix.reserve(convertedSpacePoints.size());
   std::vector<bool>  v_sp_isSct;
   v_sp_isSct.reserve(convertedSpacePoints.size());
   std::vector<int>   v_sp_usedTrkId;
   v_sp_usedTrkId.reserve(convertedSpacePoints.size());
 
   for(const auto& sp : convertedSpacePoints) {
      bool isPix = sp.isPixel();
      bool isSct = sp.isSCT();
      if( ! isPix && ! isSct ) continue;
      const Trk::SpacePoint* osp = sp.offlineSpacePoint();
      
      int usedTrack_id  = -1;
      int usedTrack_id_first = sp_map_used_id(osp->clusterList().first);
      if (usedTrack_id_first != -1) {
        usedTrack_id = usedTrack_id_first;
      }
      int usedTrack_id_second = sp_map_used_id(osp->clusterList().second);
      if (usedTrack_id_second != -1) {
        usedTrack_id = usedTrack_id_second;
      }
 
      //
      n_sp++;
      if( usedTrack_id != -1 ) n_sp_usedByTrk++;
      int  layer = sp.layer();
      float sp_r = sp.r();
 
      const Amg::Vector3D& pos_sp = osp->globalPosition();//Go back to globalPosition to get the non-shifted spacepoint positions
      float sp_eta = pos_sp.eta();
      float sp_phi = pos_sp.phi();
 
      v_sp_eta.push_back(sp_eta);
      v_sp_r.push_back(sp_r);
      v_sp_phi.push_back(sp_phi);
      v_sp_layer.push_back(layer);
      v_sp_isPix.push_back(isPix);
      v_sp_isSct.push_back(isSct);
      v_sp_usedTrkId.push_back(usedTrack_id);
 
      ATH_MSG_VERBOSE("+++ SP eta / phi / layer / ixPix / usedTrack_id = " << sp_eta << " / " << sp_phi << " / " << layer << " / " << isPix << " / " << usedTrack_id);
 
   }
   ATH_MSG_DEBUG("Nr of SPs / all = " << n_sp << " / " << convertedSpacePoints.size());
   ATH_MSG_DEBUG("Nr of SPs used by selected tracks = " << n_sp_usedByTrk);
 
   // Seed
   std::vector<float>   v_seeds_eta;
   std::vector<float>   v_seeds_phi;
   std::vector<int16_t> v_seeds_type;
 
   if( m_doHitDV_Seeding ) {
 
      // add L1 Jet seeds
      const unsigned int L1JET_ET_CUT = 27; // Mapping from legacy J30, make configurable?
 
      auto jetRoiCollectionHandle = SG::makeHandle( m_jetRoiCollectionKey, ctx );
      const DataVector<xAOD::jFexSRJetRoI> *jetRoiCollection = jetRoiCollectionHandle.cptr();
      if (!jetRoiCollectionHandle.isValid()){
          ATH_MSG_ERROR("ReadHandle for DataVector<xAOD::jFexSRJetRoI> key:" << m_jetRoiCollectionKey.key() << " isn't Valid");
          return StatusCode::FAILURE;
      }
      for (size_t size=0; size<jetRoiCollection->size(); ++size){
         const xAOD::jFexSRJetRoI* jetRoI = jetRoiCollection->at(size);
         if( jetRoI == nullptr ) continue;
         // Good seed
         if( jetRoI->et() >= L1JET_ET_CUT ) {
            v_seeds_eta.push_back(jetRoI->eta());
            v_seeds_phi.push_back(jetRoI->phi());
            v_seeds_type.push_back(0); // L1_J:0
         }
      }
      ATH_MSG_DEBUG("Nr of L1_J" << L1JET_ET_CUT << " seeds = " << v_seeds_eta.size());
 
      // space-point based (unseeded mode)
      std::vector<float> v_spseeds_eta;
      std::vector<float> v_spseeds_phi;
      ATH_CHECK( findSPSeeds(ctx, v_sp_eta, v_sp_phi, v_sp_layer, v_sp_usedTrkId, v_spseeds_eta, v_spseeds_phi) );
      ATH_MSG_DEBUG("Nr of SP seeds = " << v_spseeds_eta.size());
      for(size_t idx=0; idx<v_spseeds_eta.size(); ++idx) {
         v_seeds_eta.push_back(v_spseeds_eta[idx]);
         v_seeds_phi.push_back(v_spseeds_phi[idx]);
         v_seeds_type.push_back(1); // SP: 1
      }
      ATH_MSG_DEBUG("Nr of SP + L1_J" << L1JET_ET_CUT << " seeds = " << v_seeds_eta.size());
   }
 
   // fill objects
 
   // seeds
   const int N_MAX_SEEDS = 200;
   int n_seeds = std::min(N_MAX_SEEDS,(int)v_seeds_eta.size());
   hitDVSeedsContainer.reserve(n_seeds);
   for(auto iSeed=0; iSeed < n_seeds; ++iSeed) {
      HitDVSeed seed;
      seed.eta = v_seeds_eta[iSeed];
      seed.phi = v_seeds_phi[iSeed];
      seed.type = v_seeds_type[iSeed];
      hitDVSeedsContainer.push_back(seed);
   }
 
   // track
   const float TRKCUT_DELTA_R_TO_SEED = 1.0;
   hitDVTrksContainer.reserve(v_dvtrk_pt.size());
   for(unsigned int iTrk=0; iTrk<v_dvtrk_pt.size(); ++iTrk) {
      float trk_eta = v_dvtrk_eta[iTrk];
      float trk_phi = v_dvtrk_phi[iTrk];
      if( m_doHitDV_Seeding ) {
     bool isNearSeed = false;
     for (unsigned int iSeed=0; iSeed<v_seeds_eta.size(); ++iSeed) {
        float seed_eta = v_seeds_eta[iSeed];
        float seed_phi = v_seeds_phi[iSeed];
        float dR2 = deltaR2(trk_eta,trk_phi,seed_eta,seed_phi);
        if( dR2 <= TRKCUT_DELTA_R_TO_SEED*TRKCUT_DELTA_R_TO_SEED ) { isNearSeed = true; break; }
     }
     if( ! isNearSeed ) continue;
      }
      HitDVTrk hitDVTrk;
      hitDVTrk.id           = v_dvtrk_id[iTrk];
      hitDVTrk.pt           = v_dvtrk_pt[iTrk];
      hitDVTrk.eta          = v_dvtrk_eta[iTrk];
      hitDVTrk.phi          = v_dvtrk_phi[iTrk];
      hitDVTrk.n_hits_inner = v_dvtrk_n_hits_inner[iTrk];
      hitDVTrk.n_hits_pix   = v_dvtrk_n_hits_pix[iTrk];
      hitDVTrk.n_hits_sct   = v_dvtrk_n_hits_sct[iTrk];
      hitDVTrk.a0beam       = v_dvtrk_a0beam[iTrk];
      
      hitDVTrksContainer.push_back(hitDVTrk);
   }
 
   // space points
   const float SPCUT_DELTA_R_TO_SEED = 1.0;
   const size_t n_sp_max = std::min<size_t>(100000, v_sp_eta.size());
   size_t n_sp_stored = 0;
 
   hitDVSPsContainer.reserve(n_sp_max);
 
   for(size_t iSp=0; iSp<v_sp_eta.size(); ++iSp) {
     if( m_doHitDV_Seeding ) {
       const float sp_eta = v_sp_eta[iSp];
       const float sp_phi = v_sp_phi[iSp];
       bool isNearSeed = false;
       for (size_t iSeed=0; iSeed<v_seeds_eta.size(); ++iSeed) {
         const float seed_eta = v_seeds_eta[iSeed];
         const float seed_phi = v_seeds_phi[iSeed];
         const float dR2 = deltaR2(sp_eta, sp_phi, seed_eta, seed_phi);
         if( dR2 <= SPCUT_DELTA_R_TO_SEED*SPCUT_DELTA_R_TO_SEED ) { isNearSeed = true; break; }
       }
       if( ! isNearSeed ) continue;
     }
     if( n_sp_stored >= n_sp_max ) break;
     HitDVSpacePoint hitDVSP;
     hitDVSP.eta = v_sp_eta[iSp];
     hitDVSP.r   = v_sp_r[iSp];
     hitDVSP.phi = v_sp_phi[iSp];
     hitDVSP.layer = v_sp_layer[iSp];
     hitDVSP.isPix = v_sp_isPix[iSp];
     hitDVSP.isSct = v_sp_isSct[iSp];
     hitDVSP.usedTrkId = v_sp_usedTrkId[iSp];
     hitDVSPsContainer.push_back(hitDVSP);
     ++n_sp_stored;
   }
   ATH_MSG_DEBUG("Nr of SPs stored = " << n_sp_stored);
 
   return StatusCode::SUCCESS;
}

findJetSeeds()

StatusCode TrigHitDVHypoAlg::findJetSeeds ( const xAOD::JetContainer * jetsContainer, const float cutJetPt, const float cutJetEta, std::vector< float > & jetSeeds_pt, std::vector< float > & jetSeeds_eta, std::vector< float > & jetSeeds_phi ) const

private

Definition at line 651 of file TrigHitDVHypoAlg.cxx.

{
   std::vector<float> mnt_jet_pt;
   std::vector<float> mnt_jet_eta;
   auto mon_jet_pt  = Monitored::Collection("jet_pt",  mnt_jet_pt);
   auto mon_jet_eta = Monitored::Collection("jet_eta", mnt_jet_eta);
   auto monitorIt   = Monitored::Group( m_monTool, mon_jet_pt, mon_jet_eta );
 
   ATH_MSG_VERBOSE("looking for jet seed with pt cut=" << cutJetPt << ", eta cut=" << cutJetEta);
   for ( const xAOD::Jet* jet : *jetsContainer ) {
      float jet_pt  = static_cast<float>(jet->pt() / Gaudi::Units::GeV );
      if( jet_pt < cutJetPt ) {
     ATH_MSG_VERBOSE("Fails jet pt cut, pt = " << jet_pt);
     continue;
      }
      mnt_jet_pt.push_back(jet_pt);
      float jet_eta = static_cast<float>(jet->eta());
      mnt_jet_eta.push_back(jet_eta);
      if( std::fabs(jet_eta) > cutJetEta ) {
     ATH_MSG_VERBOSE("Fails jet eta cut, eta = " << jet_eta);
     continue;
      }
      float jet_phi = static_cast<float>(jet->phi());
      jetSeeds_pt.push_back(jet_pt);
      jetSeeds_eta.push_back(jet_eta);
      jetSeeds_phi.push_back(jet_phi);
   }
   ATH_MSG_VERBOSE("nr of jet seeds=" << jetSeeds_eta.size());
 
   return StatusCode::SUCCESS;
}

findSPSeeds() [1/2]

StatusCode TrigHitDVHypoAlg::findSPSeeds ( const EventContext & ctx, const std::vector< HitDVSpacePoint > & spsContainer, std::vector< float > & seeds_eta, std::vector< float > & seeds_phi ) const

private

Definition at line 687 of file TrigHitDVHypoAlg.cxx.

{
   seeds_eta.clear();
   seeds_phi.clear();
 
   const int   NBINS_ETA = 50;
   const float ETA_MIN   = -2.5;
   const float ETA_MAX   =  2.5;
 
   const int   NBINS_PHI = 80;
   const float PHI_MIN   = -4.0;
   const float PHI_MAX   =  4.0;
 
   char hname[64];
 
   unsigned int slotnr    = ctx.slot();
   unsigned int subSlotnr = ctx.subSlot();
 
   sprintf(hname,"hitdv_s%u_ss%u_ly6_h2_nsp",slotnr,subSlotnr);
   std::unique_ptr<TH2F> ly6_h2_nsp = std::make_unique<TH2F>(hname,hname,NBINS_ETA,ETA_MIN,ETA_MAX,NBINS_PHI,PHI_MIN,PHI_MAX);
   sprintf(hname,"hitdv_s%u_ss%u_ly7_h2_nsp",slotnr,subSlotnr);
   std::unique_ptr<TH2F> ly7_h2_nsp = std::make_unique<TH2F>(hname,hname,NBINS_ETA,ETA_MIN,ETA_MAX,NBINS_PHI,PHI_MIN,PHI_MAX);
 
   sprintf(hname,"hitdv_s%u_ss%u_ly6_h2_nsp_notrk",slotnr,subSlotnr);
   std::unique_ptr<TH2F> ly6_h2_nsp_notrk = std::make_unique<TH2F>(hname,hname,NBINS_ETA,ETA_MIN,ETA_MAX,NBINS_PHI,PHI_MIN,PHI_MAX);
   sprintf(hname,"hitdv_s%u_ss%u_ly7_h2_nsp_notrk",slotnr,subSlotnr);
   std::unique_ptr<TH2F> ly7_h2_nsp_notrk = std::make_unique<TH2F>(hname,hname,NBINS_ETA,ETA_MIN,ETA_MAX,NBINS_PHI,PHI_MIN,PHI_MAX);
 
   for ( const auto& spData : spsContainer ) {
      int16_t sp_layer = spData.layer;
      float sp_eta = spData.eta;
      int ilayer = getSPLayer(sp_layer,sp_eta);
      if( ilayer<6 ) continue;
 
      int sp_trkid = (int)spData.usedTrkId;
      bool isUsedByTrk = (sp_trkid != -1);
      float sp_phi = spData.phi;
 
      bool fill_out_of_pi = false;
      float sp_phi2 = 0;
      if( sp_phi < 0 ) {
     sp_phi2 = 2*TMath::Pi() + sp_phi;
     if( sp_phi2 < PHI_MAX ) fill_out_of_pi = true;
      }
      else {
     sp_phi2 = -2*TMath::Pi() + sp_phi;
     if( PHI_MIN < sp_phi2 ) fill_out_of_pi = true;
      }
      if( ilayer==6 ) {
                          ly6_h2_nsp->Fill(sp_eta,sp_phi);
     if( fill_out_of_pi ) ly6_h2_nsp->Fill(sp_eta,sp_phi2);
     if( ! isUsedByTrk )                  ly6_h2_nsp_notrk->Fill(sp_eta,sp_phi);
     if( ! isUsedByTrk && fill_out_of_pi) ly6_h2_nsp_notrk->Fill(sp_eta,sp_phi2);
      }
      if( ilayer==7 ) {
                          ly7_h2_nsp->Fill(sp_eta,sp_phi);
     if( fill_out_of_pi ) ly7_h2_nsp->Fill(sp_eta,sp_phi2);
     if( ! isUsedByTrk )                  ly7_h2_nsp_notrk->Fill(sp_eta,sp_phi);
     if( ! isUsedByTrk && fill_out_of_pi) ly7_h2_nsp_notrk->Fill(sp_eta,sp_phi2);
      }
   }
 
   ATH_MSG_VERBOSE("looking for ly6/ly6 doublet seeds");
 
   // (idx, sort/weight, eta, phi)
   std::vector<std::tuple<int,float,float,float>> QT;
 
   for(int ly6_ieta=1; ly6_ieta<=NBINS_ETA; ly6_ieta++) {
      float ly6_eta = (ly6_h2_nsp->GetXaxis()->GetBinLowEdge(ly6_ieta) + ly6_h2_nsp->GetXaxis()->GetBinUpEdge(ly6_ieta))/2.0;
      for(int ly6_iphi=1; ly6_iphi<=NBINS_PHI; ly6_iphi++) {
     float ly6_phi = (ly6_h2_nsp->GetYaxis()->GetBinLowEdge(ly6_iphi) + ly6_h2_nsp->GetYaxis()->GetBinUpEdge(ly6_iphi))/2.0;
 
     float ly6_nsp       = ly6_h2_nsp      ->GetBinContent(ly6_ieta,ly6_iphi);
     float ly6_nsp_notrk = ly6_h2_nsp_notrk->GetBinContent(ly6_ieta,ly6_iphi);
     float ly6_frac      = ( ly6_nsp > 0 ) ? ly6_nsp_notrk / ly6_nsp : 0;
     if( ly6_nsp < 10 || ly6_frac < 0.85 ) continue;
 
     float ly7_frac_max = 0;
     float ly7_eta_max  = 0;
     float ly7_phi_max  = 0;
     for(int ly7_ieta=std::max(1,ly6_ieta-1); ly7_ieta<std::min(NBINS_ETA,ly6_ieta+1); ly7_ieta++) {
        for(int ly7_iphi=std::max(1,ly6_iphi-1); ly7_iphi<=std::min(NBINS_PHI,ly6_iphi+1); ly7_iphi++) {
           float ly7_nsp       = ly7_h2_nsp      ->GetBinContent(ly7_ieta,ly7_iphi);
           float ly7_nsp_notrk = ly7_h2_nsp_notrk->GetBinContent(ly7_ieta,ly7_iphi);
           float ly7_frac      = ( ly7_nsp > 0 ) ? ly7_nsp_notrk / ly7_nsp : 0;
           if( ly7_nsp < 10 ) continue;
           if( ly7_frac > ly7_frac_max ) {
          ly7_frac_max = ly7_frac;
          ly7_eta_max  = (ly7_h2_nsp->GetXaxis()->GetBinLowEdge(ly7_ieta) + ly7_h2_nsp->GetXaxis()->GetBinUpEdge(ly7_ieta))/2.0;
          ly7_phi_max  = (ly7_h2_nsp->GetXaxis()->GetBinLowEdge(ly7_iphi) + ly7_h2_nsp->GetXaxis()->GetBinUpEdge(ly7_iphi))/2.0;
           }
        }
     }
     if( ly7_frac_max < 0.85 ) continue;
     //
     float wsum = ly6_frac + ly7_frac_max;
     float weta = (ly6_eta*ly6_frac + ly7_eta_max*ly7_frac_max) / wsum;
     float wphi = (ly6_phi*ly6_frac + ly7_phi_max*ly7_frac_max) / wsum;
     float w = wsum / 2.0;
     QT.push_back(std::make_tuple(-1,w,weta,wphi));
      }
   }
   ATH_MSG_VERBOSE("nr of ly6/ly7 doublet candidate seeds=" << QT.size() << ", doing clustering...");
 
   // sort
   std::sort(QT.begin(), QT.end(),
         [](const std::tuple<int,float,float,float>& lhs, const std::tuple<int,float,float,float>& rhs) {
        return std::get<1>(lhs) > std::get<1>(rhs); } );
 
   // clustering
   const double CLUSTCUT_DIST_SQUARED = 0.04; // const double CLUSTCUT_DIST = 0.2;
   const double CLUSTCUT_SEED_FRAC    = 0.9;
 
   std::vector<float> seeds_wsum;
 
   for(unsigned int i=0; i<QT.size(); i++) {
      float phi  = std::get<3>(QT[i]);
      float eta  = std::get<2>(QT[i]);
      float w    = std::get<1>(QT[i]);
      if(i==0) {
     seeds_eta.push_back(w*eta); seeds_phi.push_back(w*phi);
     seeds_wsum.push_back(w);
     continue;
      }
      const int IDX_INITIAL = 100;
      float dist2_min = 100.0;
      int idx_min     = IDX_INITIAL;
      for(unsigned j=0; j<seeds_eta.size(); j++) {
     float ceta = seeds_eta[j]/seeds_wsum[j];
     float cphi = seeds_phi[j]/seeds_wsum[j];
     // intentionally calculate in this way as phi is defined beyond -Pi/Pi (no boundary)
     float deta  = std::fabs(ceta-eta);
     float dphi  = std::fabs(cphi-phi);
     float dist2 = dphi*dphi+deta*deta;
     if( dist2 < dist2_min ) {
        dist2_min = dist2;
        idx_min  = j;
     }
      }
      int match_idx = IDX_INITIAL;
      if( idx_min != IDX_INITIAL ) {
     if( dist2_min < CLUSTCUT_DIST_SQUARED ) { match_idx = idx_min; }
      }
      if( match_idx == IDX_INITIAL ) {
     if( w > CLUSTCUT_SEED_FRAC && dist2_min > CLUSTCUT_DIST_SQUARED ) {
        seeds_eta.push_back(w*eta); seeds_phi.push_back(w*phi);
        seeds_wsum.push_back(w);
     }
     continue;
      }
      float new_eta   = seeds_eta[match_idx]  + w*eta;
      float new_phi   = seeds_phi[match_idx]  + w*phi;
      float new_wsum  = seeds_wsum[match_idx] + w;
      seeds_eta[match_idx]   = new_eta;
      seeds_phi[match_idx]   = new_phi;
      seeds_wsum[match_idx]  = new_wsum;
   }
   QT.clear();
   for(unsigned int i=0; i<seeds_eta.size(); i++) {
      float eta = seeds_eta[i] / seeds_wsum[i];
      float phi = seeds_phi[i] / seeds_wsum[i];
      seeds_eta[i] = eta;
      seeds_phi[i] = phi;
      if( phi < -TMath::Pi() ) phi =  2*TMath::Pi() + phi;
      if( phi >  TMath::Pi() ) phi = -2*TMath::Pi() + phi;
      seeds_phi[i] = phi;
   }
   ATH_MSG_VERBOSE("after clustering, nr of seeds = " << seeds_eta.size());
 
   // delete overlap (can happen at phi=-Pi/Pi bounadry)
   std::vector<unsigned int> idx_to_delete;
   for(unsigned int i=0; i<seeds_eta.size(); i++) {
      if( std::find(idx_to_delete.begin(),idx_to_delete.end(),i) != idx_to_delete.end() ) continue;
      float eta_i = seeds_eta[i];
      float phi_i = seeds_phi[i];
      for(unsigned int j=i+1; j<seeds_eta.size(); j++) {
     if( std::find(idx_to_delete.begin(),idx_to_delete.end(),j) != idx_to_delete.end() ) continue;
     float eta_j = seeds_eta[j];
     float phi_j = seeds_phi[j];
     float dR2 = deltaR2(eta_i,phi_i,eta_j,phi_j);
     if( dR2 < CLUSTCUT_DIST_SQUARED ) idx_to_delete.push_back(j);
      }
   }
   ATH_MSG_VERBOSE("nr of duplicated seeds to be removed = " << idx_to_delete.size());
   if( idx_to_delete.size() > 0 ) {
      std::sort(idx_to_delete.begin(),idx_to_delete.end());
      for(unsigned int j=idx_to_delete.size(); j>0; j--) {
     unsigned int idx = idx_to_delete[j-1];
     seeds_eta.erase(seeds_eta.begin()+idx);
     seeds_phi.erase(seeds_phi.begin()+idx);
      }
   }
 
   ATH_MSG_VERBOSE("nr of ly6/ly7 seeds=" << seeds_eta.size());
 
   // return
   return StatusCode::SUCCESS;
}

findSPSeeds() [2/2]

StatusCode TrigHitDVHypoAlg::findSPSeeds ( const EventContext & ctx, const std::vector< float > & v_sp_eta, const std::vector< float > & v_sp_phi, const std::vector< int > & v_sp_layer, const std::vector< int > & v_sp_usedTrkId, std::vector< float > & seeds_eta, std::vector< float > & seeds_phi ) const

private

Definition at line 920 of file TrigHitDVHypoAlg.cxx.

{
   const int   NBINS_ETA = 50;
   const float ETA_MIN   = -2.5;
   const float ETA_MAX   =  2.5;
 
   const int   NBINS_PHI = 80;
   const float PHI_MIN   = -4.0;
   const float PHI_MAX   =  4.0;
 
   char hname[64];
 
   unsigned int slotnr    = ctx.slot();
   unsigned int subSlotnr = ctx.subSlot();
 
   sprintf(hname,"ftf_s%u_ss%u_ly6_h2_nsp",slotnr,subSlotnr);
   std::unique_ptr<TH2F> ly6_h2_nsp = std::make_unique<TH2F>(hname,hname,NBINS_ETA,ETA_MIN,ETA_MAX,NBINS_PHI,PHI_MIN,PHI_MAX);
   sprintf(hname,"ftf_s%u_ss%u_ly7_h2_nsp",slotnr,subSlotnr);
   std::unique_ptr<TH2F> ly7_h2_nsp = std::make_unique<TH2F>(hname,hname,NBINS_ETA,ETA_MIN,ETA_MAX,NBINS_PHI,PHI_MIN,PHI_MAX);
 
   sprintf(hname,"ftf_s%u_ss%u_ly6_h2_nsp_notrk",slotnr,subSlotnr);
   std::unique_ptr<TH2F> ly6_h2_nsp_notrk = std::make_unique<TH2F>(hname,hname,NBINS_ETA,ETA_MIN,ETA_MAX,NBINS_PHI,PHI_MIN,PHI_MAX);
   sprintf(hname,"ftf_s%u_ss%u_ly7_h2_nsp_notrk",slotnr,subSlotnr);
   std::unique_ptr<TH2F> ly7_h2_nsp_notrk = std::make_unique<TH2F>(hname,hname,NBINS_ETA,ETA_MIN,ETA_MAX,NBINS_PHI,PHI_MIN,PHI_MAX);
 
   for(unsigned int iSeed=0; iSeed<v_sp_eta.size(); ++iSeed) {
 
      int sp_layer = v_sp_layer[iSeed];
      float sp_eta = v_sp_eta[iSeed];
      int ilayer = getSPLayer(sp_layer,sp_eta);
      if( ilayer<6 ) continue;
 
      int sp_trkid = v_sp_usedTrkId[iSeed];
      bool isUsedByTrk = (sp_trkid != -1);
      float sp_phi = v_sp_phi[iSeed];
 
      bool fill_out_of_pi = false;
      float sp_phi2 = 0;
      if( sp_phi < 0 ) {
     sp_phi2 = 2*TMath::Pi() + sp_phi;
     if( sp_phi2 < PHI_MAX ) fill_out_of_pi = true;
      }
      else {
     sp_phi2 = -2*TMath::Pi() + sp_phi;
     if( PHI_MIN < sp_phi2 ) fill_out_of_pi = true;
      }
      if( ilayer==6 ) {
                          ly6_h2_nsp->Fill(sp_eta,sp_phi);
     if( fill_out_of_pi ) ly6_h2_nsp->Fill(sp_eta,sp_phi2);
     if( ! isUsedByTrk )                  ly6_h2_nsp_notrk->Fill(sp_eta,sp_phi);
     if( ! isUsedByTrk && fill_out_of_pi) ly6_h2_nsp_notrk->Fill(sp_eta,sp_phi2);
      }
      if( ilayer==7 ) {
                          ly7_h2_nsp->Fill(sp_eta,sp_phi);
     if( fill_out_of_pi ) ly7_h2_nsp->Fill(sp_eta,sp_phi2);
     if( ! isUsedByTrk )                  ly7_h2_nsp_notrk->Fill(sp_eta,sp_phi);
     if( ! isUsedByTrk && fill_out_of_pi) ly7_h2_nsp_notrk->Fill(sp_eta,sp_phi2);
      }
   }
 
   ATH_MSG_VERBOSE("looking for ly6/ly6 doublet seeds");
 
   // (idx, sort/weight, eta, phi)
   std::vector<std::tuple<int,float,float,float>> QT;
 
   for(int ly6_ieta=1; ly6_ieta<=NBINS_ETA; ly6_ieta++) {
      float ly6_eta = (ly6_h2_nsp->GetXaxis()->GetBinLowEdge(ly6_ieta) + ly6_h2_nsp->GetXaxis()->GetBinUpEdge(ly6_ieta))/2.0;
      for(int ly6_iphi=1; ly6_iphi<=NBINS_PHI; ly6_iphi++) {
     float ly6_phi = (ly6_h2_nsp->GetYaxis()->GetBinLowEdge(ly6_iphi) + ly6_h2_nsp->GetYaxis()->GetBinUpEdge(ly6_iphi))/2.0;
 
     float ly6_nsp       = ly6_h2_nsp      ->GetBinContent(ly6_ieta,ly6_iphi);
     float ly6_nsp_notrk = ly6_h2_nsp_notrk->GetBinContent(ly6_ieta,ly6_iphi);
     float ly6_frac      = ( ly6_nsp > 0 ) ? ly6_nsp_notrk / ly6_nsp : 0;
     if( ly6_nsp < 10 || ly6_frac < 0.85 ) continue;
 
     float ly7_frac_max = 0;
     float ly7_eta_max  = 0;
     float ly7_phi_max  = 0;
     for(int ly7_ieta=std::max(1,ly6_ieta-1); ly7_ieta<std::min(NBINS_ETA,ly6_ieta+1); ly7_ieta++) {
        for(int ly7_iphi=std::max(1,ly6_iphi-1); ly7_iphi<=std::min(NBINS_PHI,ly6_iphi+1); ly7_iphi++) {
           float ly7_nsp       = ly7_h2_nsp      ->GetBinContent(ly7_ieta,ly7_iphi);
           float ly7_nsp_notrk = ly7_h2_nsp_notrk->GetBinContent(ly7_ieta,ly7_iphi);
           float ly7_frac      = ( ly7_nsp > 0 ) ? ly7_nsp_notrk / ly7_nsp : 0;
           if( ly7_nsp < 10 ) continue;
           if( ly7_frac > ly7_frac_max ) {
          ly7_frac_max = ly7_frac;
          ly7_eta_max  = (ly7_h2_nsp->GetXaxis()->GetBinLowEdge(ly7_ieta) + ly7_h2_nsp->GetXaxis()->GetBinUpEdge(ly7_ieta))/2.0;
          ly7_phi_max  = (ly7_h2_nsp->GetXaxis()->GetBinLowEdge(ly7_iphi) + ly7_h2_nsp->GetXaxis()->GetBinUpEdge(ly7_iphi))/2.0;
           }
        }
     }
     if( ly7_frac_max < 0.85 ) continue;
     //
     float wsum = ly6_frac + ly7_frac_max;
     float weta = (ly6_eta*ly6_frac + ly7_eta_max*ly7_frac_max) / wsum;
     float wphi = (ly6_phi*ly6_frac + ly7_phi_max*ly7_frac_max) / wsum;
     float w = wsum / 2.0;
     QT.push_back(std::make_tuple(-1,w,weta,wphi));
      }
   }
   ATH_MSG_VERBOSE("nr of ly6/ly7 doublet candidate seeds=" << QT.size() << ", doing clustering...");
 
   // sort
   std::sort(QT.begin(), QT.end(),
         [](const std::tuple<int,float,float,float>& lhs, const std::tuple<int,float,float,float>& rhs) {
        return std::get<1>(lhs) > std::get<1>(rhs); } );
 
   // clustering
   const double CLUSTCUT_DIST_SQUARED = 0.04; // const double CLUSTCUT_DIST = 0.2;
   const double CLUSTCUT_SEED_FRAC    = 0.9;
 
   std::vector<float> seeds_wsum;
 
   for(unsigned int i=0; i<QT.size(); i++) {
      float phi  = std::get<3>(QT[i]);
      float eta  = std::get<2>(QT[i]);
      float w    = std::get<1>(QT[i]);
      if(i==0) {
     seeds_eta.push_back(w*eta); seeds_phi.push_back(w*phi);
     seeds_wsum.push_back(w);
     continue;
      }
      const int IDX_INITIAL = 100;
      float dist2_min = 100.0;
      int idx_min     = IDX_INITIAL;
      for(unsigned j=0; j<seeds_eta.size(); j++) {
     float ceta = seeds_eta[j]/seeds_wsum[j];
     float cphi = seeds_phi[j]/seeds_wsum[j];
     // intentionally calculate in this way as phi is defined beyond -Pi/Pi (no boundary)
     float deta  = std::fabs(ceta-eta);
     float dphi  = std::fabs(cphi-phi);
     float dist2 = dphi*dphi+deta*deta;
     if( dist2 < dist2_min ) {
        dist2_min = dist2;
        idx_min  = j;
     }
      }
      int match_idx = IDX_INITIAL;
      if( idx_min != IDX_INITIAL ) {
     if( dist2_min < CLUSTCUT_DIST_SQUARED ) { match_idx = idx_min; }
      }
      if( match_idx == IDX_INITIAL ) {
     if( w > CLUSTCUT_SEED_FRAC && dist2_min > CLUSTCUT_DIST_SQUARED ) {
        seeds_eta.push_back(w*eta); seeds_phi.push_back(w*phi);
        seeds_wsum.push_back(w);
     }
     continue;
      }
      float new_eta   = seeds_eta[match_idx]  + w*eta;
      float new_phi   = seeds_phi[match_idx]  + w*phi;
      float new_wsum  = seeds_wsum[match_idx] + w;
      seeds_eta[match_idx]   = new_eta;
      seeds_phi[match_idx]   = new_phi;
      seeds_wsum[match_idx]  = new_wsum;
   }
   QT.clear();
   for(unsigned int i=0; i<seeds_eta.size(); i++) {
      float eta = seeds_eta[i] / seeds_wsum[i];
      float phi = seeds_phi[i] / seeds_wsum[i];
      seeds_eta[i] = eta;
      if( phi < -TMath::Pi() ) phi =  2*TMath::Pi() + phi;
      if( phi >  TMath::Pi() ) phi = -2*TMath::Pi() + phi;
      seeds_phi[i] = phi;
   }
   ATH_MSG_VERBOSE("after clustering, nr of seeds = " << seeds_eta.size());
 
   // delete overlap (can happen at phi=-Pi/Pi bounadry)
   std::vector<unsigned int> idx_to_delete;
   for(unsigned int i=0; i<seeds_eta.size(); i++) {
      if( std::find(idx_to_delete.begin(),idx_to_delete.end(),i) != idx_to_delete.end() ) continue;
      float eta_i = seeds_eta[i];
      float phi_i = seeds_phi[i];
      for(unsigned int j=i+1; j<seeds_eta.size(); j++) {
     if( std::find(idx_to_delete.begin(),idx_to_delete.end(),j) != idx_to_delete.end() ) continue;
     float eta_j = seeds_eta[j];
     float phi_j = seeds_phi[j];
     float dR2 = deltaR2(eta_i,phi_i,eta_j,phi_j);
     if( dR2 < CLUSTCUT_DIST_SQUARED ) idx_to_delete.push_back(j);
      }
   }
   ATH_MSG_VERBOSE("nr of duplicated seeds to be removed = " << idx_to_delete.size());
   if( idx_to_delete.size() > 0 ) {
      std::sort(idx_to_delete.begin(),idx_to_delete.end());
      for(unsigned int j=idx_to_delete.size(); j>0; j--) {
     unsigned int idx = idx_to_delete[j-1];
     seeds_eta.erase(seeds_eta.begin()+idx);
     seeds_phi.erase(seeds_phi.begin()+idx);
      }
   }
 
   ATH_MSG_VERBOSE("nr of ly6/ly7 seeds=" << seeds_eta.size());
 
   // return
   return StatusCode::SUCCESS;
}

getSPLayer()

int TrigHitDVHypoAlg::getSPLayer ( int layer, float eta ) const

private

Definition at line 332 of file TrigHitDVHypoAlg.cxx.

{
   float abseta = std::fabs(eta);
 
   // if Pixel/SCT barrel, layer number is as it is
   if( 0<=layer && layer <=7 ) {
      ATH_MSG_VERBOSE("layer=" << layer << ", eta=" << abseta);
      return layer;
   }
 
   // for Pixel/SCT endcap, assign layer number of 0-7 depending on eta range
 
   int base = 0;
 
   //
   const float PixBR6limit = 1.29612;
   const float PixBR5limit = 1.45204;
   const float PixBR4limit = 1.64909;
   const float PixBR3limit = 1.90036;
   const float PixBR2limit = 2.2146;
 
   // Pixel Endcap #1
   base = 8;
   if( layer==base || layer==(base+12) ) {
      ATH_MSG_VERBOSE("Pix EC1, eta=" << abseta);
      if( abseta > PixBR2limit ) return 2;
      return 3;
   }
 
   // Pixel Endcap #2
   base = 9;
   if( layer==base || layer==(base+12) ) {
      ATH_MSG_VERBOSE("Pix EC2, eta=" << abseta);
      if( abseta > PixBR2limit ) return 2;
      return 3;
   }
 
   // Pixel Endcap #3
   base = 10;
   if( layer==base || layer==(base+12) ) {
      ATH_MSG_VERBOSE("Pix EC3, eta=" << abseta);
      return 3;
   }
 
   // SCT Endcap #1
   base = 11;
   if( layer==base || layer==(base+12) ) {
      ATH_MSG_VERBOSE("Sct EC1, eta=" << abseta);
      if( abseta < PixBR6limit )      return 7;
      else if( abseta < PixBR5limit ) return 6;
      return 5;
   }
 
   // SCT Endcap #2
   base = 12;
   if( layer==base || layer==(base+12) ) {
      ATH_MSG_VERBOSE("Sct EC2, eta=" << abseta);
      if( abseta < PixBR5limit )      return 7;
      else if( abseta < PixBR4limit ) return 6;
      return 4;
   }
 
   // SCT Endcap #3
   base = 13;
   if( layer==base || layer==(base+12) ) {
      ATH_MSG_VERBOSE("Sct EC3, eta=" << abseta);
      if( abseta < PixBR4limit ) return 7;
      return 5;
   }
 
   // SCT Endcap #4
   base = 14;
   if( layer==base || layer==(base+12) ) {
      ATH_MSG_VERBOSE("Sct EC4, eta=" << abseta);
      if( abseta < PixBR4limit ) return 6;
      else if( abseta < PixBR3limit ) return 6;
      return 4;
   }
 
   // SCT Endcap #5
   base = 15;
   if( layer==base || layer==(base+12) ) {
      ATH_MSG_VERBOSE("Sct EC5, eta=" << abseta);
      if( abseta < PixBR3limit ) return 7;
      return 5;
   }
 
   // SCT Endcap #6
   base = 16;
   if( layer==base || layer==(base+12) ) {
      ATH_MSG_VERBOSE("Sct EC6, eta=" << abseta);
      if( abseta < PixBR3limit ) return 6;
      return 4;
   }
 
   // SCT Endcap #7
   base = 17;
   if( layer==base || layer==(base+12) ) {
      ATH_MSG_VERBOSE("Sct EC7, eta=" << abseta);
      if( abseta < PixBR3limit ) return 7;
      return 5;
   }
 
   // SCT Endcap #8
   base = 18;
   if( layer==base || layer==(base+12) ) {
      ATH_MSG_VERBOSE("Sct EC8, eta=" << abseta);
      if( abseta < PixBR3limit ) return 7;
      return 6;
   }
 
   // SCT Endcap #9
   base = 19;
   if( layer==base || layer==(base+12) ) {
      ATH_MSG_VERBOSE("Sct EC9, eta=" << abseta);
      return 7;
   }
 
   return 0;
}

hypoBaseOutputProcessing()

StatusCode HypoBase::hypoBaseOutputProcessing ( SG::WriteHandle< TrigCompositeUtils::DecisionContainer > & outputHandle, MSG::Level lvl = MSG::DEBUG ) const

protectedinherited

Base class function to be called once slice specific code has finished. Handles debug printing and validation.

Definition at line 35 of file HypoBase.cxx.

                                                                                                                {
 
  ATH_CHECK( printDebugInformation(outputHandle, lvl) );
 
  if (m_runtimeValidation) {
    ATH_CHECK( runtimeValidation(outputHandle, msg()) );
  }
 
  return StatusCode::SUCCESS;
}

initialize()

StatusCode TrigHitDVHypoAlg::initialize ( )

overridevirtual

Definition at line 55 of file TrigHitDVHypoAlg.cxx.

{
   m_tools_lowest_jetEt = 1000;
   m_tools_loosest_wp   = 0;
   CHECK( m_hypoTools.retrieve() );
   for ( auto & tool: m_hypoTools ) {
      ATH_MSG_VERBOSE( "+++++ Hypo Tool name: " << tool->name() );
      std::cmatch results;
      if( std::regex_search(tool->name().c_str(),results,std::regex("hitdvjet(\\d+)_(\\w+)_")) ) {
     std::string sth = results[1].str();
     std::string swp = results[2].str();
     ATH_MSG_VERBOSE( "   thres = " << sth << ", wp = " << swp );
     int thres = std::stoi(sth);
     if( thres < m_tools_lowest_jetEt ) m_tools_lowest_jetEt = thres;
     if( swp == "loose"  && m_tools_loosest_wp >= 1 ) m_tools_loosest_wp = 1;
     if( swp == "medium" && m_tools_loosest_wp >= 2 ) m_tools_loosest_wp = 2;
     if( swp == "tight"  && m_tools_loosest_wp >= 3 ) m_tools_loosest_wp = 3;
      }
   }
   ATH_MSG_DEBUG( "Lowest jetEt used in hypo tools = " << m_tools_lowest_jetEt << " (GeV)" );
   ATH_MSG_DEBUG( "Loosest WP used in hypo tools = " << m_tools_loosest_wp << " (loose=1,medium=2,tight=3)");
   // loose : eta<2.0, SP seed=true,  BDT eff=0.9
   // medium: eta<2.0, SP seed=false, BDT eff=0.75
   // tight : eta<1.0, SP seed=false, BDT eff=0.75
 
   CHECK( m_jetsKey.initialize() );
   CHECK( m_hitDVKey.initialize());
   CHECK( m_tracksKey.initialize());
   CHECK( m_lumiDataKey.initialize(!m_isMC) );
   ATH_CHECK( m_jetRoiCollectionKey.initialize(m_doHitDV_Seeding) );
 
   if ( !m_monTool.empty() ) CHECK( m_monTool.retrieve() );
 
   ATH_CHECK(m_beamSpotKey.initialize());
   ATH_CHECK(m_spacePointTool.retrieve() );
 
   // MVAUtils BDT initialisation
   // could make this configurable as a property
   std::string weightfile[2];
   weightfile[0] = PathResolver::find_calib_file("TrigHitDVHypo/HitDV.BDT.weights.0eta1.v22a.root");
   weightfile[1] = PathResolver::find_calib_file("TrigHitDVHypo/HitDV.BDT.weights.1eta2.v22a.root");
   for (unsigned int i=0; i<2; ++i) {
     std::unique_ptr<TFile> rootFile(TFile::Open(weightfile[i].c_str(), "READ"));
     if (!rootFile) {
       ATH_MSG_ERROR("Can not open BDT root file: " << weightfile[i] );
       return StatusCode::FAILURE;
     }
     std::unique_ptr<TTree> tree((TTree*)rootFile->Get("BDT"));
     if (!tree) {
       ATH_MSG_ERROR("Can not find BDT tree in file: " << weightfile[i]);
       return StatusCode::FAILURE;
     }
     ATH_MSG_INFO("Loading BDT tree from file: " << weightfile[i]);
     m_bdt_eta[i] = std::make_unique<MVAUtils::BDT>(tree.get());
   }
   
   return StatusCode::SUCCESS;
}

inputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::inputHandles ( ) const

overridevirtualinherited

Return this algorithm's input handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

isClonable()

bool AthCommonReentrantAlgorithm< Gaudi::Algorithm >::isClonable ( ) const

overridevirtualinherited

Specify if the algorithm is clonable.

Reentrant algorithms are clonable.

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

Definition at line 68 of file AthCommonReentrantAlgorithm.cxx.

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

msg()

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

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

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

outputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::outputHandles ( ) const

overridevirtualinherited

Return this algorithm's output handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

printBangs()

void HypoBase::printBangs ( MsgStream & msg )

staticprivateinherited

Print header line.

Definition at line 390 of file HypoBase.cxx.

                                        {
  msg << MSG::ERROR << "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!" << endmsg;
}

printDebugInformation()

StatusCode HypoBase::printDebugInformation ( SG::WriteHandle< TrigCompositeUtils::DecisionContainer > & outputHandle, MSG::Level lvl ) const

privateinherited

Common base function to print information on chains passed by objects considered in the hypo.

Definition at line 406 of file HypoBase.cxx.

                                                                                                             {
  if (msgLvl(lvl)) {
    msg() << lvl;
    msg() << "Exiting with " << outputHandle->size() <<" Decision objects" << endmsg;
    size_t count = 0;
    for (const Decision* d : *outputHandle){
      DecisionIDContainer objDecisions;      
      decisionIDs( d, objDecisions );
      msg() << "Number of positive decisions for Decision object #" << count++ << ": " << objDecisions.size() << endmsg;
      for (const TrigCompositeUtils::DecisionID id : objDecisions ) {
        msg() << " --- Passes: " << HLT::Identifier( id ) << endmsg;
      }  
    }
  }
  return StatusCode::SUCCESS;
}

printErrorHeader()

void HypoBase::printErrorHeader ( const ElementLink< TrigCompositeUtils::DecisionContainer > & dEL, MsgStream & msg )

staticprivateinherited

A problem was found, print common output data.

Definition at line 395 of file HypoBase.cxx.

{
  printBangs(msg);
  msg << MSG::ERROR << "! RUNTIME TRIGGER NAVIGATION VALIDATION ERROR" << endmsg;
  msg << MSG::ERROR << "! Caused by Decision with index:" << (*dEL)->index() << endmsg;
  msg << MSG::ERROR << "! From collection:" << dEL.dataID() << endmsg;
  msg << MSG::ERROR << "! " << **dEL << endmsg;
}

recursiveValidateGraph()

StatusCode HypoBase::recursiveValidateGraph ( const ElementLink< TrigCompositeUtils::DecisionContainer > & dEL, MsgStream & msg, bool onlyValidateOneStep, bool runTwoConversion, size_t callDepth, std::set< const TrigCompositeUtils::Decision * > & fullyExploredFrom )

staticprivateinherited

Execute all checks on one node in the graph, d, then recursive call self on all parent nodes up to L1.

Definition at line 71 of file HypoBase.cxx.

{
  if (onlyValidateOneStep && callDepth > 0) {
    if ((*dEL)->name() == hypoAlgNodeName()) {
      // Validation is called from HypoAlg nodes. So if we have reached the _previous_ HypoAlg node, then we have already
      // validated back from here in the past. Can stop at this point.
      return StatusCode::SUCCESS;
    }
  }
 
  // Check logical flow at this place in the graph 
  if ((*dEL)->name() == hypoAlgNodeName()) {
    // Check that all Hypo Decisions produced here satisfy the more-strict all-parent logical flow 
    if ( validateLogicalFlow(dEL, msg, kRequireAll).isFailure() ) {
      return StatusCode::FAILURE;
    }
  } else {
    // (looser requirement of one-valid-parent-with-decision than we had when we knew that d corresponded to a HypoAlg output)
    if ( validateLogicalFlow(dEL, msg, kRequireOne).isFailure() ) {
      return StatusCode::FAILURE;
    }
  }
 
  // Check my IDs
  if ( validateDecisionIDs(dEL, msg).isFailure() ) {
    return StatusCode::FAILURE;
  }
  if ( validateDuplicatedDecisionID(dEL, msg).isFailure() ) {
    return StatusCode::FAILURE;
  }
 
  // Check my linking
  if( validateParentLinking(dEL, msg, runTwoConversion).isFailure() ) {
    return StatusCode::FAILURE;
  }
  if ( validateHasLinks(dEL, msg).isFailure() ) {
    return StatusCode::FAILURE;
  }
 
  // Continue upstream
  const std::vector<ElementLink<DecisionContainer>> seeds = (*dEL)->objectCollectionLinks<DecisionContainer>(seedString());
  for (const ElementLink<DecisionContainer>& seed : seeds) {
    if (fullyExploredFrom.count( (*seed) ) == 1) {
      continue; // Already fully explored from this seed and up
    }
    if ( not seed.isValid() ) {
      msg << MSG::ERROR << "Invalid seed element link in recursiveValidateGraph" << endmsg;
      return StatusCode::FAILURE;
    }
    if ( recursiveValidateGraph(seed, msg, onlyValidateOneStep, runTwoConversion, callDepth + 1, fullyExploredFrom).isFailure() ) {
      return StatusCode::FAILURE;
    }
  }
 
  fullyExploredFrom.insert( *dEL );
  return StatusCode::SUCCESS;
}

renounce()

std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void > AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::renounce ( T & h )

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

  {
    h.renounce();
    PBASE::renounce (h);
  }

renounceArray()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::renounceArray ( SG::VarHandleKeyArray & handlesArray )

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

runtimeValidation()

StatusCode HypoBase::runtimeValidation ( SG::WriteHandle< TrigCompositeUtils::DecisionContainer > & outputHandle, MsgStream & msg, bool onlyValidateOneStep = true, bool runTwoConversion = false )

staticinherited

Executes all individual runtime tests.

Definition at line 47 of file HypoBase.cxx.

{
  // Detailed checks on the output container of this HypoAlg
  std::set<const Decision*> fullyExploredFrom; // Cache used to avoid exploring regions of the graph more than once
  for (const Decision* d : *outputHandle) {
    const DecisionContainer* dContainer = dynamic_cast<const DecisionContainer*>( d->container() );
    const ElementLink<DecisionContainer> dEL = ElementLink<DecisionContainer>(*dContainer, d->index());
    if (not dEL.isValid()) {
      msg << MSG::ERROR << "Invalid seed element link in recursiveValidateGraph" << endmsg;
      return StatusCode::FAILURE;
    }
    // Check that we can reach L1 along all navigation paths up from each Decision
    // and validate these Decisions on the way up too.
    if (recursiveValidateGraph(dEL, msg, onlyValidateOneStep, runTwoConversion, 0, fullyExploredFrom).isFailure()) {
      return StatusCode::FAILURE;
    } 
  }
  return StatusCode::SUCCESS;
}

selectSeedsNearby()

StatusCode TrigHitDVHypoAlg::selectSeedsNearby ( const std::vector< HitDVSeed > & hitDVSeedsContainer, std::vector< float > & jetSeeds_eta, std::vector< float > & jetSeeds_phi, std::vector< float > & jetSeeds_pt ) const

private

Definition at line 890 of file TrigHitDVHypoAlg.cxx.

{
   std::vector<unsigned int> idx_to_delete;
   for(unsigned int idx=0; idx<jetSeeds_eta.size(); ++idx) {
      const float DR_SQUARED_CUT_TO_FTFSEED = 0.09; // const float DR_CUT_TO_FTFSEED = 0.3;
      float eta = jetSeeds_eta[idx];
      float phi = jetSeeds_phi[idx];
      float dR2min = 9999;
      for ( const auto& seed : hitDVSeedsContainer ) {
        float dR2 = deltaR2(eta,phi,seed.eta,seed.phi);
        if( dR2 < dR2min ) dR2min = dR2;
      }
      if( dR2min > DR_SQUARED_CUT_TO_FTFSEED ) idx_to_delete.push_back(idx);
   }
   if( idx_to_delete.size() > 0 ) {
      std::sort(idx_to_delete.begin(),idx_to_delete.end());
      for(unsigned int j=idx_to_delete.size(); j>0; j--) {
     unsigned int idx = idx_to_delete[j-1];
     jetSeeds_eta.erase(jetSeeds_eta.begin()+idx);
     jetSeeds_phi.erase(jetSeeds_phi.begin()+idx);
     if( jetSeeds_pt.size() > 0 ) jetSeeds_pt.erase(jetSeeds_pt.begin()+idx);
      }
   }
   return StatusCode::SUCCESS;
}

setFilterPassed()

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

inlinevirtualinherited

Definition at line 100 of file AthCommonReentrantAlgorithm.h.

                                                                            {
    execState( ctx ).setFilterPassed( state );
  }

sysExecute()

StatusCode AthCommonReentrantAlgorithm< Gaudi::Algorithm >::sysExecute ( const EventContext & ctx )

overridevirtualinherited

Execute an algorithm.

We override this in order to work around an issue with the Algorithm base class storing the event context in a member variable that can cause crashes in MT jobs.

Definition at line 85 of file AthCommonReentrantAlgorithm.cxx.

{
  return BaseAlg::sysExecute (ctx);
}

sysInitialize()

StatusCode HypoBase::sysInitialize ( )

overridevirtualinherited

initialise this base class

Reimplemented from AthCommonReentrantAlgorithm< Gaudi::Algorithm >.

Definition at line 26 of file HypoBase.cxx.

                                   {
  CHECK( AthReentrantAlgorithm::sysInitialize() ); // initialise base class
  CHECK( m_input.initialize() );
  ATH_MSG_DEBUG("HypoBase::sysInitialize() Will consume decision: " << m_input.key() );
  CHECK( m_output.initialize() );
  ATH_MSG_DEBUG("HypoBase::sysInitialize() And produce decision: " << m_output.key() );
  return StatusCode::SUCCESS;
}

sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::sysStart ( )

overridevirtualinherited

Handle START transition.

We override this in order to make sure that conditions handle keys can cache a pointer to the conditions container.

updateVHKA()

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

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

                                               {
    // debug() << "updateVHKA for property " << p.name() << " " << p.toString() 
    //         << "  size: " << m_vhka.size() << endmsg;
    for (auto &a : m_vhka) {
      std::vector<SG::VarHandleKey*> keys = a->keys();
      for (auto k : keys) {
        k->setOwner(this);
      }
    }
  }

validateDecisionIDs()

StatusCode HypoBase::validateDecisionIDs ( const ElementLink< TrigCompositeUtils::DecisionContainer > & dEL, MsgStream & msg )

staticprivateinherited

Ensure that all present IDs correspond to configured chains.

Definition at line 209 of file HypoBase.cxx.

{
  // All numeric IDs must correspond to a know, configured, HLT chain
  DecisionIDContainer decisionIDSet;
  decisionIDs(*dEL, decisionIDSet);
  for (const DecisionID id : decisionIDSet) {
    const std::string chain = HLT::Identifier( id ).name();
    if (!isChainId(chain) and !isLegId(chain)) {
      printErrorHeader(dEL, msg);
      msg << MSG::ERROR << "! Decision contains an ID which does not correspond to a configured chain or a configured chain-leg: " << HLT::Identifier( id ) << endmsg;
      msg << MSG::ERROR << "! SOLUTION: Locate the producer of the collection, investigate how this bad ID could have been added." << endmsg;
      printBangs(msg);
      return StatusCode::FAILURE;
    }
  }
  return StatusCode::SUCCESS;
}

validateDuplicatedDecisionID()

StatusCode HypoBase::validateDuplicatedDecisionID ( const ElementLink< TrigCompositeUtils::DecisionContainer > & dEL, MsgStream & msg )

staticprivateinherited

Ensure that no space is being wasted by duplicated DecisionIDs in any Decision objects.

Definition at line 229 of file HypoBase.cxx.

{
  // Persistent vector storage does not guarantee against duplicate entries
  DecisionIDContainer decisionIDSet;
  decisionIDs(*dEL, decisionIDSet);
  if (decisionIDSet.size() != (*dEL)->decisions().size()) {
    printErrorHeader(dEL, msg);
    msg << MSG::ERROR << "! Decision contains duplicate DecisionIDs." << endmsg;
    msg << MSG::ERROR << "! SOLUTION: If combining DecisionIDs from multiple parents, de-duplicate the internal std::vector<DecisionID> of 'Decision* d' with:" << endmsg;
    msg << MSG::ERROR << "!   TrigCompositeUtils::insertDecisionIDs(DecisionIDContainer(), d);"  << endmsg;
    printBangs(msg);
    return StatusCode::FAILURE;
  }
  return StatusCode::SUCCESS;
}

validateHasLinks()

StatusCode HypoBase::validateHasLinks ( const ElementLink< TrigCompositeUtils::DecisionContainer > & dEL, MsgStream & msg )

staticprivateinherited

Ensure all Decisions have the named ElementLink graph edges which they are required to by spec.

Definition at line 338 of file HypoBase.cxx.

{
  const std::string& name = (*dEL)->name();
  if (name == hypoAlgNodeName()) {
 
    // Check that I have a "feature"
    if ((*dEL)->hasObjectLink( featureString() )) {
      return StatusCode::SUCCESS;
    }
    printErrorHeader(dEL, msg);
    msg << MSG::ERROR << "! Decision has no '" << featureString() << "' ElementLink." << endmsg;
    msg << MSG::ERROR << "! Every Decision created by a HypoAlg must correspond to some physics object, and be linked to the object." << endmsg;
    msg << MSG::ERROR << "! SOLUTION: Ensure that all produced Decision objects are assigned their feature:" << endmsg;
    msg << MSG::ERROR << "! SOLUTION:    decision->setObjectLink<MY_FEATURE_CONTANER_TYPE>(featureString(), MY_FEATURE_ELEMENT_LINK);" << endmsg;
    printBangs(msg);
    return StatusCode::FAILURE;
 
  } else if (name == inputMakerNodeName()) {
 
    // This requirement is dropped for empty input makers to avoid unnecessary graph clutter.
    bool exempt = false;
    if ((*dEL)->hasDetail<int32_t>("isEmpty") and (*dEL)->getDetail<int32_t>("isEmpty") == 1) {
      exempt = true;
    }
 
    if (not (*dEL)->hasObjectLink( roiString() ) and not exempt) {
      printErrorHeader(dEL, msg);
      msg << MSG::ERROR << "! Decision has no '" << roiString() << "' ElementLink." << endmsg;
      msg << MSG::ERROR << "! Every Decision created by a InputMaker must link to the ROI which reconstruction will run on for that Decision object in this Step." << endmsg;
      msg << MSG::ERROR << "! It can be the FullScan ROI created by the HLTSeeding (FSNOSEED) if no other suitable ROI exists." << endmsg;
      msg << MSG::ERROR << "! SOLUTION: Check the configuration of InputMakerForRoI or EventViewCreatorAlgorithm responsible for creating this Decision Object" << endmsg;
      msg << MSG::ERROR << "! SOLUTION: The algorithm must have an ROITool which must attach an '"<< roiString() <<"' link to each Decision Object" << endmsg;
      printBangs(msg);
    }
 
  } else if (name == hltSeedingNodeName()) {
 
    if (not (*dEL)->hasObjectLink( initialRoIString() )) {
      printErrorHeader(dEL, msg);
      msg << MSG::ERROR << "! Decision has no '" << initialRoIString() << "' ElementLink." << endmsg;
      msg << MSG::ERROR << "! Every Decision created by the HLTSeeding must link to the initial ROI which caused it to be created." << endmsg;
      msg << MSG::ERROR << "! This includes the Decision Object created to represent the Full-Scan/NoSeed (FSNOSEED) ROI." << endmsg;
      msg << MSG::ERROR << "! SOLUTION: Check the configuration of the HLTSeeding tool responsible for creating this Decision Object" << endmsg;
      printBangs(msg);
    }
 
  }
  return StatusCode::SUCCESS;
}

validateLogicalFlow()

StatusCode HypoBase::validateLogicalFlow ( const ElementLink< TrigCompositeUtils::DecisionContainer > & dEL, MsgStream & msg, const LogicalFlowCheckMode mode )

staticprivateinherited

Ensure that all DecisionIDs have propagated correctly from their parent.

Definition at line 247 of file HypoBase.cxx.

{
  // Do not need to validate for L1 Decisions as these have no parents
  if ((*dEL)->name() == hltSeedingNodeName()) {
    return StatusCode::SUCCESS;
  }
 
  // Get all my passed DecisionIDs
  DecisionIDContainer decisionIDSet;
  decisionIDs(*dEL, decisionIDSet);
  const std::vector<ElementLink<DecisionContainer>> seeds = (*dEL)->objectCollectionLinks<DecisionContainer>(seedString());
  for (const DecisionID id : decisionIDSet) {
    // For each chain that I'm passing, check how many of my parents were also passing the chain
    size_t parentsWithDecision = 0;  
    for (const ElementLink<DecisionContainer>& seed : seeds) {
      if ( not seed.isValid() ) {
        msg << MSG::ERROR << "Invalid seed element link in recursiveValidateGraph" << endmsg;
        return StatusCode::FAILURE;
      }
      DecisionIDContainer seedIDSet;
      decisionIDs(*seed, seedIDSet);
      // Id may be a chain-ID (represents a whole chain) or a leg-ID (represents just a single leg of a multi-leg chain)
      // Is ID is in this parent's set of passed IDs?
      // Or, (if ID is a leg-ID) is the chain-ID of leg-ID in the parent's set of passed IDs?
      if (passed(id, seedIDSet) or passed(getIDFromLeg(id).numeric(), seedIDSet)) {
        ++parentsWithDecision;
      }
      else{ // Or, for each of the seed IDs, if the seed ID is a leg-ID, is the seed chain-ID of the seed leg-ID the same as ID?  
        for (auto sid: seedIDSet){
          if (getIDFromLeg(sid).numeric() == id){
            ++parentsWithDecision;
            break;
          }
        }
      }
    }
 
    if (mode == kRequireOne && parentsWithDecision == 0) {
      // InputMakers may merge multiple of their input collections in order to run reconstruction on a common set of ROI (for example)
      // So the DecisionIDs may have come from any one or more of the inputs. But zero is not allowed.
      printErrorHeader(dEL, msg);
      msg << MSG::ERROR << "! This Decision object is not respecting logical flow of DecisionIDs for chain: " << HLT::Identifier( id ) << endmsg;
      msg << MSG::ERROR << "! This chain's DecisionID can not be found in any parents of this Decision object:" << endmsg;
      size_t seed_n = 0;
      for (const ElementLink<DecisionContainer>& seed : seeds) {
        msg << MSG::ERROR << "! Index:" << (*seed)->index() << " from collection:" << seed.dataID() << endmsg;
        msg << MSG::ERROR << "! " << **seed << endmsg;
        DecisionIDContainer objDecisions;      
        decisionIDs(*seed, objDecisions);
        for (const TrigCompositeUtils::DecisionID id : objDecisions ) {
          msg << "! --- Passing in parent #" << seed_n << ": " << HLT::Identifier( id ) << endmsg;
        }
        ++seed_n;
      }
      msg << MSG::ERROR << "! SOLUTION: Ensure that the producer of this Decision object only adds DecisionIDs"
        " which were present in at least one of its parents." << endmsg;
      printBangs(msg);
      return StatusCode::FAILURE;
    } else if (mode == kRequireAll && parentsWithDecision != seeds.size()) {
      // HypoAlgs may form a new physics object from multiple objects in the previous step
      // (think a BPhysics object whose parents are two Decisions which each correspond to a different L1 MU RoI, 
      // both ROI need to be in active state for the chain, if the chain's HypoTool considers the BPhysics object)
      // This case requires *all* of the physics objects which are being combined together to be active for the chain
      // in order to preserve logical flow
      printErrorHeader(dEL, msg);
      msg << MSG::ERROR << "! This Decision object is not respecting logical flow of DecisionIDs for chain: " << HLT::Identifier( id ) << endmsg;
      msg << MSG::ERROR << "! As this Decision object represents the output of a HypoAlg, it must respect logical flow on all " 
        << seeds.size() << " of its parent(s):" << endmsg;
      size_t seed_n = 0;
      for (const ElementLink<DecisionContainer>& seed : seeds) {
        msg << MSG::ERROR << "! Index:" << (*seed)->index() << " from collection:" << seed.dataID() << endmsg;
        msg << MSG::ERROR << "! " << **seed << endmsg;
        DecisionIDContainer objDecisions;      
        decisionIDs(*seed, objDecisions);
        for (const TrigCompositeUtils::DecisionID id : objDecisions ) {
          msg << "! --- Passing in parent #" << seed_n << ": " << HLT::Identifier( id ) << endmsg;
        }
        ++seed_n;
      }
      msg << MSG::ERROR << "! SOLUTION: Ensure that the HypoTool responsible for " << HLT::Identifier( id ) 
        << " in this HypoAlg only runs if this ID is present in all parent decisions." << endmsg;
      printBangs(msg);
      return StatusCode::FAILURE;
    }
  }
  return StatusCode::SUCCESS;
}

validateParentLinking()

StatusCode HypoBase::validateParentLinking ( const ElementLink< TrigCompositeUtils::DecisionContainer > & dEL, MsgStream & msg, bool runTwoConversion )

staticprivateinherited

Ensure that the Decision has at least one valid parent, unless it is a initial Decision from the HLTSeeding.

Definition at line 135 of file HypoBase.cxx.

{
  const std::vector<ElementLink<DecisionContainer>> seeds = (*dEL)->objectCollectionLinks<DecisionContainer>(seedString());
  // All Decision object must have at least one parent, unless they are the initial set of objects created by the HLTSeeding
  const std::string& name = (*dEL)->name();
  if (seeds.size() == 0 && name != hltSeedingNodeName()) {
    printErrorHeader(dEL, msg);
    msg << MSG::ERROR << "! Decision has zero parents. This is only allowed for the initial Decisions created by the HLTSeeding." << endmsg;
    msg << MSG::ERROR << "! SOLUTION: Attach parent Decision(s) with TrigCompositeUtils::linkToPrevious" << endmsg;
    printBangs(msg);
    return StatusCode::FAILURE;
  }
 
  if (name == hltSeedingNodeName()) {
    if (seeds.size() > 0) {
      printErrorHeader(dEL, msg);
       msg << MSG::ERROR << "! Decision has parents. This is not allowed for the initial Decisions created by the HLTSeeding." << endmsg;
       msg << MSG::ERROR << "! SOLUTION: Check HLTSeeding, no where should it be adding a parent link." << endmsg;
      printBangs(msg);
      return StatusCode::FAILURE;
    }
    return StatusCode::SUCCESS;
  }
 
  static const std::set<std::string> expectedParentsFilter = {hypoAlgNodeName(), comboHypoAlgNodeName(), hltSeedingNodeName()};
  static const std::set<std::string> expectedParentsInputMaker = {filterNodeName()};
  static const std::set<std::string> expectedParentsHypoAlg = {inputMakerNodeName()};
  static const std::set<std::string> expectedParentsComboHypoAlg = {hypoAlgNodeName(), inputMakerNodeName(), hltSeedingNodeName()}; // TODO check hltSeedingNodeName(), needed for newJO
  static const std::set<std::string> expectedParentsSummaryFilter = {hypoAlgNodeName(), comboHypoAlgNodeName(), hltSeedingNodeName()};
  static const std::set<std::string> expectedParentsSummaryPassed = {summaryFilterNodeName()};
 
  const std::set<std::string>* expectedParentsPtr = nullptr;
  if (name == filterNodeName()) {
    expectedParentsPtr = &expectedParentsFilter;
  } else if (name == inputMakerNodeName() and !runTwoConversion) {
    expectedParentsPtr = &expectedParentsInputMaker;
  } else if (name == inputMakerNodeName() and runTwoConversion) {
    expectedParentsPtr = &expectedParentsFilter; // We don't have Filter nodes in the R2->R3 conversion
  } else if (name == hypoAlgNodeName()) {
    expectedParentsPtr = &expectedParentsHypoAlg;
  } else if (name == comboHypoAlgNodeName()) {
    expectedParentsPtr = &expectedParentsComboHypoAlg;
  } else if (name == summaryFilterNodeName()) {
    expectedParentsPtr = &expectedParentsSummaryFilter;
  } else if (name == summaryPassNodeName()) {
    expectedParentsPtr = &expectedParentsSummaryPassed;
  } else {
    printErrorHeader(dEL, msg);
    msg << MSG::ERROR << "! Invalid Node name '" << name << "'." << endmsg;
    msg << MSG::ERROR << "! SOLUTION: Find the alg which made a node with this name. Allowed named may be found in TrigCompositeUtils.h, See:'Constant string literals used within the HLT'." << endmsg;
    printBangs(msg);
    return StatusCode::FAILURE;
  }
 
  for (const ElementLink<DecisionContainer>& seed : seeds) {
    if (!expectedParentsPtr->contains( (*seed)->name() )) {
      printErrorHeader(dEL, msg);
      msg << MSG::ERROR << "! Invalid linking from node with name '" << name << "' to one with name '"<< (*seed)->name() << "'." << endmsg;
      msg << MSG::ERROR << "! Allowed seed names are:" << endmsg;
      for (const std::string& allowed : *expectedParentsPtr) {
        msg << MSG::ERROR << "! " << allowed << endmsg;
      }
      msg << MSG::ERROR << "! SOLUTION: Find where this invalid parent was added and correct it." << endmsg;
      printBangs(msg);
      return StatusCode::FAILURE;
    }
  }
 
  return StatusCode::SUCCESS;
}

Member Data Documentation

m_bdt_eta

std::unique_ptr<MVAUtils::BDT> TrigHitDVHypoAlg::m_bdt_eta[2]

private

Definition at line 112 of file TrigHitDVHypoAlg.h.

m_beamSpotKey

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

private

Definition at line 125 of file TrigHitDVHypoAlg.h.

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

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_doHitDV_Seeding

bool TrigHitDVHypoAlg::m_doHitDV_Seeding = true

private

Definition at line 122 of file TrigHitDVHypoAlg.h.

m_evtStore

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

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

m_extendedExtraObjects

DataObjIDColl AthCommonReentrantAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects

privateinherited

Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.

Empty if no symlinks were found.

Definition at line 114 of file AthCommonReentrantAlgorithm.h.

m_hitDVKey

SG::WriteHandleKey<xAOD::TrigCompositeContainer> TrigHitDVHypoAlg::m_hitDVKey {this, "HitDV", "HLT_HitDV", ""}

private

Definition at line 78 of file TrigHitDVHypoAlg.h.

{this, "HitDV",     "HLT_HitDV",     ""};

m_hitDVLinkName

Gaudi::Property<std::string> TrigHitDVHypoAlg::m_hitDVLinkName {this, "hitDVLinkName", "HitDVSeedLink", "Name of the link to HitDVContainer. Used by ViewCreatorROITool."}

private

Definition at line 91 of file TrigHitDVHypoAlg.h.

{this, "hitDVLinkName", "HitDVSeedLink", "Name of the link to HitDVContainer. Used by ViewCreatorROITool."};

m_hypoTools

ToolHandleArray< TrigHitDVHypoTool > TrigHitDVHypoAlg::m_hypoTools {this, "HypoTools", {}, "Tools to perform selection"}

private

Definition at line 74 of file TrigHitDVHypoAlg.h.

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

m_input

SG::ReadHandleKey<TrigCompositeUtils::DecisionContainer> HypoBase::m_input { this, "HypoInputDecisions", "UNSPECIFIED_INPUT", "Input Decision (implicit)" }

privateinherited

input decisions

Definition at line 101 of file HypoBase.h.

{ this, "HypoInputDecisions", "UNSPECIFIED_INPUT", "Input Decision (implicit)" };

m_isMC

Gaudi::Property<bool> TrigHitDVHypoAlg::m_isMC {this, "isMC", false, "Real data or MC"}

private

Definition at line 86 of file TrigHitDVHypoAlg.h.

{this, "isMC", false, "Real data or MC"};

m_jetRoiCollectionKey

SG::ReadHandleKey<xAOD::jFexSRJetRoIContainer> TrigHitDVHypoAlg::m_jetRoiCollectionKey {this, "jFexSRJetRoI", "", ""}

private

Definition at line 124 of file TrigHitDVHypoAlg.h.

{this, "jFexSRJetRoI", "", ""};

m_jetSeed_etaMax

Gaudi::Property<float> TrigHitDVHypoAlg::m_jetSeed_etaMax {this, "jetSeed_etaMin", 2.0, "Maximum eta for jet seed"}

private

Definition at line 89 of file TrigHitDVHypoAlg.h.

{this, "jetSeed_etaMin",  2.0, "Maximum eta for jet seed"};

m_jetSeed_ptMin

Gaudi::Property<float> TrigHitDVHypoAlg::m_jetSeed_ptMin {this, "jetSeed_ptMin", 50.0, "Minimum pT for jet seed"}

private

Definition at line 88 of file TrigHitDVHypoAlg.h.

{this, "jetSeed_ptMin",  50.0, "Minimum pT  for jet seed"};

m_jetsKey

SG::ReadHandleKey< xAOD::JetContainer > TrigHitDVHypoAlg::m_jetsKey {this, "Jets", "HLT_AntiKt4EMTopoJets_subjesIS", ""}

private

Definition at line 77 of file TrigHitDVHypoAlg.h.

{this, "Jets",      "HLT_AntiKt4EMTopoJets_subjesIS", ""};

m_lumiBlockMuTool

ToolHandle<ILumiBlockMuTool> TrigHitDVHypoAlg::m_lumiBlockMuTool

private

Definition at line 82 of file TrigHitDVHypoAlg.h.

m_lumiDataKey

SG::ReadCondHandleKey<LuminosityCondData> TrigHitDVHypoAlg::m_lumiDataKey {this, "LuminosityCondDataKey", "LuminosityCondData", ""}

private

Definition at line 84 of file TrigHitDVHypoAlg.h.

{this, "LuminosityCondDataKey", "LuminosityCondData", ""};

m_monTool

ToolHandle<GenericMonitoringTool> TrigHitDVHypoAlg::m_monTool { this, "MonTool", "", "Monitoring tool" }

private

Definition at line 97 of file TrigHitDVHypoAlg.h.

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

m_output

SG::WriteHandleKey<TrigCompositeUtils::DecisionContainer> HypoBase::m_output { this, "HypoOutputDecisions", "UNSPECIFIED_OUTPUT", "Ouput Decision" }

privateinherited

output decisions

Definition at line 103 of file HypoBase.h.

{ this, "HypoOutputDecisions", "UNSPECIFIED_OUTPUT", "Ouput Decision" };

m_runtimeValidation

Gaudi::Property<bool> HypoBase::m_runtimeValidation { this, "RuntimeValidation", false, "Enable detailed runtime validation of HypoAlg output, and upstream Decisions." }

privateinherited

Enabling of detailed validation checks for use during development.

Definition at line 105 of file HypoBase.h.

{ this, "RuntimeValidation", false, "Enable detailed runtime validation of HypoAlg output, and upstream Decisions." };

m_spacePointTool

ToolHandle<ITrigSpacePointConversionTool> TrigHitDVHypoAlg::m_spacePointTool {this, "SpacePointProviderTool", "TrigSpacePointConversionTool"}

private

Definition at line 73 of file TrigHitDVHypoAlg.h.

{this, "SpacePointProviderTool", "TrigSpacePointConversionTool"};

m_tools_loosest_wp

int TrigHitDVHypoAlg::m_tools_loosest_wp = 0

private

Definition at line 116 of file TrigHitDVHypoAlg.h.

m_tools_lowest_jetEt

int TrigHitDVHypoAlg::m_tools_lowest_jetEt = 1000

private

Definition at line 115 of file TrigHitDVHypoAlg.h.

m_tracksKey

SG::ReadHandleKey< TrackCollection> TrigHitDVHypoAlg::m_tracksKey {this, "HitDVTracks", "HLT_IDTrkTrack_FS_FTF", ""}

private

Definition at line 79 of file TrigHitDVHypoAlg.h.

{this, "HitDVTracks",   "HLT_IDTrkTrack_FS_FTF",   ""};

m_useBeamSpot

bool TrigHitDVHypoAlg::m_useBeamSpot = true

private

Definition at line 119 of file TrigHitDVHypoAlg.h.

m_varHandleArraysDeclared

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

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_vhka

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

---

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

• TrigHitDVHypoAlg.h
• TrigHitDVHypoAlg.cxx