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