#include <PixelGangedAmbiguitiesFinder.h>

Inheritance diagram for InDet::PixelGangedAmbiguitiesFinder:

Collaboration diagram for InDet::PixelGangedAmbiguitiesFinder:

Public Member Functions
	PixelGangedAmbiguitiesFinder (const std::string &type, const std::string &name, const IInterface *parent)

	~PixelGangedAmbiguitiesFinder ()=default

virtual StatusCode	initialize ()

void	execute (PixelClusterCollection *collection, PixelGangedClusterAmbiguities &map) const

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 ()

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 InDetDD::SiDetectorElement	SiDetectorElement

typedef InDetDD::SiLocalPosition	SiLocalPosition

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

Static Private Member Functions
static bool	isGanged (const Identifier &rdoID, const InDetDD::SiDetectorElement *element, Identifier &gangedID)

Private Attributes
BooleanProperty	m_internalSolving {this, "InternalSolving", false, "Standalone resolution of ganged pixel ambiguities"}

SG::ReadCondHandleKey< InDetDD::SiDetectorElementCollection >	m_pixelDetEleCollKey {this, "PixelDetEleCollKey", "PixelDetectorElementCollection", "Key of SiDetectorElementCollection for Pixel"}

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 39 of file PixelGangedAmbiguitiesFinder.h.

Member Typedef Documentation

◆ SiDetectorElement

typedef InDetDD::SiDetectorElement InDet::PixelGangedAmbiguitiesFinder::SiDetectorElement

private

Definition at line 65 of file PixelGangedAmbiguitiesFinder.h.

◆ SiLocalPosition

typedef InDetDD::SiLocalPosition InDet::PixelGangedAmbiguitiesFinder::SiLocalPosition

private

Definition at line 66 of file PixelGangedAmbiguitiesFinder.h.

◆ StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ PixelGangedAmbiguitiesFinder()

InDet::PixelGangedAmbiguitiesFinder::PixelGangedAmbiguitiesFinder	(	const std::string &	type,
		const std::string &	name,
		const IInterface *	parent
	)

Definition at line 32 of file PixelGangedAmbiguitiesFinder.cxx.

                                                :
   AthAlgTool(type,name,parent)
 { 
   declareInterface<PixelGangedAmbiguitiesFinder>(this);
 } 

◆ ~PixelGangedAmbiguitiesFinder()

InDet::PixelGangedAmbiguitiesFinder::~PixelGangedAmbiguitiesFinder ( )

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

◆ execute()

void InDet::PixelGangedAmbiguitiesFinder::execute	(	PixelClusterCollection *	collection,
		PixelGangedClusterAmbiguities &	map
	)		const

Definition at line 54 of file PixelGangedAmbiguitiesFinder.cxx.

                                                                           {
     if (collection->size()<2) return;
  
     ATH_MSG_DEBUG(collection->size() << " clusters");
     ATH_MSG_DEBUG("The map has " << theMap.size() << " entries already");
  
     IdentifierHash elementHash = collection->identifyHash();
  
     // Get detector info.
     // Find detector element for these RDOs
  
     SG::ReadCondHandle<InDetDD::SiDetectorElementCollection> pixelDetEleHandle(m_pixelDetEleCollKey);
     const InDetDD::SiDetectorElementCollection* pixelDetEle(*pixelDetEleHandle);
     if (not pixelDetEleHandle.isValid() or pixelDetEle==nullptr) {
       ATH_MSG_FATAL(m_pixelDetEleCollKey.fullKey() << " is not available.");
       return;
     }
     const InDetDD::SiDetectorElement* element = pixelDetEle->getDetectorElement(elementHash);
     const InDetDD::PixelModuleDesign* design =(dynamic_cast<const InDetDD::PixelModuleDesign*>(&element->design()));
       if (not design){
             ATH_MSG_ERROR("Dynamic cast failed at line "<<__LINE__<<" of PixelGangedAmbiguitiesFinder.cxx.");
             return;
       }
     int rowsPerFE = design->rows()/2;
     const auto *pHelper = element->getIdHelper();
     if (pHelper->helper() != AtlasDetectorID::HelperType::Pixel){
             ATH_MSG_ERROR("The helper type is not Pixel at line "<<__LINE__<<" of PixelGangedAmbiguitiesFinder.cxx.");
             return;
       }
       const PixelID* pixelID =static_cast<const PixelID*>(pHelper);
     //Pointer list of clusters to be removed
     std::vector<PixelClusterCollection::iterator> rmList;
  
     PixelClusterCollection::iterator cluster=collection->begin();
     PixelClusterCollection::iterator clend=collection->end();
  
     for( ; cluster!=clend ; ++cluster){
       // check if cluster has not already been flagged to be deleted
       if ( find(rmList.begin(),rmList.end(),cluster)!=rmList.end() ) continue;
  
       // extract from the list of cluster rdo the ganged ones.      
       bool hasGanged = false;
       int rmin1=999, cmin1=999; // bottom left corner of cluster
       std::vector<Identifier> gangedPixels;
       const std::vector<Identifier>& RDOs = (*cluster)->rdoList();
  
       std::vector<Identifier>::const_iterator rdo=RDOs.begin();
       std::vector<Identifier>::const_iterator rdoend=RDOs.end();      
       for( ; rdo != rdoend; ++rdo){
         Identifier gangedID;
         bool ganged = isGanged(*rdo,element,gangedID);
         if(ganged){
           hasGanged = true;
           gangedPixels.push_back(gangedID);
           }
         int thiscol=pixelID->eta_index(*rdo);
         if (thiscol<cmin1) cmin1=thiscol;
         int thisrow=pixelID->phi_index(*rdo);
         if (thisrow<rmin1) rmin1=thisrow;
  
       }
       
       // set ganged pixels flag
       (*cluster)->setGangedPixel(hasGanged);
       // find out if any other cluster shares any of the ganged pixels
  
       if(hasGanged){
  
     ATH_MSG_DEBUG("Ganged pixel, find combi...");
     std::vector<Identifier>::const_iterator gangedPixelsBegin = gangedPixels.begin();
     std::vector<Identifier>::const_iterator gangedPixelsEnd = gangedPixels.end();
     PixelClusterCollection::iterator cluster2=cluster+1;
     for( ; cluster2!=clend; ++cluster2){
           ATH_MSG_DEBUG("Comparing " 
                         << std::hex << (*cluster)->identify() 
                         << " and " << (*cluster2)->identify()
                         << std::dec);
       bool sharedGanged = false;
           int rmin2=999, cmin2=999; // bottom left corner of cluster2
       const std::vector<Identifier>& rdos2 = (*cluster2)->rdoList();
       std::vector<Identifier>::const_iterator rdo2=rdos2.begin();
       std::vector<Identifier>::const_iterator rdo2end=rdos2.end();
       for( ; rdo2!=rdo2end; ++rdo2) {
             if (!sharedGanged) {
         for( std::vector<Identifier>::const_iterator gangedRDOs=gangedPixelsBegin;
          gangedRDOs < gangedPixelsEnd; ++gangedRDOs ){
           if(*rdo2 == *gangedRDOs){
         sharedGanged = true;
         break;
           }
         }
             }
             int thiscol=pixelID->eta_index(*rdo2);
             if (thiscol<cmin2) cmin2=thiscol;
             int thisrow=pixelID->phi_index(*rdo2);
             if (thisrow<rmin2) rmin2=thisrow;
         //if ( sharedGanged ) break;
       }
   
       if(sharedGanged){
         // ganged clusters with just one row are likely to
         // be fake if the ganged image of the same pixel is
         // part of a cluster with more rows. 
             int drow1=lrint((**cluster).width().colRow().x() );
             int drow2=lrint((**cluster2).width().colRow().x() );
             int dcol1=lrint((**cluster).width().colRow().y() );
             int dcol2=lrint((**cluster2).width().colRow().y() );
  
             //std::cout << "drow1: " << drow1 << " drow2: " << drow2 << " dcol1: " << dcol1 << " dcol2: " << dcol2 << " isfake1: " << (*cluster)->isFake() << " isfake2: " << (*cluster2)->isFake() << std::endl; 
         if ( (drow1==1 && drow2>1 && drow2<4) || (dcol2>dcol1 && cmin2<=cmin1 && cmin2+dcol2>=cmin1+dcol1)){ 
           // cluster 1 is likely to be fake
           if (m_internalSolving) {
         rmList.push_back(cluster);
         ATH_MSG_DEBUG(std::hex 
                               << ": deleted " << (*cluster)->identify() 
                               << std::dec);
         break;
           }
           else (*cluster)->setFake(true);
         }
         else if ( (drow1>1 && drow1<4 && drow2==1) || (dcol1>dcol2 && cmin1<=cmin2 && cmin1+dcol1>=cmin2+dcol2)){
           // cluster 2 is likely to be fake
           if (m_internalSolving) {
         rmList.push_back(cluster2);
         ATH_MSG_DEBUG(std::hex 
                               << ": deleted " << (*cluster2)->identify() 
                               << std::dec);
         continue;
           }
           else (*cluster2)->setFake(true);
         } 
             else if ( drow2>1 || drow1>1 ) { 
               if (cmin1==cmin2){
                 rdo=RDOs.begin();
                 std::vector<std::vector<int> > myvec(dcol1);
                 for( ; rdo != rdoend; ++rdo){
                   int row=pixelID->phi_index(*rdo);
                   int col=pixelID->eta_index(*rdo);
                   myvec[col-cmin1].push_back(row);
                 }
                 rdo=rdos2.begin();
                 int dcol2=lrint((**cluster2).width().colRow().y() );
                 std::vector<std::vector<int> > myvec2(dcol2);
                 for( ; rdo != rdo2end; ++rdo){
                   int row=pixelID->phi_index(*rdo);
                   int col=pixelID->eta_index(*rdo);
                   myvec2[col-cmin2].push_back(row);
                 }
                 for (auto & i : myvec) if (!i.empty()) std::sort(i.begin(),i.end());
                 for (auto & i : myvec2) if (!i.empty()) std::sort(i.begin(),i.end());
                 int nvictory1=0,nvictory2=0;
                 for (int i=0;i<(int)myvec.size();i++){
                   int maxsize1=0,maxsize2=0,maxsizeleft1=0,maxsizeright1=0,maxsizeleft2=0,maxsizeright2=0,thissize=0,thissizeright=0;
                   bool hasgap1=false,hasgap2=false;
                   for (int j=0;j<(int)myvec[i].size();j++){
                     if (j!=0 && thissize==0) hasgap1=true;   // there is a gap between the pixels in this column
  
                     thissize++;
                     if (myvec[i][j]>=rowsPerFE) thissizeright++;
  
                     if (thissize>maxsize1) maxsize1=thissize;
                     if (myvec[i][j]<rowsPerFE && thissize>maxsizeleft1) maxsizeleft1=thissize;
                     if (myvec[i][j]>=rowsPerFE && thissizeright>maxsizeright1) maxsizeright1=thissizeright;
                     if (j==(int)myvec[i].size()-1 || myvec[i][j+1]!=myvec[i][j]+1) thissize=thissizeright=0;
                   }
                   thissize=thissizeright=0;
                   for (int j=0;j<(int)myvec2[i].size();j++){
                     if (j!=0 && thissize==0) hasgap2=true;
                     thissize++;
                     if (myvec2[i][j]>=rowsPerFE) thissizeright++;
                     if (thissize>maxsize2) maxsize2=thissize;
                     if (myvec2[i][j]<rowsPerFE && thissize>maxsizeleft2) maxsizeleft2=thissize;
                     if (myvec2[i][j]>=rowsPerFE && thissizeright>maxsizeright2) maxsizeright2=thissizeright;
                     if (j==(int)myvec2[i].size()-1 || myvec2[i][j+1]!=myvec2[i][j]+1) thissize=thissizeright=0;
                     
                   }
                   //std::cout << "maxsize1: " << maxsize1 << " maxsize2: " << maxsize2 << " hasgap1: " << hasgap1 << " hasgap2: " << hasgap2 << std::endl; 
                   if (maxsize1>maxsize2 && maxsizeleft1>=maxsizeleft2 && maxsizeright1>=maxsizeright2 && !hasgap1) nvictory1++;
                   else if (maxsize2>maxsize1 && maxsizeleft2>=maxsizeleft1 && maxsizeright2>=maxsizeright1 && !hasgap2) nvictory2++;
                 }
                 //std::cout << "nvictory1: " << nvictory1 << " nvictory2: " << nvictory2 << std::endl;
  
                 // check if fake image of big clusters in ganged region
             //if ( (rmin1<rmin2 && (rmin2+drow2-1)<rowsPerFE )
         //   || (rmin1>rmin2 && rmin2>=rowsPerFE ) ) {
                 if (nvictory1>nvictory2){
                   // cluster 2 is likely to be fake
                   if (m_internalSolving) {
                     rmList.push_back(cluster2);
                     ATH_MSG_DEBUG(std::hex
                                   << ": deleted " << (*cluster2)->identify()
                                   << std::dec);
                     continue;
                   }
                   else {
                     (*cluster2)->setFake(true);
                     //std::cout << "cluster2 fake!" << std::endl;
                   }
                 }
                 else if (nvictory2>nvictory1){
           // cluster 1 is likely to be fake
           if (m_internalSolving) {
             rmList.push_back(cluster);
             ATH_MSG_DEBUG(std::hex 
                                   << ": deleted " << (*cluster)->identify() 
                                   << std::dec);
                     continue;
                   }
                   else {
                     (*cluster)->setFake(true);
                     //std::cout << "cluster1 fake!" << std::endl;
                   }
                 }  
               }
             }
         // this point is reached:
         // - always if m_internalSolving is false
         // - in case no cluster could be removed
         // in both cases the clusters are flagged as ambiguous
         // and an entry in the ambiguity map is added. 
  
             //GP: temporary not optimal solution not to flag two 
             //subclusters within a cluster as ganged to each other
             //TO BE FIXED WITH A BETTER TREATMENT
             if (!((*cluster)->isSplit() && (*cluster2)->isSplit()))
             {
               (*cluster)->setAmbiguous(true);
               (*cluster2)->setAmbiguous(true);
               // a map is a sorted container with the first element
               // of the pair as key, for efficient lookup (~logN) need
               // to add both permutations
               theMap.insert(std::make_pair(*cluster,*cluster2));
               theMap.insert(std::make_pair(*cluster2,*cluster));
               ATH_MSG_DEBUG(std::hex 
                             << ": added ambiguity entry"
                             << std::dec);
             }
       }
     }
       }
     }
     ATH_MSG_DEBUG("The map has " << theMap.size() << " entries ");
  
     // to remove clusters from the collection, the vector of iterators need to be 
     // sorted. Moreover, when preceeding iterators are removed, one must take into
     // account the iterator position is changed.
     int rmNumber=0;
     std::vector<PixelClusterCollection::iterator>::iterator rmit=rmList.begin();
     std::vector<PixelClusterCollection::iterator>::iterator rmend=rmList.end();
     std::sort(rmit,rmend);
     for ( ; rmit!=rmend ; ++rmit){
       ATH_MSG_DEBUG("Removed " << rmNumber+1 << " cluster: "  
                     << std::hex << (*(*rmit-rmNumber))->identify() << std::dec);
       collection->erase(*rmit-rmNumber); // The position of the iterator
       rmNumber++;
     }    
     ATH_MSG_DEBUG(rmNumber << " fake clusters from ganged pixel have been removed");
  
 }

◆ 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::PixelGangedAmbiguitiesFinder::initialize ( )

virtual

Definition at line 41 of file PixelGangedAmbiguitiesFinder.cxx.

                                                     {
   ATH_CHECK(m_pixelDetEleCollKey.initialize());
  
   return StatusCode::SUCCESS;
 }

◆ 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::PixelGangedAmbiguitiesFinder::interfaceID ( )

inlinestatic

Definition at line 51 of file PixelGangedAmbiguitiesFinder.h.

51 { return IID_PixelGangedAmbiguitiesFinder; };

◆ isGanged()

bool InDet::PixelGangedAmbiguitiesFinder::isGanged	(	const Identifier &	rdoID,
		const InDetDD::SiDetectorElement *	element,
		Identifier &	gangedID
	)

staticprivate

Definition at line 323 of file PixelGangedAmbiguitiesFinder.cxx.

 {
   InDetDD::SiCellId cellID = element->cellIdFromIdentifier (rdoID);
   if (element->numberOfConnectedCells (cellID) > 1) {
     InDetDD::SiCellId gangedCellID = element->connectedCell (cellID,1);
     if ( gangedCellID==cellID ) gangedCellID = element->connectedCell (cellID,0);
     gangedID = element->identifierFromCellId (gangedCellID);
     return true;
   } else {
     gangedID = Identifier();
     return false;
   }
 }

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

◆ 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_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_internalSolving

BooleanProperty InDet::PixelGangedAmbiguitiesFinder::m_internalSolving {this, "InternalSolving", false, "Standalone resolution of ganged pixel ambiguities"}

private

Definition at line 69 of file PixelGangedAmbiguitiesFinder.h.

◆ m_pixelDetEleCollKey

SG::ReadCondHandleKey<InDetDD::SiDetectorElementCollection> InDet::PixelGangedAmbiguitiesFinder::m_pixelDetEleCollKey {this, "PixelDetEleCollKey", "PixelDetectorElementCollection", "Key of SiDetectorElementCollection for Pixel"}

private

Definition at line 71 of file PixelGangedAmbiguitiesFinder.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.

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

Static Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ SiDetectorElement

◆ SiLocalPosition

◆ StoreGateSvc_t

Constructor & Destructor Documentation

◆ PixelGangedAmbiguitiesFinder()

◆ ~PixelGangedAmbiguitiesFinder()

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]

◆ execute()

◆ extraDeps_update_handler()

◆ initialize()

◆ inputHandles()

◆ interfaceID()

◆ isGanged()

◆ msg() [1/2]

◆ msg() [2/2]

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

Member Data Documentation

◆ m_detStore

◆ m_evtStore

◆ m_internalSolving

◆ m_pixelDetEleCollKey

◆ m_varHandleArraysDeclared

◆ m_vhka