InDet::HoleSearchValidation Class Reference

#include <HoleSearchValidation.h>

Inheritance diagram for InDet::HoleSearchValidation:

Classes
struct	Parts

Public Member Functions
	HoleSearchValidation (const std::string &name, ISvcLocator *pSvcLocator)
	Standard Athena-Algorithm Constructor.
	~HoleSearchValidation ()
	Default Destructor.
StatusCode	initialize ()
	standard Athena-Algorithm method
StatusCode	execute (const EventContext &ctx) const
	standard Athena-Algorithm method
StatusCode	finalize ()
	standard Athena-Algorithm method
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
void	printInfoTSoS (const Trk::TrackStateOnSurface *tsos) const
unsigned int	doHoleSearch (const Trk::Track *track) const
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
const AtlasDetectorID *	m_idHelper
const PixelID *	m_pixelID
const SCT_ID *	m_sctID
const TRT_ID *	m_trtID
const SiliconID *	m_siliconID
ToolHandle< Trk::ITrackHoleSearchTool >	m_holeSearchTool
SG::ReadHandleKey< TrackCollection >	m_trackCollectionKey
	jobOption: name of the TrackCollection
SG::WriteHandleKey< TrackCollection >	m_trackCollectionOutputKey
	jobOption: name of the TrackCollection
bool	m_saveNewTracksInSG
	jobOption: save new tracks to SG ?
bool	m_removeParts [Parts::kNParts]
bool	m_removeOverlapHitsOnly
bool	m_ignoreTrackEnds
bool	m_randomRemovalMode
unsigned int	m_maxNumberOfHoles
ServiceHandle< IAthRNGSvc >	m_rndmGenSvc
	Random number generator.
std::string	m_randomEngineName
	Name of the random number stream.
std::mutex	m_trackStatsMutex
std::vector< std::vector< unsigned int > > m_trackStats	ATLAS_THREAD_SAFE
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 52 of file HoleSearchValidation.h.

Member Typedef Documentation

StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

HoleSearchValidation()

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

Standard Athena-Algorithm Constructor.

Definition at line 30 of file HoleSearchValidation.cxx.

                                                                                         :
    AthReentrantAlgorithm(name, pSvcLocator),
    m_idHelper(nullptr),
    m_pixelID(nullptr),
    m_sctID(nullptr),
    m_trtID(nullptr),
    m_siliconID(nullptr),
    m_holeSearchTool("InDet::InDetTrackHoleSearchTool"),
    m_trackCollectionKey("Tracks"),
    m_saveNewTracksInSG(false),
        m_removeParts {},
    m_removeOverlapHitsOnly(false),
    m_ignoreTrackEnds(true),
    m_randomRemovalMode(false),
    m_maxNumberOfHoles(3),
    m_rndmGenSvc("AthRNGSvc", name),
    m_randomEngineName("HoleSearchRnd")
 
{
  declareProperty("HoleSearchTool"          , m_holeSearchTool);
  declareProperty("TrackCollection"         , m_trackCollectionKey, "Name of the reference track collection");
 
  declareProperty("SaveNewTracksInSG"       , m_saveNewTracksInSG  , "Boolean: save tracks in SG");
 
  // for (unsigned int part_i=0; part_i<Parts::kNParts; ++part_i) {
  //   m_removeParts[part_i]=false;
  // }
  declareProperty("RemovePIX0"              , m_removeParts[Parts::kPix0]         , "Remove hit(s) in PIXEL layer 0");
  declareProperty("RemovePIX1"              , m_removeParts[Parts::kPix1]         , "Remove hit(s) in PIXEL layer 1");
  declareProperty("RemovePIX2"              , m_removeParts[Parts::kPix2]         , "Remove hit(s) in PIXEL layer 2");
 
  declareProperty("RemoveSCT0"              , m_removeParts[Parts::kSct0]         , "Remove hit(s) in SCT layer 0");
  declareProperty("RemoveSCT1"              , m_removeParts[Parts::kSct1]         , "Remove hit(s) in SCT layer 1");
  declareProperty("RemoveSCT2"              , m_removeParts[Parts::kSct2]         , "Remove hit(s) in SCT layer 2");
  declareProperty("RemoveSCT3"              , m_removeParts[Parts::kSct3]         , "Remove hit(s) in SCT layer 3");
 
  declareProperty("RemoveSCT4"              , m_removeParts[Parts::kSct4]         , "Remove hit(s) in SCT endcap layer 4");
  declareProperty("RemoveSCT5"              , m_removeParts[Parts::kSct5]         , "Remove hit(s) in SCT endcap layer 5");
  declareProperty("RemoveSCT6"              , m_removeParts[Parts::kSct6]         , "Remove hit(s) in SCT endcap layer 6");
  declareProperty("RemoveSCT7"              , m_removeParts[Parts::kSct7]         , "Remove hit(s) in SCT endcap layer 7");
  declareProperty("RemoveSCT8"              , m_removeParts[Parts::kSct8]         , "Remove hit(s) in SCT endcap layer 8");
 
  declareProperty("RemoveSCTSide0"          , m_removeParts[Parts::kSctSide0]     , "Remove SCT hits on side 0");
  declareProperty("RemoveSCTSide1"          , m_removeParts[Parts::kSctSide1]     , "Remove SCT hits on side 1");
 
  declareProperty("RemoveOverlapHitsOnly"  , m_removeOverlapHitsOnly, "Only remove overlap track hits");
  declareProperty("IgnoreTrackEnds"        , m_ignoreTrackEnds     , "Ignore hits at the end of the track");
 
  declareProperty("RandomRemovalMode"       , m_randomRemovalMode  , "Randomly remove track hits (overwrites the other flags!)");
  declareProperty("MaximalHoles"            , m_maxNumberOfHoles   , "Number of maximal holes to be created");
 
  declare( m_trackCollectionOutputKey );
 
  // start with 10x10
  m_trackStats = std::vector< std::vector< unsigned int> >(0, std::vector< unsigned int>(0));
}

~HoleSearchValidation()

HoleSearchValidation::~HoleSearchValidation ( )

default

Default Destructor.

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

doHoleSearch()

unsigned int HoleSearchValidation::doHoleSearch ( const Trk::Track * track ) const

private

Definition at line 476 of file HoleSearchValidation.cxx.

{
  ATH_MSG_VERBOSE(  "start hole search for track ( " << track << ")" ) ;
  unsigned int nHoles(0);
 
  std::unique_ptr<const Trk::TrackStates> holesOnTrack
    (m_holeSearchTool->getHolesOnTrack(*track, track->info().particleHypothesis()));
  // loop over holes
  if (!holesOnTrack) {
    ATH_MSG_WARNING(  "HoleSearchTool returned NULL !" ) ;
    return nHoles;
  } else {
    nHoles = holesOnTrack->size();
    ATH_MSG_DEBUG(  "found " << nHoles << " holes on track." ) ;
    for (Trk::TrackStates::const_iterator it=holesOnTrack->begin();
         it!=holesOnTrack->end();  ++it) {
      if (!(*it)) {
        ATH_MSG_WARNING(  "TrackStateOnSurface from hole search tool == Null" ) ;
        continue;
      }
      ATH_MSG_DEBUG(  "Found hole:" ) ;
      printInfoTSoS( *it );
    } // end loop on holes
  }
  return nHoles;
}

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 HoleSearchValidation::execute

(

const EventContext &

ctx

)

const

standard Athena-Algorithm method

Definition at line 151 of file HoleSearchValidation.cxx.

                                                                      {
 
  ATHRNG::RNGWrapper* wrapper = m_rndmGenSvc->getEngine(this, m_randomEngineName);
  wrapper->setSeed (this->name(), ctx);
  CLHEP::HepRandomEngine* engine = wrapper->getEngine (ctx);
 
  std::array<bool,Parts::kNParts> remove_parts{};
  for (unsigned int part_i=0; part_i<Parts::kNParts; ++part_i) {
    remove_parts[part_i]=( !m_randomRemovalMode ? m_removeParts[part_i] : false );
  }
  ATH_MSG_VERBOSE( "HoleSearchValidation execute() start" ) ;
 
  std::unique_ptr<TrackCollection>  newTrackCollection( m_saveNewTracksInSG ? std::make_unique<TrackCollection>() : nullptr );
 
  // get track collection
  SG::ReadHandle<TrackCollection> tracks(m_trackCollectionKey,ctx);
  if (!tracks.isValid()) {
    ATH_MSG_ERROR("Missing input track collection " << m_trackCollectionKey.key());
    return StatusCode::FAILURE;
  }
 
  // loop over tracks
  TrackCollection::const_iterator trackIterator = tracks->begin();
  for ( ; trackIterator < tracks->end(); ++trackIterator) {
    if (!((*trackIterator))) {
      ATH_MSG_WARNING( "TrackCollection " << m_trackCollectionKey.key() << "contains empty entries" ) ;
      continue;
    }
 
    // get all TSOS
    const Trk::Track& track = *(*trackIterator);
    const Trk::TrackStates* tsos = track.trackStateOnSurfaces();
    ATH_MSG_DEBUG(  "Perform hole search on unmodified track (" << *trackIterator << ")"
                    << " which contains " << tsos->size() <<" track states" ) ;
    // perform hole search
    unsigned int oldHoles = doHoleSearch( *trackIterator );
 
    auto vecTsos = std::make_unique<Trk::TrackStates>();
 
    // loop over TSOS, copy TSOS and push into vector
    Trk::TrackStates::const_iterator iTsos    = tsos->begin();
    Trk::TrackStates::const_iterator iTsosEnd = tsos->end();
 
    unsigned int nRemoved = 0;
 
    std::vector< unsigned int > pixelHitsPerLayer = std::vector< unsigned int>(3);
    std::vector< unsigned int > sctHitsPerLayer = std::vector< unsigned int>(9);
 
    // in case of removing the end hits we need to parse the track first once,
    //   variables will be call pl (for preloop)
    int maxPixelLayerBarrel = -1;
    int maxPixelLayerEndcap = -1;
    int maxSctLayerBarrel   = -1;
    int maxSctLayerEndcap   = -1;
 
    if (m_ignoreTrackEnds || m_randomRemovalMode){
      ATH_MSG_VERBOSE(  "Parsing track first to find end layers and maximal numbers" ) ;
      for ( ; iTsos != iTsosEnd ; ++iTsos) {
        //
        Identifier plSurfaceID;
        const Trk::MeasurementBase* plMesb = (*iTsos)->measurementOnTrack();
        if (plMesb &&  plMesb->associatedSurface().associatedDetectorElement()){
          plSurfaceID = plMesb->associatedSurface().associatedDetectorElement()->identify();
          // to find out whether it is barrel / endcap
          // check pixel / sct
          if ( m_idHelper->is_pixel( plSurfaceID ) ) {
            int plLayer = abs(m_pixelID->layer_disk( plSurfaceID ));
            bool isBarrel = m_pixelID->is_barrel( plSurfaceID );
            // set the maximal pixel layer: barrel / ec
            if ( isBarrel )
              maxPixelLayerBarrel = plLayer > maxPixelLayerBarrel ? plLayer : maxPixelLayerBarrel;
            else
              maxPixelLayerEndcap = plLayer > maxPixelLayerEndcap ? plLayer : maxPixelLayerEndcap;
          } else if (m_idHelper->is_sct( plSurfaceID ) ) {
            int plLayer = abs(m_sctID->layer_disk(  plSurfaceID ));
            bool isBarrel = m_sctID->is_barrel( plSurfaceID );
            // set the maximal pixel layer: barrel / ec
            if ( isBarrel )
              maxSctLayerBarrel = plLayer > maxSctLayerBarrel ? plLayer : maxSctLayerBarrel;
            else
              maxSctLayerEndcap = plLayer > maxSctLayerEndcap ? plLayer : maxSctLayerEndcap;
          }
        }
      }
      // sct overrules pixels
      maxPixelLayerBarrel = maxSctLayerBarrel > 0 ? -1 : maxPixelLayerBarrel;
      maxPixelLayerEndcap = maxSctLayerEndcap > 0 ? -1 : maxPixelLayerEndcap;
      // reset to start the main loop correctly
      iTsos    = tsos->begin();
    }
 
 
    for ( ; iTsos != iTsosEnd ; ++iTsos) {
      if ((*iTsos)->type(Trk::TrackStateOnSurface::Measurement)) {
 
    Identifier surfaceID;
    const Trk::MeasurementBase* mesb = (*iTsos)->measurementOnTrack();
 
        // also reset the identifiers
        unsigned int randomHoles = 0;
        if (m_randomRemovalMode){
          // ---------------------------------------------------------------------------------------
          randomHoles = (unsigned int)(m_maxNumberOfHoles*CLHEP::RandFlat::shoot(engine));
          ATH_MSG_VERBOSE("Random mode chosen: will create " << randomHoles << " holes on the track.");
 
          // max int pixel
          unsigned int maxPixel = maxPixelLayerBarrel > maxPixelLayerEndcap
            ? maxPixelLayerBarrel : maxPixelLayerEndcap;
          // max int sct
          unsigned int maxSct = maxSctLayerBarrel > maxSctLayerEndcap
            ? maxSctLayerBarrel : maxSctLayerEndcap;
          // -------------------------------------------------------------------
          int maxHit          = maxPixel + maxSct;
          int holesTriggered = 0;
          maxHit -= m_ignoreTrackEnds ? 1 : 0;
          // make the switch
          for (unsigned int ihole = 0; ihole < randomHoles && holesTriggered < int(randomHoles); ++ihole){
            // throw the dices
            unsigned int holeId = (unsigned int)(maxHit*CLHEP::RandFlat::shoot(engine));
            ATH_MSG_VERBOSE( "Random mode : layer identifier " << holeId << " chosen." );
            {
              // now switch between --------
              switch (holeId) {
              case 0 : { remove_parts[Parts::kPix0] = true; ++holesTriggered; }; break;
              case 1 : { remove_parts[Parts::kPix1] = true; ++holesTriggered; }; break;
              case 2 : { remove_parts[Parts::kPix2] = true; ++holesTriggered; }; break;
              case 3 : { remove_parts[Parts::kSct0] = true; ++holesTriggered; }; break;
              case 4 : { remove_parts[Parts::kSct1] = true; ++holesTriggered; }; break;
              case 5 : { remove_parts[Parts::kSct2] = true; ++holesTriggered; }; break;
              case 6 : { remove_parts[Parts::kSct3] = true; ++holesTriggered; }; break;
              case 7 : { remove_parts[Parts::kSct4] = true; ++holesTriggered; }; break;
              case 8 : { remove_parts[Parts::kSct5] = true; ++holesTriggered; }; break;
              case 9 : { remove_parts[Parts::kSct6] = true; ++holesTriggered; }; break;
              case 10 : { remove_parts[Parts::kSct7] = true; ++holesTriggered; }; break;
              case 11 : { remove_parts[Parts::kSct8] = true; ++holesTriggered; }; break;
              default : break;
              }
              // make the side decision on the side
              if (holeId > 2) {
                double sideDecision = CLHEP::RandFlat::shoot(engine);
                if ( sideDecision < 1./3. )
                  remove_parts[Parts::kSctSide0] = true;
                else if ( sideDecision < 2./3. )
                  remove_parts[Parts::kSctSide1] = true;
                else {
                  remove_parts[Parts::kSctSide0] = true;
                  remove_parts[Parts::kSctSide1] = true;
                  ++holesTriggered;
                }
              }
            }
          }
        }
 
    // hits, outliers
    if (mesb != nullptr && mesb->associatedSurface().associatedDetectorElement() != nullptr) {
      surfaceID = mesb->associatedSurface().associatedDetectorElement()->identify();
          // the pixel case
      if ( m_idHelper->is_pixel( surfaceID ) ) {
        int layer = abs(m_pixelID->layer_disk( surfaceID ));
            // check barrel / ec
            bool isBarrel = m_pixelID->is_barrel( surfaceID );
            // indicate how many pixel hits are per layer
        pixelHitsPerLayer[layer]++;
            ATH_MSG_VERBOSE(  "Pixel hits on layer " << layer << " : " << pixelHitsPerLayer[layer] ) ;
            // check for last layer
            bool isLastLayer = (isBarrel && layer == maxPixelLayerBarrel) || (!isBarrel && layer == maxPixelLayerEndcap);
            // only in the ignore track case
            if (m_ignoreTrackEnds && isLastLayer){
              ATH_MSG_VERBOSE(  "This pixel hit is not removed, it is at the track end." ) ;
            } else if ( !m_removeOverlapHitsOnly || pixelHitsPerLayer[layer] > 1) {
              if ( !m_ignoreTrackEnds && layer == 0 && remove_parts[Parts::kPix0] ) {
        ATH_MSG_DEBUG(  "Removing PIXEL layer 0 hit" ) ;
        printInfoTSoS( *iTsos );
        nRemoved++;
        continue;
              } else if( layer == 1 && remove_parts[Parts::kPix1] ) {
        ATH_MSG_DEBUG(  "Removing PIXEL layer 1 hit" ) ;
        printInfoTSoS( *iTsos );
        nRemoved++;
        continue;
              } else if( layer == 2 && remove_parts[Parts::kPix2] ) {
        ATH_MSG_DEBUG(  "Removing PIXEL layer 2 hit" ) ;
        printInfoTSoS( *iTsos );
        nRemoved++;
        continue;
          }
        }
      } else if ( m_idHelper->is_sct( surfaceID ) ) {
            int layer = abs(m_sctID->layer_disk( surfaceID ));
            // check barrel / ec
            bool isBarrel = m_sctID->is_barrel( surfaceID );
            // counter for number of layers
            sctHitsPerLayer[layer]++;
            ATH_MSG_VERBOSE(  "SCT hits on layer " << layer << " : " << sctHitsPerLayer[layer] ) ;
            // steer the side to be removed
        int side  = m_sctID->side( surfaceID );
        bool canRemoveSide = (side == 0) ? remove_parts[Parts::kSctSide0] : remove_parts[Parts::kSctSide1];
            // check for last layer
            bool isLastLayer = (isBarrel && layer == maxSctLayerBarrel) || (!isBarrel && layer == maxSctLayerEndcap);
            // only in the ignore track case
            if (m_ignoreTrackEnds && isLastLayer){
              ATH_MSG_VERBOSE(  "This SCT hit is not removed, it is at the track end." ) ;
            } else if ( layer == 0 && remove_parts[Parts::kSct0] && canRemoveSide ) {
          ATH_MSG_DEBUG(  "Removing SCT layer 0 hit" ) ;
          printInfoTSoS( *iTsos );
          nRemoved++;
          continue;
            } else if ( layer == 1 && remove_parts[Parts::kSct1]  && canRemoveSide ) {
          ATH_MSG_DEBUG(  "Removing SCT layer 1 hit" ) ;
          printInfoTSoS( *iTsos );
          nRemoved++;
          continue;
            } else if ( layer == 2 && remove_parts[Parts::kSct2]  && canRemoveSide ) {
          ATH_MSG_DEBUG(  "Removing SCT layer 2 hit" ) ;
          printInfoTSoS( *iTsos );
          nRemoved++;
          continue;
            } else if ( layer == 3 && remove_parts[Parts::kSct3]  && canRemoveSide ) {
          ATH_MSG_DEBUG(  "Removing SCT layer 3 hit" ) ;
          printInfoTSoS( *iTsos );
          nRemoved++;
          continue;
            } else if ( layer == 4 && remove_parts[Parts::kSct4]  && canRemoveSide ) {
          ATH_MSG_DEBUG(  "Removing SCT endcap layer 4 hit" ) ;
          printInfoTSoS( *iTsos );
          nRemoved++;
          continue;
            } else if ( layer == 5 && remove_parts[Parts::kSct5]  && canRemoveSide ) {
          ATH_MSG_DEBUG(  "Removing SCT endcap layer 5 hit" ) ;
          printInfoTSoS( *iTsos );
          nRemoved++;
          continue;
            } else if ( layer == 6 && remove_parts[Parts::kSct6]  && canRemoveSide ) {
          ATH_MSG_DEBUG(  "Removing SCT endcap layer 6 hit" ) ;
          printInfoTSoS( *iTsos );
          nRemoved++;
          continue;
            } else if ( layer == 7 && remove_parts[Parts::kSct7]  && canRemoveSide ) {
          ATH_MSG_DEBUG(  "Removing SCT endcap layer 7 hit" ) ;
          printInfoTSoS( *iTsos );
          nRemoved++;
          continue;
            } else if ( layer == 8 && remove_parts[Parts::kSct8]  && canRemoveSide ) {
          ATH_MSG_DEBUG(  "Removing SCT endcap layer 8 hit" ) ;
          printInfoTSoS( *iTsos );
          nRemoved++;
          continue;
            }
 
          } // end SCT hit
        } // end have identifier
      } // end TSoS is of type measurement
 
      const Trk::TrackStateOnSurface* newTsos = new Trk::TrackStateOnSurface(**iTsos);
      vecTsos->push_back(newTsos);
    } // end loop over all TSoS
 
    ATH_MSG_DEBUG(  "Removed total of " << nRemoved << " TSoS on track." ) ;
 
    Trk::Track* newTrack = new Trk::Track(track.info(), std::move(vecTsos), nullptr );
    ATH_MSG_VERBOSE(  "Perform hole search on new track:" ) ;
    // perform hole search
    unsigned int newHoles = doHoleSearch( newTrack );
    unsigned int foundHoles = abs(static_cast<int>(newHoles) - static_cast<int>(oldHoles));
 
    if ( foundHoles == nRemoved )
      ATH_MSG_DEBUG(  "== OK      : "<< nRemoved <<" generated holes out of which all were found" ) ;
    else
      ATH_MSG_DEBUG(  "== PROBLEM : "<< nRemoved <<" generated holes out of which "<< newHoles - oldHoles << " were found" ) ;
 
    // fill track statistics
    // first, check size of vectors
    {
      std::lock_guard<std::mutex> lock(m_trackStatsMutex);
      while (m_trackStats.size() < nRemoved+1) {
        m_trackStats.emplace_back(0 );
      }
      while (m_trackStats[nRemoved].size() < foundHoles+1) {
        m_trackStats[nRemoved].push_back( 0 );
      }
      ATH_MSG_DEBUG(  "m_trackStats.size()= " << m_trackStats.size() );
      //     // increase counter
      m_trackStats[nRemoved][foundHoles]++;
    }
 
    // posibly save new track into container and SG
    if (m_saveNewTracksInSG) {
      newTrackCollection->push_back( newTrack );
    } else {
      delete newTrack; // TSOS are owned by track (so no need to delete them manually)
    }
 
  } // end loop over all input tracks
  ATH_MSG_DEBUG(  "Finished looping over all input tracks" ) ;
 
  if (m_saveNewTracksInSG) {
    SG::WriteHandle<TrackCollection> newTrackCollection_handle(m_trackCollectionOutputKey,ctx);
    if (newTrackCollection_handle.record( std::move(newTrackCollection) ).isFailure()){
      ATH_MSG_ERROR("Failed to record output collection " << m_trackCollectionOutputKey.key());
      return StatusCode::FAILURE;
    }
  }
  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 HoleSearchValidation::finalize

(

)

standard Athena-Algorithm method

Definition at line 457 of file HoleSearchValidation.cxx.

                                          {
  ATH_MSG_INFO( "HoleSearchValidation finalize()" ) ;
 
  ATH_MSG_INFO(  "Printing statistics for hole search validation:" ) ;
  ATH_MSG_INFO(  " # removed hits | # tracks / found holes | ... " ) ;
  for ( unsigned int nRemoved = 0; nRemoved < m_trackStats.size(); ++nRemoved) {
    unsigned int nTracks = 0;
    for ( unsigned int holes = 0; holes < m_trackStats[nRemoved].size(); ++holes) nTracks +=  m_trackStats[nRemoved][holes];
    if ( nTracks == 0) continue;
    ATH_MSG_INFO(  "Removed " << nRemoved << " hits from track -- found: " ) ;
     for ( unsigned int holes = 0; holes < m_trackStats[nRemoved].size(); ++holes) {
       ATH_MSG_INFO(  "    -- " << 100.0 * m_trackStats[nRemoved][holes]/float(nTracks)
              << "% of tracks with " << holes << " holes (" <<  m_trackStats[nRemoved][holes] << " / " <<  float(nTracks) << ")") ;
     }
   }
 
  return StatusCode::SUCCESS;
}

initialize()

StatusCode HoleSearchValidation::initialize

(

)

standard Athena-Algorithm method

Definition at line 89 of file HoleSearchValidation.cxx.

                                            {
  ATH_MSG_INFO( "HoleSearchValidation initialize()" ) ;
 
  //ID Helper
  StatusCode sc = detStore()->retrieve(m_idHelper, "AtlasID" );
  if (sc.isFailure()) {
     ATH_MSG_WARNING(  "Could not get AtlasDetectorID !" ) ;
     return StatusCode::SUCCESS;
  }else{
     ATH_MSG_DEBUG( "Found AtlasDetectorID" ) ;
  }
 
  sc = detStore()->retrieve(m_pixelID, "PixelID");
  if (sc.isFailure()) {
    ATH_MSG_WARNING(  "Could not get Pixel ID helper !" ) ;
    return StatusCode::SUCCESS;
  }
  ATH_MSG_DEBUG(  "Initialized PixelIDHelper" ) ;
 
  sc = detStore()->retrieve(m_sctID, "SCT_ID");
  if (sc.isFailure()) {
    ATH_MSG_WARNING(  "Could not get SCT ID helper !" ) ;
    return StatusCode::SUCCESS;
  }
  ATH_MSG_DEBUG(  "Initialized SCTIDHelper" ) ;
 
  sc = detStore()->retrieve(m_trtID, "TRT_ID");
  if (sc.isFailure()) {
    ATH_MSG_WARNING(  "Could not get TRT ID helper !" ) ;
    return StatusCode::SUCCESS;
  }
  ATH_MSG_DEBUG(  "Initialized TRTIDHelper" ) ;
 
  sc = detStore()->retrieve(m_siliconID, "SiliconID");
  if (sc.isFailure()) {
    ATH_MSG_WARNING(  "Could not get Silicon ID helper !" ) ;
    return StatusCode::SUCCESS;
  }
  ATH_MSG_DEBUG(  "Initialized SiliconIDHelper" ) ;
 
 
  // Get HoleSearchTool
  sc = m_holeSearchTool.retrieve();
  if (sc.isFailure()) {
    ATH_MSG_FATAL(  "Could not retrieve "<< m_holeSearchTool ) ;
    return sc;
  }
 
  if ( m_rndmGenSvc.retrieve().isFailure() ){
    ATH_MSG_FATAL( "Could not retrieve " << m_rndmGenSvc );
    return StatusCode::FAILURE;
  }
 
  ATH_CHECK(m_trackCollectionKey.initialize());
  if (m_saveNewTracksInSG) {
    m_trackCollectionOutputKey = m_trackCollectionKey.key() + "_removedHits";
    ATH_CHECK(m_trackCollectionOutputKey.initialize());
  }
 
  return StatusCode::SUCCESS;
}

inputHandles()

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

overridevirtualinherited

Return this algorithm's input handles.

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

isClonable()

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

overridevirtualinherited

Specify if the algorithm is clonable.

Reentrant algorithms are clonable.

Reimplemented in 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.

printInfoTSoS()

void HoleSearchValidation::printInfoTSoS ( const Trk::TrackStateOnSurface * tsos ) const

private

Definition at line 504 of file HoleSearchValidation.cxx.

{
 
  ATH_MSG_VERBOSE(  "Position : " << tsos->trackParameters()->position()
            << " with R = " << sqrt(pow(tsos->trackParameters()->position().x(),2)
                        +pow(tsos->trackParameters()->position().y(),2)) );
  Identifier surfaceID;
  const Trk::MeasurementBase* mesb = tsos->measurementOnTrack();
  // hits, outliers
  if (mesb != nullptr && mesb->associatedSurface().associatedDetectorElement() != nullptr) {
    surfaceID = mesb->associatedSurface().associatedDetectorElement()->identify();
    if ( m_siliconID->is_barrel( surfaceID ) ) {
      ATH_MSG_VERBOSE(  " -- Barrel:");
    } else {
      ATH_MSG_VERBOSE(  " -- Endcap:");
    }
    if ( m_idHelper->is_sct( surfaceID ) ) {
      ATH_MSG_VERBOSE(  "    -> SCT layer = " << m_sctID->layer_disk( surfaceID )
            << " side = " << m_sctID->side( surfaceID ) );
      //ATH_MSG_VERBOSE(  m_sctID->show_to_string(surfaceID) ) ;
 
    }
    if ( m_idHelper->is_pixel( surfaceID ) ) {
      ATH_MSG_VERBOSE(  "    -> PIXEL layer = " << m_pixelID->layer_disk( surfaceID ) );
      //ATH_MSG_VERBOSE(  m_pixelID->show_to_string(surfaceID) ) ;
    }
  }
 
}

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

std::vector< std::vector< unsigned int > > m_trackStats InDet::HoleSearchValidation::ATLAS_THREAD_SAFE

mutableprivate

tracks as function of [#generated holes, #found holes]. Guarded by m_trackStatsMutex

Definition at line 118 of file HoleSearchValidation.h.

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_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_holeSearchTool

ToolHandle<Trk::ITrackHoleSearchTool> InDet::HoleSearchValidation::m_holeSearchTool

private

Definition at line 77 of file HoleSearchValidation.h.

m_idHelper

const AtlasDetectorID* InDet::HoleSearchValidation::m_idHelper

private

Definition at line 71 of file HoleSearchValidation.h.

m_ignoreTrackEnds

bool InDet::HoleSearchValidation::m_ignoreTrackEnds

private

Definition at line 108 of file HoleSearchValidation.h.

m_maxNumberOfHoles

unsigned int InDet::HoleSearchValidation::m_maxNumberOfHoles

private

Definition at line 111 of file HoleSearchValidation.h.

m_pixelID

const PixelID* InDet::HoleSearchValidation::m_pixelID

private

Definition at line 72 of file HoleSearchValidation.h.

m_randomEngineName

std::string InDet::HoleSearchValidation::m_randomEngineName

private

Name of the random number stream.

Definition at line 114 of file HoleSearchValidation.h.

m_randomRemovalMode

bool InDet::HoleSearchValidation::m_randomRemovalMode

private

Definition at line 110 of file HoleSearchValidation.h.

m_removeOverlapHitsOnly

bool InDet::HoleSearchValidation::m_removeOverlapHitsOnly

private

Definition at line 107 of file HoleSearchValidation.h.

m_removeParts

bool InDet::HoleSearchValidation::m_removeParts[Parts::kNParts]

private

Definition at line 106 of file HoleSearchValidation.h.

m_rndmGenSvc

ServiceHandle<IAthRNGSvc> InDet::HoleSearchValidation::m_rndmGenSvc

private

Random number generator.

Definition at line 113 of file HoleSearchValidation.h.

m_saveNewTracksInSG

bool InDet::HoleSearchValidation::m_saveNewTracksInSG

private

jobOption: save new tracks to SG ?

Definition at line 82 of file HoleSearchValidation.h.

m_sctID

const SCT_ID* InDet::HoleSearchValidation::m_sctID

private

Definition at line 73 of file HoleSearchValidation.h.

m_siliconID

const SiliconID* InDet::HoleSearchValidation::m_siliconID

private

Definition at line 75 of file HoleSearchValidation.h.

m_trackCollectionKey

SG::ReadHandleKey<TrackCollection> InDet::HoleSearchValidation::m_trackCollectionKey

private

jobOption: name of the TrackCollection

Definition at line 78 of file HoleSearchValidation.h.

m_trackCollectionOutputKey

SG::WriteHandleKey<TrackCollection> InDet::HoleSearchValidation::m_trackCollectionOutputKey

private

jobOption: name of the TrackCollection

Definition at line 79 of file HoleSearchValidation.h.

m_trackStatsMutex

std::mutex InDet::HoleSearchValidation::m_trackStatsMutex

mutableprivate

Definition at line 117 of file HoleSearchValidation.h.

m_trtID

const TRT_ID* InDet::HoleSearchValidation::m_trtID

private

Definition at line 74 of file HoleSearchValidation.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:

• HoleSearchValidation.h
• HoleSearchValidation.cxx