]>
Commit | Line | Data |
---|---|---|
a9e2aefa | 1 | /************************************************************************** |
2 | * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. * | |
3 | * * | |
4 | * Author: The ALICE Off-line Project. * | |
5 | * Contributors are mentioned in the code where appropriate. * | |
6 | * * | |
7 | * Permission to use, copy, modify and distribute this software and its * | |
8 | * documentation strictly for non-commercial purposes is hereby granted * | |
9 | * without fee, provided that the above copyright notice appears in all * | |
10 | * copies and that both the copyright notice and this permission notice * | |
11 | * appear in the supporting documentation. The authors make no claims * | |
12 | * about the suitability of this software for any purpose. It is * | |
13 | * provided "as is" without express or implied warranty. * | |
14 | **************************************************************************/ | |
15 | ||
88cb7938 | 16 | /* $Id$ */ |
a9e2aefa | 17 | |
30178c30 | 18 | #include <TObjArray.h> |
19 | #include <TMath.h> | |
20 | ||
a9e2aefa | 21 | #include "AliMUONHitMapA1.h" |
a30a000f | 22 | #include "AliSegmentation.h" |
a9e2aefa | 23 | #include "AliMUONDigit.h" |
8c343c7c | 24 | #include "AliLog.h" |
a9e2aefa | 25 | |
a9e2aefa | 26 | ClassImp(AliMUONHitMapA1) |
27 | ||
30178c30 | 28 | AliMUONHitMapA1::AliMUONHitMapA1() |
29 | : AliHitMap() | |
0a5f9c41 | 30 | { |
31 | // Default constructor | |
0a5f9c41 | 32 | fNpx = 0; |
33 | fNpy = 0; | |
34 | fMaxIndex = 0; | |
35 | ||
36 | fHitMap = 0; | |
37 | fDigits = 0; | |
0a5f9c41 | 38 | } |
a9e2aefa | 39 | |
a30a000f | 40 | AliMUONHitMapA1::AliMUONHitMapA1(AliSegmentation *seg, TObjArray *dig) |
30178c30 | 41 | : AliHitMap() |
a9e2aefa | 42 | { |
43 | // Constructor | |
2186f543 | 44 | fNpx = seg->Npx()+1; |
45 | fNpy = seg->Npy()+1; | |
a9e2aefa | 46 | fMaxIndex=2*(fNpx+1)*2*(fNpy+1)+2*fNpy; |
47 | ||
48 | fHitMap = new Int_t[fMaxIndex]; | |
49 | fDigits = dig; | |
a9e2aefa | 50 | Clear(); |
51 | } | |
52 | ||
30178c30 | 53 | AliMUONHitMapA1::AliMUONHitMapA1(const AliMUONHitMapA1 & hitMap) |
54 | : AliHitMap(hitMap) | |
a9e2aefa | 55 | { |
30178c30 | 56 | // Protected copy constructor |
57 | ||
8c343c7c | 58 | AliFatal("Not implemented."); |
a9e2aefa | 59 | } |
60 | ||
61 | ||
62 | AliMUONHitMapA1::~AliMUONHitMapA1() | |
63 | { | |
64 | // Destructor | |
a9e2aefa | 65 | if (fHitMap) delete[] fHitMap; |
66 | } | |
67 | ||
ef42d733 | 68 | void AliMUONHitMapA1::Clear(const char *) |
a9e2aefa | 69 | { |
70 | // Clear hitmap | |
71 | memset(fHitMap,0,sizeof(int)*fMaxIndex); | |
72 | } | |
73 | ||
d91b86b7 | 74 | Bool_t AliMUONHitMapA1::ValidateHit(Int_t ix, Int_t iy) |
75 | { | |
76 | // | |
77 | // Check if pad coordinates are within boundaries | |
78 | // | |
79 | // printf("\n Validate %d %d %d %d", ix, iy, fNpx, fNpy); | |
80 | ||
81 | return (TMath::Abs(ix) <= fNpx && TMath::Abs(iy) <= fNpy); | |
82 | } | |
83 | ||
94de3818 | 84 | Int_t AliMUONHitMapA1::CheckedIndex(Int_t ix, Int_t iy) const |
a9e2aefa | 85 | { |
86 | // Return checked indices ix, iy | |
87 | Int_t index=2*fNpy*(ix+fNpx)+(iy+fNpy); | |
654fdb44 | 88 | if (index >= fMaxIndex) { |
453e4e5c | 89 | // printf("\n \n \n Try to read/write outside array !!!! \n \n %d %d %d %d %d %d", |
90 | // ix,iy, fMaxIndex, index, fNpx, fNpy); | |
a9e2aefa | 91 | return fMaxIndex-1; |
92 | } else { | |
93 | return index; | |
94 | } | |
95 | } | |
96 | ||
97 | ||
98 | void AliMUONHitMapA1::FillHits() | |
99 | { | |
100 | // Fill hits from digits list | |
101 | Int_t ndigits = fDigits->GetEntriesFast(); | |
102 | //printf("\n Filling hits into HitMap\n"); | |
103 | //printf("FindRawClusters -- ndigits %d \n",ndigits); | |
104 | if (!ndigits) return; | |
105 | AliMUONDigit *dig; | |
2186f543 | 106 | for (Int_t ndig=0; ndig<ndigits; ndig++) { |
a9e2aefa | 107 | dig = (AliMUONDigit*)fDigits->UncheckedAt(ndig); |
1939e822 | 108 | SetHit(dig->PadX(),dig->PadY(),ndig); |
a9e2aefa | 109 | } |
110 | } | |
111 | ||
112 | ||
113 | void AliMUONHitMapA1::SetHit(Int_t ix, Int_t iy, Int_t idigit) | |
114 | { | |
115 | // Assign digit to hit cell ix,iy | |
116 | // fHitMap[kMaxNpady*(ix+fNpx)+(iy+fNpy)]=idigit+1; | |
117 | fHitMap[CheckedIndex(ix, iy)]=idigit+1; | |
118 | } | |
119 | ||
120 | void AliMUONHitMapA1::DeleteHit(Int_t ix, Int_t iy) | |
121 | { | |
122 | // Delete hit at cell ix,iy | |
123 | // fHitMap[kMaxNpady*(ix+fNpx)+(iy+fNpy)]=0; | |
124 | fHitMap[CheckedIndex(ix, iy)]=0; | |
125 | } | |
126 | ||
127 | void AliMUONHitMapA1::FlagHit(Int_t ix, Int_t iy) | |
128 | { | |
129 | // Flag hit as used | |
130 | fHitMap[CheckedIndex(ix, iy)]= | |
131 | -TMath::Abs(fHitMap[CheckedIndex(ix, iy)]); | |
132 | } | |
133 | ||
94de3818 | 134 | Int_t AliMUONHitMapA1::GetHitIndex(Int_t ix, Int_t iy) const |
a9e2aefa | 135 | { |
136 | // Get absolute value of contents of hit cell ix,iy | |
137 | return TMath::Abs(fHitMap[CheckedIndex(ix, iy)])-1; | |
138 | } | |
139 | ||
94de3818 | 140 | TObject* AliMUONHitMapA1::GetHit(Int_t ix, Int_t iy) const |
a9e2aefa | 141 | { |
142 | // Get pointer to object at hit cell ix, iy | |
143 | // Force crash if index does not exist ! (Manu) | |
144 | Int_t index=GetHitIndex(ix,iy); | |
145 | return (index <0) ? 0 : fDigits->UncheckedAt(GetHitIndex(ix,iy)); | |
146 | } | |
147 | ||
148 | FlagType AliMUONHitMapA1::TestHit(Int_t ix, Int_t iy) | |
149 | { | |
150 | // Check if hit cell is empty, used or unused | |
151 | // | |
152 | Int_t inf=fHitMap[CheckedIndex(ix, iy)]; | |
153 | if (inf < 0) { | |
154 | return kUsed; | |
155 | } else if (inf == 0) { | |
156 | return kEmpty; | |
157 | } else { | |
158 | return kUnused; | |
159 | } | |
160 | } | |
161 | ||
30178c30 | 162 | AliMUONHitMapA1 & AliMUONHitMapA1::operator = (const AliMUONHitMapA1 & rhs) |
a9e2aefa | 163 | { |
30178c30 | 164 | // Protected assignement operator |
165 | ||
166 | if (this == &rhs) return *this; | |
167 | ||
8c343c7c | 168 | AliFatal( "Not implemented."); |
30178c30 | 169 | |
170 | return *this; | |
a9e2aefa | 171 | } |
172 | ||
173 | ||
bad7e393 | 174 | |
175 | ||
176 |