1 /**************************************************************************
2 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
4 * Author: The ALICE Off-line Project. *
5 * Contributors are mentioned in the code where appropriate. *
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 **************************************************************************/
17 //-------------------------------------------------------
18 // Implementation of the TPC tracker
20 // Origin: Marian Ivanov Marian.Ivanov@cern.ch
22 // AliTPC parallel tracker -
24 // run AliTPCFindClusters.C macro - clusters neccessary for tracker are founded
25 // run AliTPCFindTracksMI.C macro - to find tracks
26 // tracks are written to AliTPCtracks.root file
27 // for comparison also seeds are written to the same file - to special branch
28 //-------------------------------------------------------
35 #include "Riostream.h"
36 #include <TClonesArray.h>
38 #include <TObjArray.h>
41 #include "AliComplexCluster.h"
44 #include "AliRunLoader.h"
45 #include "AliTPCClustersRow.h"
46 #include "AliTPCParam.h"
47 #include "AliTPCclusterMI.h"
48 #include "AliTPCpolyTrack.h"
49 #include "AliTPCreco.h"
50 #include "AliTPCtrackerMI.h"
51 #include "TStopwatch.h"
55 ClassImp(AliTPCtrackerMI)
58 class AliTPCFastMath {
61 static Double_t FastAsin(Double_t x);
63 static Double_t fgFastAsin[20000]; //lookup table for fast asin computation
66 Double_t AliTPCFastMath::fgFastAsin[20000];
67 AliTPCFastMath gAliTPCFastMath; // needed to fill the LUT
69 AliTPCFastMath::AliTPCFastMath(){
71 // initialized lookup table;
72 for (Int_t i=0;i<10000;i++){
73 fgFastAsin[2*i] = TMath::ASin(i/10000.);
74 fgFastAsin[2*i+1] = (TMath::ASin((i+1)/10000.)-fgFastAsin[2*i]);
78 Double_t AliTPCFastMath::FastAsin(Double_t x){
80 // return asin using lookup table
82 Int_t index = int(x*10000);
83 return fgFastAsin[2*index]+(x*10000.-index)*fgFastAsin[2*index+1];
86 Int_t index = int(x*10000);
87 return -(fgFastAsin[2*index]+(x*10000.-index)*fgFastAsin[2*index+1]);
93 Int_t AliTPCtrackerMI::UpdateTrack(AliTPCseed * track, Int_t accept){
95 //update track information using current cluster - track->fCurrentCluster
98 AliTPCclusterMI* c =track->fCurrentCluster;
99 if (accept>0) track->fCurrentClusterIndex1 |=0x8000; //sign not accepted clusters
101 UInt_t i = track->fCurrentClusterIndex1;
103 Int_t sec=(i&0xff000000)>>24;
104 //Int_t row = (i&0x00ff0000)>>16;
105 track->fRow=(i&0x00ff0000)>>16;
106 track->fSector = sec;
107 // Int_t index = i&0xFFFF;
108 if (sec>=fParam->GetNInnerSector()) track->fRow += fParam->GetNRowLow();
109 track->SetClusterIndex2(track->fRow, i);
110 //track->fFirstPoint = row;
111 //if ( track->fLastPoint<row) track->fLastPoint =row;
112 // if (track->fRow<0 || track->fRow>160) {
113 // printf("problem\n");
115 if (track->fFirstPoint>track->fRow)
116 track->fFirstPoint = track->fRow;
117 if (track->fLastPoint<track->fRow)
118 track->fLastPoint = track->fRow;
121 track->fClusterPointer[track->fRow] = c;
124 Float_t angle2 = track->GetSnp()*track->GetSnp();
125 angle2 = TMath::Sqrt(angle2/(1-angle2));
127 //SET NEW Track Point
131 AliTPCTrackerPoint &point =*(track->GetTrackPoint(track->fRow));
133 point.SetSigmaY(c->GetSigmaY2()/track->fCurrentSigmaY2);
134 point.SetSigmaZ(c->GetSigmaZ2()/track->fCurrentSigmaZ2);
135 point.SetErrY(sqrt(track->fErrorY2));
136 point.SetErrZ(sqrt(track->fErrorZ2));
138 point.SetX(track->GetX());
139 point.SetY(track->GetY());
140 point.SetZ(track->GetZ());
141 point.SetAngleY(angle2);
142 point.SetAngleZ(track->GetTgl());
143 if (point.fIsShared){
144 track->fErrorY2 *= 4;
145 track->fErrorZ2 *= 4;
149 Double_t chi2 = track->GetPredictedChi2(track->fCurrentCluster);
151 track->fErrorY2 *= 1.3;
152 track->fErrorY2 += 0.01;
153 track->fErrorZ2 *= 1.3;
154 track->fErrorZ2 += 0.005;
156 if (accept>0) return 0;
157 if (track->GetNumberOfClusters()%20==0){
158 // if (track->fHelixIn){
159 // TClonesArray & larr = *(track->fHelixIn);
160 // Int_t ihelix = larr.GetEntriesFast();
161 // new(larr[ihelix]) AliHelix(*track) ;
164 track->fNoCluster =0;
165 return track->Update(c,chi2,i);
170 Int_t AliTPCtrackerMI::AcceptCluster(AliTPCseed * seed, AliTPCclusterMI * cluster, Float_t factor,
171 Float_t cory, Float_t corz)
174 // decide according desired precision to accept given
175 // cluster for tracking
176 Double_t sy2=ErrY2(seed,cluster)*cory;
177 Double_t sz2=ErrZ2(seed,cluster)*corz;
178 //sy2=ErrY2(seed,cluster)*cory;
179 //sz2=ErrZ2(seed,cluster)*cory;
181 Double_t sdistancey2 = sy2+seed->GetSigmaY2();
182 Double_t sdistancez2 = sz2+seed->GetSigmaZ2();
184 Double_t rdistancey2 = (seed->fCurrentCluster->GetY()-seed->GetY())*
185 (seed->fCurrentCluster->GetY()-seed->GetY())/sdistancey2;
186 Double_t rdistancez2 = (seed->fCurrentCluster->GetZ()-seed->GetZ())*
187 (seed->fCurrentCluster->GetZ()-seed->GetZ())/sdistancez2;
189 Double_t rdistance2 = rdistancey2+rdistancez2;
192 if (rdistance2>16) return 3;
195 if ((rdistancey2>9.*factor || rdistancez2>9.*factor) && cluster->GetType()==0)
196 return 2; //suspisiouce - will be changed
198 if ((rdistancey2>6.25*factor || rdistancez2>6.25*factor) && cluster->GetType()>0)
199 // strict cut on overlaped cluster
200 return 2; //suspisiouce - will be changed
202 if ( (rdistancey2>1.*factor || rdistancez2>6.25*factor )
203 && cluster->GetType()<0){
213 //_____________________________________________________________________________
214 AliTPCtrackerMI::AliTPCtrackerMI(const AliTPCParam *par):
215 AliTracker(), fkNIS(par->GetNInnerSector()/2), fkNOS(par->GetNOuterSector()/2)
217 //---------------------------------------------------------------------
218 // The main TPC tracker constructor
219 //---------------------------------------------------------------------
220 fInnerSec=new AliTPCSector[fkNIS];
221 fOuterSec=new AliTPCSector[fkNOS];
224 for (i=0; i<fkNIS; i++) fInnerSec[i].Setup(par,0);
225 for (i=0; i<fkNOS; i++) fOuterSec[i].Setup(par,1);
232 Int_t nrowlow = par->GetNRowLow();
233 Int_t nrowup = par->GetNRowUp();
236 for (Int_t i=0;i<nrowlow;i++){
237 fXRow[i] = par->GetPadRowRadiiLow(i);
238 fPadLength[i]= par->GetPadPitchLength(0,i);
239 fYMax[i] = fXRow[i]*TMath::Tan(0.5*par->GetInnerAngle());
243 for (Int_t i=0;i<nrowup;i++){
244 fXRow[i+nrowlow] = par->GetPadRowRadiiUp(i);
245 fPadLength[i+nrowlow] = par->GetPadPitchLength(60,i);
246 fYMax[i+nrowlow] = fXRow[i+nrowlow]*TMath::Tan(0.5*par->GetOuterAngle());
258 //________________________________________________________________________
259 AliTPCtrackerMI::AliTPCtrackerMI(const AliTPCtrackerMI &t):
264 //------------------------------------
265 // dummy copy constructor
266 //------------------------------------------------------------------
268 AliTPCtrackerMI & AliTPCtrackerMI::operator=(const AliTPCtrackerMI& /*r*/){
269 //------------------------------
271 //--------------------------------------------------------------
274 //_____________________________________________________________________________
275 AliTPCtrackerMI::~AliTPCtrackerMI() {
276 //------------------------------------------------------------------
277 // TPC tracker destructor
278 //------------------------------------------------------------------
287 void AliTPCtrackerMI::SetIO()
291 fInput = AliRunLoader::GetTreeR("TPC", kFALSE,AliConfig::GetDefaultEventFolderName());
293 fOutput = AliRunLoader::GetTreeT("TPC", kTRUE,AliConfig::GetDefaultEventFolderName());
295 AliTPCtrack *iotrack= new AliTPCtrack;
296 fOutput->Branch("tracks","AliTPCtrack",&iotrack,32000,100);
302 void AliTPCtrackerMI::SetIO(TTree * input, TTree * output, AliESD * event)
318 AliTPCtrack *iotrack= new AliTPCtrack;
319 // iotrack->fHelixIn = new TClonesArray("AliHelix");
320 //iotrack->fHelixOut = new TClonesArray("AliHelix");
321 fOutput->Branch("tracks","AliTPCtrack",&iotrack,32000,100);
324 if (output && (fDebug&2)){
325 //write the full seed information if specified in debug mode
327 fSeedTree = new TTree("Seeds","Seeds");
328 AliTPCseed * vseed = new AliTPCseed;
330 TClonesArray * arrtr = new TClonesArray("AliTPCTrackPoint",160);
331 arrtr->ExpandCreateFast(160);
332 TClonesArray * arre = new TClonesArray("AliTPCExactPoint",160);
334 vseed->fPoints = arrtr;
335 vseed->fEPoints = arre;
336 // vseed->fClusterPoints = arrcl;
337 fSeedTree->Branch("seeds","AliTPCseed",&vseed,32000,99);
340 fTreeDebug = new TTree("trackDebug","trackDebug");
341 TClonesArray * arrd = new TClonesArray("AliTPCTrackPoint2",0);
342 fTreeDebug->Branch("debug",&arrd,32000,99);
350 void AliTPCtrackerMI::FillESD(TObjArray* arr)
354 //fill esds using updated tracks
356 // write tracks to the event
357 // store index of the track
358 Int_t nseed=arr->GetEntriesFast();
359 for (Int_t i=0; i<nseed; i++) {
360 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
362 pt->PropagateTo(fParam->GetInnerRadiusLow());
363 if ( (pt->GetNumberOfClusters()>70)&& (Float_t(pt->GetNumberOfClusters())/Float_t(pt->fNFoundable))>0.55) {
365 iotrack.UpdateTrackParams(pt,AliESDtrack::kTPCin);
366 //iotrack.SetTPCindex(i);
367 fEvent->AddTrack(&iotrack);
373 void AliTPCtrackerMI::WriteTracks(TTree * tree)
376 // write tracks from seed array to selected tree
380 AliTPCtrack *iotrack= new AliTPCtrack;
381 fOutput->Branch("tracks","AliTPCtrack",&iotrack,32000,100);
386 void AliTPCtrackerMI::WriteTracks()
389 // write tracks to the given output tree -
390 // output specified with SetIO routine
397 AliTPCtrack *iotrack= 0;
398 Int_t nseed=fSeeds->GetEntriesFast();
399 //for (Int_t i=0; i<nseed; i++) {
400 // iotrack= (AliTPCtrack*)fSeeds->UncheckedAt(i);
401 // if (iotrack) break;
403 //TBranch * br = fOutput->Branch("tracks","AliTPCtrack",&iotrack,32000,100);
404 TBranch * br = fOutput->GetBranch("tracks");
405 br->SetAddress(&iotrack);
407 for (Int_t i=0; i<nseed; i++) {
408 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i);
410 AliTPCtrack * track = new AliTPCtrack(*pt);
413 // br->SetAddress(&iotrack);
418 //fOutput->GetDirectory()->cd();
424 //write the full seed information if specified in debug mode
426 AliTPCseed * vseed = new AliTPCseed;
428 TClonesArray * arrtr = new TClonesArray("AliTPCTrackPoint",160);
429 arrtr->ExpandCreateFast(160);
430 //TClonesArray * arrcl = new TClonesArray("AliTPCclusterMI",160);
431 //arrcl->ExpandCreateFast(160);
432 TClonesArray * arre = new TClonesArray("AliTPCExactPoint",160);
434 vseed->fPoints = arrtr;
435 vseed->fEPoints = arre;
436 // vseed->fClusterPoints = arrcl;
437 //TBranch * brseed = seedtree->Branch("seeds","AliTPCseed",&vseed,32000,99);
438 TBranch * brseed = fSeedTree->GetBranch("seeds");
440 Int_t nseed=fSeeds->GetEntriesFast();
442 for (Int_t i=0; i<nseed; i++) {
443 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i);
446 // pt->fClusterPoints = arrcl;
450 brseed->SetAddress(&vseed);
454 // pt->fClusterPoints = 0;
457 if (fTreeDebug) fTreeDebug->Write();
465 Double_t AliTPCtrackerMI::ErrY2(AliTPCseed* seed, AliTPCclusterMI * cl){
468 //seed->SetErrorY2(0.1);
470 //calculate look-up table at the beginning
471 static Bool_t ginit = kFALSE;
472 static Float_t gnoise1,gnoise2,gnoise3;
473 static Float_t ggg1[10000];
474 static Float_t ggg2[10000];
475 static Float_t ggg3[10000];
476 static Float_t glandau1[10000];
477 static Float_t glandau2[10000];
478 static Float_t glandau3[10000];
480 static Float_t gcor01[500];
481 static Float_t gcor02[500];
482 static Float_t gcorp[500];
487 for (Int_t i=1;i<500;i++){
488 Float_t rsigma = float(i)/100.;
489 gcor02[i] = TMath::Max(0.78 +TMath::Exp(7.4*(rsigma-1.2)),0.6);
490 gcor01[i] = TMath::Max(0.72 +TMath::Exp(3.36*(rsigma-1.2)),0.6);
491 gcorp[i] = TMath::Max(TMath::Power((rsigma+0.5),1.5),1.2);
495 for (Int_t i=3;i<10000;i++){
499 Float_t amp = float(i);
500 Float_t padlength =0.75;
501 gnoise1 = 0.0004/padlength;
502 Float_t nel = 0.268*amp;
503 Float_t nprim = 0.155*amp;
504 ggg1[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.001*nel/(padlength*padlength))/nel;
505 glandau1[i] = (2.+0.12*nprim)*0.5* (2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
506 if (glandau1[i]>1) glandau1[i]=1;
507 glandau1[i]*=padlength*padlength/12.;
511 gnoise2 = 0.0004/padlength;
514 ggg2[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.0008*nel/(padlength*padlength))/nel;
515 glandau2[i] = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
516 if (glandau2[i]>1) glandau2[i]=1;
517 glandau2[i]*=padlength*padlength/12.;
522 gnoise3 = 0.0004/padlength;
525 ggg3[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.0008*nel/(padlength*padlength))/nel;
526 glandau3[i] = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
527 if (glandau3[i]>1) glandau3[i]=1;
528 glandau3[i]*=padlength*padlength/12.;
536 Int_t amp = int(TMath::Abs(cl->GetQ()));
538 seed->SetErrorY2(1.);
542 Float_t z = TMath::Abs(fParam->GetZLength()-TMath::Abs(seed->GetZ()));
543 Int_t ctype = cl->GetType();
544 Float_t padlength= GetPadPitchLength(seed->fRow);
545 Float_t angle2 = seed->GetSnp()*seed->GetSnp();
546 angle2 = angle2/(1-angle2);
549 Int_t rsigmay = int(100.*cl->GetSigmaY2()/(seed->fCurrentSigmaY2));
552 if (fSectors==fInnerSec){
554 res = ggg1[amp]*z+glandau1[amp]*angle2;
555 if (ctype==0) res *= gcor01[rsigmay];
558 res*= gcorp[rsigmay];
564 res = ggg2[amp]*z+glandau2[amp]*angle2;
565 if (ctype==0) res *= gcor02[rsigmay];
568 res*= gcorp[rsigmay];
573 res = ggg3[amp]*z+glandau3[amp]*angle2;
574 if (ctype==0) res *= gcor02[rsigmay];
577 res*= gcorp[rsigmay];
584 res*=2.4; // overestimate error 2 times
591 seed->SetErrorY2(res);
599 Double_t AliTPCtrackerMI::ErrZ2(AliTPCseed* seed, AliTPCclusterMI * cl){
602 //seed->SetErrorY2(0.1);
604 //calculate look-up table at the beginning
605 static Bool_t ginit = kFALSE;
606 static Float_t gnoise1,gnoise2,gnoise3;
607 static Float_t ggg1[10000];
608 static Float_t ggg2[10000];
609 static Float_t ggg3[10000];
610 static Float_t glandau1[10000];
611 static Float_t glandau2[10000];
612 static Float_t glandau3[10000];
614 static Float_t gcor01[1000];
615 static Float_t gcor02[1000];
616 static Float_t gcorp[1000];
621 for (Int_t i=1;i<1000;i++){
622 Float_t rsigma = float(i)/100.;
623 gcor02[i] = TMath::Max(0.81 +TMath::Exp(6.8*(rsigma-1.2)),0.6);
624 gcor01[i] = TMath::Max(0.72 +TMath::Exp(2.04*(rsigma-1.2)),0.6);
625 gcorp[i] = TMath::Max(TMath::Power((rsigma+0.5),1.5),1.2);
629 for (Int_t i=3;i<10000;i++){
633 Float_t amp = float(i);
634 Float_t padlength =0.75;
635 gnoise1 = 0.0004/padlength;
636 Float_t nel = 0.268*amp;
637 Float_t nprim = 0.155*amp;
638 ggg1[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.001*nel/(padlength*padlength))/nel;
639 glandau1[i] = (2.+0.12*nprim)*0.5* (2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
640 if (glandau1[i]>1) glandau1[i]=1;
641 glandau1[i]*=padlength*padlength/12.;
645 gnoise2 = 0.0004/padlength;
648 ggg2[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.0008*nel/(padlength*padlength))/nel;
649 glandau2[i] = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
650 if (glandau2[i]>1) glandau2[i]=1;
651 glandau2[i]*=padlength*padlength/12.;
656 gnoise3 = 0.0004/padlength;
659 ggg3[i] = fParam->GetDiffT()*fParam->GetDiffT()*(2+0.0008*nel/(padlength*padlength))/nel;
660 glandau3[i] = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
661 if (glandau3[i]>1) glandau3[i]=1;
662 glandau3[i]*=padlength*padlength/12.;
670 Int_t amp = int(TMath::Abs(cl->GetQ()));
672 seed->SetErrorY2(1.);
676 Float_t z = TMath::Abs(fParam->GetZLength()-TMath::Abs(seed->GetZ()));
677 Int_t ctype = cl->GetType();
678 Float_t padlength= GetPadPitchLength(seed->fRow);
680 Float_t angle2 = seed->GetSnp()*seed->GetSnp();
681 // if (angle2<0.6) angle2 = 0.6;
682 angle2 = seed->GetTgl()*seed->GetTgl()*(1+angle2/(1-angle2));
685 Int_t rsigmaz = int(100.*cl->GetSigmaZ2()/(seed->fCurrentSigmaZ2));
688 if (fSectors==fInnerSec){
690 res = ggg1[amp]*z+glandau1[amp]*angle2;
691 if (ctype==0) res *= gcor01[rsigmaz];
694 res*= gcorp[rsigmaz];
700 res = ggg2[amp]*z+glandau2[amp]*angle2;
701 if (ctype==0) res *= gcor02[rsigmaz];
704 res*= gcorp[rsigmaz];
709 res = ggg3[amp]*z+glandau3[amp]*angle2;
710 if (ctype==0) res *= gcor02[rsigmaz];
713 res*= gcorp[rsigmaz];
722 if ((ctype<0) &&<70){
730 seed->SetErrorZ2(res);
737 Double_t AliTPCtrackerMI::ErrZ2(AliTPCseed* seed, AliTPCclusterMI * cl){
740 //seed->SetErrorZ2(0.1);
744 Float_t z = TMath::Abs(fParam->GetZLength()-TMath::Abs(seed->GetZ()));
746 Float_t rsigmaz = cl->GetSigmaZ2()/(seed->fCurrentSigmaZ2);
747 Int_t ctype = cl->GetType();
748 Float_t amp = TMath::Abs(cl->GetQ());
753 Float_t landau=2 ; //landau fluctuation part
754 Float_t gg=2; // gg fluctuation part
755 Float_t padlength= GetPadPitchLength(seed->GetX());
757 if (fSectors==fInnerSec){
758 snoise2 = 0.0004/padlength;
761 gg = (2+0.001*nel/(padlength*padlength))/nel;
762 landau = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
763 if (landau>1) landau=1;
766 snoise2 = 0.0004/padlength;
769 gg = (2+0.0008*nel/(padlength*padlength))/nel;
770 landau = (2.+0.12*nprim)*0.5*(2.+nprim*nprim*0.001/(padlength*padlength))/nprim;
771 if (landau>1) landau=1;
773 Float_t sdiff = gg*fParam->GetDiffT()*fParam->GetDiffT()*z;
776 Float_t angle2 = seed->GetSnp()*seed->GetSnp();
777 angle2 = TMath::Sqrt((1-angle2));
778 if (angle2<0.6) angle2 = 0.6;
781 Float_t angle = seed->GetTgl()/angle2;
782 Float_t angular = landau*angle*angle*padlength*padlength/12.;
783 Float_t res = sdiff + angular;
786 if ((ctype==0) && (fSectors ==fOuterSec))
787 res *= 0.81 +TMath::Exp(6.8*(rsigmaz-1.2));
789 if ((ctype==0) && (fSectors ==fInnerSec))
790 res *= 0.72 +TMath::Exp(2.04*(rsigmaz-1.2));
794 res*= TMath::Power(rsigmaz+0.5,1.5); //0.31+0.147*ctype;
800 if ((ctype<0) &&<70){
808 seed->SetErrorZ2(res);
815 void AliTPCseed::Reset(Bool_t all)
819 SetNumberOfClusters(0);
825 for (Int_t i=0;i<8;i++){
826 delete [] fTrackPoints[i];
834 for (Int_t i=0;i<200;i++) SetClusterIndex2(i,-3);
835 for (Int_t i=0;i<160;i++) fClusterPointer[i]=0;
841 void AliTPCseed::Modify(Double_t factor)
844 //------------------------------------------------------------------
845 //This function makes a track forget its history :)
846 //------------------------------------------------------------------
852 fC10*=0; fC11*=factor;
853 fC20*=0; fC21*=0; fC22*=factor;
854 fC30*=0; fC31*=0; fC32*=0; fC33*=factor;
855 fC40*=0; fC41*=0; fC42*=0; fC43*=0; fC44*=factor;
856 SetNumberOfClusters(0);
860 fCurrentSigmaY2 = 0.000005;
861 fCurrentSigmaZ2 = 0.000005;
870 Int_t AliTPCseed::GetProlongation(Double_t xk, Double_t &y, Double_t & z) const
872 //-----------------------------------------------------------------
873 // This function find proloncation of a track to a reference plane x=xk.
874 // doesn't change internal state of the track
875 //-----------------------------------------------------------------
877 Double_t x1=fX, x2=x1+(xk-x1), dx=x2-x1;
879 if (TMath::Abs(fP4*xk - fP2) >= 0.999) {
883 // Double_t y1=fP0, z1=fP1;
884 Double_t c1=fP4*x1 - fP2, r1=sqrt(1.- c1*c1);
885 Double_t c2=fP4*x2 - fP2, r2=sqrt(1.- c2*c2);
889 //y += dx*(c1+c2)/(r1+r2);
890 //z += dx*(c1+c2)/(c1*r2 + c2*r1)*fP3;
892 Double_t dy = dx*(c1+c2)/(r1+r2);
895 Double_t delta = fP4*dx*(c1+c2)/(c1*r2 + c2*r1);
897 if (TMath::Abs(delta)>0.0001){
898 dz = fP3*TMath::ASin(delta)/fP4;
900 dz = dx*fP3*(c1+c2)/(c1*r2 + c2*r1);
903 dz = fP3*AliTPCFastMath::FastAsin(delta)/fP4;
913 //_____________________________________________________________________________
914 Double_t AliTPCseed::GetPredictedChi2(const AliTPCclusterMI *c) const
916 //-----------------------------------------------------------------
917 // This function calculates a predicted chi2 increment.
918 //-----------------------------------------------------------------
919 //Double_t r00=c->GetSigmaY2(), r01=0., r11=c->GetSigmaZ2();
920 Double_t r00=fErrorY2, r01=0., r11=fErrorZ2;
921 r00+=fC00; r01+=fC10; r11+=fC11;
923 Double_t det=r00*r11 - r01*r01;
924 if (TMath::Abs(det) < 1.e-10) {
925 Int_t n=GetNumberOfClusters();
926 if (n>4) cerr<<n<<" AliKalmanTrack warning: Singular matrix !\n";
929 Double_t tmp=r00; r00=r11; r11=tmp; r01=-r01;
931 Double_t dy=c->GetY() - fP0, dz=c->GetZ() - fP1;
933 return (dy*r00*dy + 2*r01*dy*dz + dz*r11*dz)/det;
937 //_________________________________________________________________________________________
940 Int_t AliTPCseed::Compare(const TObject *o) const {
941 //-----------------------------------------------------------------
942 // This function compares tracks according to the sector - for given sector according z
943 //-----------------------------------------------------------------
944 AliTPCseed *t=(AliTPCseed*)o;
947 if (t->fRelativeSector>fRelativeSector) return -1;
948 if (t->fRelativeSector<fRelativeSector) return 1;
949 Double_t z2 = t->GetZ();
950 Double_t z1 = GetZ();
952 if (z2<z1) return -1;
957 f2 = 1-20*TMath::Sqrt(t->fC44)/(TMath::Abs(t->GetC())+0.0066);
958 if (t->fBConstrain) f2=1.2;
961 f1 = 1-20*TMath::Sqrt(fC44)/(TMath::Abs(GetC())+0.0066);
963 if (fBConstrain) f1=1.2;
965 if (t->GetNumberOfClusters()*f2 <GetNumberOfClusters()*f1) return -1;
970 void AliTPCtrackerMI::RotateToLocal(AliTPCseed *seed)
972 //rotate to track "local coordinata
973 Float_t x = seed->GetX();
974 Float_t y = seed->GetY();
975 Float_t ymax = x*TMath::Tan(0.5*fSectors->GetAlpha());
978 seed->fRelativeSector= (seed->fRelativeSector+1) % fN;
979 if (!seed->Rotate(fSectors->GetAlpha()))
981 } else if (y <-ymax) {
982 seed->fRelativeSector= (seed->fRelativeSector-1+fN) % fN;
983 if (!seed->Rotate(-fSectors->GetAlpha()))
992 //_____________________________________________________________________________
993 Int_t AliTPCseed::Update(const AliTPCclusterMI *c, Double_t chisq, UInt_t /*index*/) {
994 //-----------------------------------------------------------------
995 // This function associates a cluster with this track.
996 //-----------------------------------------------------------------
997 Double_t r00=fErrorY2, r01=0., r11=fErrorZ2;
999 r00+=fC00; r01+=fC10; r11+=fC11;
1000 Double_t det=r00*r11 - r01*r01;
1001 Double_t tmp=r00; r00=r11/det; r11=tmp/det; r01=-r01/det;
1003 Double_t k00=fC00*r00+fC10*r01, k01=fC00*r01+fC10*r11;
1004 Double_t k10=fC10*r00+fC11*r01, k11=fC10*r01+fC11*r11;
1005 Double_t k20=fC20*r00+fC21*r01, k21=fC20*r01+fC21*r11;
1006 Double_t k30=fC30*r00+fC31*r01, k31=fC30*r01+fC31*r11;
1007 Double_t k40=fC40*r00+fC41*r01, k41=fC40*r01+fC41*r11;
1009 Double_t dy=c->GetY() - fP0, dz=c->GetZ() - fP1;
1010 Double_t cur=fP4 + k40*dy + k41*dz, eta=fP2 + k20*dy + k21*dz;
1011 if (TMath::Abs(cur*fX-eta) >= 0.9) {
1015 fP0 += k00*dy + k01*dz;
1016 fP1 += k10*dy + k11*dz;
1018 fP3 += k30*dy + k31*dz;
1021 Double_t c01=fC10, c02=fC20, c03=fC30, c04=fC40;
1022 Double_t c12=fC21, c13=fC31, c14=fC41;
1024 fC00-=k00*fC00+k01*fC10; fC10-=k00*c01+k01*fC11;
1025 fC20-=k00*c02+k01*c12; fC30-=k00*c03+k01*c13;
1026 fC40-=k00*c04+k01*c14;
1028 fC11-=k10*c01+k11*fC11;
1029 fC21-=k10*c02+k11*c12; fC31-=k10*c03+k11*c13;
1030 fC41-=k10*c04+k11*c14;
1032 fC22-=k20*c02+k21*c12; fC32-=k20*c03+k21*c13;
1033 fC42-=k20*c04+k21*c14;
1035 fC33-=k30*c03+k31*c13;
1036 fC43-=k40*c03+k41*c13;
1038 fC44-=k40*c04+k41*c14;
1040 Int_t n=GetNumberOfClusters();
1042 SetNumberOfClusters(n+1);
1043 SetChi2(GetChi2()+chisq);
1050 //_____________________________________________________________________________
1051 Double_t AliTPCtrackerMI::F1old(Double_t x1,Double_t y1,
1052 Double_t x2,Double_t y2,
1053 Double_t x3,Double_t y3)
1055 //-----------------------------------------------------------------
1056 // Initial approximation of the track curvature
1057 //-----------------------------------------------------------------
1058 Double_t d=(x2-x1)*(y3-y2)-(x3-x2)*(y2-y1);
1059 Double_t a=0.5*((y3-y2)*(y2*y2-y1*y1+x2*x2-x1*x1)-
1060 (y2-y1)*(y3*y3-y2*y2+x3*x3-x2*x2));
1061 Double_t b=0.5*((x2-x1)*(y3*y3-y2*y2+x3*x3-x2*x2)-
1062 (x3-x2)*(y2*y2-y1*y1+x2*x2-x1*x1));
1064 Double_t xr=TMath::Abs(d/(d*x1-a)), yr=d/(d*y1-b);
1065 if ( xr*xr+yr*yr<=0.00000000000001) return 100;
1066 return -xr*yr/sqrt(xr*xr+yr*yr);
1071 //_____________________________________________________________________________
1072 Double_t AliTPCtrackerMI::F1(Double_t x1,Double_t y1,
1073 Double_t x2,Double_t y2,
1074 Double_t x3,Double_t y3)
1076 //-----------------------------------------------------------------
1077 // Initial approximation of the track curvature
1078 //-----------------------------------------------------------------
1084 Double_t det = x3*y2-x2*y3;
1089 Double_t u = 0.5* (x2*(x2-x3)+y2*(y2-y3))/det;
1090 Double_t x0 = x3*0.5-y3*u;
1091 Double_t y0 = y3*0.5+x3*u;
1092 Double_t c2 = 1/TMath::Sqrt(x0*x0+y0*y0);
1098 Double_t AliTPCtrackerMI::F2(Double_t x1,Double_t y1,
1099 Double_t x2,Double_t y2,
1100 Double_t x3,Double_t y3)
1102 //-----------------------------------------------------------------
1103 // Initial approximation of the track curvature
1104 //-----------------------------------------------------------------
1110 Double_t det = x3*y2-x2*y3;
1115 Double_t u = 0.5* (x2*(x2-x3)+y2*(y2-y3))/det;
1116 Double_t x0 = x3*0.5-y3*u;
1117 Double_t y0 = y3*0.5+x3*u;
1118 Double_t c2 = 1/TMath::Sqrt(x0*x0+y0*y0);
1127 //_____________________________________________________________________________
1128 Double_t AliTPCtrackerMI::F2old(Double_t x1,Double_t y1,
1129 Double_t x2,Double_t y2,
1130 Double_t x3,Double_t y3)
1132 //-----------------------------------------------------------------
1133 // Initial approximation of the track curvature times center of curvature
1134 //-----------------------------------------------------------------
1135 Double_t d=(x2-x1)*(y3-y2)-(x3-x2)*(y2-y1);
1136 Double_t a=0.5*((y3-y2)*(y2*y2-y1*y1+x2*x2-x1*x1)-
1137 (y2-y1)*(y3*y3-y2*y2+x3*x3-x2*x2));
1138 Double_t b=0.5*((x2-x1)*(y3*y3-y2*y2+x3*x3-x2*x2)-
1139 (x3-x2)*(y2*y2-y1*y1+x2*x2-x1*x1));
1141 Double_t xr=TMath::Abs(d/(d*x1-a)), yr=d/(d*y1-b);
1143 return -a/(d*y1-b)*xr/sqrt(xr*xr+yr*yr);
1146 //_____________________________________________________________________________
1147 Double_t AliTPCtrackerMI::F3(Double_t x1,Double_t y1,
1148 Double_t x2,Double_t y2,
1149 Double_t z1,Double_t z2)
1151 //-----------------------------------------------------------------
1152 // Initial approximation of the tangent of the track dip angle
1153 //-----------------------------------------------------------------
1154 return (z1 - z2)/sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
1158 Double_t AliTPCtrackerMI::F3n(Double_t x1,Double_t y1,
1159 Double_t x2,Double_t y2,
1160 Double_t z1,Double_t z2, Double_t c)
1162 //-----------------------------------------------------------------
1163 // Initial approximation of the tangent of the track dip angle
1164 //-----------------------------------------------------------------
1168 //angle1 = (z1-z2)*c/(TMath::ASin(c*x1-ni)-TMath::ASin(c*x2-ni));
1170 Double_t d = TMath::Sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
1171 if (TMath::Abs(d*c*0.5)>1) return 0;
1172 // Double_t angle2 = TMath::ASin(d*c*0.5);
1173 // Double_t angle2 = AliTPCFastMath::FastAsin(d*c*0.5);
1174 Double_t angle2 = (d*c*0.5>0.1)? TMath::ASin(d*c*0.5): AliTPCFastMath::FastAsin(d*c*0.5);
1176 angle2 = (z1-z2)*c/(angle2*2.);
1180 Bool_t AliTPCtrackerMI::GetProlongation(Double_t x1, Double_t x2, Double_t x[5], Double_t &y, Double_t &z)
1181 {//-----------------------------------------------------------------
1182 // This function find proloncation of a track to a reference plane x=x2.
1183 //-----------------------------------------------------------------
1187 if (TMath::Abs(x[4]*x1 - x[2]) >= 0.999) {
1191 Double_t c1=x[4]*x1 - x[2], r1=sqrt(1.- c1*c1);
1192 Double_t c2=x[4]*x2 - x[2], r2=sqrt(1.- c2*c2);
1196 Double_t dy = dx*(c1+c2)/(r1+r2);
1199 Double_t delta = x[4]*dx*(c1+c2)/(c1*r2 + c2*r1);
1201 if (TMath::Abs(delta)>0.01){
1202 dz = x[3]*TMath::ASin(delta)/x[4];
1204 dz = x[3]*AliTPCFastMath::FastAsin(delta)/x[4];
1207 //dz = x[3]*AliTPCFastMath::FastAsin(delta)/x[4];
1215 Int_t AliTPCtrackerMI::LoadClusters (TTree *tree)
1220 return LoadClusters();
1223 Int_t AliTPCtrackerMI::LoadClusters()
1226 // load clusters to the memory
1227 AliTPCClustersRow *clrow= new AliTPCClustersRow;
1228 clrow->SetClass("AliTPCclusterMI");
1230 clrow->GetArray()->ExpandCreateFast(10000);
1232 // TTree * tree = fClustersArray.GetTree();
1234 TTree * tree = fInput;
1235 TBranch * br = tree->GetBranch("Segment");
1236 br->SetAddress(&clrow);
1238 Int_t j=Int_t(tree->GetEntries());
1239 for (Int_t i=0; i<j; i++) {
1243 fParam->AdjustSectorRow(clrow->GetID(),sec,row);
1245 AliTPCRow * tpcrow=0;
1248 tpcrow = &(fInnerSec[sec%fkNIS][row]);
1252 tpcrow = &(fOuterSec[(sec-fkNIS*2)%fkNOS][row]);
1253 left = (sec-fkNIS*2)/fkNOS;
1256 tpcrow->fN1 = clrow->GetArray()->GetEntriesFast();
1257 tpcrow->fClusters1 = new AliTPCclusterMI[tpcrow->fN1];
1258 for (Int_t i=0;i<tpcrow->fN1;i++)
1259 tpcrow->fClusters1[i] = *(AliTPCclusterMI*)(clrow->GetArray()->At(i));
1262 tpcrow->fN2 = clrow->GetArray()->GetEntriesFast();
1263 tpcrow->fClusters2 = new AliTPCclusterMI[tpcrow->fN2];
1264 for (Int_t i=0;i<tpcrow->fN2;i++)
1265 tpcrow->fClusters2[i] = *(AliTPCclusterMI*)(clrow->GetArray()->At(i));
1276 void AliTPCtrackerMI::UnloadClusters()
1279 // unload clusters from the memory
1281 Int_t nrows = fOuterSec->GetNRows();
1282 for (Int_t sec = 0;sec<fkNOS;sec++)
1283 for (Int_t row = 0;row<nrows;row++){
1284 AliTPCRow* tpcrow = &(fOuterSec[sec%fkNOS][row]);
1286 // if (tpcrow->fClusters1) delete []tpcrow->fClusters1;
1287 // if (tpcrow->fClusters2) delete []tpcrow->fClusters2;
1289 tpcrow->ResetClusters();
1292 nrows = fInnerSec->GetNRows();
1293 for (Int_t sec = 0;sec<fkNIS;sec++)
1294 for (Int_t row = 0;row<nrows;row++){
1295 AliTPCRow* tpcrow = &(fInnerSec[sec%fkNIS][row]);
1297 // if (tpcrow->fClusters1) delete []tpcrow->fClusters1;
1298 //if (tpcrow->fClusters2) delete []tpcrow->fClusters2;
1300 tpcrow->ResetClusters();
1307 //_____________________________________________________________________________
1308 Int_t AliTPCtrackerMI::LoadOuterSectors() {
1309 //-----------------------------------------------------------------
1310 // This function fills outer TPC sectors with clusters.
1311 //-----------------------------------------------------------------
1312 Int_t nrows = fOuterSec->GetNRows();
1314 for (Int_t sec = 0;sec<fkNOS;sec++)
1315 for (Int_t row = 0;row<nrows;row++){
1316 AliTPCRow* tpcrow = &(fOuterSec[sec%fkNOS][row]);
1317 Int_t sec2 = sec+2*fkNIS;
1319 Int_t ncl = tpcrow->fN1;
1321 AliTPCclusterMI *c= &(tpcrow->fClusters1[ncl]);
1322 index=(((sec2<<8)+row)<<16)+ncl;
1323 tpcrow->InsertCluster(c,index);
1328 AliTPCclusterMI *c= &(tpcrow->fClusters2[ncl]);
1329 index=((((sec2+fkNOS)<<8)+row)<<16)+ncl;
1330 tpcrow->InsertCluster(c,index);
1333 // write indexes for fast acces
1335 for (Int_t i=0;i<510;i++)
1336 tpcrow->fFastCluster[i]=-1;
1337 for (Int_t i=0;i<tpcrow->GetN();i++){
1338 Int_t zi = Int_t((*tpcrow)[i]->GetZ()+255.);
1339 tpcrow->fFastCluster[zi]=i; // write index
1342 for (Int_t i=0;i<510;i++){
1343 if (tpcrow->fFastCluster[i]<0)
1344 tpcrow->fFastCluster[i] = last;
1346 last = tpcrow->fFastCluster[i];
1355 //_____________________________________________________________________________
1356 Int_t AliTPCtrackerMI::LoadInnerSectors() {
1357 //-----------------------------------------------------------------
1358 // This function fills inner TPC sectors with clusters.
1359 //-----------------------------------------------------------------
1360 Int_t nrows = fInnerSec->GetNRows();
1362 for (Int_t sec = 0;sec<fkNIS;sec++)
1363 for (Int_t row = 0;row<nrows;row++){
1364 AliTPCRow* tpcrow = &(fInnerSec[sec%fkNIS][row]);
1367 Int_t ncl = tpcrow->fN1;
1369 AliTPCclusterMI *c= &(tpcrow->fClusters1[ncl]);
1370 index=(((sec<<8)+row)<<16)+ncl;
1371 tpcrow->InsertCluster(c,index);
1376 AliTPCclusterMI *c= &(tpcrow->fClusters2[ncl]);
1377 index=((((sec+fkNIS)<<8)+row)<<16)+ncl;
1378 tpcrow->InsertCluster(c,index);
1381 // write indexes for fast acces
1383 for (Int_t i=0;i<510;i++)
1384 tpcrow->fFastCluster[i]=-1;
1385 for (Int_t i=0;i<tpcrow->GetN();i++){
1386 Int_t zi = Int_t((*tpcrow)[i]->GetZ()+255.);
1387 tpcrow->fFastCluster[zi]=i; // write index
1390 for (Int_t i=0;i<510;i++){
1391 if (tpcrow->fFastCluster[i]<0)
1392 tpcrow->fFastCluster[i] = last;
1394 last = tpcrow->fFastCluster[i];
1406 //_________________________________________________________________________
1407 AliTPCclusterMI *AliTPCtrackerMI::GetClusterMI(Int_t index) const {
1408 //--------------------------------------------------------------------
1409 // Return pointer to a given cluster
1410 //--------------------------------------------------------------------
1411 Int_t sec=(index&0xff000000)>>24;
1412 Int_t row=(index&0x00ff0000)>>16;
1413 Int_t ncl=(index&0x00007fff)>>00;
1415 const AliTPCRow * tpcrow=0;
1416 AliTPCclusterMI * clrow =0;
1418 tpcrow = &(fInnerSec[sec%fkNIS][row]);
1420 clrow = tpcrow->fClusters1;
1422 clrow = tpcrow->fClusters2;
1425 tpcrow = &(fOuterSec[(sec-fkNIS*2)%fkNOS][row]);
1426 if (sec-2*fkNIS<fkNOS)
1427 clrow = tpcrow->fClusters1;
1429 clrow = tpcrow->fClusters2;
1431 if (tpcrow==0) return 0;
1432 if (tpcrow->GetN()<=ncl) return 0;
1433 // return (AliTPCclusterMI*)(*tpcrow)[ncl];
1434 return &(clrow[ncl]);
1440 Int_t AliTPCtrackerMI::FollowToNext(AliTPCseed& t, Int_t nr) {
1441 //-----------------------------------------------------------------
1442 // This function tries to find a track prolongation to next pad row
1443 //-----------------------------------------------------------------
1445 Double_t x= GetXrow(nr), ymax=GetMaxY(nr);
1446 AliTPCclusterMI *cl=0;
1447 Int_t tpcindex= t.GetClusterIndex2(nr);
1449 // update current shape info every 5 pad-row
1450 // if ( (nr%5==0) || t.GetNumberOfClusters()<2 || (t.fCurrentSigmaY2<0.0001) ){
1454 if (fIteration>0 && tpcindex>=-1){ //if we have already clusters
1456 if (tpcindex==-1) return 0; //track in dead zone
1458 cl = t.fClusterPointer[nr];
1459 if ( (cl==0) ) cl = GetClusterMI(tpcindex);
1460 t.fCurrentClusterIndex1 = tpcindex;
1463 Int_t relativesector = ((tpcindex&0xff000000)>>24)%18; // if previously accepted cluster in different sector
1464 Float_t angle = relativesector*fSectors->GetAlpha()+fSectors->GetAlphaShift();
1466 if (angle<-TMath::Pi()) angle += 2*TMath::Pi();
1467 if (angle>=TMath::Pi()) angle -= 2*TMath::Pi();
1469 if (TMath::Abs(angle-t.GetAlpha())>0.001){
1470 Double_t rotation = angle-t.GetAlpha();
1471 t.fRelativeSector= relativesector;
1476 t.fCurrentCluster = cl;
1478 Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
1479 if ((tpcindex&0x8000)==0) accept =0;
1481 //if founded cluster is acceptible
1482 if (cl->IsUsed(11)) { // id cluster is shared inrease uncertainty
1489 UpdateTrack(&t,accept);
1494 if (fIteration>1) return 0; // not look for new cluster during refitting
1497 if (TMath::Abs(t.GetSnp())>0.95 || TMath::Abs(x*t.GetC()-t.GetEta())>0.95) return 0;
1498 Double_t y=t.GetYat(x);
1499 if (TMath::Abs(y)>ymax){
1501 t.fRelativeSector= (t.fRelativeSector+1) % fN;
1502 if (!t.Rotate(fSectors->GetAlpha()))
1504 } else if (y <-ymax) {
1505 t.fRelativeSector= (t.fRelativeSector-1+fN) % fN;
1506 if (!t.Rotate(-fSectors->GetAlpha()))
1512 if (!t.PropagateTo(x)) {
1513 if (fIteration==0) t.fRemoval = 10;
1517 Double_t z=t.GetZ();
1519 const AliTPCRow &krow=GetRow(t.fRelativeSector,nr);
1520 if ( (t.GetSigmaY2()<0) || t.GetSigmaZ2()<0) return 0;
1522 Double_t roadz = 1.;
1524 if (TMath::Abs(TMath::Abs(y)-ymax)<krow.fDeadZone){
1526 t.SetClusterIndex2(nr,-1);
1531 if (TMath::Abs(z)<(1.05*x+10)) t.fNFoundable++;
1537 // cl = krow.FindNearest2(y+10.,z,roady,roadz,index);
1538 cl = krow.FindNearest2(y,z,roady,roadz,index);
1539 if (cl) t.fCurrentClusterIndex1 = krow.GetIndex(index);
1542 t.fCurrentCluster = cl;
1544 if (fIteration==2&&cl->IsUsed(10)) return 0;
1545 Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
1546 if (fIteration==2&&cl->IsUsed(11)) {
1553 if (t.fCurrentCluster->IsUsed(10)){
1558 if (t.fNShared>0.7*t.GetNumberOfClusters()) {
1564 if (accept<3) UpdateTrack(&t,accept);
1567 if ( fIteration==0 && t.fNFoundable*0.5 > t.GetNumberOfClusters()) t.fRemoval=10;
1573 Int_t AliTPCtrackerMI::FollowToNextFast(AliTPCseed& t, Int_t nr) {
1574 //-----------------------------------------------------------------
1575 // This function tries to find a track prolongation to next pad row
1576 //-----------------------------------------------------------------
1578 Double_t x= GetXrow(nr), ymax=GetMaxY(nr);
1580 if (!t.GetProlongation(x,y,z)) {
1586 if (TMath::Abs(y)>ymax){
1589 t.fRelativeSector= (t.fRelativeSector+1) % fN;
1590 if (!t.Rotate(fSectors->GetAlpha()))
1592 } else if (y <-ymax) {
1593 t.fRelativeSector= (t.fRelativeSector-1+fN) % fN;
1594 if (!t.Rotate(-fSectors->GetAlpha()))
1597 if (!t.PropagateTo(x)) {
1600 t.GetProlongation(x,y,z);
1603 // update current shape info every 3 pad-row
1604 if ( (nr%6==0) || t.GetNumberOfClusters()<2 || (t.fCurrentSigmaY2<0.0001) ){
1605 // t.fCurrentSigmaY = GetSigmaY(&t);
1606 //t.fCurrentSigmaZ = GetSigmaZ(&t);
1610 AliTPCclusterMI *cl=0;
1615 const AliTPCRow &krow=GetRow(t.fRelativeSector,nr);
1616 if ( (t.GetSigmaY2()<0) || t.GetSigmaZ2()<0) return 0;
1618 Double_t roadz = 1.;
1621 if (TMath::Abs(TMath::Abs(y)-ymax)<krow.fDeadZone){
1623 t.SetClusterIndex2(row,-1);
1628 if (TMath::Abs(z)>(1.05*x+10)) t.SetClusterIndex2(row,-1);
1632 if ((cl==0)&&(krow)) {
1633 // cl = krow.FindNearest2(y+10,z,roady,roadz,index);
1634 cl = krow.FindNearest2(y,z,roady,roadz,index);
1636 if (cl) t.fCurrentClusterIndex1 = krow.GetIndex(index);
1640 t.fCurrentCluster = cl;
1641 // Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
1643 t.SetClusterIndex2(row,index);
1644 t.fClusterPointer[row] = cl;
1652 Int_t AliTPCtrackerMI::UpdateClusters(AliTPCseed& t, Int_t nr) {
1653 //-----------------------------------------------------------------
1654 // This function tries to find a track prolongation to next pad row
1655 //-----------------------------------------------------------------
1656 t.fCurrentCluster = 0;
1657 t.fCurrentClusterIndex1 = 0;
1659 Double_t xt=t.GetX();
1660 Int_t row = GetRowNumber(xt)-1;
1661 Double_t ymax= GetMaxY(nr);
1663 if (row < nr) return 1; // don't prolongate if not information until now -
1664 if (TMath::Abs(t.GetSnp())>0.9 && t.GetNumberOfClusters()>40. && fIteration!=2) {
1666 return 0; // not prolongate strongly inclined tracks
1668 if (TMath::Abs(t.GetSnp())>0.95) {
1670 return 0; // not prolongate strongly inclined tracks
1673 Double_t x= GetXrow(nr);
1675 //t.PropagateTo(x+0.02);
1676 //t.PropagateTo(x+0.01);
1677 if (!t.PropagateTo(x)){
1684 if (TMath::Abs(y)>ymax){
1686 t.fRelativeSector= (t.fRelativeSector+1) % fN;
1687 if (!t.Rotate(fSectors->GetAlpha()))
1689 } else if (y <-ymax) {
1690 t.fRelativeSector= (t.fRelativeSector-1+fN) % fN;
1691 if (!t.Rotate(-fSectors->GetAlpha()))
1694 // if (!t.PropagateTo(x)){
1702 AliTPCRow &krow=GetRow(t.fRelativeSector,nr);
1704 if (TMath::Abs(TMath::Abs(y)-ymax)<krow.fDeadZone){
1706 t.SetClusterIndex2(nr,-1);
1711 if (TMath::Abs(t.GetZ())<(1.05*t.GetX()+10)) t.fNFoundable++;
1717 if ( (nr%6==0) || t.GetNumberOfClusters()<2){
1718 // t.fCurrentSigmaY = GetSigmaY(&t);
1719 //t.fCurrentSigmaZ = GetSigmaZ(&t);
1723 AliTPCclusterMI *cl=0;
1726 Double_t roady = 1.;
1727 Double_t roadz = 1.;
1731 index = t.GetClusterIndex2(nr);
1732 if ( (index>0) && (index&0x8000)==0){
1733 cl = t.fClusterPointer[nr];
1734 if ( (cl==0) && (index>0)) cl = GetClusterMI(index);
1735 t.fCurrentClusterIndex1 = index;
1737 t.fCurrentCluster = cl;
1744 //cl = krow.FindNearest2(y+10,z,roady,roadz,index);
1745 cl = krow.FindNearest2(y,z,roady,roadz,index);
1748 if (cl) t.fCurrentClusterIndex1 = krow.GetIndex(index);
1749 t.fCurrentCluster = cl;
1755 Int_t AliTPCtrackerMI::FollowToNextCluster(AliTPCseed & t, Int_t nr) {
1756 //-----------------------------------------------------------------
1757 // This function tries to find a track prolongation to next pad row
1758 //-----------------------------------------------------------------
1760 //update error according neighborhoud
1762 if (t.fCurrentCluster) {
1764 Int_t accept = AcceptCluster(&t,t.fCurrentCluster,1.);
1766 if (t.fCurrentCluster->IsUsed(10)){
1772 if (t.fNShared>0.7*t.GetNumberOfClusters()) {
1777 if (fIteration>0) accept = 0;
1778 if (accept<3) UpdateTrack(&t,accept);
1782 if ( ( (t.GetSigmaY2()+t.GetSigmaZ2())>0.16)&& t.GetNumberOfClusters()>18) t.fRemoval=10;
1783 if ( t.GetChi2()/t.GetNumberOfClusters()>6 &&t.GetNumberOfClusters()>18) t.fRemoval=10;
1785 if (( (t.fNFoundable*0.5 > t.GetNumberOfClusters()) || t.fNoCluster>15)) t.fRemoval=10;
1793 //_____________________________________________________________________________
1794 Int_t AliTPCtrackerMI::FollowProlongation(AliTPCseed& t, Int_t rf, Int_t step) {
1795 //-----------------------------------------------------------------
1796 // This function tries to find a track prolongation.
1797 //-----------------------------------------------------------------
1798 Double_t xt=t.GetX();
1800 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
1801 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
1802 if (alpha < 0. ) alpha += 2.*TMath::Pi();
1804 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
1806 Int_t first = GetRowNumber(xt)-1;
1807 for (Int_t nr= first; nr>=rf; nr-=step) {
1808 if (nr<fInnerSec->GetNRows())
1809 fSectors = fInnerSec;
1811 fSectors = fOuterSec;
1812 if (FollowToNext(t,nr)==0)
1821 //_____________________________________________________________________________
1822 Int_t AliTPCtrackerMI::FollowProlongationFast(AliTPCseed& t, Int_t rf, Int_t step) {
1823 //-----------------------------------------------------------------
1824 // This function tries to find a track prolongation.
1825 //-----------------------------------------------------------------
1826 Double_t xt=t.GetX();
1828 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
1829 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
1830 if (alpha < 0. ) alpha += 2.*TMath::Pi();
1831 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
1833 for (Int_t nr=GetRowNumber(xt)-1; nr>=rf; nr-=step) {
1835 if (FollowToNextFast(t,nr)==0)
1836 if (!t.IsActive()) return 0;
1846 Int_t AliTPCtrackerMI::FollowBackProlongation(AliTPCseed& t, Int_t rf) {
1847 //-----------------------------------------------------------------
1848 // This function tries to find a track prolongation.
1849 //-----------------------------------------------------------------
1850 // Double_t xt=t.GetX();
1852 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
1853 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
1854 if (alpha < 0. ) alpha += 2.*TMath::Pi();
1855 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
1857 Int_t first = t.fFirstPoint;
1859 if (first<0) first=0;
1860 for (Int_t nr=first; nr<=rf; nr++) {
1861 //if ( (t.GetSnp()<0.9))
1862 if (nr<fInnerSec->GetNRows())
1863 fSectors = fInnerSec;
1865 fSectors = fOuterSec;
1875 Float_t AliTPCtrackerMI::OverlapFactor(AliTPCseed * s1, AliTPCseed * s2, Int_t &sum1, Int_t & sum2)
1883 Float_t dz2 =(s1->GetZ() - s2->GetZ());
1886 Float_t dy2 =TMath::Abs((s1->GetY() - s2->GetY()));
1888 Float_t distance = TMath::Sqrt(dz2+dy2);
1889 if (distance>4.) return 0; // if there are far away - not overlap - to reduce combinatorics
1892 Int_t firstpoint = TMath::Min(s1->fFirstPoint,s2->fFirstPoint);
1893 Int_t lastpoint = TMath::Max(s1->fLastPoint,s2->fLastPoint);
1898 if (firstpoint>lastpoint) {
1899 firstpoint =lastpoint;
1904 for (Int_t i=firstpoint-1;i<lastpoint+1;i++){
1905 if (s1->GetClusterIndex2(i)>0) sum1++;
1906 if (s2->GetClusterIndex2(i)>0) sum2++;
1907 if (s1->GetClusterIndex2(i)==s2->GetClusterIndex2(i) && s1->GetClusterIndex2(i)>0) {
1911 if (sum<5) return 0;
1913 Float_t summin = TMath::Min(sum1+1,sum2+1);
1914 Float_t ratio = (sum+1)/Float_t(summin);
1918 void AliTPCtrackerMI::SignShared(AliTPCseed * s1, AliTPCseed * s2)
1922 if (TMath::Abs(s1->GetC()-s2->GetC())>0.004) return;
1923 if (TMath::Abs(s1->GetTgl()-s2->GetTgl())>0.6) return;
1925 Float_t dz2 =(s1->GetZ() - s2->GetZ());
1927 Float_t dy2 =(s1->GetY() - s2->GetY());
1929 Float_t distance = dz2+dy2;
1930 if (distance>325.) return ; // if there are far away - not overlap - to reduce combinatorics
1935 Int_t firstpoint = TMath::Max(s1->fFirstPoint,s2->fFirstPoint);
1936 Int_t lastpoint = TMath::Min(s1->fLastPoint,s2->fLastPoint);
1938 if (firstpoint>=lastpoint-5) return;;
1940 for (Int_t i=firstpoint;i<lastpoint;i++){
1941 // if ( (s1->GetClusterIndex2(i)&0xFFFF8FFF)==(s2->GetClusterIndex2(i)&0xFFFF8FFF) && s1->GetClusterIndex2(i)>0) {
1942 if ( (s1->GetClusterIndex2(i))==(s2->GetClusterIndex2(i)) && s1->GetClusterIndex2(i)>0) {
1949 for (Int_t i=firstpoint;i<lastpoint;i++){
1950 // if ( (s1->GetClusterIndex2(i)&0xFFFF8FFF)==(s2->GetClusterIndex2(i)&0xFFFF8FFF) && s1->GetClusterIndex2(i)>0) {
1951 if ( (s1->GetClusterIndex2(i))==(s2->GetClusterIndex2(i)) && s1->GetClusterIndex2(i)>0) {
1952 AliTPCTrackerPoint *p1 = s1->GetTrackPoint(i);
1953 AliTPCTrackerPoint *p2 = s2->GetTrackPoint(i);;
1954 if (s1->IsActive()&&s2->IsActive()){
1955 p1->fIsShared = kTRUE;
1956 p2->fIsShared = kTRUE;
1963 for (Int_t i=0;i<4;i++){
1964 if (s1->fOverlapLabels[3*i]==0){
1965 s1->fOverlapLabels[3*i] = s2->GetLabel();
1966 s1->fOverlapLabels[3*i+1] = sumshared;
1967 s1->fOverlapLabels[3*i+2] = s2->GetUniqueID();
1971 for (Int_t i=0;i<4;i++){
1972 if (s2->fOverlapLabels[3*i]==0){
1973 s2->fOverlapLabels[3*i] = s1->GetLabel();
1974 s2->fOverlapLabels[3*i+1] = sumshared;
1975 s2->fOverlapLabels[3*i+2] = s1->GetUniqueID();
1983 void AliTPCtrackerMI::SignShared(TObjArray * arr)
1986 //sort trackss according sectors
1988 for (Int_t i=0; i<arr->GetEntriesFast(); i++) {
1989 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
1991 //if (pt) RotateToLocal(pt);
1995 arr->Sort(); // sorting according z
1996 arr->Expand(arr->GetEntries());
1999 Int_t nseed=arr->GetEntriesFast();
2000 for (Int_t i=0; i<nseed; i++) {
2001 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2003 for (Int_t j=0;j<=12;j++){
2004 pt->fOverlapLabels[j] =0;
2007 for (Int_t i=0; i<nseed; i++) {
2008 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2010 if (pt->fRemoval>10) continue;
2011 for (Int_t j=i+1; j<nseed; j++){
2012 AliTPCseed *pt2=(AliTPCseed*)arr->UncheckedAt(j);
2014 if (pt2->fRemoval<=10) {
2015 if ( TMath::Abs(pt->fRelativeSector-pt2->fRelativeSector)>0) break;
2022 void AliTPCtrackerMI::RemoveDouble(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex)
2025 //sort trackss according sectors
2028 Info("RemoveDouble","Number of tracks before double removal- %d\n",arr->GetEntries());
2031 for (Int_t i=0; i<arr->GetEntriesFast(); i++) {
2032 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2037 arr->Sort(); // sorting according z
2038 arr->Expand(arr->GetEntries());
2040 //reset overlap labels
2042 Int_t nseed=arr->GetEntriesFast();
2043 for (Int_t i=0; i<nseed; i++) {
2044 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2047 for (Int_t j=0;j<=12;j++){
2048 pt->fOverlapLabels[j] =0;
2052 //sign shared tracks
2053 for (Int_t i=0; i<nseed; i++) {
2054 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2056 if (pt->fRemoval>10) continue;
2057 Float_t deltac = pt->GetC()*0.1;
2058 for (Int_t j=i+1; j<nseed; j++){
2059 AliTPCseed *pt2=(AliTPCseed*)arr->UncheckedAt(j);
2061 if (pt2->fRemoval<=10) {
2062 if ( TMath::Abs(pt->fRelativeSector-pt2->fRelativeSector)>0) break;
2063 if (TMath::Abs(pt->GetC() -pt2->GetC())>deltac) continue;
2064 if (TMath::Abs(pt->GetTgl()-pt2->GetTgl())>0.05) continue;
2071 // remove highly shared tracks
2072 for (Int_t i=0; i<nseed; i++) {
2073 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2075 if (pt->fRemoval>10) continue;
2078 for (Int_t j=0;j<4;j++){
2079 sumshared = pt->fOverlapLabels[j*3+1];
2081 Float_t factor = factor1;
2082 if (pt->fRemoval>0) factor = factor2;
2083 if (sumshared/pt->GetNumberOfClusters()>factor){
2084 for (Int_t j=0;j<4;j++){
2085 if (pt->fOverlapLabels[3*j]==0) continue;
2086 if (pt->fOverlapLabels[3*j+1]<5) continue;
2087 if (pt->fRemoval==removalindex) continue;
2088 AliTPCseed * pt2 = (AliTPCseed*)arr->UncheckedAt(pt->fOverlapLabels[3*j+2]);
2090 if (pt2->GetSigma2C()<pt->GetSigma2C()){
2091 // pt->fRemoval = removalindex;
2092 delete arr->RemoveAt(i);
2100 Info("RemoveDouble","Number of tracks after double removal- %d\n",arr->GetEntries());
2109 void AliTPCtrackerMI::SortTracks(TObjArray * arr, Int_t mode) const
2112 //sort tracks in array according mode criteria
2113 Int_t nseed = arr->GetEntriesFast();
2114 for (Int_t i=0; i<nseed; i++) {
2115 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2125 void AliTPCtrackerMI::RemoveUsed(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex)
2128 //Loop over all tracks and remove "overlaps"
2131 Int_t nseed = arr->GetEntriesFast();
2134 for (Int_t i=0; i<nseed; i++) {
2135 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2137 delete arr->RemoveAt(i);
2141 pt->fBSigned = kFALSE;
2145 nseed = arr->GetEntriesFast();
2152 for (Int_t i=0; i<nseed; i++) {
2153 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2157 Int_t found,foundable,shared;
2159 pt->GetClusterStatistic(0,160,found, foundable,shared,kFALSE);
2161 pt->GetClusterStatistic(0,160,found, foundable,shared,kTRUE);
2163 Double_t factor = factor2;
2164 if (pt->fBConstrain) factor = factor1;
2166 if ((Float_t(shared)/Float_t(found))>factor){
2167 pt->Desactivate(removalindex);
2172 for (Int_t i=0; i<160; i++) {
2173 Int_t index=pt->GetClusterIndex2(i);
2174 if (index<0 || index&0x8000 ) continue;
2175 AliTPCclusterMI *c= pt->fClusterPointer[i];
2177 // if (!c->IsUsed(10)) c->Use(10);
2178 //if (pt->IsActive())
2187 Info("RemoveUsed","\n*****\nNumber of good tracks after shared removal\t%d\n",fNtracks);
2191 void AliTPCtrackerMI::UnsignClusters()
2194 // loop over all clusters and unsign them
2197 for (Int_t sec=0;sec<fkNIS;sec++){
2198 for (Int_t row=0;row<fInnerSec->GetNRows();row++){
2199 AliTPCclusterMI *cl = fInnerSec[sec][row].fClusters1;
2200 for (Int_t icl =0;icl< fInnerSec[sec][row].fN1;icl++)
2201 // if (cl[icl].IsUsed(10))
2203 cl = fInnerSec[sec][row].fClusters2;
2204 for (Int_t icl =0;icl< fInnerSec[sec][row].fN2;icl++)
2205 //if (cl[icl].IsUsed(10))
2210 for (Int_t sec=0;sec<fkNOS;sec++){
2211 for (Int_t row=0;row<fOuterSec->GetNRows();row++){
2212 AliTPCclusterMI *cl = fOuterSec[sec][row].fClusters1;
2213 for (Int_t icl =0;icl< fOuterSec[sec][row].fN1;icl++)
2214 //if (cl[icl].IsUsed(10))
2216 cl = fOuterSec[sec][row].fClusters2;
2217 for (Int_t icl =0;icl< fOuterSec[sec][row].fN2;icl++)
2218 //if (cl[icl].IsUsed(10))
2227 void AliTPCtrackerMI::SignClusters(TObjArray * arr, Float_t fnumber, Float_t fdensity)
2230 //sign clusters to be "used"
2232 // snumber and sdensity sign number of sigmas - bellow mean value to be accepted
2233 // loop over "primaries"
2247 Int_t nseed = arr->GetEntriesFast();
2248 for (Int_t i=0; i<nseed; i++) {
2249 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2253 if (!(pt->IsActive())) continue;
2254 Float_t dens = pt->GetNumberOfClusters()/Float_t(pt->fNFoundable);
2255 if ( (dens>0.7) && (pt->GetNumberOfClusters()>70)){
2257 sumdens2+= dens*dens;
2258 sumn += pt->GetNumberOfClusters();
2259 sumn2 += pt->GetNumberOfClusters()*pt->GetNumberOfClusters();
2260 Float_t chi2 = pt->GetChi2()/pt->GetNumberOfClusters();
2263 sumchi2 +=chi2*chi2;
2268 Float_t mdensity = 0.9;
2269 Float_t meann = 130;
2270 Float_t meanchi = 1;
2271 Float_t sdensity = 0.1;
2272 Float_t smeann = 10;
2273 Float_t smeanchi =0.4;
2277 mdensity = sumdens/sum;
2279 meanchi = sumchi/sum;
2281 sdensity = sumdens2/sum-mdensity*mdensity;
2282 sdensity = TMath::Sqrt(sdensity);
2284 smeann = sumn2/sum-meann*meann;
2285 smeann = TMath::Sqrt(smeann);
2287 smeanchi = sumchi2/sum - meanchi*meanchi;
2288 smeanchi = TMath::Sqrt(smeanchi);
2292 //REMOVE SHORT DELTAS or tracks going out of sensitive volume of TPC
2294 for (Int_t i=0; i<nseed; i++) {
2295 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2299 if (pt->fBSigned) continue;
2300 if (pt->fBConstrain) continue;
2301 //if (!(pt->IsActive())) continue;
2303 Int_t found,foundable,shared;
2304 pt->GetClusterStatistic(0,160,found, foundable,shared);
2305 if (shared/float(found)>0.3) {
2306 if (shared/float(found)>0.9 ){
2307 //delete arr->RemoveAt(i);
2312 Bool_t isok =kFALSE;
2313 if ( (pt->fNShared/pt->GetNumberOfClusters()<0.5) &&pt->GetNumberOfClusters()>60)
2315 if ((TMath::Abs(1/pt->GetC())<100.) && (pt->fNShared/pt->GetNumberOfClusters()<0.7))
2317 if (TMath::Abs(pt->GetZ()/pt->GetX())>1.1)
2319 if ( (TMath::Abs(pt->GetSnp()>0.7) && pt->GetD(0,0)>60.))
2323 for (Int_t i=0; i<160; i++) {
2324 Int_t index=pt->GetClusterIndex2(i);
2325 if (index<0) continue;
2326 AliTPCclusterMI *c= pt->fClusterPointer[i];
2328 //if (!(c->IsUsed(10))) c->Use();
2335 Double_t maxchi = meanchi+2.*smeanchi;
2337 for (Int_t i=0; i<nseed; i++) {
2338 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2342 //if (!(pt->IsActive())) continue;
2343 if (pt->fBSigned) continue;
2344 Double_t chi = pt->GetChi2()/pt->GetNumberOfClusters();
2345 if (chi>maxchi) continue;
2348 Float_t dens = pt->GetNumberOfClusters()/Float_t(pt->fNFoundable);
2350 //sign only tracks with enoug big density at the beginning
2352 if ((pt->GetDensityFirst(40)<0.75) && pt->GetNumberOfClusters()<meann) continue;
2355 Double_t mindens = TMath::Max(double(mdensity-sdensity*fdensity*bfactor),0.65);
2356 Double_t minn = TMath::Max(Int_t(meann-fnumber*smeann*bfactor),50);
2358 // if (pt->fBConstrain) mindens = TMath::Max(mdensity-sdensity*fdensity*bfactor,0.65);
2359 if ( (pt->fRemoval==10) && (pt->GetSnp()>0.8)&&(dens>mindens))
2362 if ((dens>mindens && pt->GetNumberOfClusters()>minn) && chi<maxchi ){
2363 //Int_t noc=pt->GetNumberOfClusters();
2364 pt->fBSigned = kTRUE;
2365 for (Int_t i=0; i<160; i++) {
2367 Int_t index=pt->GetClusterIndex2(i);
2368 if (index<0) continue;
2369 AliTPCclusterMI *c= pt->fClusterPointer[i];
2371 // if (!(c->IsUsed(10))) c->Use();
2376 // gLastCheck = nseed;
2384 void AliTPCtrackerMI::StopNotActive(TObjArray * arr, Int_t row0, Float_t th0, Float_t th1, Float_t th2) const
2386 // stop not active tracks
2387 // take th1 as threshold for number of founded to number of foundable on last 10 active rows
2388 // take th2 as threshold for number of founded to number of foundable on last 20 active rows
2389 Int_t nseed = arr->GetEntriesFast();
2391 for (Int_t i=0; i<nseed; i++) {
2392 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
2396 if (!(pt->IsActive())) continue;
2397 StopNotActive(pt,row0,th0, th1,th2);
2403 void AliTPCtrackerMI::StopNotActive(AliTPCseed * seed, Int_t row0, Float_t th0, Float_t th1,
2406 // stop not active tracks
2407 // take th1 as threshold for number of founded to number of foundable on last 10 active rows
2408 // take th2 as threshold for number of founded to number of foundable on last 20 active rows
2411 Int_t foundable = 0;
2412 Int_t maxindex = seed->fLastPoint; //last foundable row
2413 if (seed->fNFoundable*th0 > seed->GetNumberOfClusters()) {
2414 seed->Desactivate(10) ;
2418 for (Int_t i=row0; i<maxindex; i++){
2419 Int_t index = seed->GetClusterIndex2(i);
2420 if (index!=-1) foundable++;
2422 if (foundable<=30) sumgood1++;
2423 if (foundable<=50) {
2430 if (foundable>=30.){
2431 if (sumgood1<(th1*30.)) seed->Desactivate(10);
2434 if (sumgood2<(th2*50.)) seed->Desactivate(10);
2438 Int_t AliTPCtrackerMI::RefitInward(AliESD *event)
2441 // back propagation of ESD tracks
2447 //PrepareForProlongation(fSeeds,1);
2448 PropagateForward2(fSeeds);
2450 Int_t nseed = fSeeds->GetEntriesFast();
2451 for (Int_t i=0;i<nseed;i++){
2452 AliTPCseed * seed = (AliTPCseed*) fSeeds->UncheckedAt(i);
2453 if (!seed) continue;
2454 seed->PropagateTo(fParam->GetInnerRadiusLow());
2455 AliESDtrack *esd=event->GetTrack(i);
2456 seed->CookdEdx(0.02,0.6);
2457 CookLabel(seed,0.1); //For comparison only
2458 if (seed->GetNumberOfClusters()>60){
2459 esd->UpdateTrackParams(seed,AliESDtrack::kTPCrefit);
2463 //printf("problem\n");
2466 Info("RefitInward","Number of refitted tracks %d",ntracks);
2473 Int_t AliTPCtrackerMI::PropagateBack(AliESD *event)
2476 // back propagation of ESD tracks
2482 PropagateBack(fSeeds);
2483 Int_t nseed = fSeeds->GetEntriesFast();
2485 for (Int_t i=0;i<nseed;i++){
2486 AliTPCseed * seed = (AliTPCseed*) fSeeds->UncheckedAt(i);
2487 if (!seed) continue;
2488 AliESDtrack *esd=event->GetTrack(i);
2489 seed->CookdEdx(0.02,0.6);
2490 CookLabel(seed,0.1); //For comparison only
2491 if (seed->GetNumberOfClusters()>60){
2492 esd->UpdateTrackParams(seed,AliESDtrack::kTPCout);
2496 Info("PropagateBack","Number of back propagated tracks %d",ntracks);
2503 void AliTPCtrackerMI::DeleteSeeds()
2507 Int_t nseed = fSeeds->GetEntriesFast();
2508 for (Int_t i=0;i<nseed;i++){
2509 AliTPCseed * seed = (AliTPCseed*)fSeeds->At(i);
2510 if (seed) delete fSeeds->RemoveAt(i);
2516 void AliTPCtrackerMI::ReadSeeds(AliESD *event, Int_t direction)
2519 //read seeds from the event
2521 Int_t nentr=event->GetNumberOfTracks();
2523 Info("ReadSeeds", "Number of ESD tracks: %d\n", nentr);
2528 fSeeds = new TObjArray(nentr);
2532 for (Int_t i=0; i<nentr; i++) {
2533 AliESDtrack *esd=event->GetTrack(i);
2534 ULong_t status=esd->GetStatus();
2535 AliTPCtrack t(*esd);
2536 AliTPCseed *seed = new AliTPCseed(t,t.GetAlpha());
2537 if ((status==AliESDtrack::kTPCin)&&(direction==1)) seed->ResetCovariance();
2538 if ( direction ==2 &&(status & AliESDtrack::kTRDrefit) == 0 ) seed->ResetCovariance();
2539 if ( direction ==2 && ((status & AliESDtrack::kTPCout) == 0) ) {
2544 if ( direction ==2 &&(status & AliESDtrack::kTRDrefit) > 0 ) {
2545 Double_t par0[5],par1[5],x;
2546 esd->GetInnerExternalParameters(x,par0);
2547 esd->GetExternalParameters(x,par1);
2548 Double_t delta1 = TMath::Abs(par0[4]-par1[4])/(0.000000001+TMath::Abs(par0[4]+par1[4]));
2549 Double_t delta2 = TMath::Abs(par0[3]-par1[3]);
2550 //reset covariance if suspicious
2551 if ( (delta1>0.1) || (delta2>0.006))
2552 seed->ResetCovariance();
2557 // rotate to the local coordinate system
2559 fSectors=fInnerSec; fN=fkNIS;
2561 Double_t alpha=seed->GetAlpha() - fSectors->GetAlphaShift();
2562 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
2563 if (alpha < 0. ) alpha += 2.*TMath::Pi();
2564 Int_t ns=Int_t(alpha/fSectors->GetAlpha())%fN;
2565 alpha =ns*fSectors->GetAlpha() + fSectors->GetAlphaShift();
2566 if (alpha<-TMath::Pi()) alpha += 2*TMath::Pi();
2567 if (alpha>=TMath::Pi()) alpha -= 2*TMath::Pi();
2568 alpha-=seed->GetAlpha();
2569 if (!seed->Rotate(alpha)) {
2575 //seed->PropagateTo(fSectors->GetX(0));
2577 // Int_t index = esd->GetTPCindex();
2578 //AliTPCseed * seed2= (AliTPCseed*)fSeeds->At(index);
2579 //if (direction==2){
2580 // AliTPCseed * seed2 = ReSeed(seed,0.,0.5,1.);
2588 for (Int_t irow=0;irow<160;irow++){
2589 Int_t index = seed->GetClusterIndex2(irow);
2592 AliTPCclusterMI * cl = GetClusterMI(index);
2593 seed->fClusterPointer[irow] = cl;
2595 if ((index & 0x8000)==0){
2596 cl->Use(10); // accepted cluster
2598 cl->Use(6); // close cluster not accepted
2601 Info("ReadSeeds","Not found cluster");
2605 fSeeds->AddAt(seed,i);
2611 //_____________________________________________________________________________
2612 void AliTPCtrackerMI::MakeSeeds3(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t cuts[4],
2613 Float_t deltay, Int_t ddsec) {
2614 //-----------------------------------------------------------------
2615 // This function creates track seeds.
2616 // SEEDING WITH VERTEX CONSTRAIN
2617 //-----------------------------------------------------------------
2618 // cuts[0] - fP4 cut
2619 // cuts[1] - tan(phi) cut
2620 // cuts[2] - zvertex cut
2621 // cuts[3] - fP3 cut
2629 Double_t x[5], c[15];
2630 // Int_t di = i1-i2;
2632 AliTPCseed * seed = new AliTPCseed;
2633 Double_t alpha=fSectors->GetAlpha(), shift=fSectors->GetAlphaShift();
2634 Double_t cs=cos(alpha), sn=sin(alpha);
2636 // Double_t x1 =fOuterSec->GetX(i1);
2637 //Double_t xx2=fOuterSec->GetX(i2);
2639 Double_t x1 =GetXrow(i1);
2640 Double_t xx2=GetXrow(i2);
2642 Double_t x3=GetX(), y3=GetY(), z3=GetZ();
2644 Int_t imiddle = (i2+i1)/2; //middle pad row index
2645 Double_t xm = GetXrow(imiddle); // radius of middle pad-row
2646 const AliTPCRow& krm=GetRow(sec,imiddle); //middle pad -row
2650 const AliTPCRow& kr1=GetRow(ns,i1);
2651 Double_t ymax = GetMaxY(i1)-kr1.fDeadZone-1.5;
2652 Double_t ymaxm = GetMaxY(imiddle)-kr1.fDeadZone-1.5;
2655 // change cut on curvature if it can't reach this layer
2656 // maximal curvature set to reach it
2657 Double_t dvertexmax = TMath::Sqrt((x1-x3)*(x1-x3)+(ymax+5-y3)*(ymax+5-y3));
2658 if (dvertexmax*0.5*cuts[0]>0.85){
2659 cuts[0] = 0.85/(dvertexmax*0.5+1.);
2661 Double_t r2min = 1/(cuts[0]*cuts[0]); //minimal square of radius given by cut
2664 if (deltay>0) ddsec = 0;
2665 // loop over clusters
2666 for (Int_t is=0; is < kr1; is++) {
2668 if (kr1[is]->IsUsed(10)) continue;
2669 Double_t y1=kr1[is]->GetY(), z1=kr1[is]->GetZ();
2670 //if (TMath::Abs(y1)>ymax) continue;
2672 if (deltay>0 && TMath::Abs(ymax-TMath::Abs(y1))> deltay ) continue; // seed only at the edge
2674 // find possible directions
2675 Float_t anglez = (z1-z3)/(x1-x3);
2676 Float_t extraz = z1 - anglez*(x1-xx2); // extrapolated z
2679 //find rotation angles relative to line given by vertex and point 1
2680 Double_t dvertex2 = (x1-x3)*(x1-x3)+(y1-y3)*(y1-y3);
2681 Double_t dvertex = TMath::Sqrt(dvertex2);
2682 Double_t angle13 = TMath::ATan((y1-y3)/(x1-x3));
2683 Double_t cs13 = cos(-angle13), sn13 = sin(-angle13);
2686 // loop over 2 sectors
2692 Double_t dddz1=0; // direction of delta inclination in z axis
2699 for (Int_t dsec = dsec1; dsec<=dsec2;dsec++){
2700 Int_t sec2 = sec + dsec;
2702 // AliTPCRow& kr2 = fOuterSec[(sec2+fkNOS)%fkNOS][i2];
2703 //AliTPCRow& kr2m = fOuterSec[(sec2+fkNOS)%fkNOS][imiddle];
2704 AliTPCRow& kr2 = GetRow((sec2+fkNOS)%fkNOS,i2);
2705 AliTPCRow& kr2m = GetRow((sec2+fkNOS)%fkNOS,imiddle);
2706 Int_t index1 = TMath::Max(kr2.Find(extraz-0.6-dddz1*TMath::Abs(z1)*0.05)-1,0);
2707 Int_t index2 = TMath::Min(kr2.Find(extraz+0.6+dddz2*TMath::Abs(z1)*0.05)+1,kr2);
2709 // rotation angles to p1-p3
2710 Double_t cs13r = cos(-angle13+dsec*alpha)/dvertex, sn13r = sin(-angle13+dsec*alpha)/dvertex;
2711 Double_t x2, y2, z2;
2713 // Double_t dymax = maxangle*TMath::Abs(x1-xx2);
2716 Double_t dxx0 = (xx2-x3)*cs13r;
2717 Double_t dyy0 = (xx2-x3)*sn13r;
2718 for (Int_t js=index1; js < index2; js++) {
2719 const AliTPCclusterMI *kcl = kr2[js];
2720 if (kcl->IsUsed(10)) continue;
2722 //calcutate parameters
2724 Double_t yy0 = dyy0 +(kcl->GetY()-y3)*cs13r;
2726 if (TMath::Abs(yy0)<0.000001) continue;
2727 Double_t xx0 = dxx0 -(kcl->GetY()-y3)*sn13r;
2728 Double_t y0 = 0.5*(xx0*xx0+yy0*yy0-xx0)/yy0;
2729 Double_t r02 = (0.25+y0*y0)*dvertex2;
2730 //curvature (radius) cut
2731 if (r02<r2min) continue;
2735 Double_t c0 = 1/TMath::Sqrt(r02);
2739 //Double_t dfi0 = 2.*TMath::ASin(dvertex*c0*0.5);
2740 //Double_t dfi1 = 2.*TMath::ASin(TMath::Sqrt(yy0*yy0+(1-xx0)*(1-xx0))*dvertex*c0*0.5);
2741 Double_t dfi0 = 2.*AliTPCFastMath::FastAsin(dvertex*c0*0.5);
2742 Double_t dfi1 = 2.*AliTPCFastMath::FastAsin(TMath::Sqrt(yy0*yy0+(1-xx0)*(1-xx0))*dvertex*c0*0.5);
2745 Double_t z0 = kcl->GetZ();
2746 Double_t zzzz2 = z1-(z1-z3)*dfi1/dfi0;
2747 if (TMath::Abs(zzzz2-z0)>0.5) continue;
2750 Double_t dip = (z1-z0)*c0/dfi1;
2751 Double_t x0 = (0.5*cs13+y0*sn13)*dvertex*c0;
2762 x2= xx2*cs-y2*sn*dsec;
2763 y2=+xx2*sn*dsec+y2*cs;
2773 // do we have cluster at the middle ?
2775 GetProlongation(x1,xm,x,ym,zm);
2777 AliTPCclusterMI * cm=0;
2778 if (TMath::Abs(ym)-ymaxm<0){
2779 cm = krm.FindNearest2(ym,zm,1.0,0.6,dummy);
2780 if ((!cm) || (cm->IsUsed(10))) {
2785 // rotate y1 to system 0
2786 // get state vector in rotated system
2787 Double_t yr1 = (-0.5*sn13+y0*cs13)*dvertex*c0;
2788 Double_t xr2 = x0*cs+yr1*sn*dsec;
2789 Double_t xr[5]={kcl->GetY(),kcl->GetZ(), xr2, dip, c0};
2791 GetProlongation(xx2,xm,xr,ym,zm);
2792 if (TMath::Abs(ym)-ymaxm<0){
2793 cm = kr2m.FindNearest2(ym,zm,1.0,0.6,dummy);
2794 if ((!cm) || (cm->IsUsed(10))) {
2804 dym = ym - cm->GetY();
2805 dzm = zm - cm->GetZ();
2812 Double_t sy1=kr1[is]->GetSigmaY2()*2., sz1=kr1[is]->GetSigmaZ2()*2.;
2813 Double_t sy2=kcl->GetSigmaY2()*2., sz2=kcl->GetSigmaZ2()*2.;
2814 //Double_t sy3=400*3./12., sy=0.1, sz=0.1;
2815 Double_t sy3=25000*x[4]*x[4]+0.1, sy=0.1, sz=0.1;
2816 //Double_t sy3=25000*x[4]*x[4]*60+0.5, sy=0.1, sz=0.1;
2818 Double_t f40=(F1(x1,y1+sy,x2,y2,x3,y3)-x[4])/sy;
2819 Double_t f42=(F1(x1,y1,x2,y2+sy,x3,y3)-x[4])/sy;
2820 Double_t f43=(F1(x1,y1,x2,y2,x3,y3+sy)-x[4])/sy;
2821 Double_t f20=(F2(x1,y1+sy,x2,y2,x3,y3)-x[2])/sy;
2822 Double_t f22=(F2(x1,y1,x2,y2+sy,x3,y3)-x[2])/sy;
2823 Double_t f23=(F2(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy;
2825 Double_t f30=(F3(x1,y1+sy,x2,y2,z1,z2)-x[3])/sy;
2826 Double_t f31=(F3(x1,y1,x2,y2,z1+sz,z2)-x[3])/sz;
2827 Double_t f32=(F3(x1,y1,x2,y2+sy,z1,z2)-x[3])/sy;
2828 Double_t f34=(F3(x1,y1,x2,y2,z1,z2+sz)-x[3])/sz;
2832 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
2833 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
2834 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
2835 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
2836 c[13]=f30*sy1*f40+f32*sy2*f42;
2837 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
2839 // if (!BuildSeed(kr1[is],kcl,0,x1,x2,x3,x,c)) continue;
2841 UInt_t index=kr1.GetIndex(is);
2842 AliTPCseed *track=new(seed) AliTPCseed(index, x, c, x1, ns*alpha+shift);
2844 track->fIsSeeding = kTRUE;
2851 FollowProlongation(*track, (i1+i2)/2,1);
2852 Int_t foundable,found,shared;
2853 track->GetClusterStatistic((i1+i2)/2,i1, found, foundable, shared, kTRUE);
2854 if ((found<0.55*foundable) || shared>0.5*found || (track->GetSigmaY2()+track->GetSigmaZ2())>0.5){
2856 seed->~AliTPCseed();
2862 FollowProlongation(*track, i2,1);
2866 track->fBConstrain =1;
2867 // track->fLastPoint = i1+fInnerSec->GetNRows(); // first cluster in track position
2868 track->fLastPoint = i1; // first cluster in track position
2869 track->fFirstPoint = track->fLastPoint;
2871 if (track->GetNumberOfClusters()<(i1-i2)*0.5 ||
2872 track->GetNumberOfClusters() < track->fNFoundable*0.6 ||
2873 track->fNShared>0.4*track->GetNumberOfClusters() ) {
2875 seed->~AliTPCseed();
2879 // Z VERTEX CONDITION
2881 zv = track->GetZ()+track->GetTgl()/track->GetC()*
2882 ( asin(-track->GetEta()) - asin(track->GetX()*track->GetC()-track->GetEta()));
2883 if (TMath::Abs(zv-z3)>cuts[2]) {
2884 FollowProlongation(*track, TMath::Max(i2-20,0));
2885 zv = track->GetZ()+track->GetTgl()/track->GetC()*
2886 ( asin(-track->GetEta()) - asin(track->GetX()*track->GetC()-track->GetEta()));
2887 if (TMath::Abs(zv-z3)>cuts[2]){
2888 FollowProlongation(*track, TMath::Max(i2-40,0));
2889 zv = track->GetZ()+track->GetTgl()/track->GetC()*
2890 ( asin(-track->GetEta()) - asin(track->GetX()*track->GetC()-track->GetEta()));
2891 if (TMath::Abs(zv-z3)>cuts[2] &&(track->GetNumberOfClusters() > track->fNFoundable*0.7)){
2892 // make seed without constrain
2893 AliTPCseed * track2 = MakeSeed(track,0.2,0.5,1.);
2894 FollowProlongation(*track2, i2,1);
2895 track2->fBConstrain = kFALSE;
2896 track2->fSeedType = 1;
2897 arr->AddLast(track2);
2899 seed->~AliTPCseed();
2904 seed->~AliTPCseed();
2911 track->fSeedType =0;
2912 arr->AddLast(track);
2913 seed = new AliTPCseed;
2915 // don't consider other combinations
2916 if (track->GetNumberOfClusters() > track->fNFoundable*0.8)
2922 Info("MakeSeeds3","\nSeeding statistic:\t%d\t%d\t%d\t%d\t%d\t%d",nin0,nin1,nin2,nin,nout1,nout2);
2928 void AliTPCtrackerMI::MakeSeeds5(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t cuts[4],
2933 //-----------------------------------------------------------------
2934 // This function creates track seeds.
2935 //-----------------------------------------------------------------
2936 // cuts[0] - fP4 cut
2937 // cuts[1] - tan(phi) cut
2938 // cuts[2] - zvertex cut
2939 // cuts[3] - fP3 cut
2949 Double_t x[5], c[15];
2951 // make temporary seed
2952 AliTPCseed * seed = new AliTPCseed;
2953 Double_t alpha=fOuterSec->GetAlpha(), shift=fOuterSec->GetAlphaShift();
2954 // Double_t cs=cos(alpha), sn=sin(alpha);
2959 Double_t x1 = GetXrow(i1-1);
2960 const AliTPCRow& kr1=GetRow(sec,i1-1);
2961 Double_t y1max = GetMaxY(i1-1)-kr1.fDeadZone-1.5;
2963 Double_t x1p = GetXrow(i1);
2964 const AliTPCRow& kr1p=GetRow(sec,i1);
2966 Double_t x1m = GetXrow(i1-2);
2967 const AliTPCRow& kr1m=GetRow(sec,i1-2);
2970 //last 3 padrow for seeding
2971 AliTPCRow& kr3 = GetRow((sec+fkNOS)%fkNOS,i1-7);
2972 Double_t x3 = GetXrow(i1-7);
2973 // Double_t y3max= GetMaxY(i1-7)-kr3.fDeadZone-1.5;
2975 AliTPCRow& kr3p = GetRow((sec+fkNOS)%fkNOS,i1-6);
2976 Double_t x3p = GetXrow(i1-6);
2978 AliTPCRow& kr3m = GetRow((sec+fkNOS)%fkNOS,i1-8);
2979 Double_t x3m = GetXrow(i1-8);
2984 Int_t im = i1-4; //middle pad row index
2985 Double_t xm = GetXrow(im); // radius of middle pad-row
2986 const AliTPCRow& krm=GetRow(sec,im); //middle pad -row
2987 // Double_t ymmax = GetMaxY(im)-kr1.fDeadZone-1.5;
2990 Double_t deltax = x1-x3;
2991 Double_t dymax = deltax*cuts[1];
2992 Double_t dzmax = deltax*cuts[3];
2994 // loop over clusters
2995 for (Int_t is=0; is < kr1; is++) {
2997 if (kr1[is]->IsUsed(10)) continue;
2998 Double_t y1=kr1[is]->GetY(), z1=kr1[is]->GetZ();
3000 if (deltay>0 && TMath::Abs(y1max-TMath::Abs(y1))> deltay ) continue; // seed only at the edge
3002 Int_t index1 = TMath::Max(kr3.Find(z1-dzmax)-1,0);
3003 Int_t index2 = TMath::Min(kr3.Find(z1+dzmax)+1,kr3);
3009 for (Int_t js=index1; js < index2; js++) {
3010 const AliTPCclusterMI *kcl = kr3[js];
3011 if (kcl->IsUsed(10)) continue;
3013 // apply angular cuts
3014 if (TMath::Abs(y1-y3)>dymax) continue;
3017 if (TMath::Abs(z1-z3)>dzmax) continue;
3019 Double_t angley = (y1-y3)/(x1-x3);
3020 Double_t anglez = (z1-z3)/(x1-x3);
3022 Double_t erry = TMath::Abs(angley)*(x1-x1m)*0.5+0.5;
3023 Double_t errz = TMath::Abs(anglez)*(x1-x1m)*0.5+0.5;
3025 Double_t yyym = angley*(xm-x1)+y1;
3026 Double_t zzzm = anglez*(xm-x1)+z1;
3028 const AliTPCclusterMI *kcm = krm.FindNearest2(yyym,zzzm,erry,errz,index);
3030 if (kcm->IsUsed(10)) continue;
3032 erry = TMath::Abs(angley)*(x1-x1m)*0.4+0.5;
3033 errz = TMath::Abs(anglez)*(x1-x1m)*0.4+0.5;
3040 // look around first
3041 const AliTPCclusterMI *kc1m = kr1m.FindNearest2(angley*(x1m-x1)+y1,
3047 if (kc1m->IsUsed(10)) used++;
3049 const AliTPCclusterMI *kc1p = kr1p.FindNearest2(angley*(x1p-x1)+y1,
3055 if (kc1p->IsUsed(10)) used++;
3057 if (used>1) continue;
3058 if (found<1) continue;
3062 const AliTPCclusterMI *kc3m = kr3m.FindNearest2(angley*(x3m-x3)+y3,
3068 if (kc3m->IsUsed(10)) used++;
3072 const AliTPCclusterMI *kc3p = kr3p.FindNearest2(angley*(x3p-x3)+y3,
3078 if (kc3p->IsUsed(10)) used++;
3082 if (used>1) continue;
3083 if (found<3) continue;
3093 x[4]=F1(x1,y1,x2,y2,x3,y3);
3094 //if (TMath::Abs(x[4]) >= cuts[0]) continue;
3097 x[2]=F2(x1,y1,x2,y2,x3,y3);
3100 x[3]=F3n(x1,y1,x2,y2,z1,z2,x[4]);
3101 //if (TMath::Abs(x[3]) > cuts[3]) continue;
3105 Double_t sy1=0.1, sz1=0.1;
3106 Double_t sy2=0.1, sz2=0.1;
3107 Double_t sy3=0.1, sy=0.1, sz=0.1;
3109 Double_t f40=(F1(x1,y1+sy,x2,y2,x3,y3)-x[4])/sy;
3110 Double_t f42=(F1(x1,y1,x2,y2+sy,x3,y3)-x[4])/sy;
3111 Double_t f43=(F1(x1,y1,x2,y2,x3,y3+sy)-x[4])/sy;
3112 Double_t f20=(F2(x1,y1+sy,x2,y2,x3,y3)-x[2])/sy;
3113 Double_t f22=(F2(x1,y1,x2,y2+sy,x3,y3)-x[2])/sy;
3114 Double_t f23=(F2(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy;
3116 Double_t f30=(F3(x1,y1+sy,x2,y2,z1,z2)-x[3])/sy;
3117 Double_t f31=(F3(x1,y1,x2,y2,z1+sz,z2)-x[3])/sz;
3118 Double_t f32=(F3(x1,y1,x2,y2+sy,z1,z2)-x[3])/sy;
3119 Double_t f34=(F3(x1,y1,x2,y2,z1,z2+sz)-x[3])/sz;
3123 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3124 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3125 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3126 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3127 c[13]=f30*sy1*f40+f32*sy2*f42;
3128 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3130 // if (!BuildSeed(kr1[is],kcl,0,x1,x2,x3,x,c)) continue;
3132 UInt_t index=kr1.GetIndex(is);
3133 AliTPCseed *track=new(seed) AliTPCseed(index, x, c, x1, sec*alpha+shift);
3135 track->fIsSeeding = kTRUE;
3138 FollowProlongation(*track, i1-7,1);
3139 if (track->GetNumberOfClusters() < track->fNFoundable*0.75 ||
3140 track->fNShared>0.6*track->GetNumberOfClusters() || ( track->GetSigmaY2()+ track->GetSigmaZ2())>0.6){
3142 seed->~AliTPCseed();
3148 FollowProlongation(*track, i2,1);
3149 track->fBConstrain =0;
3150 track->fLastPoint = i1+fInnerSec->GetNRows(); // first cluster in track position
3151 track->fFirstPoint = track->fLastPoint;
3153 if (track->GetNumberOfClusters()<(i1-i2)*0.5 ||
3154 track->GetNumberOfClusters()<track->fNFoundable*0.7 ||
3155 track->fNShared>2. || track->GetChi2()/track->GetNumberOfClusters()>6 || ( track->GetSigmaY2()+ track->GetSigmaZ2())>0.5 ) {
3157 seed->~AliTPCseed();
3162 FollowProlongation(*track, TMath::Max(i2-10,0),1);
3163 AliTPCseed * track2 = MakeSeed(track,0.2,0.5,0.9);
3164 FollowProlongation(*track2, i2,1);
3165 track2->fBConstrain = kFALSE;
3166 track2->fSeedType = 4;
3167 arr->AddLast(track2);
3169 seed->~AliTPCseed();
3173 //arr->AddLast(track);
3174 //seed = new AliTPCseed;
3180 Info("MakeSeeds5","\nSeeding statiistic:\t%d\t%d\t%d\t%d\t%d\t%d",nin0,nin1,nin2,nin,nout1,nout2,nout3);
3186 //_____________________________________________________________________________
3187 void AliTPCtrackerMI::MakeSeeds2(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t */*cuts[4]*/,
3188 Float_t deltay, Bool_t /*bconstrain*/) {
3189 //-----------------------------------------------------------------
3190 // This function creates track seeds - without vertex constraint
3191 //-----------------------------------------------------------------
3192 // cuts[0] - fP4 cut - not applied
3193 // cuts[1] - tan(phi) cut
3194 // cuts[2] - zvertex cut - not applied
3195 // cuts[3] - fP3 cut
3205 Double_t alpha=fOuterSec->GetAlpha(), shift=fOuterSec->GetAlphaShift();
3206 // Double_t cs=cos(alpha), sn=sin(alpha);
3207 Int_t row0 = (i1+i2)/2;
3208 Int_t drow = (i1-i2)/2;
3209 const AliTPCRow& kr0=fSectors[sec][row0];
3212 AliTPCpolyTrack polytrack;
3213 Int_t nclusters=fSectors[sec][row0];
3214 AliTPCseed * seed = new AliTPCseed;
3219 for (Int_t is=0; is < nclusters; is++) { //LOOP over clusters
3221 Int_t nfoundable =0;
3222 for (Int_t iter =1; iter<2; iter++){ //iterations
3223 const AliTPCRow& krm=fSectors[sec][row0-iter];
3224 const AliTPCRow& krp=fSectors[sec][row0+iter];
3225 const AliTPCclusterMI * cl= kr0[is];
3227 if (cl->IsUsed(10)) {
3233 Double_t x = kr0.GetX();
3234 // Initialization of the polytrack
3239 Double_t y0= cl->GetY();
3240 Double_t z0= cl->GetZ();
3244 Double_t ymax = fSectors->GetMaxY(row0)-kr0.fDeadZone-1.5;
3245 if (deltay>0 && TMath::Abs(ymax-TMath::Abs(y0))> deltay ) continue; // seed only at the edge
3247 erry = (0.5)*cl->GetSigmaY2()/TMath::Sqrt(cl->GetQ())*6;
3248 errz = (0.5)*cl->GetSigmaZ2()/TMath::Sqrt(cl->GetQ())*6;
3249 polytrack.AddPoint(x,y0,z0,erry, errz);
3252 if (cl->IsUsed(10)) sumused++;
3255 Float_t roady = (5*TMath::Sqrt(cl->GetSigmaY2()+0.2)+1.)*iter;
3256 Float_t roadz = (5*TMath::Sqrt(cl->GetSigmaZ2()+0.2)+1.)*iter;
3259 AliTPCclusterMI * cl1 = krm.FindNearest(y0,z0,roady,roadz);
3260 if (cl1 && TMath::Abs(ymax-TMath::Abs(y0))) {
3261 erry = (0.5)*cl1->GetSigmaY2()/TMath::Sqrt(cl1->GetQ())*3;
3262 errz = (0.5)*cl1->GetSigmaZ2()/TMath::Sqrt(cl1->GetQ())*3;
3263 if (cl1->IsUsed(10)) sumused++;
3264 polytrack.AddPoint(x,cl1->GetY(),cl1->GetZ(),erry,errz);
3268 AliTPCclusterMI * cl2 = krp.FindNearest(y0,z0,roady,roadz);
3270 erry = (0.5)*cl2->GetSigmaY2()/TMath::Sqrt(cl2->GetQ())*3;
3271 errz = (0.5)*cl2->GetSigmaZ2()/TMath::Sqrt(cl2->GetQ())*3;
3272 if (cl2->IsUsed(10)) sumused++;
3273 polytrack.AddPoint(x,cl2->GetY(),cl2->GetZ(),erry,errz);
3276 if (sumused>0) continue;
3278 polytrack.UpdateParameters();
3284 nfoundable = polytrack.GetN();
3285 nfound = nfoundable;
3287 for (Int_t ddrow = iter+1; ddrow<drow;ddrow++){
3288 Float_t maxdist = 0.8*(1.+3./(ddrow));
3289 for (Int_t delta = -1;delta<=1;delta+=2){
3290 Int_t row = row0+ddrow*delta;
3291 kr = &(fSectors[sec][row]);
3292 Double_t xn = kr->GetX();
3293 Double_t ymax = fSectors->GetMaxY(row)-kr->fDeadZone-1.5;
3294 polytrack.GetFitPoint(xn,yn,zn);
3295 if (TMath::Abs(yn)>ymax) continue;
3297 AliTPCclusterMI * cln = kr->FindNearest(yn,zn,roady,roadz);
3299 Float_t dist = TMath::Sqrt( (yn-cln->GetY())*(yn-cln->GetY())+(zn-cln->GetZ())*(zn-cln->GetZ()));
3302 erry = (dist+0.3)*cln->GetSigmaY2()/TMath::Sqrt(cln->GetQ())*(1.+1./(ddrow));
3303 errz = (dist+0.3)*cln->GetSigmaZ2()/TMath::Sqrt(cln->GetQ())*(1.+1./(ddrow));
3304 if (cln->IsUsed(10)) {
3305 // printf("used\n");
3313 polytrack.AddPoint(xn,cln->GetY(),cln->GetZ(),erry, errz);
3318 if ( (sumused>3) || (sumused>0.5*nfound) || (nfound<0.6*nfoundable)) break;
3319 polytrack.UpdateParameters();
3322 if ( (sumused>3) || (sumused>0.5*nfound)) {
3323 //printf("sumused %d\n",sumused);
3328 polytrack.GetFitDerivation(kr0.GetX(),dy,dz);
3329 AliTPCpolyTrack track2;
3331 polytrack.Refit(track2,0.5+TMath::Abs(dy)*0.3,0.4+TMath::Abs(dz)*0.3);
3332 if (track2.GetN()<0.5*nfoundable) continue;
3335 if ((nfound>0.6*nfoundable) &&( nfoundable>0.4*(i1-i2))) {
3337 // test seed with and without constrain
3338 for (Int_t constrain=0; constrain<=0;constrain++){
3339 // add polytrack candidate
3341 Double_t x[5], c[15];
3342 Double_t x1,x2,x3,y1,y2,y3,z1,z2,z3;
3343 track2.GetBoundaries(x3,x1);
3345 track2.GetFitPoint(x1,y1,z1);
3346 track2.GetFitPoint(x2,y2,z2);
3347 track2.GetFitPoint(x3,y3,z3);
3349 //is track pointing to the vertex ?
3352 polytrack.GetFitPoint(x0,y0,z0);
3365 x[4]=F1(x1,y1,x2,y2,x3,y3);
3367 // if (TMath::Abs(x[4]) >= cuts[0]) continue; //
3368 x[2]=F2(x1,y1,x2,y2,x3,y3);
3370 //if (TMath::Abs(x[4]*x1-x[2]) >= cuts[1]) continue;
3371 //x[3]=F3(x1,y1,x2,y2,z1,z2);
3372 x[3]=F3n(x1,y1,x3,y3,z1,z3,x[4]);
3373 //if (TMath::Abs(x[3]) > cuts[3]) continue;
3376 Double_t sy =0.1, sz =0.1;
3377 Double_t sy1=0.02, sz1=0.02;
3378 Double_t sy2=0.02, sz2=0.02;
3382 sy3=25000*x[4]*x[4]+0.1, sy=0.1, sz=0.1;
3385 Double_t f40=(F1(x1,y1+sy,x2,y2,x3,y3)-x[4])/sy;
3386 Double_t f42=(F1(x1,y1,x2,y2+sy,x3,y3)-x[4])/sy;
3387 Double_t f43=(F1(x1,y1,x2,y2,x3,y3+sy)-x[4])/sy;
3388 Double_t f20=(F2(x1,y1+sy,x2,y2,x3,y3)-x[2])/sy;
3389 Double_t f22=(F2(x1,y1,x2,y2+sy,x3,y3)-x[2])/sy;
3390 Double_t f23=(F2(x1,y1,x2,y2,x3,y3+sy)-x[2])/sy;
3392 Double_t f30=(F3(x1,y1+sy,x3,y3,z1,z3)-x[3])/sy;
3393 Double_t f31=(F3(x1,y1,x3,y3,z1+sz,z3)-x[3])/sz;
3394 Double_t f32=(F3(x1,y1,x3,y3+sy,z1,z3)-x[3])/sy;
3395 Double_t f34=(F3(x1,y1,x3,y3,z1,z3+sz)-x[3])/sz;
3400 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3401 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3402 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3403 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3404 c[13]=f30*sy1*f40+f32*sy2*f42;
3405 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3407 //Int_t row1 = fSectors->GetRowNumber(x1);
3408 Int_t row1 = GetRowNumber(x1);
3412 AliTPCseed *track=new (seed) AliTPCseed(index, x, c, x1, sec*alpha+shift);
3413 track->fIsSeeding = kTRUE;
3414 Int_t rc=FollowProlongation(*track, i2);
3415 if (constrain) track->fBConstrain =1;
3417 track->fBConstrain =0;
3418 track->fLastPoint = row1+fInnerSec->GetNRows(); // first cluster in track position
3419 track->fFirstPoint = track->fLastPoint;
3421 if (rc==0 || track->GetNumberOfClusters()<(i1-i2)*0.5 ||
3422 track->GetNumberOfClusters() < track->fNFoundable*0.6 ||
3423 track->fNShared>0.4*track->GetNumberOfClusters()) {
3426 seed->~AliTPCseed();
3429 arr->AddLast(track);
3430 seed = new AliTPCseed;
3434 } // if accepted seed
3437 Info("MakeSeeds2","\nSeeding statiistic:\t%d\t%d\t%d\t%d",nin0,nin1,nin2,nin3);
3443 AliTPCseed *AliTPCtrackerMI::MakeSeed(AliTPCseed *track, Float_t r0, Float_t r1, Float_t r2)
3447 //reseed using track points
3448 Int_t p0 = int(r0*track->GetNumberOfClusters()); // point 0
3449 Int_t p1 = int(r1*track->GetNumberOfClusters());
3450 Int_t p2 = int(r2*track->GetNumberOfClusters()); // last point
3452 Double_t x0[3],x1[3],x2[3];
3457 // find track position at given ratio of the length
3458 Int_t sec0, sec1, sec2;
3464 for (Int_t i=0;i<160;i++){
3465 if (track->fClusterPointer[i]){
3467 AliTPCTrackerPoint *trpoint =track->GetTrackPoint(i);
3468 if ( (index<p0) || x0[0]<0 ){
3469 if (trpoint->GetX()>1){
3470 clindex = track->GetClusterIndex2(i);
3472 x0[0] = trpoint->GetX();
3473 x0[1] = trpoint->GetY();
3474 x0[2] = trpoint->GetZ();
3475 sec0 = ((clindex&0xff000000)>>24)%18;
3480 if ( (index<p1) &&(trpoint->GetX()>1)){
3481 clindex = track->GetClusterIndex2(i);
3483 x1[0] = trpoint->GetX();
3484 x1[1] = trpoint->GetY();
3485 x1[2] = trpoint->GetZ();
3486 sec1 = ((clindex&0xff000000)>>24)%18;
3489 if ( (index<p2) &&(trpoint->GetX()>1)){
3490 clindex = track->GetClusterIndex2(i);
3492 x2[0] = trpoint->GetX();
3493 x2[1] = trpoint->GetY();
3494 x2[2] = trpoint->GetZ();
3495 sec2 = ((clindex&0xff000000)>>24)%18;
3502 Double_t alpha, cs,sn, xx2,yy2;
3504 alpha = (sec1-sec2)*fSectors->GetAlpha();
3505 cs = TMath::Cos(alpha);
3506 sn = TMath::Sin(alpha);
3507 xx2= x1[0]*cs-x1[1]*sn;
3508 yy2= x1[0]*sn+x1[1]*cs;
3512 alpha = (sec0-sec2)*fSectors->GetAlpha();
3513 cs = TMath::Cos(alpha);
3514 sn = TMath::Sin(alpha);
3515 xx2= x0[0]*cs-x0[1]*sn;
3516 yy2= x0[0]*sn+x0[1]*cs;
3522 Double_t x[5],c[15];
3526 x[4]=F1(x2[0],x2[1],x1[0],x1[1],x0[0],x0[1]);
3527 // if (x[4]>1) return 0;
3528 x[2]=F2(x2[0],x2[1],x1[0],x1[1],x0[0],x0[1]);
3529 x[3]=F3n(x2[0],x2[1],x0[0],x0[1],x2[2],x0[2],x[4]);
3530 //if (TMath::Abs(x[3]) > 2.2) return 0;
3531 //if (TMath::Abs(x[2]) > 1.99) return 0;
3533 Double_t sy =0.1, sz =0.1;
3535 Double_t sy1=0.02+track->GetSigmaY2(), sz1=0.02+track->GetSigmaZ2();
3536 Double_t sy2=0.01+track->GetSigmaY2(), sz2=0.01+track->GetSigmaZ2();
3537 Double_t sy3=0.01+track->GetSigmaY2();
3539 Double_t f40=(F1(x2[0],x2[1]+sy,x1[0],x1[1],x0[0],x0[1])-x[4])/sy;
3540 Double_t f42=(F1(x2[0],x2[1],x1[0],x1[1]+sy,x0[0],x0[1])-x[4])/sy;
3541 Double_t f43=(F1(x2[0],x2[1],x1[0],x1[1],x0[0],x0[1]+sy)-x[4])/sy;
3542 Double_t f20=(F2(x2[0],x2[1]+sy,x1[0],x1[1],x0[0],x0[1])-x[2])/sy;
3543 Double_t f22=(F2(x2[0],x2[1],x1[0],x1[1]+sy,x0[0],x0[1])-x[2])/sy;
3544 Double_t f23=(F2(x2[0],x2[1],x1[0],x1[1],x0[0],x0[1]+sy)-x[2])/sy;
3546 Double_t f30=(F3(x2[0],x2[1]+sy,x0[0],x0[1],x2[2],x0[2])-x[3])/sy;
3547 Double_t f31=(F3(x2[0],x2[1],x0[0],x0[1],x2[2]+sz,x0[2])-x[3])/sz;
3548 Double_t f32=(F3(x2[0],x2[1],x0[0],x0[1]+sy,x2[2],x0[2])-x[3])/sy;
3549 Double_t f34=(F3(x2[0],x2[1],x0[0],x0[1],x2[2],x0[2]+sz)-x[3])/sz;
3554 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3555 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3556 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3557 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3558 c[13]=f30*sy1*f40+f32*sy2*f42;
3559 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3561 // Int_t row1 = fSectors->GetRowNumber(x2[0]);
3562 AliTPCseed *seed=new AliTPCseed(0, x, c, x2[0], sec2*fSectors->GetAlpha()+fSectors->GetAlphaShift());
3563 // Double_t y0,z0,y1,z1, y2,z2;
3564 //seed->GetProlongation(x0[0],y0,z0);
3565 // seed->GetProlongation(x1[0],y1,z1);
3566 //seed->GetProlongation(x2[0],y2,z2);
3568 seed->fLastPoint = pp2;
3569 seed->fFirstPoint = pp2;
3576 AliTPCseed *AliTPCtrackerMI::ReSeed(AliTPCseed *track, Float_t r0, Float_t r1, Float_t r2)
3580 //reseed using founded clusters
3582 // Find the number of clusters
3583 Int_t nclusters = 0;
3584 for (Int_t irow=0;irow<160;irow++){
3585 if (track->GetClusterIndex(irow)>0) nclusters++;
3589 ipos[0] = TMath::Max(int(r0*nclusters),0); // point 0 cluster
3590 ipos[1] = TMath::Min(int(r1*nclusters),nclusters-1); //
3591 ipos[2] = TMath::Min(int(r2*nclusters),nclusters-1); // last point
3595 Int_t row[3],sec[3]={0,0,0};
3597 // find track row position at given ratio of the length
3599 for (Int_t irow=0;irow<160;irow++){
3600 if (track->GetClusterIndex2(irow)<0) continue;
3602 for (Int_t ipoint=0;ipoint<3;ipoint++){
3603 if (index<=ipos[ipoint]) row[ipoint] = irow;
3607 //Get cluster and sector position
3608 for (Int_t ipoint=0;ipoint<3;ipoint++){
3609 Int_t clindex = track->GetClusterIndex2(row[ipoint]);
3610 AliTPCclusterMI * cl = GetClusterMI(clindex);
3613 // AliTPCclusterMI * cl = GetClusterMI(clindex);
3616 sec[ipoint] = ((clindex&0xff000000)>>24)%18;
3617 xyz[ipoint][0] = GetXrow(row[ipoint]);
3618 xyz[ipoint][1] = cl->GetY();
3619 xyz[ipoint][2] = cl->GetZ();
3623 // Calculate seed state vector and covariance matrix
3625 Double_t alpha, cs,sn, xx2,yy2;
3627 alpha = (sec[1]-sec[2])*fSectors->GetAlpha();
3628 cs = TMath::Cos(alpha);
3629 sn = TMath::Sin(alpha);
3630 xx2= xyz[1][0]*cs-xyz[1][1]*sn;
3631 yy2= xyz[1][0]*sn+xyz[1][1]*cs;
3635 alpha = (sec[0]-sec[2])*fSectors->GetAlpha();
3636 cs = TMath::Cos(alpha);
3637 sn = TMath::Sin(alpha);
3638 xx2= xyz[0][0]*cs-xyz[0][1]*sn;
3639 yy2= xyz[0][0]*sn+xyz[0][1]*cs;
3645 Double_t x[5],c[15];
3649 x[4]=F1(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]);
3650 x[2]=F2(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]);
3651 x[3]=F3n(xyz[2][0],xyz[2][1],xyz[0][0],xyz[0][1],xyz[2][2],xyz[0][2],x[4]);
3653 Double_t sy =0.1, sz =0.1;
3655 Double_t sy1=0.2, sz1=0.2;
3656 Double_t sy2=0.2, sz2=0.2;
3659 Double_t f40=(F1(xyz[2][0],xyz[2][1]+sy,xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1])-x[4])/sy;
3660 Double_t f42=(F1(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1]+sy,xyz[0][0],xyz[0][1])-x[4])/sy;
3661 Double_t f43=(F1(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]+sy)-x[4])/sy;
3662 Double_t f20=(F2(xyz[2][0],xyz[2][1]+sy,xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1])-x[2])/sy;
3663 Double_t f22=(F2(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1]+sy,xyz[0][0],xyz[0][1])-x[2])/sy;
3664 Double_t f23=(F2(xyz[2][0],xyz[2][1],xyz[1][0],xyz[1][1],xyz[0][0],xyz[0][1]+sy)-x[2])/sy;
3666 Double_t f30=(F3(xyz[2][0],xyz[2][1]+sy,xyz[0][0],xyz[0][1],xyz[2][2],xyz[0][2])-x[3])/sy;
3667 Double_t f31=(F3(xyz[2][0],xyz[2][1],xyz[0][0],xyz[0][1],xyz[2][2]+sz,xyz[0][2])-x[3])/sz;
3668 Double_t f32=(F3(xyz[2][0],xyz[2][1],xyz[0][0],xyz[0][1]+sy,xyz[2][2],xyz[0][2])-x[3])/sy;
3669 Double_t f34=(F3(xyz[2][0],xyz[2][1],xyz[0][0],xyz[0][1],xyz[2][2],xyz[0][2]+sz)-x[3])/sz;
3674 c[3]=f20*sy1; c[4]=0.; c[5]=f20*sy1*f20+f22*sy2*f22+f23*sy3*f23;
3675 c[6]=f30*sy1; c[7]=f31*sz1; c[8]=f30*sy1*f20+f32*sy2*f22;
3676 c[9]=f30*sy1*f30+f31*sz1*f31+f32*sy2*f32+f34*sz2*f34;
3677 c[10]=f40*sy1; c[11]=0.; c[12]=f40*sy1*f20+f42*sy2*f22+f43*sy3*f23;
3678 c[13]=f30*sy1*f40+f32*sy2*f42;
3679 c[14]=f40*sy1*f40+f42*sy2*f42+f43*sy3*f43;
3681 // Int_t row1 = fSectors->GetRowNumber(xyz[2][0]);
3682 AliTPCseed *seed=new AliTPCseed(0, x, c, xyz[2][0], sec[2]*fSectors->GetAlpha()+fSectors->GetAlphaShift());
3683 seed->fLastPoint = row[2];
3684 seed->fFirstPoint = row[2];
3688 Int_t AliTPCtrackerMI::CheckKinkPoint(AliTPCseed*seed, Float_t th)
3693 for (Int_t i=0;i<12;i++) seed->fKinkPoint[i]=0;
3695 if (TMath::Abs(seed->GetC())>0.01) return 0;
3698 Float_t x[160], y[160], erry[160], z[160], errz[160];
3700 Float_t xt[160], yt[160], zt[160];
3705 Int_t middle = seed->GetNumberOfClusters()/2;
3708 // find central sector, get local cooordinates
3710 for (Int_t i=seed->fFirstPoint;i<=seed->fLastPoint;i++) {
3711 sec[i]= seed->GetClusterSector(i)%18;
3714 AliTPCclusterMI * cl = seed->fClusterPointer[i];
3715 // if (cl==0) cl = GetClusterMI(seed->GetClusterIndex2(i));
3722 if (i>i2) i2 = i; //last point with cluster
3723 if (i2<i1) i1 = i; //first point with cluster
3726 AliTPCTrackerPoint * point = seed->GetTrackPoint(i);
3728 yt[i] = point->GetY();
3729 zt[i] = point->GetZ();
3731 if (point->GetX()>0){
3732 erry[i] = point->GetErrY();
3733 errz[i] = point->GetErrZ();
3738 secm = sec[i]; //central sector
3739 padm = i; //middle point with cluster
3744 // rotate position to global coordinate system connected to sector at last the point
3746 for (Int_t i=i1;i<=i2;i++){
3748 if (sec[i]<0) continue;
3749 Double_t alpha = (sec[i2]-sec[i])*fSectors->GetAlpha();
3750 Double_t cs = TMath::Cos(alpha);
3751 Double_t sn = TMath::Sin(alpha);
3752 Float_t xx2= x[i]*cs+y[i]*sn;
3753 Float_t yy2= -x[i]*sn+y[i]*cs;
3757 xx2= xt[i]*cs+yt[i]*sn;
3758 yy2= -xt[i]*sn+yt[i]*cs;
3763 //get "state" vector
3764 Double_t xh[5],xm = x[padm];
3767 xh[4]=F1(xt[i2],yt[i2],xt[padm],yt[padm],xt[i1],yt[i1]);
3768 xh[2]=F2(xt[i2],yt[i2],xt[padm],yt[padm],xt[i1],yt[i1]);
3769 xh[3]=F3n(xt[i2],yt[i2],xt[i1],yt[i1],zt[i2],zt[i1],xh[4]);
3772 for (Int_t i=i1;i<=i2;i++){
3774 if (sec[i]<0) continue;
3775 GetProlongation(x[i2], x[i],xh,yy,zz);
3776 if (TMath::Abs(y[i]-yy)>4||TMath::Abs(z[i]-zz)>4){
3778 //xxh[4]=F1old(x[i2],y[i2],x[padm],y[padm],x[i1],y[i1]);
3779 //xxh[2]=F2old(x[i2],y[i2],x[padm],y[padm],x[i1],y[i1]);
3780 Error("AliTPCtrackerMI::CheckKinkPoint","problem\n");
3785 Float_t dyup[160],dydown[160], dzup[160], dzdown[160];
3786 Float_t yup[160], ydown[160], zup[160], zdown[160];
3788 AliTPCpolyTrack ptrack1,ptrack2;
3791 for (Int_t i=i1;i<=i2;i++){
3792 AliTPCclusterMI * cl = seed->fClusterPointer[i];
3794 if (cl->GetType()<0) continue;
3795 if (cl->GetType()>10) continue;
3798 ptrack1.AddPoint(x[i]-xm,y[i],z[i],0.1,0.1);
3800 if (ptrack1.GetN()>4.){
3801 ptrack1.UpdateParameters();
3803 ptrack1.GetFitDerivation(x[i]-xm,ddy,ddz);
3805 ptrack1.GetFitPoint(x[i]-xm,yy,zz);
3814 dyup[i]=0.; //not enough points
3819 for (Int_t i=i2;i>=i1;i--){
3820 AliTPCclusterMI * cl = seed->fClusterPointer[i];
3822 if (cl->GetType()<0) continue;
3823 if (cl->GetType()>10) continue;
3825 ptrack2.AddPoint(x[i]-xm,y[i],z[i],0.1,0.1);
3827 if (ptrack2.GetN()>4){
3828 ptrack2.UpdateParameters();
3830 ptrack2.GetFitDerivation(x[i]-xm,ddy,ddz);
3832 ptrack2.GetFitPoint(x[i]-xm,yy,zz);
3840 dydown[i]=0.; //not enough points
3845 // find maximal difference of the derivation
3846 for (Int_t i=0;i<12;i++) seed->fKinkPoint[i]=0;
3849 for (Int_t i=i1+10;i<i2-10;i++){
3850 if ( (TMath::Abs(dydown[i])<0.00000001) || (TMath::Abs(dyup[i])<0.00000001) ||i<30)continue;
3851 // printf("%f\t%f\t%f\t%f\t%f\n",x[i],dydown[i],dyup[i],dzdown[i],dzup[i]);
3853 Float_t ddy = TMath::Abs(dydown[i]-dyup[i]);
3854 Float_t ddz = TMath::Abs(dzdown[i]-dzup[i]);
3855 if ( (ddy+ddz)> th){
3856 seed->fKinkPoint[0] = i;
3857 seed->fKinkPoint[1] = ddy;
3858 seed->fKinkPoint[2] = ddz;
3865 //write information to the debug tree
3866 TBranch * br = fTreeDebug->GetBranch("debug");
3867 TClonesArray * arr = new TClonesArray("AliTPCTrackPoint2");
3868 arr->ExpandCreateFast(i2-i1);
3869 br->SetAddress(&arr);
3871 AliTPCclusterMI cldummy;
3873 AliTPCTrackPoint2 pdummy;
3874 pdummy.GetTPoint().fIsShared = 10;
3876 Double_t alpha = sec[i2]*fSectors->GetAlpha();
3877 Double_t cs = TMath::Cos(alpha);
3878 Double_t sn = TMath::Sin(alpha);
3880 for (Int_t i=i1;i<i2;i++){
3881 AliTPCTrackPoint2 *trpoint = (AliTPCTrackPoint2*)arr->UncheckedAt(i-i1);
3883 AliTPCclusterMI * cl0 = seed->fClusterPointer[i];
3885 AliTPCTrackerPoint * point = seed->GetTrackPoint(i);
3888 Double_t x = GetXrow(i);
3889 trpoint->GetTPoint() = *point;
3890 trpoint->GetCPoint() = *cl0;
3891 trpoint->GetCPoint().SetQ(TMath::Abs(cl0->GetQ()));
3892 trpoint->fID = seed->GetUniqueID();
3893 trpoint->fLab = seed->GetLabel();
3895 trpoint->fGX = cs *x + sn*point->GetY();
3896 trpoint->fGY = -sn *x + cs*point->GetY() ;
3897 trpoint->fGZ = point->GetZ();
3899 trpoint->fDY = y[i];
3900 trpoint->fDZ = z[i];
3902 trpoint->fDYU = dyup[i];
3903 trpoint->fDZU = dzup[i];
3905 trpoint->fDYD = dydown[i];
3906 trpoint->fDZD = dzdown[i];
3908 if (TMath::Abs(dyup[i])>0.00000000001 &&TMath::Abs(dydown[i])>0.00000000001){
3909 trpoint->fDDY = dydown[i]-dyup[i];
3910 trpoint->fDDZ = dzdown[i]-dzup[i];
3918 trpoint->GetCPoint()= cldummy;
3935 AliTPCseed* AliTPCtrackerMI::ReSeed(AliTPCseed *t)
3938 // reseed - refit - track
3941 // Int_t last = fSectors->GetNRows()-1;
3943 if (fSectors == fOuterSec){
3944 first = TMath::Max(first, t->fFirstPoint-fInnerSec->GetNRows());
3948 first = t->fFirstPoint;
3950 AliTPCseed * seed = MakeSeed(t,0.1,0.5,0.9);
3951 FollowBackProlongation(*t,fSectors->GetNRows()-1);
3953 FollowProlongation(*t,first);
3963 //_____________________________________________________________________________
3964 Int_t AliTPCtrackerMI::ReadSeeds(const TFile *inp) {
3965 //-----------------------------------------------------------------
3966 // This function reades track seeds.
3967 //-----------------------------------------------------------------
3968 TDirectory *savedir=gDirectory;
3970 TFile *in=(TFile*)inp;
3971 if (!in->IsOpen()) {
3972 cerr<<"AliTPCtrackerMI::ReadSeeds(): input file is not open !\n";
3977 TTree *seedTree=(TTree*)in->Get("Seeds");
3979 cerr<<"AliTPCtrackerMI::ReadSeeds(): ";
3980 cerr<<"can't get a tree with track seeds !\n";
3983 AliTPCtrack *seed=new AliTPCtrack;
3984 seedTree->SetBranchAddress("tracks",&seed);
3986 if (fSeeds==0) fSeeds=new TObjArray(15000);
3988 Int_t n=(Int_t)seedTree->GetEntries();
3989 for (Int_t i=0; i<n; i++) {
3990 seedTree->GetEvent(i);
3991 fSeeds->AddLast(new AliTPCseed(*seed,seed->GetAlpha()));
4000 Int_t AliTPCtrackerMI::Clusters2Tracks (AliESD *esd)
4003 if (fSeeds) DeleteSeeds();
4006 if (!fSeeds) return 1;
4013 //_____________________________________________________________________________
4014 Int_t AliTPCtrackerMI::Clusters2Tracks() {
4015 //-----------------------------------------------------------------
4016 // This is a track finder.
4017 //-----------------------------------------------------------------
4018 TDirectory *savedir=gDirectory;
4022 fSeeds = Tracking();
4025 Info("Clusters2Tracks","Time for tracking: \t");timer.Print();timer.Start();
4027 //activate again some tracks
4028 for (Int_t i=0; i<fSeeds->GetEntriesFast(); i++) {
4029 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
4031 Int_t nc=t.GetNumberOfClusters();
4033 delete fSeeds->RemoveAt(i);
4036 if (pt->fRemoval==10) {
4037 if (pt->GetDensityFirst(20)>0.8 || pt->GetDensityFirst(30)>0.8 || pt->GetDensityFirst(40)>0.7)
4038 pt->Desactivate(10); // make track again active
4040 pt->Desactivate(20);
4041 delete fSeeds->RemoveAt(i);
4045 RemoveDouble(fSeeds,0.2,0.6,11);
4046 RemoveUsed(fSeeds,0.5,0.5,6);
4049 Int_t nseed=fSeeds->GetEntriesFast();
4051 for (Int_t i=0; i<nseed; i++) {
4052 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
4054 Int_t nc=t.GetNumberOfClusters();
4056 delete fSeeds->RemoveAt(i);
4059 CookLabel(pt,0.1); //For comparison only
4060 //if ((pt->IsActive() || (pt->fRemoval==10) )&& nc>50 &&pt->GetNumberOfClusters()>0.4*pt->fNFoundable){
4061 if ((pt->IsActive() || (pt->fRemoval==10) )){
4063 if (fDebug>0) cerr<<found<<'\r';
4067 delete fSeeds->RemoveAt(i);
4071 //RemoveOverlap(fSeeds,0.99,7,kTRUE);
4073 //RemoveUsed(fSeeds,0.9,0.9,6);
4075 nseed=fSeeds->GetEntriesFast();
4077 for (Int_t i=0; i<nseed; i++) {
4078 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
4080 Int_t nc=t.GetNumberOfClusters();
4082 delete fSeeds->RemoveAt(i);
4086 t.CookdEdx(0.02,0.6);
4087 // CheckKinkPoint(&t,0.05);
4088 //if ((pt->IsActive() || (pt->fRemoval==10) )&& nc>50 &&pt->GetNumberOfClusters()>0.4*pt->fNFoundable){
4089 if ((pt->IsActive() || (pt->fRemoval==10) )){
4097 delete fSeeds->RemoveAt(i);
4098 //AliTPCseed * seed1 = ReSeed(pt,0.05,0.5,1);
4100 // FollowProlongation(*seed1,0);
4101 // Int_t n = seed1->GetNumberOfClusters();
4102 // printf("fP4\t%f\t%f\n",seed1->GetC(),pt->GetC());
4103 // printf("fN\t%d\t%d\n", seed1->GetNumberOfClusters(),pt->GetNumberOfClusters());
4106 //AliTPCseed * seed2 = ReSeed(pt,0.95,0.5,0.05);
4110 SortTracks(fSeeds, 1);
4114 PrepareForBackProlongation(fSeeds,5.);
4115 PropagateBack(fSeeds);
4116 printf("Time for back propagation: \t");timer.Print();timer.Start();
4120 PrepareForProlongation(fSeeds,5.);
4121 PropagateForward2(fSeeds);
4123 printf("Time for FORWARD propagation: \t");timer.Print();timer.Start();
4124 // RemoveUsed(fSeeds,0.7,0.7,6);
4125 //RemoveOverlap(fSeeds,0.9,7,kTRUE);
4127 nseed=fSeeds->GetEntriesFast();
4129 for (Int_t i=0; i<nseed; i++) {
4130 AliTPCseed *pt=(AliTPCseed*)fSeeds->UncheckedAt(i), &t=*pt;
4132 Int_t nc=t.GetNumberOfClusters();
4134 delete fSeeds->RemoveAt(i);
4137 t.CookdEdx(0.02,0.6);
4138 // CookLabel(pt,0.1); //For comparison only
4139 //if ((pt->IsActive() || (pt->fRemoval==10) )&& nc>50 &&pt->GetNumberOfClusters()>0.4*pt->fNFoundable){
4140 if ((pt->IsActive() || (pt->fRemoval==10) )){
4141 cerr<<found++<<'\r';
4144 delete fSeeds->RemoveAt(i);
4149 // fNTracks = found;
4151 Info("Clusters2Tracks","Time for overlap removal, track writing and dedx cooking: \t"); timer.Print();timer.Start();
4154 // cerr<<"Number of found tracks : "<<"\t"<<found<<endl;
4155 Info("Clusters2Tracks","Number of found tracks %d",found);
4157 // UnloadClusters();
4162 void AliTPCtrackerMI::Tracking(TObjArray * arr)
4165 // tracking of the seeds
4168 fSectors = fOuterSec;
4169 ParallelTracking(arr,150,63);
4170 fSectors = fOuterSec;
4171 ParallelTracking(arr,63,0);
4174 TObjArray * AliTPCtrackerMI::Tracking(Int_t seedtype, Int_t i1, Int_t i2, Float_t cuts[4], Float_t dy, Int_t dsec)
4179 TObjArray * arr = new TObjArray;
4181 fSectors = fOuterSec;
4184 for (Int_t sec=0;sec<fkNOS;sec++){
4185 if (seedtype==3) MakeSeeds3(arr,sec,i1,i2,cuts,dy, dsec);
4186 if (seedtype==4) MakeSeeds5(arr,sec,i1,i2,cuts,dy);
4187 if (seedtype==2) MakeSeeds2(arr,sec,i1,i2,cuts,dy);
4190 Info("Tracking","\nSeeding - %d\t%d\t%d\t%d\n",seedtype,i1,i2,arr->GetEntriesFast());
4202 TObjArray * AliTPCtrackerMI::Tracking()
4208 Int_t nup=fOuterSec->GetNRows()+fInnerSec->GetNRows();
4210 TObjArray * seeds = new TObjArray;
4219 Float_t fnumber = 3.0;
4220 Float_t fdensity = 3.0;
4225 for (Int_t delta = 0; delta<18; delta+=6){
4229 arr = Tracking(3,nup-1-delta,nup-1-delta-gap,cuts,-1,1);
4230 SumTracks(seeds,arr);
4231 SignClusters(seeds,fnumber,fdensity);
4233 for (Int_t i=2;i<6;i+=2){
4234 // seed high pt tracks
4237 arr = Tracking(3,nup-i-delta,nup-i-delta-gap,cuts,-1,0);
4238 SumTracks(seeds,arr);
4239 SignClusters(seeds,fnumber,fdensity);
4244 // RemoveUsed(seeds,0.9,0.9,1);
4245 // UnsignClusters();
4246 // SignClusters(seeds,fnumber,fdensity);
4250 for (Int_t delta = 20; delta<120; delta+=10){
4252 // seed high pt tracks
4256 arr = Tracking(3,nup-delta,nup-delta-gap,cuts,-1);
4257 SumTracks(seeds,arr);
4258 SignClusters(seeds,fnumber,fdensity);
4263 arr = Tracking(3,nup-delta-5,nup-delta-5-gap,cuts,-1);
4264 SumTracks(seeds,arr);
4265 SignClusters(seeds,fnumber,fdensity);
4276 Info("Tracking()","\n\nPrimary seeding\t%d\n\n",seeds->GetEntriesFast());
4280 // RemoveUsed(seeds,0.75,0.75,1);
4282 //SignClusters(seeds,fnumber,fdensity);
4291 arr = Tracking(4,nup-1,nup-1-gap,cuts,-1);
4292 SumTracks(seeds,arr);
4293 SignClusters(seeds,fnumber,fdensity);
4295 arr = Tracking(4,nup-2,nup-2-gap,cuts,-1);
4296 SumTracks(seeds,arr);
4297 SignClusters(seeds,fnumber,fdensity);
4299 arr = Tracking(4,nup-3,nup-3-gap,cuts,-1);
4300 SumTracks(seeds,arr);
4301 SignClusters(seeds,fnumber,fdensity);
4305 for (Int_t delta = 3; delta<30; delta+=5){
4311 arr = Tracking(4,nup-1-delta,nup-1-delta-gap,cuts,-1);
4312 SumTracks(seeds,arr);
4313 SignClusters(seeds,fnumber,fdensity);
4315 arr = Tracking(4,nup-3-delta,nup-5-delta-gap,cuts,4);
4316 SumTracks(seeds,arr);
4317 SignClusters(seeds,fnumber,fdensity);
4329 for (Int_t delta = 30; delta<70; delta+=10){
4335 arr = Tracking(4,nup-1-delta,nup-1-delta-gap,cuts,-1);
4336 SumTracks(seeds,arr);
4337 SignClusters(seeds,fnumber,fdensity);
4339 arr = Tracking(4,nup-5-delta,nup-5-delta-gap,cuts,5 );
4340 SumTracks(seeds,arr);
4341 SignClusters(seeds,fnumber,fdensity);
4345 Info("Tracking()","\n\nSecondary seeding\t%d\n\n",seeds->GetEntriesFast());
4356 void AliTPCtrackerMI::SumTracks(TObjArray *arr1,TObjArray *arr2) const
4359 //sum tracks to common container
4360 //remove suspicious tracks
4361 Int_t nseed = arr2->GetEntriesFast();
4362 for (Int_t i=0;i<nseed;i++){
4363 AliTPCseed *pt=(AliTPCseed*)arr2->UncheckedAt(i);
4366 // NORMAL ACTIVE TRACK
4367 if (pt->IsActive()){
4368 arr1->AddLast(arr2->RemoveAt(i));
4371 //remove not usable tracks
4372 if (pt->fRemoval!=10){
4373 delete arr2->RemoveAt(i);
4376 // REMOVE VERY SHORT TRACKS
4377 if (pt->GetNumberOfClusters()<20){
4378 delete arr2->RemoveAt(i);
4381 // ENABLE ONLY ENOUGH GOOD STOPPED TRACKS
4382 if (pt->GetDensityFirst(20)>0.8 || pt->GetDensityFirst(30)>0.8 || pt->GetDensityFirst(40)>0.7)
4383 arr1->AddLast(arr2->RemoveAt(i));
4385 delete arr2->RemoveAt(i);
4394 void AliTPCtrackerMI::ParallelTracking(TObjArray * arr, Int_t rfirst, Int_t rlast)
4397 // try to track in parralel
4399 Int_t nseed=arr->GetEntriesFast();
4400 //prepare seeds for tracking
4401 for (Int_t i=0; i<nseed; i++) {
4402 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i), &t=*pt;
4404 if (!t.IsActive()) continue;
4405 // follow prolongation to the first layer
4406 if ( (fSectors ==fInnerSec) || (t.fFirstPoint-fParam->GetNRowLow()>rfirst+1) )
4407 FollowProlongation(t, rfirst+1);
4412 for (Int_t nr=rfirst; nr>=rlast; nr--){
4413 if (nr<fInnerSec->GetNRows())
4414 fSectors = fInnerSec;
4416 fSectors = fOuterSec;
4417 // make indexes with the cluster tracks for given
4419 // find nearest cluster
4420 for (Int_t i=0; i<nseed; i++) {
4421 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i), &t=*pt;
4423 if (!pt->IsActive()) continue;
4424 // if ( (fSectors ==fOuterSec) && (pt->fFirstPoint-fParam->GetNRowLow())<nr) continue;
4425 if (pt->fRelativeSector>17) {
4428 UpdateClusters(t,nr);
4430 // prolonagate to the nearest cluster - if founded
4431 for (Int_t i=0; i<nseed; i++) {
4432 AliTPCseed *pt=(AliTPCseed*)arr->UncheckedAt(i);
4434 if (!pt->IsActive()) continue;
4435 // if ((fSectors ==fOuterSec) && (pt->fFirstPoint-fParam->GetNRowLow())<nr) continue;
4436 if (pt->fRelativeSector>17) {
4439 FollowToNextCluster(*pt,nr);
4444 void AliTPCtrackerMI::PrepareForBackProlongation(TObjArray * arr,Float_t fac) const
4448 // if we use TPC track itself we have to "update" covariance
4450 Int_t nseed= arr->GetEntriesFast();
4451 for (Int_t i=0;i<nseed;i++){
4452 AliTPCseed *pt = (AliTPCseed*)arr->UncheckedAt(i);
4456 //rotate to current local system at first accepted point
4457 Int_t index = pt->GetClusterIndex2(pt->fFirstPoint);
4458 Int_t sec = (index&0xff000000)>>24;
4460 Float_t angle1 = fInnerSec->GetAlpha()*sec+fInnerSec->GetAlphaShift();
4461 if (angle1>TMath::Pi())
4462 angle1-=2.*TMath::Pi();
4463 Float_t angle2 = pt->GetAlpha();
4465 if (TMath::Abs(angle1-angle2)>0.001){
4466 pt->Rotate(angle1-angle2);
4467 //angle2 = pt->GetAlpha();
4468 //pt->fRelativeSector = pt->GetAlpha()/fInnerSec->GetAlpha();
4469 //if (pt->GetAlpha()<0)
4470 // pt->fRelativeSector+=18;
4471 //sec = pt->fRelativeSector;
4480 void AliTPCtrackerMI::PrepareForProlongation(TObjArray * arr, Float_t fac) const
4484 // if we use TPC track itself we have to "update" covariance
4486 Int_t nseed= arr->GetEntriesFast();
4487 for (Int_t i=0;i<nseed;i++){
4488 AliTPCseed *pt = (AliTPCseed*)arr->UncheckedAt(i);
4491 pt->fFirstPoint = pt->fLastPoint;
4499 Int_t AliTPCtrackerMI::PropagateBack(TObjArray * arr)
4502 // make back propagation
4504 Int_t nseed= arr->GetEntriesFast();
4505 for (Int_t i=0;i<nseed;i++){
4506 AliTPCseed *pt = (AliTPCseed*)arr->UncheckedAt(i);
4508 //AliTPCseed *pt2 = new AliTPCseed(*pt);
4509 fSectors = fInnerSec;
4510 //FollowBackProlongation(*pt,fInnerSec->GetNRows()-1);
4511 //fSectors = fOuterSec;
4512 FollowBackProlongation(*pt,fInnerSec->GetNRows()+fOuterSec->GetNRows()-1);
4513 //if (pt->GetNumberOfClusters()<(pt->fEsd->GetTPCclusters(0)) ){
4514 // Error("PropagateBack","Not prolonged track %d",pt->GetLabel());
4515 // FollowBackProlongation(*pt2,fInnerSec->GetNRows()+fOuterSec->GetNRows()-1);
4523 Int_t AliTPCtrackerMI::PropagateForward2(TObjArray * arr)
4526 // make forward propagation
4528 Int_t nseed= arr->GetEntriesFast();
4530 for (Int_t i=0;i<nseed;i++){
4531 AliTPCseed *pt = (AliTPCseed*)arr->UncheckedAt(i);
4533 FollowProlongation(*pt,0);
4540 Int_t AliTPCtrackerMI::PropagateForward()
4543 // propagate track forward
4545 Int_t nseed = fSeeds->GetEntriesFast();
4546 for (Int_t i=0;i<nseed;i++){
4547 AliTPCseed *pt = (AliTPCseed*)fSeeds->UncheckedAt(i);
4549 AliTPCseed &t = *pt;
4550 Double_t alpha=t.GetAlpha() - fSectors->GetAlphaShift();
4551 if (alpha > 2.*TMath::Pi()) alpha -= 2.*TMath::Pi();
4552 if (alpha < 0. ) alpha += 2.*TMath::Pi();
4553 t.fRelativeSector = Int_t(alpha/fSectors->GetAlpha()+0.0001)%fN;
4557 fSectors = fOuterSec;
4558 ParallelTracking(fSeeds,fOuterSec->GetNRows()+fInnerSec->GetNRows()-1,fInnerSec->GetNRows());
4559 fSectors = fInnerSec;
4560 ParallelTracking(fSeeds,fInnerSec->GetNRows()-1,0);
4570 Int_t AliTPCtrackerMI::PropagateBack(AliTPCseed * pt, Int_t row0, Int_t row1)
4573 // make back propagation, in between row0 and row1
4577 fSectors = fInnerSec;
4580 if (row1<fSectors->GetNRows())
4583 r1 = fSectors->GetNRows()-1;
4585 if (row0<fSectors->GetNRows()&& r1>0 )
4586 FollowBackProlongation(*pt,r1);
4587 if (row1<=fSectors->GetNRows())
4590 r1 = row1 - fSectors->GetNRows();
4591 if (r1<=0) return 0;
4592 if (r1>=fOuterSec->GetNRows()) return 0;
4593 fSectors = fOuterSec;
4594 return FollowBackProlongation(*pt,r1);
4602 void AliTPCtrackerMI::GetShape(AliTPCseed * seed, Int_t row)
4606 Float_t sd2 = TMath::Abs((fParam->GetZLength()-TMath::Abs(seed->GetZ())))*fParam->GetDiffL()*fParam->GetDiffL();
4607 // Float_t padlength = fParam->GetPadPitchLength(seed->fSector);
4608 Float_t padlength = GetPadPitchLength(row);
4610 Float_t sresy = (seed->fSector < fParam->GetNSector()/2) ? 0.2 :0.3;
4611 Float_t angulary = seed->GetSnp();
4612 angulary = angulary*angulary/(1-angulary*angulary);
4613 seed->fCurrentSigmaY2 = sd2+padlength*padlength*angulary/12.+sresy*sresy;
4615 Float_t sresz = fParam->GetZSigma();
4616 Float_t angularz = seed->GetTgl();
4617 seed->fCurrentSigmaZ2 = sd2+padlength*padlength*angularz*angularz*(1+angulary)/12.+sresz*sresz;
4619 Float_t wy = GetSigmaY(seed);
4620 Float_t wz = GetSigmaZ(seed);
4623 if (TMath::Abs(wy/seed->fCurrentSigmaY2-1)>0.0001 || TMath::Abs(wz/seed->fCurrentSigmaZ2-1)>0.0001 ){
4624 printf("problem\n");
4630 Float_t AliTPCtrackerMI::GetSigmaY(AliTPCseed * seed)
4634 Float_t sd2 = TMath::Abs((fParam->GetZLength()-TMath::Abs(seed->GetZ())))*fParam->GetDiffL()*fParam->GetDiffL();
4635 Float_t padlength = fParam->GetPadPitchLength(seed->fSector);
4636 Float_t sres = (seed->fSector < fParam->GetNSector()/2) ? 0.2 :0.3;
4637 Float_t angular = seed->GetSnp();
4638 angular = angular*angular/(1-angular*angular);
4639 // angular*=angular;
4640 //angular = TMath::Sqrt(angular/(1-angular));
4641 Float_t res = TMath::Sqrt(sd2+padlength*padlength*angular/12.+sres*sres);
4644 Float_t AliTPCtrackerMI::GetSigmaZ(AliTPCseed * seed)
4648 Float_t sd2 = TMath::Abs((fParam->GetZLength()-TMath::Abs(seed->GetZ())))*fParam->GetDiffL()*fParam->GetDiffL();
4649 Float_t padlength = fParam->GetPadPitchLength(seed->fSector);
4650 Float_t sres = fParam->GetZSigma();
4651 Float_t angular = seed->GetTgl();
4652 Float_t res = TMath::Sqrt(sd2+padlength*padlength*angular*angular/12.+sres*sres);
4659 //__________________________________________________________________________
4660 void AliTPCtrackerMI::CookLabel(AliTPCseed *t, Float_t wrong) const {
4661 //--------------------------------------------------------------------
4662 //This function "cooks" a track label. If label<0, this track is fake.
4663 //--------------------------------------------------------------------
4664 Int_t noc=t->GetNumberOfClusters();
4666 //printf("\nnot founded prolongation\n\n\n");
4672 AliTPCclusterMI *clusters[160];
4674 for (Int_t i=0;i<160;i++) {
4681 for (i=0; i<160 && current<noc; i++) {
4683 Int_t index=t->GetClusterIndex2(i);
4684 if (index<=0) continue;
4685 if (index&0x8000) continue;
4687 //clusters[current]=GetClusterMI(index);
4688 if (t->fClusterPointer[i]){
4689 clusters[current]=t->fClusterPointer[i];
4695 Int_t lab=123456789;
4696 for (i=0; i<noc; i++) {
4697 AliTPCclusterMI *c=clusters[i];
4699 lab=TMath::Abs(c->GetLabel(0));
4701 for (j=0; j<noc; j++) if (lb[j]==lab || mx[j]==0) break;
4707 for (i=0; i<noc; i++) if (mx[i]>max) {max=mx[i]; lab=lb[i];}
4709 for (i=0; i<noc; i++) {
4710 AliTPCclusterMI *c=clusters[i];
4712 if (TMath::Abs(c->GetLabel(1)) == lab ||
4713 TMath::Abs(c->GetLabel(2)) == lab ) max++;
4716 if ((1.- Float_t(max)/noc) > wrong) lab=-lab;
4719 Int_t tail=Int_t(0.10*noc);
4722 for (i=1; i<=160&&ind<tail; i++) {
4723 // AliTPCclusterMI *c=clusters[noc-i];
4724 AliTPCclusterMI *c=clusters[i];
4726 if (lab == TMath::Abs(c->GetLabel(0)) ||
4727 lab == TMath::Abs(c->GetLabel(1)) ||
4728 lab == TMath::Abs(c->GetLabel(2))) max++;
4731 if (max < Int_t(0.5*tail)) lab=-lab;
4738 //delete[] clusters;
4742 Int_t AliTPCtrackerMI::AliTPCSector::GetRowNumber(Double_t x) const
4744 //return pad row number for this x
4747 r=fRow[fN-1].GetX();
4748 if (x > r) return fN;
4750 if (x < r) return -1;
4751 return Int_t((x-r)/fPadPitchLength + 0.5);}
4753 r=fRow[fN-1].GetX();
4754 if (x > r) return fN;
4756 if (x < r) return -1;
4757 Double_t r1=fRow[64].GetX();
4759 return Int_t((x-r)/f1PadPitchLength + 0.5);}
4761 return (Int_t((x-r1)/f2PadPitchLength + 0.5)+64);}
4765 //_________________________________________________________________________
4766 void AliTPCtrackerMI::AliTPCSector::Setup(const AliTPCParam *par, Int_t f) {
4767 //-----------------------------------------------------------------------
4768 // Setup inner sector
4769 //-----------------------------------------------------------------------
4771 fAlpha=par->GetInnerAngle();
4772 fAlphaShift=par->GetInnerAngleShift();
4773 fPadPitchWidth=par->GetInnerPadPitchWidth();
4774 fPadPitchLength=par->GetInnerPadPitchLength();
4775 fN=par->GetNRowLow();
4776 fRow=new AliTPCRow[fN];
4777 for (Int_t i=0; i<fN; i++) {
4778 fRow[i].SetX(par->GetPadRowRadiiLow(i));
4779 fRow[i].fDeadZone =1.5; //1.5 cm of dead zone
4782 fAlpha=par->GetOuterAngle();
4783 fAlphaShift=par->GetOuterAngleShift();
4784 fPadPitchWidth = par->GetOuterPadPitchWidth();
4785 fPadPitchLength = par->GetOuter1PadPitchLength();
4786 f1PadPitchLength = par->GetOuter1PadPitchLength();
4787 f2PadPitchLength = par->GetOuter2PadPitchLength();
4789 fN=par->GetNRowUp();
4790 fRow=new AliTPCRow[fN];
4791 for (Int_t i=0; i<fN; i++) {
4792 fRow[i].SetX(par->GetPadRowRadiiUp(i));
4793 fRow[i].fDeadZone =1.5; // 1.5 cm of dead zone
4798 AliTPCtrackerMI::AliTPCRow::AliTPCRow() {
4800 // default constructor
4808 AliTPCtrackerMI::AliTPCRow::~AliTPCRow(){
4815 //_________________________________________________________________________
4817 AliTPCtrackerMI::AliTPCRow::InsertCluster(const AliTPCclusterMI* c, UInt_t index) {
4818 //-----------------------------------------------------------------------
4819 // Insert a cluster into this pad row in accordence with its y-coordinate
4820 //-----------------------------------------------------------------------
4821 if (fN==kMaxClusterPerRow) {
4822 cerr<<"AliTPCRow::InsertCluster(): Too many clusters !\n"; return;
4824 if (fN==0) {fIndex[0]=index; fClusters[fN++]=c; return;}
4825 Int_t i=Find(c->GetZ());
4826 memmove(fClusters+i+1 ,fClusters+i,(fN-i)*sizeof(AliTPCclusterMI*));
4827 memmove(fIndex +i+1 ,fIndex +i,(fN-i)*sizeof(UInt_t));
4828 fIndex[i]=index; fClusters[i]=c; fN++;
4831 void AliTPCtrackerMI::AliTPCRow::ResetClusters() {
4837 //delete[] fClusterArray;
4838 if (fClusters1) delete []fClusters1;
4839 if (fClusters2) delete []fClusters2;
4846 //___________________________________________________________________
4847 Int_t AliTPCtrackerMI::AliTPCRow::Find(Double_t z) const {
4848 //-----------------------------------------------------------------------
4849 // Return the index of the nearest cluster
4850 //-----------------------------------------------------------------------
4851 if (fN==0) return 0;
4852 if (z <= fClusters[0]->GetZ()) return 0;
4853 if (z > fClusters[fN-1]->GetZ()) return fN;
4854 Int_t b=0, e=fN-1, m=(b+e)/2;
4855 for (; b<e; m=(b+e)/2) {
4856 if (z > fClusters[m]->GetZ()) b=m+1;
4864 //___________________________________________________________________
4865 AliTPCclusterMI * AliTPCtrackerMI::AliTPCRow::FindNearest(Double_t y, Double_t z, Double_t roady, Double_t roadz) const {
4866 //-----------------------------------------------------------------------
4867 // Return the index of the nearest cluster in z y
4868 //-----------------------------------------------------------------------
4869 Float_t maxdistance = roady*roady + roadz*roadz;
4871 AliTPCclusterMI *cl =0;
4872 for (Int_t i=Find(z-roadz); i<fN; i++) {
4873 AliTPCclusterMI *c=(AliTPCclusterMI*)(fClusters[i]);
4874 if (c->GetZ() > z+roadz) break;
4875 if ( (c->GetY()-y) > roady ) continue;
4876 Float_t distance = (c->GetZ()-z)*(c->GetZ()-z)+(c->GetY()-y)*(c->GetY()-y);
4877 if (maxdistance>distance) {
4878 maxdistance = distance;
4885 AliTPCclusterMI * AliTPCtrackerMI::AliTPCRow::FindNearest2(Double_t y, Double_t z, Double_t roady, Double_t roadz,UInt_t & index) const
4887 //-----------------------------------------------------------------------
4888 // Return the index of the nearest cluster in z y
4889 //-----------------------------------------------------------------------
4890 Float_t maxdistance = roady*roady + roadz*roadz;
4891 Int_t iz1 = TMath::Max(fFastCluster[Int_t(z-roadz+254.5)]-1,0);
4892 Int_t iz2 = TMath::Min(fFastCluster[Int_t(z+roadz+255.5)]+1,fN);
4894 AliTPCclusterMI *cl =0;
4895 //FindNearest3(y,z,roady,roadz,index);
4896 // for (Int_t i=Find(z-roadz); i<fN; i++) {
4897 for (Int_t i=iz1; i<iz2; i++) {
4898 AliTPCclusterMI *c=(AliTPCclusterMI*)(fClusters[i]);
4899 if (c->GetZ() > z+roadz) break;
4900 if ( c->GetY()-y > roady ) continue;
4901 if ( y-c->GetY() > roady ) continue;
4902 Float_t distance = (c->GetZ()-z)*(c->GetZ()-z)+(c->GetY()-y)*(c->GetY()-y);
4903 if (maxdistance>distance) {
4904 maxdistance = distance;
4907 //roady = TMath::Sqrt(maxdistance);
4915 AliTPCclusterMI * AliTPCtrackerMI::AliTPCRow::FindNearest3(Double_t y, Double_t z, Double_t roady, Double_t roadz,UInt_t & index) const
4917 //-----------------------------------------------------------------------
4918 // Return the index of the nearest cluster in z y
4919 //-----------------------------------------------------------------------
4920 Float_t maxdistance = roady*roady + roadz*roadz;
4921 // Int_t iz = Int_t(z+255.);
4922 AliTPCclusterMI *cl =0;
4923 for (Int_t i=Find(z-roadz); i<fN; i++) {
4924 //for (Int_t i=fFastCluster[iz-2]; i<fFastCluster[iz+2]; i++) {
4925 AliTPCclusterMI *c=(AliTPCclusterMI*)(fClusters[i]);
4926 if (c->GetZ() > z+roadz) break;
4927 if ( c->GetY()-y > roady ) continue;
4928 if ( y-c->GetY() > roady ) continue;
4929 Float_t distance = (c->GetZ()-z)*(c->GetZ()-z)+(c->GetY()-y)*(c->GetY()-y);
4930 if (maxdistance>distance) {
4931 maxdistance = distance;
4934 //roady = TMath::Sqrt(maxdistance);
4943 AliTPCseed::AliTPCseed():AliTPCtrack(){
4947 for (Int_t i=0;i<200;i++) SetClusterIndex2(i,-3);
4948 for (Int_t i=0;i<160;i++) fClusterPointer[i]=0;
4965 AliTPCseed::AliTPCseed(const AliTPCseed &s):AliTPCtrack(s){
4966 //---------------------
4967 // dummy copy constructor
4968 //-------------------------
4970 AliTPCseed::AliTPCseed(const AliTPCtrack &t):AliTPCtrack(t){
4979 for (Int_t i=0;i<160;i++) {
4980 fClusterPointer[i] = 0;
4981 Int_t index = t.GetClusterIndex(i);
4983 SetClusterIndex2(i,index);
4986 SetClusterIndex2(i,-3);
4999 AliTPCseed::AliTPCseed(const AliKalmanTrack &t, Double_t a):AliTPCtrack(t,a){
5003 for (Int_t i=0;i<160;i++) {
5004 fClusterPointer[i] = 0;
5005 Int_t index = t.GetClusterIndex(i);
5006 SetClusterIndex2(i,index);
5027 AliTPCseed::AliTPCseed(UInt_t index, const Double_t xx[5], const Double_t cc[15],
5028 Double_t xr, Double_t alpha):
5029 AliTPCtrack(index, xx, cc, xr, alpha) {
5034 for (Int_t i=0;i<200;i++) SetClusterIndex2(i,-3);
5035 for (Int_t i=0;i<160;i++) fClusterPointer[i]=0;
5044 // fHelixIn = new TClonesArray("AliHelix",0);
5045 //fHelixOut = new TClonesArray("AliHelix",0);
5055 AliTPCseed::~AliTPCseed(){
5058 if (fPoints) delete fPoints;
5060 if (fEPoints) delete fEPoints;
5065 AliTPCTrackerPoint * AliTPCseed::GetTrackPoint(Int_t i)
5069 return &fTrackPoints[i];
5072 void AliTPCseed::RebuildSeed()
5075 // rebuild seed to be ready for storing
5076 AliTPCclusterMI cldummy;
5078 AliTPCTrackPoint pdummy;
5079 pdummy.GetTPoint().fIsShared = 10;
5080 for (Int_t i=0;i<160;i++){
5081 AliTPCclusterMI * cl0 = fClusterPointer[i];
5082 AliTPCTrackPoint *trpoint = (AliTPCTrackPoint*)fPoints->UncheckedAt(i);
5084 trpoint->GetTPoint() = *(GetTrackPoint(i));
5085 trpoint->GetCPoint() = *cl0;
5086 trpoint->GetCPoint().SetQ(TMath::Abs(cl0->GetQ()));
5090 trpoint->GetCPoint()= cldummy;
5098 Double_t AliTPCseed::GetDensityFirst(Int_t n)
5102 // return cluster for n rows bellow first point
5103 Int_t nfoundable = 1;
5105 for (Int_t i=fLastPoint-1;i>0&&nfoundable<n; i--){
5106 Int_t index = GetClusterIndex2(i);
5107 if (index!=-1) nfoundable++;
5108 if (index>0) nfound++;
5110 if (nfoundable<n) return 0;
5111 return Double_t(nfound)/Double_t(nfoundable);
5116 void AliTPCseed::GetClusterStatistic(Int_t first, Int_t last, Int_t &found, Int_t &foundable, Int_t &shared, Bool_t plus2)
5118 // get cluster stat. on given region
5123 for (Int_t i=first;i<last; i++){
5124 Int_t index = GetClusterIndex2(i);
5125 if (index!=-1) foundable++;
5126 if (fClusterPointer[i]) {
5132 if (fClusterPointer[i]->IsUsed(10)) {
5136 if (!plus2) continue; //take also neighborhoud
5138 if ( (i>0) && fClusterPointer[i-1]){
5139 if (fClusterPointer[i-1]->IsUsed(10)) {
5144 if ( fClusterPointer[i+1]){
5145 if (fClusterPointer[i+1]->IsUsed(10)) {
5152 //if (shared>found){
5153 //Error("AliTPCseed::GetClusterStatistic","problem\n");
5157 //_____________________________________________________________________________
5158 void AliTPCseed::CookdEdx(Double_t low, Double_t up,Int_t i1, Int_t i2, Bool_t onlyused) {
5159 //-----------------------------------------------------------------
5160 // This funtion calculates dE/dX within the "low" and "up" cuts.
5161 //-----------------------------------------------------------------
5164 Float_t angular[200];
5165 Float_t weight[200];
5168 // TClonesArray & arr = *fPoints;
5169 Float_t meanlog = 100.;
5171 Float_t mean[4] = {0,0,0,0};
5172 Float_t sigma[4] = {1000,1000,1000,1000};
5173 Int_t nc[4] = {0,0,0,0};
5174 Float_t norm[4] = {1000,1000,1000,1000};
5179 for (Int_t of =0; of<4; of++){
5180 for (Int_t i=of+i1;i<i2;i+=4)
5182 Int_t index = fIndex[i];
5183 if (index<0||index&0x8000) continue;
5185 //AliTPCTrackPoint * point = (AliTPCTrackPoint *) arr.At(i);
5186 AliTPCTrackerPoint * point = GetTrackPoint(i);
5187 //AliTPCTrackerPoint * pointm = GetTrackPoint(i-1);
5188 //AliTPCTrackerPoint * pointp = 0;
5189 //if (i<159) pointp = GetTrackPoint(i+1);
5191 if (point==0) continue;
5192 AliTPCclusterMI * cl = fClusterPointer[i];
5193 if (cl==0) continue;
5194 if (onlyused && (!cl->IsUsed(10))) continue;
5195 if (cl->IsUsed(11)) {
5199 Int_t type = cl->GetType();
5200 //if (point->fIsShared){
5205 // if (pointm->fIsShared) continue;
5207 // if (pointp->fIsShared) continue;
5209 if (type<0) continue;
5210 //if (type>10) continue;
5211 //if (point->GetErrY()==0) continue;
5212 //if (point->GetErrZ()==0) continue;
5214 //Float_t ddy = (point->GetY()-cl->GetY())/point->GetErrY();
5215 //Float_t ddz = (point->GetZ()-cl->GetZ())/point->GetErrZ();
5216 //if ((ddy*ddy+ddz*ddz)>10) continue;
5219 // if (point->GetCPoint().GetMax()<5) continue;
5220 if (cl->GetMax()<5) continue;
5221 Float_t angley = point->GetAngleY();
5222 Float_t anglez = point->GetAngleZ();
5224 Float_t rsigmay2 = point->GetSigmaY();
5225 Float_t rsigmaz2 = point->GetSigmaZ();
5229 rsigmay += pointm->GetTPoint().GetSigmaY();
5230 rsigmaz += pointm->GetTPoint().GetSigmaZ();
5234 rsigmay += pointp->GetTPoint().GetSigmaY();
5235 rsigmaz += pointp->GetTPoint().GetSigmaZ();
5242 Float_t rsigma = TMath::Sqrt(rsigmay2*rsigmaz2);
5244 Float_t ampc = 0; // normalization to the number of electrons
5246 // ampc = 1.*point->GetCPoint().GetMax();
5247 ampc = 1.*cl->GetMax();
5248 //ampc = 1.*point->GetCPoint().GetQ();
5249 // AliTPCClusterPoint & p = point->GetCPoint();
5250 // Float_t dy = TMath::Abs(Int_t( TMath::Abs(p.GetY()/0.6)) - TMath::Abs(p.GetY()/0.6)+0.5);
5251 // Float_t iz = (250.0-TMath::Abs(p.GetZ())+0.11)/0.566;
5253 // TMath::Abs( Int_t(iz) - iz + 0.5);
5254 //ampc *= 1.15*(1-0.3*dy);
5255 //ampc *= 1.15*(1-0.3*dz);
5256 // Float_t zfactor = (1.05-0.0004*TMath::Abs(point->GetCPoint().GetZ()));
5260 //ampc = 1.0*point->GetCPoint().GetMax();
5261 ampc = 1.0*cl->GetMax();
5262 //ampc = 1.0*point->GetCPoint().GetQ();
5263 //AliTPCClusterPoint & p = point->GetCPoint();
5264 // Float_t dy = TMath::Abs(Int_t( TMath::Abs(p.GetY()/0.4)) - TMath::Abs(p.GetY()/0.4)+0.5);
5265 //Float_t iz = (250.0-TMath::Abs(p.GetZ())+0.11)/0.566;
5267 // TMath::Abs( Int_t(iz) - iz + 0.5);
5269 //ampc *= 1.15*(1-0.3*dy);
5270 //ampc *= 1.15*(1-0.3*dz);
5271 // Float_t zfactor = (1.02-0.000*TMath::Abs(point->GetCPoint().GetZ()));
5275 ampc *= 2.0; // put mean value to channel 50
5276 //ampc *= 0.58; // put mean value to channel 50
5278 // if (type>0) w = 1./(type/2.-0.5);
5279 // Float_t z = TMath::Abs(cl->GetZ());
5282 //ampc /= (1+0.0008*z);
5286 //ampc /= (1+0.0008*z);
5288 //ampc /= (1+0.0008*z);
5291 if (type<0) { //amp at the border - lower weight
5296 if (rsigma>1.5) ampc/=1.3; // if big backround
5298 angular[nc[of]] = TMath::Sqrt(1.+angley*angley+anglez*anglez);
5303 TMath::Sort(nc[of],amp,index,kFALSE);
5307 //meanlog = amp[index[Int_t(nc[of]*0.33)]];
5309 for (Int_t i=int(nc[of]*low+0.5);i<int(nc[of]*up+0.5);i++){
5310 Float_t ampl = amp[index[i]]/angular[index[i]];
5311 ampl = meanlog*TMath::Log(1.+ampl/meanlog);
5313 sumw += weight[index[i]];
5314 sumamp += weight[index[i]]*ampl;
5315 sumamp2 += weight[index[i]]*ampl*ampl;
5316 norm[of] += angular[index[i]]*weight[index[i]];
5323 mean[of] = sumamp/sumw;
5324 sigma[of] = sumamp2/sumw-mean[of]*mean[of];
5326 sigma[of] = TMath::Sqrt(sigma[of]);
5330 mean[of] = (TMath::Exp(mean[of]/meanlog)-1)*meanlog;
5331 //mean *=(1-0.02*(sigma/(mean*0.17)-1.));
5332 //mean *=(1-0.1*(norm-1.));
5339 // mean[0]*= (1-0.05*(sigma[0]/(0.01+mean[1]*0.18)-1));
5340 // mean[1]*= (1-0.05*(sigma[1]/(0.01+mean[0]*0.18)-1));
5343 // dedx = (mean[0]* TMath::Sqrt((1.+nc[0]))+ mean[1]* TMath::Sqrt((1.+nc[1])) )/
5344 // ( TMath::Sqrt((1.+nc[0]))+TMath::Sqrt((1.+nc[1])));
5348 for (Int_t i =0;i<4;i++){
5349 if (nc[i]>2&&nc[i]<1000){
5350 dedx += mean[i] *nc[i];
5351 fSdEdx += sigma[i]*(nc[i]-2);
5352 fMAngular += norm[i] *nc[i];
5357 fSDEDX[i] = sigma[i];
5370 // Float_t dedx1 =dedx;
5373 for (Int_t i =0;i<4;i++){
5374 if (nc[i]>2&&nc[i]<1000){
5375 mean[i] = mean[i]*(1-0.12*(sigma[i]/(fSdEdx)-1.));
5376 dedx += mean[i] *nc[i];
5391 Double_t p=TMath::Sqrt((1.+ GetTgl()*GetTgl())/(Get1Pt()*Get1Pt()));
5394 if (dedx < 39.+ 12./(p+0.25)/(p+0.25)) { SetMass(0.13957); return;}
5395 if (dedx < 39.+ 12./p/p) { SetMass(0.49368); return;}
5396 SetMass(0.93827); return;
5400 if (dedx < 39.+ 12./(p+0.25)/(p+0.25)) { SetMass(0.13957); return;}
5401 SetMass(0.93827); return;
5404 SetMass(0.13957); return;
5414 void AliTPCseed::CookdEdx2(Double_t low, Double_t up) {
5415 //-----------------------------------------------------------------
5416 // This funtion calculates dE/dX within the "low" and "up" cuts.
5417 //-----------------------------------------------------------------
5420 Float_t angular[200];
5421 Float_t weight[200];
5423 Bool_t inlimit[200];
5424 for (Int_t i=0;i<200;i++) inlimit[i]=kFALSE;
5425 for (Int_t i=0;i<200;i++) amp[i]=10000;
5426 for (Int_t i=0;i<200;i++) angular[i]= 1;;
5430 Float_t meanlog = 100.;
5431 Int_t indexde[4]={0,64,128,160};
5438 Float_t mean[4] = {0,0,0,0};
5439 Float_t sigma[4] = {1000,1000,1000,1000};
5440 Int_t nc[4] = {0,0,0,0};
5441 Float_t norm[4] = {1000,1000,1000,1000};
5446 // for (Int_t of =0; of<3; of++){
5447 // for (Int_t i=indexde[of];i<indexde[of+1];i++)
5448 for (Int_t i =0; i<160;i++)
5450 AliTPCTrackPoint * point = GetTrackPoint(i);
5451 if (point==0) continue;
5452 if (point->fIsShared){
5456 Int_t type = point->GetCPoint().GetType();
5457 if (type<0) continue;
5458 if (point->GetCPoint().GetMax()<5) continue;
5459 Float_t angley = point->GetTPoint().GetAngleY();
5460 Float_t anglez = point->GetTPoint().GetAngleZ();
5461 Float_t rsigmay = point->GetCPoint().GetSigmaY();
5462 Float_t rsigmaz = point->GetCPoint().GetSigmaZ();
5463 Float_t rsigma = TMath::Sqrt(rsigmay*rsigmaz);
5465 Float_t ampc = 0; // normalization to the number of electrons
5467 ampc = point->GetCPoint().GetMax();
5470 ampc = point->GetCPoint().GetMax();
5472 ampc *= 2.0; // put mean value to channel 50
5473 // ampc *= 0.565; // put mean value to channel 50
5476 Float_t z = TMath::Abs(point->GetCPoint().GetZ());
5483 if (type<0) { //amp at the border - lower weight
5486 if (rsigma>1.5) ampc/=1.3; // if big backround
5487 angular[i] = TMath::Sqrt(1.+angley*angley+anglez*anglez);
5488 amp[i] = ampc/angular[i];
5493 TMath::Sort(159,amp,index,kFALSE);
5494 for (Int_t i=int(anc*low+0.5);i<int(anc*up+0.5);i++){
5495 inlimit[index[i]] = kTRUE; // take all clusters
5498 // meanlog = amp[index[Int_t(anc*0.3)]];
5500 for (Int_t of =0; of<3; of++){
5504 for (Int_t i=indexde[of];i<indexde[of+1];i++)
5506 if (inlimit[i]==kFALSE) continue;
5507 Float_t ampl = amp[i];
5509 ampl = meanlog*TMath::Log(1.+ampl/meanlog);
5512 sumamp += weight[i]*ampl;
5513 sumamp2 += weight[i]*ampl*ampl;
5514 norm[of] += angular[i]*weight[i];
5522 mean[of] = sumamp/sumw;
5523 sigma[of] = sumamp2/sumw-mean[of]*mean[of];
5525 sigma[of] = TMath::Sqrt(sigma[of]);
5528 mean[of] = (TMath::Exp(mean[of]/meanlog)-1)*meanlog;
5538 Float_t www[3] = {12.,14.,17.};
5539 //Float_t www[3] = {1.,1.,1.};
5541 for (Int_t i =0;i<3;i++){
5542 if (nc[i]>2&&nc[i]<1000){
5543 dedx += mean[i] *nc[i]*www[i]/sigma[i];
5544 fSdEdx += sigma[i]*(nc[i]-2)*www[i]/sigma[i];
5545 fMAngular += norm[i] *nc[i];
5546 norm2 += nc[i]*www[i]/sigma[i];
5547 norm3 += (nc[i]-2)*www[i]/sigma[i];
5550 fSDEDX[i] = sigma[i];
5563 // Float_t dedx1 =dedx;
5567 for (Int_t i =0;i<3;i++){
5568 if (nc[i]>2&&nc[i]<1000&&sigma[i]>3){
5569 //mean[i] = mean[i]*(1+0.08*(sigma[i]/(fSdEdx)-1.));
5570 dedx += mean[i] *(nc[i])/(sigma[i]);
5571 norm4 += (nc[i])/(sigma[i]);
5575 if (norm4>0) dedx /= norm4;