#include <shape_line_chain.h>

Inheritance diagram for SHAPE_LINE_CHAIN:

Classes
struct	compareOriginDistance

struct	INTERSECTION
	Struct INTERSECTION. More...

class	POINT_INSIDE_TRACKER
	Class POINT_INSIDE_TRACKER. More...

Public Types
typedef std::vector< INTERSECTION >	INTERSECTIONS

Public Member Functions
	SHAPE_LINE_CHAIN ()
	Constructor Initializes an empty line chain. More...

	SHAPE_LINE_CHAIN (const SHAPE_LINE_CHAIN &aShape)
	Copy Constructor. More...

	SHAPE_LINE_CHAIN (const std::vector< int > &aV)

	SHAPE_LINE_CHAIN (const std::vector< wxPoint > &aV, bool aClosed=false)

	SHAPE_LINE_CHAIN (const std::vector< VECTOR2I > &aV, bool aClosed=false)

	SHAPE_LINE_CHAIN (const SHAPE_ARC &aArc, bool aClosed=false)

	SHAPE_LINE_CHAIN (const ClipperLib::Path &aPath)

virtual	~SHAPE_LINE_CHAIN ()

SHAPE_LINE_CHAIN &	operator= (const SHAPE_LINE_CHAIN &)=default

SHAPE *	Clone () const override
	Return a dynamically allocated copy of the shape. More...

void	Clear ()
	Function Clear() Removes all points from the line chain. More...

void	SetClosed (bool aClosed)
	Function SetClosed() More...

bool	IsClosed () const override
	Function IsClosed() More...

void	SetWidth (int aWidth)
	Sets the width of all segments in the chain. More...

int	Width () const
	Gets the current width of the segments in the chain. More...

int	SegmentCount () const
	Function SegmentCount() More...

int	ShapeCount () const
	Returns the number of shapes (line segments or arcs) in this line chain. More...

int	PointCount () const
	Function PointCount() More...

SEG	Segment (int aIndex)
	Function Segment() More...

const SEG	CSegment (int aIndex) const
	Function CSegment() More...

int	NextShape (int aPointIndex, bool aForwards=true) const
	Returns the vertex index of the next shape in the chain, or -1 if aPoint is in the last shape If aPoint is the start of a segment, this will be ( aPoint + 1 ). More...

int	PrevShape (int aPointIndex) const

void	SetPoint (int aIndex, const VECTOR2I &aPos)
	Accessor Function to move a point to a specific location. More...

const VECTOR2I &	CPoint (int aIndex) const
	Function Point() More...

const std::vector< VECTOR2I > &	CPoints () const

const VECTOR2I &	CLastPoint () const
	Returns the last point in the line chain. More...

const std::vector< SHAPE_ARC > &	CArcs () const

const std::vector< ssize_t > &	CShapes () const

const BOX2I	BBox (int aClearance=0) const override
	Compute a bounding box of the shape, with a margin of aClearance a collision. More...

void	GenerateBBoxCache () const

const BOX2I	BBoxFromCache () const

int	Distance (const VECTOR2I &aP, bool aOutlineOnly=false) const
	Function Distance() More...

const SHAPE_LINE_CHAIN	Reverse () const
	Function Reverse() More...

long long int	Length () const
	Function Length() More...

void	Append (int aX, int aY, bool aAllowDuplication=false)
	Function Append() More...

void	Append (const VECTOR2I &aP, bool aAllowDuplication=false)
	Function Append() More...

void	Append (const SHAPE_LINE_CHAIN &aOtherLine)
	Function Append() More...

void	Append (const SHAPE_ARC &aArc)

void	Insert (size_t aVertex, const VECTOR2I &aP)

void	Insert (size_t aVertex, const SHAPE_ARC &aArc)

void	Replace (int aStartIndex, int aEndIndex, const VECTOR2I &aP)
	Function Replace() More...

void	Replace (int aStartIndex, int aEndIndex, const SHAPE_LINE_CHAIN &aLine)
	Function Replace() More...

void	Remove (int aStartIndex, int aEndIndex)
	Function Remove() More...

void	Remove (int aIndex)
	Function Remove() removes the aIndex-th point from the line chain. More...

void	RemoveShape (int aPointIndex)
	Removes the shape at the given index from the line chain. More...

int	Split (const VECTOR2I &aP)
	Function Split() More...

int	Find (const VECTOR2I &aP) const
	Function Find() More...

int	FindSegment (const VECTOR2I &aP) const
	Function FindSegment() More...

const SHAPE_LINE_CHAIN	Slice (int aStartIndex, int aEndIndex=-1) const
	Function Slice() More...

bool	Intersects (const SHAPE_LINE_CHAIN &aChain) const

int	Intersect (const SEG &aSeg, INTERSECTIONS &aIp) const
	Function Intersect() More...

int	Intersect (const SHAPE_LINE_CHAIN &aChain, INTERSECTIONS &aIp) const
	Function Intersect() More...

int	PathLength (const VECTOR2I &aP) const
	Function PathLength() More...

bool	CheckClearance (const VECTOR2I &aP, const int aDist) const
	Function CheckClearance() More...

const OPT< INTERSECTION >	SelfIntersecting () const
	Function SelfIntersecting() More...

SHAPE_LINE_CHAIN &	Simplify (bool aRemoveColinear=true)
	Function Simplify() More...

void	convertArc (ssize_t aArcIndex)
	Converts an arc to only a point chain by removing the arc and references. More...

ClipperLib::Path	convertToClipper (bool aRequiredOrientation) const
	Creates a new Clipper path from the SHAPE_LINE_CHAIN in a given orientation. More...

int	NearestSegment (const VECTOR2I &aP) const
	Find the segment nearest the given point. More...

const VECTOR2I	NearestPoint (const VECTOR2I &aP, bool aAllowInternalShapePoints=true) const
	Finds a point on the line chain that is closest to point aP. More...

const VECTOR2I	NearestPoint (const SEG &aSeg, int &dist) const
	Finds a point on the line chain that is closest to the line defined by the points of segment aSeg, also returns the distance. More...

const std::string	Format () const override

bool	Parse (std::stringstream &aStream) override

bool	operator!= (const SHAPE_LINE_CHAIN &aRhs) const

bool	CompareGeometry (const SHAPE_LINE_CHAIN &aOther) const

void	Move (const VECTOR2I &aVector) override

void	Mirror (bool aX=true, bool aY=false, const VECTOR2I &aRef={ 0, 0 })
	Mirrors the line points about y or x (or both) More...

void	Mirror (const SEG &axis)
	Mirrors the line points using an given axis. More...

void	Rotate (double aAngle, const VECTOR2I &aCenter=VECTOR2I(0, 0)) override
	Function Rotate rotates all vertices by a given angle. More...

bool	IsSolid () const override

const VECTOR2I	PointAlong (int aPathLength) const

double	Area () const

size_t	ArcCount () const

ssize_t	ArcIndex (size_t aSegment) const

const SHAPE_ARC &	Arc (size_t aArc) const

bool	isArc (size_t aSegment) const

virtual const VECTOR2I	GetPoint (int aIndex) const override

virtual const SEG	GetSegment (int aIndex) const override

virtual size_t	GetPointCount () const override

virtual size_t	GetSegmentCount () const override

virtual bool	Collide (const VECTOR2I &aP, int aClearance=0, int aActual=nullptr, VECTOR2I aLocation=nullptr) const override
	Check if point aP lies closer to us than aClearance. More...

virtual bool	Collide (const SEG &aSeg, int aClearance=0, int aActual=nullptr, VECTOR2I aLocation=nullptr) const override
	Check if segment aSeg lies closer to us than aClearance. More...

virtual bool	Collide (const SHAPE aShape, int aClearance, VECTOR2I aMTV) const
	Check if the boundary of shape (this) lies closer to the shape aShape than aClearance, indicating a collision. More...

virtual bool	Collide (const SHAPE aShape, int aClearance=0, int aActual=nullptr, VECTOR2I *aLocation=nullptr) const

SEG::ecoord	SquaredDistance (const VECTOR2I &aP, bool aOutlineOnly=false) const

bool	PointInside (const VECTOR2I &aPt, int aAccuracy=0, bool aUseBBoxCache=false) const
	Check if point aP lies inside a polygon (any type) defined by the line chain. More...

bool	PointOnEdge (const VECTOR2I &aP, int aAccuracy=0) const
	Check if point aP lies on an edge or vertex of the line chain. More...

int	EdgeContainingPoint (const VECTOR2I &aP, int aAccuracy=0) const
	Check if point aP lies on an edge or vertex of the line chain. More...

bool	IsNull () const
	Return true if the shape is a null shape. More...

virtual VECTOR2I	Centre () const
	Compute a center-of-mass of the shape. More...

FACET *	NewFacet ()

SGNODE *	CalcShape (SGNODE aParent, SGNODE aColor, WRL1_ORDER aVertexOrder, float aCreaseLimit=0.74317, bool isVRML2=false)

SHAPE_TYPE	Type () const
	Return the type of the shape. More...

virtual bool	HasIndexableSubshapes () const

virtual size_t	GetIndexableSubshapeCount () const

virtual void	GetIndexableSubshapes (std::vector< SHAPE * > &aSubshapes)

Static Public Attributes
static const int	MIN_PRECISION_IU = 4
	This is the minimum precision for all the points in a shape. More...

Protected Types
typedef VECTOR2I::extended_type	ecoord

Protected Attributes
SHAPE_TYPE	m_type
	< type of our shape More...

Private Types
typedef std::vector< VECTOR2I >::iterator	point_iter

typedef std::vector< VECTOR2I >::const_iterator	point_citer

Private Attributes
std::vector< VECTOR2I >	m_points
	array of vertices More...

std::vector< ssize_t >	m_shapes
	Array of indices that refer to the index of the shape if the point is part of a larger shape, e.g. More...

std::vector< SHAPE_ARC >	m_arcs

bool	m_closed
	is the line chain closed? More...

int	m_width
	Width of the segments (for BBox calculations in RTree) TODO Adjust usage of SHAPE_LINE_CHAIN to account for where we need a width and where not Alternatively, we could split the class into a LINE_CHAIN (no width) and SHAPE_LINE_CHAIN that derives from SHAPE as well that does have a width. More...

BOX2I	m_bbox
	cached bounding box More...

Static Private Attributes
static constexpr ssize_t	SHAPE_IS_PT = -1

Detailed Description

SHAPE_LINE_CHAIN.

Represents a polyline (an zero-thickness chain of connected line segments). I purposedly didn't name it "polyline" to avoid confusion with the existing CPolyLine in pcbnew.

SHAPE_LINE_CHAIN class shall not be used for polygons!

Definition at line 46 of file shape_line_chain.h.

Member Typedef Documentation

◆ ecoord

typedef VECTOR2I::extended_type SHAPE::ecoord

protectedinherited

Definition at line 236 of file shape.h.

◆ INTERSECTIONS

typedef std::vector<INTERSECTION> SHAPE_LINE_CHAIN::INTERSECTIONS

Definition at line 95 of file shape_line_chain.h.

◆ point_citer

typedef std::vector<VECTOR2I>::const_iterator SHAPE_LINE_CHAIN::point_citer

private

Definition at line 50 of file shape_line_chain.h.

◆ point_iter

typedef std::vector<VECTOR2I>::iterator SHAPE_LINE_CHAIN::point_iter

private

Definition at line 49 of file shape_line_chain.h.

Constructor & Destructor Documentation

◆ SHAPE_LINE_CHAIN() [1/7]

SHAPE_LINE_CHAIN::SHAPE_LINE_CHAIN ( )

inline

Constructor Initializes an empty line chain.

Definition at line 102 of file shape_line_chain.h.

102 : SHAPE_LINE_CHAIN_BASE( SH_LINE_CHAIN ), m_closed( false ), m_width( 0 )

103 {}

SHAPE_LINE_CHAIN_BASE::SHAPE_LINE_CHAIN_BASE

SHAPE_LINE_CHAIN_BASE(SHAPE_TYPE aType)

Definition: shape.h:243

SHAPE_LINE_CHAIN::m_closed

bool m_closed

is the line chain closed?

Definition: shape_line_chain.h:786

SHAPE_LINE_CHAIN::m_width

int m_width

Width of the segments (for BBox calculations in RTree) TODO Adjust usage of SHAPE_LINE_CHAIN to accou...

Definition: shape_line_chain.h:793

SH_LINE_CHAIN

line chain (polyline)

Definition: shape.h:45

Referenced by Clone().

◆ SHAPE_LINE_CHAIN() [2/7]

SHAPE_LINE_CHAIN::SHAPE_LINE_CHAIN ( const SHAPE_LINE_CHAIN & aShape )

inline

Copy Constructor.

Definition at line 109 of file shape_line_chain.h.

             : SHAPE_LINE_CHAIN_BASE( SH_LINE_CHAIN ),
               m_points( aShape.m_points ),
               m_shapes( aShape.m_shapes ),
               m_arcs( aShape.m_arcs ),
               m_closed( aShape.m_closed ),
               m_width( aShape.m_width ),
               m_bbox( aShape.m_bbox )
     {}

◆ SHAPE_LINE_CHAIN() [3/7]

SHAPE_LINE_CHAIN::SHAPE_LINE_CHAIN ( const std::vector< int > & aV )

Definition at line 39 of file shape_line_chain.cpp.

     : SHAPE_LINE_CHAIN_BASE( SH_LINE_CHAIN ), m_closed( false ), m_width( 0 )
 {
     for(size_t i = 0; i < aV.size(); i+= 2 )
     {
         Append( aV[i], aV[i+1] );
     }
 }

References Append().

◆ SHAPE_LINE_CHAIN() [4/7]

SHAPE_LINE_CHAIN::SHAPE_LINE_CHAIN	(	const std::vector< wxPoint > &	aV,
		bool	aClosed = `false`
	)

inline

Definition at line 121 of file shape_line_chain.h.

             : SHAPE_LINE_CHAIN_BASE( SH_LINE_CHAIN ), m_closed( aClosed ), m_width( 0 )
     {
         m_points.reserve( aV.size() );
 
         for( auto pt : aV )
             m_points.emplace_back( pt.x, pt.y );
 
         m_shapes = std::vector<ssize_t>( aV.size(), ssize_t( SHAPE_IS_PT ) );
     }

References m_points, m_shapes, and SHAPE_IS_PT.

◆ SHAPE_LINE_CHAIN() [5/7]

SHAPE_LINE_CHAIN::SHAPE_LINE_CHAIN	(	const std::vector< VECTOR2I > &	aV,
		bool	aClosed = `false`
	)

inline

Definition at line 132 of file shape_line_chain.h.

             : SHAPE_LINE_CHAIN_BASE( SH_LINE_CHAIN ), m_closed( aClosed ), m_width( 0 )
     {
         m_points = aV;
         m_shapes = std::vector<ssize_t>( aV.size(), ssize_t( SHAPE_IS_PT ) );
     }

References m_points, m_shapes, and SHAPE_IS_PT.

◆ SHAPE_LINE_CHAIN() [6/7]

SHAPE_LINE_CHAIN::SHAPE_LINE_CHAIN	(	const SHAPE_ARC &	aArc,
		bool	aClosed = `false`
	)

inline

Definition at line 139 of file shape_line_chain.h.

             : SHAPE_LINE_CHAIN_BASE( SH_LINE_CHAIN ),
               m_closed( aClosed ),
               m_width( 0 )
     {
         m_points = aArc.ConvertToPolyline().CPoints();
         m_arcs.emplace_back( aArc );
         m_shapes = std::vector<ssize_t>( m_points.size(), 0 );
     }

References SHAPE_ARC::ConvertToPolyline(), CPoints(), m_arcs, m_points, and m_shapes.

◆ SHAPE_LINE_CHAIN() [7/7]

SHAPE_LINE_CHAIN::SHAPE_LINE_CHAIN ( const ClipperLib::Path & aPath )

inline

Definition at line 149 of file shape_line_chain.h.

                                                     :
         SHAPE_LINE_CHAIN_BASE( SH_LINE_CHAIN ),
         m_closed( true ),
         m_width( 0 )
     {
         m_points.reserve( aPath.size() );
         m_shapes = std::vector<ssize_t>( aPath.size(), ssize_t( SHAPE_IS_PT ) );
 
         for( const auto& point : aPath )
             m_points.emplace_back( point.X, point.Y );
     }

References m_points, m_shapes, and SHAPE_IS_PT.

◆ ~SHAPE_LINE_CHAIN()

virtual SHAPE_LINE_CHAIN::~SHAPE_LINE_CHAIN ( )

inlinevirtual

Definition at line 161 of file shape_line_chain.h.

162 {}

Member Function Documentation

◆ Append() [1/4]

void SHAPE_LINE_CHAIN::Append	(	int	aX,
		int	aY,
		bool	aAllowDuplication = `false`
	)

inline

Function Append()

Appends a new point at the end of the line chain.

Parameters

aX	is X coordinate of the new point
aY	is Y coordinate of the new point
aAllowDuplication	= true to append the new point even it is the same as the last entered point false (default) to skip it if it is the same as the last entered point

Definition at line 431 of file shape_line_chain.h.

     {
         VECTOR2I v( aX, aY );
         Append( v, aAllowDuplication );
     }

Referenced by PNS_PCBNEW_DEBUG_DECORATOR::AddBox(), ZONE_FILLER::addHatchFillTypeOnZone(), POLYGON_GEOM_MANAGER::AddPoint(), PNS_TEST_DEBUG_DECORATOR::AddPoint(), PNS_PCBNEW_DEBUG_DECORATOR::AddPoint(), ZONE::AddPolygon(), PNS_PCBNEW_DEBUG_DECORATOR::AddSegment(), PNS::MOUSE_TRAIL_TRACER::AddTrailPoint(), SHAPE_SIMPLE::Append(), PNS::DIFF_PAIR::Append(), PNS::ArcHull(), PNS::NODE::AssembleLine(), buildBoardBoundingBoxPoly(), PAD::BuildEffectiveShapes(), BuildFootprintPolygonOutlines(), PNS::DIFF_PAIR::BuildInitial(), DIRECTION_45::BuildInitialTrace(), ZONE_FILLER::buildThermalSpokes(), SHAPE_POLY_SET::chamferFilletPolygon(), PNS::KEEP_TOPOLOGY_CONSTRAINT::Check(), PNS::OPTIMIZER::circleBreakouts(), PNS::clipToLoopStart(), KI_TEST::CommonTestData::CommonTestData(), PCB_GRID_HELPER::computeAnchors(), SCH_SHEET_PIN::ConstrainOnEdge(), SHAPE_ARC::ConvertToPolyline(), PNS::ConvexHull(), PLACEFILE_GERBER_WRITER::CreatePlaceFile(), PNS::OPTIMIZER::customBreakouts(), PNS::MEANDER_PLACER::doMove(), PNS::LINE::dragSegment45(), PNS::MEANDER_SHAPE::forward(), SHAPE_POLY_SET::fractureSingle(), PNS::MEANDER_SHAPE::genMeanderShape(), CADSTAR_PCB_ARCHIVE_LOADER::getLineChainFromDrawsegments(), PNS::MOUSE_TRAIL_TRACER::GetPosture(), HelperShapeLineChainFromAltiumVertices(), LIB_POLYLINE::HitTest(), PNS::ROUTER::isStartingPointRoutable(), IteratorFixture::IteratorFixture(), PNS::TOPOLOGY::LeadingRatLine(), CADSTAR_SCH_ARCHIVE_LOADER::loadBusses(), FABMASTER::loadFootprints(), CADSTAR_SCH_ARCHIVE_LOADER::loadNets(), FABMASTER::loadShapePolySet(), FABMASTER::loadZone(), PNS::MEANDER_SHAPE::MakeCorner(), PNS::MEANDER_SHAPE::makeMiterShape(), CONVERT_TOOL::makePolysFromRects(), CONVERT_TOOL::makePolysFromSegs(), GEOM_TEST::MakeSquarePolyLine(), PNS::LINE_PLACER::mergeHead(), PNS::OPTIMIZER::mergeObtuse(), PNS::MEANDER_SHAPE::miter(), PNS::DP_MEANDER_PLACER::Move(), PNS::OctagonalHull(), ZONE_CREATE_HELPER::OnComplete(), PNS::LINE_PLACER::optimizeTailHeadTransition(), SHAPE_RECT::Outline(), SHAPE_POLY_SET::Parse(), ALTIUM_PCB::ParseRegions6Data(), partitionPolyIntoRegularCellGrid(), BRDITEMS_PLOTTER::PlotFootprintGraphicItem(), BRDITEMS_PLOTTER::PlotPcbShape(), CONVERT_TOOL::PolyToLines(), PNS::LINE_PLACER::rhShoveOnly(), PNS::WALKAROUND::Route(), PNS::SegmentHull(), SHAPE_LINE_CHAIN(), MARKER_BASE::ShapeToPolygon(), PNS::WALKAROUND::singleStep(), Slice(), PNS::OPTIMIZER::smartPadsSingle(), PNS::MEANDER_SHAPE::start(), TestConcaveSquareFillet(), PNS::tightenSegment(), PNS::LINE_PLACER::Trace(), TransformCircleToPolygon(), unfracture(), SHAPE_POLY_SET::unfractureSingle(), POLYGON_GEOM_MANAGER::updateLeaderPoints(), PNS::LINE::Walkaround(), and walkaround2().

◆ Append() [2/4]

void SHAPE_LINE_CHAIN::Append	(	const VECTOR2I &	aP,
		bool	aAllowDuplication = `false`
	)

inline

Function Append()

Appends a new point at the end of the line chain.

Parameters

aP	the new point
aAllowDuplication	= true to append the new point even it is the same as the last entered point false (default) to skip it if it is the same as the last entered point

Definition at line 446 of file shape_line_chain.h.

     {
         if( m_points.size() == 0 )
             m_bbox = BOX2I( aP, VECTOR2I( 0, 0 ) );
 
         if( m_points.size() == 0 || aAllowDuplication || CPoint( -1 ) != aP )
         {
             m_points.push_back( aP );
             m_shapes.push_back( ssize_t( SHAPE_IS_PT ) );
             m_bbox.Merge( aP );
         }
     }

References CPoint(), m_bbox, m_points, m_shapes, BOX2< Vec >::Merge(), and SHAPE_IS_PT.

◆ Append() [3/4]

void SHAPE_LINE_CHAIN::Append ( const SHAPE_LINE_CHAIN & aOtherLine )

Function Append()

Appends another line chain at the end.

Parameters

aOtherLine the line chain to be appended.

Definition at line 623 of file shape_line_chain.cpp.

 {
     assert( m_shapes.size() == m_points.size() );
 
     if( aOtherLine.PointCount() == 0 )
         return;
 
     else if( PointCount() == 0 || aOtherLine.CPoint( 0 ) != CPoint( -1 ) )
     {
         const VECTOR2I p = aOtherLine.CPoint( 0 );
         m_points.push_back( p );
         m_shapes.push_back( aOtherLine.CShapes()[0] );
         m_bbox.Merge( p );
     }
 
     size_t num_arcs = m_arcs.size();
     m_arcs.insert( m_arcs.end(), aOtherLine.m_arcs.begin(), aOtherLine.m_arcs.end() );
 
     for( int i = 1; i < aOtherLine.PointCount(); i++ )
     {
         const VECTOR2I p = aOtherLine.CPoint( i );
         m_points.push_back( p );
 
         ssize_t arcIndex = aOtherLine.ArcIndex( i );
 
         if( arcIndex != ssize_t( SHAPE_IS_PT ) )
             m_shapes.push_back( num_arcs + arcIndex );
         else
             m_shapes.push_back( ssize_t( SHAPE_IS_PT ) );
 
         m_bbox.Merge( p );
     }
 
     assert( m_shapes.size() == m_points.size() );
 }

References ArcIndex(), CPoint(), CShapes(), m_arcs, m_bbox, m_points, m_shapes, BOX2< Vec >::Merge(), PointCount(), and SHAPE_IS_PT.

◆ Append() [4/4]

void SHAPE_LINE_CHAIN::Append ( const SHAPE_ARC & aArc )

Definition at line 660 of file shape_line_chain.cpp.

 {
     auto& chain = aArc.ConvertToPolyline();
 
     for( auto& pt : chain.CPoints() )
     {
         m_points.push_back( pt );
         m_shapes.push_back( m_arcs.size() );
     }
 
     m_arcs.push_back( aArc );
 
     assert( m_shapes.size() == m_points.size() );
 }

References SHAPE_ARC::ConvertToPolyline(), m_arcs, m_points, and m_shapes.

◆ Arc()

const SHAPE_ARC& SHAPE_LINE_CHAIN::Arc ( size_t aArc ) const

inline

Definition at line 747 of file shape_line_chain.h.

     {
         return m_arcs[aArc];
     }

References m_arcs.

Referenced by PNS::NODE::Add(), and PNS::LINE_PLACER::FixRoute().

◆ ArcCount()

size_t SHAPE_LINE_CHAIN::ArcCount ( ) const

inline

Definition at line 734 of file shape_line_chain.h.

     {
         return m_arcs.size();
     }

References m_arcs.

Referenced by PNS::LINE::ArcCount(), ROUTER_PREVIEW_ITEM::drawLineChain(), and PNS::LINE_PLACER::FixRoute().

◆ ArcIndex()

ssize_t SHAPE_LINE_CHAIN::ArcIndex ( size_t aSegment ) const

inline

Definition at line 739 of file shape_line_chain.h.

     {
         if( aSegment >= m_shapes.size() )
             return SHAPE_IS_PT;
 
         return m_shapes[aSegment];
     }

References m_shapes, and SHAPE_IS_PT.

Referenced by Append(), and PNS::LINE_PLACER::FixRoute().

◆ Area()

double SHAPE_LINE_CHAIN::Area ( ) const

Definition at line 1315 of file shape_line_chain.cpp.

 {
     // see https://www.mathopenref.com/coordpolygonarea2.html
 
     if( !m_closed )
         return 0.0;
 
     double area = 0.0;
     int size = m_points.size();
 
     for( int i = 0, j = size - 1; i < size; ++i )
     {
         area += ( (double) m_points[j].x + m_points[i].x ) * ( (double) m_points[j].y - m_points[i].y );
         j = i;
     }
 
     return -area * 0.5;
 }

References m_closed, and m_points.

Referenced by ZONE_FILLER::addHatchFillTypeOnZone(), SHAPE_POLY_SET::Area(), ZONE::CalculateFilledArea(), ZONE_FILLER::Fill(), FOOTPRINT::GetCoverageArea(), DIALOG_BOARD_STATISTICS::getDataFromPCB(), PNS::MOUSE_TRAIL_TRACER::GetPosture(), polygonArea(), unfracture(), and SHAPE_POLY_SET::unfractureSingle().

◆ BBox()

const BOX2I SHAPE_LINE_CHAIN::BBox ( int aClearance = 0 ) const

inlineoverridevirtual

Compute a bounding box of the shape, with a margin of aClearance a collision.

Parameters

aClearance how much the bounding box is expanded wrs to the minimum enclosing rectangle for the shape.

Returns: the bounding box.

Implements SHAPE.

Definition at line 372 of file shape_line_chain.h.

     {
         BOX2I bbox;
         bbox.Compute( m_points );
 
         if( aClearance != 0 || m_width != 0 )
             bbox.Inflate( aClearance + m_width );
 
         return bbox;
     }

References BOX2< Vec >::Compute(), BOX2< Vec >::Inflate(), m_points, and m_width.

Referenced by SHAPE_SIMPLE::BBox(), POLY_GRID_PARTITION::build(), PNS::KEEP_TOPOLOGY_CONSTRAINT::Check(), AR_AUTOPLACER::fillMatrix(), DIALOG_BOARD_STATISTICS::getDataFromPCB(), Intersect(), FABMASTER::loadZones(), and PolygonTriangulation::TesselatePolygon().

◆ BBoxFromCache()

const BOX2I SHAPE_LINE_CHAIN::BBoxFromCache ( ) const

inline

Definition at line 391 of file shape_line_chain.h.

     {
         return m_bbox;
     }

References m_bbox.

◆ CalcShape()

SGNODE * SHAPE::CalcShape	(	SGNODE *	aParent,
		SGNODE *	aColor,
		WRL1_ORDER	aVertexOrder,
		float	aCreaseLimit = `0.74317`,
		bool	isVRML2 = `false`
	)

inherited

Definition at line 713 of file wrlfacet.cpp.

 {
     if( facets.empty() || !facets.front()->HasMinPoints() )
         return NULL;
 
     std::vector< std::list< FACET* > > flist;
 
     // determine the max. index and size flist as appropriate
     std::list< FACET* >::iterator sF = facets.begin();
     std::list< FACET* >::iterator eF = facets.end();
 
     int maxIdx = 0;
     int tmi;
     float maxV = 0.0;
     float tV = 0.0;
 
     while( sF != eF )
     {
         tV = ( *sF )->CalcFaceNormal();
         tmi = ( *sF )->GetMaxIndex();
 
         if( tmi > maxIdx )
             maxIdx = tmi;
 
         if( tV > maxV )
             maxV = tV;
 
         ++sF;
     }
 
     ++maxIdx;
 
     if( maxIdx < 3 )
         return NULL;
 
     flist.resize( maxIdx );
 
     // create the lists of facets common to indices
     sF = facets.begin();
 
     while( sF != eF )
     {
         ( *sF )->Renormalize( tV );
         ( *sF )->CollectVertices( flist );
         ++sF;
     }
 
     // calculate the normals
     size_t vs = flist.size();
 
     for( size_t i = 0; i < vs; ++i )
     {
         sF = flist[i].begin();
         eF = flist[i].end();
 
         while( sF != eF )
         {
             ( *sF )->CalcVertexNormal( static_cast<int>( i ), flist[i], aCreaseLimit );
             ++sF;
         }
     }
 
     std::vector< WRLVEC3F > vertices;
     std::vector< WRLVEC3F > normals;
     std::vector< SGCOLOR >  colors;
 
     // push the facet data to the final output list
     sF = facets.begin();
     eF = facets.end();
 
     while( sF != eF )
     {
         ( *sF )->GetData( vertices, normals, colors, aVertexOrder );
         ++sF;
     }
 
     flist.clear();
 
     if( vertices.size() < 3 )
         return NULL;
 
     IFSG_SHAPE shapeNode( false );
 
     if( !isVRML2 )
     {
         shapeNode.NewNode( aParent );
 
         if( aColor )
         {
             if( NULL == S3D::GetSGNodeParent( aColor ) )
                 shapeNode.AddChildNode( aColor );
             else
                 shapeNode.AddRefNode( aColor );
         }
     }
 
     std::vector< SGPOINT >  lCPts;  // vertex points in SGPOINT (double) format
     std::vector< SGVECTOR > lCNorm; // per-vertex normals
     vs = vertices.size();
 
     for( size_t i = 0; i < vs; ++i )
     {
         SGPOINT pt;
         pt.x = vertices[i].x;
         pt.y = vertices[i].y;
         pt.z = vertices[i].z;
         lCPts.push_back( pt );
         lCNorm.emplace_back( normals[i].x, normals[i].y, normals[i].z );
     }
 
     vertices.clear();
     normals.clear();
 
     IFSG_FACESET fsNode( false );
 
     if( !isVRML2 )
         fsNode.NewNode( shapeNode );
     else
         fsNode.NewNode( aParent );
 
     IFSG_COORDS cpNode( fsNode );
     cpNode.SetCoordsList( lCPts.size(), &lCPts[0] );
     IFSG_COORDINDEX ciNode( fsNode );
 
     for( int i = 0; i < (int)lCPts.size(); ++i )
         ciNode.AddIndex( i );
 
     IFSG_NORMALS nmNode( fsNode );
     nmNode.SetNormalList( lCNorm.size(), &lCNorm[0] );
 
     if( !colors.empty() )
     {
         IFSG_COLORS nmColor( fsNode );
         nmColor.SetColorList( colors.size(), &colors[0] );
         colors.clear();
     }
 
     if( !isVRML2 )
         return shapeNode.GetRawPtr();
 
     return fsNode.GetRawPtr();
 }

References IFSG_NODE::AddChildNode(), IFSG_INDEX::AddIndex(), IFSG_NODE::AddRefNode(), SHAPE::facets, IFSG_NODE::GetRawPtr(), S3D::GetSGNodeParent(), IFSG_FACESET::NewNode(), IFSG_SHAPE::NewNode(), NULL, IFSG_COLORS::SetColorList(), IFSG_COORDS::SetCoordsList(), IFSG_NORMALS::SetNormalList(), SGPOINT::x, SGPOINT::y, and SGPOINT::z.

Referenced by WRL1FACESET::TranslateToSG(), X3DIFACESET::TranslateToSG(), and WRL2FACESET::TranslateToSG().

◆ CArcs()

const std::vector<SHAPE_ARC>& SHAPE_LINE_CHAIN::CArcs ( ) const

inline

Returns: the vector of stored arcs

Definition at line 358 of file shape_line_chain.h.

     {
         return m_arcs;
     }

References m_arcs.

Referenced by ROUTER_PREVIEW_ITEM::drawLineChain(), PNS::LINE_PLACER::handlePullback(), and PNS::LINE_PLACER::mergeHead().

◆ Centre()

virtual VECTOR2I SHAPE::Centre ( ) const

inlinevirtualinherited

Compute a center-of-mass of the shape.

Returns: the center-of-mass point

Definition at line 216 of file shape.h.

     {
         return BBox( 0 ).Centre(); // if nothing better is available....
     }

References SHAPE::BBox(), and BOX2< Vec >::Centre().

Referenced by Collide().

◆ CheckClearance()

bool SHAPE_LINE_CHAIN::CheckClearance	(	const VECTOR2I &	aP,
		const int	aDist
	)		const

Function CheckClearance()

Checks if point aP is closer to (or on) an edge or vertex of the line chain.

Parameters

aP	point to check
aDist	distance in internal units

Returns: true if the point is equal to or closer than aDist to the line chain.

Definition at line 927 of file shape_line_chain.cpp.

 {
     if( !PointCount() )
         return false;
 
     else if( PointCount() == 1 )
         return m_points[0] == aP;
 
     for( int i = 0; i < SegmentCount(); i++ )
     {
         const SEG s = CSegment( i );
 
         if( s.A == aP || s.B == aP )
             return true;
 
         if( s.Distance( aP ) <= aDist )
             return true;
     }
 
     return false;
 }

References SEG::A, SEG::B, CSegment(), SEG::Distance(), m_points, PointCount(), and SegmentCount().

◆ CLastPoint()

const VECTOR2I& SHAPE_LINE_CHAIN::CLastPoint ( ) const

inline

Returns the last point in the line chain.

Definition at line 350 of file shape_line_chain.h.

     {
         return m_points[PointCount() - 1];
     }

References m_points, and PointCount().

Referenced by POLYGON_GEOM_MANAGER::DeleteLastCorner(), and POLYGON_GEOM_MANAGER::updateLeaderPoints().

◆ Clear()

void SHAPE_LINE_CHAIN::Clear ( )

inline

Function Clear() Removes all points from the line chain.

Definition at line 172 of file shape_line_chain.h.

     {
         m_points.clear();
         m_arcs.clear();
         m_shapes.clear();
         m_closed = false;
     }

References m_arcs, m_closed, m_points, and m_shapes.

◆ Clone()

SHAPE * SHAPE_LINE_CHAIN::Clone ( ) const

overridevirtual

Return a dynamically allocated copy of the shape.

Return values

copy	of the shape

Reimplemented from SHAPE.

Definition at line 1238 of file shape_line_chain.cpp.

 {
     return new SHAPE_LINE_CHAIN( *this );
 }

References SHAPE_LINE_CHAIN().

Referenced by ROUTER_PREVIEW_ITEM::Line().

◆ Collide() [1/4]

bool SHAPE::Collide	(	const SHAPE *	aShape,
		int	aClearance,
		VECTOR2I *	aMTV
	)		const

virtualinherited

Check if the boundary of shape (this) lies closer to the shape aShape than aClearance, indicating a collision.

Parameters

aShape	shape to check collision against
aClearance	minimum clearance
aMTV	minimum translation vector
aActual	[out] an optional pointer to an int to store the actual distance in the event of a collision.
aLocation	[out] an option pointer to a point to store a nearby location in the event of a collision.

Returns: true, if there is a collision.

Reimplemented in SHAPE_RECT, SHAPE_SEGMENT, and SHAPE_COMPOUND.

Definition at line 881 of file shape_collisions.cpp.

 {
     return collideShapes( this, aShape, aClearance, nullptr, nullptr, aMTV );
 }

References collideShapes().

◆ Collide() [2/4]

bool SHAPE::Collide	(	const SHAPE *	aShape,
		int	aClearance = `0`,
		int *	aActual = `nullptr`,
		VECTOR2I *	aLocation = `nullptr`
	)		const

virtualinherited

Reimplemented in SHAPE_POLY_SET, SHAPE_RECT, SHAPE_SEGMENT, and SHAPE_COMPOUND.

Definition at line 887 of file shape_collisions.cpp.

 {
     return collideShapes( this, aShape, aClearance, aActual, aLocation, nullptr );
 }

References collideShapes().

◆ Collide() [3/4]

bool SHAPE_LINE_CHAIN_BASE::Collide	(	const VECTOR2I &	aP,
		int	aClearance = `0`,
		int *	aActual = `nullptr`,
		VECTOR2I *	aLocation = `nullptr`
	)		const

overridevirtualinherited

Check if point aP lies closer to us than aClearance.

Parameters

aP	the point to check for collisions with
aClearance	minimum distance that does not qualify as a collision.
aActual	an optional pointer to an int to store the actual distance in the event of a collision.

Returns: true, when a collision has been found

Reimplemented from SHAPE.

Definition at line 88 of file shape_line_chain.cpp.

 {
     if( IsClosed() && PointInside( aP, aClearance ) )
     {
         if( aLocation )
             *aLocation = aP;
 
         if( aActual )
             *aActual = 0;
 
         return true;
     }
 
     SEG::ecoord closest_dist_sq = VECTOR2I::ECOORD_MAX;
     SEG::ecoord clearance_sq = SEG::Square( aClearance );
     VECTOR2I nearest;
 
     for( size_t i = 0; i < GetSegmentCount(); i++ )
     {
         const SEG& s = GetSegment( i );
         VECTOR2I pn = s.NearestPoint( aP );
         SEG::ecoord dist_sq = ( pn - aP ).SquaredEuclideanNorm();
 
         if( dist_sq < closest_dist_sq )
         {
             nearest = pn;
             closest_dist_sq = dist_sq;
 
             if( closest_dist_sq == 0 )
                 break;
 
             // If we're not looking for aActual then any collision will do
             if( closest_dist_sq < clearance_sq && !aActual )
                 break;
         }
     }
 
     if( closest_dist_sq == 0 || closest_dist_sq < clearance_sq )
     {
         if( aLocation )
             *aLocation = nearest;
 
         if( aActual )
             *aActual = sqrt( closest_dist_sq );
 
         return true;
     }
 
     return false;
 }

References VECTOR2< T >::ECOORD_MAX, SHAPE_LINE_CHAIN_BASE::GetSegment(), SHAPE_LINE_CHAIN_BASE::GetSegmentCount(), SHAPE_LINE_CHAIN_BASE::IsClosed(), SEG::NearestPoint(), SHAPE_LINE_CHAIN_BASE::PointInside(), and SEG::Square().

Referenced by PNS::MEANDERED_LINE::CheckSelfIntersections(), SHAPE_SIMPLE::Collide(), Collide(), and PCB_SELECTION_TOOL::hitTestDistance().

◆ Collide() [4/4]

bool SHAPE_LINE_CHAIN_BASE::Collide	(	const SEG &	aSeg,
		int	aClearance = `0`,
		int *	aActual = `nullptr`,
		VECTOR2I *	aLocation = `nullptr`
	)		const

overridevirtualinherited

Check if segment aSeg lies closer to us than aClearance.

Parameters

aSeg	the segment to check for collisions with
aClearance	minimum distance that does not qualify as a collision.
aActual	an optional pointer to an int to store the actual distance in the event of a collision.

Returns: true, when a collision has been found

Implements SHAPE.

Reimplemented in SHAPE_SIMPLE.

Definition at line 155 of file shape_line_chain.cpp.

 {
     if( IsClosed() && PointInside( aSeg.A ) )
     {
         if( aLocation )
             *aLocation = aSeg.A;
 
         if( aActual )
             *aActual = 0;
 
         return true;
     }
 
     SEG::ecoord closest_dist_sq = VECTOR2I::ECOORD_MAX;
     SEG::ecoord clearance_sq = SEG::Square( aClearance );
     VECTOR2I nearest;
 
     for( size_t i = 0; i < GetSegmentCount(); i++ )
     {
         const SEG& s = GetSegment( i );
         SEG::ecoord dist_sq =s.SquaredDistance( aSeg );
 
         if( dist_sq < closest_dist_sq )
         {
             if( aLocation )
                 nearest = s.NearestPoint( aSeg );
 
             closest_dist_sq = dist_sq;
 
             if( closest_dist_sq == 0)
                 break;
 
             // If we're not looking for aActual then any collision will do
             if( closest_dist_sq < clearance_sq && !aActual )
                 break;
         }
     }
 
     if( closest_dist_sq == 0 || closest_dist_sq < clearance_sq )
     {
         if( aLocation )
             *aLocation = nearest;
 
         if( aActual )
             *aActual = sqrt( closest_dist_sq );
 
         return true;
     }
 
     return false;
 }

References SEG::A, VECTOR2< T >::ECOORD_MAX, SHAPE_LINE_CHAIN_BASE::GetSegment(), SHAPE_LINE_CHAIN_BASE::GetSegmentCount(), SHAPE_LINE_CHAIN_BASE::IsClosed(), SEG::NearestPoint(), SHAPE_LINE_CHAIN_BASE::PointInside(), SEG::Square(), and SEG::SquaredDistance().

◆ CompareGeometry()

bool SHAPE_LINE_CHAIN::CompareGeometry ( const SHAPE_LINE_CHAIN & aOther ) const

Definition at line 1215 of file shape_line_chain.cpp.

 {
     SHAPE_LINE_CHAIN a(*this), b( aOther );
     a.Simplify();
     b.Simplify();
 
     if( a.m_points.size() != b.m_points.size() )
         return false;
 
     for( int i = 0; i < a.PointCount(); i++)
         if( a.CPoint( i ) != b.CPoint( i ) )
             return false;
     return true;
 }

References CPoint(), m_points, and Simplify().

Referenced by PNS::LINE::CompareGeometry().

◆ convertArc()

void SHAPE_LINE_CHAIN::convertArc ( ssize_t aArcIndex )

Converts an arc to only a point chain by removing the arc and references.

Parameters

aArcIndex index of the arc to convert to points

Definition at line 66 of file shape_line_chain.cpp.

 {
     if( aArcIndex < 0 )
         aArcIndex += m_arcs.size();
 
     if( aArcIndex >= static_cast<ssize_t>( m_arcs.size() ) )
         return;
 
     // Clear the shapes references
     for( auto& sh : m_shapes )
     {
         if( sh == aArcIndex )
             sh = SHAPE_IS_PT;
 
         if( sh > aArcIndex )
             --sh;
     }
 
     m_arcs.erase( m_arcs.begin() + aArcIndex );
 }

References m_arcs, m_shapes, and SHAPE_IS_PT.

Referenced by Insert(), Remove(), Replace(), and SetPoint().

◆ convertToClipper()

ClipperLib::Path SHAPE_LINE_CHAIN::convertToClipper ( bool aRequiredOrientation ) const

Creates a new Clipper path from the SHAPE_LINE_CHAIN in a given orientation.

Definition at line 48 of file shape_line_chain.cpp.

 {
     ClipperLib::Path c_path;
 
     for( int i = 0; i < PointCount(); i++ )
     {
         const VECTOR2I& vertex = CPoint( i );
         c_path.push_back( ClipperLib::IntPoint( vertex.x, vertex.y ) );
     }
 
     if( Orientation( c_path ) != aRequiredOrientation )
         ReversePath( c_path );
 
     return c_path;
 }

References CPoint(), PointCount(), VECTOR2< T >::x, and VECTOR2< T >::y.

◆ CPoint()

const VECTOR2I& SHAPE_LINE_CHAIN::CPoint ( int aIndex ) const

inline

Function Point()

Returns a const reference to a given point in the line chain.

Parameters

aIndex index of the point

Returns: const reference to the point

Definition at line 332 of file shape_line_chain.h.

     {
         if( aIndex < 0 )
             aIndex += PointCount();
         else if( aIndex >= PointCount() )
             aIndex -= PointCount();
 
         return m_points[aIndex];
     }

References m_points, and PointCount().

◆ CPoints()

const std::vector<VECTOR2I>& SHAPE_LINE_CHAIN::CPoints ( ) const

inline

Definition at line 342 of file shape_line_chain.h.

     {
         return m_points;
     }

References m_points.

Referenced by BOOST_AUTO_TEST_CASE(), DIALOG_PAD_PRIMITIVE_POLY_PROPS::DIALOG_PAD_PRIMITIVE_POLY_PROPS(), DIALOG_PAD_PRIMITIVE_POLY_PROPS::doValidate(), KIGFX::GERBVIEW_PAINTER::draw(), KIGFX::GERBVIEW_PAINTER::drawPolygon(), CADSTAR_SCH_ARCHIVE_LOADER::loadNets(), FABMASTER::loadZones(), PCB_SHAPE::Scale(), and SHAPE_LINE_CHAIN().

◆ CSegment()

const SEG SHAPE_LINE_CHAIN::CSegment ( int aIndex ) const

inline

Function CSegment()

Returns a constant copy of the aIndex-th segment in the line chain.

Parameters

aIndex index of the segment in the line chain. Negative values are counted from the end (i.e. -1 means the last segment in the line chain)

Returns: const SEG - aIndex-th segment in the line chain

Definition at line 280 of file shape_line_chain.h.

     {
         if( aIndex < 0 )
             aIndex += SegmentCount();
 
         if( aIndex == (int)( m_points.size() - 1 ) && m_closed )
             return SEG( m_points[aIndex], m_points[0], aIndex );
         else
             return SEG( m_points[aIndex], m_points[aIndex + 1], aIndex );
     }

References m_closed, m_points, and SegmentCount().

Referenced by PNS::MOUSE_TRAIL_TRACER::AddTrailPoint(), PNS::ArcHull(), PNS::LINE_PLACER::buildInitialLine(), PNS::PRESERVE_VERTEX_CONSTRAINT::Check(), CheckClearance(), PNS::NODE::CheckColliding(), PNS::DIFF_PAIR::CheckConnectionAngle(), PNS::checkGap(), PNS::MEANDERED_LINE::CheckSelfIntersections(), PNS::closestProjectedPoint(), PCB_GRID_HELPER::computeAnchors(), PNS::COST_ESTIMATOR::CornerCost(), PNS::LINE::CountCorners(), PNS::coupledBypass(), PNS::DIFF_PAIR::CoupledLength(), PNS::LINE::CSegment(), PNS::MEANDER_PLACER_BASE::cutTunedLine(), PNS::dragCornerInternal(), PNS::findCoupledVertices(), FindSegment(), PNS::DIFF_PAIR_PLACER::FixRoute(), PNS::LINE_PLACER::FixRoute(), PCB_SHAPE::GetLength(), PNS::MOUSE_TRAIL_TRACER::GetPosture(), SHAPE_SIMPLE::GetSegment(), GetSegment(), PNS::LINE_PLACER::handlePullback(), PNS::LINE_PLACER::handleSelfIntersections(), Intersect(), PNS::LINE::Is45Degree(), Length(), PNS::OPTIMIZER::mergeColinear(), PNS::OPTIMIZER::mergeDpStep(), PNS::LINE_PLACER::mergeHead(), PNS::OPTIMIZER::mergeObtuse(), PNS::OPTIMIZER::mergeStep(), PNS::NODE::NearestObstacle(), NearestPoint(), NearestSegment(), PathLength(), PointAlong(), KIGFX::VIEW_OVERLAY::Polyline(), PNS::LINE_PLACER::reduceTail(), DRC_TEST_PROVIDER_EDGE_CLEARANCE::Run(), POLY_GRID_PARTITION::scanCell(), segmentCrossesHullBoundary(), PNS::SegmentHull(), SelfIntersecting(), PNS::OPTIMIZER::smartPadsSingle(), PNS::LINE::snapDraggedCorner(), PNS::LINE::snapToNeighbourSegments(), Split(), PNS::tightenSegment(), SHAPE_POLY_SET::unfractureSingle(), and HYPERLYNX_EXPORTER::writeBoardInfo().

◆ CShapes()

const std::vector<ssize_t>& SHAPE_LINE_CHAIN::CShapes ( ) const

inline

Returns: the vector of values indicating shape type and location

Definition at line 366 of file shape_line_chain.h.

     {
         return m_shapes;
     }

References m_shapes.

Referenced by Append(), PNS::NODE::AssembleLine(), BOOST_AUTO_TEST_CASE(), PNS::LINE::ClipVertexRange(), PNS::LINE::dragCorner45(), PNS::LINE::dragCornerFree(), PNS::LINE_PLACER::FixRoute(), PNS::LINE_PLACER::handlePullback(), PNS::OPTIMIZER::mergeColinear(), PNS::LINE_PLACER::mergeHead(), and PNS::DRAGGER::startDragSegment().

◆ Distance()

int SHAPE_LINE_CHAIN::Distance	(	const VECTOR2I &	aP,
		bool	aOutlineOnly = `false`
	)		const

Function Distance()

Computes the minimum distance between the line chain and a point aP.

Parameters

aP the point

Returns: minimum distance.

Definition at line 392 of file shape_line_chain.cpp.

 {
     return sqrt( SquaredDistance( aP, aOutlineOnly ) );
 }

References SHAPE_LINE_CHAIN_BASE::SquaredDistance().

Referenced by PAD::GetBestAnchorPosition().

◆ EdgeContainingPoint()

int SHAPE_LINE_CHAIN_BASE::EdgeContainingPoint	(	const VECTOR2I &	aP,
		int	aAccuracy = `0`
	)		const

inherited

Check if point aP lies on an edge or vertex of the line chain.

Parameters

aP	point to check

Returns: index of the first edge containing the point, otherwise negative

Definition at line 901 of file shape_line_chain.cpp.

 {
     if( !GetPointCount() )
         return -1;
 
     else if( GetPointCount() == 1 )
     {
         VECTOR2I dist = GetPoint(0) - aPt;
         return ( hypot( dist.x, dist.y ) <= aAccuracy + 1 ) ? 0 : -1;
     }
 
     for( size_t i = 0; i < GetSegmentCount(); i++ )
     {
         const SEG s = GetSegment( i );
 
         if( s.A == aPt || s.B == aPt )
             return i;
 
         if( s.Distance( aPt ) <= aAccuracy + 1 )
             return i;
     }
 
     return -1;
 }

References SEG::A, SEG::B, SEG::Distance(), SHAPE_LINE_CHAIN_BASE::GetPoint(), SHAPE_LINE_CHAIN_BASE::GetPointCount(), SHAPE_LINE_CHAIN_BASE::GetSegment(), SHAPE_LINE_CHAIN_BASE::GetSegmentCount(), VECTOR2< T >::x, and VECTOR2< T >::y.

Referenced by SHAPE_LINE_CHAIN_BASE::PointOnEdge().

◆ Find()

int SHAPE_LINE_CHAIN::Find ( const VECTOR2I & aP ) const

Function Find()

Searches for point aP.

Parameters

aP	the point to be looked for

Returns: index of the correspoinding point in the line chain or negative when not found.

Definition at line 456 of file shape_line_chain.cpp.

 {
     for( int s = 0; s < PointCount(); s++ )
         if( CPoint( s ) == aP )
             return s;
 
     return -1;
 }

References CPoint(), and PointCount().

Referenced by PNS::MEANDER_PLACER_BASE::cutTunedLine(), PNS::DRAGGER::dragViaMarkObstacles(), PNS::DRAGGER::dragViaWalkaround(), PNS::NODE::FindLinesBetweenJoints(), PNS::DRAGGER::optimizeAndUpdateDraggedLine(), Split(), PNS::LINE::Walkaround(), and walkaround2().

◆ FindSegment()

int SHAPE_LINE_CHAIN::FindSegment ( const VECTOR2I & aP ) const

Function FindSegment()

Searches for segment containing point aP.

Parameters

aP	the point to be looked for

Returns: index of the correspoinding segment in the line chain or negative when not found.

Definition at line 466 of file shape_line_chain.cpp.

 {
     for( int s = 0; s < SegmentCount(); s++ )
         if( CSegment( s ).Distance( aP ) <= 1 )
             return s;
 
     return -1;
 }

References CSegment(), SEG::Distance(), and SegmentCount().

Referenced by PNS::MEANDER_PLACER_BASE::cutTunedLine(), and CADSTAR_SCH_ARCHIVE_LOADER::loadNets().

◆ Format()

const std::string SHAPE_LINE_CHAIN::Format ( ) const

overridevirtual

Reimplemented from SHAPE.

Definition at line 1184 of file shape_line_chain.cpp.

 {
     std::stringstream ss;
 
 
     ss << "SHAPE_LINE_CHAIN( { ";
     for( int i = 0; i < PointCount(); i++ )
     {
         ss << "VECTOR2I( " << m_points[i].x << ", " << m_points[i].y << ")";
         if( i != PointCount() -1 )
             ss << ", ";
     }
 
     ss << "}, " << ( m_closed ? "true" : "false" );
     ss << " );";
 
 
 
     return ss.str();
 
 
    /* fixme: arcs
     for( size_t i = 0; i < m_arcs.size(); i++ )
         ss << m_arcs[i].GetCenter().x << " " << m_arcs[i].GetCenter().y << " "
         << m_arcs[i].GetP0().x << " " << m_arcs[i].GetP0().y << " "
         << m_arcs[i].GetCentralAngle();
 
     return ss.str();*/
 }

References m_closed, m_points, and PointCount().

Referenced by PNS::SHOVE::shoveLineToHullSet().

◆ GenerateBBoxCache()

void SHAPE_LINE_CHAIN::GenerateBBoxCache ( ) const

inline

Definition at line 383 of file shape_line_chain.h.

     {
         m_bbox.Compute( m_points );
 
         if( m_width != 0 )
             m_bbox.Inflate( m_width );
     }

References BOX2< Vec >::Compute(), BOX2< Vec >::Inflate(), m_bbox, m_points, and m_width.

Referenced by SHAPE_POLY_SET::BuildBBoxCaches(), and ZONE_FILLER::buildThermalSpokes().

◆ GetIndexableSubshapeCount()

virtual size_t SHAPE_BASE::GetIndexableSubshapeCount ( ) const

inlinevirtualinherited

Reimplemented in SHAPE_POLY_SET, and SHAPE_COMPOUND.

Definition at line 104 of file shape.h.

104 { return 0; }

◆ GetIndexableSubshapes()

virtual void SHAPE_BASE::GetIndexableSubshapes ( std::vector< SHAPE * > & aSubshapes )

inlinevirtualinherited

Reimplemented in SHAPE_POLY_SET, and SHAPE_COMPOUND.

Definition at line 106 of file shape.h.

106 { }

Referenced by SHAPE_COMPOUND::AddShape(), and ROUTER_PREVIEW_ITEM::ViewDraw().

◆ GetPoint()

virtual const VECTOR2I SHAPE_LINE_CHAIN::GetPoint ( int aIndex ) const

inlineoverridevirtual

Implements SHAPE_LINE_CHAIN_BASE.

Definition at line 764 of file shape_line_chain.h.

764 { return CPoint(aIndex); }

SHAPE_LINE_CHAIN::CPoint

const VECTOR2I & CPoint(int aIndex) const

Function Point()

Definition: shape_line_chain.h:332

References CPoint().

Referenced by PNS::TOPOLOGY::AssembleTuningPath(), BuildFootprintPolygonOutlines(), PNS::LINE::dragCornerFree(), and CADSTAR_PCB_ARCHIVE_LOADER::getLineChainFromDrawsegments().

◆ GetPointCount()

virtual size_t SHAPE_LINE_CHAIN::GetPointCount ( ) const

inlineoverridevirtual

Implements SHAPE_LINE_CHAIN_BASE.

Definition at line 766 of file shape_line_chain.h.

766 { return PointCount(); }

SHAPE_LINE_CHAIN::PointCount

int PointCount() const

Function PointCount()

Definition: shape_line_chain.h:248

References PointCount().

◆ GetSegment()

virtual const SEG SHAPE_LINE_CHAIN::GetSegment ( int aIndex ) const

inlineoverridevirtual

Implements SHAPE_LINE_CHAIN_BASE.

Definition at line 765 of file shape_line_chain.h.

765 { return CSegment(aIndex); }

SHAPE_LINE_CHAIN::CSegment

const SEG CSegment(int aIndex) const

Function CSegment()

Definition: shape_line_chain.h:280

References CSegment().

Referenced by TransformArcToPolygon().

◆ GetSegmentCount()

virtual size_t SHAPE_LINE_CHAIN::GetSegmentCount ( ) const

inlineoverridevirtual

Implements SHAPE_LINE_CHAIN_BASE.

Definition at line 767 of file shape_line_chain.h.

767 { return SegmentCount(); }

SHAPE_LINE_CHAIN::SegmentCount

int SegmentCount() const

Function SegmentCount()

Definition: shape_line_chain.h:226

References SegmentCount().

Referenced by DRC_TEST_PROVIDER_EDGE_CLEARANCE::Run(), and TransformArcToPolygon().

◆ HasIndexableSubshapes()

virtual bool SHAPE_BASE::HasIndexableSubshapes ( ) const

inlinevirtualinherited

Reimplemented in SHAPE_POLY_SET, and SHAPE_COMPOUND.

Definition at line 99 of file shape.h.

     {
         return false;
     }

Referenced by SHAPE_COMPOUND::AddShape(), and ROUTER_PREVIEW_ITEM::ViewDraw().

◆ Insert() [1/2]

void SHAPE_LINE_CHAIN::Insert	(	size_t	aVertex,
		const VECTOR2I &	aP
	)

Definition at line 676 of file shape_line_chain.cpp.

 {
     if( aVertex < m_points.size() && m_shapes[aVertex] != SHAPE_IS_PT )
         convertArc( aVertex );
 
     m_points.insert( m_points.begin() + aVertex, aP );
     m_shapes.insert( m_shapes.begin() + aVertex, ssize_t( SHAPE_IS_PT ) );
 
     assert( m_shapes.size() == m_points.size() );
 }

References convertArc(), m_points, m_shapes, and SHAPE_IS_PT.

Referenced by PNS::TOPOLOGY::AssembleTuningPath(), PNS::LINE::dragCorner45(), and PNS::LINE::dragCornerFree().

◆ Insert() [2/2]

void SHAPE_LINE_CHAIN::Insert	(	size_t	aVertex,
		const SHAPE_ARC &	aArc
	)

Step 1: Find the position for the new arc in the existing arc vector

Step 2: Add the arc polyline points to the chain

Step 3: Add the vector of indices to the shape vector

Definition at line 688 of file shape_line_chain.cpp.

 {
     if( m_shapes[aVertex] != SHAPE_IS_PT )
         convertArc( aVertex );
 
     size_t arc_pos = m_arcs.size();
 
     for( auto arc_it = m_shapes.rbegin() ;
               arc_it != m_shapes.rend() + aVertex;
               arc_it++ )
     {
         if( *arc_it != SHAPE_IS_PT )
             arc_pos = ( *arc_it )++;
     }
 
     m_arcs.insert( m_arcs.begin() + arc_pos, aArc );
 
     auto& chain = aArc.ConvertToPolyline();
     m_points.insert( m_points.begin() + aVertex,
             chain.CPoints().begin(), chain.CPoints().end() );
 
     std::vector<size_t> new_points( chain.PointCount(), arc_pos );
     m_shapes.insert( m_shapes.begin() + aVertex, new_points.begin(), new_points.end() );
     assert( m_shapes.size() == m_points.size() );
 }

References convertArc(), SHAPE_ARC::ConvertToPolyline(), m_arcs, m_points, m_shapes, and SHAPE_IS_PT.

◆ Intersect() [1/2]

int SHAPE_LINE_CHAIN::Intersect	(	const SEG &	aSeg,
		INTERSECTIONS &	aIp
	)		const

Function Intersect()

Finds all intersection points between our line chain and the segment aSeg.

Parameters

aSeg	the segment chain to find intersections with
aIp	reference to a vector to store found intersections. Intersection points are sorted with increasing distances from point aSeg.a.

Returns: number of intersections found

Definition at line 733 of file shape_line_chain.cpp.

 {
     for( int s = 0; s < SegmentCount(); s++ )
     {
         OPT_VECTOR2I p = CSegment( s ).Intersect( aSeg );
 
         if( p )
         {
             INTERSECTION is;
             is.our = CSegment( s );
             is.their = aSeg;
             is.p = *p;
             aIp.push_back( is );
         }
     }
 
     compareOriginDistance comp( aSeg.A );
     sort( aIp.begin(), aIp.end(), comp );
 
     return aIp.size();
 }

References SEG::A, CSegment(), SEG::Intersect(), SHAPE_LINE_CHAIN::INTERSECTION::our, SHAPE_LINE_CHAIN::INTERSECTION::p, SegmentCount(), and SHAPE_LINE_CHAIN::INTERSECTION::their.

Referenced by PNS::OPTIMIZER::customBreakouts(), CN_ITEM::GetAnchor(), PNS::LINE_PLACER::handleSelfIntersections(), Intersects(), CADSTAR_SCH_ARCHIVE_LOADER::loadNets(), PNS::NODE::NearestObstacle(), POLYGON_GEOM_MANAGER::updateLeaderPoints(), PNS::LINE::Walkaround(), and walkaround2().

◆ Intersect() [2/2]

int SHAPE_LINE_CHAIN::Intersect	(	const SHAPE_LINE_CHAIN &	aChain,
		INTERSECTIONS &	aIp
	)		const

Function Intersect()

Finds all intersection points between our line chain and the line chain aChain.

Parameters

aChain	the line chain to find intersections with
aIp	reference to a vector to store found intersections. Intersection points are sorted with increasing path lengths from the starting point of aChain.

Returns: number of intersections found

Definition at line 774 of file shape_line_chain.cpp.

 {
     BOX2I bb_other = aChain.BBox();
 
     for( int s1 = 0; s1 < SegmentCount(); s1++ )
     {
         const SEG& a = CSegment( s1 );
         const BOX2I bb_cur( a.A, a.B - a.A );
 
         if( !bb_other.Intersects( bb_cur ) )
             continue;
 
         for( int s2 = 0; s2 < aChain.SegmentCount(); s2++ )
         {
             const SEG& b = aChain.CSegment( s2 );
             INTERSECTION is;
 
             if( a.Collinear( b ) )
             {
                 is.our = a;
                 is.their = b;
 
                 if( a.Contains( b.A ) ) { is.p = b.A; addIntersection(aIp, PointCount(), is); }
                 if( a.Contains( b.B ) ) { is.p = b.B; addIntersection(aIp, PointCount(), is); }
                 if( b.Contains( a.A ) ) { is.p = a.A; addIntersection(aIp, PointCount(), is); }
                 if( b.Contains( a.B ) ) { is.p = a.B; addIntersection(aIp, PointCount(), is); }
             }
             else
             {
                 OPT_VECTOR2I p = a.Intersect( b );
 
                 if( p )
                 {
                     is.p = *p;
                     is.our = a;
                     is.their = b;
                     addIntersection(aIp, PointCount(), is);
                 }
             }
         }
     }
 
     return aIp.size();
 }

References SEG::A, addIntersection(), SEG::B, BBox(), SEG::Collinear(), SEG::Contains(), CSegment(), SEG::Intersect(), BOX2< Vec >::Intersects(), SHAPE_LINE_CHAIN::INTERSECTION::our, SHAPE_LINE_CHAIN::INTERSECTION::p, PointCount(), SegmentCount(), and SHAPE_LINE_CHAIN::INTERSECTION::their.

◆ Intersects()

bool SHAPE_LINE_CHAIN::Intersects ( const SHAPE_LINE_CHAIN & aChain ) const

Definition at line 1231 of file shape_line_chain.cpp.

 {
     INTERSECTIONS dummy;
     return Intersect( aChain, dummy ) != 0;
 }

References dummy(), and Intersect().

Referenced by PNS::DIFF_PAIR::BuildInitial().

◆ isArc()

bool SHAPE_LINE_CHAIN::isArc ( size_t aSegment ) const

inline

A segment is part of an arc except in the special case of two arcs next to each other but without a shared vertex. Here there is a segment between the end of the first arc and the start of the second arc.

Definition at line 752 of file shape_line_chain.h.

     {
         return ( aSegment < m_shapes.size() - 1
                  && m_shapes[aSegment] != SHAPE_IS_PT
                  && m_shapes[aSegment] == m_shapes[aSegment + 1] );
     }

References m_shapes, and SHAPE_IS_PT.

Referenced by PNS::LINE::Is45Degree(), and PNS::OPTIMIZER::mergeStep().

◆ IsClosed()

bool SHAPE_LINE_CHAIN::IsClosed ( ) const

inlineoverridevirtual

Function IsClosed()

Returns: aClosed: true, when our line is closed.

Implements SHAPE_LINE_CHAIN_BASE.

Definition at line 197 of file shape_line_chain.h.

     {
         return m_closed;
     }

References m_closed.

Referenced by SHAPE_POLY_SET::AddOutline(), ZONE::AddPolygon(), BuildFootprintPolygonOutlines(), KIGFX::CAIRO_GAL_BASE::drawPoly(), KIGFX::OPENGL_GAL::DrawPolyline(), PLOTTER::PlotPoly(), PNS::pointInside2(), and SelfIntersecting().

◆ IsNull()

bool SHAPE::IsNull ( ) const

inlineinherited

Return true if the shape is a null shape.

Return values

true	if null :-)

Definition at line 150 of file shape.h.

     {
         return m_type == SH_NULL;
     }

References SHAPE_BASE::m_type, and SH_NULL.

◆ IsSolid()

bool SHAPE_LINE_CHAIN::IsSolid ( ) const

inlineoverridevirtual

Implements SHAPE.

Definition at line 725 of file shape_line_chain.h.

     {
         return false;
     }

◆ Length()

long long int SHAPE_LINE_CHAIN::Length ( ) const

Function Length()

Returns length of the line chain in Euclidean metric.

Returns: length of the line chain

Definition at line 232 of file shape_line_chain.cpp.

 {
     long long int l = 0;
 
     for( int i = 0; i < SegmentCount(); i++ )
         l += CSegment( i ).Length();
 
     return l;
 }

References CSegment(), SEG::Length(), and SegmentCount().

Referenced by PNS::COST_ESTIMATOR::Add(), PNS::LINE::dragSegment45(), PNS::OPTIMIZER::fanoutCleanup(), PNS::MEANDER_SHAPE::MaxTunableLength(), PNS::SHOVE::onCollidingArc(), PNS::SHOVE::onCollidingSegment(), PNS::COST_ESTIMATOR::Remove(), PNS::COST_ESTIMATOR::Replace(), PNS::LINE_PLACER::rhWalkOnly(), PNS::WALKAROUND::Route(), PNS::SHOVE::shoveLineFromLoneVia(), PNS::WALKAROUND::singleStep(), PNS::DIFF_PAIR::Skew(), PNS::DIFF_PAIR::TotalLength(), and PNS::DRAGGER::tryWalkaround().

◆ Mirror() [1/2]

void SHAPE_LINE_CHAIN::Mirror	(	bool	aX = `true`,
		bool	aY = `false`,
		const VECTOR2I &	aRef = `{ 0, 0 }`
	)

Mirrors the line points about y or x (or both)

Parameters

aX	If true, mirror about the y axis (flip X coordinate)
aY	If true, mirror about the x axis (flip Y coordinate)
aRef	sets the reference point about which to mirror

Definition at line 243 of file shape_line_chain.cpp.

 {
     for( auto& pt : m_points )
     {
         if( aX )
             pt.x = -pt.x + 2 * aRef.x;
 
         if( aY )
             pt.y = -pt.y + 2 * aRef.y;
     }
 
     for( auto& arc : m_arcs )
         arc.Mirror( aX, aY, aRef );
 }

References m_arcs, m_points, VECTOR2< T >::x, and VECTOR2< T >::y.

Referenced by PNS::MEANDER_SHAPE::genMeanderShape().

◆ Mirror() [2/2]

void SHAPE_LINE_CHAIN::Mirror ( const SEG & axis )

Mirrors the line points using an given axis.

Parameters

axis	Axis on which to mirror

Definition at line 259 of file shape_line_chain.cpp.

 {
     for( auto& pt : m_points )
         pt = axis.ReflectPoint( pt );
 
     for( auto& arc : m_arcs )
         arc.Mirror( axis );
 }

References m_arcs, m_points, and SEG::ReflectPoint().

◆ Move()

void SHAPE_LINE_CHAIN::Move ( const VECTOR2I & aVector )

inlineoverridevirtual

Implements SHAPE.

Definition at line 694 of file shape_line_chain.h.

     {
         for( auto& pt : m_points )
             pt += aVector;
 
         for( auto& arc : m_arcs )
             arc.Move( aVector );
     }

References m_arcs, and m_points.

Referenced by ZONE_FILLER::addHatchFillTypeOnZone(), PAD::BuildEffectiveShapes(), ZONE_FILLER::buildThermalSpokes(), PLACEFILE_GERBER_WRITER::CreatePlaceFile(), PCB_SELECTION_TOOL::hitTestDistance(), PCB_SHAPE::MakeEffectiveShapes(), and SHAPE_SIMPLE::Move().

◆ NearestPoint() [1/2]

const VECTOR2I SHAPE_LINE_CHAIN::NearestPoint	(	const VECTOR2I &	aP,
		bool	aAllowInternalShapePoints = `true`
	)		const

Finds a point on the line chain that is closest to point aP.

Parameters

aP	is the point to find
aAllowInternalShapePoints	if false will not return points internal to an arc (i.e. only the arc endpoints are possible candidates)

Returns: the nearest point.

Definition at line 1098 of file shape_line_chain.cpp.

 {
     int min_d = INT_MAX;
     int nearest = 0;
 
     for( int i = 0; i < SegmentCount(); i++ )
     {
         int d = CSegment( i ).Distance( aP );
 
         bool isInternalShapePoint = false;
 
         // An internal shape point here is everything after the start of an arc and before the
         // second-to-last vertex of the arc, because we are looking at segments here!
         if( i > 0 && i < SegmentCount() - 1 && m_shapes[i] >= 0 &&
                 ( ( m_shapes[i - 1] >= 0 && m_shapes[i - 1] == m_shapes[i] ) &&
                   ( m_shapes[i + 2] >= 0 && m_shapes[i + 2] == m_shapes[i] ) ) )
         {
             isInternalShapePoint = true;
         }
 
         if( ( d < min_d ) && ( aAllowInternalShapePoints || !isInternalShapePoint ) )
         {
             min_d = d;
             nearest = i;
         }
     }
 
     // Is this the start of an arc?  If so, return it directly
     if( !aAllowInternalShapePoints &&
         ( ( nearest == 0 && m_shapes[nearest] >= 0 ) ||
           ( m_shapes[nearest] >= 0 && m_shapes[nearest] != m_shapes[nearest - 1] ) ) )
     {
         return m_points[nearest];
     }
     else if( !aAllowInternalShapePoints && nearest < SegmentCount() &&
              m_shapes[nearest] >= 0 && m_shapes[nearest + 1] == m_shapes[nearest] )
     {
         // If the nearest segment is the last of the arc, just return the arc endpoint
         return m_points[nearest + 1];
     }
 
     return CSegment( nearest ).NearestPoint( aP );
 }

References CSegment(), SEG::Distance(), m_points, m_shapes, SEG::NearestPoint(), and SegmentCount().

Referenced by PCB_GRID_HELPER::computeAnchors(), PNS::MEANDER_PLACER_BASE::cutTunedLine(), CADSTAR_SCH_ARCHIVE_LOADER::loadBusses(), PNS::MoveDiagonal(), and PNS::DRAGGER::optimizeAndUpdateDraggedLine().

◆ NearestPoint() [2/2]

const VECTOR2I SHAPE_LINE_CHAIN::NearestPoint	(	const SEG &	aSeg,
		int &	dist
	)		const

Finds a point on the line chain that is closest to the line defined by the points of segment aSeg, also returns the distance.

Parameters

aSeg	Segment defining the line.
dist	reference receiving the distance to the nearest point.

Returns: the nearest point.

Definition at line 1144 of file shape_line_chain.cpp.

 {
     int nearest = 0;
 
     dist = INT_MAX;
     for( int i = 0; i < PointCount(); i++ )
     {
         int d = aSeg.LineDistance( CPoint( i ) );
 
         if( d < dist )
         {
             dist = d;
             nearest = i;
         }
     }
 
     return CPoint( nearest );
 }

References CPoint(), SEG::LineDistance(), and PointCount().

◆ NearestSegment()

int SHAPE_LINE_CHAIN::NearestSegment ( const VECTOR2I & aP ) const

Find the segment nearest the given point.

Parameters

aP	point to compare with

Returns: the index of the segment closest to the point

Definition at line 1164 of file shape_line_chain.cpp.

 {
     int min_d = INT_MAX;
     int nearest = 0;
 
     for( int i = 0; i < SegmentCount(); i++ )
     {
         int d = CSegment( i ).Distance( aP );
 
         if( d < min_d )
         {
             min_d = d;
             nearest = i;
         }
     }
 
     return nearest;
 }

References CSegment(), SEG::Distance(), and SegmentCount().

Referenced by SCH_SHEET_PIN::ConstrainOnEdge().

◆ NewFacet()

FACET * SHAPE::NewFacet ( )

inherited

Definition at line 705 of file wrlfacet.cpp.

 {
     FACET* fp = new FACET;
     facets.push_back( fp );
     return fp;
 }

References SHAPE::facets.

Referenced by WRL1FACESET::TranslateToSG(), X3DIFACESET::TranslateToSG(), and WRL2FACESET::TranslateToSG().

◆ NextShape()

int SHAPE_LINE_CHAIN::NextShape	(	int	aPointIndex,
		bool	aForwards = `true`
	)		const

Returns the vertex index of the next shape in the chain, or -1 if aPoint is in the last shape If aPoint is the start of a segment, this will be ( aPoint + 1 ).

If aPoint is part of an arc, this will be the index of the start of the next shape after the arc, in other words, the last point of the arc.

Parameters

aPointIndex	is a vertex in the chain
aForwards	is true if the next shape is desired, false for previous shape

Returns: the vertex index of the start of the next shape after aPoint's shape

Definition at line 515 of file shape_line_chain.cpp.

 {
     if( aPointIndex < 0 )
         aPointIndex += PointCount();
 
     // First or last point?
     if( ( aForwards && aPointIndex == PointCount() - 1 ) ||
         ( !aForwards && aPointIndex == 0 ) )
     {
         return -1;
     }
 
     int delta = aForwards ? 1 : -1;
 
     if( m_shapes[aPointIndex] == SHAPE_IS_PT )
         return aPointIndex + delta;
 
     int arcIndex = m_shapes[aPointIndex];
     int arcStart = aPointIndex;
 
     while( aPointIndex < static_cast<int>( m_shapes.size() ) && m_shapes[aPointIndex] == arcIndex )
         aPointIndex += delta;
 
     // We want the last vertex of the arc if the initial point was the start of one
     // Well-formed arcs should generate more than one point to travel above
     if( aPointIndex - arcStart > 1 )
         aPointIndex -= delta;
 
     return aPointIndex;
 }

References m_shapes, PointCount(), and SHAPE_IS_PT.

Referenced by PrevShape().

◆ operator!=()

bool SHAPE_LINE_CHAIN::operator!= ( const SHAPE_LINE_CHAIN & aRhs ) const

inline

Definition at line 678 of file shape_line_chain.h.

     {
         if( PointCount() != aRhs.PointCount() )
             return true;
 
         for( int i = 0; i < PointCount(); i++ )
         {
             if( CPoint( i ) != aRhs.CPoint( i ) )
                 return true;
         }
 
         return false;
     }

References CPoint(), and PointCount().

◆ operator=()

SHAPE_LINE_CHAIN& SHAPE_LINE_CHAIN::operator= ( const SHAPE_LINE_CHAIN & )

default

◆ Parse()

bool SHAPE_LINE_CHAIN::Parse ( std::stringstream & aStream )

overridevirtual

Reimplemented from SHAPE.

Definition at line 1243 of file shape_line_chain.cpp.

 {
     size_t n_pts;
     size_t n_arcs;
 
     m_points.clear();
     aStream >> n_pts;
 
     // Rough sanity check, just make sure the loop bounds aren't absolutely outlandish
     if( n_pts > aStream.str().size() )
         return false;
 
     aStream >> m_closed;
     aStream >> n_arcs;
 
     if( n_arcs > aStream.str().size() )
         return false;
 
     for( size_t i = 0; i < n_pts; i++ )
     {
         int x, y;
         ssize_t ind;
         aStream >> x;
         aStream >> y;
         m_points.emplace_back( x, y );
 
         aStream >> ind;
         m_shapes.push_back( ind );
     }
 
     for( size_t i = 0; i < n_arcs; i++ )
     {
         VECTOR2I p0, pc;
         double angle;
 
         aStream >> pc.x;
         aStream >> pc.y;
         aStream >> p0.x;
         aStream >> p0.y;
         aStream >> angle;
 
         m_arcs.emplace_back( pc, p0, angle );
     }
 
     return true;
 }

References PNS::angle(), m_arcs, m_closed, m_points, m_shapes, VECTOR2< T >::x, and VECTOR2< T >::y.

◆ PathLength()

int SHAPE_LINE_CHAIN::PathLength ( const VECTOR2I & aP ) const

Function PathLength()

Computes the walk path length from the beginning of the line chain and the point aP belonging to our line.

Returns: : path length in Euclidean metric or -1 if aP does not belong to the line chain.

Definition at line 820 of file shape_line_chain.cpp.

 {
     int sum = 0;
 
     for( int i = 0; i < SegmentCount(); i++ )
     {
         const SEG seg = CSegment( i );
         int d = seg.Distance( aP );
 
         if( d <= 1 )
         {
             sum += ( aP - seg.A ).EuclideanNorm();
             return sum;
         }
         else
             sum += seg.Length();
     }
 
     return -1;
 }

References SEG::A, CSegment(), SEG::Distance(), EuclideanNorm(), SEG::Length(), and SegmentCount().

Referenced by PNS::NODE::NearestObstacle().

◆ PointAlong()

const VECTOR2I SHAPE_LINE_CHAIN::PointAlong ( int aPathLength ) const

Definition at line 1291 of file shape_line_chain.cpp.

 {
     int total = 0;
 
     if( aPathLength == 0 )
         return CPoint( 0 );
 
     for( int i = 0; i < SegmentCount(); i++ )
     {
         const SEG& s = CSegment( i );
         int l = s.Length();
 
         if( total + l >= aPathLength )
         {
             VECTOR2I d( s.B - s.A );
             return s.A + d.Resize( aPathLength - total );
         }
 
         total += l;
     }
 
     return CPoint( -1 );
 }

References SEG::A, SEG::B, CPoint(), CSegment(), SEG::Length(), VECTOR2< T >::Resize(), and SegmentCount().

◆ PointCount()

int SHAPE_LINE_CHAIN::PointCount ( ) const

inline

Function PointCount()

Returns the number of points (vertices) in this line chain

Returns: number of points

Definition at line 248 of file shape_line_chain.h.

     {
         return m_points.size();
     }

References m_points.

Referenced by POLYGON_GEOM_MANAGER::AddPoint(), SHAPE_LINE_CHAIN::POINT_INSIDE_TRACKER::AddPolyline(), BOARD_ADAPTER::addSolidAreasShapes(), TRIANGLE_DISPLAY_LIST::AddToMiddleContourns(), CN_ZONE_LAYER::AnchorCount(), Append(), PNS::LINE::AppendVia(), ArePolylineEndPointsNearCircle(), ArePolylineMidPointsNearCircle(), PNS::NODE::AssembleLine(), PNS::TOPOLOGY::AssembleTuningPath(), BOOST_AUTO_TEST_CASE(), BuildConvexHull(), PAD::BuildEffectivePolygon(), PAD::BuildEffectiveShapes(), PCB_SHAPE::BuildPolyPointsList(), PNS::LINE::ChangedArea(), PNS::KEEP_TOPOLOGY_CONSTRAINT::Check(), CheckClearance(), CN_VISITOR::checkZoneZoneConnection(), CLastPoint(), PNS::LINE::ClipVertexRange(), convertToClipper(), PNS::coupledBypass(), CPoint(), PolygonTriangulation::createList(), CreatePadsShapesSection(), PLACEFILE_GERBER_WRITER::CreatePlaceFile(), POLYGON_GEOM_MANAGER::DeleteLastCorner(), DIALOG_PAD_PRIMITIVE_POLY_PROPS::doValidate(), PNS::dragCornerInternal(), PNS::LINE::dragSegment45(), KIGFX::GERBVIEW_PAINTER::draw(), APERTURE_MACRO::DrawApertureMacroShape(), KIGFX::CAIRO_GAL_BASE::drawPoly(), KIGFX::OPENGL_GAL::DrawPolygon(), KIGFX::OPENGL_GAL::DrawPolyline(), KIGFX::PREVIEW::POLYGON_ITEM::drawPreviewShape(), EXPORTER_PCB_VRML::ExportVrmlBoard(), EXPORTER_PCB_VRML::ExportVrmlPolygonSet(), DSN::SPECCTRA_DB::fillBOUNDARY(), AR_AUTOPLACER::fillMatrix(), Find(), PNS::LINE_PLACER::FixRoute(), GERBER_PLOTTER::FlashPadChamferRoundRect(), PSLIKE_PLOTTER::FlashPadCustom(), DXF_PLOTTER::FlashPadCustom(), HPGL_PLOTTER::FlashPadCustom(), GERBER_PLOTTER::FlashPadCustom(), PSLIKE_PLOTTER::FlashPadRoundRect(), DXF_PLOTTER::FlashPadRoundRect(), HPGL_PLOTTER::FlashPadRoundRect(), GERBER_PLOTTER::FlashPadRoundRect(), PCB_IO::format(), Format(), CADSTAR_PCB_ARCHIVE_LOADER::getLineChainFromDrawsegments(), SHAPE_SIMPLE::GetPointCount(), GetPointCount(), CADSTAR_PCB_ARCHIVE_LOADER::getPolySetFromCadstarShape(), PNS::MOUSE_TRAIL_TRACER::GetPosture(), SHAPE_POLY_SET::GetRelativeIndices(), PNS::MOUSE_TRAIL_TRACER::GetTrailLeadVector(), PNS::LINE_PLACER::handlePullback(), PNS::LINE_PLACER::handleSelfIntersections(), DS_DRAW_ITEM_POLYPOLYGONS::HitTest(), Intersect(), POLYGON_GEOM_MANAGER::IsPolygonInProgress(), PCB_SHAPE::IsPolyShapeValid(), POLYGON_GEOM_MANAGER::IsSelfIntersecting(), FABMASTER::loadFootprints(), FABMASTER::loadGraphics(), FABMASTER::loadPolygon(), FABMASTER::loadZone(), DSN::SPECCTRA_DB::makePADSTACK(), PNS::LINE_PLACER::mergeHead(), PNS::OPTIMIZER::mergeObtuse(), NearestPoint(), POLYGON_GEOM_MANAGER::NewPointClosesOutline(), NextShape(), operator!=(), BOOST_TEST_PRINT_NAMESPACE_OPEN::print_log_value< SHAPE_LINE_CHAIN >::operator()(), PNS::LINE_PLACER::optimizeTailHeadTransition(), BITMAPCONV_INFO::outputOnePolygon(), ALTIUM_PCB::ParsePolygons6Data(), ALTIUM_PCB::ParseShapeBasedRegions6Data(), PlotDrawingSheet(), BRDITEMS_PLOTTER::PlotFilledAreas(), PLOTTER::PlotPoly(), SHAPE_SIMPLE::PointCount(), PNS::LINE::PointCount(), PNS::pointInside2(), polygon_Convert(), GERBER_DRAW_ITEM::PrintGerberPoly(), DS_DRAW_ITEM_POLYPOLYGONS::PrintWsItem(), Remove(), RemoveShape(), Replace(), PNS::OPTIMIZER::runSmartPads(), SetPoint(), KIGFX::PREVIEW::POLYGON_ITEM::SetPoints(), PNS::shovedArea(), PNS::SHOVE::shoveLineFromLoneVia(), PNS::SHOVE::shoveLineToHullSet(), Simplify(), Slice(), Split(), POLYGON_GEOM_MANAGER::updateLeaderPoints(), PNS::LINE::Walkaround(), walkaround2(), HYPERLYNX_EXPORTER::writeNetObjects(), GBR_TO_PCB_EXPORTER::writePcbPolygon(), and GBR_TO_PCB_EXPORTER::writePcbZoneItem().

◆ PointInside()

bool SHAPE_LINE_CHAIN_BASE::PointInside	(	const VECTOR2I &	aPt,
		int	aAccuracy = `0`,
		bool	aUseBBoxCache = `false`
	)		const

inherited

Check if point aP lies inside a polygon (any type) defined by the line chain.

For closed shapes only.

Parameters

aPt	point to check
aUseBBoxCache	gives better peformance if the bounding box caches have been generated.

Returns: true if the point is inside the shape (edge is not treated as being inside).

To check for interior points, we draw a line in the positive x direction from the point. If it intersects an even number of segments, the point is outside the line chain (it had to first enter and then exit). Otherwise, it is inside the chain.

Note: slope might be denormal here in the case of a horizontal line but we require our y to move from above to below the point (or vice versa)

Note: we open-code CPoint() here so that we don't end up calculating the size of the vector number-of-points times. This has a non-trivial impact on zone fill times.

Definition at line 842 of file shape_line_chain.cpp.

 {
     /*
      * Don't check the bounding box unless it's cached.  Building it is about the same speed as
      * the rigorous test below and so just slows things down by doing potentially two tests.
      */
     //if( aUseBBoxCache && !m_bbox.Contains( aPt ) )
         //return false;
 
     // fixme: bbox cache...
 
     if( !IsClosed() || GetPointCount() < 3 )
         return false;
 
     bool inside = false;
 
     int pointCount = GetPointCount();
 
     for( int i = 0; i < pointCount; )
     {
         const auto p1 = GetPoint( i++ );
         const auto p2 = GetPoint( i == pointCount ? 0 : i );
         const auto diff = p2 - p1;
 
         if( diff.y != 0 )
         {
             const int d = rescale( diff.x, ( aPt.y - p1.y ), diff.y );
 
             if( ( ( p1.y > aPt.y ) != ( p2.y > aPt.y ) ) && ( aPt.x - p1.x < d ) )
                 inside = !inside;
         }
     }
 
     // If accuracy is <= 1 (nm) then we skip the accuracy test for performance.  Otherwise
     // we use "OnEdge(accuracy)" as a proxy for "Inside(accuracy)".
     if( aAccuracy <= 1 )
         return inside;
     else
         return inside || PointOnEdge( aPt, aAccuracy );
 }

References SHAPE_LINE_CHAIN_BASE::GetPoint(), SHAPE_LINE_CHAIN_BASE::GetPointCount(), SHAPE_LINE_CHAIN_BASE::IsClosed(), SHAPE_LINE_CHAIN_BASE::PointOnEdge(), rescale(), VECTOR2< T >::x, and VECTOR2< T >::y.

Referenced by Collide(), SHAPE_LINE_CHAIN_BASE::Collide(), POLY_GRID_PARTITION::containsPoint(), SHAPE_POLY_SET::containsSingle(), LIB_POLYLINE::HitTest(), ZONE::HitTestCutout(), MARKER_BASE::HitTestMarker(), SHAPE_LINE_CHAIN_BASE::SquaredDistance(), PNS::LINE::Walkaround(), and walkaround2().

◆ PointOnEdge()

bool SHAPE_LINE_CHAIN_BASE::PointOnEdge	(	const VECTOR2I &	aP,
		int	aAccuracy = `0`
	)		const

inherited

Check if point aP lies on an edge or vertex of the line chain.

Parameters

aP	point to check

Returns: true if the point lies on the edge.

Definition at line 896 of file shape_line_chain.cpp.

 {
     return EdgeContainingPoint( aPt, aAccuracy ) >= 0;
 }

References SHAPE_LINE_CHAIN_BASE::EdgeContainingPoint().

Referenced by LIB_POLYLINE::HitTest(), FABMASTER::loadZones(), SHAPE_LINE_CHAIN_BASE::PointInside(), PNS::LINE::Walkaround(), and walkaround2().

◆ PrevShape()

int SHAPE_LINE_CHAIN::PrevShape ( int aPointIndex ) const

inline

Definition at line 302 of file shape_line_chain.h.

     {
         return NextShape( aPointIndex, false );
     }

References NextShape().

Referenced by PNS::LINE_PLACER::handlePullback().

◆ Remove() [1/2]

void SHAPE_LINE_CHAIN::Remove	(	int	aStartIndex,
		int	aEndIndex
	)

Function Remove()

Removes the range of points [start_index, end_index] from the line chain.

Parameters

aStartIndex	start of the point range to be replaced (inclusive)
aEndIndex	end of the point range to be replaced (inclusive)

Definition at line 360 of file shape_line_chain.cpp.

 {
     assert( m_shapes.size() == m_points.size() );
 
     if( aEndIndex < 0 )
         aEndIndex += PointCount();
 
     if( aStartIndex < 0 )
         aStartIndex += PointCount();
 
     if( aStartIndex >= PointCount() )
         return;
 
     aEndIndex = std::min( aEndIndex, PointCount() );
     std::set<size_t> extra_arcs;
 
     // Remove any overlapping arcs in the point range
     for( int i = aStartIndex; i < aEndIndex; i++ )
     {
         if( m_shapes[i] != SHAPE_IS_PT )
             extra_arcs.insert( m_shapes[i] );
     }
 
     for( auto arc : extra_arcs )
         convertArc( arc );
 
     m_shapes.erase( m_shapes.begin() + aStartIndex, m_shapes.begin() + aEndIndex + 1 );
     m_points.erase( m_points.begin() + aStartIndex, m_points.begin() + aEndIndex + 1 );
     assert( m_shapes.size() == m_points.size() );
 }

References convertArc(), m_points, m_shapes, PointCount(), and SHAPE_IS_PT.

Referenced by POLYGON_GEOM_MANAGER::AddPoint(), PNS::TOPOLOGY::AssembleTuningPath(), PNS::LINE_PLACER::buildInitialLine(), PNS::LINE::ClipToNearestObstacle(), POLYGON_GEOM_MANAGER::DeleteLastCorner(), PNS::DIFF_PAIR_PLACER::FixRoute(), PNS::LINE_PLACER::handleSelfIntersections(), PNS::OPTIMIZER::mergeColinear(), PNS::LINE_PLACER::mergeHead(), PNS::LINE_PLACER::reduceTail(), Remove(), RemoveShape(), Replace(), and PNS::WALKAROUND::Route().

◆ Remove() [2/2]

void SHAPE_LINE_CHAIN::Remove ( int aIndex )

inline

Function Remove() removes the aIndex-th point from the line chain.

Parameters

aIndex is the index of the point to be removed.

Definition at line 508 of file shape_line_chain.h.

     {
         Remove( aIndex, aIndex );
     }

References Remove().

◆ RemoveShape()

void SHAPE_LINE_CHAIN::RemoveShape ( int aPointIndex )

Removes the shape at the given index from the line chain.

If the given index is inside an arc, the entire arc will be removed. Otherwise this is equivalent to Remove( aPointIndex ).

Parameters

aPointIndex is the index of the point to remove

Definition at line 547 of file shape_line_chain.cpp.

 {
     if( aPointIndex < 0 )
         aPointIndex += PointCount();
 
     if( m_shapes[aPointIndex] == SHAPE_IS_PT )
     {
         Remove( aPointIndex );
         return;
     }
 
     int start  = aPointIndex;
     int end    = aPointIndex;
     int arcIdx = m_shapes[aPointIndex];
 
     while( start >= 0 && m_shapes[start] == arcIdx )
         start--;
 
     while( end < static_cast<int>( m_shapes.size() ) - 1 && m_shapes[end] == arcIdx )
         end++;
 
     Remove( start, end );
 }

References m_shapes, PointCount(), Remove(), and SHAPE_IS_PT.

Referenced by PNS::LINE_PLACER::handlePullback().

◆ Replace() [1/2]

void SHAPE_LINE_CHAIN::Replace	(	int	aStartIndex,
		int	aEndIndex,
		const VECTOR2I &	aP
	)

Function Replace()

Replaces points with indices in range [start_index, end_index] with a single point aP.

Parameters

aStartIndex	start of the point range to be replaced (inclusive)
aEndIndex	end of the point range to be replaced (inclusive)
aP	replacement point

Definition at line 269 of file shape_line_chain.cpp.

 {
     if( aEndIndex < 0 )
         aEndIndex += PointCount();
 
     if( aStartIndex < 0 )
         aStartIndex += PointCount();
 
     aEndIndex = std::min( aEndIndex, PointCount() - 1 );
 
     // N.B. This works because convertArc changes m_shapes on the first run
     for( int ind = aStartIndex; ind <= aEndIndex; ind++ )
     {
         if( m_shapes[ind] != SHAPE_IS_PT )
             convertArc( ind );
     }
 
     if( aStartIndex == aEndIndex )
         m_points[aStartIndex] = aP;
     else
     {
         m_points.erase( m_points.begin() + aStartIndex + 1, m_points.begin() + aEndIndex + 1 );
         m_points[aStartIndex] = aP;
 
         m_shapes.erase( m_shapes.begin() + aStartIndex + 1, m_shapes.begin() + aEndIndex + 1 );
     }
 
     assert( m_shapes.size() == m_points.size() );
 }

References convertArc(), m_points, m_shapes, PointCount(), and SHAPE_IS_PT.

Referenced by PNS::TOPOLOGY::AssembleTuningPath(), PNS::coupledBypass(), PNS::LINE::dragSegment45(), CADSTAR_SCH_ARCHIVE_LOADER::loadNets(), PNS::OPTIMIZER::mergeDpStep(), PNS::OPTIMIZER::mergeObtuse(), PNS::LINE_PLACER::optimizeTailHeadTransition(), and PNS::Tighten().

◆ Replace() [2/2]

void SHAPE_LINE_CHAIN::Replace	(	int	aStartIndex,
		int	aEndIndex,
		const SHAPE_LINE_CHAIN &	aLine
	)

Function Replace()

Replaces points with indices in range [start_index, end_index] with the points from line chain aLine.

Parameters

aStartIndex	start of the point range to be replaced (inclusive)
aEndIndex	end of the point range to be replaced (inclusive)
aLine	replacement line chain.

Definition at line 300 of file shape_line_chain.cpp.

 {
     if( aEndIndex < 0 )
         aEndIndex += PointCount();
 
     if( aStartIndex < 0 )
         aStartIndex += PointCount();
 
     // We only process lines in order in this house
     wxASSERT( aStartIndex <= aEndIndex );
     wxASSERT( aEndIndex < m_points.size() );
 
     SHAPE_LINE_CHAIN newLine = aLine;
 
     // It's possible that the start or end lands on the end of an arc.  If so, we'd better have a
     // replacement line that matches up to the same coordinates, as we can't break the arc(s).
     ssize_t startShape = m_shapes[aStartIndex];
     ssize_t endShape   = m_shapes[aEndIndex];
 
     if( startShape >= 0 )
     {
         wxASSERT( !newLine.PointCount() ||
                   ( newLine.m_points.front() == m_points[aStartIndex] &&
                   aStartIndex < m_points.size() - 1 ) );
         aStartIndex++;
         newLine.Remove( 0 );
     }
 
     if( endShape >= 0 )
     {
         wxASSERT( !newLine.PointCount() ||
                   ( newLine.m_points.back() == m_points[aEndIndex] && aEndIndex > 0 ) );
         aEndIndex--;
         newLine.Remove( -1 );
     }
 
     Remove( aStartIndex, aEndIndex );
 
     if( !aLine.PointCount() )
         return;
 
     // The total new arcs index is added to the new arc indices
     size_t               prev_arc_count = m_arcs.size();
     std::vector<ssize_t> new_shapes     = newLine.m_shapes;
 
     for( ssize_t& shape : new_shapes )
     {
         if( shape >= 0 )
             shape += prev_arc_count;
     }
 
     m_shapes.insert( m_shapes.begin() + aStartIndex, new_shapes.begin(), new_shapes.end() );
     m_points.insert( m_points.begin() + aStartIndex, newLine.m_points.begin(),
                      newLine.m_points.end() );
     m_arcs.insert( m_arcs.end(), newLine.m_arcs.begin(), newLine.m_arcs.end() );
 
     assert( m_shapes.size() == m_points.size() );
 }

References m_arcs, m_points, m_shapes, PointCount(), and Remove().

◆ Reverse()

const SHAPE_LINE_CHAIN SHAPE_LINE_CHAIN::Reverse ( ) const

Function Reverse()

Reverses point order in the line chain.

Returns: line chain with reversed point order (original A-B-C-D: returned D-C-B-A)

Definition at line 209 of file shape_line_chain.cpp.

 {
     SHAPE_LINE_CHAIN a( *this );
 
     reverse( a.m_points.begin(), a.m_points.end() );
     reverse( a.m_shapes.begin(), a.m_shapes.end() );
     reverse( a.m_arcs.begin(), a.m_arcs.end() );
 
     for( auto& sh : a.m_shapes )
     {
         if( sh != SHAPE_IS_PT )
             sh = a.m_arcs.size() - sh - 1;
     }
 
     for( SHAPE_ARC& arc : a.m_arcs )
         arc.Reverse();
 
     a.m_closed = m_closed;
 
     return a;
 }

References m_arcs, m_closed, m_points, m_shapes, SHAPE_ARC::Reverse(), and SHAPE_IS_PT.

Referenced by PNS::ArcHull(), PNS::KEEP_TOPOLOGY_CONSTRAINT::Check(), PNS::SHOVE::checkShoveDirection(), PNS::coupledBypass(), PNS::MEANDER_PLACER_BASE::cutTunedLine(), PNS::LINE::dragCorner45(), PNS::MOUSE_TRAIL_TRACER::GetPosture(), CADSTAR_SCH_ARCHIVE_LOADER::loadNets(), PNS::DP_GATEWAY::Reverse(), PNS::LINE::Reverse(), PNS::SegmentHull(), PNS::OPTIMIZER::smartPadsSingle(), PNS::LINE::Walkaround(), and walkaround2().

◆ Rotate()

void SHAPE_LINE_CHAIN::Rotate	(	double	aAngle,
		const VECTOR2I &	aCenter = `VECTOR2I( 0, 0 )`
	)

overridevirtual

Function Rotate rotates all vertices by a given angle.

Parameters

aCenter	is the rotation center
aAngle	rotation angle in radians

Implements SHAPE.

Definition at line 141 of file shape_line_chain.cpp.

 {
     for( auto& pt : m_points )
     {
         pt -= aCenter;
         pt = pt.Rotate( aAngle );
         pt += aCenter;
     }
 
     for( auto& arc : m_arcs )
         arc.Rotate( aAngle, aCenter );
 }

References m_arcs, m_points, and VECTOR2< T >::Rotate().

Referenced by PAD::BuildEffectiveShapes(), ZONE_FILLER::buildThermalSpokes(), PLACEFILE_GERBER_WRITER::CreatePlaceFile(), and PCB_SHAPE::MakeEffectiveShapes().

◆ Segment()

SEG SHAPE_LINE_CHAIN::Segment ( int aIndex )

inline

Function Segment()

Returns a copy of the aIndex-th segment in the line chain.

Parameters

aIndex index of the segment in the line chain. Negative values are counted from the end (i.e. -1 means the last segment in the line chain)

Returns: SEG - aIndex-th segment in the line chain

Definition at line 261 of file shape_line_chain.h.

     {
         if( aIndex < 0 )
             aIndex += SegmentCount();
 
         if( aIndex == (int)( m_points.size() - 1 ) && m_closed )
             return SEG( m_points[aIndex], m_points[0], aIndex );
         else
             return SEG( m_points[aIndex], m_points[aIndex + 1], aIndex );
     }

References m_closed, m_points, and SegmentCount().

Referenced by POLY_GRID_PARTITION::build(), BuildFootprintPolygonOutlines(), POLY_GRID_PARTITION::checkClearance(), PNS::DIFF_PAIR::CoupledSegmentPairs(), BOARD_ADAPTER::createPadWithClearance(), KIGFX::PCB_PAINTER::draw(), findEndSegments(), CADSTAR_SCH_ARCHIVE_LOADER::loadShapeVertices(), PCB_SHAPE::MakeEffectiveShapes(), PNS::WALKAROUND::Route(), and unfracture().

◆ SegmentCount()

int SHAPE_LINE_CHAIN::SegmentCount ( ) const

inline

Function SegmentCount()

Returns number of segments in this line chain.

Returns: number of segments

Definition at line 226 of file shape_line_chain.h.

     {
         int c = m_points.size() - 1;
         if( m_closed )
             c++;
 
         return std::max( 0, c );
     }

References m_closed, and m_points.

Referenced by PNS::MOUSE_TRAIL_TRACER::AddTrailPoint(), PNS::NODE::AssembleLine(), POLY_GRID_PARTITION::build(), BuildFootprintPolygonOutlines(), PNS::LINE_PLACER::buildInitialLine(), PNS::PRESERVE_VERTEX_CONSTRAINT::Check(), CheckClearance(), PNS::NODE::CheckColliding(), PNS::DIFF_PAIR::CheckConnectionAngle(), PNS::checkGap(), PNS::MEANDERED_LINE::CheckSelfIntersections(), PNS::closestProjectedPoint(), PCB_GRID_HELPER::computeAnchors(), PNS::COST_ESTIMATOR::CornerCost(), PNS::LINE::CountCorners(), PNS::DIFF_PAIR::CoupledLength(), PNS::DIFF_PAIR::CoupledSegmentPairs(), BOARD_ADAPTER::createPadWithClearance(), CSegment(), PNS::LINE::dragCorner45(), PNS::dragCornerInternal(), PNS::LINE::dragSegment45(), KIGFX::PCB_PAINTER::draw(), KIGFX::OPENGL_GAL::DrawPolygon(), PNS::DIFF_PAIR::Empty(), PNS::findCoupledVertices(), findEndSegments(), FindSegment(), PNS::DIFF_PAIR_PLACER::FixRoute(), PNS::LINE_PLACER::FixRoute(), PCB_SHAPE::GetLength(), SHAPE_SIMPLE::GetSegmentCount(), GetSegmentCount(), PNS::LINE_PLACER::handlePullback(), PNS::DP_MEANDER_PLACER::HasPlacedAnything(), PNS::DIFF_PAIR_PLACER::HasPlacedAnything(), Intersect(), PNS::LINE::Is45Degree(), Length(), CADSTAR_SCH_ARCHIVE_LOADER::loadShapeVertices(), PCB_SHAPE::MakeEffectiveShapes(), PNS::OPTIMIZER::mergeColinear(), PNS::OPTIMIZER::mergeDpSegments(), PNS::OPTIMIZER::mergeDpStep(), PNS::OPTIMIZER::mergeFull(), PNS::OPTIMIZER::mergeObtuse(), PNS::OPTIMIZER::mergeStep(), PNS::NODE::NearestObstacle(), NearestPoint(), NearestSegment(), PathLength(), PointAlong(), PNS::pointInside2(), KIGFX::VIEW_OVERLAY::Polyline(), PNS::LINE_PLACER::reduceTail(), PNS::WALKAROUND::Route(), Segment(), PNS::LINE::SegmentCount(), segmentCrossesHullBoundary(), SelfIntersecting(), PNS::OPTIMIZER::smartPadsSingle(), PNS::LINE::snapDraggedCorner(), PNS::LINE::snapToNeighbourSegments(), Split(), POLYGON_GEOM_MANAGER::updateLeaderPoints(), PNS::LINE::Walkaround(), walkaround2(), and HYPERLYNX_EXPORTER::writeBoardInfo().

◆ SelfIntersecting()

const OPT< SHAPE_LINE_CHAIN::INTERSECTION > SHAPE_LINE_CHAIN::SelfIntersecting ( ) const

Function SelfIntersecting()

Checks if the line chain is self-intersecting.

Returns: (optional) first found self-intersection point.

Definition at line 950 of file shape_line_chain.cpp.

 {
     for( int s1 = 0; s1 < SegmentCount(); s1++ )
     {
         for( int s2 = s1 + 1; s2 < SegmentCount(); s2++ )
         {
             const VECTOR2I s2a = CSegment( s2 ).A, s2b = CSegment( s2 ).B;
 
             if( s1 + 1 != s2 && CSegment( s1 ).Contains( s2a ) )
             {
                 INTERSECTION is;
                 is.our = CSegment( s1 );
                 is.their = CSegment( s2 );
                 is.p = s2a;
                 return is;
             }
             else if( CSegment( s1 ).Contains( s2b ) &&
                      // for closed polylines, the ending point of the
                      // last segment == starting point of the first segment
                      // this is a normal case, not self intersecting case
                      !( IsClosed() && s1 == 0 && s2 == SegmentCount()-1 ) )
             {
                 INTERSECTION is;
                 is.our = CSegment( s1 );
                 is.their = CSegment( s2 );
                 is.p = s2b;
                 return is;
             }
             else
             {
                 OPT_VECTOR2I p = CSegment( s1 ).Intersect( CSegment( s2 ), true );
 
                 if( p )
                 {
                     INTERSECTION is;
                     is.our = CSegment( s1 );
                     is.their = CSegment( s2 );
                     is.p = *p;
                     return is;
                 }
             }
         }
     }
 
     return OPT<SHAPE_LINE_CHAIN::INTERSECTION>();
 }

References SEG::A, SEG::B, CSegment(), SEG::Intersect(), IsClosed(), SHAPE_LINE_CHAIN::INTERSECTION::our, SHAPE_LINE_CHAIN::INTERSECTION::p, SegmentCount(), and SHAPE_LINE_CHAIN::INTERSECTION::their.

Referenced by PNS::DIFF_PAIR::BuildInitial(), PNS::clipToLoopStart(), and DIALOG_PAD_PRIMITIVE_POLY_PROPS::doValidate().

◆ SetClosed()

void SHAPE_LINE_CHAIN::SetClosed ( bool aClosed )

inline

Function SetClosed()

Marks the line chain as closed (i.e. with a segment connecting the last point with the first point).

Parameters

aClosed whether the line chain is to be closed or not.

Definition at line 187 of file shape_line_chain.h.

     {
         m_closed = aClosed;
     }

References m_closed.

Referenced by ZONE_FILLER::addHatchFillTypeOnZone(), ZONE::AddPolygon(), PNS::ArcHull(), POLY_GRID_PARTITION::build(), buildBoardBoundingBoxPoly(), BuildFootprintPolygonOutlines(), KI_TEST::BuildRectChain(), ZONE_FILLER::buildThermalSpokes(), SHAPE_POLY_SET::chamferFilletPolygon(), PNS::KEEP_TOPOLOGY_CONSTRAINT::Check(), CN_ZONE_LAYER::CN_ZONE_LAYER(), KI_TEST::CommonTestData::CommonTestData(), PCB_GRID_HELPER::computeAnchors(), PNS::ConvexHull(), CovertPolygonToBlocks(), PLACEFILE_GERBER_WRITER::CreatePlaceFile(), KIGFX::GERBVIEW_PAINTER::draw(), SHAPE_POLY_SET::fractureSingle(), CADSTAR_PCB_ARCHIVE_LOADER::getLineChainFromDrawsegments(), PNS::MOUSE_TRAIL_TRACER::GetPosture(), HelperShapeLineChainFromAltiumVertices(), LIB_POLYLINE::HitTest(), IteratorFixture::IteratorFixture(), CONVERT_TOOL::makePolysFromRects(), CONVERT_TOOL::makePolysFromSegs(), GEOM_TEST::MakeSquarePolyLine(), SHAPE_POLY_SET::NewHole(), SHAPE_POLY_SET::NewOutline(), PNS::OctagonalHull(), SHAPE_RECT::Outline(), EAGLE_PLUGIN::packagePolygon(), SHAPE_POLY_SET::Parse(), ALTIUM_PCB::ParseRegions6Data(), BRDITEMS_PLOTTER::PlotFootprintGraphicItem(), polygonArea(), CONVERT_TOOL::PolyToLines(), RENDER_3D_LEGACY::reload(), PNS::SegmentHull(), SHAPE_SIMPLE::SHAPE_SIMPLE(), MARKER_BASE::ShapeToPolygon(), TestConcaveSquareFillet(), TransformCircleToPolygon(), TransformRoundRectToPolygon(), unfracture(), and SHAPE_POLY_SET::unfractureSingle().

◆ SetPoint()

void SHAPE_LINE_CHAIN::SetPoint	(	int	aIndex,
		const VECTOR2I &	aPos
	)

inline

Accessor Function to move a point to a specific location.

Parameters

aIndex	Index (wrapping) of the point to move
aPos	New absolute location of the point

Definition at line 312 of file shape_line_chain.h.

     {
         if( aIndex < 0 )
             aIndex += PointCount();
         else if( aIndex >= PointCount() )
             aIndex -= PointCount();
 
         m_points[aIndex] = aPos;
 
         if( m_shapes[aIndex] != SHAPE_IS_PT )
             convertArc( m_shapes[aIndex] );
     }

References convertArc(), m_points, m_shapes, PointCount(), and SHAPE_IS_PT.

Referenced by PNS::LINE_PLACER::buildInitialLine(), and PNS::LINE::dragCornerFree().

◆ SetWidth()

void SHAPE_LINE_CHAIN::SetWidth ( int aWidth )

inline

Sets the width of all segments in the chain.

Parameters

aWidth width in internal units

Definition at line 206 of file shape_line_chain.h.

     {
         m_width = aWidth;
     }

References m_width.

Referenced by ROUTER_PREVIEW_ITEM::Line(), CONVERT_TOOL::makePolysFromRects(), CONVERT_TOOL::makePolysFromSegs(), PNS::LINE::SetShape(), PNS::LINE::SetWidth(), and PNS::DIFF_PAIR::SetWidth().

◆ ShapeCount()

int SHAPE_LINE_CHAIN::ShapeCount ( ) const

Returns the number of shapes (line segments or arcs) in this line chain.

This is kind of like SegmentCount() but will only count arcs as 1 segment

Returns: ArcCount() + the number of non-arc segments

Definition at line 476 of file shape_line_chain.cpp.

 {
     if( m_points.empty() )
         return 0;
 
     int numPoints = static_cast<int>( m_shapes.size() );
     int numShapes = 0;
     int arcIdx    = -1;
 
     for( int i = 0; i < m_points.size() - 1; i++ )
     {
         if( m_shapes[i] == SHAPE_IS_PT )
         {
             numShapes++;
         }
         else
         {
             arcIdx = m_shapes[i];
             numShapes++;
 
             // Now skip the rest of the arc
             while( i < numPoints && m_shapes[i] == arcIdx )
                 i++;
 
             // Add the "hidden" segment at the end of the arc, if it exists
             if( i < numPoints &&
                 m_points[i] != m_points[i - 1] )
             {
                 numShapes++;
             }
 
             i--;
         }
     }
 
     return numShapes;
 }

References m_points, m_shapes, and SHAPE_IS_PT.

Referenced by PNS::LINE_PLACER::mergeHead(), PNS::LINE_PLACER::optimizeTailHeadTransition(), and PNS::LINE::ShapeCount().

◆ Simplify()

SHAPE_LINE_CHAIN & SHAPE_LINE_CHAIN::Simplify ( bool aRemoveColinear = true )

Function Simplify()

Simplifies the line chain by removing colinear adjacent segments and duplicate vertices.

Parameters

aRemoveColinear controsl the removal of colinear adjacent segments

Returns: reference to self.

Definition at line 998 of file shape_line_chain.cpp.

 {
     std::vector<VECTOR2I> pts_unique;
     std::vector<ssize_t> shapes_unique;
 
     if( PointCount() < 2 )
     {
         return *this;
     }
     else if( PointCount() == 2 )
     {
         if( m_points[0] == m_points[1] )
             m_points.pop_back();
 
         return *this;
     }
 
     int i = 0;
     int np = PointCount();
 
     // stage 1: eliminate duplicate vertices
     while( i < np )
     {
         int j = i + 1;
 
         // We can eliminate duplicate vertices as long as they are part of the same shape, OR if
         // one of them is part of a shape and one is not.
         while( j < np && m_points[i] == m_points[j] &&
                ( m_shapes[i] == m_shapes[j] ||
                  m_shapes[i] == SHAPE_IS_PT ||
                  m_shapes[j] == SHAPE_IS_PT ) )
         {
             j++;
         }
 
         int shapeToKeep = m_shapes[i];
 
         if( shapeToKeep == SHAPE_IS_PT )
             shapeToKeep = m_shapes[j - 1];
 
         wxASSERT( shapeToKeep < static_cast<int>( m_arcs.size() ) );
 
         pts_unique.push_back( CPoint( i ) );
         shapes_unique.push_back( shapeToKeep );
 
         i = j;
     }
 
     m_points.clear();
     m_shapes.clear();
     np = pts_unique.size();
 
     i = 0;
 
     // stage 2: eliminate colinear segments
     while( i < np - 2 )
     {
         const VECTOR2I p0 = pts_unique[i];
         const VECTOR2I p1 = pts_unique[i + 1];
         int n = i;
 
         if( aRemoveColinear && shapes_unique[i] < 0 && shapes_unique[i + 1] < 0 )
         {
             while( n < np - 2
                     && ( SEG( p0, p1 ).LineDistance( pts_unique[n + 2] ) <= 1
                             || SEG( p0, p1 ).Collinear( SEG( p1, pts_unique[n + 2] ) ) ) )
                 n++;
         }
 
         m_points.push_back( p0 );
         m_shapes.push_back( shapes_unique[i] );
 
         if( n > i )
             i = n;
 
         if( n == np - 2 )
         {
             m_points.push_back( pts_unique[np - 1] );
             m_shapes.push_back( shapes_unique[np - 1] );
             return *this;
         }
 
         i++;
     }
 
     if( np > 1 )
     {
         m_points.push_back( pts_unique[np - 2] );
         m_shapes.push_back( shapes_unique[np - 2] );
     }
 
     m_points.push_back( pts_unique[np - 1] );
     m_shapes.push_back( shapes_unique[np - 1] );
 
     assert( m_points.size() == m_shapes.size() );
 
     return *this;
 }

References CPoint(), m_arcs, m_points, m_shapes, PointCount(), and SHAPE_IS_PT.

Referenced by PNS::MOUSE_TRAIL_TRACER::AddTrailPoint(), PNS::NODE::AssembleLine(), PNS::DIFF_PAIR_PLACER::attemptWalk(), DIRECTION_45::BuildInitialTrace(), PNS::LINE::ChangedArea(), CN_ZONE_LAYER::CN_ZONE_LAYER(), CompareGeometry(), PNS::DIFF_PAIR::CoupledSegmentPairs(), PNS::MEANDER_PLACER_BASE::cutTunedLine(), PNS::MEANDER_PLACER::doMove(), DIALOG_PAD_PRIMITIVE_POLY_PROPS::doValidate(), PNS::LINE::dragCornerFree(), PNS::LINE::dragSegment45(), PNS::MOUSE_TRAIL_TRACER::GetPosture(), PNS::OPTIMIZER::mergeDpStep(), PNS::OPTIMIZER::mergeFull(), PNS::LINE_PLACER::mergeHead(), PNS::DP_MEANDER_PLACER::Move(), PNS::SHOVE::onCollidingSolid(), PNS::LINE_PLACER::optimizeTailHeadTransition(), PNS::LINE_PLACER::rhShoveOnly(), PNS::WALKAROUND::Route(), PNS::OPTIMIZER::runSmartPads(), PNS::TOPOLOGY::SimplifyLine(), PNS::LINE_PLACER::simplifyNewLine(), PNS::OPTIMIZER::smartPadsSingle(), PNS::Tighten(), PNS::LINE_PLACER::Trace(), and PNS::LINE::Walkaround().

◆ Slice()

const SHAPE_LINE_CHAIN SHAPE_LINE_CHAIN::Slice	(	int	aStartIndex,
		int	aEndIndex = `-1`
	)		const

Function Slice()

Returns a subset of this line chain containing the [start_index, end_index] range of points.

Parameters

aStartIndex	start of the point range to be returned (inclusive)
aEndIndex	end of the point range to be returned (inclusive)

Returns: cut line chain.

Definition at line 572 of file shape_line_chain.cpp.

 {
     SHAPE_LINE_CHAIN rv;
 
     if( aEndIndex < 0 )
         aEndIndex += PointCount();
 
     if( aStartIndex < 0 )
         aStartIndex += PointCount();
 
     int numPoints = static_cast<int>( m_points.size() );
 
     for( int i = aStartIndex; i <= aEndIndex && i < numPoints; i++ )
     {
         if( m_shapes[i] != SHAPE_IS_PT )
         {
             int  arcIdx   = m_shapes[i];
             bool wholeArc = true;
             int  arcStart = i;
 
             if( i > 0 && m_shapes[i - 1] >= 0 && m_shapes[i - 1] != arcIdx )
                 wholeArc = false;
 
             while( i < numPoints && m_shapes[i] == arcIdx )
                 i++;
 
             i--;
 
             if( i > aEndIndex )
                 wholeArc = false;
 
             if( wholeArc )
             {
                 rv.Append( m_arcs[arcIdx] );
             }
             else
             {
                 rv.Append( m_points[arcStart] );
                 i = arcStart;
             }
         }
         else
         {
             rv.Append( m_points[i] );
         }
     }
 
     return rv;
 }

References Append(), m_arcs, m_points, m_shapes, PointCount(), and SHAPE_IS_PT.

Referenced by PNS::MOUSE_TRAIL_TRACER::AddTrailPoint(), PNS::KEEP_TOPOLOGY_CONSTRAINT::Check(), PNS::clipToLoopStart(), PNS::LINE::ClipVertexRange(), PNS::MEANDER_PLACER_BASE::cutTunedLine(), PNS::LINE::dragCorner45(), PNS::dragCornerInternal(), PNS::LINE_PLACER::optimizeTailHeadTransition(), PNS::LINE_PLACER::rhWalkOnly(), PNS::Tighten(), and PNS::LINE::Walkaround().

◆ Split()

int SHAPE_LINE_CHAIN::Split ( const VECTOR2I & aP )

Function Split()

Inserts the point aP belonging to one of the our segments, splitting the adjacent segment in two.

Parameters

aP	the point to be inserted

Returns: index of the newly inserted point (or a negative value if aP does not lie on our line)

Definition at line 412 of file shape_line_chain.cpp.

 {
     int ii = -1;
     int min_dist = 2;
 
     int found_index = Find( aP );
 
     for( int s = 0; s < SegmentCount(); s++ )
     {
         const SEG seg = CSegment( s );
         int dist = seg.Distance( aP );
 
         // make sure we are not producing a 'slightly concave' primitive. This might happen
         // if aP lies very close to one of already existing points.
         if( dist < min_dist && seg.A != aP && seg.B != aP )
         {
             min_dist = dist;
             if( found_index < 0 )
                 ii = s;
             else if( s < found_index )
                 ii = s;
         }
     }
 
     if( ii < 0 )
         ii = found_index;
 
     if( ii >= 0 )
     {
         // Are we splitting at the beginning of an arc?  If so, let's split right before so that
         // the shape is preserved
         if( ii < PointCount() - 1 && m_shapes[ii] >= 0 && m_shapes[ii] == m_shapes[ii + 1] )
             ii--;
 
         m_points.insert( m_points.begin() + ( ii + 1 ), aP );
         m_shapes.insert( m_shapes.begin() + ( ii + 1 ), ssize_t( SHAPE_IS_PT ) );
 
         return ii + 1;
     }
 
     return -1;
 }

References SEG::A, SEG::B, CSegment(), SEG::Distance(), Find(), m_points, m_shapes, PointCount(), SegmentCount(), and SHAPE_IS_PT.

Referenced by PNS::clipToLoopStart(), PNS::LINE::ClipToNearestObstacle(), PNS::MEANDER_PLACER_BASE::cutTunedLine(), PNS::LINE_PLACER::rhWalkOnly(), PNS::LINE::Walkaround(), and walkaround2().

◆ SquaredDistance()

SEG::ecoord SHAPE_LINE_CHAIN_BASE::SquaredDistance	(	const VECTOR2I &	aP,
		bool	aOutlineOnly = `false`
	)		const

inherited

Definition at line 398 of file shape_line_chain.cpp.

 {
     ecoord d = VECTOR2I::ECOORD_MAX;
 
     if( IsClosed() && PointInside( aP ) && !aOutlineOnly )
         return 0;
 
     for( size_t s = 0; s < GetSegmentCount(); s++ )
         d = std::min( d, GetSegment( s ).SquaredDistance( aP ) );
 
     return d;
 }

References VECTOR2< T >::ECOORD_MAX, SHAPE_LINE_CHAIN_BASE::GetSegment(), SHAPE_LINE_CHAIN_BASE::GetSegmentCount(), SHAPE_LINE_CHAIN_BASE::IsClosed(), SHAPE_LINE_CHAIN_BASE::PointInside(), and SEG::SquaredDistance().

Referenced by Distance().

◆ Type()

SHAPE_TYPE SHAPE_BASE::Type ( ) const

inlineinherited

Return the type of the shape.

Return values

the type

Definition at line 94 of file shape.h.

     {
         return m_type;
     }

References SHAPE_BASE::m_type.

Referenced by PNS::DP_GATEWAYS::BuildFromPrimitivePair(), PNS::buildHullForPrimitiveShape(), Collide(), SHAPE_POLY_SET::Collide(), collideShapes(), collideSingleShapes(), PNS::OPTIMIZER::computeBreakouts(), ROUTER_PREVIEW_ITEM::drawShape(), PNS::SOLID::HoleHull(), PNS::SOLID::Hull(), and SHAPE_FILE_IO::Write().

◆ Width()

int SHAPE_LINE_CHAIN::Width ( ) const

inline

Gets the current width of the segments in the chain.

Returns: width in internal units

Definition at line 215 of file shape_line_chain.h.

     {
         return m_width;
     }

References m_width.

Referenced by ROUTER_PREVIEW_ITEM::drawShape().

Member Data Documentation

◆ m_arcs

std::vector<SHAPE_ARC> SHAPE_LINE_CHAIN::m_arcs

private

Definition at line 783 of file shape_line_chain.h.

Referenced by Append(), Arc(), ArcCount(), CArcs(), Clear(), convertArc(), Insert(), Mirror(), Move(), Parse(), Replace(), Reverse(), Rotate(), SHAPE_LINE_CHAIN(), Simplify(), and Slice().

◆ m_bbox

BOX2I SHAPE_LINE_CHAIN::m_bbox

mutableprivate

cached bounding box

Definition at line 796 of file shape_line_chain.h.

Referenced by Append(), BBoxFromCache(), and GenerateBBoxCache().

◆ m_closed

bool SHAPE_LINE_CHAIN::m_closed

private

is the line chain closed?

Definition at line 786 of file shape_line_chain.h.

Referenced by Area(), Clear(), CSegment(), Format(), IsClosed(), Parse(), Reverse(), Segment(), SegmentCount(), and SetClosed().

◆ m_points

std::vector<VECTOR2I> SHAPE_LINE_CHAIN::m_points

private

array of vertices

Definition at line 774 of file shape_line_chain.h.

Referenced by Append(), Area(), BBox(), CheckClearance(), CLastPoint(), Clear(), CompareGeometry(), CPoint(), CPoints(), CSegment(), Format(), GenerateBBoxCache(), Insert(), Mirror(), Move(), NearestPoint(), Parse(), PointCount(), Remove(), Replace(), Reverse(), Rotate(), Segment(), SegmentCount(), SetPoint(), SHAPE_LINE_CHAIN(), ShapeCount(), Simplify(), Slice(), and Split().

◆ m_shapes

std::vector<ssize_t> SHAPE_LINE_CHAIN::m_shapes

private

Array of indices that refer to the index of the shape if the point is part of a larger shape, e.g.

arc or spline. If the value is -1, the point is just a point.

Definition at line 781 of file shape_line_chain.h.

Referenced by Append(), ArcIndex(), Clear(), convertArc(), CShapes(), Insert(), isArc(), NearestPoint(), NextShape(), Parse(), Remove(), RemoveShape(), Replace(), Reverse(), SetPoint(), SHAPE_LINE_CHAIN(), ShapeCount(), Simplify(), Slice(), and Split().

◆ m_type

SHAPE_TYPE SHAPE_BASE::m_type

protectedinherited

< type of our shape

Definition at line 110 of file shape.h.

Referenced by SHAPE::IsNull(), and SHAPE_BASE::Type().

◆ m_width

int SHAPE_LINE_CHAIN::m_width

private

Width of the segments (for BBox calculations in RTree) TODO Adjust usage of SHAPE_LINE_CHAIN to account for where we need a width and where not Alternatively, we could split the class into a LINE_CHAIN (no width) and SHAPE_LINE_CHAIN that derives from SHAPE as well that does have a width.

Not sure yet on the correct path. TODO Note that we also have SHAPE_SIMPLE which is a closed, filled SHAPE_LINE_CHAIN.

Definition at line 793 of file shape_line_chain.h.

Referenced by BBox(), GenerateBBoxCache(), SetWidth(), and Width().

◆ MIN_PRECISION_IU

const int SHAPE::MIN_PRECISION_IU = 4

staticinherited

This is the minimum precision for all the points in a shape.

Definition at line 122 of file shape.h.

Referenced by BOOST_AUTO_TEST_CASE(), DIRECTION_45::BuildInitialTrace(), CompareLength(), EDIT_TOOL::FilletTracks(), and CIRCLE::IntersectLine().

◆ SHAPE_IS_PT

constexpr ssize_t SHAPE_LINE_CHAIN::SHAPE_IS_PT = -1

staticprivate

Definition at line 771 of file shape_line_chain.h.

Referenced by Append(), ArcIndex(), convertArc(), Insert(), isArc(), NextShape(), Remove(), RemoveShape(), Replace(), Reverse(), SetPoint(), SHAPE_LINE_CHAIN(), ShapeCount(), Simplify(), Slice(), and Split().

The documentation for this class was generated from the following files:

Classes

Public Types

Public Member Functions

Static Public Attributes

Protected Types

Protected Attributes

Private Types

Private Attributes

Static Private Attributes

Detailed Description

Member Typedef Documentation

◆ ecoord

◆ INTERSECTIONS

◆ point_citer

◆ point_iter

Constructor & Destructor Documentation

◆ SHAPE_LINE_CHAIN() [1/7]

◆ SHAPE_LINE_CHAIN() [2/7]

◆ SHAPE_LINE_CHAIN() [3/7]

◆ SHAPE_LINE_CHAIN() [4/7]

◆ SHAPE_LINE_CHAIN() [5/7]

◆ SHAPE_LINE_CHAIN() [6/7]

◆ SHAPE_LINE_CHAIN() [7/7]

◆ ~SHAPE_LINE_CHAIN()

Member Function Documentation

◆ Append() [1/4]

◆ Append() [2/4]

◆ Append() [3/4]

◆ Append() [4/4]

◆ Arc()

◆ ArcCount()

◆ ArcIndex()

◆ Area()

◆ BBox()

◆ BBoxFromCache()

◆ CalcShape()

◆ CArcs()

◆ Centre()

◆ CheckClearance()

◆ CLastPoint()

◆ Clear()

◆ Clone()

◆ Collide() [1/4]

◆ Collide() [2/4]

◆ Collide() [3/4]

◆ Collide() [4/4]

◆ CompareGeometry()

◆ convertArc()

◆ convertToClipper()

◆ CPoint()

◆ CPoints()

◆ CSegment()

◆ CShapes()

◆ Distance()

◆ EdgeContainingPoint()

◆ Find()

◆ FindSegment()

◆ Format()

◆ GenerateBBoxCache()

◆ GetIndexableSubshapeCount()

◆ GetIndexableSubshapes()

◆ GetPoint()

◆ GetPointCount()

◆ GetSegment()

◆ GetSegmentCount()

◆ HasIndexableSubshapes()

◆ Insert() [1/2]

◆ Insert() [2/2]

◆ Intersect() [1/2]

◆ Intersect() [2/2]

◆ Intersects()

◆ isArc()

◆ IsClosed()

◆ IsNull()

◆ IsSolid()

◆ Length()

◆ Mirror() [1/2]

◆ Mirror() [2/2]

◆ Move()

◆ NearestPoint() [1/2]