]>
Commit | Line | Data |
---|---|---|
3e87ef69 | 1 | // @(#) $Id$ |
2 | ||
b661165c | 3 | // Author: Uli Frankenfeld <mailto:franken@fi.uib.no> |
3e87ef69 | 4 | //*-- Copyright © ALICE HLT Group |
108615fc | 5 | |
118c26c3 | 6 | #include "AliL3StandardIncludes.h" |
7 | ||
108615fc | 8 | #include "AliL3Logging.h" |
9 | #include "AliL3InterMerger.h" | |
10 | #include "AliL3Track.h" | |
11 | #include "AliL3TrackSegmentData.h" | |
12 | #include "AliL3Transform.h" | |
13 | #include "AliL3TrackArray.h" | |
14 | ||
3e87ef69 | 15 | /** \class AliL3InterMerger |
16 | <pre> | |
108615fc | 17 | //_____________________________________________________________ |
b661165c | 18 | // AliL3InterMerger |
108615fc | 19 | // |
20 | // The L3 track segment merger | |
21 | // | |
3e87ef69 | 22 | </pre> |
23 | */ | |
108615fc | 24 | |
25 | ClassImp(AliL3InterMerger) | |
26 | ||
0a86fbb7 | 27 | AliL3InterMerger::AliL3InterMerger() |
28 | { | |
108615fc | 29 | //Default constructor |
0a86fbb7 | 30 | InitMerger(1); |
108615fc | 31 | Is2Global(kFALSE); |
3ea3b9f9 | 32 | // SetParameter(2,2,.3,.3,.3); |
33 | SetParameter(1,0.5,0.0005,0.05,0.1); | |
108615fc | 34 | fRowMax = fRowMin = 0; |
35 | } | |
36 | ||
37 | ||
38 | AliL3InterMerger::~AliL3InterMerger(){ | |
39 | //Destructor | |
40 | ||
41 | } | |
42 | ||
43 | void AliL3InterMerger::SlowMerge(){ | |
44 | Int_t nrow= fRowMax-fRowMin+1; | |
45 | void *ntuple=GetNtuple(); | |
46 | AliL3TrackArray * tracks = GetInTracks(0); | |
47 | const Int_t kNIn =tracks->GetNTracks(); | |
48 | AliL3Track *tr[2]; | |
49 | Bool_t merge = kTRUE; | |
50 | for(Int_t in=0;in<kNIn;in++) | |
51 | tracks->GetCheckedTrack(in)->CalculateHelix(); | |
52 | while(merge){ | |
53 | Int_t inmin=-1,outmin=-1; | |
54 | Double_t min=10; | |
55 | for(Int_t out=0;out<kNIn;out++){ | |
56 | AliL3Track *outertrack=tracks->GetCheckedTrack(out); | |
57 | if(!outertrack) continue; | |
58 | for(Int_t in=0;in<kNIn;in++){ | |
59 | if(in==out) continue; | |
60 | AliL3Track *innertrack=tracks->GetCheckedTrack(in); | |
61 | if(!innertrack) continue; | |
62 | if(outertrack->GetNHits()+innertrack->GetNHits()>nrow) continue; | |
63 | ||
64 | Double_t diff = TrackDiff(innertrack,outertrack); | |
65 | ||
66 | if(diff>=0&&diff<min){ | |
67 | min=diff; | |
68 | inmin=in; | |
69 | outmin=out; | |
70 | } | |
71 | } | |
72 | } | |
73 | if(inmin>=0&&outmin>=0){ | |
74 | AliL3Track *outertrack=tracks->GetTrack(outmin); | |
75 | AliL3Track *innertrack=tracks->GetTrack(inmin); | |
76 | tr[0]=innertrack; | |
77 | tr[1]=outertrack; | |
78 | SortTracks(tr,2); | |
79 | MultiMerge(tracks,tr,2); | |
80 | outertrack->CalculatePoint(tr[0]->GetLastPointX()); | |
81 | innertrack->CalculatePoint(tr[0]->GetLastPointX()); | |
82 | PrintDiff(innertrack,outertrack); | |
83 | FillNtuple(ntuple,innertrack,outertrack); | |
84 | tracks->Remove(outmin); | |
85 | tracks->Remove(inmin); | |
86 | } | |
87 | else merge = kFALSE; | |
88 | } | |
89 | LOG(AliL3Log::kInformational,"AliL3InterMerger::SlowMerge","Result") | |
90 | <<AliL3Log::kDec<<"Merged Tracks: "<<tracks->GetNTracks()-kNIn<<ENDLOG; | |
91 | ||
92 | char name[256]; | |
93 | sprintf(name,"ntuple_i_%d.root",fPatch); | |
94 | WriteNtuple(name,ntuple); | |
95 | } | |
96 | ||
97 | void AliL3InterMerger::MMerge(){ | |
98 | while(Merge()); | |
99 | GetOutTracks()->AddTracks(GetInTracks(0)); | |
100 | } | |
101 | ||
102 | Int_t AliL3InterMerger::Merge(){ | |
103 | Int_t nrow= fRowMax-fRowMin+1; | |
494fad94 | 104 | Double_t xval =AliL3Transform::Row2X((fRowMax+fRowMin)/2); |
108615fc | 105 | AliL3TrackArray * tracks = GetInTracks(0); |
106 | const Int_t kNIn =tracks->GetNTracks(); | |
107 | AliL3Track *tr[2]; | |
108 | for(Int_t in=0;in<kNIn;in++){ | |
109 | AliL3Track *t = tracks->GetCheckedTrack(in); | |
110 | if(t){ | |
111 | t->CalculateHelix(); | |
112 | t->CalculatePoint(xval); | |
113 | } | |
114 | } | |
115 | for(Int_t out=0;out<kNIn;out++){ | |
116 | AliL3Track *outertrack=tracks->GetCheckedTrack(out); | |
117 | if(!outertrack) continue; | |
118 | for(Int_t in=0;in<kNIn;in++){ | |
119 | if(in==out) continue; | |
120 | AliL3Track *innertrack=tracks->GetCheckedTrack(in); | |
121 | if(!innertrack) continue; | |
122 | if(outertrack->GetNHits()+innertrack->GetNHits()>nrow) continue; | |
123 | ||
124 | if(IsTrack(innertrack,outertrack)){ | |
125 | tr[0]=innertrack; | |
126 | tr[1]=outertrack; | |
3ea3b9f9 | 127 | SortGlobalTracks(tr,2); |
128 | ||
129 | Double_t r0 = pow(tr[0]->GetLastPointX(),2)+ | |
130 | pow(tr[0]->GetLastPointY(),2); | |
131 | Double_t r1 = pow(tr[1]->GetFirstPointX(),2)+ | |
132 | pow(tr[1]->GetFirstPointY(),2); | |
133 | if(r0<r1){ | |
108615fc | 134 | MultiMerge(tracks,tr,2); |
135 | tracks->Remove(out); | |
136 | tracks->Remove(in); | |
137 | break; | |
138 | } | |
139 | } | |
140 | } | |
141 | } | |
142 | Int_t nmerged = tracks->GetNTracks()-kNIn; | |
143 | LOG(AliL3Log::kInformational,"AliL3InterMerger::Merge","Result") | |
144 | <<AliL3Log::kDec<<"Merged Tracks: "<<nmerged<<ENDLOG; | |
145 | //add in tracks | |
146 | // GetOutTracks()->AddTracks(GetInTracks(0)); | |
147 | ||
148 | return nmerged; | |
149 | } | |
150 | ||
151 |