3 // Author: Uli Frankenfeld <mailto:franken@fi.uib.no>
4 //*-- Copyright © ALICE HLT Group
6 #include "AliL3StandardIncludes.h"
8 #include "AliL3Logging.h"
9 #include "AliL3VertexArray.h"
12 /** \class AliL3VertexArray
14 //_____________________________________________________________
17 // The L3 Fast Vertex Finder Base Class
21 //for(Int_t sec=0;sec<NSEC;sec++){
23 // FillSectorSeed3D(x,y,z);
24 // FillSector3D(x,y,z);
25 // FindSectorVertex();
26 // Double_t z = GetZSector();
27 // Double_t zerr = GetZSectorErr();
28 // // do somethink with z, zerr
37 ClassImp(AliL3VertexArray)
39 void AliL3VertexArray::AnalyzeSector(Float_t *vertex, Int_t *array, Int_t len)
41 //loop over all seeds and all vertex position
42 LOG(AliL3Log::kInformational,"AliL3VertexArray::AnalyzeSector","Analyze")
43 <<AliL3Log::kDec<<"Number of Seeds: "<<fNSeed<<ENDLOG;
44 for(Int_t i =0;i<fNSeed;i++)
45 for(Int_t bin = 0;bin<len;bin++)
46 array[bin] += Trace(fZSeed[i],fRSeed[i],fSecSeed[i],vertex[bin]);
49 void AliL3VertexArray::FindSectorVertex(Double_t pos, Double_t range, Int_t nbin)
51 //define position and range for search and
53 //and find position of vertex and error
54 const Int_t klen = nbin;
55 const Double_t kwidth = range;
56 const Double_t kxmin = pos - kwidth/2;
57 const Double_t kstep = kwidth/klen;
58 const Double_t kstart = kxmin + kstep/2.;
59 Int_t * array = new Int_t[klen];
60 Float_t * ver = new Float_t[klen];
61 for(Int_t i=0;i<klen;i++){
62 ver[i] = kstart + kstep * i;
65 AnalyzeSector(ver,array,klen);
66 FindMean(ver,array,klen);
71 void AliL3VertexArray::FindMean(Float_t *vertex,Int_t *array, Int_t len)
73 //find mean and error of array and store it in
74 //fZSector and fZSectorErr
75 const Int_t knbin = len;
78 for(Int_t i = 0;i<knbin;i++){
89 if(xmin<0) {ops++;break;}
90 if(array[xmin]<hmax) {
96 if(xmax>=knbin) {ops++;break;}
102 if(xbin >= knbin/2){xmin = 2 * xbin - knbin +1;xmax = knbin-1;}
103 else{xmin = 0;xmax = 2 * xbin;}
109 for(Int_t bin = xmin;bin<=xmax;bin++){
111 sumw2 += array[bin] * array[bin];
112 sumwx += array[bin] * vertex[bin];
113 sumwx2 += array[bin] * vertex[bin] * vertex[bin];
116 Double_t mean = sumwx/sumw;
117 Double_t rms2 = fabs(sumwx2/sumw - mean*mean);
118 fZSectorErr = sqrt(rms2/sumw);
121 else{fZSectorErr = fZSector = 0;}
122 sumw=sumw2=sumwx=sumwx2=0;
123 for(Int_t bin = 0;bin<knbin;bin++){
125 sumw2 += array[bin] * array[bin];
126 sumwx += array[bin] * vertex[bin];
127 sumwx2 += array[bin] * vertex[bin] * vertex[bin];
130 Double_t mean = fZSector;
131 Double_t rms2 = fabs(sumwx2/sumw - mean*mean);
132 fZSectorErr = sqrt(rms2/sumw);