33 float zStation[8] = {30.,40.,50.,60.,70.,80.,90.,100.};
34 vector<int> iStations;
43 for(
int iSt=0; iSt<8; iSt++)
44 if( TMath::Abs(zStation[iSt] -
GetStsPoint(iSts)->GetZ()) < 2.5) stNumber = iSt;
49 std::sort(iStations.begin(),iStations.end());
51 int nMaxConsStations = 1;
52 int nConsStations = 1;
53 int iPrevSt = iStations[0];
54 for(
unsigned int iP=1; iP<iStations.size(); iP++)
56 if((iStations[iP] - iPrevSt) == 1)
59 iPrevSt = iStations[iP];
61 else if( (iStations[iP] - iPrevSt)>1 )
63 if(nConsStations > nMaxConsStations)
64 nMaxConsStations = nConsStations;
66 iPrevSt = iStations[iP];
69 if(nConsStations > nMaxConsStations) nMaxConsStations = nConsStations;
71 return nMaxConsStations;
78 vector<int> iStations;
87 std::sort(iStations.begin(),iStations.end());
89 int nMaxConsStations = 1;
90 int nConsStations = 1;
91 int iPrevSt = iStations[0];
92 for(
unsigned int iP=1; iP<iStations.size(); iP++)
94 if((iStations[iP] - iPrevSt) == 1)
97 iPrevSt = iStations[iP];
99 else if( (iStations[iP] - iPrevSt)>1 )
101 if(nConsStations > nMaxConsStations)
102 nMaxConsStations = nConsStations;
104 iPrevSt = iStations[iP];
107 if(nConsStations > nMaxConsStations) nMaxConsStations = nConsStations;
109 return nMaxConsStations;
145 float zStation[8] = {30.,40.,50.,60.,70.,80.,90.,100.};
146 vector<int> iStations;
155 for(
int iSt=0; iSt<8; iSt++)
156 if( TMath::Abs(zStation[iSt] -
GetStsPoint(iSts)->GetZ()) < 2.5) stNumber = iSt;
161 std::sort(iStations.begin(),iStations.end());
163 int nMaxMCPointsOnStation = 1;
164 int nMCPointsOnStation = 1;
165 int iPrevSt = iStations[0];
166 for(
unsigned int iP=1; iP<iStations.size(); iP++)
168 if((iStations[iP] - iPrevSt) == 0)
170 nMCPointsOnStation++;
171 iPrevSt = iStations[iP];
175 if(nMCPointsOnStation > nMaxMCPointsOnStation)
176 nMaxMCPointsOnStation = nMCPointsOnStation;
177 nMCPointsOnStation = 1;
178 iPrevSt = iStations[iP];
182 return nMaxMCPointsOnStation;