Go to the source code of this file.
◆ BOUND
◆ NBINS
◆ THRES
◆ give_nearest_bin()
| int give_nearest_bin |
( |
const | float(*)[NBINS][BOUND], |
|
|
int | thr, |
|
|
int | bin, |
|
|
int | bound, |
|
|
int | step ) |
Definition at line 65 of file windows.cxx.
67{
70
71 if (window[thr][previous-1][bound])
return previous;
72 if (window[thr][next-1][bound])
return next;
73
74 if (next == 1 || next ==
NBINS)
return next;
75
77}
int give_nearest_bin(const float(*window)[NBINS][BOUND], int thr, int bin, int bound, int step)
◆ windows()
| int windows |
( |
float | distance, |
|
|
float | eta_pivot, |
|
|
int | thr, |
|
|
int | sector ) |
Definition at line 14 of file windows.cxx.
15{
16
18
19 for (int j=1;j<=50;j++)
20 {
21 if ((eta_pivot>=-1.1+(j-1)*0.044)&&(eta_pivot<-1.1+j*0.044))
bin = j;
22 }
23
24 int sector_type=((sector + 1)/2)%2;
25
27
28
29 if (sector_type == 0)
30 {
32 }
33 else if (sector_type == 1 &&
34 !( sector==21 || sector==22 || sector==25 || sector==26 ))
35 {
37 }
38 else
39 {
41 }
42
43 if(distance <= 0)
44 {
45 if (!window[thr][
bin-1][0])
46 {
48 }
49
50 if(distance>=window[thr][
bin-1][0])
s = 1;
51 }
52 else
53 {
54 if (!window[thr][
bin-1][1])
55 {
57 }
58
59 if(distance<=window[thr][
bin-1][1])
s = 1;
60 }
61
63}
static const float Large_win[THRES][NBINS][BOUND]
static const float Small_win[THRES][NBINS][BOUND]