43 m_endsSwapped( false ),
48 m_rectangleHeight( 0 ),
49 m_rectangleWidth( 0 ),
68 case SHAPE_T::SEGMENT:
return _(
"Thermal Spoke" );
69 case SHAPE_T::RECTANGLE:
return _(
"Number Box" );
70 default:
return wxT(
"??" );
77 case SHAPE_T::SEGMENT:
return _(
"Line" );
78 case SHAPE_T::RECTANGLE:
return _(
"Rect" );
79 case SHAPE_T::ARC:
return _(
"Arc" );
80 case SHAPE_T::CIRCLE:
return _(
"Circle" );
81 case SHAPE_T::BEZIER:
return _(
"Bezier Curve" );
82 case SHAPE_T::POLY:
return _(
"Polygon" );
83 default:
return wxT(
"??" );
93 case SHAPE_T::SEGMENT:
return wxS(
"S_SEGMENT" );
94 case SHAPE_T::RECTANGLE:
return wxS(
"S_RECT" );
95 case SHAPE_T::ARC:
return wxS(
"S_ARC" );
96 case SHAPE_T::CIRCLE:
return wxS(
"S_CIRCLE" );
97 case SHAPE_T::POLY:
return wxS(
"S_POLYGON" );
98 case SHAPE_T::BEZIER:
return wxS(
"S_CURVE" );
99 case SHAPE_T::UNDEFINED:
return wxS(
"UNDEFINED" );
102 return wxEmptyString;
116 else if(
m_shape == SHAPE_T::POLY )
129 case SHAPE_T::BEZIER:
135 case SHAPE_T::SEGMENT:
192 case SHAPE_T::RECTANGLE:
216 case SHAPE_T::CIRCLE:
217 case SHAPE_T::RECTANGLE:
221 case SHAPE_T::SEGMENT:
230 case SHAPE_T::BEZIER:
252 case SHAPE_T::SEGMENT:
253 case SHAPE_T::RECTANGLE:
254 case SHAPE_T::CIRCLE:
256 m_end += aMoveVector;
263 case SHAPE_T::BEZIER:
265 m_end += aMoveVector;
285 pt.x =
KiROUND( pt.x * aScale );
286 pt.y =
KiROUND( pt.y * aScale );
295 case SHAPE_T::SEGMENT:
296 case SHAPE_T::RECTANGLE:
301 case SHAPE_T::CIRCLE:
309 std::vector<VECTOR2I> pts;
315 pts.emplace_back( pt );
316 scalePt( pts.back() );
324 case SHAPE_T::BEZIER:
342 case SHAPE_T::SEGMENT:
343 case SHAPE_T::CIRCLE:
354 case SHAPE_T::RECTANGLE:
377 case SHAPE_T::BEZIER:
399 case SHAPE_T::SEGMENT:
400 case SHAPE_T::RECTANGLE:
415 case SHAPE_T::CIRCLE:
446 m_poly.
Mirror( aFlipLeftRight, !aFlipLeftRight, aCentre );
449 case SHAPE_T::BEZIER:
483 if(
m_shape != SHAPE_T::BEZIER )
508 std::vector<VECTOR2I> bezierPoints;
513 converter.
GetPoly( bezierPoints, aMinSegLen );
526 case SHAPE_T::CIRCLE:
529 case SHAPE_T::SEGMENT:
534 case SHAPE_T::RECTANGLE:
535 case SHAPE_T::BEZIER:
553 case SHAPE_T::CIRCLE:
585 if( aEndAngle == aStartAngle )
588 while( aEndAngle < aStartAngle )
603 case SHAPE_T::CIRCLE:
612 return std::max( 1,
KiROUND( radius ) );
670 return endAngle - startAngle;
698 if( aCheckNegativeAngle && aAngle <
ANGLE_0 )
712 case SHAPE_T::RECTANGLE:
return _(
"Pad Number Box" );
713 case SHAPE_T::SEGMENT:
return _(
"Thermal Spoke Template" );
714 default:
return _(
"Unrecognized" );
721 case SHAPE_T::CIRCLE:
return _(
"Circle" );
722 case SHAPE_T::ARC:
return _(
"Arc" );
723 case SHAPE_T::BEZIER:
return _(
"Curve" );
724 case SHAPE_T::POLY:
return _(
"Polygon" );
725 case SHAPE_T::RECTANGLE:
return _(
"Rectangle" );
726 case SHAPE_T::SEGMENT:
return _(
"Segment" );
727 default:
return _(
"Unrecognized" );
737 wxString shape =
_(
"Shape" );
742 case SHAPE_T::CIRCLE:
748 aList.emplace_back(
_(
"Angle" ), msg );
753 case SHAPE_T::BEZIER:
758 msg.Printf( wxS(
"%d" ),
GetPolyShape().Outline(0).PointCount() );
759 aList.emplace_back(
_(
"Points" ), msg );
762 case SHAPE_T::RECTANGLE:
763 aList.emplace_back(
_(
"Width" ),
766 aList.emplace_back(
_(
"Height" ),
770 case SHAPE_T::SEGMENT:
772 aList.emplace_back(
_(
"Length" ),
796 case SHAPE_T::RECTANGLE:
802 case SHAPE_T::SEGMENT:
807 case SHAPE_T::CIRCLE:
825 case SHAPE_T::BEZIER:
846 int maxdist = aAccuracy;
853 case SHAPE_T::CIRCLE:
861 return dist <= radius + maxdist;
863 return abs( radius - dist ) <= maxdist;
878 KiROUND<double, VECTOR2I::extended_type>(
EuclideanNorm( relPos ) );
883 if( dist > radius + maxdist )
889 if( abs( radius - dist ) > maxdist )
904 if( endAngle > startAngle )
905 return relPosAngle >= startAngle && relPosAngle <= endAngle;
907 return relPosAngle >= startAngle || relPosAngle <= endAngle;
910 case SHAPE_T::BEZIER:
921 case SHAPE_T::SEGMENT:
924 case SHAPE_T::RECTANGLE:
933 return poly.
Collide( aPosition, maxdist );
951 copy.Outline( 0 ).Append(
copy.Outline( 0 ).CPoint( 0 ) );
952 return copy.Collide( aPosition, maxdist );
981 case SHAPE_T::CIRCLE:
1020 case SHAPE_T::RECTANGLE:
1037 case SHAPE_T::SEGMENT:
1069 for(
int jj = 0; jj < count; jj++ )
1077 if( jj + 1 < count )
1099 case SHAPE_T::BEZIER:
1115 for(
unsigned ii = 1; ii < count; ii++ )
1141 std::vector<VECTOR2I> pts;
1145 pts.emplace_back( topLeft );
1146 pts.emplace_back( botRight.
x, topLeft.
y );
1147 pts.emplace_back( botRight );
1148 pts.emplace_back( topLeft.
x, botRight.
y );
1175 if( t1 < ANGLE_0 && t2 >
ANGLE_0 )
1178 if( t1 < ANGLE_90 && t2 >
ANGLE_90 )
1189 if( t1 < ANGLE_0 || t2 >
ANGLE_0 )
1192 if( t1 < ANGLE_90 || t2 >
ANGLE_90 )
1216 std::vector<SHAPE*> effectiveShapes;
1225 case SHAPE_T::SEGMENT:
1229 case SHAPE_T::RECTANGLE:
1234 effectiveShapes.emplace_back(
new SHAPE_SIMPLE( pts ) );
1236 if( width > 0 || !
IsFilled() || aEdgeOnly )
1238 effectiveShapes.emplace_back(
new SHAPE_SEGMENT( pts[0], pts[1], width ) );
1239 effectiveShapes.emplace_back(
new SHAPE_SEGMENT( pts[1], pts[2], width ) );
1240 effectiveShapes.emplace_back(
new SHAPE_SEGMENT( pts[2], pts[3], width ) );
1241 effectiveShapes.emplace_back(
new SHAPE_SEGMENT( pts[3], pts[0], width ) );
1246 case SHAPE_T::CIRCLE:
1251 if( width > 0 || !
IsFilled() || aEdgeOnly )
1257 case SHAPE_T::BEZIER:
1260 VECTOR2I start_pt = bezierPoints[0];
1262 for(
unsigned int jj = 1; jj < bezierPoints.size(); jj++ )
1264 VECTOR2I end_pt = bezierPoints[jj];
1265 effectiveShapes.emplace_back(
new SHAPE_SEGMENT( start_pt, end_pt, width ) );
1284 if( width > 0 || !
IsFilled() || aEdgeOnly )
1288 if( aLineChainOnly && l.
IsClosed() )
1291 for(
int jj = 0; jj < segCount; jj++ )
1303 return effectiveShapes;
1315 aBuffer.reserve( pointCount );
1318 aBuffer.emplace_back( iter->x, iter->y );
1343 case SHAPE_T::SEGMENT:
1344 case SHAPE_T::CIRCLE:
1345 case SHAPE_T::RECTANGLE:
1355 case SHAPE_T::BEZIER:
1385 case SHAPE_T::SEGMENT:
1386 case SHAPE_T::CIRCLE:
1387 case SHAPE_T::RECTANGLE:
1390 case SHAPE_T::BEZIER:
1403 poly.
Append( aPosition,
true );
1416#define sq( x ) pow( x, 2 )
1420 case SHAPE_T::SEGMENT:
1421 case SHAPE_T::CIRCLE:
1422 case SHAPE_T::RECTANGLE:
1426 case SHAPE_T::BEZIER:
1475 double chordBefore =
sq( v.
x ) +
sq( v.
y );
1484 double chordAfter =
sq( v.
x ) +
sq( v.
y );
1487 if( chordBefore > 0 )
1488 ratio = chordAfter / chordBefore;
1491 radius = std::max( sqrt(
sq( radius ) * ratio ), sqrt( chordAfter ) / 2 );
1499 radius = ( radialA + radialB ) / 2.0;
1513 double sqRadDiff =
sq( radius ) -
sq( l / 2 );
1518 if( l > 0 && sqRadDiff >= 0 )
1573 case SHAPE_T::SEGMENT:
1574 case SHAPE_T::CIRCLE:
1575 case SHAPE_T::RECTANGLE:
1576 case SHAPE_T::BEZIER:
1610 #define SWAPITEM( x ) std::swap( x, image->x )
1632#define TEST( a, b ) { if( a != b ) return a - b; }
1633#define TEST_E( a, b ) { if( abs( a - b ) > EPSILON ) return a - b; }
1634#define TEST_PT( a, b ) { TEST_E( a.x, b.x ); TEST_E( a.y, b.y ); }
1645 else if(
m_shape == SHAPE_T::BEZIER )
1650 else if(
m_shape == SHAPE_T::POLY )
1670 ERROR_LOC aErrorLoc,
bool ignoreLineWidth )
const
1672 int width = ignoreLineWidth ? 0 :
GetWidth();
1674 width += 2 * aClearance;
1678 case SHAPE_T::CIRCLE:
1690 case SHAPE_T::RECTANGLE:
1718 case SHAPE_T::SEGMENT:
1740 int inflate = width / 2;
1745 tmp.
Inflate( inflate, CORNER_STRATEGY::ROUND_ALL_CORNERS, aError );
1757 for(
int jj = 0; jj < (int) poly.
SegmentCount(); ++jj )
1768 case SHAPE_T::BEZIER:
1772 std::vector<VECTOR2I> poly;
1775 for(
unsigned ii = 1; ii < poly.size(); ii++ )
1799 return LINE_STYLE::SOLID;
1853 double similarity = 1.0;
1888 similarity *= std::pow( 0.9, m + n - 2 * longest );
1894 std::vector<VECTOR2I> poly;
1895 std::vector<VECTOR2I> otherPoly;
1903 for(
int ii = 0; ii < m; ++ii )
1911 for(
int ii = 0; ii < n; ++ii )
1913 otherPoly.emplace_back( lastPt - aOther.
m_poly.
CVertex( ii ) );
1919 similarity *= std::pow( 0.9, m + n - 2 * longest );
1944 if( plotDashTypeEnum.Choices().GetCount() == 0 )
1957 auto isNotPolygonOrCircle = [](
INSPECTABLE* aItem ) ->
bool
1975 const wxString shapeProps =
_HKI(
"Shape Properties" );
2034 .SetIsHiddenFromRulesEditor();
2039 angle->SetAvailableFunc(
2049 auto fillAvailable =
2062 switch( edaShape->GetShape() )
2080 .SetAvailableFunc( fillAvailable );
2085 .SetAvailableFunc( fillAvailable )
Bezier curves to polygon converter.
void GetPoly(std::vector< VECTOR2I > &aOutput, int aMinSegLen=0, int aMaxSegCount=32)
Convert a Bezier curve to a polygon.
void SetOrigin(const Vec &pos)
BOX2< Vec > & Normalize()
Ensure that the height and width are positive.
bool Intersects(const BOX2< Vec > &aRect) const
bool IntersectsCircleEdge(const Vec &aCenter, const int aRadius, const int aWidth) const
bool Contains(const Vec &aPoint) const
BOX2< Vec > & Inflate(coord_type dx, coord_type dy)
Inflates the rectangle horizontally by dx and vertically by dy.
void SetEnd(coord_type x, coord_type y)
BOX2< Vec > & Merge(const BOX2< Vec > &aRect)
Modify the position and size of the rectangle in order to contain aRect.
The base class for create windows for drawing purpose.
A base class for most all the KiCad significant classes used in schematics and boards.
EDA_ANGLE GetArcAngle() const
const VECTOR2I & GetBezierC2() const
void SetBezierC2(const VECTOR2I &aPt)
void move(const VECTOR2I &aMoveVector)
void SetCenter(const VECTOR2I &aCenter)
VECTOR2I getCenter() const
void SetLength(const double &aLength)
void rotate(const VECTOR2I &aRotCentre, const EDA_ANGLE &aAngle)
void flip(const VECTOR2I &aCentre, bool aFlipLeftRight)
long long int m_rectangleHeight
void RebuildBezierToSegmentsPointsList(int aMinSegLen)
Rebuild the m_bezierPoints vertex list that approximate the Bezier curve by a list of segments.
virtual int GetEffectiveWidth() const
COLOR4D GetLineColor() const
int GetRectangleWidth() const
void SetLineStyle(const LINE_STYLE aStyle)
const std::vector< VECTOR2I > buildBezierToSegmentsPointsList(int aMinSegLen) const
void calcEdit(const VECTOR2I &aPosition)
SHAPE_POLY_SET & GetPolyShape()
void CalcArcAngles(EDA_ANGLE &aStartAngle, EDA_ANGLE &aEndAngle) const
Calc arc start and end angles such that aStartAngle < aEndAngle.
void ShapeGetMsgPanelInfo(EDA_DRAW_FRAME *aFrame, std::vector< MSG_PANEL_ITEM > &aList)
void SetFilled(bool aFlag)
bool operator==(const EDA_SHAPE &aOther) const
bool continueEdit(const VECTOR2I &aPosition)
wxString ShowShape() const
void SetFillColor(const COLOR4D &aColor)
std::vector< SHAPE * > makeEffectiveShapes(bool aEdgeOnly, bool aLineChainOnly=false) const
Make a set of SHAPE objects representing the EDA_SHAPE.
bool hitTest(const VECTOR2I &aPosition, int aAccuracy=0) const
void SetCachedArcData(const VECTOR2I &aStart, const VECTOR2I &aMid, const VECTOR2I &aEnd, const VECTOR2I &aCenter)
Set the data used for mid point caching.
EDA_SHAPE(SHAPE_T aType, int aLineWidth, FILL_T aFill)
void beginEdit(const VECTOR2I &aStartPoint)
int GetPointCount() const
const VECTOR2I & GetEnd() const
Return the ending point of the graphic.
void SetStart(const VECTOR2I &aStart)
void DupPolyPointsList(std::vector< VECTOR2I > &aBuffer) const
Duplicate the list of corners in a std::vector<VECTOR2I>
LINE_STYLE GetLineStyle() const
void endEdit(bool aClosed=true)
Finishes editing the shape.
const VECTOR2I & GetStart() const
Return the starting point of the graphic.
void SetLineColor(const COLOR4D &aColor)
COLOR4D GetFillColor() const
void SetRectangle(const long long int &aHeight, const long long int &aWidth)
void SwapShape(EDA_SHAPE *aImage)
std::vector< VECTOR2I > GetRectCorners() const
void SetSegmentAngle(const EDA_ANGLE &aAngle)
std::vector< VECTOR2I > m_bezierPoints
void setPosition(const VECTOR2I &aPos)
virtual bool IsProxyItem() const
void computeArcBBox(BOX2I &aBBox) const
void SetEnd(const VECTOR2I &aEnd)
void SetBezierC1(const VECTOR2I &aPt)
void SetArcGeometry(const VECTOR2I &aStart, const VECTOR2I &aMid, const VECTOR2I &aEnd)
Set the three controlling points for an arc.
wxString SHAPE_T_asString() const
void scale(double aScale)
double Similarity(const EDA_SHAPE &aOther) const
const VECTOR2I & GetBezierC1() const
const BOX2I getBoundingBox() const
void SetArcAngleAndEnd(const EDA_ANGLE &aAngle, bool aCheckNegativeAngle=false)
Set the end point from the angle center and start.
int GetRectangleHeight() const
virtual int GetWidth() const
VECTOR2I getPosition() const
bool IsClockwiseArc() const
void SetPolyPoints(const std::vector< VECTOR2I > &aPoints)
void TransformShapeToPolygon(SHAPE_POLY_SET &aBuffer, int aClearance, int aError, ERROR_LOC aErrorLoc, bool ignoreLineWidth=false) const
Convert the shape to a closed polygon.
wxString getFriendlyName() const
void SetWidth(int aWidth)
EDA_ANGLE GetSegmentAngle() const
long long int m_rectangleWidth
bool IsPolyShapeValid() const
int Compare(const EDA_SHAPE *aOther) const
VECTOR2I GetArcMid() const
static ENUM_MAP< T > & Instance()
Class that other classes need to inherit from, in order to be inspectable.
A color representation with 4 components: red, green, blue, alpha.
PROPERTY_BASE & SetAvailableFunc(std::function< bool(INSPECTABLE *)> aFunc)
Set a callback function to determine whether an object provides this property.
PROPERTY_BASE & SetIsHiddenFromRulesEditor(bool aHide=true)
Provide class metadata.Helper macro to map type hashes to names.
static PROPERTY_MANAGER & Instance()
PROPERTY_BASE & AddProperty(PROPERTY_BASE *aProperty, const wxString &aGroup=wxEmptyString)
Register a property.
int Length() const
Return the length (this).
Represent a polyline containing arcs as well as line segments: A chain of connected line and/or arc s...
bool IsClosed() const override
virtual const VECTOR2I GetPoint(int aIndex) const override
void SetPoint(int aIndex, const VECTOR2I &aPos)
Move a point to a specific location.
void SetClosed(bool aClosed)
Mark the line chain as closed (i.e.
int PointCount() const
Return the number of points (vertices) in this line chain.
virtual size_t GetPointCount() const override
void Append(int aX, int aY, bool aAllowDuplication=false)
Append a new point at the end of the line chain.
virtual const SEG GetSegment(int aIndex) const override
const VECTOR2I & CPoint(int aIndex) const
Return a reference to a given point in the line chain.
int SegmentCount() const
Return the number of segments in this line chain.
const VECTOR2I & CLastPoint() const
Return the last point in the line chain.
void Remove(int aStartIndex, int aEndIndex)
Remove the range of points [start_index, end_index] from the line chain.
const SEG CSegment(int aIndex) const
Return a constant copy of the aIndex segment in the line chain.
const std::vector< VECTOR2I > & CPoints() const
Represent a set of closed polygons.
void Rotate(const EDA_ANGLE &aAngle, const VECTOR2I &aCenter={ 0, 0 }) override
Rotate all vertices by a given angle.
void RemoveAllContours()
Remove all outlines & holes (clears) the polygon set.
bool CollideEdge(const VECTOR2I &aPoint, VERTEX_INDEX *aClosestVertex=nullptr, int aClearance=0) const
Check whether aPoint collides with any edge of any of the contours of the polygon.
int VertexCount(int aOutline=-1, int aHole=-1) const
Return the number of vertices in a given outline/hole.
bool IsEmpty() const
Return true if the set is empty (no polygons at all)
CONST_ITERATOR CIterate(int aFirst, int aLast, bool aIterateHoles=false) const
bool Collide(const SHAPE *aShape, int aClearance=0, int *aActual=nullptr, VECTOR2I *aLocation=nullptr) const override
Check if the boundary of shape (this) lies closer to the shape aShape than aClearance,...
int TotalVertices() const
Return total number of vertices stored in the set.
void Inflate(int aAmount, CORNER_STRATEGY aCornerStrategy, int aMaxError, bool aSimplify=false)
Perform outline inflation/deflation.
int Append(int x, int y, int aOutline=-1, int aHole=-1, bool aAllowDuplication=false)
Appends a vertex at the end of the given outline/hole (default: the last outline)
void Mirror(bool aX=true, bool aY=false, const VECTOR2I &aRef={ 0, 0 })
Mirror the line points about y or x (or both)
SHAPE_LINE_CHAIN & Outline(int aIndex)
Return the reference to aIndex-th outline in the set.
int NewOutline()
Creates a new empty polygon in the set and returns its index.
const VECTOR2I & CVertex(int aIndex, int aOutline, int aHole) const
Return the index-th vertex in a given hole outline within a given outline.
int OutlineCount() const
Return the number of outlines in the set.
void Move(const VECTOR2I &aVector) override
const SHAPE_LINE_CHAIN & COutline(int aIndex) const
Represent a simple polygon consisting of a zero-thickness closed chain of connected line segments.
void SetLineStyle(LINE_STYLE aLineStyle)
void GetMsgPanelInfo(UNITS_PROVIDER *aUnitsProvider, std::vector< MSG_PANEL_ITEM > &aList, bool aIncludeStyle=true, bool aIncludeWidth=true)
LINE_STYLE GetLineStyle() const
wxString MessageTextFromValue(double aValue, bool aAddUnitLabel=true, EDA_DATA_TYPE aType=EDA_DATA_TYPE::DISTANCE) const
A lower-precision version of StringFromValue().
extended_type SquaredEuclideanNorm() const
Compute the squared euclidean norm of the vector, which is defined as (x ** 2 + y ** 2).
VECTOR2_TRAITS< int >::extended_type extended_type
void TransformRingToPolygon(SHAPE_POLY_SET &aBuffer, const VECTOR2I &aCentre, int aRadius, int aWidth, int aError, ERROR_LOC aErrorLoc)
Convert arcs to multiple straight segments.
void TransformCircleToPolygon(SHAPE_LINE_CHAIN &aBuffer, const VECTOR2I &aCenter, int aRadius, int aError, ERROR_LOC aErrorLoc, int aMinSegCount=0)
Convert a circle to a polygon, using multiple straight lines.
void TransformArcToPolygon(SHAPE_POLY_SET &aBuffer, const VECTOR2I &aStart, const VECTOR2I &aMid, const VECTOR2I &aEnd, int aWidth, int aError, ERROR_LOC aErrorLoc)
Convert arc to multiple straight segments.
void TransformOvalToPolygon(SHAPE_POLY_SET &aBuffer, const VECTOR2I &aStart, const VECTOR2I &aEnd, int aWidth, int aError, ERROR_LOC aErrorLoc, int aMinSegCount=0)
Convert a oblong shape to a polygon, using multiple segments.
static constexpr EDA_ANGLE ANGLE_0
static constexpr EDA_ANGLE ANGLE_90
static constexpr EDA_ANGLE ANGLE_270
static constexpr EDA_ANGLE ANGLE_360
static constexpr EDA_ANGLE ANGLE_180
static struct EDA_SHAPE_DESC _EDA_SHAPE_DESC
@ ARC
use RECTANGLE instead of RECT to avoid collision in a Windows header
ERROR_LOC
When approximating an arc or circle, should the error be placed on the outside or inside of the curve...
This file contains miscellaneous commonly used macros and functions.
#define KI_FALLTHROUGH
The KI_FALLTHROUGH macro is to be used when switch statement cases should purposely fallthrough from ...
#define UNIMPLEMENTED_FOR(type)
KICOMMON_API wxString MessageTextFromValue(const EDA_IU_SCALE &aIuScale, EDA_UNITS aUnits, double aValue, bool aAddUnitsText=true, EDA_DATA_TYPE aType=EDA_DATA_TYPE::DISTANCE)
A helper to convert the double length aValue to a string in inches, millimeters, or unscaled units.
size_t longest_common_subset(const _Container &__c1, const _Container &__c2)
Returns the length of the longest common subset of values between two containers.
EDA_ANGLE abs(const EDA_ANGLE &aAngle)
#define IMPLEMENT_ENUM_TO_WXANY(type)
#define NO_SETTER(owner, type)
@ PT_COORD
Coordinate expressed in distance units (mm/inch)
@ PT_DECIDEGREE
Angle expressed in decidegrees.
@ PT_SIZE
Size expressed in distance units (mm/inch)
LINE_STYLE
Dashed line types.
bool TestSegmentHit(const VECTOR2I &aRefPoint, const VECTOR2I &aStart, const VECTOR2I &aEnd, int aDist)
Test if aRefPoint is with aDistance on the line defined by aStart and aEnd.
void RotatePoint(int *pX, int *pY, const EDA_ANGLE &aAngle)
Calculate the new point of coord coord pX, pY, for a rotation center 0, 0.
const VECTOR2I CalcArcCenter(const VECTOR2I &aStart, const VECTOR2I &aMid, const VECTOR2I &aEnd)
Determine the center of an arc or circle given three points on its circumference.
double GetLineLength(const VECTOR2I &aPointA, const VECTOR2I &aPointB)
Return the length of a line segment defined by aPointA and aPointB.
double EuclideanNorm(const VECTOR2I &vector)
@ PCB_TABLECELL_T
class PCB_TABLECELL, PCB_TEXTBOX for use in tables
constexpr ret_type KiROUND(fp_type v)
Round a floating point number to an integer using "round halfway cases away from zero".