TrigTRTHTHCounter Class Reference

TrigTRTHTHCounter gives back the number of TRT high-threshold hits based on the code of HIPsFilterAlg by Sergey Burdin @migrated from TrigTRTHTHCounter.h & cxx. More...

#include <TrigTRTHTHCounter.h>

Inheritance diagram for TrigTRTHTHCounter:

Collaboration diagram for TrigTRTHTHCounter:

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

Protected Member Functions
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
const TRT_ID *	m_trtHelper {nullptr}
	TRT ID helper.
float	m_maxCaloEta {1.7}
Gaudi::Property< float >	m_etaHalfWidth {this, "EtaHalfWidth", 0.1 , "subsection of RoI to retrieve fewer TRT hits"}
Gaudi::Property< float >	m_phiHalfWidth {this, "PhiHalfWidth", 0.1 , "subsection of RoI to retrieve fewer TRT hits"}
Gaudi::Property< bool >	m_doFullScan {this, "doFullScan", false , "Whether to use all RoI"}
Gaudi::Property< float >	m_roadWidth {this, "RoadWidth", 4. , "Width of road in mm"}
Gaudi::Property< int >	m_nBinCoarse {this, "nBinCoarse", 14 , "Number of coarse bins used while phi centering"}
Gaudi::Property< int >	m_nBinFine {this, "nBinFine", 14 , "Number of fine bins used while phi centering"}
Gaudi::Property< float >	m_wedgeMinEta {this, "WedgeMinEta", 0 , "Min eta for wedge algorithm"}
Gaudi::Property< float >	m_roadMaxEta {this, "RoadMaxEta", 1.06 , "Max eta for road algorithm (barrel only)"}
Gaudi::Property< int >	m_wedgeNBin {this, "WedgeNBin", 5 , "Number of fine bins to consider in the wedge algorithm"}
SG::ReadHandleKey< TrigRoiDescriptorCollection >	m_roiCollectionKey
SG::ReadHandleKey< InDet::TRT_DriftCircleContainer >	m_trtDCContainerKey
SG::WriteHandleKey< xAOD::TrigRNNOutputContainer >	m_trigRNNOutputKey
ToolHandle< GenericMonitoringTool >	m_monTool { this, "MonTool", "", "Monitoring tool" }
DataObjIDColl	m_extendedExtraObjects
	Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default)
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default)
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Detailed Description

TrigTRTHTHCounter gives back the number of TRT high-threshold hits based on the code of HIPsFilterAlg by Sergey Burdin @migrated from TrigTRTHTHCounter.h & cxx.

Author

Jiri Masik Jiri..nosp@m.Masi.nosp@m.k@hep.nosp@m..man.nosp@m.chest.nosp@m.er.a.nosp@m.c.uk

Definition at line 42 of file TrigTRTHTHCounter.h.

Member Typedef Documentation

StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

TrigTRTHTHCounter()

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

Definition at line 38 of file TrigTRTHTHCounter.cxx.

  : AthReentrantAlgorithm(name, pSvcLocator)
{}

Member Function Documentation

cardinality()

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

overridevirtualinherited

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

Override this to return 0 for reentrant algorithms.

Definition at line 75 of file AthCommonReentrantAlgorithm.cxx.

{
  return 0;
}

declareGaudiProperty()

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

inlineprivateinherited

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

Definition at line 156 of file AthCommonDataStore.h.

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

declareProperty()

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

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

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

detStore()

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

inlineinherited

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

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

evtStore()

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

inlineinherited

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

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

execute()

StatusCode TrigTRTHTHCounter::execute ( const EventContext & ctx ) const

overridevirtual

Definition at line 63 of file TrigTRTHTHCounter.cxx.

                                                                   {
 
 ATH_MSG_DEBUG( "Executing " <<name());
 
 auto trigRNNOutputColl = SG::makeHandle (m_trigRNNOutputKey, ctx);  
 ATH_CHECK(trigRNNOutputColl.record (std::make_unique<xAOD::TrigRNNOutputContainer>(),
                                      std::make_unique<xAOD::TrigRNNOutputAuxContainer>()));
  
 ATH_MSG_DEBUG( "Made WriteHandle " << m_trigRNNOutputKey );  
 
 auto roiCollection = SG::makeHandle(m_roiCollectionKey, ctx);
 ATH_MSG_DEBUG( "Made handle " << m_roiCollectionKey  );
 
 if (roiCollection->size()==0) {
    ATH_MSG_DEBUG(" RoI collection size = 0");
    return StatusCode::SUCCESS;
 }
 
 const TrigRoiDescriptor* roiDescriptor = *(roiCollection->begin());
 
 ATH_MSG_DEBUG(" RoI ID = "   << (roiDescriptor)->roiId()
        << ": Eta = "      << (roiDescriptor)->eta()
        << ", Phi = "      << (roiDescriptor)->phi());
 
 
 std::vector<float> trththits{0,-999,0,-999,-999,-999};
 
 //Vectors to hold the count of total and HT TRT hits in the coarse bins 
 std::vector<int> count_httrt_c(m_nBinCoarse);
 std::vector<int> count_tottrt_c(m_nBinCoarse);
  
 //Vectors to hold the count of total and HT TRT hits in the fine bins
 std::vector<int> count_httrt(3*m_nBinFine);
 std::vector<int> count_tottrt(3*m_nBinFine);
 
 //Vector to hold TRT hits that are within RoI
 std::vector<TRT_hit> hit;
 
 //Sanity check of the ROI size
 double deltaEta= std::abs(roiDescriptor->etaPlus()-roiDescriptor->etaMinus());
 double deltaPhi= std::abs(CxxUtils::deltaPhi(roiDescriptor->phiPlus(),roiDescriptor->phiMinus()));
 
 ATH_MSG_DEBUG( "roiDescriptor->etaPlus() in TrigTRTHTHCounter:"<<roiDescriptor->etaPlus());
 ATH_MSG_DEBUG( "roiDescriptor->etaMinus() in TrigTRTHTHCounter:"<<roiDescriptor->etaMinus());
 ATH_MSG_DEBUG( "deltaEta in TrigTRTHTHCounter:"<<deltaEta); 
 
 float phiTolerance = 0.001;
 float etaTolerance = 0.001;
 
 if((m_etaHalfWidth - deltaEta/2.) > etaTolerance)
  ATH_MSG_WARNING ( "ROI eta range too small : " << deltaEta);
 
 if((m_phiHalfWidth - deltaPhi/2.) > phiTolerance)
  ATH_MSG_WARNING ( "ROI phi range too small : " << deltaPhi);
 
 float coarseWedgeHalfWidth = m_phiHalfWidth/m_nBinCoarse;
 float fineWedgeHalfWidth = coarseWedgeHalfWidth/m_nBinFine;
 
 //Code will only proceed if the RoI eta is not too large; used to limit rate from endcap
 if ( std::abs(roiDescriptor->eta())<=m_maxCaloEta ){
 
  SG::ReadHandle<InDet::TRT_DriftCircleContainer> trtDCC(m_trtDCContainerKey, ctx);
  ATH_MSG_DEBUG( "Made handle " << m_trtDCContainerKey );
 
  if (trtDCC->size() == 0){
      return StatusCode::SUCCESS; // Exit early if there are no tracks
  }
 
  InDet::TRT_DriftCircleContainer::const_iterator trtdriftContainerItr  = trtDCC->begin();
  InDet::TRT_DriftCircleContainer::const_iterator trtdriftContainerItrE = trtDCC->end();
 
  for (; trtdriftContainerItr != trtdriftContainerItrE; ++trtdriftContainerItr) {
    
    InDet::TRT_DriftCircleCollection::const_iterator trtItr = (*trtdriftContainerItr)->begin();
    InDet::TRT_DriftCircleCollection::const_iterator trtEnd = (*trtdriftContainerItr)->end();
      
    for(; trtItr!=trtEnd; ++trtItr){
    
      // find out which detector element the hit belongs to
      const InDetDD::TRT_BaseElement *det = (*trtItr)->detectorElement();
      Identifier ID = (*trtItr)->identify();
      const Amg::Vector3D& strawcenter = det->strawCenter(m_trtHelper->straw(ID));
 
      bool hth = false;
      float hphi = strawcenter.phi();
      float heta = strawcenter.eta();
      float R = strawcenter.perp(); 
 
      if ((*trtItr)->highLevel()) hth = true;
 
      //hit needs to be stored
      if(hth_eta_match((roiDescriptor)->eta(), heta, m_etaHalfWidth))
          hit.push_back(make_hit(hphi,R,hth));
 
 
      //First, define coarse wedges in phi, and count the TRT hits in these wedges
      int countbin=0;   
      if(std::abs(CxxUtils::deltaPhi(hphi, static_cast<float>(roiDescriptor->phi()))) < 0.1){
        float startValue = roiDescriptor->phi() - m_phiHalfWidth + coarseWedgeHalfWidth;
    float endValue = roiDescriptor->phi() + m_phiHalfWidth;
    float increment = 2*coarseWedgeHalfWidth;
        for(float roibincenter = startValue; roibincenter < endValue; roibincenter += increment){
          if (std::abs(CxxUtils::deltaPhi(hphi,roibincenter))<=coarseWedgeHalfWidth && hth_eta_match((roiDescriptor)->eta(), heta, m_etaHalfWidth)) {
        if(hth) count_httrt_c.at(countbin) += 1.;
        count_tottrt_c.at(countbin) += 1.;
      break; //the hit has been assigned to one of the coarse wedges, so no need to continue the for loop                           
    }
    countbin++;
       }
     }
     ATH_MSG_VERBOSE ( "timeOverThreshold=" << (*trtItr)->timeOverThreshold()
            << "  highLevel=" << (*trtItr)->highLevel()
            << " rawDriftTime=" << (*trtItr)->rawDriftTime()
            << " barrel_ec=" << m_trtHelper->barrel_ec(ID)
            << " phi_module=" << m_trtHelper->phi_module(ID)
            << " layer_or_wheel=" << m_trtHelper->layer_or_wheel(ID)
            << " straw_layer=" << m_trtHelper->straw_layer(ID)
            << " straw=" << m_trtHelper->straw(ID)
            << " scR=" << det->strawCenter(m_trtHelper->straw(ID)).perp()
            << " scPhi=" << hphi
            << " scEta=" << heta);          
      } // end of loop over TRT drift circle collection
    } //end of loop over TRT drift circle container
  } //end of check to see if RoI eta is not too large
 
  //Now figure out which of the coarse bins in phi has the max number of HT TRT hits
  int maxHits = 0; //used to keep track of the max number of HT TRT hits in a coarse bin
  int dist = 0; //used to keep track of which coarse bin has the max number of HT TRT hits
 
  for (size_t iw = 0; iw < count_httrt_c.size(); iw++){
    if(maxHits <= count_httrt_c[iw]){ 
      maxHits = count_httrt_c[iw]; 
      dist = iw;  
    }
  }
 
  //Value of dist can range between 0 and (m_nBinCoarse-1)
  float center_pos_phi=roiDescriptor->phi()+(2*dist+1-m_nBinCoarse)*coarseWedgeHalfWidth;
 
  //Now, define fine wedges in phi, centered around the best coarse wedge, and count the TRT hits in these fine wedges
  for(size_t v=0;v<hit.size();v++){
    int countbin=0; 
    if(std::abs(CxxUtils::deltaPhi(hit[v].phi, center_pos_phi)) < 0.01){
      float startValue = center_pos_phi - 3*coarseWedgeHalfWidth + fineWedgeHalfWidth;
      float endValue = center_pos_phi + 3*coarseWedgeHalfWidth;
      float increment = 2*fineWedgeHalfWidth;
      for(float roibincenter = startValue; roibincenter < endValue; roibincenter += increment){ 
        if (std::abs(CxxUtils::deltaPhi(hit[v].phi,roibincenter))<=fineWedgeHalfWidth) {
          if(hit[v].isHT) count_httrt.at(countbin) += 1.;
          count_tottrt.at(countbin) += 1.;
          break; //the hit has been assigned to one of the fine wedges, so no need to continue the for loop                         
    }
    countbin++;
      }
    }    
  }
  
  //Now figure out which of the fine bins in phi has the max number of HT TRT hits
  maxHits = 0; //used to keep track of the max number of HT TRT hits in a fine bin
  dist = 0; //used to keep track of which fine bin has the max number of HT TRT hits
  
  for (size_t iw = 0; iw < count_httrt.size(); iw++){
    if(maxHits <= count_httrt[iw]){ 
      maxHits = count_httrt[iw]; 
      dist = iw; 
    }
  }
 
  //Value of dist can range between 0 and (3*m_nBinFine-1)
  center_pos_phi+=(2*dist+1-3*m_nBinFine)*fineWedgeHalfWidth;
 
  //Count the number of total and HT TRT hits for the road algorithm
  int trthit=0, trthit_ht=0;
  for(size_t v=0;v<hit.size();v++){
    if (dist2COR(hit[v].R,hit[v].phi,center_pos_phi)<=m_roadWidth){
      if(hit[v].isHT) trthit_ht+=1; 
      trthit+=1;                        
    }
  }
 
  if (trthit!=0&&(std::abs(roiDescriptor->eta())<=m_roadMaxEta)){
    trththits[0] = trthit_ht;
    trththits[1] = (float)trthit_ht/trthit;
  }
 
  //Count the number of total and HT TRT hits for the wedge algorithm
  trthit = 0;
  trthit_ht = 0;
 
  for (int k=0;k<(2*m_wedgeNBin+1);k++){
    int binNumber = dist+k-m_wedgeNBin;
    //Even though we are supposed to use 2*m_wedgeNBin+1 fine bins, 
    //need to make sure that binNumber is sensible
    if(binNumber >= 0 && binNumber < (int)count_httrt.size()){
      trthit += count_tottrt.at(binNumber);
      trthit_ht += count_httrt.at(binNumber);
    }
  }
 
  if (trthit!=0&&(std::abs(roiDescriptor->eta())>=m_wedgeMinEta)){
    trththits[2] = trthit_ht;
    trththits[3] = (float)trthit_ht/trthit;
  }
 
  trththits[4]=roiDescriptor->eta();
  trththits[5]=roiDescriptor->phi();
 
  ATH_MSG_VERBOSE ( "trthits with road algorithm : " << trththits[0]);
  ATH_MSG_VERBOSE ( "fHT with road algorithm : " << trththits[1]);
  ATH_MSG_VERBOSE ( "trthits with wedge algorithm : " << trththits[2]);
  ATH_MSG_VERBOSE ( "fHT with wedge algorithm : " << trththits[3]);
  ATH_MSG_VERBOSE ( "ROI eta : " << trththits[4]);
  
  //Writing to xAOD
  xAOD::TrigRNNOutput* rnnOutput = new xAOD::TrigRNNOutput();
  trigRNNOutputColl->push_back(rnnOutput);
  rnnOutput->setRnnDecision(trththits);
  
  ATH_MSG_DEBUG("REGTEST:  returning an xAOD::TrigRNNOutputContainer with size "<< trigRNNOutputColl->size() << ".");
 
  return StatusCode::SUCCESS;
}

extraDeps_update_handler()

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

protectedinherited

Add StoreName to extra input/output deps as needed.

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

extraOutputDeps()

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

overridevirtualinherited

Return the list of extra output dependencies.

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

Definition at line 94 of file AthCommonReentrantAlgorithm.cxx.

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

filterPassed()

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

inlinevirtualinherited

Definition at line 96 of file AthCommonReentrantAlgorithm.h.

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

initialize()

StatusCode TrigTRTHTHCounter::initialize ( )

overridevirtual

Definition at line 42 of file TrigTRTHTHCounter.cxx.

{
  ATH_MSG_DEBUG ( "Initialising this TrigTRTHTHCounter: " << name());
 
  // Get a TRT identifier helper
  ATH_CHECK( detStore()->retrieve(m_trtHelper, "TRT_ID") );
 
  if (!m_doFullScan){
    ATH_MSG_INFO ( "PhiHalfWidth: " << m_phiHalfWidth << " EtaHalfWidth: "<< m_etaHalfWidth);
  } else {
    ATH_MSG_INFO ( "FullScan mode");
  }
 
  ATH_CHECK( m_roiCollectionKey.initialize() );
  ATH_CHECK( m_trtDCContainerKey.initialize() );
  ATH_CHECK( m_trigRNNOutputKey.initialize() );
 
  return StatusCode::SUCCESS;
}

inputHandles()

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

overridevirtualinherited

Return this algorithm's input handles.

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

isClonable()

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

overridevirtualinherited

Specify if the algorithm is clonable.

Reentrant algorithms are clonable.

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

Definition at line 68 of file AthCommonReentrantAlgorithm.cxx.

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

msg()

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

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

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

outputHandles()

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

overridevirtualinherited

Return this algorithm's output handles.

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

renounce()

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

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

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

renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

setFilterPassed()

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

inlinevirtualinherited

Definition at line 100 of file AthCommonReentrantAlgorithm.h.

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

sysExecute()

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

overridevirtualinherited

Execute an algorithm.

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

Definition at line 85 of file AthCommonReentrantAlgorithm.cxx.

{
  return BaseAlg::sysExecute (ctx);
}

sysInitialize()

StatusCode AthCommonReentrantAlgorithm< Gaudi::Algorithm >::sysInitialize ( )

overridevirtualinherited

Override sysInitialize.

Override sysInitialize from the base class.

Loop through all output handles, and if they're WriteCondHandles, automatically register them and this Algorithm with the CondSvc

Scan through all outputHandles, and if they're WriteCondHandles, register them with the CondSvc

Reimplemented from AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >.

Reimplemented in HypoBase, and InputMakerBase.

Definition at line 61 of file AthCommonReentrantAlgorithm.cxx.

                                                               {
  StatusCode sc=AthCommonDataStore<AthCommonMsg<BaseAlg>>::sysInitialize();
 
  if (sc.isFailure()) {
    return sc;
  }
  
  ServiceHandle<ICondSvc> cs("CondSvc",name());
  for (auto h : outputHandles()) {
    if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
      // do this inside the loop so we don't create the CondSvc until needed
      if ( cs.retrieve().isFailure() ) {
        ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
        return StatusCode::SUCCESS;
      }      
      if (cs->regHandle(this,*h).isFailure()) {
        sc = StatusCode::FAILURE;
        ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
                      << " with CondSvc");
      }
    }
  }
  return sc;  
}

sysStart()

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

overridevirtualinherited

Handle START transition.

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

updateVHKA()

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

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

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

Member Data Documentation

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_doFullScan

Gaudi::Property<bool> TrigTRTHTHCounter::m_doFullScan {this, "doFullScan", false , "Whether to use all RoI"}

private

Definition at line 59 of file TrigTRTHTHCounter.h.

{this,  "doFullScan", false , "Whether to use all RoI"};

m_etaHalfWidth

Gaudi::Property<float> TrigTRTHTHCounter::m_etaHalfWidth {this, "EtaHalfWidth", 0.1 , "subsection of RoI to retrieve fewer TRT hits"}

private

Definition at line 57 of file TrigTRTHTHCounter.h.

{this,  "EtaHalfWidth", 0.1 , "subsection of RoI to retrieve fewer TRT hits"};

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_maxCaloEta

float TrigTRTHTHCounter::m_maxCaloEta {1.7}

private

Definition at line 54 of file TrigTRTHTHCounter.h.

{1.7};

m_monTool

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

private

Definition at line 83 of file TrigTRTHTHCounter.h.

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

m_nBinCoarse

Gaudi::Property<int> TrigTRTHTHCounter::m_nBinCoarse {this, "nBinCoarse", 14 , "Number of coarse bins used while phi centering"}

private

Definition at line 61 of file TrigTRTHTHCounter.h.

{this,  "nBinCoarse", 14 , "Number of coarse bins used while phi centering"};

m_nBinFine

Gaudi::Property<int> TrigTRTHTHCounter::m_nBinFine {this, "nBinFine", 14 , "Number of fine bins used while phi centering"}

private

Definition at line 62 of file TrigTRTHTHCounter.h.

{this,  "nBinFine", 14 , "Number of fine bins used while phi centering"};

m_phiHalfWidth

Gaudi::Property<float> TrigTRTHTHCounter::m_phiHalfWidth {this, "PhiHalfWidth", 0.1 , "subsection of RoI to retrieve fewer TRT hits"}

private

Definition at line 58 of file TrigTRTHTHCounter.h.

{this,  "PhiHalfWidth", 0.1 , "subsection of RoI to retrieve fewer TRT hits"};

m_roadMaxEta

Gaudi::Property<float> TrigTRTHTHCounter::m_roadMaxEta {this, "RoadMaxEta", 1.06 , "Max eta for road algorithm (barrel only)"}

private

Definition at line 64 of file TrigTRTHTHCounter.h.

{this,  "RoadMaxEta", 1.06 , "Max eta for road algorithm (barrel only)"};

m_roadWidth

Gaudi::Property<float> TrigTRTHTHCounter::m_roadWidth {this, "RoadWidth", 4. , "Width of road in mm"}

private

Definition at line 60 of file TrigTRTHTHCounter.h.

{this,  "RoadWidth", 4. , "Width of road in mm"};

m_roiCollectionKey

SG::ReadHandleKey<TrigRoiDescriptorCollection> TrigTRTHTHCounter::m_roiCollectionKey

private

Initial value:

{ this, 
      "RoIs",                             
      "rois",                                                        
      "input RoI Collection name"}

Definition at line 67 of file TrigTRTHTHCounter.h.

                                                                  { this, 
      "RoIs",                             // property name
      "rois",                                                        // default value of StoreGate key
      "input RoI Collection name"};

m_trigRNNOutputKey

SG::WriteHandleKey<xAOD::TrigRNNOutputContainer> TrigTRTHTHCounter::m_trigRNNOutputKey

private

Initial value:

{ this,
      "RNNOutputName",                  
      "RNNOutput",                      
      "output RNN container name "}

Definition at line 78 of file TrigTRTHTHCounter.h.

                                                                 { this,
      "RNNOutputName",                  // property name
      "RNNOutput",                      // default value of StoreGate key
      "output RNN container name "};

m_trtDCContainerKey

SG::ReadHandleKey<InDet::TRT_DriftCircleContainer> TrigTRTHTHCounter::m_trtDCContainerKey

private

Initial value:

{this, 
      "TRT_DC_ContainerName", 
      "TRT_DriftCircleContainer", 
      "TRT DriftCircle Container"}

Definition at line 72 of file TrigTRTHTHCounter.h.

                                                                    {this, 
      "TRT_DC_ContainerName", 
      "TRT_DriftCircleContainer", 
      "TRT DriftCircle Container"};

m_trtHelper

const TRT_ID* TrigTRTHTHCounter::m_trtHelper {nullptr}

private

TRT ID helper.

Definition at line 52 of file TrigTRTHTHCounter.h.

{nullptr};     

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.

m_wedgeMinEta

Gaudi::Property<float> TrigTRTHTHCounter::m_wedgeMinEta {this, "WedgeMinEta", 0 , "Min eta for wedge algorithm"}

private

Definition at line 63 of file TrigTRTHTHCounter.h.

{this,  "WedgeMinEta", 0  , "Min eta for wedge algorithm"};

m_wedgeNBin

Gaudi::Property<int> TrigTRTHTHCounter::m_wedgeNBin {this, "WedgeNBin", 5 , "Number of fine bins to consider in the wedge algorithm"}

private

Definition at line 65 of file TrigTRTHTHCounter.h.

{this,  "WedgeNBin", 5 , "Number of fine bins to consider in the wedge algorithm"};

---

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

• TrigTRTHTHCounter.h
• TrigTRTHTHCounter.cxx