1 #include "AliRICHHitMap.h"
3 ClassImp(AliRICHHitMap)
4 ClassImp(AliRICHHitMapA1)
9 AliRICHHitMapA1::AliRICHHitMapA1(AliRICHsegmentation *seg, TObjArray *dig)
12 fNpx = fSegmentation->Npx();
13 fNpy = fSegmentation->Npy();
14 fMaxIndex=2*(fNpx+1)*2*(fNpy+1)+2*fNpy;
16 fHitMap = new Int_t[fMaxIndex];
18 fNdigits = fDigits->GetEntriesFast();
23 AliRICHHitMapA1::~AliRICHHitMapA1()
25 // if (fDigits) delete fDigits;
26 if (fHitMap) delete[] fHitMap;
29 void AliRICHHitMapA1::Clear(Option_t *)
31 memset(fHitMap,0,sizeof(int)*fMaxIndex);
34 Int_t AliRICHHitMapA1::CheckedIndex(Int_t ix, Int_t iy)
36 Int_t index=2*fNpy*(ix+fNpx)+(iy+fNpy);
37 if (index > fMaxIndex) {
38 printf("\n \n \n Try to read/write outside array !!!! \n \n %d %d %d %d %d %d",ix,iy, fMaxIndex, index, fNpx, fNpy);
46 void AliRICHHitMapA1::FillHits()
48 Int_t ndigits = fDigits->GetEntriesFast();
49 printf("\n Filling hits into HitMap\n");
50 printf("FindRawClusters -- ndigits %d \n",ndigits);
53 for (Int_t ndig=0; ndig<fNdigits; ndig++) {
54 dig = (AliRICHdigit*)fDigits->UncheckedAt(ndig);
55 SetHit(dig->fPadX,dig->fPadY,ndig);
60 void AliRICHHitMapA1::SetHit(Int_t ix, Int_t iy, Int_t idigit)
62 // fHitMap[kMaxNpady*(ix+fNpx)+(iy+fNpy)]=idigit+1;
63 fHitMap[CheckedIndex(ix, iy)]=idigit+1;
66 void AliRICHHitMapA1::DeleteHit(Int_t ix, Int_t iy)
68 // fHitMap[kMaxNpady*(ix+fNpx)+(iy+fNpy)]=0;
69 fHitMap[CheckedIndex(ix, iy)]=0;
72 void AliRICHHitMapA1::FlagHit(Int_t ix, Int_t iy)
74 fHitMap[CheckedIndex(ix, iy)]=
75 -TMath::Abs(fHitMap[CheckedIndex(ix, iy)]);
78 Int_t AliRICHHitMapA1::GetHitIndex(Int_t ix, Int_t iy)
80 return TMath::Abs(fHitMap[CheckedIndex(ix, iy)])-1;
83 TObject* AliRICHHitMapA1::GetHit(Int_t ix, Int_t iy)
85 Int_t index=GetHitIndex(ix,iy);
86 // Force crash if index does not exist ! (Manu)
87 return (index <0) ? 0 : fDigits->UncheckedAt(GetHitIndex(ix,iy));
90 Flag_t AliRICHHitMapA1::TestHit(Int_t ix, Int_t iy)
92 Int_t inf=fHitMap[CheckedIndex(ix, iy)];
95 } else if (inf == 0) {