InDet::SiSPSeededTrackFinderRoI Class Reference

#include <SiSPSeededTrackFinderRoI.h>

Inheritance diagram for InDet::SiSPSeededTrackFinderRoI:

Collaboration diagram for InDet::SiSPSeededTrackFinderRoI:

Classes
class	Counter_t
	For counters. More...

Public Member Functions
	SiSPSeededTrackFinderRoI (const std::string &name, ISvcLocator *pSvcLocator)
virtual	~SiSPSeededTrackFinderRoI ()=default
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 Types
enum	ECounter { kNSeeds , kNTracks , kNCounter }
	enums for Counter_t More...

Protected Member Functions
void	filterSharedTracks (std::multimap< double, Trk::Track * > &) const
	cleans up the collection of quality filtered tracks.
void	magneticFieldInit ()
bool	passEtaDepCuts (const Trk::Track *track, int nClusters, int nFreeClusters, int nPixels) const
	apply eta-dependent selections
MsgStream &	dump (MSG::Level lvl, const SiSPSeededTrackFinderRoI::Counter_t *) const
MsgStream &	dumptools (MsgStream &out) const
MsgStream &	dumpevent (MsgStream &out, const SiSPSeededTrackFinderRoI::Counter_t &counter) const
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.

Protected Attributes
BooleanProperty	m_useRoIWidth {this, "useRoIWidth", true, "Use width of RoI along z-axis"}
IntegerProperty	m_maxNumberSeeds {this, "maxNumberSeeds", 3000000, "Max. number used seeds"}
IntegerProperty	m_nfreeCut {this, "FreeClustersCut", 1, "Min number free clusters"}
BooleanProperty	m_doRandomSpot {this, "doRandomSpot", false, "Low-pT tracking setting the RoI in a random position"}
StringProperty	m_fieldmode {this, "MagneticFieldMode", "MapSolenoid"}
SG::WriteHandleKey< TrackCollection >	m_outputTracksKey {this, "TracksLocation", "SiSPSeededTracksRoI", "Output track collection"}
SG::WriteHandleKey< xAOD::VertexContainer >	m_vxOutputKey {this, "VxOutputName", "LowPtRoIVertices", "Output Vertex collection with per-event RoI information"}
SG::ReadHandleKey< Trk::PRDtoTrackMap >	m_prdToTrackMap {this,"PRDtoTrackMap",""}
SG::ReadCondHandleKey< InDet::BeamSpotData >	m_beamSpotKey {this, "BeamSpotKey", "BeamSpotData", "SG key for beam spot"}
SG::ReadHandleKey< xAOD::EventInfo >	m_evtKey {this, "EventInfoKey", "EventInfo"}
ToolHandle< ISiSpacePointsSeedMaker >	m_seedsmaker {this, "SeedsTool", "InDet::SiSpacePointsSeedMaker_ATLxk/InDetSpSeedsMaker", "Space poins seed maker"}
ToolHandle< ISiTrackMaker >	m_trackmaker {this, "TrackTool", "InDet::SiTrackMaker_xk/InDetSiTrackMaker", "Track maker"}
ToolHandle< Trk::IExtendedTrackSummaryTool >	m_trackSummaryTool {this, "TrackSummaryTool", "InDetTrackSummaryToolNoHoleSearch"}
ToolHandle< IZWindowRoISeedTool >	m_ZWindowRoISeedTool {this, "ZWindowRoISeedTool", "InDet::ZWindowRoISeedTool", "Tool to determin per-event RoI"}
ToolHandle< IZWindowRoISeedTool >	m_RandomRoISeedTool {this, "RandomRoISeedTool", "InDet::RandomRoISeedTool", "Tool to run using additional RoIs randomly chosen away from the main one if doRandomSpot is set"}
ServiceHandle< IInDetEtaDependentCutsSvc >	m_etaDependentCutsSvc {this, "EtaDependentCutsSvc", "", "if enable, further require eta-dependent selections on track candidates"}
Trk::MagneticFieldProperties	m_fieldprop
Counter_t m_counterTotal	ATLAS_THREAD_SAFE {}
std::atomic_int	m_neventsTotal {0}
	Number events.
std::atomic_int	m_problemsTotal {0}
	Number events with number seeds > maxNumber.

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
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 41 of file SiSPSeededTrackFinderRoI.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

ECounter

enum InDet::SiSPSeededTrackFinderRoI::ECounter

protected

enums for Counter_t

Enumerator
kNSeeds
kNTracks
kNCounter

Definition at line 139 of file SiSPSeededTrackFinderRoI.h.

{kNSeeds, kNTracks, kNCounter};

Constructor & Destructor Documentation

SiSPSeededTrackFinderRoI()

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

Definition at line 67 of file SiSPSeededTrackFinderRoI.cxx.

                                                 : AthReentrantAlgorithm(name, pSvcLocator)
{
}

~SiSPSeededTrackFinderRoI()

virtual InDet::SiSPSeededTrackFinderRoI::~SiSPSeededTrackFinderRoI ( )

virtualdefault

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

dump()

MsgStream & InDet::SiSPSeededTrackFinderRoI::dump ( MSG::Level lvl, const SiSPSeededTrackFinderRoI::Counter_t * counter ) const

protected

Definition at line 328 of file SiSPSeededTrackFinderRoI.cxx.

{
  msg(assign_level) <<std::endl;
  MsgStream& out_msg=msg();
  if (counter) dumpevent(out_msg ,*counter);
  else dumptools(out_msg);
  out_msg << endmsg;
  return out_msg;
}

dumpevent()

MsgStream & InDet::SiSPSeededTrackFinderRoI::dumpevent ( MsgStream & out, const SiSPSeededTrackFinderRoI::Counter_t & counter ) const

protected

Definition at line 371 of file SiSPSeededTrackFinderRoI.cxx.

{
  int ns = counter[kNSeeds];
  int nt = counter[kNTracks];
 
  out<<"|-------------------------------------------------------------------|" <<std::endl;
  out<<"|  Investigated "
     <<std::setw(9)<<ns<<" space points seeds and found ";
  out<<std::setw(9)<<nt<<" tracks using RoI-z strategy           |"<<std::endl;
 
  out<<"|-------------------------------------------------------------------|" <<std::endl;
  if(m_problemsTotal > 0) {
    out<<"|  Events       "
       <<std::setw(7)<<m_neventsTotal   <<" |"
       <<std::endl;
    out<<"|  Problems     "
       <<std::setw(7)<<m_problemsTotal  <<" |"
       <<std::endl;
    out<<"|-------------------------------------------------------------------|" <<std::endl;
  }
  return out;
}

dumptools()

MsgStream & InDet::SiSPSeededTrackFinderRoI::dumptools ( MsgStream & out ) const

protected

Definition at line 342 of file SiSPSeededTrackFinderRoI.cxx.

{
  int n;
  n     = 65-m_seedsmaker.type().size();
  std::string s2; for(int i=0; i<n; ++i) s2.append(" "); s2.append("|");
  n     = 65-m_trackmaker.type().size();
  std::string s3; for(int i=0; i<n; ++i) s3.append(" "); s3.append("|");
  n     = 65-m_outputTracksKey.key().size();
  std::string s4; for(int i=0; i<n; ++i) s4.append(" "); s4.append("|");
  
  out<<"|----------------------------------------------------------------"
     <<"----------------------------------------------------|"
     <<std::endl;
  out<<"| Tool for space points seeds             finding | "<<m_seedsmaker.type()<<s2
     <<std::endl;
  out<<"| Tool for space points seeded track      finding | "<<m_trackmaker.type()<<s3
     <<std::endl;
  out<<"| Location of output tracks                       | "<<m_outputTracksKey.key()<<s4
     <<std::endl;
  out<<"|----------------------------------------------------------------"
     <<"----------------------------------------------------|"
     <<std::endl;
  return out;
}

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 InDet::SiSPSeededTrackFinderRoI::execute ( const EventContext & ctx ) const

overridevirtual

Definition at line 129 of file SiSPSeededTrackFinderRoI.cxx.

{
  SG::WriteHandle<TrackCollection> outputTracks{m_outputTracksKey, ctx};
  ATH_CHECK(outputTracks.record(std::make_unique<TrackCollection>()));
 
  SG::ReadCondHandle<InDet::BeamSpotData> beamSpotHandle{m_beamSpotKey, ctx};
  ATH_CHECK( beamSpotHandle.isValid() );
  Trk::PerigeeSurface beamPosPerigee(beamSpotHandle->beamPos());
 
  bool PIX = true ;
  bool SCT = true ;
  bool ERR = false;
 
  //Create container for RoI information
  auto theVertexContainer = std::make_unique<xAOD::VertexContainer>();
  auto theVertexAuxContainer = std::make_unique<xAOD::VertexAuxContainer>();
  theVertexContainer->setStore( theVertexAuxContainer.get() );
 
  // Find reference point of the event and create z boundary region
  //
  std::vector<InDet::IZWindowRoISeedTool::ZWindow> listRoIs;
  listRoIs =  m_ZWindowRoISeedTool->getRoIs(ctx);
  double ZBoundary[2] = {0.0, 0.0};
  //if no RoI found; no need to go further
  if ( listRoIs.empty() ) {
    ATH_MSG_DEBUG("no selectedRoIs" );
  } else {
    //listRoIs[0].zReference is the midpoint
    ZBoundary[0] = listRoIs[0].zWindow[0];
    ZBoundary[1] = listRoIs[0].zWindow[1];
    ATH_MSG_DEBUG("selectedRoIs " << ZBoundary[0] <<" " << ZBoundary[1]);
  }
  
  //Store RoI information in a xAOD::Vertex object
  static const SG::AuxElement::Accessor<float> vtxDecor_boundaryLow("boundaryLow");
  static const SG::AuxElement::Accessor<float> vtxDecor_boundaryHigh("boundaryHigh");
  static const SG::AuxElement::Accessor<float> vtxDecor_perigeeZ0Lead("perigeeZ0Lead");
  static const SG::AuxElement::Accessor<float> vtxDecor_perigeeZ0Sublead("perigeeZ0Sublead");
  static const SG::AuxElement::Accessor<float> vtxDecor_isHS("isHS");
 
  for( size_t r = 0; r < listRoIs.size(); r++ ){
 
    theVertexContainer->push_back( new xAOD::Vertex() );
 
    theVertexContainer->back()->setZ( listRoIs[r].zReference );
    vtxDecor_boundaryLow(*theVertexContainer->back()) = listRoIs[r].zWindow[0];;
    vtxDecor_boundaryHigh(*theVertexContainer->back()) = listRoIs[r].zWindow[1];
    vtxDecor_perigeeZ0Lead(*theVertexContainer->back()) = listRoIs[r].zPerigeePos[0];
    vtxDecor_perigeeZ0Sublead(*theVertexContainer->back()) = listRoIs[r].zPerigeePos[1];
    vtxDecor_isHS(*theVertexContainer->back()) = 1;
  }
 
  // Analyses that want to run low-pt tracking with a region of interest care
  // about the beam conditions near a collision of interest.  Validation of the
  // beam conditions elsewhere in the beamspot (regarding low-pt tracks) will be
  // needed to establish meaningful uncertainties.  Choosing a random position
  // allows for this check.  Run with RAWtoESD section of postexec:
  // ToolSvc.InDetSiSpTrackFinder_LowPtRoI.doRandomSpot = True
  double RandZBoundary[2];
  std::vector<InDet::IZWindowRoISeedTool::ZWindow> listRandRoIs;
  if(m_doRandomSpot and not listRoIs.empty()){
    //Finding Random Spot in beamspot
    listRandRoIs =  m_RandomRoISeedTool->getRoIs(ctx);
 
    while( std::abs( listRoIs[0].zReference - listRandRoIs[0].zReference ) < 5. || std::abs(listRandRoIs[0].zReference) > 250.0 ){
      listRandRoIs.clear();
      listRandRoIs =  m_RandomRoISeedTool->getRoIs(ctx);
    }
 
    RandZBoundary[0] = listRandRoIs[0].zWindow[0];
    RandZBoundary[1] = listRandRoIs[0].zWindow[1];
    for( size_t r = 0; r < listRandRoIs.size(); r++ ){
 
      theVertexContainer->push_back( new xAOD::Vertex() );
      
      theVertexContainer->back()->setZ( listRandRoIs[r].zReference );
      vtxDecor_boundaryLow(*theVertexContainer->back()) = listRoIs[r].zWindow[0];;
      vtxDecor_boundaryHigh(*theVertexContainer->back()) = listRoIs[r].zWindow[1];
      vtxDecor_perigeeZ0Lead(*theVertexContainer->back()) = listRoIs[r].zPerigeePos[0];
      vtxDecor_perigeeZ0Sublead(*theVertexContainer->back()) = listRoIs[r].zPerigeePos[1];
      vtxDecor_isHS(*theVertexContainer->back()) = 0;      
    }
  }
  
  // Record the RoI information
  SG::WriteHandle<xAOD::VertexContainer> vxOut_h (m_vxOutputKey, ctx);
  CHECK( vxOut_h.record ( std::move(theVertexContainer), std::move(theVertexAuxContainer) ) );
 
  // Find seeds that point within the RoI region in z
  //  
  SiSpacePointsSeedMakerEventData seedEventData;
  m_seedsmaker->newEvent(ctx, seedEventData, -1); 
  if (not listRoIs.empty()) {
    std::list<Trk::Vertex> VZ; 
    if(m_useRoIWidth) m_seedsmaker->find3Sp(ctx, seedEventData, VZ, ZBoundary);
    //If you want to disable the RoI but still have a separate container for low-pt tracks
    // The RoI "vertex" container will still be there in case you want to use
    // that information for whatever reason (ie where the RoI would have been centered).
    else m_seedsmaker->find3Sp(ctx, seedEventData, VZ);
    if(m_doRandomSpot) m_seedsmaker->find3Sp(ctx, seedEventData, VZ, RandZBoundary);
  }
 
  InDet::ExtendedSiTrackMakerEventData_xk trackEventData(m_prdToTrackMap);
  m_trackmaker->newEvent(ctx, trackEventData, PIX, SCT);
 
 
  // Get the value of the seed maker validation ntuple writing switch
  bool doWriteNtuple = m_seedsmaker->getWriteNtupleBoolProperty();
  unsigned long EvNumber = 0; //Event number variable to be used for the validation ntuple 
 
  if (doWriteNtuple) {
    SG::ReadHandle<xAOD::EventInfo> eventInfo(m_evtKey,ctx);
    EvNumber = !eventInfo.isValid() ? 0 : eventInfo->eventNumber();
  }
 
  // Loop through all seed and create track candidates
  //
  ERR = false;
  Counter_t counter{};
  std::multimap<double,Trk::Track*>    qualitySortedTrackCandidates;
  const InDet::SiSpacePointsSeed* seed = nullptr;
 
  while((seed = m_seedsmaker->next(ctx, seedEventData))) {
    ++counter[kNSeeds];
    const std::list<Trk::Track*> trackList = m_trackmaker->getTracks(ctx, trackEventData, seed->spacePoints()); 
    for(Trk::Track* t: trackList) {
      qualitySortedTrackCandidates.insert(std::make_pair( -trackQuality(t), t ));
    }
    if(doWriteNtuple) { 
      // Note: determining if "pixel" or "strips" or "mixed" seed depending on innermost/outermost radii - hardcoded boundaries for Run 1-3 detector
      ISiSpacePointsSeedMaker::seedType seedType = ISiSpacePointsSeedMaker::PixelSeed;
      if (seed->r3() > 200.) {
        if (seed->r1() < 200.) {
          seedType = ISiSpacePointsSeedMaker::MixedSeed;
        } else {
          seedType = ISiSpacePointsSeedMaker::StripSeed;
        }
      }
      m_seedsmaker->writeNtuple(seed, !trackList.empty() ? trackList.front() : nullptr, seedType, EvNumber) ; 
    } 
    if( counter[kNSeeds] >= m_maxNumberSeeds) {
      ERR = true; 
      ++m_problemsTotal;  
      break;
    }
  }
  
  m_trackmaker->endEvent(trackEventData);
 
  // Remove shared tracks with worse quality
  //
  filterSharedTracks(qualitySortedTrackCandidates);
 
  // Save good tracks in track collection
  //
  for (const std::pair<const double, Trk::Track*> & qualityAndTrack: qualitySortedTrackCandidates) {
    ++counter[kNTracks];
    if (m_trackSummaryTool.isEnabled()) {
       m_trackSummaryTool->computeAndReplaceTrackSummary(*(qualityAndTrack.second),
                                                         false /* DO NOT suppress hole search*/);
    }
    outputTracks->push_back(qualityAndTrack.second);
  }
  m_counterTotal[kNSeeds] += counter[kNSeeds];
  ++m_neventsTotal;
 
  // In case of errors, clear output tracks
  //
  if (ERR) { 
    outputTracks->clear(); 
  } else {
    m_counterTotal[kNTracks] += counter[kNTracks];
  }
 
  // Print common event information
  //
  if (msgLvl(MSG::DEBUG)) {
    dump(MSG::DEBUG, &counter);
  }
 
  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();
  }

filterSharedTracks()

void InDet::SiSPSeededTrackFinderRoI::filterSharedTracks ( std::multimap< double, Trk::Track * > & qualitySortedTracks ) const

protected

cleans up the collection of quality filtered tracks.

Candidates which share most of their hits (steered by m_freeCut) with higher quality candidates are erased from the multimap

Parameters

[in,out]

scoredTracks

Track candidates, sorted by by score, best scored first (implemented by assigning negative sign to scores)

loop over all track candidates, sorted by quality

loop over measurements on the track candidate

get the PRD from the measurement

increase cluster count

and check if the cluster was already used in a previous ( = higher quality) track

if not, record as a free (not prevously used) cluster

check if the track has the minimum number of free clusters or if it has no shared clusters

if this is fulfilled, we keep the candidate add the free clusters to our cluster set

if this is fulfilled, we keep the candidate

if we do not keep the track, clean up candidate

if we do not keep the track, clean up candidate

Definition at line 398 of file SiSPSeededTrackFinderRoI.cxx.

{
  std::set<const Trk::PrepRawData*> clusters;
  
  std::vector<const Trk::PrepRawData*> freeClusters;
  freeClusters.reserve(15);    
  
  std::multimap<double, Trk::Track*>::iterator it_qualityAndTrack = qualitySortedTracks.begin();

  while (it_qualityAndTrack!=qualitySortedTracks.end()) {   
    freeClusters.clear();
 
    std::set<const Trk::PrepRawData*>::iterator it_clustersEnd = clusters.end();
 
    int nClusters = 0; 
    int nPixels = 0;

    for (const Trk::TrackStateOnSurface* tsos: *((*it_qualityAndTrack).second->trackStateOnSurfaces())) {
      if(!tsos->type(Trk::TrackStateOnSurface::Measurement)) continue;
      const Trk::FitQualityOnSurface fq =  tsos->fitQualityOnSurface();
      if(!fq) continue;
      if(fq.numberDoF() == 2) ++nPixels;
      
      const Trk::MeasurementBase* mb = tsos->measurementOnTrack();
      const Trk::RIO_OnTrack*     ri = dynamic_cast<const Trk::RIO_OnTrack*>(mb);
      if(!ri) continue;
      const Trk::PrepRawData* pr = ri->prepRawData();
      if (not pr) continue;
      ++nClusters;
      if (clusters.find(pr)==it_clustersEnd) {
    freeClusters.push_back(pr); 
      }
    }

    int nFreeClusters = static_cast<int>(freeClusters.size()); 
    if (nFreeClusters >= m_nfreeCut || nFreeClusters==nClusters) {
      clusters.insert(freeClusters.begin(), freeClusters.end());
 
      if (m_etaDependentCutsSvc.name().empty()) {
    ++it_qualityAndTrack;
      } else {
    //eta-dependent cuts
    int nFreeClusters = static_cast<int>(freeClusters.size());      
    if( passEtaDepCuts( (*it_qualityAndTrack).second, nClusters, nFreeClusters, nPixels) ){
      ++it_qualityAndTrack;
    } else {
      delete (*it_qualityAndTrack).second;
      qualitySortedTracks.erase(it_qualityAndTrack++);
    }      
      } //eta-dependent cuts
    } else {
      delete (*it_qualityAndTrack).second;
      qualitySortedTracks.erase(it_qualityAndTrack++);
    }
  }
}

finalize()

StatusCode InDet::SiSPSeededTrackFinderRoI::finalize ( )

overridevirtual

Definition at line 317 of file SiSPSeededTrackFinderRoI.cxx.

{
  dump(MSG::INFO, &m_counterTotal);
 
  return StatusCode::SUCCESS;
}

initialize()

StatusCode InDet::SiSPSeededTrackFinderRoI::initialize ( )

overridevirtual

Statistics and Debug

Definition at line 76 of file SiSPSeededTrackFinderRoI.cxx.

{
 
  // Initialize read/write handles
  ATH_CHECK( m_outputTracksKey.initialize() );
  ATH_CHECK( m_vxOutputKey.initialize() );
  ATH_CHECK( m_prdToTrackMap.initialize( !m_prdToTrackMap.key().empty() ) );
  ATH_CHECK( m_beamSpotKey.initialize() );
  ATH_CHECK(m_evtKey.initialize());
  
  // Retrieve Tools
  ATH_CHECK( m_ZWindowRoISeedTool.retrieve() );
  ATH_CHECK( m_RandomRoISeedTool.retrieve( DisableTool{(not m_doRandomSpot) or m_RandomRoISeedTool.name().empty()} ) );
  ATH_CHECK( m_seedsmaker.retrieve() );
  ATH_CHECK( m_trackmaker.retrieve() );
  ATH_CHECK( m_trackSummaryTool.retrieve( DisableTool{ m_trackSummaryTool.name().empty()} ));
  if (not m_etaDependentCutsSvc.name().empty()) ATH_CHECK(m_etaDependentCutsSvc.retrieve());
  magneticFieldInit(); //init magnetic field for simplified propagation
 
  if (msgLvl(MSG::DEBUG)) {
    dump(MSG::DEBUG, nullptr);
  }
  m_neventsTotal   = 0;
  m_problemsTotal  = 0;
  
  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;
}

magneticFieldInit()

void InDet::SiSPSeededTrackFinderRoI::magneticFieldInit ( )

protected

Definition at line 472 of file SiSPSeededTrackFinderRoI.cxx.

{
  // Build MagneticFieldProperties 
  //
  if(m_fieldmode == "NoField") {
    m_fieldprop = Trk::MagneticFieldProperties(Trk::NoField);
  } else {
    m_fieldprop = Trk::MagneticFieldProperties(Trk::FastField);
  }
}

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.

passEtaDepCuts()

bool InDet::SiSPSeededTrackFinderRoI::passEtaDepCuts ( const Trk::Track * track, int nClusters, int nFreeClusters, int nPixels ) const

protected

apply eta-dependent selections

Candidate tracks can be further selected using eta-dependent selections.

Definition at line 483 of file SiSPSeededTrackFinderRoI.cxx.

{
  Trk::TrackStates::const_iterator  m = track->trackStateOnSurfaces()->begin();
  const Trk::TrackParameters* par = (*m)->trackParameters();
  if(!par) return false;
 
  double eta = std::abs(par->eta());
  if(nClusters               < m_etaDependentCutsSvc->getMinSiHitsAtEta(eta)) return false;
  if(nFreeClusters           < m_etaDependentCutsSvc->getMinSiNotSharedAtEta(eta)) return false;
  if(nClusters-nFreeClusters > m_etaDependentCutsSvc->getMaxSharedAtEta(eta)) return false;
  if(nPixels                 < m_etaDependentCutsSvc->getMinPixelHitsAtEta(eta)) return false;
 
  if(par->pT() < m_etaDependentCutsSvc->getMinPtAtEta(eta)) return false;
  if(!(*m)->type(Trk::TrackStateOnSurface::Perigee)) return true ;
  if(std::abs(par->localPosition()[0]) > m_etaDependentCutsSvc->getMaxPrimaryImpactAtEta(eta)) return false;
  return true;
}

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

ATLAS_THREAD_SAFE

Counter_t m_counterTotal InDet::SiSPSeededTrackFinderRoI::ATLAS_THREAD_SAFE {}

mutableprotected

Definition at line 154 of file SiSPSeededTrackFinderRoI.h.

{};

m_beamSpotKey

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

protected

Definition at line 85 of file SiSPSeededTrackFinderRoI.h.

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

m_detStore

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

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

m_doRandomSpot

BooleanProperty InDet::SiSPSeededTrackFinderRoI::m_doRandomSpot {this, "doRandomSpot", false, "Low-pT tracking setting the RoI in a random position"}

protected

Definition at line 72 of file SiSPSeededTrackFinderRoI.h.

{this, "doRandomSpot", false, "Low-pT tracking setting the RoI in a random position"};

m_etaDependentCutsSvc

ServiceHandle<IInDetEtaDependentCutsSvc> InDet::SiSPSeededTrackFinderRoI::m_etaDependentCutsSvc {this, "EtaDependentCutsSvc", "", "if enable, further require eta-dependent selections on track candidates"}

protected

Definition at line 101 of file SiSPSeededTrackFinderRoI.h.

{this, "EtaDependentCutsSvc", "", "if enable, further require eta-dependent selections on track candidates"};

m_evtKey

SG::ReadHandleKey<xAOD::EventInfo> InDet::SiSPSeededTrackFinderRoI::m_evtKey {this, "EventInfoKey", "EventInfo"}

protected

Definition at line 86 of file SiSPSeededTrackFinderRoI.h.

{this, "EventInfoKey", "EventInfo"};

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_fieldmode

StringProperty InDet::SiSPSeededTrackFinderRoI::m_fieldmode {this, "MagneticFieldMode", "MapSolenoid"}

protected

Definition at line 74 of file SiSPSeededTrackFinderRoI.h.

{this, "MagneticFieldMode", "MapSolenoid"};

m_fieldprop

Trk::MagneticFieldProperties InDet::SiSPSeededTrackFinderRoI::m_fieldprop

protected

Definition at line 107 of file SiSPSeededTrackFinderRoI.h.

m_maxNumberSeeds

IntegerProperty InDet::SiSPSeededTrackFinderRoI::m_maxNumberSeeds {this, "maxNumberSeeds", 3000000, "Max. number used seeds"}

protected

Definition at line 70 of file SiSPSeededTrackFinderRoI.h.

{this, "maxNumberSeeds", 3000000, "Max. number used seeds"};

m_neventsTotal

std::atomic_int InDet::SiSPSeededTrackFinderRoI::m_neventsTotal {0}

mutableprotected

Number events.

Definition at line 156 of file SiSPSeededTrackFinderRoI.h.

{0}; 

m_nfreeCut

IntegerProperty InDet::SiSPSeededTrackFinderRoI::m_nfreeCut {this, "FreeClustersCut", 1, "Min number free clusters"}

protected

Definition at line 71 of file SiSPSeededTrackFinderRoI.h.

{this, "FreeClustersCut", 1, "Min number free clusters"};

m_outputTracksKey

SG::WriteHandleKey<TrackCollection> InDet::SiSPSeededTrackFinderRoI::m_outputTracksKey {this, "TracksLocation", "SiSPSeededTracksRoI", "Output track collection"}

protected

Definition at line 81 of file SiSPSeededTrackFinderRoI.h.

{this, "TracksLocation", "SiSPSeededTracksRoI", "Output track collection"};

m_prdToTrackMap

SG::ReadHandleKey<Trk::PRDtoTrackMap> InDet::SiSPSeededTrackFinderRoI::m_prdToTrackMap {this,"PRDtoTrackMap",""}

protected

Definition at line 84 of file SiSPSeededTrackFinderRoI.h.

{this,"PRDtoTrackMap",""};

m_problemsTotal

std::atomic_int InDet::SiSPSeededTrackFinderRoI::m_problemsTotal {0}

mutableprotected

Number events with number seeds > maxNumber.

Definition at line 157 of file SiSPSeededTrackFinderRoI.h.

{0}; 

m_RandomRoISeedTool

ToolHandle<IZWindowRoISeedTool> InDet::SiSPSeededTrackFinderRoI::m_RandomRoISeedTool {this, "RandomRoISeedTool", "InDet::RandomRoISeedTool", "Tool to run using additional RoIs randomly chosen away from the main one if doRandomSpot is set"}

protected

Definition at line 99 of file SiSPSeededTrackFinderRoI.h.

{this, "RandomRoISeedTool", "InDet::RandomRoISeedTool", "Tool to run using additional RoIs randomly chosen away from the main one if doRandomSpot is set"};

m_seedsmaker

ToolHandle<ISiSpacePointsSeedMaker> InDet::SiSPSeededTrackFinderRoI::m_seedsmaker {this, "SeedsTool", "InDet::SiSpacePointsSeedMaker_ATLxk/InDetSpSeedsMaker", "Space poins seed maker"}

protected

Definition at line 94 of file SiSPSeededTrackFinderRoI.h.

{this, "SeedsTool", "InDet::SiSpacePointsSeedMaker_ATLxk/InDetSpSeedsMaker", "Space poins seed maker"};

m_trackmaker

ToolHandle<ISiTrackMaker> InDet::SiSPSeededTrackFinderRoI::m_trackmaker {this, "TrackTool", "InDet::SiTrackMaker_xk/InDetSiTrackMaker", "Track maker"}

protected

Definition at line 95 of file SiSPSeededTrackFinderRoI.h.

{this, "TrackTool", "InDet::SiTrackMaker_xk/InDetSiTrackMaker", "Track maker"};

m_trackSummaryTool

ToolHandle<Trk::IExtendedTrackSummaryTool> InDet::SiSPSeededTrackFinderRoI::m_trackSummaryTool {this, "TrackSummaryTool", "InDetTrackSummaryToolNoHoleSearch"}

protected

Definition at line 96 of file SiSPSeededTrackFinderRoI.h.

{this, "TrackSummaryTool", "InDetTrackSummaryToolNoHoleSearch"};

m_useRoIWidth

BooleanProperty InDet::SiSPSeededTrackFinderRoI::m_useRoIWidth {this, "useRoIWidth", true, "Use width of RoI along z-axis"}

protected

Definition at line 69 of file SiSPSeededTrackFinderRoI.h.

{this, "useRoIWidth", true, "Use width of RoI along z-axis"};

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_vxOutputKey

SG::WriteHandleKey<xAOD::VertexContainer> InDet::SiSPSeededTrackFinderRoI::m_vxOutputKey {this, "VxOutputName", "LowPtRoIVertices", "Output Vertex collection with per-event RoI information"}

protected

Definition at line 82 of file SiSPSeededTrackFinderRoI.h.

{this, "VxOutputName", "LowPtRoIVertices", "Output Vertex collection with per-event RoI information"};

m_ZWindowRoISeedTool

ToolHandle<IZWindowRoISeedTool> InDet::SiSPSeededTrackFinderRoI::m_ZWindowRoISeedTool {this, "ZWindowRoISeedTool", "InDet::ZWindowRoISeedTool", "Tool to determin per-event RoI"}

protected

Definition at line 98 of file SiSPSeededTrackFinderRoI.h.

{this, "ZWindowRoISeedTool", "InDet::ZWindowRoISeedTool", "Tool to determin per-event RoI"};

---

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

• SiSPSeededTrackFinderRoI.h
• SiSPSeededTrackFinderRoI.cxx