haskal
/
kicad
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

kimath: Fix some warnings

This commit is contained in:
Ian McInerney 2023-03-10 16:14:27 +00:00
parent 3ce4016221
commit 5671a123b9
3 changed files with 5 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
libs/kimath/src/geometry/direction_45.cpp
View File

@ -251,7 +251,6 @@ const SHAPE_LINE_CHAIN DIRECTION_45::BuildInitialTrace( const VECTOR2I& aP0, con
*
* For the length of the radius we use the shorter of the horizontal and vertical distance.
*/
SHAPE_ARC arc;
if( w == h ) // we only need one arc without a straigth line.
{

4
libs/kimath/src/geometry/shape_collisions.cpp
View File

@ -186,7 +186,7 @@ static inline bool Collide( const SHAPE_CIRCLE& aA, const SHAPE_LINE_CHAIN_BASE&
if( aMTV )
{
for( int s = 0; s < aB.GetSegmentCount(); s++ )
for( size_t s = 0; s < aB.GetSegmentCount(); s++ )
{
int dist = aB.GetSegment(s).Distance( aA.GetCenter() );
@ -251,7 +251,7 @@ static inline bool Collide( const SHAPE_CIRCLE& aA, const SHAPE_LINE_CHAIN_BASE&
cmoved.SetCenter( cmoved.GetCenter() + f );
f_total += f;
for( int s = 0; s < aB.GetSegmentCount(); s++ )
for( size_t s = 0; s < aB.GetSegmentCount(); s++ )
{
VECTOR2I f = pushoutForce( cmoved, aB.GetSegment( s ), aClearance );
cmoved.SetCenter( cmoved.GetCenter() + f );

6
libs/kimath/src/geometry/shape_line_chain.cpp
View File

@ -695,7 +695,7 @@ long long int SHAPE_LINE_CHAIN::Length() const
l += CSegment( i ).Length();
}
for( int i = 0; i < ArcCount(); i++ )
for( size_t i = 0; i < ArcCount(); i++ )
l += CArcs()[i].GetLength();
return l;
@ -746,7 +746,7 @@ void SHAPE_LINE_CHAIN::Replace( int aStartIndex, int aEndIndex, const SHAPE_LINE
// We only process lines in order in this house
wxASSERT( aStartIndex <= aEndIndex );
wxASSERT( aEndIndex < m_points.size() );
wxASSERT( aEndIndex < static_cast<int>( m_points.size() ) );
SHAPE_LINE_CHAIN newLine = aLine;
@ -989,7 +989,7 @@ int SHAPE_LINE_CHAIN::ShapeCount() const
int numShapes = 0;
int arcIdx = -1;
for( int i = 0; i < m_points.size() - 1; i++ )
for( int i = 0; i < static_cast<int>( m_points.size() ) - 1; i++ )
{
if( m_shapes[i] == SHAPES_ARE_PT )
{