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

Fix accidentally introduced recursion

This commit is contained in:
Marek Roszko 2022-01-01 14:38:44 -05:00
parent b805757eeb
commit 8c0da67108
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
libs/kimath/src/bezier_curves.cpp
View File

@ -74,7 +74,7 @@ BEZIER_POLY::BEZIER_POLY( const std::vector<VECTOR2I>& aControlPoints )
void BEZIER_POLY::GetPoly( std::vector<VECTOR2I>& aOutput, int aMinSegLen, int aMaxSegCount ) void BEZIER_POLY::GetPoly( std::vector<VECTOR2I>& aOutput, int aMinSegLen, int aMaxSegCount )
{ {
aOutput.clear(); aOutput.clear();
std::vector<VECTOR2I> buffer; std::vector<VECTOR2D> buffer;
GetPoly( buffer, double( aMinSegLen ), aMaxSegCount ); GetPoly( buffer, double( aMinSegLen ), aMaxSegCount );
for( unsigned ii = 0; ii < buffer.size(); ++ii ) for( unsigned ii = 0; ii < buffer.size(); ++ii )
@ -88,7 +88,7 @@ void BEZIER_POLY::GetPoly( std::vector<VECTOR2D>& aOutput, double aMinSegLen, in
// FIXME Brute force method, use a better (recursive?) algorithm // FIXME Brute force method, use a better (recursive?) algorithm
// with a max error value. // with a max error value.
// to optimize the number of segments // to optimize the number of segments
double dt = 1.0 / aMaxSegCount; double dt = 1.0 / aMaxSegCount;
aOutput.clear(); aOutput.clear();
aOutput.push_back( m_ctrlPts[0] ); aOutput.push_back( m_ctrlPts[0] );