@@ -1930,7 +1930,7 @@ SteppingHelixPropagator::refToMagVolume(const SteppingHelixPropagator::StateInfo
1930
1930
int iDistMin = -1 ;
1931
1931
1932
1932
unsigned int iFDestSorted[6 ] = {0 ,0 ,0 ,0 ,0 ,0 };
1933
- unsigned int nDestSorted =0 ;
1933
+ int nDestSorted =0 ;
1934
1934
unsigned int nearParallels = 0 ;
1935
1935
1936
1936
double curP = sv.p3 .mag ();
@@ -2040,29 +2040,29 @@ SteppingHelixPropagator::refToMagVolume(const SteppingHelixPropagator::StateInfo
2040
2040
<<tanDistToFace[iFace]<<" " <<distToFace[iFace]<<" " <<refDirectionToFace[iFace]<<" " <<dir<<std::endl;
2041
2041
2042
2042
}
2043
-
2044
- for (unsigned int i = 0 ;i<nDestSorted; ++i){
2045
- unsigned int iMax = nDestSorted-i-1 ;
2046
- for (unsigned int j=0 ;j<nDestSorted-i; ++j){
2043
+
2044
+ for (int i = 0 ;i<nDestSorted; ++i){
2045
+ int iMax = nDestSorted-i-1 ;
2046
+ for (int j=0 ;j<nDestSorted-i; ++j){
2047
2047
if (fabs (tanDistToFace[iFDestSorted[j]]) > fabs (tanDistToFace[iFDestSorted[iMax]]) ){
2048
2048
iMax = j;
2049
2049
}
2050
2050
}
2051
- unsigned int iTmp = iFDestSorted[nDestSorted-i-1 ];
2051
+ int iTmp = iFDestSorted[nDestSorted-i-1 ];
2052
2052
iFDestSorted[nDestSorted-i-1 ] = iFDestSorted[iMax];
2053
2053
iFDestSorted[iMax] = iTmp;
2054
2054
}
2055
2055
2056
2056
if (debug_){
2057
- for (unsigned int i=0 ;i<nDestSorted;++i){
2057
+ for (int i=0 ;i<nDestSorted;++i){
2058
2058
LogTrace (metname)<<std::setprecision (17 )<<std::setw (20 )<<std::scientific<<cVol<<" " <<i<<" " <<iFDestSorted[i]<<" " <<tanDistToFace[iFDestSorted[i]]<<std::endl;
2059
2059
}
2060
2060
}
2061
2061
2062
2062
// now go from the shortest to the largest distance hoping to get a point in the volume.
2063
2063
// other than in case of a near-parallel travel this should stop after the first try
2064
2064
2065
- for (unsigned int i=0 ; i<nDestSorted;++i){
2065
+ for (int i=0 ; i<nDestSorted;++i){
2066
2066
iFDest = iFDestSorted[i];
2067
2067
2068
2068
double sign = dir == alongMomentum ? 1 . : -1 .;
0 commit comments