#include <EmcRecSeedEThreshold.h>

Inheritance diagram for EmcRecSeedEThreshold:

Public Member Functions
	EmcRecSeedEThreshold ()

	~EmcRecSeedEThreshold ()

virtual void	Seed (const RecEmcCluster &aCluster, RecEmcIDVector &aMaxVec)

Public Member Functions inherited from EmcRecSeedAbs
	EmcRecSeedAbs ()

virtual	~EmcRecSeedAbs ()

Detailed Description

Definition at line 14 of file EmcRecSeedEThreshold.h.

Constructor & Destructor Documentation

◆ EmcRecSeedEThreshold()

EmcRecSeedEThreshold::EmcRecSeedEThreshold ( )

Definition at line 12 of file EmcRecSeedEThreshold.cxx.

{
   fEThresholdSeed=EmcRecParameter::GetInstance().EThresholdSeed();
}

◆ ~EmcRecSeedEThreshold()

EmcRecSeedEThreshold::~EmcRecSeedEThreshold ( )

Definition at line 17 of file EmcRecSeedEThreshold.cxx.

18{}

Member Function Documentation

◆ Seed()

void EmcRecSeedEThreshold::Seed	(	const RecEmcCluster &	aCluster,
		RecEmcIDVector &	aMaxVec )

virtual

Implements EmcRecSeedAbs.

Definition at line 20 of file EmcRecSeedEThreshold.cxx.

{
  RecEmcHitMap::const_iterator ciHitMap;
  RecEmcHitMap::const_iterator ciNeigh;
  RecEmcHit aHit;
  
  bool max;
  
  RecEmcIDVector NeighVec;
  RecEmcIDVector::const_iterator ciNeighVec;
  
  aMaxVec.clear();
  
  vector<RecEmcHit> aHitVec,tmpHitVec;
  vector<RecEmcHit>::const_iterator ciHitVec;
  
  EmcRecNeighbor nhb;
  
  for(ciHitMap=aCluster.Begin();
      ciHitMap!=aCluster.End();
      ++ciHitMap) {
    //++++++++++++++++++++++++++++++++++++++++++++++++++
      //prepare a hit
    max=true;
    aHit=ciHitMap->second;
    
    if(aHit.getEnergy()>fEThresholdSeed) {
      //prepare its neighbours
      NeighVec.clear();
      NeighVec=nhb.GetNeighbors(aHit.getCellId());
      
      //to see if it is energy max
      for(ciNeighVec=NeighVec.begin();
          ciNeighVec!=NeighVec.end();
          ++ciNeighVec) {
        //find it
        ciNeigh=aCluster.Find(*ciNeighVec);
            if(ciNeigh!=aCluster.End()) {
              //largest!!!
              if(ciNeigh->second.getEnergy()>aHit.getEnergy()) {
                max=false;
              }
            }
      }
    } else {
      max=false;
    }
 
    //avoid 2 equal neighbor seeds
    for(ciHitVec=aHitVec.begin();
        ciHitVec!=aHitVec.end();
        ciHitVec++) {
      if(nhb.IsNeighbor(ciHitVec->getCellId(),aHit.getCellId())) {
        max=false;
        break;
      }
    }
      
    //once max hit is found
    if(max==true) {
      aHitVec.push_back(aHit);
    }
    //++++++++++++++++++++++++++++++++++++++++++++++++++
  }
  
  sort(aHitVec.begin(),aHitVec.end(),greater<RecEmcHit>());
  
  for(ciHitVec=aHitVec.begin();
      ciHitVec!=aHitVec.end();
      ciHitVec++) {
    aMaxVec.push_back(ciHitVec->getCellId());
  }
}