14int windows(
float distance,
float eta_pivot,
int thr,
int sector)
19 for (
int j=1;j<=50;j++)
21 if ((eta_pivot>=-1.1+(j-1)*0.044)&&(eta_pivot<-1.1+j*0.044))
bin = j;
24 int sector_type=((sector + 1)/2)%2;
33 else if (sector_type == 1 &&
34 !( sector==21 || sector==22 || sector==25 || sector==26 ))
45 if (!window[thr][
bin-1][0])
50 if(distance>=window[thr][
bin-1][0]) s = 1;
54 if (!window[thr][
bin-1][1])
59 if(distance<=window[thr][
bin-1][1]) s = 1;
71 if (window[thr][previous-1][bound])
return previous;
72 if (window[thr][next-1][bound])
return next;
74 if (next == 1 || next ==
NBINS)
return next;
static const float Large_win[THRES][NBINS][BOUND]
static const float Small_win[THRES][NBINS][BOUND]
int give_nearest_bin(const float(*window)[NBINS][BOUND], int thr, int bin, int bound, int step)
int windows(float distance, float eta_pivot, int thr, int sector)