Loading common/geometry/seg.cpp +0 −1 Original line number Diff line number Diff line Loading @@ -35,7 +35,6 @@ bool SEG::PointCloserThan( const VECTOR2I& aP, int aDist ) const { VECTOR2I d = B - A; ecoord dist_sq = (ecoord) aDist * aDist; ecoord dist_sq_thr = (ecoord) ( aDist + 1 ) * ( aDist + 1 ); SEG::ecoord l_squared = d.Dot( d ); SEG::ecoord t = d.Dot( aP - A ); Loading pcbnew/router/pns_diff_pair.cpp +5 −4 Original line number Diff line number Diff line Loading @@ -625,6 +625,7 @@ void PNS_DP_GATEWAYS::BuildGeneric( const VECTOR2I& p0_p, const VECTOR2I& p0_n, { OPT_VECTOR2I ips[2], m; m = OPT_VECTOR2I(); ips[0] = d_n[i].IntersectLines( d_p[j] ); ips[1] = st_p[i].IntersectLines( st_n[j] ); Loading @@ -637,7 +638,7 @@ void PNS_DP_GATEWAYS::BuildGeneric( const VECTOR2I& p0_p, const VECTOR2I& p0_n, // are on the same straight/diagonal line for( int k = 0; k < 2; k++ ) { m = ips[k]; m = *ips[k]; if( m && *m != p0_p && *m != p0_n ) { int prio = ( padDist > padToGapThreshold * m_gap ? 10 : 20 ); Loading pcbnew/router/pns_walkaround.cpp +1 −1 Original line number Diff line number Diff line Loading @@ -136,7 +136,7 @@ PNS_WALKAROUND::WALKAROUND_STATUS PNS_WALKAROUND::Route( const PNS_LINE& aInitia PNS_LINE& aWalkPath, bool aOptimize ) { PNS_LINE path_cw( aInitialPath ), path_ccw( aInitialPath ); WALKAROUND_STATUS s_cw, s_ccw; // = IN_PROGRESS, s_ccw = IN_PROGRESS; WALKAROUND_STATUS s_cw = IN_PROGRESS, s_ccw = IN_PROGRESS; SHAPE_LINE_CHAIN best_path; start( aInitialPath ); Loading Loading
common/geometry/seg.cpp +0 −1 Original line number Diff line number Diff line Loading @@ -35,7 +35,6 @@ bool SEG::PointCloserThan( const VECTOR2I& aP, int aDist ) const { VECTOR2I d = B - A; ecoord dist_sq = (ecoord) aDist * aDist; ecoord dist_sq_thr = (ecoord) ( aDist + 1 ) * ( aDist + 1 ); SEG::ecoord l_squared = d.Dot( d ); SEG::ecoord t = d.Dot( aP - A ); Loading
pcbnew/router/pns_diff_pair.cpp +5 −4 Original line number Diff line number Diff line Loading @@ -625,6 +625,7 @@ void PNS_DP_GATEWAYS::BuildGeneric( const VECTOR2I& p0_p, const VECTOR2I& p0_n, { OPT_VECTOR2I ips[2], m; m = OPT_VECTOR2I(); ips[0] = d_n[i].IntersectLines( d_p[j] ); ips[1] = st_p[i].IntersectLines( st_n[j] ); Loading @@ -637,7 +638,7 @@ void PNS_DP_GATEWAYS::BuildGeneric( const VECTOR2I& p0_p, const VECTOR2I& p0_n, // are on the same straight/diagonal line for( int k = 0; k < 2; k++ ) { m = ips[k]; m = *ips[k]; if( m && *m != p0_p && *m != p0_n ) { int prio = ( padDist > padToGapThreshold * m_gap ? 10 : 20 ); Loading
pcbnew/router/pns_walkaround.cpp +1 −1 Original line number Diff line number Diff line Loading @@ -136,7 +136,7 @@ PNS_WALKAROUND::WALKAROUND_STATUS PNS_WALKAROUND::Route( const PNS_LINE& aInitia PNS_LINE& aWalkPath, bool aOptimize ) { PNS_LINE path_cw( aInitialPath ), path_ccw( aInitialPath ); WALKAROUND_STATUS s_cw, s_ccw; // = IN_PROGRESS, s_ccw = IN_PROGRESS; WALKAROUND_STATUS s_cw = IN_PROGRESS, s_ccw = IN_PROGRESS; SHAPE_LINE_CHAIN best_path; start( aInitialPath ); Loading