cluster::HitCluster Class Reference

#include <HitCluster.h>

List of all members.

Public Member Functions
	HitCluster ()
	~HitCluster ()
std::vector< Cluster >	MakeClusters (std::vector< const CellHit * > &cellhit)
bool	Fit3HitClust (Cluster clust, std::vector< Cluster > &newclust)
bool	FitClust (Cluster clust, std::vector< Cluster > &newclust)
bool	SortClust (std::vector< Cluster > &newclust)
void	MakeHit (Cluster &clust, CellHit &hit)

---

Constructor & Destructor Documentation

cluster::HitCluster::HitCluster (   )  [inline]

Definition at line 17 of file HitCluster.h. {};

cluster::HitCluster::~HitCluster (   )  [inline]

Definition at line 18 of file HitCluster.h. {};

---

Member Function Documentation

bool HitCluster::Fit3HitClust (  Cluster  clust, std::vector< Cluster > &  newclust )

Definition at line 132 of file HitCluster.cxx. References recobase::Cluster::NCell(). { //Quieting some warnings int dummy1=0; dummy1 = clust.NCell(); size_t dummy2=0; dummy2 = newclust.size(); /* // First, check if there is a gap. If yes, split the cluster there if (clust.fCellHit[1]->Cell()-clust.fCellHit[0]->Cell()>1) { clust.fStatus |= 0x0001; Cluster cl1; Cluster cl2; cl1.Add(clust.fCellHit[0]); cl2.Add(clust.fCellHit[1]); cl2.Add(clust.fCellHit[2]); newclust.push_back(cl1); newclust.push_back(cl2); } else if (clust.fCellHit[2]->Cell()-clust.fCellHit[1]->Cell()>1) { clust.fStatus |= 0x0001; Cluster cl1; Cluster cl2; cl1.Add(clust.fCellHit[0]); cl1.Add(clust.fCellHit[1]); cl2.Add(clust.fCellHit[2]); newclust.push_back(cl1); newclust.push_back(cl2); } else { if (clust.fCellHit[0]->Cell() > clust.fCellHit[1]->Cell() && clust.fCellHit[2]->Cell() > clust.fCellHit[1]->Cell()) { clust.fStatus |= 0x0001; Cluster cl1; Cluster cl2; if (clust.fCellHit[0]->Cell() > clust.fCellHit[2]->Cell()) { cl1.Add(clust.fCellHit[0]); cl1.Add(clust.fCellHit[1]); cl2.Add(clust.fCellHit[2]); } else { cl1.Add(clust.fCellHit[0]); cl2.Add(clust.fCellHit[1]); cl2.Add(clust.fCellHit[2]); } newclust.push_back(cl1); newclust.push_back(cl2); } } */ return true; }

bool HitCluster::FitClust (  Cluster  clust, std::vector< Cluster > &  newclust )

Definition at line 185 of file HitCluster.cxx. References recobase::Cluster::NCell(). { //Quieting warnings int dummy1=0; dummy1 = clust.NCell(); size_t dummy2=0; dummy2 = newclust.size(); /* if (clust.fCellHit.size()<3) return true; if (clust.fCellHit.size()==3) return HitCluster::Fit3HitClust(clust, newclust); for (unsigned int i=0; i<clust.fCellHit.size(); ++i) { Cluster tmpclust; double adcl=0; double adcr=0; if (i==0) adcl = 0.0; else { float mips; if(clust.fCellHit[i-1]->MIP(mips)) adcl = mips; } if (i==clust.fCellHit.size()-1) adcr = 0.0; else { float mips; if(clust.fCellHit[i+1]->MIP(mips)) adcr = mips; } tmpclust.Add(clust.fCellHit[i]); float mips; if(!clust.fCellHit[i]->MIP(mips))continue;else if (mips<adcl && mips<adcr) { if (mips/(adcl+adcr)<0.5) { newclust.push_back(tmpclust); tmpclust.fCellHit.clear(); } } } */return true; }

std::vector< Cluster > HitCluster::MakeClusters (  std::vector< const CellHit * > &  cellhit  )

Definition at line 13 of file HitCluster.cxx. References recobase::Cluster::Add(), and recobase::CellHit::PE(). Referenced by cluster::Clusterer::Reco(). { std::vector<Cluster> planecluster(0); int ipl; int ist; unsigned int icl; int stmax; int nzeros; int stlo; int sthi; int gapsz = 2; float adcmax; std::vector<int> istlo; std::vector<int> isthi; // --// for (ipl = view.PlaneMin(); ipl<=view.PlaneMax(); ++ipl) { for(ipl=0;ipl<0;ipl++){ istlo.clear(); isthi.clear(); while (1) { // Scan along the strips looking for the highest peak, not already // associate with a cluster stmax = -1; adcmax = -1.0; //-- // for (ist = view.StripMin(); ist<=view.StripMax(); ++ist) { for(ist=0;ist<0;ist++) { // Check if the strip is already inside a range assigned to a // cluster bool skipit = false; for (icl=0; icl<istlo.size(); ++icl) { if (ist>istlo[icl] && ist<isthi[icl]) skipit = true; if (ist==istlo[icl]) skipit = true; if (ist==isthi[icl]) skipit = true; if (skipit) { // MsgError("MDMReco","Skipping %d lies inside cluster %d\n", // ist, icl); break; } } if (skipit==true) continue; //--- // const NOVACellHit* cell = view.FindHit(ipl, ist); CellHit *cell=new CellHit(); if (cell==0) continue; float mips=0.0; if(cell->PE() > 0.) mips = cell->PE();else continue; if( mips > 0 ){ if(mips > adcmax) { stmax = ist; adcmax = mips; } } else continue; } // End search for peak strip if (adcmax<0.0) break; // Now that we have our peak strip, expand out until we encouter a // gap of at least two strips nzeros = 0; //--// // for (ist=stmax+1; ist<=view.StripMax(); ++ist) { // if (view.FindHit(ipl, ist)==0) ++nzeros; // else nzeros = 0; // if (nzeros==gapsz) break; // } sthi = ist-gapsz+1; isthi.push_back(sthi); nzeros = 0; //--// // for (ist=stmax-1; ist>=view.StripMin(); --ist) { // if (view.FindHit(ipl, ist)==0) ++nzeros; // else nzeros = 0; // if (nzeros==gapsz) break; // } stlo = ist+gapsz-1; istlo.push_back(stlo); // Build the cluster Cluster clust; for (ist=stlo; ist<=sthi; ++ist) { //--// const NOVACellHit* cell = view.FindHit(ipl, ist); CellHit * cell = new CellHit(); if (cell!=0) clust.Add(cell); } planecluster.push_back(clust); } // While there are still unassociated hits in the plane } // End loop on planes return planecluster; }

void HitCluster::MakeHit (  Cluster &  clust, CellHit &  hit )

Definition at line 247 of file HitCluster.cxx. { }

bool HitCluster::SortClust (  std::vector< Cluster > &  newclust  )

Definition at line 227 of file HitCluster.cxx. { // Sort Cluster by plane number. std::multimap<float,Cluster> tmpclustmap; for (unsigned int i=0; i<clust.size(); ++i) { tmpclustmap.insert(std::multimap<float,Cluster>::value_type(clust[i].Z(),clust[i])); } clust.clear(); std::multimap<float,Cluster>::iterator itr = tmpclustmap.begin(); while( itr != tmpclustmap.end() ) { clust.push_back((*itr).second); ++itr; } return true; }

---

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

• HitCluster.h
• HitCluster.cxx

---