GepPi0Alg Class Reference

#include <GepPi0Alg.h>

Inheritance diagram for GepPi0Alg:

Collaboration diagram for GepPi0Alg:

Public Types
typedef std::vector< std::vector< const CaloCell * > >	CellVectors
typedef std::vector< std::vector< float > >	PathsSignif

Public Member Functions
	GepPi0Alg (const std::string &name, ISvcLocator *pSvcLocator)
virtual StatusCode	initialize () override
virtual StatusCode	execute (const EventContext &) 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
StatusCode	twinpeaks_strategy (const CaloCell *seed, const std::vector< const CaloCell * > &laremCells, const std::vector< const CaloCell * > &emb1Cells, std::size_t iseed, const CaloNoise *, const CaloDetDescrManager *) const
StatusCode	sort_strategy (const CaloCell *seed, const std::vector< const CaloCell * > &laremCells, const std::vector< const CaloCell * > &emb1Cells, std::size_t iseed, const CaloNoise *, const CaloDetDescrManager *) const
StatusCode	crawl_strategy (const CaloCell *seed, const std::vector< const CaloCell * > &laremCells, const std::vector< const CaloCell * > &emb1Cells, std::size_t iseed, const CaloNoise *, const CaloDetDescrManager *) const
StatusCode	neighborhood (const CaloCell *, const std::vector< const CaloCell * > &laremCells, std::vector< const CaloCell * > &neighs, const CaloDetDescrManager *) const
StatusCode	dump_crawl (std::size_t iseed, const CaloCell *seed, float seed_signif, const CellVectors &, const PathsSignif &, const std::vector< std::string > &paths_pat) const
StatusCode	dump_twinpeaks (std::size_t iseed, const CaloCell *seed, double seed_signif, const std::vector< const CaloCell * > &neighborhood, const std::vector< const CaloCell * > &peaks, const std::vector< double > &peak_signifs) const
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
std::atomic< size_t >	m_id {0l}
SG::ReadHandleKey< CaloCellContainer >	m_allCaloCellsKey
ToolHandle< ICaloCellsProducer >	m_cellsProducer
SG::ReadCondHandleKey< CaloNoise >	m_totalNoiseKey
const CaloCell_ID *	m_calocell_id {nullptr}
SG::ReadCondHandleKey< CaloDetDescrManager >	m_caloMgrKey
Gaudi::Property< float >	m_neigh_half_eta
Gaudi::Property< float >	m_neigh_half_phi
Gaudi::Property< std::vector< std::string > >	m_strategies
Gaudi::Property< float >	m_seed_signifcut
Gaudi::Property< float >	m_tp_signifcut
Gaudi::Property< float >	m_crawl_signifcut
Gaudi::Property< int >	m_er_neta
Gaudi::Property< int >	m_er_nphi
Gaudi::Property< bool >	m_dump
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 42 of file GepPi0Alg.h.

Member Typedef Documentation

CellVectors

typedef std::vector<std::vector<const CaloCell*> > GepPi0Alg::CellVectors

Definition at line 45 of file GepPi0Alg.h.

PathsSignif

typedef std::vector<std::vector<float> > GepPi0Alg::PathsSignif

Definition at line 46 of file GepPi0Alg.h.

StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

GepPi0Alg()

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

Definition at line 20 of file GepPi0Alg.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;
}

crawl_strategy()

StatusCode GepPi0Alg::crawl_strategy ( const CaloCell * seed, const std::vector< const CaloCell * > & laremCells, const std::vector< const CaloCell * > & emb1Cells, std::size_t iseed, const CaloNoise * totalNoiseCDO, const CaloDetDescrManager * caloMgr ) const

private

Definition at line 423 of file GepPi0Alg.cxx.

                                                        {
 
  if (!seed) {return StatusCode::SUCCESS;}
  if (allEMB1Cells.empty()) {return StatusCode::SUCCESS;}
 
 
  // path_str is a string composed of '0' and '1' characters.
  // '0' indicates an energy decreases
  // '1' indicates the energy increases along the path.
 
  // a path is calculated for a number of contiguous eta steps.
  // for each eta value, a path is formed in the two phi directions.
  //
  // The first step is to determine the CaloCell hashes along
  // the paths, starting from the location of the seed cell.
 
  ATH_MSG_DEBUG("crawl: start");
  ATH_MSG_DEBUG("crawl - seed eta " << seed->eta()
        << " phi " << seed->phi());
 
  std::vector<std::string> paths(2*m_er_neta +1);
 
  auto seed_hash = m_calocell_id->calo_cell_hash(seed->ID());
 
  std::vector<IdentifierHash> phi_starts;
 
  // start point for +- phi paths about the seed eta value
  phi_starts.push_back(seed_hash);
 
  
  std::vector<LArNeighbours::neighbourOption>
    dirs {LArNeighbours::prevInEta, LArNeighbours::nextInEta};
 
  // start point for +- phi paths above and below the seed eta
 
  for (const auto& dir : dirs) {
    auto cur_hash = seed_hash;
    for (int i = 0; i < m_er_neta; ++i){
      std::vector<IdentifierHash> v_adj;
      int rc = m_calocell_id->get_neighbours(cur_hash,
                         dir,
                         v_adj);
      if (rc != 0) {break;} // out of bounds
 
      if (v_adj.size() != 1) {
    // this happens when the the cells no longer form an regular
    // array. Emprically: at around eta = +- 1.4, the phi spacing
    // becomes small.
    // The eta of these cells are almost, but not exactly the same.
    // The get_neighbours returns multiple cell identifiers in this case.
    //
    // When this happens, issue a warning, and break of search in this
    // eta direction for cells to start the phi crawl.
    for (const auto& ha : v_adj) {
      const auto *dde = caloMgr->get_element(m_calocell_id->cell_id(ha));
      ATH_MSG_DEBUG("cell eta " << dde-> eta() << " phi " << dde->phi() <<
            " z " << dde->z());
    }
    ATH_MSG_WARNING("unexpected number of identifier hashes: "
            << v_adj.size());
    
    break;
      }
 
      cur_hash = v_adj[0];
      phi_starts.push_back(cur_hash);
    }
  }
 
  ATH_MSG_DEBUG("crawl - number of 1-dim path start points "
        << phi_starts.size());
  for (const auto& h: phi_starts) {
    auto eta = caloMgr->get_element(m_calocell_id->cell_id(h))->eta();
    ATH_MSG_DEBUG ("crawl - starting etas " << h << " eta " << eta);
  }
 
  std::vector<std::vector<IdentifierHash>> paths_hash;
  dirs =  {LArNeighbours::prevInPhi,
       LArNeighbours::nextInPhi};
  
  for (const auto& dir : dirs){
 
    auto calc_phihashes = [&dir,
               &cc_id=m_calocell_id,
               nphi=m_er_nphi](auto hash){ //hash: pass by value
      std::vector<IdentifierHash> path;
      std::vector<IdentifierHash> adjacent;
      path.push_back(hash);
      for (int i = 0; i<nphi; ++i) {
    
    int rc = cc_id->get_neighbours(hash, dir, adjacent);
    if (rc != 0) {break;} // out of bounds
    auto size = adjacent.size();
    if (size != 1) {
      throw std::runtime_error("unexpected number of identifier hashes: " + std::to_string(size));
    }
 
    hash = adjacent[0];
    path.push_back(hash);
    
      }
      return path;
    };
    
    std::transform(phi_starts.cbegin(),
           phi_starts.cend(),
           std::back_inserter(paths_hash),
           std::move(calc_phihashes));
  };
 
   ATH_MSG_DEBUG("crawl - number of 1-dim paths (hashes) "
        << paths_hash.size());
 
   // step 2 - obtain the paths in terms of CaloCells
   // std::vector<std::vector<const CaloCell*>> paths_cell;
   CellVectors  paths_cell;
   paths_cell.reserve(paths_hash.size());
 
   
  for (const auto& p_h : paths_hash) {
    std::vector<const CaloCell*> path;
    path.reserve(p_h.size());
    std::transform(p_h.cbegin(), p_h.cend(),
           std::back_inserter(path),
           [&laremCells](const auto& hash){
             return laremCells.at(hash);});
    paths_cell.push_back(std::move(path));
  }
 
 
  
  // now have paths of cells.
  // step 3: create strings of energy up-down patterns
 
 
  auto signif = [&totalNoiseCDO,
         &signif_min = m_crawl_signifcut](const auto& cell){
    auto e = cell->e();
    if (e <= 0){return 0.;}
    auto signif = cell->e()/totalNoiseCDO->getNoise(cell->ID(), cell->gain());
    return signif < signif_min ? 0:signif;
  };
 
 
  // std::vector<std::vector<float>> paths_signif;
  PathsSignif paths_signif;
  paths_signif.reserve(paths_cell.size());
 
  // should probably set signif to 0 if below a threhold (eg 2.)
  for (const auto& p_c : paths_cell) {
    std::vector<float> path_signif;
    std::transform(p_c.cbegin(),
           p_c.cend(),
           std::back_inserter(path_signif),
           signif);
    paths_signif.push_back(std::move(path_signif));
  }
 
  for (const auto& p_s: paths_signif) {
    std::stringstream ss;
    ss <<"crawl - path signf ";
    for (const auto& s : p_s) {
      ss << std::setw(7) << std::setprecision(3)<< s << " ";
    }
    ATH_MSG_DEBUG (ss.str());
  }
 
  
  std::vector<std::string> paths_pat;
  paths_signif.reserve(paths_signif.size());
 
  for (const auto& p_s: paths_signif) {
    std::string pat{"0"}; // padding to keep the string size as path size
    if (!p_s.empty()) {
      for (std::size_t i = 1; i != p_s.size(); ++i) {
    if (p_s[i] > p_s[i-1]) {
      pat += '1';
    } else {
      pat += '0';
    }
      }
 
      paths_pat.push_back(std::move(pat));
    }
  }
  
 
  ATH_MSG_DEBUG("crawl - no of  patterns " << paths_pat.size());
 
  for(const auto& p: paths_pat) {ATH_MSG_DEBUG("crawl - pattern " << p);}
 
  std::vector<std::regex> peaks_re{
    std::regex("01*(1)0"), std::regex("01*(1)$")};
  
  std::vector<const CaloCell*> peak_cells;
  std::size_t idx{0};
 
  for (const auto& s : paths_pat) {
 
    for (const auto& regex : peaks_re) {
      std::smatch m;
      if(std::regex_search(s, m, regex)){
    auto pos = m.position(1);
    ATH_MSG_DEBUG("crawl - match at idx " << idx << " pos " << pos);
    peak_cells.push_back(paths_cell[idx][pos]);
    break;
      }
    }
    ++idx;
  }
 
 
  auto n_peaks = peak_cells.size();
  ATH_MSG_DEBUG("crawl - number of local maxima " << n_peaks);
  ATH_MSG_DEBUG("crawl - seed eta " << seed->eta()
        << " phi " << seed->phi()
        << " signif " <<signif(seed));
  for (const auto& pc : peak_cells){
    ATH_MSG_DEBUG("  crawl - peak eta " << pc->eta()
          << " phi " << pc->phi()
          << " signif " <<signif(pc));
    
    ATH_MSG_DEBUG("  crawl - distance from seed  deta "
          << seed->eta() - pc->eta() << " dphi "
          << seed->phi() - pc->phi());
  }
 
  if (m_dump) {CHECK(dump_crawl(iseed,
                seed,
                signif(seed),
                paths_cell,
                paths_signif,
                paths_pat));}
  
  ATH_MSG_DEBUG("crawl: finished");
  
  return StatusCode::SUCCESS;
}

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

dump_crawl()

StatusCode GepPi0Alg::dump_crawl ( std::size_t iseed, const CaloCell * seed, float seed_signif, const CellVectors & paths_cell, const PathsSignif & signifs, const std::vector< std::string > & paths_pat ) const

private

Definition at line 668 of file GepPi0Alg.cxx.

                                                           {
  std::stringstream ss;
  ss << "crawl. cell source " << i << '\n';
  ss << "seed " << seed->eta() << " " << seed->phi() << " "
     << seed->e() << " " << seed_signif << '\n';
  ss << "path etas:\n";
  for (const auto& path: paths_cell) {
    for (const auto& c : path){
      ss << c->eta() << " ";
    }
    ss << '\n';
  }
  ss << "path phis:\n";
  for (const auto& path: paths_cell) {
    for (const auto& c : path){
      ss << c->phi() << " ";
    }
    ss << '\n';
  }
  
  ss << "path es:\n";
  for (const auto& path: paths_cell) {
    for (const auto& c : path){
      ss << c->e() << " ";
    }
    ss << '\n';
  }
  
  ss << "path signifs:\n";
  for (const auto& path: signifs) {
    for (const auto& sig : path){
      ss << sig << " ";
    }
    ss << '\n';
  }
 
  ss << "path patterns:\n";
  for (const auto& pat: paths_pat) {
    ss << pat << '\n';
  }
 
 
  std::stringstream fn;
  fn << "crawl_" << m_id << "_" << i << ".txt";
  std::ofstream out(fn.str());
  out << ss.str();
 
  return StatusCode::SUCCESS;
}

dump_twinpeaks()

StatusCode GepPi0Alg::dump_twinpeaks ( std::size_t iseed, const CaloCell * seed, double seed_signif, const std::vector< const CaloCell * > & neighborhood, const std::vector< const CaloCell * > & peaks, const std::vector< double > & peak_signifs ) const

private

Definition at line 725 of file GepPi0Alg.cxx.

                                                           {
  std::stringstream ss;
  ss << "twinpeaks. cell source " << i << '\n';
  ss << "seed " << seed->eta() << " " << seed->phi() << " "
     << seed->e() << " " << seed_signif << '\n';
  ss << "neighborhood etas:\n";
  for (const auto& c: neighborhood) {
    ss << c->eta() << " ";
  }
  ss << '\n';
 
  ss << "neighborhood phis:\n";
  for (const auto& c : neighborhood){
    ss << c->phi() << " ";
  }
  ss << '\n';
  
  ss << "neighborhood es:\n";
  for (const auto& c : neighborhood){
    ss << c->e() << " ";
  }
  ss << '\n';
  
  ss << "peak etas:\n";
  for (const auto& c : peaks){
    ss << c->eta() << " ";
  }
  ss << '\n';
 
  ss << "peak phis:\n";
  for (const auto& c : peaks){
    ss << c->phi() << " ";
  }
  ss << '\n';
 
  ss << "peak es:\n";
  for (const auto& c : peaks){
    ss << c->e() << " ";
  }
  ss << '\n';
 
 
  ss << "peak signifs:\n";
  for (const auto& s : peak_signifs){
    ss << s << " ";
  }
  ss << '\n';
 
  std::stringstream fn;
  fn << "twinpeak_" << m_id << "_" << i << ".txt";
  std::ofstream out(fn.str());
  out << ss.str();
 
  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 GepPi0Alg::execute ( const EventContext & ctx ) const

overridevirtual

Definition at line 40 of file GepPi0Alg.cxx.

                                                           {
  // Read in a CaloCell container. Ask producers to create
  // vectors of CaloCells to be examined.
 
  ATH_MSG_DEBUG ("Executing " << name());
 
  // obtain all LAREM CaloCells, then those in EMB1
  auto h_allCaloCells = SG::makeHandle(m_allCaloCellsKey, ctx);
  CHECK(h_allCaloCells.isValid());
  
  const auto & allCaloCells = *h_allCaloCells;
 
 
 
  // obatain LAREM CaloCells
  if(! allCaloCells.hasCalo(m_calocell_id->LAREM)){
    ATH_MSG_ERROR("CaloCellCollection does not contain LAREM cells");
    return StatusCode::FAILURE;
  }
 
  auto cellbegin = allCaloCells.beginConstCalo(CaloCell_ID::LAREM);
  auto cellend = allCaloCells.endConstCalo(CaloCell_ID::LAREM);
  ATH_MSG_DEBUG ("Size from SubCalo Iters " << std::distance(cellbegin,
                                 cellend));
 
  std::vector<const CaloCell*>
    laremCells(allCaloCells.beginConstCalo(CaloCell_ID::LAREM),
           allCaloCells.endConstCalo(CaloCell_ID::LAREM));
 
  // Simple checks on the LAREM cell hashes. Will use laremCells vector to
  // obtain CaloCells goven their hashes. 
  auto front_idhash = m_calocell_id->calo_cell_hash(laremCells.front()->ID());
  auto back_idhash = m_calocell_id->calo_cell_hash(laremCells.back()->ID());
 
  // LAREM cell hashes go from 0-173311. check that this is the case
  // and thar the cells are in hash oeder to allow for indexing.
 
  constexpr unsigned int LAREMHASH_LO{0};
 
  if (front_idhash != LAREMHASH_LO) {
    ATH_MSG_ERROR("front LARM identifier hash != 0, is " << front_idhash);
    return StatusCode::FAILURE;
  }
 
  constexpr unsigned int LAREMHASH_HI{173311};
 
  if (back_idhash != LAREMHASH_HI) {
    ATH_MSG_ERROR("back LARM identifier hash != 173311, is " << back_idhash);
    return StatusCode::FAILURE;
  }
 
  if(!std::is_sorted(laremCells.begin(),
             laremCells.end(),
             [&cc_id=m_calocell_id](const auto& l, const auto& r) {
               return
             cc_id->calo_cell_hash(l->ID()) <
             cc_id->calo_cell_hash(r->ID());
             })){
                                   
    ATH_MSG_ERROR("LARM CaloCells are not sorted by identifier hash");
    return StatusCode::FAILURE;
  }
             
  
  ATH_MSG_DEBUG("LAREM front, back, diff  idhash v size " << 
        front_idhash << " " << 
        back_idhash << " " << 
        back_idhash-front_idhash << " " <<
        laremCells.size()
        );
 
 
  // Now select the cells in the EMB1 sampling layer from laremCells.
  std::vector<const CaloCell*> allEMB1Cells;
 
  auto EMB1Selector = [&calocell_id=m_calocell_id](const auto& cell) {
    auto ha = calocell_id->calo_cell_hash(cell->ID());
    return calocell_id->calo_sample(ha) == CaloCell_Base_ID::EMB1;
  };
 
  std::copy_if(allCaloCells.beginConstCalo(CaloCell_ID::LAREM),
           allCaloCells.endConstCalo(CaloCell_ID::LAREM),
           std::back_inserter(allEMB1Cells),
           EMB1Selector);
 
  
  SG::ReadCondHandle<CaloNoise> totalNoiseHdl{m_totalNoiseKey, ctx};
  if (!totalNoiseHdl.isValid()) {return StatusCode::FAILURE;}
  const CaloNoise* totalNoiseCDO = *totalNoiseHdl;
 
 
  // ask tool for emb1CellVecs. The length of emb1CellVecs varies according
  // to the concrete tool. Examples: If the tool obtains all cells, then the
  // length of calCellsVecs is 1. If the tool obtains CellCollections
  // from clusters, then the number of vectors will be equal to the
  // number of clusters.
 
  std::vector<std::vector<const CaloCell*>> emb1CellVecs;
 
  CHECK(m_cellsProducer->cells(emb1CellVecs, ctx));
  
  // check cells in the EMB1 layer
 
  for (const auto& cvec : emb1CellVecs) {
    if (std::find_if_not(cvec.cbegin(),
             cvec.cend(),
             EMB1Selector) != cvec.cend()){
      ATH_MSG_ERROR("cell is not in  EMB1  ");
      return StatusCode::FAILURE;
    }
  }
 
  // one seed cell per emb1Cell collection
  std::vector<const CaloCell*> seeds(emb1CellVecs.size());
 
  auto signif = [&totalNoiseCDO,
         &cut=m_seed_signifcut](const auto& c) -> float {
    float noise = totalNoiseCDO->getNoise(c->ID(),
                      c->gain());
    auto sfc = c->e()/noise;
    return sfc < cut ? 0.:sfc; 
  };
    
  auto findSeed = [&signif](const auto& cellVec) -> const CaloCell* {
    return *std::max_element(cellVec.cbegin(),
                 cellVec.cend(),
                 [&signif](const auto& c1,
                       const auto& c2) {
                   return signif(c1) < signif(c2);});};
 
 
  for (const auto& v: emb1CellVecs) {
    ATH_MSG_DEBUG("Looking for seed in " << v.size() << " cells");
  }
 
  std::transform(emb1CellVecs.cbegin(),
         emb1CellVecs.cend(),
         seeds.begin(),
         findSeed);
 
  std::size_t iseed{0};
  for(const auto& seed : seeds) {
    
    ATH_MSG_DEBUG("seed: eta "<< seed->eta()
          << " phi " << seed->phi()
          << " significance "<< signif(seed)
          );
 
    SG::ReadCondHandle<CaloDetDescrManager>
      caloMgrHandle{m_caloMgrKey, ctx};
    
    ATH_CHECK(caloMgrHandle.isValid());
    const CaloDetDescrManager* caloMgr = *caloMgrHandle;
 
    // run the requested algorithms
    for (const auto& strategy : m_strategies) {
      if (strategy == "TWINPEAKS") {
    try {
      CHECK(twinpeaks_strategy(seed,
                   laremCells,
                   allEMB1Cells,
                   iseed,
                   totalNoiseCDO,
                   caloMgr));
    } catch (std::runtime_error& e) {
      ATH_MSG_ERROR("Error running twin peaks - " << e.what());
      return StatusCode::FAILURE;
    }
      } else if (strategy == "SORT") {
    CHECK(sort_strategy(seed,
                laremCells,
                allEMB1Cells,
                iseed,
                totalNoiseCDO,
                caloMgr));
      } else if (strategy == "CRAWL") {
    try {
      CHECK(crawl_strategy(seed,
                   laremCells,
                   allEMB1Cells,
                   iseed,
                   totalNoiseCDO,
                   caloMgr));
      
    } catch (std::runtime_error& e) {
      ATH_MSG_ERROR("Error running crawl: " << e.what());
      return StatusCode::FAILURE;
    }
      } else {
    ATH_MSG_ERROR ("Unknown pi0 strategy " << strategy);
    return StatusCode::FAILURE;
      }
    }
    ++iseed;
  }
  ++m_id;
  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 GepPi0Alg::initialize ( )

overridevirtual

Definition at line 25 of file GepPi0Alg.cxx.

                                 {
  ATH_MSG_INFO ("Initializing " << name());
 
  ATH_CHECK(m_totalNoiseKey.initialize());
  ATH_CHECK(m_caloMgrKey.initialize());
  CHECK(m_allCaloCellsKey.initialize());
  
  CHECK(m_cellsProducer.retrieve());
  
  CHECK(detStore()->retrieve (m_calocell_id, "CaloCell_ID"));
 
  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);
  }

neighborhood()

StatusCode GepPi0Alg::neighborhood ( const CaloCell * seed, const std::vector< const CaloCell * > & laremCells, std::vector< const CaloCell * > & neighs, const CaloDetDescrManager * caloMgr ) const

private

Definition at line 789 of file GepPi0Alg.cxx.

                                                      {
 
  // find the cells in the neighborhood od a seed cell. The neighborhood
  // cells are those within a Euclidean distance in eta-phi of the seed.
  // The algorithm works by iteratively finding immediately adjacent cells
  // to cells already established as being in the neighborhood. If these
  // cells are within range, they are added to the neighborhood
 
  auto seedID = seed->ID();
 
  auto seed_eta = seed->eta();
  auto seed_phi = seed->phi();
  
  std::queue<Identifier> to_process;
  to_process.push(seedID);
 
  auto accept = [&seed_eta, &seed_phi,
         &calocell_id=m_calocell_id,
         &neigh_half_eta = m_neigh_half_eta,
         &neigh_half_phi = m_neigh_half_phi,
         &caloMgr](const auto& c_id){
    auto dde = caloMgr->get_element(c_id);
    auto c_eta = dde->eta();
    auto c_phi = dde->phi();
 
    auto hash = calocell_id->calo_cell_hash(c_id);
    if (calocell_id->calo_sample(hash) != CaloCell_Base_ID::EMB1) {return false;}
 
    auto deta = seed_eta-c_eta;
    if( std::abs(deta) >  neigh_half_eta) {return false;}
 
    auto dphi = seed_phi-c_phi;
    return std::abs(dphi) < neigh_half_phi;
 
  };
 
  std::vector<Identifier> mask;
  auto add_neighbors_to_queue = [&to_process,
            &cc_id=m_calocell_id,
            &mask] (const auto& desc) {
    auto hash = cc_id->calo_cell_hash(desc);
    std::vector<IdentifierHash> neigh_hashes;
    int rc = cc_id->get_neighbours(hash,
                   LArNeighbours::all2D,
                   neigh_hashes);
    if (rc != 0) {
      return StatusCode::FAILURE;
    }
    
    for (const auto& nh :neigh_hashes) {
      auto cid = cc_id->cell_id(nh);
      if (std::find(mask.cbegin(), mask.cend(), cid) == mask.cend()) {
    mask.push_back(cid);
    to_process.push(cc_id->cell_id(nh));
      }
    }
    return StatusCode::SUCCESS;
 
  };
 
  CHECK(add_neighbors_to_queue(seedID));
  std::vector<Identifier> neigh_idents;
 
  // iterative procedure:
  while (!to_process.empty()){
    const auto& ident = to_process.front();
    if (accept(ident)){
      ATH_MSG_DEBUG ("  accepting neigh " << ident);
      const auto *dde = caloMgr->get_element(ident);
      auto c_eta = dde->eta();
      auto c_phi = dde->phi();
      ATH_MSG_DEBUG("   neigh eta: " << c_eta
            << " phi " << c_phi);
      neigh_idents.push_back(ident);
      add_neighbors_to_queue(ident);
    }
    to_process.pop();
  }
 
  std::sort(neigh_idents.begin(), neigh_idents.end());
  auto end = std::unique(neigh_idents.begin(), neigh_idents.end());
  auto it{neigh_idents.begin()};
  
  for(;it!= end; ++it){
    neigh_cells.push_back(laremCells.at(m_calocell_id->calo_cell_hash(*it)));
  }
  return StatusCode::SUCCESS;
}

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

sort_strategy()

StatusCode GepPi0Alg::sort_strategy ( const CaloCell * seed, const std::vector< const CaloCell * > & laremCells, const std::vector< const CaloCell * > & emb1Cells, std::size_t iseed, const CaloNoise * , const CaloDetDescrManager * caloMgr ) const

private

Definition at line 402 of file GepPi0Alg.cxx.

                                                       {
  
  if (!seed) {return StatusCode::SUCCESS;}
  if (allEMB1Cells.empty()) {return StatusCode::SUCCESS;}
 
  std::vector<const CaloCell*> neigh_cells;
  CHECK(neighborhood(seed, laremCells, neigh_cells, caloMgr));
  
  ATH_MSG_DEBUG("sort_strategy  seed idx " << iseed <<
        "nbhd size :" << neigh_cells.size());
 
  
  return StatusCode::SUCCESS;
}

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.

twinpeaks_strategy()

StatusCode GepPi0Alg::twinpeaks_strategy ( const CaloCell * seed, const std::vector< const CaloCell * > & laremCells, const std::vector< const CaloCell * > & emb1Cells, std::size_t iseed, const CaloNoise * totalNoiseCDO, const CaloDetDescrManager * caloMgr ) const

private

Definition at line 241 of file GepPi0Alg.cxx.

                                                            {
 
  // look for a local maximum in a neighborhood
  // the siginicance (e/noise) of a maximum must be over a threshold
  // (for now, set to 2.0)
  ATH_MSG_DEBUG("twin peaks - start");
  
  
  if (!seed) {return StatusCode::SUCCESS;}
  if (allEMB1Cells.empty()) {return StatusCode::SUCCESS;}
  
  
  // find the neighborhood as a collection of Identifiers
  std::vector<const CaloCell*> neigh_cells;
  CHECK(neighborhood(seed, laremCells, neigh_cells, caloMgr));
 
  
    
  ATH_MSG_DEBUG("twin peaks - neighborhood cells size " << neigh_cells.size()
        << " input cell collection size " << allEMB1Cells.size());
  
  
  auto signif = [&totalNoiseCDO](const auto& cell){
    return cell->e()/totalNoiseCDO->getNoise(cell->ID(), cell->gain());
  };
  
  // apply a cut on the signiificance
  auto new_end = std::partition(neigh_cells.begin(),
                neigh_cells.end(),
                [&signif,
                 &signif_cut=m_tp_signifcut](const auto& ncell){
                  return signif(ncell) > signif_cut;
                });
  
  neigh_cells.resize(new_end - neigh_cells.begin());
  
  ATH_MSG_DEBUG("twin peaks -  neighborhood size after signif cut: "
        << neigh_cells.size());
  
  
  // ---------
  // create a lambda to look for significant cells in the neighborhood
  // which are adjacent to a choosen cell (center_cell).
  auto is_local_max = [neigh_cells,  // copy
               &cc_id=m_calocell_id,
               &signif](const auto& center_cell) mutable {
    
    // obtain the hashes of the cells adjacent to center_cell.
    // some of these will be in the neighborhood. For cells
    // at the edge of the neighborhood, there may be
    // adjacent cells not in the neighborhood. For now,
    // such extra-neighborhood cells will be ignored.
    
    std::vector<IdentifierHash> adj_hashes;
    auto rc = cc_id->get_neighbours(cc_id->calo_cell_hash(center_cell->ID()), 
                    LArNeighbours::all2D,
                    adj_hashes);
    if (rc != 0) {
      throw std::runtime_error("twin peaks - error obtaining cell neighbors");
    }
    
    // obtain the identifiers of cells immediately adjacent to center_cell
    std::vector<Identifier> adj_idents;;
    std::transform(adj_hashes.cbegin(),
           adj_hashes.cend(),
           std::back_inserter(adj_idents),
           [&cc_id](const auto& hash){
             return cc_id->cell_id(hash);
           });
 
    // obtain neighborhood cells immediately adjacent to center_cell
 
    auto id_cell_match = [&adj_idents](const CaloCell* n_cell)->bool {
      return std::find(adj_idents.begin(),
               adj_idents.end(),
               n_cell->ID()) != adj_idents.end();};
 
    auto adj_neigh_cell_end = std::partition(neigh_cells.begin(),
                         neigh_cells.end(),
                         id_cell_match);
 
    for (auto iter = neigh_cells.begin();
     iter != adj_neigh_cell_end;
     ++iter) {
      if (signif(*iter) > signif(center_cell)) {return false;}
    }
 
    return true;
  };
  
 
  auto peaks_end = std::partition(neigh_cells.begin(),
                  neigh_cells.end(),
                  std::move(is_local_max));
 
 
  auto n_peaks = peaks_end - neigh_cells.begin();
  ATH_MSG_DEBUG("twin peaks - number of local maxima " << n_peaks);
 
  auto n_peaks_noseed = n_peaks;
  if (std::find(neigh_cells.begin(), peaks_end, seed) != peaks_end){--n_peaks_noseed;} 
  ATH_MSG_DEBUG("twin peaks - number of local maxima ommiting seed " << n_peaks_noseed);
 
  ATH_MSG_DEBUG("twin peaks - seed eta " << seed->eta()
        << " phi " << seed->phi()
        << " signif " <<signif(seed));
  for (auto iter = neigh_cells.begin(); iter != peaks_end; ++iter) {
    ATH_MSG_DEBUG("  twin peaks - peak eta " << (*iter)->eta()
          << " phi " << (*iter)->phi()
          << " signif " <<signif(*iter));
    
    ATH_MSG_DEBUG("  twin peaks - distance from seed  deta "
          << seed->eta() - (*iter)->eta() << " dphi "
          << seed->phi() - (*iter)->phi());
  }
 
  ATH_MSG_DEBUG("twin peaks: neighborhood size after signif cut "
        << neigh_cells.size()); 
 
 
  for (const auto& c: neigh_cells) {
    if (!c) {throw std::runtime_error("Neighbor pointer is nullptr");}
    
    
    ATH_MSG_DEBUG("twin peaks - neigh cell eta " << c->eta()
          << " phi " << c->phi()
          << " signif " << signif(c));
  }
 
 
  
  if (m_dump) {
 
    std::vector<const CaloCell*> peaks_cells(neigh_cells.begin(), peaks_end);
 
    std::vector<double> peaks_signif;
    std::transform(neigh_cells.begin(),
           peaks_end,
           std::back_inserter(peaks_signif),
           signif);
    
    CHECK(dump_twinpeaks(iseed,
             seed,
             signif(seed),
             neigh_cells,
             peaks_cells,
             peaks_signif));
  }
  
  ATH_MSG_DEBUG("twin peaks - finished");
  
  return StatusCode::SUCCESS;
}

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_allCaloCellsKey

SG::ReadHandleKey<CaloCellContainer> GepPi0Alg::m_allCaloCellsKey

private

Initial value:

{
    this, "caloCells", "AllCalo", "key to read in a CaloCell constainer"}

Definition at line 60 of file GepPi0Alg.h.

                                                       {
    this, "caloCells", "AllCalo", "key to read in a CaloCell constainer"};

m_calocell_id

const CaloCell_ID* GepPi0Alg::m_calocell_id {nullptr}

private

Definition at line 77 of file GepPi0Alg.h.

{nullptr};

m_caloMgrKey

SG::ReadCondHandleKey<CaloDetDescrManager> GepPi0Alg::m_caloMgrKey

private

Initial value:

{this,
           "caloDetDescrManager",
           "CaloDetDescrManager",
           "SG Key of the CaloDetDescrManager in  the Consition Store"}

Definition at line 81 of file GepPi0Alg.h.

              {this,
           "caloDetDescrManager",
           "CaloDetDescrManager",
           "SG Key of the CaloDetDescrManager in  the Consition Store"};

m_cellsProducer

ToolHandle<ICaloCellsProducer> GepPi0Alg::m_cellsProducer

private

Initial value:

{this,
      "caloCellsProducer",
      "EMB1CellsFromCaloCells",
      "AlgTool to provide vectors of CaloCells ot GepPi0Alg"}

Definition at line 64 of file GepPi0Alg.h.

                                                {this,
      "caloCellsProducer",
      "EMB1CellsFromCaloCells",
      "AlgTool to provide vectors of CaloCells ot GepPi0Alg"};

m_crawl_signifcut

Gaudi::Property<float> GepPi0Alg::m_crawl_signifcut

private

Initial value:

{
    this, "crawl_signif_cut", {2.0}, "crawl min peak e/noise"}

Definition at line 116 of file GepPi0Alg.h.

                                        {
    this, "crawl_signif_cut", {2.0}, "crawl min peak e/noise"};

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_dump

Gaudi::Property<bool> GepPi0Alg::m_dump

private

Initial value:

{
    this, "dump", false, "flag to trigger writing out debug information"}

Definition at line 126 of file GepPi0Alg.h.

                            {
    this, "dump", false, "flag to trigger writing out debug information"};

m_er_neta

Gaudi::Property<int> GepPi0Alg::m_er_neta

private

Initial value:

{
    this, "er_neta", {1}, "crawl number of steps eta"}

Definition at line 119 of file GepPi0Alg.h.

                              {
    this, "er_neta", {1}, "crawl number of steps eta"};

m_er_nphi

Gaudi::Property<int> GepPi0Alg::m_er_nphi

private

Initial value:

{
    this, "er_nphi", {10}, "crawl number of steps phi"}

Definition at line 122 of file GepPi0Alg.h.

                              {
    this, "er_nphi", {10}, "crawl number of steps phi"};

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_id

std::atomic<size_t> GepPi0Alg::m_id {0l}

mutableprivate

Definition at line 57 of file GepPi0Alg.h.

{0l};

m_neigh_half_eta

Gaudi::Property<float> GepPi0Alg::m_neigh_half_eta

private

Initial value:

{
    "neigh_half_eta",
    {0.004},
    "+- neighborhood extent in eta"}

Definition at line 88 of file GepPi0Alg.h.

                                       {
    "neigh_half_eta",
    {0.004},
    "+- neighborhood extent in eta"};

m_neigh_half_phi

Gaudi::Property<float> GepPi0Alg::m_neigh_half_phi

private

Initial value:

{
    this,
    "neigh_half_phi",
    {0.6},
    "+- neighborhood extent in phi"}

Definition at line 94 of file GepPi0Alg.h.

                                       {
    this,
    "neigh_half_phi",
    {0.6},
    "+- neighborhood extent in phi"};

m_seed_signifcut

Gaudi::Property<float> GepPi0Alg::m_seed_signifcut

private

Initial value:

{
    this, "seed_signif_cut", {2.0}, "twin peak min peak e/noise"}

Definition at line 108 of file GepPi0Alg.h.

                                       {
    this, "seed_signif_cut", {2.0}, "twin peak min peak e/noise"};

m_strategies

Gaudi::Property<std::vector<std::string> > GepPi0Alg::m_strategies

private

Initial value:

{
    this,
    "pi0strategies",
    {"TWINPEAKS", "CRAWL"},
    "list of pi0 detection strategies to be run"}

Definition at line 101 of file GepPi0Alg.h.

                                                  {
    this,
    "pi0strategies",
    {"TWINPEAKS", "CRAWL"},
    "list of pi0 detection strategies to be run"};

m_totalNoiseKey

SG::ReadCondHandleKey<CaloNoise> GepPi0Alg::m_totalNoiseKey

private

Initial value:

{this,
          "totalNoiseKey",
          "totalNoise",
          "SG Key of CaloNoise data object"}

Definition at line 71 of file GepPi0Alg.h.

                 {this,
          "totalNoiseKey",
          "totalNoise",
          "SG Key of CaloNoise data object"};

m_tp_signifcut

Gaudi::Property<float> GepPi0Alg::m_tp_signifcut

private

Initial value:

{
    this, "tp_signif_cut", {2.0}, "twin peak min peak e/noise"}

Definition at line 113 of file GepPi0Alg.h.

                                     {
    this, "tp_signif_cut", {2.0}, "twin peak min peak e/noise"};

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:

• GepPi0Alg.h
• GepPi0Alg.cxx