@@ -1395,7 +1395,7 @@ void QgsDwgImporter::addEllipse( const DRW_Ellipse &data )
13951395
13961396bool QgsDwgImporter::curveFromLWPolyline ( const DRW_LWPolyline &data, QgsCompoundCurve &cc )
13971397{
1398- int vertexnum = data.vertlist .size ();
1398+ size_t vertexnum = data.vertlist .size ();
13991399 if ( vertexnum == 0 )
14001400 {
14011401 QgsDebugMsg ( " polyline without points" );
@@ -1407,7 +1407,7 @@ bool QgsDwgImporter::curveFromLWPolyline( const DRW_LWPolyline &data, QgsCompoun
14071407 std::vector<DRW_Vertex2D *>::size_type n = data.flags & 1 ? vertexnum + 1 : vertexnum;
14081408 for ( std::vector<DRW_Vertex2D *>::size_type i = 0 ; i < n; i++ )
14091409 {
1410- int i0 = i % vertexnum;
1410+ size_t i0 = i % vertexnum;
14111411
14121412 Q_ASSERT ( data.vertlist [i0] != nullptr );
14131413 QgsDebugMsgLevel ( QString ( " %1: %2,%3 bulge:%4" ).arg ( i ).arg ( data.vertlist [i0]->x ).arg ( data.vertlist [i0]->y ).arg ( data.vertlist [i0]->bulge ), 5 );
@@ -1439,7 +1439,7 @@ bool QgsDwgImporter::curveFromLWPolyline( const DRW_LWPolyline &data, QgsCompoun
14391439
14401440 if ( hasBulge && i < n - 1 )
14411441 {
1442- int i1 = ( i + 1 ) % vertexnum;
1442+ size_t i1 = ( i + 1 ) % vertexnum;
14431443
14441444 double a = 2.0 * atan ( data.vertlist [i]->bulge );
14451445 double dx = data.vertlist [i1]->x - data.vertlist [i0]->x ;
@@ -1461,7 +1461,7 @@ bool QgsDwgImporter::curveFromLWPolyline( const DRW_LWPolyline &data, QgsCompoun
14611461
14621462void QgsDwgImporter::addLWPolyline ( const DRW_LWPolyline &data )
14631463{
1464- int vertexnum = data.vertlist .size ();
1464+ size_t vertexnum = data.vertlist .size ();
14651465 if ( vertexnum == 0 )
14661466 {
14671467 QgsDebugMsg ( " LWPolyline without vertices" );
@@ -1476,8 +1476,8 @@ void QgsDwgImporter::addLWPolyline( const DRW_LWPolyline &data )
14761476 std::vector<DRW_Vertex2D *>::size_type n = data.flags & 1 ? vertexnum : vertexnum - 1 ;
14771477 for ( std::vector<DRW_Vertex2D *>::size_type i = 0 ; i < n; i++ )
14781478 {
1479- int i0 = i % vertexnum;
1480- int i1 = ( i + 1 ) % vertexnum;
1479+ size_t i0 = i % vertexnum;
1480+ size_t i1 = ( i + 1 ) % vertexnum;
14811481
14821482 QgsPoint p0 ( QgsWkbTypes::PointZ, data.vertlist [i0]->x , data.vertlist [i0]->y , data.elevation );
14831483 QgsPoint p1 ( QgsWkbTypes::PointZ, data.vertlist [i1]->x , data.vertlist [i1]->y , data.elevation );
@@ -1660,7 +1660,7 @@ void QgsDwgImporter::addLWPolyline( const DRW_LWPolyline &data )
16601660
16611661void QgsDwgImporter::addPolyline ( const DRW_Polyline &data )
16621662{
1663- int vertexnum = data.vertlist .size ();
1663+ size_t vertexnum = data.vertlist .size ();
16641664 if ( vertexnum == 0 )
16651665 {
16661666 QgsDebugMsg ( " Polyline without vertices" );
@@ -1675,8 +1675,8 @@ void QgsDwgImporter::addPolyline( const DRW_Polyline &data )
16751675 std::vector<DRW_Vertex *>::size_type n = data.flags & 1 ? vertexnum : vertexnum - 1 ;
16761676 for ( std::vector<DRW_Vertex *>::size_type i = 0 ; i < n; i++ )
16771677 {
1678- int i0 = i % vertexnum;
1679- int i1 = ( i + 1 ) % vertexnum;
1678+ size_t i0 = i % vertexnum;
1679+ size_t i1 = ( i + 1 ) % vertexnum;
16801680
16811681 QgsPoint p0 ( QgsWkbTypes::PointZ, data.vertlist [i0]->basePoint .x , data.vertlist [i0]->basePoint .y , data.vertlist [i0]->basePoint .z );
16821682 QgsPoint p1 ( QgsWkbTypes::PointZ, data.vertlist [i1]->basePoint .x , data.vertlist [i1]->basePoint .y , data.vertlist [i1]->basePoint .z );
@@ -1906,24 +1906,24 @@ static std::vector<double> knotu( const DRW_Spline &data, size_t num, size_t ord
19061906 }
19071907}
19081908
1909- static std::vector<double > rbasis ( int c, double t, int npts,
1909+ static std::vector<double > rbasis ( size_t c, double t, size_t npts,
19101910 const std::vector<double > &x,
19111911 const std::vector<double > &h )
19121912{
1913- int nplusc = npts + c;
1913+ size_t nplusc = npts + c;
19141914 std::vector<double > temp ( nplusc, 0 . );
19151915
19161916 // calculate the first order nonrational basis functions n[i]
1917- for ( int i = 0 ; i < nplusc - 1 ; ++i )
1917+ for ( size_t i = 0 ; i < nplusc - 1 ; ++i )
19181918 {
19191919 if ( t >= x[i] && t < x[i + 1 ] )
19201920 temp[i] = 1 ;
19211921 }
19221922
19231923 // calculate the higher order nonrational base functions
1924- for ( int k = 2 ; k <= c; ++k )
1924+ for ( size_t k = 2 ; k <= c; ++k )
19251925 {
1926- for ( int i = 0 ; i < nplusc - k; ++i )
1926+ for ( size_t i = 0 ; i < nplusc - k; ++i )
19271927 {
19281928 // if the lower order basis function is zero skip the calculation
19291929 if ( temp[i] != 0 )
@@ -1941,7 +1941,7 @@ static std::vector<double> rbasis( int c, double t, int npts,
19411941
19421942 // calculate sum for denominator of rational basis functions
19431943 double sum = 0 .;
1944- for ( int i = 0 ; i < npts; ++i )
1944+ for ( size_t i = 0 ; i < npts; ++i )
19451945 {
19461946 sum += temp[i] * h[i];
19471947 }
@@ -1951,7 +1951,7 @@ static std::vector<double> rbasis( int c, double t, int npts,
19511951 // form rational basis functions and put in r vector
19521952 if ( sum != 0.0 )
19531953 {
1954- for ( int i = 0 ; i < npts; i++ )
1954+ for ( size_t i = 0 ; i < npts; i++ )
19551955 {
19561956 r[i] = ( temp[i] * h[i] ) / sum;
19571957 }
@@ -1969,7 +1969,7 @@ static void rbspline( const DRW_Spline &data,
19691969 const std::vector<double > &h,
19701970 std::vector<QgsPointXY> &p )
19711971{
1972- int nplusc = npts + k;
1972+ size_t nplusc = npts + k;
19731973
19741974 // generate the open knot vector
19751975 std::vector<double > x ( knot ( data, npts, k ) );
0 commit comments