]>
Commit | Line | Data |
---|---|---|
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 | ||
16 | /* $Id$ */ | |
17 | ||
18 | ////////////////////////////////////////////////////////////////////////////// | |
19 | // Clusterization class for IHEP reconstruction. | |
20 | // Performs clusterization (collects neighbouring active cells) | |
21 | // It differs from AliPHOSClusterizerv1 in neighbour definition only | |
22 | //*-- Author: Boris Polichtchouk, IHEP | |
23 | ||
24 | // --- ROOT system --- | |
25 | #include "TBenchmark.h" | |
26 | ||
27 | // --- Standard library --- | |
28 | ||
29 | // --- AliRoot header files --- | |
30 | #include "AliPHOSClusterizerv2.h" | |
31 | #include "AliPHOSGetter.h" | |
32 | #include "TFolder.h" | |
33 | #include "AliPHOSEvalRecPoint.h" | |
34 | #include "AliPHOSRecCpvManager.h" | |
35 | #include "AliPHOSRecEmcManager.h" | |
36 | #include "AliPHOSGeometry.h" | |
37 | ||
38 | ClassImp(AliPHOSClusterizerv2) | |
39 | ||
40 | //____________________________________________________________________________ | |
41 | AliPHOSClusterizerv2::AliPHOSClusterizerv2() : AliPHOSClusterizerv1() | |
42 | {} | |
43 | ||
44 | //____________________________________________________________________________ | |
45 | AliPHOSClusterizerv2::AliPHOSClusterizerv2(const char * headerFile, const char * name): | |
46 | AliPHOSClusterizerv1(headerFile,name) | |
47 | {} | |
48 | ||
49 | //____________________________________________________________________________ | |
50 | AliPHOSClusterizerv2::AliPHOSClusterizerv2(const AliPHOSClusterizerv2 & clu): | |
51 | AliPHOSClusterizerv1(clu) | |
52 | {} | |
53 | ||
54 | //____________________________________________________________________________ | |
55 | void AliPHOSClusterizerv2::GetNumberOfClustersFound(int* numb) const | |
56 | { | |
57 | // Returns the number of found EMC and CPV rec.points | |
58 | ||
59 | AliPHOSGetter * gime = AliPHOSGetter::Instance() ; | |
60 | numb[0] = gime->EmcRecPoints()->GetEntries(); | |
61 | numb[1] = gime->CpvRecPoints()->GetEntries(); | |
62 | } | |
63 | ||
64 | //____________________________________________________________________________ | |
65 | void AliPHOSClusterizerv2::Exec(Option_t* option) | |
66 | { | |
67 | // Steering method | |
68 | ||
69 | if(strstr(option,"tim")) | |
70 | gBenchmark->Start("PHOSClusterizer"); | |
71 | ||
72 | if(strstr(option,"print")) | |
73 | Print() ; | |
74 | ||
75 | AliPHOSGetter * gime = AliPHOSGetter::Instance() ; | |
76 | ||
77 | TFolder* wPoolF = gime->PhosLoader()->GetDetectorDataFolder(); | |
78 | ||
79 | TObjArray* wPool = new TObjArray(400); | |
80 | wPool->SetName("SmartPoints"); | |
81 | wPoolF->Add(wPool); | |
82 | wPoolF->Add(this); | |
83 | ||
84 | Int_t nevents = gime->MaxEvent() ; | |
85 | Int_t ievent ; | |
86 | ||
87 | for(ievent = 0; ievent<nevents; ievent++) { | |
88 | ||
89 | gime->Event(ievent,"D") ; | |
90 | ||
91 | Info("Exec", "MakeClusters invoked..") ; | |
92 | MakeClusters() ; | |
93 | Info("Exec", "MakeClusters done.") ; | |
94 | ||
95 | ||
96 | //SmartRecPoints will communicate with wPool. | |
97 | ||
98 | AliPHOSEvalRecPoint* rp=0; | |
99 | ||
100 | // CPV reconstruction | |
101 | ||
102 | AliPHOSRecCpvManager* recCpv = new AliPHOSRecCpvManager(); | |
103 | wPoolF->Add(recCpv); | |
104 | ||
105 | Int_t iPoint; //loop variable | |
106 | ||
107 | for(iPoint=0; iPoint<gime->CpvRecPoints()->GetEntriesFast(); iPoint++) { | |
108 | rp = new AliPHOSEvalRecPoint(iPoint, kTRUE); | |
109 | rp->MakeJob(); | |
110 | } | |
111 | ||
112 | AliPHOSEvalRecPoint pt; | |
113 | pt.UpdateWorkingPool(); | |
114 | ||
115 | TObjArray * cpvRecPoints = gime->CpvRecPoints() ; | |
116 | Int_t nOldCpv = cpvRecPoints->GetEntries(); | |
117 | cpvRecPoints->Delete(); | |
118 | cpvRecPoints->Compress(); | |
119 | ||
120 | Int_t i; //loop variable | |
121 | ||
122 | for(i=0; i<wPool->GetEntries(); i++) | |
123 | cpvRecPoints->Add(wPool->At(i)); | |
124 | ||
125 | wPool->Clear(); | |
126 | wPool->Compress(); | |
127 | ||
128 | wPoolF->Remove(recCpv); | |
129 | delete recCpv; | |
130 | ||
131 | Info("Exec", " %d", gime->CpvRecPoints()->GetEntries() ) ; | |
132 | Info("Exec", " %d cpvRecPoints", cpvRecPoints->GetEntries() ) ; | |
133 | ||
134 | ||
135 | // Now Emc reconstruction | |
136 | ||
137 | AliPHOSRecEmcManager* recEmc = new AliPHOSRecEmcManager(); | |
138 | wPoolF->Add(recEmc); | |
139 | ||
140 | for(iPoint=0; iPoint<gime->EmcRecPoints()->GetEntriesFast(); iPoint++) { | |
141 | rp = new AliPHOSEvalRecPoint(iPoint, kFALSE); | |
142 | rp->MakeJob(); | |
143 | } | |
144 | ||
145 | pt.UpdateWorkingPool(); | |
146 | ||
147 | TObjArray * emcRecPoints = gime->EmcRecPoints() ; | |
148 | Int_t nOldEmc = emcRecPoints->GetEntries(); | |
149 | emcRecPoints->Delete(); | |
150 | emcRecPoints->Compress(); | |
151 | ||
152 | for(i=0; i<wPool->GetEntries(); i++) | |
153 | emcRecPoints->Add(wPool->At(i)); | |
154 | ||
155 | wPool->Clear(); | |
156 | wPool->Compress(); | |
157 | ||
158 | wPoolF->Remove(recEmc); | |
159 | delete recEmc; | |
160 | ||
161 | TString message ; | |
162 | message = " %d OLD cpvRecPoints\n" ; | |
163 | message += " %d\n" ; | |
164 | message += " %d cpvRecPoints\n" ; | |
165 | ||
166 | message += " %d OLD emcRecPoints " ; | |
167 | message += " %d\n" ; | |
168 | message += " %d emcRecPoints\n" ; | |
169 | ||
170 | Info("Exec", message.Data(), | |
171 | nOldCpv, | |
172 | gime->CpvRecPoints()->GetEntries(),cpvRecPoints->GetEntries(), | |
173 | nOldEmc, | |
174 | gime->EmcRecPoints()->GetEntries(), emcRecPoints->GetEntries() ) ; | |
175 | ||
176 | WriteRecPoints(); | |
177 | ||
178 | ||
179 | } // loop over events | |
180 | ||
181 | if(strstr(option,"tim")) { | |
182 | gBenchmark->Stop("PHOSClusterizer"); | |
183 | Info("Exec","took %f seconds for Clusterizing", gBenchmark->GetCpuTime("PHOSClusterizer") ) ; | |
184 | } | |
185 | } | |
186 | ||
187 | //____________________________________________________________________________ | |
188 | Int_t AliPHOSClusterizerv2::AreNeighbours(AliPHOSDigit* d1, AliPHOSDigit* d2) const | |
189 | { | |
190 | // Points are neighbours if they have common edge. | |
191 | // Points with common vertex are NOT neighbours. | |
192 | // This treatment of neighbourship is the part of | |
193 | // IHEP algorithm of clusterization. | |
194 | ||
195 | // Gives the neighbourness of two digits = 0 are not neighbour but continue searching | |
196 | // = 1 are neighbour | |
197 | // = 2 are not neighbour but do not continue searching | |
198 | // The order of d1 and d2 is important: first (d1) should be a digit already in a cluster | |
199 | // which is compared to a digit (d2) not yet in a cluster | |
200 | ||
201 | const AliPHOSGeometry * geom = AliPHOSGetter::Instance()->PHOSGeometry(); | |
202 | ||
203 | Int_t rv = 0 ; | |
204 | ||
205 | Int_t relid1[4] ; | |
206 | geom->AbsToRelNumbering(d1->GetId(), relid1) ; | |
207 | ||
208 | Int_t relid2[4] ; | |
209 | geom->AbsToRelNumbering(d2->GetId(), relid2) ; | |
210 | ||
211 | if ( (relid1[0] == relid2[0]) && (relid1[1]==relid2[1]) ) { // inside the same PHOS module and the same PPSD Module | |
212 | Int_t rowdiff = TMath::Abs( relid1[2] - relid2[2] ) ; | |
213 | Int_t coldiff = TMath::Abs( relid1[3] - relid2[3] ) ; | |
214 | ||
215 | if ( ( (coldiff < 1) && (rowdiff <= 1) ) || ( ( coldiff <= 1 ) && ( rowdiff < 1 ) ) ){ | |
216 | rv = 1 ; | |
217 | } | |
218 | else { | |
219 | if((relid2[2] > relid1[2]) && (relid2[3] > relid1[3]+1)) | |
220 | rv = 2; // Difference in row numbers is too large to look further | |
221 | } | |
222 | ||
223 | } | |
224 | else { | |
225 | ||
226 | if( (relid1[0] < relid2[0]) || (relid1[1] < relid2[1]) ) | |
227 | rv=2 ; | |
228 | ||
229 | } | |
230 | ||
231 | return rv ; | |
232 | ||
233 | } |