#include <TileLookForMuAlg.h>

Inheritance diagram for TileLookForMuAlg:

Collaboration diagram for TileLookForMuAlg:

Public Member Functions
	TileLookForMuAlg (const std::string &name, ISvcLocator *pSvcLocator)
virtual	~TileLookForMuAlg ()
virtual StatusCode	initialize () override
virtual StatusCode	execute (const EventContext &ctx) const override
virtual StatusCode	finalize () 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
enum	N_CELLS_SAMP { N_CELLS_D = 13 , N_CELLS_BC = 30 , N_CELLS_A = 30 }
enum	N_OF_MODULES { N_MODULES = 64 }
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 TileID *	m_tileID
double	m_etaD [N_CELLS_D]
double	m_etaBC [N_CELLS_BC]
double	m_etaA [N_CELLS_A]
const int	m_nMuMax
std::vector< int >	m_fromDtoBC
std::vector< int >	m_fromBCtoA
double	m_loThrA
double	m_loThrBC
double	m_loThrD
double	m_loThrITC
std::vector< double >	m_hiThrD
std::vector< double >	m_hiThrBC
std::vector< double >	m_hiThrA
SG::ReadHandleKey< CaloCellContainer >	m_cellContainerKey
SG::WriteHandleKey< TileMuContainer >	m_muContainerKey
DataObjIDColl	m_extendedExtraObjects
	Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default)
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default)
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Detailed Description

Definition at line 43 of file TileLookForMuAlg.h.

Member Typedef Documentation

◆ StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Member Enumeration Documentation

◆ N_CELLS_SAMP

enum TileLookForMuAlg::N_CELLS_SAMP

private

Enumerator
N_CELLS_D
N_CELLS_BC
N_CELLS_A

Definition at line 62 of file TileLookForMuAlg.h.

                      {
      N_CELLS_D = 13, N_CELLS_BC = 30, N_CELLS_A = 30
    };

◆ N_OF_MODULES

enum TileLookForMuAlg::N_OF_MODULES

private

Enumerator
N_MODULES

Definition at line 65 of file TileLookForMuAlg.h.

                      {
      N_MODULES = 64
    };

Constructor & Destructor Documentation

◆ TileLookForMuAlg()

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

Definition at line 28 of file TileLookForMuAlg.cxx.

  : AthReentrantAlgorithm(name, pSvcLocator)
  , m_tileID(0)
  , m_etaD()
  , m_etaBC()
  , m_etaA()
  , m_nMuMax(30)
{
  declareProperty("LowerTresh0MeV", m_loThrA=80.0);
  declareProperty("LowerTresh1MeV", m_loThrBC=80.0);
  declareProperty("LowerTresh2MeV", m_loThrD=80.0);
  declareProperty("LowerTreshScinMeV", m_loThrITC=160.0);
  declareProperty("UpperTresh2MeV", m_hiThrD);
  declareProperty("UpperTresh1MeV", m_hiThrBC);
  declareProperty("UpperTresh0MeV", m_hiThrA);
  declareProperty("From3to2", m_fromDtoBC);
  declareProperty("From2to1", m_fromBCtoA);
 
}

◆ ~TileLookForMuAlg()

TileLookForMuAlg::~TileLookForMuAlg ( )

virtual

Definition at line 49 of file TileLookForMuAlg.cxx.

49 {

50}

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.

95{ return m_detStore; }

AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_detStore

StoreGateSvc_t m_detStore

Definition AthCommonDataStore.h:393

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

85{ return m_evtStore; }

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

StoreGateSvc_t m_evtStore

Definition AthCommonDataStore.h:390

◆ execute()

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

overridevirtual

Definition at line 103 of file TileLookForMuAlg.cxx.

                                                                   {
 
  ATH_MSG_DEBUG("TileLookForMuAlg execution  started");
 
  //coverity[STACK_USE]
  double eneA[N_CELLS_A][N_MODULES]; // calorimeter cell matrices  
  //coverity[STACK_USE]
  double eneBC[N_CELLS_BC][N_MODULES];
  //coverity[STACK_USE]
  double eneD[N_CELLS_D][N_MODULES];
 
  memset(eneA, 0, sizeof(eneA));
  memset(eneBC, 0, sizeof(eneBC));
  memset(eneD, 0, sizeof(eneD));
 
  SG::WriteHandle<TileMuContainer> muContainer(m_muContainerKey, ctx);
  ATH_CHECK( muContainer.record(std::make_unique<TileMuContainer>()) );
 
 
  //  Get CaloCell  Container
  std::vector<const CaloCell*> cellList;
 
  SG::ReadHandle<CaloCellContainer> cellContainer(m_cellContainerKey, ctx);
  ATH_CHECK( cellContainer.isValid() );
 
  CaloCell_ID::SUBCALO tileCell_ID = CaloCell_ID::TILE;
  CaloCellContainer::const_iterator currentCell =
      cellContainer->beginConstCalo(tileCell_ID);
  CaloCellContainer::const_iterator lastCell = 
      cellContainer->endConstCalo(tileCell_ID);
 
  ATH_MSG_DEBUG( "Calo Container size "
                << cellContainer->nCellsCalo(tileCell_ID));
 
  double phi[64] = { 0 };
//  TileID::SAMPLE cellSample;
  for (; currentCell != lastCell; ++currentCell) {
    int iCell = -1;
    double cellEta = (*currentCell)->eta();
    if (cellEta > -1.5 && cellEta < 1.5) {
      int cellModule;
      int cellSample = m_tileID->sample((*currentCell)->ID());
      switch (cellSample) {
        case TileID::SAMP_A:
          iCell = (cellEta + 1.5) * 10;
          cellModule = m_tileID->module((*currentCell)->ID());
          eneA[iCell][cellModule] = (*currentCell)->energy();
          phi[cellModule] = (*currentCell)->phi();
          break;
        case TileID::SAMP_BC:
          iCell = (cellEta + 1.5) * 10;
          cellModule = m_tileID->module((*currentCell)->ID());
          eneBC[iCell][cellModule] = (*currentCell)->energy();
          phi[cellModule] = (*currentCell)->phi();
          break;
        case TileID::SAMP_D:
          iCell = (cellEta + 1.3) * 5;
          cellModule = m_tileID->module((*currentCell)->ID());
          eneD[iCell][cellModule] = (*currentCell)->energy();
          phi[cellModule] = (*currentCell)->phi();
          cellList.push_back(*currentCell);
          break;
        case TileID::SAMP_E:
          iCell = (cellEta + 1.5) * 10;
          if (iCell == 4 || iCell == 25) {
            cellModule = m_tileID->module((*currentCell)->ID());
            eneA[iCell][cellModule] = (*currentCell)->energy();
            phi[cellModule] = (*currentCell)->phi();
          }
          break;
      }
    }
 
    if (msgLvl(MSG::VERBOSE)) {
      msg(MSG::VERBOSE) << "scintillators sample, eta, phi, ene => "
                        << m_tileID->sample((*currentCell)->ID()) << ","
                        << cellEta << ","
                        << (*currentCell)->phi() << ","
                        << (*currentCell)->energy() << endmsg;
 
      msg(MSG::VERBOSE) << "sample, tower, eta => " 
                        << m_tileID->sample((*currentCell)->ID()) << ", "
                        << m_tileID->tower((*currentCell)->ID()) << ", "
                        << cellEta << endmsg;
    }
  } /* end of Tile cells loop*/
 
  std::vector<double> muEtaD;
  std::vector<float> muEneD;
  std::vector<int> muModule;
  std::vector<int> muCellD;
  std::vector<int> muSplitted;
  std::vector<int> muQualityD;
  std::vector<int> muFound;
  muEtaD.reserve(m_nMuMax);
  muEneD.reserve(m_nMuMax);
  muModule.reserve(m_nMuMax);
  muCellD.reserve(m_nMuMax);
  muSplitted.reserve(m_nMuMax);
  muQualityD.reserve(m_nMuMax);
  muFound.reserve(m_nMuMax);
 
  int nCandidates = 0, ntri = 0;
  int nSplitted = 0;
 
  ATH_MSG_VERBOSE("Start the  muon search candidates ");
 
  // find muon candidates
  int lastMuCell = -3;
  int lastMuModule = -3;
  for (int iModule = 0; iModule < N_MODULES; ++iModule) {
    int prevCell = -2;
    for (int iCellD = 0; iCellD < N_CELLS_D; ++iCellD) {
      float energy = eneD[iCellD][iModule];
      if (energy >= m_loThrD) {
        int splitted = -1;
        double eta = m_etaD[iCellD];
        double hiThr = m_hiThrD[iCellD];
        int quality = (energy < hiThr) ? 0 : 1;
        // check for muon splitting (same phi bin and neighboring eta bin)
        if (prevCell == lastMuCell && iModule == lastMuModule) {
          int sumQuality = quality + muQualityD.back();
          float sumEnergy = energy + eneD[prevCell][iModule];
          double hiPrevThr = m_hiThrD[prevCell];
          double maxHiThr = (hiThr > hiPrevThr) ? hiThr : hiPrevThr;
          if ((sumQuality == 0 && sumEnergy < maxHiThr) || sumQuality == 1) {
            // possible splitting with last found muon candidate 
            splitted = nCandidates - 1; // idx of splitting mu candidate
            energy = sumEnergy;
            eta = (eta + m_etaD[prevCell]) / 2;
            ++nSplitted;
            ATH_MSG_VERBOSE( "Possible splits between mu candidates ("
                            << (splitted + 1) << ", " << splitted
                            << "): etaD1, etaD2, eta => "
                            << m_etaD[iCellD] << ", "
                            << m_etaD[prevCell] << ", "
                            << eta
                            << "; eneD1, eneD2, energy => "
                            << eneD[iCellD][iModule] << ", "
                            << eneD[prevCell][iModule] << ", "
                            << energy);
          }
        }
        muModule.push_back(iModule);
        muCellD.push_back(iCellD);
        muSplitted.push_back(splitted);
        muFound.push_back(0);
        muEneD.push_back(energy);
        muQualityD.push_back(quality);
        muEtaD.push_back(eta);
        ++nCandidates;
        lastMuCell = iCellD;
        lastMuModule = iModule;
        ATH_MSG_VERBOSE( "Candidate  number= " << nCandidates
                        << ", tower index (iCellD)= " << iCellD
                        << ", module index(iModuleD)= " << iModule
                        << ", Energy(iCellD)(iModuleD) = " << eneD[iCellD][iModule]
                        << ", threshold2(iCellD)= " << m_hiThrD[iCellD]);
      } else {
        // ATH_MSG_VERBOSE ( "no candidates" );
      }
      prevCell = iCellD;
    }
  }
 
  // debug ---------------------------------------- 
  if (msgLvl(MSG::VERBOSE)) {
    for (int i = 0; i < nCandidates; ++i) {
      msg(MSG::VERBOSE) << "Candidates list: number   phi,ene, eta "
                        << i << ","
                        << muModule[i] << ","
                        << muEneD[i] << ","
                        << muCellD[i]
                        << "nSplitted,muSplitted(cand)" << nSplitted << ", "
                        << muSplitted[i] << endmsg;
    }
  }
 
  //*************** loop on the candidates----------------------* 
 
  for (int iMu = 0; iMu < nCandidates; ++iMu) {
    int splitted = muSplitted[iMu];
    if (splitted < 0 || muFound[splitted] == 0) {
 
      // the most  important information on mu  is in the 3rd sample
      // to avoid multiple counting due to splitting in  2nd and 1st Sp. cells
      // the  loop  stop  when the  candidate is found
 
      int module = muModule[iMu];
      ATH_MSG_VERBOSE(
          "loop on mu candidates: iMu, module = " << iMu << ", " << module);
      int idxD = 6 * muCellD[iMu];
      ATH_MSG_VERBOSE ("number of cells in BC layer to check = " << m_fromDtoBC[idxD]);
      int endIdxD = idxD + m_fromDtoBC[idxD];
      while (++idxD <= endIdxD && muFound[iMu] != 1) {
        int cellBC = m_fromDtoBC[idxD];
        float energyBC = eneBC[cellBC][module];
        ATH_MSG_VERBOSE( "cellBC = " << cellBC
                        << ", module=" << module
                        << ", eneBC =" << energyBC);
        if (energyBC > m_loThrBC) {
          int qualityBC = (energyBC < m_hiThrBC[cellBC]) ? 0 : 1;
          int idxBC = 6 * cellBC;
          ATH_MSG_VERBOSE ("number of cells in A layer to check for mu = " << m_fromBCtoA[idxBC]);
          int endIdxBC = idxBC + m_fromBCtoA[idxBC];
          while (++idxBC <= endIdxBC && muFound[iMu] != 1) {
            int cellA = m_fromBCtoA[idxBC];
            float energyA = eneA[cellA][module];
            ATH_MSG_VERBOSE( "cellA index = " << cellA
                            << ", module=" << module
                            << ", eneA =" << energyA);
 
            if ( energyA >  ( (cellA == 4 || cellA == 25) ? m_loThrITC : m_loThrA ) ) {
 
              int qualityA = (energyA < m_hiThrA[cellA]) ? 0 : 1;
 
              // We have a   muon like signature  
 
              int muQuality = muQualityD[iMu] + qualityBC + qualityA;
              if (muQuality <= 1) {
                muFound[iMu] = 1;
                double muEta = (muEtaD[iMu] + m_etaBC[cellBC] + m_etaA[cellA]) / 3;
                double muPhi = phi[module];
                std::vector<float> muEnergy;
                muEnergy.reserve(4);
                muEnergy.push_back(energyA);
                muEnergy.push_back(energyBC);
                muEnergy.push_back(muEneD[iMu]);
                float eneAround = 0;
 
                ATH_MSG_VERBOSE( "tag ntri eta,phi,ene[0]= " << (++ntri) << ", "
                                << muEta << ", "
                                << muPhi << ", "
                                << muEnergy[0] << ", "
                                << muEnergy[1] << ", "
                                << muEnergy[2]
                                << " tag  eta 1st, 2nd, 3rd,"
                                << m_etaA[cellA] << ", "
                                << m_etaBC[cellBC] << ", "
                                << m_etaD[muCellD[iMu]]);
 
                int nextModule = (module != 63) ? (module + 1) : 0;
                int prevModule = (module != 0) ? (module - 1) : 63;
                eneAround = eneA[cellA][nextModule] + eneA[cellA][prevModule]
                    + eneBC[cellBC][nextModule] + eneBC[cellBC][prevModule]; //phi neigh
 
                int nextCellA = cellA + 1;
                int prevCellA = cellA - 1;
                if (nextCellA < N_CELLS_A && prevCellA > 0) {
                  eneAround += eneA[nextCellA][module] + eneA[prevCellA][module]
                      + eneA[nextCellA][nextModule]
                      + eneA[nextCellA][prevModule]
                      + eneA[prevCellA][nextModule]
                      + eneA[prevCellA][prevModule];
 
                }
 
                int nextCellBC = cellBC + 1;
                int prevCellBC = cellBC - 1;
                if (nextCellBC < N_CELLS_BC && prevCellBC > 0) {
                  eneAround += eneBC[nextCellBC][module]
                      + eneBC[prevCellBC][module]
                      + eneBC[nextCellBC][nextModule]
                      + eneBC[nextCellBC][prevModule]
                      + eneBC[prevCellBC][nextModule]
                      + eneBC[prevCellBC][prevModule];
 
                }
 
                muEnergy.push_back(eneAround);
                std::unique_ptr<TileMu> muon = std::make_unique<TileMu>((float) muEta, 
                                                                        (float) muPhi, 
                                                                        muEnergy, 
                                                                        muQuality);
 
                ATH_MSG_VERBOSE( "muon tag eta=" << muon->eta()
                                << " muon tag phi=" << muon->phi()
                                << " energydepVec[0]=" << muon->enedep()[0]
                                << " energydepVec[1]=" << muon->enedep()[1]
                                << " energydepVec[2]=" << muon->enedep()[2]
                                << " energydepVec[3]=" << muon->enedep()[3]
                                << " muon tag Q factor=" << muon->quality()
                                << " ene around= " << eneAround);
 
                muContainer->push_back(muon.release());
              }
 
            } else {
              ATH_MSG_VERBOSE(" tag eneA out");
            } //endif eneA is in the range
          } //end loop on pattern  1st layer
        } else {
          ATH_MSG_VERBOSE(" tag eneBC out");
        } //endif eneBC is in the range
      } //endloop on pattern 2nd layer
    } else {
      break;
    }
  } //endloop on candidate 
 
//-----debug-----------------------------------------------
  // cellList contain the 3rd layer cell information 
  if (msgLvl(MSG::VERBOSE)) {
    for (const CaloCell* cell : cellList) {
      msg(MSG::VERBOSE) << " tag Cell (sect,side,mod,tow,sam)=("
                        << m_tileID->section(cell->ID()) << " "
                        << m_tileID->side(cell->ID()) << " "
                        << m_tileID->module(cell->ID()) << " "
                        << m_tileID->tower(cell->ID()) << " "
                        << m_tileID->sample(cell->ID())
                        << "),(eta,phi,energy)=("
                        << cell->eta() << ","
                        << cell->phi() << ","
                        << cell->energy() << ")" << endmsg;
    }
  }
 
  //debug--------------------------------------------------- 
  // check the mu tag container  
  if (msgLvl(MSG::DEBUG)) {
    for (const TileMu* mu : *muContainer) {
      msg(MSG::DEBUG) << "Container name = " << m_muContainerKey.key()
                      << "  eta = " << mu->eta()
                      << "  phi = " << mu->phi()
                      << "  enedep[0] = " << (mu->enedep())[0]
                      << "  enedep[1] = " << (mu->enedep())[1]
                      << "  enedep[2] = " << (mu->enedep())[2]
                      << "  enedep[3] = " << (mu->enedep())[3]
                      << "  quality = " << mu->quality() << endmsg;
    }
  }
  //-------------------debug-------------------------
 
  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();
  }

◆ finalize()

StatusCode TileLookForMuAlg::finalize ( )

overridevirtual

Definition at line 439 of file TileLookForMuAlg.cxx.

                                      {
  ATH_MSG_DEBUG("TileLookForMuAlg finalization completed");
  return StatusCode::SUCCESS;
}

◆ initialize()

StatusCode TileLookForMuAlg::initialize ( )

overridevirtual

Definition at line 55 of file TileLookForMuAlg.cxx.

                                        {
 
  // retrieve TileID helper and TileIfno from det store
 
  CHECK( detStore()->retrieve(m_tileID) );
 
 
  // define a numbering scheme for the cells  
  double eta_D = -1.2;
  for (int iCellD = 0; iCellD < N_CELLS_D; ++iCellD) {
    m_etaD[iCellD] = eta_D;
    eta_D += 0.2;
  }
 
  if (msgLvl(MSG::DEBUG)) {
    for (int iCellD = 0; iCellD < N_CELLS_D; ++iCellD) {
      msg(MSG::DEBUG) << " etaD[" << iCellD << "] = " << m_etaD[iCellD] << endmsg;
    }
  }
 
 
  double eta_BC_A = -1.45;
  for (int iCell = 0; iCell < N_CELLS_BC; ++iCell) {
    m_etaBC[iCell] = eta_BC_A;
    m_etaA[iCell] = eta_BC_A;
    eta_BC_A += 0.1;
  }
 
 
  if (msgLvl(MSG::DEBUG)) {
    for (int iCell = 0; iCell < N_CELLS_BC; ++iCell) {
      msg(MSG::DEBUG) << " etaBC[" << iCell << "] = " << m_etaBC[iCell] << endmsg;
      msg(MSG::DEBUG) << " etaA[" << iCell << "] = " << m_etaA[iCell] << endmsg;
    }
  }
 
 
  ATH_CHECK( m_cellContainerKey.initialize() );
  ATH_CHECK( m_muContainerKey.initialize() );
 
  ATH_MSG_DEBUG("TileLookForMuAlg initialization completed");
 
  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.

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

SG::ReadHandleKey<CaloCellContainer> TileLookForMuAlg::m_cellContainerKey

private

Initial value:

{this,"CellsNames",
                                                            "AllCalo",
                                                            "Input Calo cell container key"}

Definition at line 86 of file TileLookForMuAlg.h.

                                                         {this,"CellsNames",
                                                            "AllCalo",
                                                            "Input Calo cell container key"};

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

double TileLookForMuAlg::m_etaA[N_CELLS_A]

private

Definition at line 70 of file TileLookForMuAlg.h.

◆ m_etaBC

double TileLookForMuAlg::m_etaBC[N_CELLS_BC]

private

Definition at line 69 of file TileLookForMuAlg.h.

◆ m_etaD

double TileLookForMuAlg::m_etaD[N_CELLS_D]

private

Definition at line 68 of file TileLookForMuAlg.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_fromBCtoA

std::vector<int> TileLookForMuAlg::m_fromBCtoA

private

Definition at line 74 of file TileLookForMuAlg.h.

◆ m_fromDtoBC

std::vector<int> TileLookForMuAlg::m_fromDtoBC

private

Definition at line 73 of file TileLookForMuAlg.h.

◆ m_hiThrA

std::vector<double> TileLookForMuAlg::m_hiThrA

private

Definition at line 84 of file TileLookForMuAlg.h.

◆ m_hiThrBC

std::vector<double> TileLookForMuAlg::m_hiThrBC

private

Definition at line 83 of file TileLookForMuAlg.h.

◆ m_hiThrD

std::vector<double> TileLookForMuAlg::m_hiThrD

private

Definition at line 82 of file TileLookForMuAlg.h.

◆ m_loThrA

double TileLookForMuAlg::m_loThrA

private

Definition at line 77 of file TileLookForMuAlg.h.

◆ m_loThrBC

double TileLookForMuAlg::m_loThrBC

private

Definition at line 78 of file TileLookForMuAlg.h.

◆ m_loThrD

double TileLookForMuAlg::m_loThrD

private

Definition at line 79 of file TileLookForMuAlg.h.

◆ m_loThrITC

double TileLookForMuAlg::m_loThrITC

private

Definition at line 80 of file TileLookForMuAlg.h.

◆ m_muContainerKey

SG::WriteHandleKey<TileMuContainer> TileLookForMuAlg::m_muContainerKey

private

Initial value:

{this,"TileMuTagsOutputName",
                                                         "TileMuObj",
                                                         "Output Tile mu container key"}

Definition at line 90 of file TileLookForMuAlg.h.

                                                      {this,"TileMuTagsOutputName",
                                                         "TileMuObj",
                                                         "Output Tile mu container key"};

◆ m_nMuMax

const int TileLookForMuAlg::m_nMuMax

private

Definition at line 71 of file TileLookForMuAlg.h.

◆ m_tileID

const TileID* TileLookForMuAlg::m_tileID

private

Definition at line 59 of file TileLookForMuAlg.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:

Public Member Functions

Protected Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ StoreGateSvc_t

Member Enumeration Documentation

◆ N_CELLS_SAMP

◆ N_OF_MODULES

Constructor & Destructor Documentation

◆ TileLookForMuAlg()

◆ ~TileLookForMuAlg()

Member Function Documentation

◆ cardinality()

◆ declareGaudiProperty()

◆ declareProperty()

◆ detStore()

◆ evtStore()

◆ execute()

◆ extraDeps_update_handler()

◆ extraOutputDeps()

◆ filterPassed()

◆ finalize()

◆ initialize()

◆ inputHandles()

◆ isClonable()

◆ msg()

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ setFilterPassed()

◆ sysExecute()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

Member Data Documentation

◆ m_cellContainerKey

◆ m_detStore

◆ m_etaA

◆ m_etaBC

◆ m_etaD

◆ m_evtStore

◆ m_extendedExtraObjects

◆ m_fromBCtoA

◆ m_fromDtoBC

◆ m_hiThrA

◆ m_hiThrBC

◆ m_hiThrD

◆ m_loThrA

◆ m_loThrBC

◆ m_loThrD

◆ m_loThrITC

◆ m_muContainerKey

◆ m_nMuMax

◆ m_tileID

◆ m_varHandleArraysDeclared

◆ m_vhka