#include <DivisiveMultiSeedFinder.h>

Inheritance diagram for InDet::DivisiveMultiSeedFinder:

Collaboration diagram for InDet::DivisiveMultiSeedFinder:

Public Member Functions
virtual StatusCode	initialize () override

	DivisiveMultiSeedFinder (const std::string &t, const std::string &n, const IInterface *p)
	Constructor and destructor. More...

	~DivisiveMultiSeedFinder ()

virtual std::vector< std::vector< const Trk::Track * > >	seeds (const std::vector< const Trk::Track * > &tracks) const override
	Clustering method itself. More...

virtual std::vector< std::vector< const Trk::TrackParameters * > >	seeds (const std::vector< const xAOD::TrackParticle * > &tracks) const override

ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard `StoreGateSvc` (event store) Returns (kind of) a pointer to the `StoreGateSvc`. More...

const ServiceHandle< StoreGateSvc > &	evtStore () const
	The standard `StoreGateSvc` (event store) Returns (kind of) a pointer to the `StoreGateSvc`. More...

const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard `StoreGateSvc/DetectorStore` Returns (kind of) a pointer to the `StoreGateSvc`. More...

virtual StatusCode	sysInitialize () override
	Perform system initialization for an algorithm. More...

virtual StatusCode	sysStart () override
	Handle START transition. More...

virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles. More...

virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles. More...

Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T > &t)

Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, SG::VarHandleKey &hndl, const std::string &doc, const SG::VarHandleKeyType &)
	Declare a new Gaudi property. More...

Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, SG::VarHandleBase &hndl, const std::string &doc, const SG::VarHandleType &)
	Declare a new Gaudi property. More...

Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, SG::VarHandleKeyArray &hndArr, const std::string &doc, const SG::VarHandleKeyArrayType &)

Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, T &property, const std::string &doc, const SG::NotHandleType &)
	Declare a new Gaudi property. More...

Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, T &property, const std::string &doc="none")
	Declare a new Gaudi property. More...

void	updateVHKA (Gaudi::Details::PropertyBase &)

MsgStream &	msg () const

MsgStream &	msg (const MSG::Level lvl) const

bool	msgLvl (const MSG::Level lvl) const

Static Public Member Functions
static const InterfaceID &	interfaceID ()
	AlgTool interface methods. More...

Protected Member Functions
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution More...

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

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

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

Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T > &hndl, const SG::VarHandleKeyArrayType &)
	specialization for handling Gaudi::Property<SG::VarHandleKeyArray> More...

Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T > &hndl, const SG::VarHandleType &)
	specialization for handling Gaudi::Property<SG::VarHandleBase> More...

Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T > &t, const SG::NotHandleType &)
	specialization for handling everything that's not a Gaudi::Property<SG::VarHandleKey> or a <SG::VarHandleKeyArray> More...

Private Attributes
double	m_sepDistance

unsigned int	m_nRemaining

bool	m_ignoreBeamSpot

ToolHandle< Trk::ITrackSelectorTool >	m_trkFilter

ToolHandle< InDetTrackZ0SortingTool >	m_sortingTool

ToolHandle< InDetTrackClusterCleaningTool >	m_cleaningTool

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

ToolHandle< Trk::IExtrapolator >	m_extrapolator

ToolHandle< Trk::IVertexSeedFinder >	m_vtxSeedFinder

StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default) More...

StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default) More...

std::vector< SG::VarHandleKeyArray * >	m_vhka

bool	m_varHandleArraysDeclared

Detailed Description

Definition at line 26 of file DivisiveMultiSeedFinder.h.

Member Typedef Documentation

◆ StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< AlgTool > >::StoreGateSvc_t

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ DivisiveMultiSeedFinder()

InDet::DivisiveMultiSeedFinder::DivisiveMultiSeedFinder	(	const std::string &	t,
		const std::string &	n,
		const IInterface *	p
	)

Constructor and destructor.

Definition at line 58 of file DivisiveMultiSeedFinder.cxx.

               :AthAlgTool(t,n,p), 
                m_sepDistance(0.5), 
                m_nRemaining(1),
                m_ignoreBeamSpot(false),
                m_extrapolator("Trk::Extrapolator"), 
                m_vtxSeedFinder("Trk::CrossDistancesSeedFinder")
  {
   declareInterface<IMultiPVSeedFinder>(this); 
   declareProperty("separationDistance",       m_sepDistance);
   declareProperty("nRemainTracks",            m_nRemaining);
   declareProperty("IgnoreBeamSpot", m_ignoreBeamSpot);
   
   //track filter
   declareProperty("TrackSelector",m_trkFilter);
     
   //sorting tool
   declareProperty("SortingTool", m_sortingTool);
  
   //cleaning tool
   declareProperty("CleaningTool", m_cleaningTool);
   
   //vertex finder tool (needed when no beam spot is available)
   declareProperty("VertexSeedFinder",m_vtxSeedFinder);
  
   //extrapolator
   declareProperty("Extrapolator",m_extrapolator);   
   
  }//end of constructor

◆ ~DivisiveMultiSeedFinder()

InDet::DivisiveMultiSeedFinder::~DivisiveMultiSeedFinder ( )

default

Member Function Documentation

◆ declareGaudiProperty() [1/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< AlgTool > >::declareGaudiProperty	(	Gaudi::Property< T > &	hndl,
		const SG::VarHandleKeyArrayType &
	)

inlineprivateinherited

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

Definition at line 170 of file AthCommonDataStore.h.

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

◆ declareGaudiProperty() [2/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< AlgTool > >::declareGaudiProperty	(	Gaudi::Property< T > &	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());
  
   }

◆ declareGaudiProperty() [3/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< AlgTool > >::declareGaudiProperty	(	Gaudi::Property< T > &	hndl,
		const SG::VarHandleType &
	)

inlineprivateinherited

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

Definition at line 184 of file AthCommonDataStore.h.

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

◆ declareGaudiProperty() [4/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< AlgTool > >::declareGaudiProperty	(	Gaudi::Property< T > &	t,
		const SG::NotHandleType &
	)

inlineprivateinherited

specialization for handling everything that's not a Gaudi::Property<SG::VarHandleKey> or a <SG::VarHandleKeyArray>

Definition at line 199 of file AthCommonDataStore.h.

   {
     return PBASE::declareProperty(t);
   }

◆ declareProperty() [1/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< AlgTool > >::declareProperty	(	const std::string &	name,
		SG::VarHandleBase &	hndl,
		const std::string &	doc,
		const SG::VarHandleType &
	)

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
hndl	Object holding the property value.
doc	Documentation string for the property.

This is the version for types that derive from SG::VarHandleBase. The property value object is put on the input and output lists as appropriate; then we forward to the base class.

Definition at line 245 of file AthCommonDataStore.h.

   {
     this->declare(hndl.vhKey());
     hndl.vhKey().setOwner(this);
  
     return PBASE::declareProperty(name,hndl,doc);
   }

◆ declareProperty() [2/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< AlgTool > >::declareProperty	(	const std::string &	name,
		SG::VarHandleKey &	hndl,
		const std::string &	doc,
		const SG::VarHandleKeyType &
	)

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
hndl	Object holding the property value.
doc	Documentation string for the property.

This is the version for types that derive from SG::VarHandleKey. The property value object is put on the input and output lists as appropriate; then we forward to the base class.

Definition at line 221 of file AthCommonDataStore.h.

   {
     this->declare(hndl);
     hndl.setOwner(this);
  
     return PBASE::declareProperty(name,hndl,doc);
   }

◆ declareProperty() [3/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< AlgTool > >::declareProperty	(	const std::string &	name,
		SG::VarHandleKeyArray &	hndArr,
		const std::string &	doc,
		const SG::VarHandleKeyArrayType &
	)

inlineinherited

Definition at line 259 of file AthCommonDataStore.h.

   {
  
     // std::ostringstream ost;
     // ost << Algorithm::name() << " VHKA declareProp: " << name 
     //     << " size: " << hndArr.keys().size() 
     //     << " mode: " << hndArr.mode() 
     //     << "  vhka size: " << m_vhka.size()
     //     << "\n";
     // debug() << ost.str() << endmsg;
  
     hndArr.setOwner(this);
     m_vhka.push_back(&hndArr);
  
     Gaudi::Details::PropertyBase* p =  PBASE::declareProperty(name, hndArr, doc);
     if (p != 0) {
       p->declareUpdateHandler(&AthCommonDataStore<PBASE>::updateVHKA, this);
     } else {
       ATH_MSG_ERROR("unable to call declareProperty on VarHandleKeyArray " 
                     << name);
     }
  
     return p;
  
   }

◆ declareProperty() [4/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< AlgTool > >::declareProperty	(	const std::string &	name,
		T &	property,
		const std::string &	doc,
		const SG::NotHandleType &
	)

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
property	Object holding the property value.
doc	Documentation string for the property.

This is the generic version, for types that do not derive from SG::VarHandleKey. It just forwards to the base class version of declareProperty.

Definition at line 333 of file AthCommonDataStore.h.

   {
     return PBASE::declareProperty(name, property, doc);
   }

◆ declareProperty() [5/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< AlgTool > >::declareProperty	(	const std::string &	name,
		T &	property,
		const std::string &	doc = `"none"`
	)

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
property	Object holding the property value.
doc	Documentation string for the property.

This dispatches to either the generic declareProperty or the one for VarHandle/Key/KeyArray.

Definition at line 352 of file AthCommonDataStore.h.

   {
     typedef typename SG::HandleClassifier<T>::type htype;
     return declareProperty (name, property, doc, htype());
   }

◆ declareProperty() [6/6]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< AlgTool > >::declareProperty ( Gaudi::Property< T > & 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< AlgTool > >::detStore ( ) const

inlineinherited

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

Definition at line 95 of file AthCommonDataStore.h.

95 { return m_detStore; }

◆ evtStore() [1/2]

ServiceHandle<StoreGateSvc>& AthCommonDataStore< AthCommonMsg< AlgTool > >::evtStore ( )

inlineinherited

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

Definition at line 85 of file AthCommonDataStore.h.

85 { return m_evtStore; }

◆ evtStore() [2/2]

const ServiceHandle<StoreGateSvc>& AthCommonDataStore< AthCommonMsg< AlgTool > >::evtStore ( ) const

inlineinherited

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

Definition at line 90 of file AthCommonDataStore.h.

90 { return m_evtStore; }

◆ extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::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

◆ initialize()

StatusCode InDet::DivisiveMultiSeedFinder::initialize ( )

overridevirtual

Definition at line 19 of file DivisiveMultiSeedFinder.cxx.

  {
  
   if(m_trkFilter.retrieve().isFailure())
   {
    ATH_MSG_ERROR("Unable to retrieve "<<m_trkFilter);
    return StatusCode::FAILURE;
   }
    
   if(m_sortingTool.retrieve().isFailure())
   {
    ATH_MSG_ERROR("Unable to retrieve "<<m_sortingTool);
    return StatusCode::FAILURE;
   }
   
   if(m_vtxSeedFinder.retrieve().isFailure())
   {
    ATH_MSG_ERROR("Unable to retrieve " << m_vtxSeedFinder);
    return StatusCode::FAILURE;
   }
  
   if(m_cleaningTool.retrieve().isFailure())
   {
    ATH_MSG_ERROR("Unable to retrieve "<<m_cleaningTool);
    return StatusCode::FAILURE;
   }
    
   ATH_CHECK(m_beamSpotKey.initialize());
    
   if ( m_extrapolator.retrieve().isFailure() ) 
   {                              
    ATH_MSG_ERROR("Failed to retrieve tool " << m_extrapolator);
    return StatusCode::FAILURE;                                                  
   }
    
   return StatusCode::SUCCESS;
  }//end of initialize method

◆ inputHandles()

virtual std::vector<Gaudi::DataHandle*> AthCommonDataStore< AthCommonMsg< AlgTool > >::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.

◆ interfaceID()

static const InterfaceID& InDet::IMultiPVSeedFinder::interfaceID ( )

inlinestaticinherited

AlgTool interface methods.

Definition at line 48 of file IMultiPVSeedFinder.h.

48 { return IID_IMultiPVSeedFinder; };

◆ msg() [1/2]

MsgStream& AthCommonMsg< AlgTool >::msg ( ) const

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                 {
     return this->msgStream();
   }

◆ msg() [2/2]

MsgStream& AthCommonMsg< AlgTool >::msg ( const MSG::Level lvl ) const

inlineinherited

Definition at line 27 of file AthCommonMsg.h.

                                                   {
     return this->msgStream(lvl);
   }

◆ msgLvl()

bool AthCommonMsg< AlgTool >::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< AlgTool > >::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< AlgTool > >::renounce ( T & h )

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

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

◆ renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                           {
     handlesArray.renounce();
   }

◆ seeds() [1/2]

std::vector< std::vector< const Trk::Track * > > InDet::DivisiveMultiSeedFinder::seeds ( const std::vector< const Trk::Track * > & tracks ) const

overridevirtual

Clustering method itself.

Implements InDet::IMultiPVSeedFinder.

Definition at line 91 of file DivisiveMultiSeedFinder.cxx.

  {
   const EventContext& ctx = Gaudi::Hive::currentContext();
  
   //step 1: preselection
   std::vector<const Trk::Track*> preselectedTracks(0);
   std::vector<const Trk::Track*>::const_iterator tr = tracks.begin();
   std::vector<const Trk::Track*>::const_iterator tre = tracks.end(); 
   
   SG::ReadCondHandle<InDet::BeamSpotData> beamSpotHandle { m_beamSpotKey, ctx};
   Trk::RecVertex beamrecposition(beamSpotHandle->beamVtx());  
   for(;tr!=tre;++tr) if(m_trkFilter->decision(**tr,&beamrecposition)) preselectedTracks.push_back(*tr);
   ATH_MSG_DEBUG("Beam spot position is: "<< beamrecposition.position());
   Trk::Vertex* beamposition=&beamrecposition;
  
   Trk::Vertex myVertex;
   if (m_ignoreBeamSpot)
   {
     myVertex = Trk::Vertex(m_vtxSeedFinder->findSeed(tracks));
     ATH_MSG_DEBUG(" vtx seed x: " << myVertex.position().x() <<
           " vtx seed y: " << myVertex.position().y() <<
           " vtx seed z: " << myVertex.position().z());
     beamposition = &myVertex;
   }
  
   //step 2: sorting in z0
   //output container
   std::vector< std::vector<const Trk::Track *> > result(0);
   if(!preselectedTracks.empty())
   {
    std::vector<int> indexOfSorted = m_sortingTool->sortedIndex(preselectedTracks, beamposition);
  
    //step 3 preclustering
    std::vector< std::vector<const Trk::Track *> > preClusters(0);
  
    //left-handed track position
    std::vector<const Trk::Track *> tmp_cluster(0); 
    
    Trk::PerigeeSurface perigeeSurface(beamposition->position());
  
    const Trk::TrackParameters* exPerigee =
      m_extrapolator
        ->extrapolateTrack(ctx, *preselectedTracks[indexOfSorted[0]], perigeeSurface, Trk::anyDirection, true, Trk::pion)
        .release();
  
    double lastTrackZ0  = -999.;
    if(exPerigee) { lastTrackZ0 = exPerigee->parameters()[Trk::z0]; delete exPerigee; }
    else
    {
      ATH_MSG_WARNING("Impossible to extrapolate the first track; returning 0 container for this event");
      return result;
    }
  
    //looping over container
    for(int i : indexOfSorted)
    {
      const Trk::TrackParameters* lexPerigee =
        m_extrapolator
        ->extrapolateTrack(ctx, *preselectedTracks[i], perigeeSurface, Trk::anyDirection, true, Trk::pion)
        .release();
  
      double currentTrackZ0 = lexPerigee->parameters()[Trk::z0];
      delete lexPerigee;
  
      if (std::fabs(currentTrackZ0 - lastTrackZ0) < m_sepDistance) {
        // the distance is below separation, adding to the same cluster
        tmp_cluster.push_back(preselectedTracks[i]);
      }else{
        //the distance is above separation, starting new cluster
        preClusters.push_back(tmp_cluster);
        tmp_cluster.clear();
        tmp_cluster.push_back(preselectedTracks[i]);
      }//end of gap size check
      lastTrackZ0 = currentTrackZ0;
    }//end of loop over the sorted container
  
    //storing the last (or the only cluster)
    preClusters.push_back(tmp_cluster);
  
    //step 4 iterative cleaning of clusters
    for(const auto & preCluster : preClusters)
    {    
     //------------------------------Debug code -------------------------------------------------------
     /*    std::vector<const Trk::Track *>::const_iterator cb = i->begin();
       std::vector<const Trk::Track *>::const_iterator ce = i->end();
       std::cout<<"*********Starting next cluster of size "<<i->size()<<std::endl;
       for(;cb!=ce;++cb)
       {
       std::cout<<"Track Z0 in cluster: "<<(*cb)->perigeeParameters()->parameters()[Trk::z0]<<std::endl;
       }//end of loop over the cluster entries
     */
     //-------------------------------end of debug code-------------------------------------------------
  
     if(preCluster.size()>m_nRemaining){
      //iterative cleaning until outlying tracks remain
      std::vector<const Trk::Track *> tracks_to_clean = preCluster;  
      bool clean_again = false;
      do {
       std::pair<std::vector<const Trk::Track *>, std::vector<const Trk::Track *> > clusterAndOutl = 
     m_cleaningTool->clusterAndOutliers(tracks_to_clean, beamposition);
       
       //if core size is miningfull, storing it
       std::vector<const Trk::Track *> core_cluster = clusterAndOutl.first;
       std::vector<const Trk::Track *> core_outl = clusterAndOutl.second;    
       
       //--------------Debug output-----------------------------------------------------
       //      std::cout<<"Cleaning iteration "<<clean_count<<std::endl;
       //      std::cout<<"Reduced cluster size: "<<core_cluster.size()<<std::endl;
       //      std::cout<<"Outliers size:        "<<core_outl.size()<<std::endl;
       //      ++clean_count;
       //-------------------End of debug output -----------------------------------------
  
       if(core_cluster.empty()){
        ATH_MSG_DEBUG("Core cluster has 0 size, remaining tracks are discarded.");
        clean_again = false;
       }else{
        //storing clusters with >1 track (optional)
        if(core_cluster.size()>1) result.push_back(core_cluster);    
  
        //checking the outliers, whether more cleaning is to be done
        if(core_outl.size()>m_nRemaining){
         clean_again = true;
         tracks_to_clean.clear();
         tracks_to_clean = core_outl;
        }else if(core_outl.size()>1){
         clean_again = false;
         ATH_MSG_DEBUG("There were remaining outliers of size: "<< core_outl.size());
         ATH_MSG_DEBUG("Not evident, whether these tracks form a cluster. Rejected...");
        }else  clean_again = false;//end of outlier size check  
       }//end of core cluster 0 check   
  
      }while(clean_again);//end of loop
               
     }else if(preCluster.size()==2){
      //case of two track cluster. accepting without cleaning
      result.push_back(preCluster);
     }//end of cluster size check
    }//end of loop over all the clusters
   }//end of preselection size check
  
   return result;  
  }//end of clustering method

◆ seeds() [2/2]

std::vector< std::vector< const Trk::TrackParameters * > > InDet::DivisiveMultiSeedFinder::seeds ( const std::vector< const xAOD::TrackParticle * > & tracks ) const

overridevirtual

Implements InDet::IMultiPVSeedFinder.

Definition at line 234 of file DivisiveMultiSeedFinder.cxx.

  {
   const EventContext& ctx = Gaudi::Hive::currentContext();
   
   //step 1: preselection 
   std::vector<const xAOD::TrackParticle*> preselectedTracks(0);
   
   //selecting with respect to the beam spot
   xAOD::Vertex beamposition;
   SG::ReadCondHandle<InDet::BeamSpotData> beamSpotHandle { m_beamSpotKey,ctx };
   beamposition.setPosition(beamSpotHandle->beamVtx().position());
   beamposition.setCovariancePosition(beamSpotHandle->beamVtx().covariancePosition());
  
   for (const auto *track : tracks) {
    if (m_trkFilter->decision(*track,&beamposition)) preselectedTracks.push_back(track);
   }
  
   std::vector<const Trk::TrackParameters*> perigeeList;
   std::vector<const xAOD::TrackParticle*>::const_iterator trackBegin=tracks.begin();
   std::vector<const xAOD::TrackParticle*>::const_iterator trackEnd=tracks.end();
   for (std::vector<const xAOD::TrackParticle*>::const_iterator trackIter=trackBegin;trackIter!=trackEnd;++trackIter){
    perigeeList.push_back(&((*trackIter)->perigeeParameters()));
   }
  
   Trk::RecVertex myVertex (m_vtxSeedFinder->findSeed(perigeeList));
  
   if (m_ignoreBeamSpot) {
    ATH_MSG_DEBUG(" vtx seed x: " << myVertex.position().x() <<
          " vtx seed y: " << myVertex.position().y() <<
          " vtx seed z: " << myVertex.position().z());
    beamposition.setPosition(myVertex.position());
    beamposition.setCovariancePosition(myVertex.covariancePosition());
   }
  
   //step 2: sorting in z0
   //output container
   std::vector< std::vector<const Trk::TrackParameters *> > result(0);
   if(!preselectedTracks.empty()){
    std::vector<int> indexOfSorted =  m_sortingTool->sortedIndex(preselectedTracks, &beamposition);
  
    //need new sort method, either for xAODTrackParticles, or TrackParameters. Neither currently supported...
  
    //step 3 preclustering
    std::vector< std::vector<const xAOD::TrackParticle *> > preClusters(0);
  
    //left-handed track position
    std::vector<const xAOD::TrackParticle *> tmp_cluster(0); 
    
    Trk::PerigeeSurface perigeeSurface(beamposition.position());
    const Trk::TrackParameters* exPerigee =
      m_extrapolator
        ->extrapolate(ctx, preselectedTracks[indexOfSorted[0]]->perigeeParameters(), 
                      perigeeSurface, Trk::anyDirection, true, Trk::pion)
        .release();
  
    double lastTrackZ0 = -999.;
    if(exPerigee){
     lastTrackZ0 = exPerigee->parameters()[Trk::z0];delete exPerigee;
    }
    else{
     ATH_MSG_WARNING("Impossible to extrapolate the first track; returning 0 container for this event");
     return result;
    }
  
    //looping over container
    for(int i : indexOfSorted){
     const Trk::TrackParameters* lexPerigee =
       m_extrapolator->extrapolate(ctx, preselectedTracks[i]->perigeeParameters(),
                   perigeeSurface, Trk::anyDirection, true, Trk::pion).release();
  
     double currentTrackZ0 = lexPerigee->parameters()[Trk::z0];
     delete lexPerigee;
  
     if (std::fabs(currentTrackZ0 - lastTrackZ0) < m_sepDistance) {
      // the distance is below separation, adding to the same cluster
       tmp_cluster.push_back(preselectedTracks[i]);
     }else{
       //the distance is above separation, starting new cluster
       preClusters.push_back(tmp_cluster);
       tmp_cluster.clear();
       tmp_cluster.push_back(preselectedTracks[i]);
     }//end of gap size check
  
     lastTrackZ0 = currentTrackZ0;
    }//end of loop over the sorted container
    
    //storing the last (or the only) cluster   
    preClusters.push_back(tmp_cluster);
    ATH_MSG_DEBUG("The preselection returns clusters: "<<preClusters.size());
    
    //step 4 iterative cleaning of clusters
    for(const auto & preCluster : preClusters){
  
     //------------------------------Debug code -------------------------------------------------------
     /*    std::vector<const Trk::Track *>::const_iterator cb = i->begin();
       std::vector<const Trk::Track *>::const_iterator ce = i->end();
       std::cout<<"*********Starting next cluster of size "<<i->size()<<std::endl;
       for(;cb!=ce;++cb)
       {
       std::cout<<"Track Z0 in cluster: "<<(*cb)->perigeeParameters()->parameters()[Trk::z0]<<std::endl;
       }//end of loop over the cluster entries
     */
     //-------------------------------end of debug code-------------------------------------------------
    
     if(preCluster.size()>m_nRemaining){
      //iterative cleaning until outlying tracks remain
      std::vector<const xAOD::TrackParticle *> tracks_to_clean = preCluster;  
      bool clean_again = false;
      do{
       std::pair<std::vector<const Trk::TrackParameters *>, 
         std::vector<const xAOD::TrackParticle *> > clusterAndOutl = m_cleaningTool->clusterAndOutliers(tracks_to_clean, &beamposition);
  
       //if core size is miningfull, storing it
       std::vector<const Trk::TrackParameters *> core_cluster = clusterAndOutl.first;
       std::vector<const xAOD::TrackParticle *> core_outl = clusterAndOutl.second;    
  
       //--------------Debug output-----------------------------------------------------
       //      std::cout<<"Cleaning iteration "<<clean_count<<std::endl;
       //      std::cout<<"Reduced cluster size: "<<core_cluster.size()<<std::endl;
       //      std::cout<<"Outliers size:        "<<core_outl.size()<<std::endl;
       //      ++clean_count;
       //-------------------End of debug output -----------------------------------------
  
       if(core_cluster.empty()){
        ATH_MSG_DEBUG("Core cluster has 0 size, remaining tracks are discarded.");
        clean_again = false;
       }else{
        //storing clusters with >1 track (optional)
        if(core_cluster.size()>1) result.push_back(core_cluster);
  
        //checking the outliers, whether more cleaning is to be done
        if(core_outl.size()>m_nRemaining){
     clean_again = true;
     tracks_to_clean.clear();
     tracks_to_clean = core_outl;
        }else if(core_outl.size()>1){
     clean_again = false;
     ATH_MSG_DEBUG("There were remaining outliers of size: "<< core_outl.size());
     ATH_MSG_DEBUG("Not evident, whether these tracks form a cluster. Rejected...");
        }else clean_again = false;//end of outlier size check
       }//end of core cluster 0 check   
  
      }while(clean_again);//end of loop
  
     }else if(preCluster.size()==2){
      //case of two track cluster. accepting without cleaning
      std::vector<const Trk::TrackParameters *> twotrack;
      twotrack.push_back(&(preCluster[0]->perigeeParameters()));
      twotrack.push_back(&(preCluster[1]->perigeeParameters()));
      result.push_back(twotrack);
     }//end of cluster size check
    }//end of loop over all the clusters
   }//end of preselection size check 
   return result;
     
  }

◆ sysInitialize()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::sysInitialize ( )

overridevirtualinherited

Perform system initialization for an algorithm.

We override this to declare all the elements of handle key arrays at the end of initialization. See comments on updateVHKA.

Reimplemented in DerivationFramework::CfAthAlgTool, AthCheckedComponent< AthAlgTool >, AthCheckedComponent<::AthAlgTool >, and asg::AsgMetadataTool.

◆ sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::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< AlgTool > >::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_beamSpotKey

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

private

Definition at line 73 of file DivisiveMultiSeedFinder.h.

◆ m_cleaningTool

ToolHandle<InDetTrackClusterCleaningTool> InDet::DivisiveMultiSeedFinder::m_cleaningTool

private

Definition at line 70 of file DivisiveMultiSeedFinder.h.

◆ m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

◆ m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

◆ m_extrapolator

ToolHandle<Trk::IExtrapolator> InDet::DivisiveMultiSeedFinder::m_extrapolator

private

Definition at line 75 of file DivisiveMultiSeedFinder.h.

◆ m_ignoreBeamSpot

bool InDet::DivisiveMultiSeedFinder::m_ignoreBeamSpot

private

Definition at line 56 of file DivisiveMultiSeedFinder.h.

◆ m_nRemaining

unsigned int InDet::DivisiveMultiSeedFinder::m_nRemaining

private

Definition at line 54 of file DivisiveMultiSeedFinder.h.

◆ m_sepDistance

double InDet::DivisiveMultiSeedFinder::m_sepDistance

private

Definition at line 52 of file DivisiveMultiSeedFinder.h.

◆ m_sortingTool

ToolHandle<InDetTrackZ0SortingTool> InDet::DivisiveMultiSeedFinder::m_sortingTool

private

Definition at line 67 of file DivisiveMultiSeedFinder.h.

◆ m_trkFilter

ToolHandle<Trk::ITrackSelectorTool> InDet::DivisiveMultiSeedFinder::m_trkFilter

private

Definition at line 64 of file DivisiveMultiSeedFinder.h.

◆ m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< AlgTool > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

◆ m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< AlgTool > >::m_vhka

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

◆ m_vtxSeedFinder

ToolHandle<Trk::IVertexSeedFinder> InDet::DivisiveMultiSeedFinder::m_vtxSeedFinder

private

Definition at line 78 of file DivisiveMultiSeedFinder.h.

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

Public Member Functions

Static Public Member Functions

Protected Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ StoreGateSvc_t

Constructor & Destructor Documentation

◆ DivisiveMultiSeedFinder()

◆ ~DivisiveMultiSeedFinder()

Member Function Documentation

◆ declareGaudiProperty() [1/4]

◆ declareGaudiProperty() [2/4]

◆ declareGaudiProperty() [3/4]

◆ declareGaudiProperty() [4/4]

◆ declareProperty() [1/6]

◆ declareProperty() [2/6]

◆ declareProperty() [3/6]

◆ declareProperty() [4/6]

◆ declareProperty() [5/6]

◆ declareProperty() [6/6]

◆ detStore()

◆ evtStore() [1/2]

◆ evtStore() [2/2]

◆ extraDeps_update_handler()

◆ initialize()

◆ inputHandles()

◆ interfaceID()

◆ msg() [1/2]

◆ msg() [2/2]

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ seeds() [1/2]

◆ seeds() [2/2]

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

Member Data Documentation

◆ m_beamSpotKey

◆ m_cleaningTool

◆ m_detStore

◆ m_evtStore

◆ m_extrapolator

◆ m_ignoreBeamSpot

◆ m_nRemaining

◆ m_sepDistance

◆ m_sortingTool

◆ m_trkFilter

◆ m_varHandleArraysDeclared

◆ m_vhka

◆ m_vtxSeedFinder