1 #include "AliRICHHitMap.h"
3 ClassImp(AliRICHHitMap)
4 ClassImp(AliRICHHitMapA1)
6 AliRICHHitMapA1::AliRICHHitMapA1(AliRICHsegmentation *seg, TObjArray *dig)
9 fNpx = fSegmentation->Npx();
10 fNpy = fSegmentation->Npy();
11 fMaxIndex=2*(fNpx+1)*2*(fNpy+1)+2*fNpy;
13 fHitMap = new Int_t[fMaxIndex];
15 fNdigits = fDigits->GetEntriesFast();
20 AliRICHHitMapA1::~AliRICHHitMapA1()
22 // if (fDigits) delete fDigits;
23 if (fHitMap) delete[] fHitMap;
26 void AliRICHHitMapA1::Clear()
28 memset(fHitMap,0,sizeof(int)*fMaxIndex);
31 Int_t AliRICHHitMapA1::CheckedIndex(Int_t ix, Int_t iy)
33 Int_t index=2*fNpy*(ix+fNpx)+(iy+fNpy);
34 if (index > fMaxIndex) {
35 printf("\n \n \n Try to read/write outside array !!!! \n \n %d %d %d %d %d %d",ix,iy, fMaxIndex, index, fNpx, fNpy);
43 void AliRICHHitMapA1::FillHits()
45 Int_t ndigits = fDigits->GetEntriesFast();
46 printf("\n Filling hits into HitMap\n");
47 printf("FindRawClusters -- ndigits %d \n",ndigits);
50 for (Int_t ndig=0; ndig<fNdigits; ndig++) {
51 dig = (AliRICHdigit*)fDigits->UncheckedAt(ndig);
52 SetHit(dig->fPadX,dig->fPadY,ndig);
57 void AliRICHHitMapA1::SetHit(Int_t ix, Int_t iy, Int_t idigit)
59 // fHitMap[kMaxNpady*(ix+fNpx)+(iy+fNpy)]=idigit+1;
60 fHitMap[CheckedIndex(ix, iy)]=idigit+1;
63 void AliRICHHitMapA1::DeleteHit(Int_t ix, Int_t iy)
65 // fHitMap[kMaxNpady*(ix+fNpx)+(iy+fNpy)]=0;
66 fHitMap[CheckedIndex(ix, iy)]=0;
69 void AliRICHHitMapA1::FlagHit(Int_t ix, Int_t iy)
71 fHitMap[CheckedIndex(ix, iy)]=
72 -TMath::Abs(fHitMap[CheckedIndex(ix, iy)]);
75 Int_t AliRICHHitMapA1::GetHitIndex(Int_t ix, Int_t iy)
77 return TMath::Abs(fHitMap[CheckedIndex(ix, iy)])-1;
80 TObject* AliRICHHitMapA1::GetHit(Int_t ix, Int_t iy)
82 Int_t index=GetHitIndex(ix,iy);
83 // Force crash if index does not exist ! (Manu)
84 return (index <0) ? 0 : fDigits->UncheckedAt(GetHitIndex(ix,iy));
87 Flag_t AliRICHHitMapA1::TestHit(Int_t ix, Int_t iy)
89 Int_t inf=fHitMap[CheckedIndex(ix, iy)];
92 } else if (inf == 0) {