36 bool Neighbours=
false;
42 if ((*Rating)<
MinRating) {(*Rating)--;
return 0;}
43 else {(*Rating)--;
return 1;}
44 for(
int cX=iX-1;cX<=iX+1;cX++)
for(
int cY=iY-1;cY<=iY+1;cY++)
48 farr=(TObjArray*)(
Volume->At(ind));
49 if(farr->GetEntries()>0 && !Neighbours) { Neighbours=
true;}
50 for(
int j=0;j<farr->GetEntries();j++)
56 if((*Rating)>0) printf(
"Propagate(%d, %d,%d,%d) returned %d\n",(*Rating),iX,iY,iZ, res);
61 if(!Neighbours && (*Rating)<
MinRating) {(*Rating)--;
return 0;}
int NCellY
Definition: AcqTrackReconstructor.cxx:27
int NCellZ
Definition: AcqTrackReconstructor.cxx:27
TObjArray * Volume
Definition: AcqTrackReconstructor.cxx:28
int Propagate(int *Rating, int iX, int iY, int iZ)
Definition: AcqTrackReconstructor.cxx:32
int NCellX
Definition: AcqTrackReconstructor.cxx:27
int MinRating
Definition: AcqTrackReconstructor.cxx:29
Definition: EdbCluster.h:19
Int_t GetSegment() const
Definition: EdbCluster.h:58
void SetSegment(int seg)
Definition: EdbCluster.h:49