ChainHelper Class Reference

#include <ChainHelper.h>

List of all members.

Public Member Functions
	ChainHelper ()
	~ChainHelper ()
void	insert (double it, double iz, double ie, int my_cluster_id)
Chain *	split (Chain *d)
Chain *	SplitAt (Chain *c, double splitpointz)
Chain	AttachAt (Chain *mother, Chain *daughter, double z)
void	AdjustLevel (Chain *c, int level)
void	AttachAsChild (Chain *parent, Chain *child)
void	Reset ()
void	print_finished ()
void	finish ()
void	SetDetector (Detector::Detector_t d)
void	matchChains ()
std::vector< int >	FindMaxPath ()
std::pair< std::vector< int >, double >	FindMaxPath (Chain *c)
int	NewChain ()
void	ChangeHitId (int oldid, int newid)
std::vector< int >	GetAllChildren (Chain *c)
void	add_to_plane (double it, double iz, double ie, int cluster_id)
void	process_plane ()
Chain *	GetChain (int id)
void	DeleteChain (int id)
void	AddFinishedChain (Chain c)
std::vector< foundpath >	FindPaths (Chain *c)
Public Attributes
std::vector< Chain >	working
std::vector< Chain >	finished
std::vector< Chain >	particles
int	parents
int	muonlikechains
int	emlikechains
int	totalchains
std::vector< double >	pending_t
std::vector< double >	pending_z
std::vector< double >	pending_e
std::vector< int >	pending_cluster_id
double	max_z_gap
double	max_slope
int	found_max_path
std::vector< int >	maxpath
double	vtx_z
double	vtx_t
Private Member Functions
	ClassDef (ChainHelper, 1)
Private Attributes
std::map< int, int >	idhelper
Detector::Detector_t	detector

---

Constructor & Destructor Documentation

ChainHelper::ChainHelper (   )

Definition at line 18 of file ChainHelper.cxx. References Chain::ResetCounter(). : parents(0),muonlikechains(0),emlikechains(0),totalchains(0), max_z_gap(0.3), max_slope(0.0), found_max_path(0) { Reset(); working.clear(); finished.clear(); pending_t.clear(); pending_z.clear(); pending_e.clear(); pending_cluster_id.clear(); maxpath.clear(); Chain::ResetCounter(); idhelper.clear(); detector=Detector::kUnknown; }

ChainHelper::~ChainHelper (   )

Definition at line 57 of file ChainHelper.cxx. References finished, idhelper, maxpath, pending_cluster_id, pending_e, pending_t, pending_z, and working. { working.clear(); finished.clear(); pending_t.clear(); pending_z.clear(); pending_e.clear(); pending_cluster_id.clear(); idhelper.clear(); maxpath.clear(); }

---

Member Function Documentation

void ChainHelper::add_to_plane (  double  it, double  iz, double  ie, int  cluster_id )

Definition at line 164 of file ChainHelper.cxx. References found_max_path, pending_cluster_id, pending_e, pending_t, and pending_z. Referenced by Finder::MakeChains(). { pending_t.push_back(it); pending_z.push_back(iz); pending_e.push_back(ie); pending_cluster_id.push_back(cluster_id); //reset found items, since we have added data found_max_path=0; }

void ChainHelper::AddFinishedChain (  Chain  c  )

Definition at line 49 of file ChainHelper.cxx. References finished, idhelper, and Chain::myId. Referenced by PrimaryShowerFinder::FindPrimaryShower(), finish(), insert(), PrimaryShowerFinder::MakeChains(), NewChain(), and SplitAt(). { //printf("ChainHelper adding chain %d\n",c.myId); finished.push_back(c); idhelper[c.myId]= finished.size()-1 ; }

void ChainHelper::AdjustLevel (  Chain *  c, int  level )

Definition at line 1053 of file ChainHelper.cxx. References Chain::children, GetChain(), Chain::level, MSG, and Chain::myId. Referenced by AttachAsChild(). { if(!c)return; c->level=level; for(unsigned int i=0;i<c->children.size();i++) { Chain *d=GetChain(c->children[i]); if(d) AdjustLevel(d,level+1); else MSG("ChainHelper",Msg::kError)<<"bogus children list - parent id " << c->myId << " request for child with id "<< c->children[i]<<endl; } }

void ChainHelper::AttachAsChild (  Chain *  parent, Chain *  child )

Definition at line 1042 of file ChainHelper.cxx. References AdjustLevel(), Chain::children, found_max_path, Chain::level, MSG, Chain::myId, and Chain::parentChain. Referenced by AttachAt(), Finder::MergeChains(), and Finder::RemoveNonVertexPointingChains(). { child->parentChain = parent->myId; parent->children.push_back(child->myId); MSG("ChainHelper",Msg::kDebug)<<"attaching "<<parent->myId<<" to "<< child->myId <<"setting child level from "<<child->level<<" to "<<1+parent->level <<endl; AdjustLevel(child, 1 + parent->level); //increase the level of children found_max_path=0; }

Chain ChainHelper::AttachAt (  Chain *  mother, Chain *  daughter, double  z )

Definition at line 598 of file ChainHelper.cxx. References Chain::add_to_back(), AttachAsChild(), Chain::children, Chain::ClearHits(), Chain::cluster_id, Chain::e, Chain::end_z, Chain::entries, Chain::level, Chain::myId, Chain::parentChain, Chain::PrintChain(), Chain::start_z, Chain::t, and Chain::z. Referenced by PrimaryShowerFinder::MakeChains(), and process_plane(). { // if(c->end_z < splitpointz || c->start_z > splitpointz || c->entries<1) // { if(c->entries<1 || splitpointz < c->start_z || splitpointz > daughter->end_z){ //its ok if the split point is past the parent chain... then we just attach to the end! cout<<"!!!!!!!!!THIS SHOULDN'T HAPPEN --- CALL TO ATTACHAT IN CHAINHELPER WITH SPLITPOINT OUTSIDE OF PARENT CHAIN!!!!"<<endl; cout<<"requested to connect "<<daughter->myId <<" to "<<c->myId <<" at "<<splitpointz<<endl; cout<<"daughter\n"; daughter->PrintChain(); cout<<"parent\n"; c->PrintChain(); cout<<"\n\n"; return Chain(); // can't split up the chain if we are not in the chain... } std::vector<double> t; for(unsigned int i=0;i<c->t.size();i++)t.push_back(c->t[i]); std::vector<double> e; for(unsigned int i=0;i<c->e.size();i++)e.push_back(c->e[i]); std::vector<double> z; for(unsigned int i=0;i<c->z.size();i++)z.push_back(c->z[i]); std::vector<int> cid; for(unsigned int i=0;i<c->cluster_id.size();i++)cid.push_back(c->cluster_id[i]); //int pid = c->parentChain; std::vector<int> children; for(unsigned int i=0;i<c->children.size();i++)children.push_back(c->children[i]); double close = fabs(z[0]-splitpointz); int cidx=0; //find the split point for(unsigned int i=1;i<z.size();i++) { if(fabs(z[i]-splitpointz)<close) { close = fabs(z[i]-splitpointz); cidx=i; } } Chain newc; c->ClearHits(); for(int i=0;i<=cidx;i++) { c->add_to_back(t[i],z[i],e[i],cid[i]); } c->children.clear(); c->children.push_back(newc.myId); for(unsigned int i=cidx;i<z.size();i++) { newc.add_to_back(t[i],z[i],e[i],cid[i]); } newc.parentChain = c->myId; newc.children = children; newc.level = c->level+1; AttachAsChild(c, daughter); return newc; }

void ChainHelper::ChangeHitId (  int  oldid, int  newid )

Definition at line 1090 of file ChainHelper.cxx. References Chain::cluster_id, and finished. Referenced by Finder::Weave(). { for(unsigned int i=0;i<finished.size();i++) { Chain *c = &(finished[i]); for(unsigned int j=0;j<c->cluster_id.size();j++) { if(c->cluster_id[j]==oldid)c->cluster_id[j]=newid; } } }

ChainHelper::ClassDef (  ChainHelper  , 1  )  [private]

void ChainHelper::DeleteChain (  int  id  )

Definition at line 86 of file ChainHelper.cxx. References Chain::children, finished, found_max_path, GetChain(), idhelper, and Chain::parentChain. Referenced by PrimaryShowerFinder::FindPrimaryShower(), and Finder::RemoveNonVertexPointingChains(). { //cout << "deleting "<<id<<endl; Chain* todel = GetChain(id); if(!todel)return; if(todel->parentChain>-1) { Chain*p = GetChain(todel->parentChain); for(unsigned int i=0;i<p->children.size();i++) { if(p->children[i]==id) { p->children.erase(p->children.begin()+i); //cout<<"\t removing child reference from parent "<<todel->parentChain<<endl; break; } } } for(unsigned int i=0;i<todel->children.size();i++) { Chain * child = GetChain(todel->children[i]); if(!child)continue; child->parentChain=-1; } for(unsigned int i=0;i<finished.size();i++) { if(finished[i].myId==id) { finished.erase(finished.begin()+i); break; } } //rebuild helper!!!! idhelper.clear(); for(unsigned int i=0;i<finished.size();i++) idhelper[finished[i].myId]=i; found_max_path=0; //in case we deleted a chain in the max path }

std::pair< std::vector< int >, double > ChainHelper::FindMaxPath (  Chain *  c  )

Definition at line 924 of file ChainHelper.cxx. References Chain::children, FindMaxPath(), GetChain(), MSG, Chain::myId, and Chain::sum_e. { // printf("find max path chain id %d\n",c->myId); std::vector<int> v; double e; if (c->children.size()<1) { v.push_back(c->myId); e=c->sum_e; return std::make_pair(v,e); }else{ double maxe=0; std::pair< std::vector<int>, double > maxp; for(unsigned int i=0;i<c->children.size();i++) { Chain *nextchain = GetChain(c->children[i]); if(!nextchain) { MSG("ChainHelper",Msg::kWarning)<<"Call to child chain that does not exists!...."<<endl; continue; } std::pair< std::vector<int>, double > f = FindMaxPath(nextchain); //printf("maxpath on %d has e %f\n",nextchain->myId,f.second); if(f.second>maxe) { maxe=f.second; maxp=f; } } maxp.first.push_back(c->myId); maxp.second+=c->sum_e; return maxp; } }

std::vector< int > ChainHelper::FindMaxPath (   )

Definition at line 842 of file ChainHelper.cxx. References Chain::e, Chain::end_t, Chain::end_z, finished, found_max_path, GetChain(), maxpath, MSG, Chain::start_t, and Chain::start_z. Referenced by HoughView::DrawChains(), HitView::DrawChains(), ChainView::DrawChains(), FindMaxPath(), Finder::FindMuons(), PrimaryShowerFinder::FindPrimaryShower(), Finder::FindVertex(), and Finder::MakeChains(). { if(found_max_path)return maxpath; //dont rerun it if it is already done //make a list of all "parent" chains (not a daughter of another chain) //for each in the list, double maxe=0; std::pair< std::vector<int>, double > maxp; for(unsigned int i=0;i<finished.size();i++) { if(finished[i].parentChain<0) { std::pair< std::vector<int>, double > f = FindMaxPath(GetChain(finished[i].myId)); if(f.second>maxe) { maxe=f.second; maxp=f; } } } ostringstream os; os << "\nmaxpath found with energy "<< maxe <<endl; os << "\t Chains : "; for(int i=maxp.first.size()-1;i>-1;i--) { int idx = maxp.first[i]; os << idx <<" "; } os<<endl; os << "\t Chain path : "; for(int i=maxp.first.size()-1;i>-1;i--) { int idx = maxp.first[i]; os << " from (" << GetChain(idx)->start_z << " " << GetChain(idx)->start_t <<") to (" <<GetChain(idx)->end_z<< " " <<GetChain(idx)->end_t<< ") - "; } os << "\n\t Chain energies : "; if(maxp.first.size()>0) os <<" "<< GetChain(maxp.first[maxp.first.size()-1])->e[0] << " - "; for(int i=maxp.first.size()-1;i>-1;i--) { int idx = maxp.first[i]; for(unsigned int a=1;a<GetChain(idx)->e.size();a++) //start with 2nd in each chain to avoid double printing of first hit! os << " " << GetChain(idx)->e[a] << " - "; os << " --- "; } MSG("ChainHelper",Msg::kDebug) << os.str() << endl; //since this vector was made recursively, the entries are backwards (from the end of the path to the beginning...) so reverse it std::vector<int> rev; for(int i=maxp.first.size()-1;i>-1;i--) rev.push_back(maxp.first[i]); found_max_path=1; maxpath = rev; return rev; }

std::vector< foundpath > ChainHelper::FindPaths (  Chain *  c  )

Definition at line 1104 of file ChainHelper.cxx. References Chain::children, Chain::end_t, foundpath::end_t, Chain::end_z, foundpath::end_z, foundpath::energy, Chain::entries, foundpath::entries, GetChain(), Chain::insert(), Chain::muonfrac, Chain::muonlike, foundpath::muonlike, Chain::myId, foundpath::path, Chain::start_t, foundpath::start_t, Chain::start_z, foundpath::start_z, and Chain::sum_e. Referenced by Finder::FindVertex(), and Finder::GetPaths(). { std::vector<foundpath> a; if(!c) { // printf("ChainHelper::FindPaths called without a chain!\n"); return a; } //printf("finding paths for chain %d has %d children\n",c->myId,c->children.size()); if(c==0)return a; if(c->children.size()<1) { foundpath b; b.end_t=c->end_t; b.end_z=c->end_z; b.energy=c->sum_e; b.muonlike=c->muonfrac; b.start_t=c->start_t; b.start_z=c->start_z; b.path.push_back(c->myId); b.entries=c->entries; a.push_back(b); return a; } int foundsingle=0; for(unsigned int i=0;i<c->children.size();i++) { std::vector<foundpath> d = FindPaths(GetChain(c->children[i])); //see 2+ of these paths are childless //if so, see if they have the same number of hits //if so, remove one of these for now.... int issingle=0; if(d.size()==1) if(d[0].path.size()==1) if(GetChain(d[0].path[0])->entries<3) issingle=1; if(issingle && ! foundsingle) //only store one! a.push_back(d[0]); else if(!issingle)//store them all for(unsigned int j=0;j<d.size();j++) a.push_back(d[j]); if(issingle)foundsingle=1; } for(unsigned int i=0;i<a.size();i++) { a[i].start_t = c->start_t; a[i].start_z = c->start_z; a[i].energy+=c->sum_e; a[i].muonlike = (a[i].muonlike*a[i].entries + c->muonfrac*c->entries) / (a[i].entries+c->entries); //this may give unfair (2x) weight to duplicated head entries in children! a[i].entries+=c->entries -1; //head entry is duplicated in child! a[i].path.insert(a[i].path.begin(),c->myId); //perhaps should replace with a queue! } return a; }

void ChainHelper::finish (   )

Definition at line 765 of file ChainHelper.cxx. References AddFinishedChain(), emlikechains, finished, muonlikechains, parents, totalchains, and working. Referenced by Finder::MakeChains(). { for(unsigned int i=0;i<working.size();i++) { AddFinishedChain(working[i]); } for(unsigned int i=0;i<finished.size();i++) { if(finished[i].parentChain<0)parents++; if(finished[i].muonfrac>0.8)muonlikechains++; if(finished[i].emlike>0.7)emlikechains++; } working.clear(); std::sort(finished.begin(), finished.end(), LTId() ); //matchChains(); totalchains=finished.size(); }

std::vector< int > ChainHelper::GetAllChildren (  Chain *  c  )

Definition at line 1070 of file ChainHelper.cxx. References Chain::children, GetChain(), and Chain::myId. Referenced by HoughView::DrawChains(), HitView::DrawChains(), and ChainView::DrawChains(). { std::vector<int>ret; for(unsigned int i=0;i<c->children.size();i++) { Chain *me = GetChain(c->children[i]); if(!me)continue; std::vector<int> t= GetAllChildren(me); for(unsigned int j=0;j<t.size();j++) { ret.push_back(t[j]); } } ret.push_back(c->myId); return ret; }

Chain * ChainHelper::GetChain (  int  id  )

Definition at line 70 of file ChainHelper.cxx. References finished. Referenced by AdjustLevel(), DeleteChain(), HoughView::DrawChains(), HitView::DrawChains(), ChainView::DrawChains(), FindMaxPath(), Finder::FindMuons(), Finder::FindNeutrons(), FindPaths(), PrimaryShowerFinder::FindPrimaryShower(), Finder::FindVertex(), GetAllChildren(), Finder::Make3DParticle(), PrimaryShowerFinder::MakeChains(), Finder::MergeChains(), Finder::Process(), Finder::RecordLostHits(), Finder::RemoveNonVertexPointingChains(), Finder::ShareHit(), SplitAt(), and Finder::Weave(). { for(unsigned int i=0;i<finished.size();i++) if(id == finished[i].myId)return &finished[i]; /* std::map<int,int>::iterator it; it = idhelper.find(id); if(it!=idhelper.end()) return &finished[it->second]; ///does not check to see if it is valid!!!!! */ return 0; }

void ChainHelper::insert (  double  it, double  iz, double  ie, int  my_cluster_id )

here the problem is if there are two in the same z that should be added, the first will be added, the second will be comparing to the one just added, not the one in the last plae Definition at line 972 of file ChainHelper.cxx. References Chain::add_to_back(), AddFinishedChain(), detector, and working. { //find best chain match, and attach it int match=0; double closest_dt=100000; double closest_index=-1; double max_z_gap_temp=max_z_gap; if(detector==Detector::kNear && iz > 6) { max_z_gap_temp*=5; } std::vector<int> todel; for(unsigned int i=0;i<working.size();i++) { if(fabs(iz-working[i].end_z)>max_z_gap_temp) { //too far away in z, so mark this chain as finished AddFinishedChain(working[i]); todel.push_back(i); continue; } double tslope = (working[i].end_t-it)/(working[i].end_z-iz); if(fabs(tslope-working[i].last_slope)<max_slope) { match=1; double ldt=fabs(working[i].end_t-it); if(ldt<closest_dt) { closest_dt=ldt; closest_index=i; } } } for(unsigned int i=0;i<todel.size();i++) { working.erase(working.begin()+todel[i]-i); //need the extra i because items past deletion point will be shifted by 1 to the left for each previous deletion } //if no match found, start new chain if(!match) { Chain c; c.add_to_back(it,iz,ie,my_cluster_id); working.push_back(c); } }

void ChainHelper::matchChains (   )

Definition at line 176 of file ChainHelper.cxx. References finished, found_max_path, MSG, Chain::myId, and Chain::parentChain. { found_max_path=0; std::vector<int> longs; for(unsigned int i=0;i<finished.size();i++) { if(finished[i].entries>3) longs.push_back(i); } for(unsigned int i=0;i<longs.size();i++) for(unsigned int j=i+1;j<longs.size();j++) { if(finished[longs[j]].start_z-finished[longs[i]].end_z > 1.0)continue; if(finished[longs[j]].end_z-finished[longs[j]].start_z <0.0)continue; if(finished[longs[i]].end_z-finished[longs[i]].start_z <0.0)continue; if(finished[longs[j]].parentChain>-1)continue; //else see if there is a match.... double dz=finished[longs[j]].start_z-finished[longs[i]].end_z; // double t1 = finished[longs[i]].end_t+finished[longs[i]].back_slope*dz; // double t2 = finished[longs[j]].start_t-finished[longs[j]].front_slope*dz; double t1 = finished[longs[i]].interpolate(dz); double t2 = finished[longs[j]].interpolate(dz); double dt1 = fabs(finished[longs[j]].start_t - t1); double dt2 = fabs(finished[longs[i]].end_t - t2); MSG("ChainHelper",Msg::kDebug) <<"matching ... " << dt1 <<" "<<dt2<<endl; if(dz<1.0 && (dt1<0.1 || dt2<0.2) ) { finished[longs[i]].children.push_back(finished[longs[j]].myId); finished[longs[j]].parentChain=finished[longs[i]].myId; } } }

int ChainHelper::NewChain (   )

Definition at line 40 of file ChainHelper.cxx. References AddFinishedChain(), and Chain::myId. Referenced by Finder::FindMuons(), PrimaryShowerFinder::MakeChains(), and Finder::Process(). { Chain c; AddFinishedChain(c); return c.myId; }

void ChainHelper::print_finished (   )

Definition at line 794 of file ChainHelper.cxx. References Chain::avg_offset, Chain::avg_slope, Chain::back_offset, Chain::back_slope, Chain::children, Chain::cluster_id, Chain::e, Chain::emlike, Chain::end_t, Chain::end_z, Chain::entries, finished, Chain::front_offset, Chain::front_slope, MsgService::Instance(), MsgService::IsActive(), Chain::last_slope, Chain::level, Chain::muonfrac, Chain::myId, Chain::num_peaks, Chain::parentChain, Chain::start_t, Chain::start_z, Chain::strict_decreasing, Chain::strict_increasing, Chain::sum_e, Chain::t, and Chain::z. Referenced by PrimaryShowerFinder::FindPrimaryShower(), Finder::MakeChains(), and Finder::Process(). { if(!MsgService::Instance()->IsActive("ChainHelper",Msg::kDebug))return; cout<<"chain helper print_finished()\n"; for(unsigned int i=0;i<finished.size();i++) { std::ostringstream os; os <<"\n chain " <<finished[i].myId <<", parent " <<finished[i].parentChain <<", level " << finished[i].level <<", children "; for (unsigned int j=0;j<finished[i].children.size();j++) os<< finished[i].children[j] << " "; os << "\n"; os << " muonfrac " << finished[i].muonfrac <<", emlike " << finished[i].emlike <<", numpeaks " <<finished[i].num_peaks <<" strick inc " << finished[i].strict_increasing<<" dec " << finished[i].strict_decreasing<<" entries " << finished[i].entries<<endl; os << "start (t,z) (" << finished[i].start_t <<", "<< finished[i].start_z <<") end (t,z) (" << finished[i].end_t <<", "<< finished[i].end_z <<") avg slope " << finished[i].avg_slope<< " avg offset " << finished[i].avg_offset<<" last slope " << finished[i].last_slope<<" sum_e " <<finished[i].sum_e <<" avg_e " << finished[i].sum_e/finished[i].entries << "\n\t"; os << "front slope " << finished[i].front_slope << " front offset " << finished[i].front_offset << " back slope " << finished[i].back_slope << " back offset " << finished[i].back_offset<<"\n\t"; for(unsigned int k=0;k<finished[i].t.size();k++) { os << "( " << finished[i].t[k] <<", "<< finished[i].z[k] << ", "<< finished[i].e[k] <<" - "<< finished[i].cluster_id[k]<<") "; } cout<< os.str() << endl<<endl; } }

void ChainHelper::process_plane (   )

max dist end max dist Definition at line 229 of file ChainHelper.cxx. References Chain::add_to_back(), AttachAt(), detector, Chain::entries, found_max_path, Chain::interpolate(), max_slope, MSG, Chain::myId, pending_cluster_id, pending_e, pending_t, pending_z, s(), split(), vtx_t, vtx_z, and working. Referenced by Finder::MakeChains(). { int wsize=working.size(); std::vector<int> todel(wsize); for(int i=0;i<wsize;i++)todel[i]=0; std::map<int, std::vector<int> > toadd; //std::vector<int> toadd(wsize); //for(int i=0;i<wsize;i++) toadd[i]=0; std::vector<Chain> tmpchain; //printf("%d clusters for this plane\n",pending_t.size()); for(unsigned int j=0;j<pending_t.size();j++) { double iz=pending_z[j]; double it=pending_t[j]; //if we are in the near... and in the calorimeter, we should increaze the z gap size double max_z_gap_temp=max_z_gap; if(detector==Detector::kNear && iz > 6) { max_z_gap_temp*=5; } double closest_d=100000; int closest_index=-1; int match=0; double closest_t_unmatched=100000; double closest_t=100000; int singlehitmatch=0; double singlehite=0; for(unsigned int i=0;i<working.size();i++) { if(fabs(iz-working[i].end_z)<0.0001) //same plane { // printf("same plane %f\n",iz); continue; } if(fabs(iz-working[i].end_z)>max_z_gap_temp) { //printf("removing chain %d from working list - it's too far away\n",working[i].myId); todel[i]=1; continue; } double tslope = (working[i].end_t-it)/(working[i].end_z-iz); double ddist = sqrt((working[i].end_t-it)*(working[i].end_t-it) + (working[i].end_z-iz)*(working[i].end_z-iz)); if(ddist>max_z_gap_temp)continue; closest_t_unmatched=closest_t_unmatched<fabs(working[i].end_t-it) ?closest_t_unmatched:fabs(working[i].end_t-it); // if(working[i].children.size()>0)continue; //should be finalized... if(fabs(tslope-working[i].last_slope)<max_slope/(fabs(working[i].end_z-iz)/0.0708) || !working[i].good_slope() || working[i].entries<2 )// || fabs(working[i].last_slope) > 100000) { match=1; if(working[i].good_slope() && fabs(working[i].last_slope)<10000)match=2; double dist = closest_t; // if(working[i].good_slope()) // dist = sqrt((working[i].end_t-it)*(working[i].end_t-it)+(tslope-working[i].last_slope)*(tslope-working[i].last_slope) ); // else dist = fabs(working[i].end_t-it); //closest_t=closest_t<fabs(working[i].end_t-it) ?closest_t:fabs(working[i].end_t-it); closest_t=closest_t<dist?closest_t:dist; double ldt=(working[i].end_t-it)*(working[i].end_t-it)+(working[i].end_z-iz)*(working[i].end_z-iz); double kinky=0.0; if(working[i].entries>1) { int a = working[i].entries-2; if (! fabs(working[i].z[a+1]-working[i].z[a]) < 0.00001) { double slope = (working[i].t[a+1]-working[i].t[a]) / (working[i].z[a+1]-working[i].z[a]); double off = working[i].t[a]; double z = working[i].z[a]; kinky = fabs ( ( (iz - z) * slope + off ) - it); kinky = fabs ( working[i].interpolate(iz)-it); } } if(ldt<closest_d ||singlehitmatch==1) //|| match==2) if(kinky < 0.1) { //if this is a match to a single hit... //make sure that there is not a single hit match with greater energy! //is single hit match? if(working[i].entries==1) { if(singlehitmatch==0) { singlehitmatch=1; singlehite=working[i].e[0]; closest_d=ldt; closest_index=i; }else{ if(singlehite <working[i].e[0]) { singlehite = working[i].e[0]; closest_d=ldt; closest_index=i; } } }else{ closest_d=ldt; closest_index=i; singlehitmatch=0; } } } //printf("chain id %d cluster idx %d match %d\n",working[i].myId,j,match); } int notyetdone=1; //see if best match is more than 1 plane away.... //if it is, see if there is a working chain that had its tail at 1 plane away.... //but a hit in that chain at the same distance as this match is a better candidate.... if(closest_index>-1) { double zdist = fabs (working[closest_index].end_z-iz); double zplanedist = zdist / 0.035; if(zplanedist>1.4) { std::vector<int> matchidx; std::vector<int> matchentry; std::vector<double> matchdist; //iterate over working chains, look for hit in same plane as current best guess for(unsigned int i=0;i<working.size();i++) { if(closest_index==(int)i)continue;//we want to consider other chains... //consider chains with 2+ hits if(working[i].entries<2)continue; if(fabs(iz-working[i].end_z) * 1.2 <zdist); { //see if chain has hit in same plane as current candidate for(int j=0;j<working[i].entries;j++) { if(fabs(working[i].z[j] - working[closest_index].end_z)< 0.0175) //half a plane difference.... { matchidx.push_back(i); matchentry.push_back(j); double dist2 = (working[i].z[j]-iz)*(working[i].z[j]-iz) + (working[i].t[j]-it)*(working[i].t[j]-it) ; matchdist.push_back(dist2); } } } } int tmpi=-1; for(unsigned int i =0 ;i<matchdist.size();i++) { if(matchdist[i]< closest_d) { tmpi=i; closest_d=matchdist[i]; } } if(tmpi>-1) { //make a new chain with this hit.. and attach it to the chain Chain c; MSG("ChainHelper",Msg::kDebug) <<"starting new chain, attaching to old chain "<< c.myId << ", " << working[matchidx[tmpi]].myId <<endl; c.add_to_back(pending_t[j],pending_z[j],pending_e[j],pending_cluster_id[j]); //printf("!!! %d\n",pending_cluster_id[j]); tmpchain.push_back(AttachAt(&working[matchidx[tmpi]], &c,working[matchidx[tmpi]].z[matchentry[tmpi]])); tmpchain.push_back(c); notyetdone=0; } } } //this should consider direct pointing over closest match.... // if(closest_index<0) // { //make sure that there are no chains clearly pointing to this hit double pdistr=1000; int tmp_closest_index=-1; for(unsigned int i=0;i<working.size();i++) { if(closest_index==(int)i)continue;//we want to consider other chains... //consider chains with 2+ hits if(working[i].entries<2)continue; //double tpos = working[i].back_offset + working[i].back_slope*iz; double tpos =working[i].interpolate(iz); if(fabs(it-tpos)<0.025*1.5) { double rdist = (working[i].end_z-iz)*(working[i].end_z-iz)+(working[i].end_t-it)*(working[i].end_t-it); if(rdist < pdistr) { tmp_closest_index=i; pdistr=rdist; } } } if(pdistr<max_z_gap_temp && tmp_closest_index>-1)closest_index=tmp_closest_index; // } if(notyetdone) { if(closest_index>-1) { toadd[closest_index].push_back(j); }else{ //are we close to the vertex? //printf("pending z t %f %f vtx %f %f\n",pending_z[j],pending_t[j],vtx_z,vtx_t); if(vtx_z==0 || (fabs(pending_t[j]-vtx_t)<0.2 && fabs(pending_z[j]-vtx_z)<0.2)){ Chain c; MSG("ChainHelper",Msg::kDebug) <<"no match, starting new chain "<< c.myId <<endl; c.add_to_back(pending_t[j],pending_z[j],pending_e[j],pending_cluster_id[j]); //printf("!!! %d\n",pending_cluster_id[j]); //working.push_back(c); tmpchain.push_back(c); } } } } for(unsigned int i=0;i<tmpchain.size();i++) working.push_back(tmpchain[i]); // for(int i=0;i<wsize;i++) // { std::map<int, std::vector<int> >::iterator iter; for(iter=toadd.begin();iter!=toadd.end();iter++) { //int s = toadd[i].size()>0; int s = iter->second.size(); if(s==1) { int item=iter->second[0]; if(working[iter->first].children.size()>0) { Chain *t=split(&working[iter->first]); t->add_to_back(pending_t[item],pending_z[item],pending_e[item],pending_cluster_id[item]); working.push_back(*t); delete t;t=0; MSG("ChainHelper",Msg::kDebug) <<"---splitting chain "<< working[iter->first].myId <<" to make "<< t->myId <<endl; }else{ working[iter->first].add_to_back(pending_t[item],pending_z[item],pending_e[item],pending_cluster_id[item]); } MSG("ChainHelper",Msg::kDebug)<< "adding to chain "<<working[iter->first].myId<<endl; } if(s>1) { //need to copy the chains for(int k=0;k<s;k++) //s-1 { Chain *t=split(&working[iter->first]); int item=iter->second[k]; t->add_to_back(pending_t[item],pending_z[item],pending_e[item],pending_cluster_id[item]); working.push_back(*t); delete t;t=0; MSG("ChainHelper",Msg::kDebug)<< "---splitting chain " << working[iter->first].myId << " to make " << t->myId <<endl; } // int item=iter->second[s-1]; // working[iter->first].add_to_back(pending_t[item],pending_z[item],pending_e[item],pending_cluster_id[item]); // MSG("ChainHelper",Msg::kDebug)<<"adding to chain"<<endl; } } pending_t.clear(); pending_z.clear(); pending_e.clear(); pending_cluster_id.clear(); found_max_path=0; }

void ChainHelper::Reset (   )

Definition at line 142 of file ChainHelper.cxx. References emlikechains, finished, found_max_path, muonlikechains, parents, pending_cluster_id, pending_e, pending_t, pending_z, Chain::ResetCounter(), vtx_t, vtx_z, and working. { working.clear(); finished.clear(); pending_t.clear(); pending_z.clear(); pending_e.clear(); pending_cluster_id.clear(); Chain::ResetCounter(); found_max_path=0; parents=0; muonlikechains=0; emlikechains=0; vtx_z=0; vtx_t=0; }

void ChainHelper::SetDetector (  Detector::Detector_t  d  )  [inline]

Definition at line 64 of file ChainHelper.h. References detector. {detector=d;};

Chain * ChainHelper::split (  Chain *  d  )

Definition at line 579 of file ChainHelper.cxx. References Chain::add_to_back(), Chain::children, Chain::cluster_id, Chain::e, Chain::end_t, Chain::end_z, Chain::level, Chain::myId, Chain::parentChain, Chain::start_t, Chain::start_z, Chain::t, and Chain::z. Referenced by process_plane(). { Chain * r = new Chain(); r->parentChain=d->myId; r->start_t=d->end_t; r->start_z=d->end_z; r->level=d->level+1; int dsize=d->t.size()-1; r->add_to_back(d->t[dsize],d->z[dsize],d->e[dsize],d->cluster_id[dsize]); d->children.push_back(r->myId); //cout <<"????????? new id "<<r->myId << " split from "<<d->myId<<endl; return r; }

Chain * ChainHelper::SplitAt (  Chain *  c, double  splitpointz )

Definition at line 673 of file ChainHelper.cxx. References Chain::add_to_back(), AddFinishedChain(), Chain::children, Chain::ClearHits(), Chain::cluster_id, Chain::e, Chain::end_z, Chain::entries, GetChain(), Chain::level, Chain::myId, Chain::parentChain, Chain::start_z, Chain::t, and Chain::z. Referenced by Finder::FindVertex(), and Finder::RemoveNonVertexPointingChains(). { //printf("Request to split chain %d\n",c->myId); if(c->end_z < splitpointz || c->start_z > splitpointz || c->entries<1) { printf("CANT SPLIT CHAIN - split point out of chain range\n"); return c; // can't split up the chain if we are not in the chain... } std::vector<double> t; for(unsigned int i=0;i<c->t.size();i++)t.push_back(c->t[i]); std::vector<double> e; for(unsigned int i=0;i<c->e.size();i++)e.push_back(c->e[i]); std::vector<double> z; for(unsigned int i=0;i<c->z.size();i++)z.push_back(c->z[i]); std::vector<int> cid; for(unsigned int i=0;i<c->cluster_id.size();i++)cid.push_back(c->cluster_id[i]); //int pid = c->parentChain; std::vector<int> children; for(unsigned int i=0;i<c->children.size();i++)children.push_back(c->children[i]); double close = fabs(z[0]-splitpointz); int cidx=0; //find the split point for(unsigned int i=0;i<z.size();i++) { if(fabs(z[i]-splitpointz)<close) { close = fabs(z[i]-splitpointz); cidx=i; } } if (cidx==0 || cidx == (int)z.size()-1)return c; //cant split a chain at the first or last hit //printf("splitting at %d\n",cidx); Chain newc; c->ClearHits(); for(int i=0;i<=cidx;i++) { c->add_to_back(t[i],z[i],e[i],cid[i]); } c->children.clear(); c->children.push_back(newc.myId); for(unsigned int i=cidx;i<z.size();i++) //duplicate the head cluster { newc.add_to_back(t[i],z[i],e[i],cid[i]); } newc.parentChain = c->myId; for(unsigned int child = 0;child < children.size();child++) newc.children.push_back(children[child]); newc.level=c->level+1; //printf("storing....\n"); int retid = c->myId; AddFinishedChain(newc); //printf("done\n"); return GetChain(retid); //reget the pointer...... adding to the finished vector can change the addresses... }

---

Member Data Documentation

Detector::Detector_t ChainHelper::detector [private]

Definition at line 111 of file ChainHelper.h. Referenced by insert(), process_plane(), and SetDetector().

int ChainHelper::emlikechains

Definition at line 44 of file ChainHelper.h. Referenced by finish(), and Reset().

std::vector<Chain > ChainHelper::finished

Definition at line 38 of file ChainHelper.h. Referenced by AddFinishedChain(), ChangeHitId(), DeleteChain(), HoughView::DrawChains(), HitView::DrawChains(), ChainView::DrawChains(), FindMaxPath(), PrimaryShowerFinder::FindPrimaryShower(), Finder::FindVertex(), finish(), GetChain(), Finder::GetPaths(), PrimaryShowerFinder::MakeChains(), matchChains(), Finder::MergeChains(), print_finished(), Finder::RemoveNonVertexPointingChains(), Reset(), and ~ChainHelper().

int ChainHelper::found_max_path

Definition at line 93 of file ChainHelper.h. Referenced by add_to_plane(), AttachAsChild(), DeleteChain(), FindMaxPath(), matchChains(), process_plane(), and Reset().

std::map<int, int> ChainHelper::idhelper [private]

Definition at line 109 of file ChainHelper.h. Referenced by AddFinishedChain(), DeleteChain(), and ~ChainHelper().

double ChainHelper::max_slope

Definition at line 91 of file ChainHelper.h. Referenced by process_plane().

double ChainHelper::max_z_gap

Definition at line 90 of file ChainHelper.h.

std::vector<int> ChainHelper::maxpath

Definition at line 95 of file ChainHelper.h. Referenced by FindMaxPath(), and ~ChainHelper().

int ChainHelper::muonlikechains

Definition at line 43 of file ChainHelper.h. Referenced by finish(), and Reset().

int ChainHelper::parents

Definition at line 42 of file ChainHelper.h. Referenced by finish(), and Reset().

std::vector<Chain > ChainHelper::particles

Definition at line 40 of file ChainHelper.h. Referenced by Finder::FindMuons().

std::vector<int> ChainHelper::pending_cluster_id

Definition at line 85 of file ChainHelper.h. Referenced by add_to_plane(), process_plane(), Reset(), and ~ChainHelper().

std::vector<double> ChainHelper::pending_e

Definition at line 84 of file ChainHelper.h. Referenced by add_to_plane(), process_plane(), Reset(), and ~ChainHelper().

std::vector<double> ChainHelper::pending_t

Definition at line 82 of file ChainHelper.h. Referenced by add_to_plane(), process_plane(), Reset(), and ~ChainHelper().

std::vector<double> ChainHelper::pending_z

Definition at line 83 of file ChainHelper.h. Referenced by add_to_plane(), process_plane(), Reset(), and ~ChainHelper().

int ChainHelper::totalchains

Definition at line 45 of file ChainHelper.h. Referenced by finish().

double ChainHelper::vtx_t

Definition at line 104 of file ChainHelper.h. Referenced by Finder::MakeChains(), process_plane(), and Reset().

double ChainHelper::vtx_z

Definition at line 103 of file ChainHelper.h. Referenced by Finder::MakeChains(), process_plane(), and Reset().

std::vector<Chain > ChainHelper::working

Definition at line 37 of file ChainHelper.h. Referenced by finish(), insert(), process_plane(), Reset(), and ~ChainHelper().

---

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

• ChainHelper.h
• ChainHelper.cxx

---