2 //Author: Uli Frankenfeld
3 //Last Modified: 06.12.2000
7 #include "AliL3Logging.h"
8 #include "AliL3InterMerger.h"
9 #include "AliL3Track.h"
10 #include "AliL3TrackSegmentData.h"
11 #include "AliL3Transform.h"
12 #include "AliL3TrackArray.h"
14 //_____________________________________________________________
16 // The L3 track segment merger
19 ClassImp(AliL3InterMerger)
21 AliL3InterMerger::AliL3InterMerger():AliL3Merger(1){
24 SetParameter(2,2,.3,.3,.3);
25 fRowMax = fRowMin = 0;
29 AliL3InterMerger::~AliL3InterMerger(){
34 void AliL3InterMerger::SlowMerge(){
35 Int_t nrow= fRowMax-fRowMin+1;
36 void *ntuple=GetNtuple();
37 AliL3TrackArray * tracks = GetInTracks(0);
38 const Int_t kNIn =tracks->GetNTracks();
41 for(Int_t in=0;in<kNIn;in++)
42 tracks->GetCheckedTrack(in)->CalculateHelix();
44 Int_t inmin=-1,outmin=-1;
46 for(Int_t out=0;out<kNIn;out++){
47 AliL3Track *outertrack=tracks->GetCheckedTrack(out);
48 if(!outertrack) continue;
49 for(Int_t in=0;in<kNIn;in++){
51 AliL3Track *innertrack=tracks->GetCheckedTrack(in);
52 if(!innertrack) continue;
53 if(outertrack->GetNHits()+innertrack->GetNHits()>nrow) continue;
55 Double_t diff = TrackDiff(innertrack,outertrack);
57 if(diff>=0&&diff<min){
64 if(inmin>=0&&outmin>=0){
65 AliL3Track *outertrack=tracks->GetTrack(outmin);
66 AliL3Track *innertrack=tracks->GetTrack(inmin);
70 MultiMerge(tracks,tr,2);
71 outertrack->CalculatePoint(tr[0]->GetLastPointX());
72 innertrack->CalculatePoint(tr[0]->GetLastPointX());
73 PrintDiff(innertrack,outertrack);
74 FillNtuple(ntuple,innertrack,outertrack);
75 tracks->Remove(outmin);
76 tracks->Remove(inmin);
80 LOG(AliL3Log::kInformational,"AliL3InterMerger::SlowMerge","Result")
81 <<AliL3Log::kDec<<"Merged Tracks: "<<tracks->GetNTracks()-kNIn<<ENDLOG;
84 sprintf(name,"ntuple_i_%d.root",fPatch);
85 WriteNtuple(name,ntuple);
88 void AliL3InterMerger::MMerge(){
90 GetOutTracks()->AddTracks(GetInTracks(0));
93 Int_t AliL3InterMerger::Merge(){
94 Int_t nrow= fRowMax-fRowMin+1;
95 Double_t xval =fTransformer->Row2X((fRowMax+fRowMin)/2);
96 AliL3TrackArray * tracks = GetInTracks(0);
97 const Int_t kNIn =tracks->GetNTracks();
99 for(Int_t in=0;in<kNIn;in++){
100 AliL3Track *t = tracks->GetCheckedTrack(in);
103 t->CalculatePoint(xval);
106 for(Int_t out=0;out<kNIn;out++){
107 AliL3Track *outertrack=tracks->GetCheckedTrack(out);
108 if(!outertrack) continue;
109 for(Int_t in=0;in<kNIn;in++){
110 if(in==out) continue;
111 AliL3Track *innertrack=tracks->GetCheckedTrack(in);
112 if(!innertrack) continue;
113 if(outertrack->GetNHits()+innertrack->GetNHits()>nrow) continue;
115 if(IsTrack(innertrack,outertrack)){
119 if(tr[0]->GetLastPointX()<tr[1]->GetFirstPointX()){
120 MultiMerge(tracks,tr,2);
128 Int_t nmerged = tracks->GetNTracks()-kNIn;
129 LOG(AliL3Log::kInformational,"AliL3InterMerger::Merge","Result")
130 <<AliL3Log::kDec<<"Merged Tracks: "<<nmerged<<ENDLOG;
132 // GetOutTracks()->AddTracks(GetInTracks(0));