KiCad PCB EDA Suite
PNS::LINE Class Reference

#include <pns_line.h>

Inheritance diagram for PNS::LINE:
PNS::ITEM

Public Types

typedef std::vector< SEGMENT * > SEGMENT_REFS
 
enum  PnsKind {
  SOLID_T = 1, LINE_T = 2, JOINT_T = 4, SEGMENT_T = 8,
  VIA_T = 16, DIFF_PAIR_T = 32, ANY_T = 0xff
}
 

Supported item types

More...
 

Public Member Functions

 LINE ()
 Constructor Makes an empty line. More...
 
 LINE (const LINE &aOther)
 
 LINE (const LINE &aBase, const SHAPE_LINE_CHAIN &aLine)
 Constructor Copies properties (net, layers, etc.) from a base line and replaces the shape by another. More...
 
 ~LINE ()
 
virtual LINEClone () const override
 Function Clone() More...
 
const LINEoperator= (const LINE &aOther)
 
void SetShape (const SHAPE_LINE_CHAIN &aLine)
 

Assigns a shape to the line (a polyline/line chain)

More...
 
const SHAPEShape () const override
 

Returns the shape of the line

More...
 
SHAPE_LINE_CHAINLine ()
 

Modifiable accessor to the underlying shape

More...
 
const SHAPE_LINE_CHAINCLine () const
 

Const accessor to the underlying shape

More...
 
int SegmentCount () const
 

Returns the number of segments in the line

More...
 
int PointCount () const
 

Returns the number of points in the line

More...
 
const VECTOR2ICPoint (int aIdx) const
 

Returns the aIdx-th point of the line

More...
 
const SEG CSegment (int aIdx) const
 

Returns the aIdx-th segment of the line

More...
 
void SetWidth (int aWidth)
 

Sets line width

More...
 
int Width () const
 

Returns line width

More...
 
bool CompareGeometry (const LINE &aOther)
 

Returns true if the line is geometrically identical as line aOther

More...
 
void Reverse ()
 

Reverses the point/vertex order

More...
 
void LinkSegment (SEGMENT *aSeg)
 

Adds a reference to a segment registered in a NODE that is a part of this line.

More...
 
SEGMENT_REFSLinkedSegments ()
 

Returns the list of segments from the owning node that constitute this line (or NULL if the line is not linked)

More...
 
bool IsLinked () const
 
bool IsLinkedChecked () const
 
bool ContainsSegment (SEGMENT *aSeg) const
 

Checks if the segment aSeg is a part of the line.

More...
 
SEGMENTGetLink (int aIndex) const
 
void ClearSegmentLinks ()
 

Erases the linking information. Used to detach the line from the owning node.

More...
 
int LinkCount () const
 

Returns the number of segments that were assembled together to form this line.

More...
 
const LINE ClipToNearestObstacle (NODE *aNode) const
 

Clips the line to the nearest obstacle, traversing from the line's start vertex (0).

More...
 
void ClipVertexRange (int aStart, int aEnd)
 

Clips the line to a given range of vertices.

More...
 
int CountCorners (int aAngles) const
 

Returns the number of corners of angles specified by mask aAngles.

More...
 
bool Walkaround (SHAPE_LINE_CHAIN aObstacle, SHAPE_LINE_CHAIN &aPre, SHAPE_LINE_CHAIN &aWalk, SHAPE_LINE_CHAIN &aPost, bool aCw) const
 

Calculates a line thightly wrapping a convex hull of an obstacle object (aObstacle).

More...
 
void Walkaround (const SHAPE_LINE_CHAIN &aObstacle, SHAPE_LINE_CHAIN &aPath, bool aCw) const
 
bool Is45Degree () const
 
void ShowLinks () const
 

Prints out all linked segments

More...
 
bool EndsWithVia () const
 
void AppendVia (const VIA &aVia)
 
void RemoveVia ()
 
const VIAVia () const
 
virtual void Mark (int aMarker) override
 
virtual void Unmark (int aMarker=-1) override
 
virtual int Marker () const override
 
void DragSegment (const VECTOR2I &aP, int aIndex, int aSnappingThreshold=0, bool aFreeAngle=false)
 
void DragCorner (const VECTOR2I &aP, int aIndex, int aSnappingThreshold=0, bool aFreeAngle=false)
 
void SetRank (int aRank) override
 
int Rank () const override
 
bool HasLoops () const
 
bool HasLockedSegments () const
 
OPT_BOX2I ChangedArea (const LINE *aOther) const
 
virtual const SHAPE_LINE_CHAIN Hull (int aClearance=0, int aWalkaroundThickness=0) const
 
PnsKind Kind () const
 Function Kind() More...
 
bool OfKind (int aKindMask) const
 Function OfKind() More...
 
const std::string KindStr () const
 Function KindStr() More...
 
void SetParent (BOARD_CONNECTED_ITEM *aParent)
 Function SetParent() More...
 
BOARD_CONNECTED_ITEMParent () const
 Function Parent() More...
 
void SetNet (int aNet)
 Function SetNet() More...
 
int Net () const
 Function Net() More...
 
void SetLayers (const LAYER_RANGE &aLayers)
 Function SetLayers() More...
 
void SetLayer (int aLayer)
 Function SetLayer() More...
 
const LAYER_RANGELayers () const
 Function Layers() More...
 
virtual int Layer () const
 Function Layer() More...
 
bool LayersOverlap (const ITEM *aOther) const
 Function LayersOverlap() More...
 
void SetOwner (NODE *aOwner)
 Functon SetOwner() More...
 
bool BelongsTo (NODE *aNode) const
 Function BelongsTo() More...
 
NODEOwner () const
 Function Owner() More...
 
virtual bool Collide (const ITEM *aOther, int aClearance, bool aNeedMTV, VECTOR2I &aMTV, bool aDifferentNetsOnly=true) const
 Function Collide() More...
 
bool Collide (const ITEM *aOther, int aClearance, bool aDifferentNetsOnly=true) const
 Function Collide() More...
 
virtual VECTOR2I Anchor (int n) const
 
virtual int AnchorCount () const
 
bool IsLocked () const
 

Static Public Member Functions

static bool ClassOf (const ITEM *aItem)
 

Static Public Attributes

static const int UnusedNet = INT_MAX
 

Protected Attributes

PnsKind m_kind
 
BOARD_CONNECTED_ITEMm_parent
 
NODEm_owner
 
LAYER_RANGE m_layers
 
bool m_movable
 
int m_net
 
int m_marker
 
int m_rank
 

Private Member Functions

void dragSegment45 (const VECTOR2I &aP, int aIndex, int aSnappingThreshold)
 
void dragCorner45 (const VECTOR2I &aP, int aIndex, int aSnappingThreshold)
 
void dragSegmentFree (const VECTOR2I &aP, int aIndex, int aSnappingThreshold)
 
void dragCornerFree (const VECTOR2I &aP, int aIndex, int aSnappingThreshold)
 
VECTOR2I snapToNeighbourSegments (const SHAPE_LINE_CHAIN &aPath, const VECTOR2I &aP, int aIndex, int aThreshold) const
 
VECTOR2I snapDraggedCorner (const SHAPE_LINE_CHAIN &aPath, const VECTOR2I &aP, int aIndex, int aThreshold) const
 
void copyLinks (const LINE *aParent)
 

Copies m_segmentRefs from the line aParent.

More...
 

Private Attributes

SEGMENT_REFS m_segmentRefs
 

List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is not a part of any node.

More...
 
SHAPE_LINE_CHAIN m_line
 

The actual shape of the line

More...
 
int m_width
 

our width

More...
 
bool m_hasVia
 

If true, the line ends with a via

More...
 
VIA m_via
 

Via at the end point, if m_hasVia == true

More...
 

Detailed Description

Definition at line 60 of file pns_line.h.

Member Typedef Documentation

typedef std::vector<SEGMENT*> PNS::LINE::SEGMENT_REFS

Definition at line 63 of file pns_line.h.

Member Enumeration Documentation

enum PNS::ITEM::PnsKind
inherited

Supported item types

Enumerator
SOLID_T 
LINE_T 
JOINT_T 
SEGMENT_T 
VIA_T 
DIFF_PAIR_T 
ANY_T 

Definition at line 59 of file pns_item.h.

60  {
61  SOLID_T = 1,
62  LINE_T = 2,
63  JOINT_T = 4,
64  SEGMENT_T = 8,
65  VIA_T = 16,
66  DIFF_PAIR_T = 32,
67  ANY_T = 0xff
68  };

Constructor & Destructor Documentation

PNS::LINE::LINE ( )
inline

Constructor Makes an empty line.

Definition at line 69 of file pns_line.h.

References m_hasVia, and m_width.

Referenced by Clone().

69  : ITEM( LINE_T )
70  {
71  m_hasVia = false;
72  m_width = 1; // Dummy value
73  }
ITEM(PnsKind aKind)
Definition: pns_item.h:70
bool m_hasVia
If true, the line ends with a via
Definition: pns_line.h:297
int m_width
our width
Definition: pns_line.h:294
PNS::LINE::LINE ( const LINE aOther)

Definition at line 36 of file pns_line.cpp.

References copyLinks(), m_hasVia, PNS::ITEM::m_layers, PNS::ITEM::m_marker, PNS::ITEM::m_movable, PNS::ITEM::m_net, PNS::ITEM::m_rank, and m_via.

36  :
37  ITEM( aOther ),
38  m_line( aOther.m_line ),
39  m_width( aOther.m_width )
40 {
41  m_net = aOther.m_net;
42  m_movable = aOther.m_movable;
43  m_layers = aOther.m_layers;
44  m_via = aOther.m_via;
45  m_hasVia = aOther.m_hasVia;
46  m_marker = aOther.m_marker;
47  m_rank = aOther.m_rank;
48 
49  copyLinks( &aOther );
50 }
VIA m_via
Via at the end point, if m_hasVia == true
Definition: pns_line.h:300
LAYER_RANGE m_layers
Definition: pns_item.h:350
int m_rank
Definition: pns_item.h:355
bool m_movable
Definition: pns_item.h:352
ITEM(PnsKind aKind)
Definition: pns_item.h:70
int m_marker
Definition: pns_item.h:354
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
void copyLinks(const LINE *aParent)
Copies m_segmentRefs from the line aParent.
Definition: pns_line.cpp:116
bool m_hasVia
If true, the line ends with a via
Definition: pns_line.h:297
int m_net
Definition: pns_item.h:353
int m_width
our width
Definition: pns_line.h:294
PNS::LINE::LINE ( const LINE aBase,
const SHAPE_LINE_CHAIN aLine 
)
inline

Constructor Copies properties (net, layers, etc.) from a base line and replaces the shape by another.

Definition at line 82 of file pns_line.h.

References m_hasVia, PNS::ITEM::m_layers, and PNS::ITEM::m_net.

82  :
83  ITEM( aBase ),
84  m_line( aLine ),
85  m_width( aBase.m_width )
86  {
87  m_net = aBase.m_net;
88  m_layers = aBase.m_layers;
89  m_hasVia = false;
90  }
LAYER_RANGE m_layers
Definition: pns_item.h:350
ITEM(PnsKind aKind)
Definition: pns_item.h:70
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
bool m_hasVia
If true, the line ends with a via
Definition: pns_line.h:297
int m_net
Definition: pns_item.h:353
int m_width
our width
Definition: pns_line.h:294
PNS::LINE::~LINE ( )

Definition at line 53 of file pns_line.cpp.

54 {
55 }

Member Function Documentation

virtual VECTOR2I PNS::ITEM::Anchor ( int  n) const
inlinevirtualinherited

Reimplemented in PNS::VIA, PNS::SEGMENT, and PNS::SOLID.

Definition at line 326 of file pns_item.h.

Referenced by PNS::DP_PRIMITIVE_PAIR::CursorOrientation(), PNS::DP_PRIMITIVE_PAIR::DP_PRIMITIVE_PAIR(), and PNS::DIFF_PAIR_PLACER::getDanglingAnchor().

327  {
328  return VECTOR2I();
329  }
VECTOR2< int > VECTOR2I
Definition: vector2d.h:589
virtual int PNS::ITEM::AnchorCount ( ) const
inlinevirtualinherited

Reimplemented in PNS::VIA, PNS::SEGMENT, and PNS::SOLID.

Definition at line 331 of file pns_item.h.

332  {
333  return 0;
334  }
void PNS::LINE::AppendVia ( const VIA aVia)

Definition at line 736 of file pns_line.cpp.

References SHAPE_LINE_CHAIN::CPoint(), m_hasVia, m_line, PNS::ITEM::m_net, m_via, SHAPE_LINE_CHAIN::PointCount(), PNS::VIA::Pos(), Reverse(), and PNS::ITEM::SetNet().

Referenced by PNS::LINE_PLACER::buildInitialLine(), PNS::SHOVE::onReverseCollidingVia(), PNS::LINE_PLACER::rhShoveOnly(), PNS::LINE_PLACER::rhWalkOnly(), and PNS::DIFF_PAIR::updateLine().

737 {
738  if( m_line.PointCount() > 1 && aVia.Pos() == m_line.CPoint( 0 ) )
739  {
740  Reverse();
741  }
742 
743  m_hasVia = true;
744  m_via = aVia;
745  m_via.SetNet( m_net );
746 }
VIA m_via
Via at the end point, if m_hasVia == true
Definition: pns_line.h:300
int PointCount() const
Function PointCount()
void SetNet(int aNet)
Function SetNet()
Definition: pns_item.h:167
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
void Reverse()
Reverses the point/vertex order
Definition: pns_line.cpp:728
bool m_hasVia
If true, the line ends with a via
Definition: pns_line.h:297
int m_net
Definition: pns_item.h:353
const VECTOR2I & CPoint(int aIndex) const
Function CPoint()
bool PNS::ITEM::BelongsTo ( NODE aNode) const
inlineinherited

Function BelongsTo()

Returns
true if the item is owned by the node aNode.

Definition at line 249 of file pns_item.h.

References PNS::ITEM::m_owner.

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

250  {
251  return m_owner == aNode;
252  }
NODE * m_owner
Definition: pns_item.h:349
OPT_BOX2I PNS::LINE::ChangedArea ( const LINE aOther) const

Definition at line 833 of file pns_line.cpp.

References SEG::Contains(), CPoint(), SHAPE_LINE_CHAIN::CPoint(), PNS::extendBox(), BOX2< Vec >::Inflate(), m_line, max, min, SHAPE_LINE_CHAIN::PointCount(), SHAPE_LINE_CHAIN::Simplify(), and Width().

Referenced by PNS::ChangedArea().

834 {
835  BOX2I area;
836  bool areaDefined = false;
837 
838  int i_start = -1;
839  int i_end_self = -1, i_end_other = -1;
840 
841  SHAPE_LINE_CHAIN self( m_line );
842  self.Simplify();
843  SHAPE_LINE_CHAIN other( aOther->m_line );
844  other.Simplify();
845 
846  int np_self = self.PointCount();
847  int np_other = other.PointCount();
848 
849  int n = std::min( np_self, np_other );
850 
851  for( int i = 0; i < n; i++ )
852  {
853  const VECTOR2I p1 = self.CPoint( i );
854  const VECTOR2I p2 = other.CPoint( i );
855 
856  if( p1 != p2 )
857  {
858  if( i != n - 1 )
859  {
860  SEG s = self.CSegment( i );
861 
862  if( !s.Contains( p2 ) )
863  {
864  i_start = i;
865  break;
866  }
867  } else {
868  i_start = i;
869  break;
870  }
871  }
872  }
873 
874  for( int i = 0; i < n; i++ )
875  {
876  const VECTOR2I p1 = self.CPoint( np_self - 1 - i );
877  const VECTOR2I p2 = other.CPoint( np_other - 1 - i );
878 
879  if( p1 != p2 )
880  {
881  i_end_self = np_self - 1 - i;
882  i_end_other = np_other - 1 - i;
883  break;
884  }
885  }
886 
887  if( i_start < 0 )
888  i_start = n;
889 
890  if( i_end_self < 0 )
891  i_end_self = np_self - 1;
892 
893  if( i_end_other < 0 )
894  i_end_other = np_other - 1;
895 
896  for( int i = i_start; i <= i_end_self; i++ )
897  extendBox( area, areaDefined, self.CPoint( i ) );
898 
899  for( int i = i_start; i <= i_end_other; i++ )
900  extendBox( area, areaDefined, other.CPoint( i ) );
901 
902  if( areaDefined )
903  {
904  area.Inflate( std::max( Width(), aOther->Width() ) );
905  return area;
906  }
907 
908  return OPT_BOX2I();
909 }
int Width() const
Returns line width
Definition: pns_line.h:159
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
SHAPE_LINE_CHAIN & Simplify()
Function Simplify()
Definition: seg.h:36
BOX2< Vec > & Inflate(coord_type dx, coord_type dy)
Function Inflate inflates the rectangle horizontally by dx and vertically by dy.
Definition: box2.h:266
#define max(a, b)
Definition: auxiliary.h:86
Class SHAPE_LINE_CHAIN.
static void extendBox(BOX2I &aBox, bool &aDefined, const VECTOR2I &aP)
Definition: pns_line.cpp:819
OPT< BOX2I > OPT_BOX2I
Definition: box2.h:471
bool Contains(const VECTOR2I &aP) const
Definition: seg.cpp:155
#define min(a, b)
Definition: auxiliary.h:85
const VECTOR2I & CPoint(int aIdx) const
Returns the aIdx-th point of the line
Definition: pns_line.h:141
static bool PNS::LINE::ClassOf ( const ITEM aItem)
inlinestatic

Definition at line 94 of file pns_line.h.

References PNS::ITEM::Kind(), and PNS::ITEM::LINE_T.

95  {
96  return aItem && LINE_T == aItem->Kind();
97  }
void PNS::LINE::ClearSegmentLinks ( )

Erases the linking information. Used to detach the line from the owning node.

Definition at line 813 of file pns_line.cpp.

References m_segmentRefs.

Referenced by PNS::DRAGGER::dragMarkObstacles(), PNS::DRAGGER::dragShove(), PNS::DRAGGER::dumbDragVia(), PNS::SHOVE::onCollidingSolid(), PNS::SHOVE::onReverseCollidingVia(), PNS::SHOVE::ProcessSingleLine(), PNS::NODE::Remove(), PNS::SHOVE::ShoveLines(), PNS::SHOVE::ShoveMultiLines(), and PNS::DRAGGER::startDragSegment().

814 {
815  m_segmentRefs.clear();
816 }
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
const LINE PNS::LINE::ClipToNearestObstacle ( NODE aNode) const

Clips the line to the nearest obstacle, traversing from the line's start vertex (0).

Returns the clipped line.

Definition at line 297 of file pns_line.cpp.

References SHAPE_LINE_CHAIN::Clear(), Line(), PNS::NODE::NearestObstacle(), SHAPE_LINE_CHAIN::Remove(), RemoveVia(), and SHAPE_LINE_CHAIN::Split().

Referenced by PNS::LINE_PLACER::rhShoveOnly(), PNS::LINE_PLACER::rhWalkOnly(), and PNS::WALKAROUND::singleStep().

298 {
299  const int IterationLimit = 5;
300  int i;
301  LINE l( *this );
302 
303  for( i = 0; i < IterationLimit; i++ )
304  {
305  NODE::OPT_OBSTACLE obs = aNode->NearestObstacle( &l );
306 
307  if( obs )
308  {
309  l.RemoveVia();
310  int p = l.Line().Split( obs->m_ipFirst );
311  l.Line().Remove( p + 1, -1 );
312  } else
313  break;
314  }
315 
316  if( i == IterationLimit )
317  l.Line().Clear();
318 
319  return l;
320 }
LINE()
Constructor Makes an empty line.
Definition: pns_line.h:69
OPT< OBSTACLE > OPT_OBSTACLE
Definition: pns_node.h:140
void PNS::LINE::ClipVertexRange ( int  aStart,
int  aEnd 
)

Clips the line to a given range of vertices.

Definition at line 778 of file pns_line.cpp.

References IsLinked(), m_line, m_segmentRefs, and SHAPE_LINE_CHAIN::Slice().

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

779 {
780  m_line = m_line.Slice( aStart, aEnd );
781 
782  if( IsLinked() ) {
783  assert( m_segmentRefs.size() < INT_MAX );
784  assert( (int) m_segmentRefs.size() >= (aEnd - aStart) );
785 
786  // Note: The range includes aEnd, but we have n-1 segments.
787  std::rotate(
788  m_segmentRefs.begin(),
789  m_segmentRefs.begin() + aStart,
790  m_segmentRefs.begin() + aEnd
791  );
792 
793  m_segmentRefs.resize( aEnd - aStart );
794  }
795 }
const SHAPE_LINE_CHAIN Slice(int aStartIndex, int aEndIndex=-1) const
Function Slice()
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
bool IsLinked() const
Definition: pns_line.h:186
LINE * PNS::LINE::Clone ( ) const
overridevirtual

Function Clone()

Returns a deep copy of the item

Implements PNS::ITEM.

Definition at line 76 of file pns_line.cpp.

References LINE().

Referenced by PNS::ITEM_SET::Add(), and PNS::ITEM_SET::Prepend().

77 {
78  LINE* l = new LINE( *this );
79 
80  return l;
81 }
LINE()
Constructor Makes an empty line.
Definition: pns_line.h:69
bool PNS::ITEM::Collide ( const ITEM aOther,
int  aClearance,
bool  aNeedMTV,
VECTOR2I aMTV,
bool  aDifferentNetsOnly = true 
) const
virtualinherited

Function Collide()

Checks for a collision (clearance violation) with between us and item aOther. Collision checking takes all PCB stuff into accound (layers, nets, DRC rules). Optionally returns a minimum translation vector for force propagation algorithm.

Parameters
aOtheritem to check collision against
aClearancedesired clearance
aNeedMTVwhen true, the minimum translation vector is calculated
aMTVthe minimum translation vector
Returns
true, if a collision was found.

Definition at line 44 of file pns_item.cpp.

References PNS::ITEM::collideSimple(), EndsWithVia(), PNS::ITEM::LINE_T, PNS::ITEM::m_kind, Via(), and Width().

Referenced by PNS::NODE::CheckColliding(), PNS::ITEM::Collide(), PNS::OPTIMIZER::CACHE_VISITOR::operator()(), and PNS::NODE::DEFAULT_OBSTACLE_VISITOR::operator()().

46 {
47  if( collideSimple( aOther, aClearance, aNeedMTV, aMTV, aDifferentNetsOnly ) )
48  return true;
49 
50  // special case for "head" line with a via attached at the end.
51  if( aOther->m_kind == LINE_T )
52  {
53  const LINE* line = static_cast<const LINE*>( aOther );
54 
55  if( line->EndsWithVia() )
56  return collideSimple( &line->Via(), aClearance - line->Width() / 2, aNeedMTV, aMTV, aDifferentNetsOnly );
57  }
58 
59  return false;
60 }
bool collideSimple(const ITEM *aOther, int aClearance, bool aNeedMTV, VECTOR2I &aMTV, bool aDifferentNetsOnly) const
Definition: pns_item.cpp:27
bool PNS::ITEM::Collide ( const ITEM aOther,
int  aClearance,
bool  aDifferentNetsOnly = true 
) const
inlineinherited

Function Collide()

A shortcut for ITEM::Colllide() without MTV stuff.

Definition at line 283 of file pns_item.h.

References PNS::ITEM::Collide(), and dummy().

284  {
285  VECTOR2I dummy;
286 
287  return Collide( aOther, aClearance, false, dummy, aDifferentNetsOnly );
288  }
virtual bool Collide(const ITEM *aOther, int aClearance, bool aNeedMTV, VECTOR2I &aMTV, bool aDifferentNetsOnly=true) const
Function Collide()
Definition: pns_item.cpp:44
static LIB_PART * dummy()
Used when a LIB_PART is not found in library to draw a dummy shape This component is a 400 mils squar...
bool PNS::LINE::CompareGeometry ( const LINE aOther)

Returns true if the line is geometrically identical as line aOther

Definition at line 722 of file pns_line.cpp.

References SHAPE_LINE_CHAIN::CompareGeometry(), and m_line.

723 {
724  return m_line.CompareGeometry( aOther.m_line );
725 }
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
bool CompareGeometry(const SHAPE_LINE_CHAIN &aOther) const
bool PNS::LINE::ContainsSegment ( SEGMENT aSeg) const
inline

Checks if the segment aSeg is a part of the line.

Definition at line 197 of file pns_line.h.

References m_segmentRefs.

198  {
199  return std::find( m_segmentRefs.begin(), m_segmentRefs.end(),
200  aSeg ) != m_segmentRefs.end();
201  }
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
void PNS::LINE::copyLinks ( const LINE aParent)
private

Copies m_segmentRefs from the line aParent.

Definition at line 116 of file pns_line.cpp.

References m_segmentRefs.

Referenced by LINE(), and operator=().

117 {
118  m_segmentRefs = aParent->m_segmentRefs;
119 }
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
int PNS::LINE::CountCorners ( int  aAngles) const

Returns the number of corners of angles specified by mask aAngles.

Definition at line 136 of file pns_line.cpp.

References DIRECTION_45::Angle(), SHAPE_LINE_CHAIN::CSegment(), m_line, and SHAPE_LINE_CHAIN::SegmentCount().

Referenced by PNS::LINE_PLACER::mergeHead(), and PNS::OPTIMIZER::smartPadsSingle().

137 {
138  int count = 0;
139 
140  for( int i = 0; i < m_line.SegmentCount() - 1; i++ )
141  {
142  const SEG seg1 = m_line.CSegment( i );
143  const SEG seg2 = m_line.CSegment( i + 1 );
144 
145  const DIRECTION_45 dir1( seg1 );
146  const DIRECTION_45 dir2( seg2 );
147 
148  DIRECTION_45::AngleType a = dir1.Angle( dir2 );
149 
150  if( a & aAngles )
151  count++;
152  }
153 
154  return count;
155 }
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
const SEG CSegment(int aIndex) const
Function CSegment()
Class DIRECTION_45.
Definition: direction45.h:33
Definition: seg.h:36
AngleType
Enum AngleType Represents kind of angle formed by vectors heading in two DIRECTION_45s.
Definition: direction45.h:59
int SegmentCount() const
Function SegmentCount()
const VECTOR2I& PNS::LINE::CPoint ( int  aIdx) const
inline
const SEG PNS::LINE::CSegment ( int  aIdx) const
inline

Returns the aIdx-th segment of the line

Definition at line 147 of file pns_line.h.

References SHAPE_LINE_CHAIN::CSegment(), and m_line.

Referenced by PNS::SHOVE::checkBumpDirection(), PNS::DIFF_PAIR::EndingPrimitives(), PNS::LINE_PLACER::FixRoute(), PNS::OPTIMIZER::mergeStep(), PNS::LINE_PLACER::optimizeTailHeadTransition(), and PNS::SHOVE::ProcessSingleLine().

148  {
149  return m_line.CSegment( aIdx );
150  }
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
const SEG CSegment(int aIndex) const
Function CSegment()
void PNS::LINE::DragCorner ( const VECTOR2I aP,
int  aIndex,
int  aSnappingThreshold = 0,
bool  aFreeAngle = false 
)

Definition at line 436 of file pns_line.cpp.

References dragCorner45(), and dragCornerFree().

Referenced by PNS::DRAGGER::dragMarkObstacles(), PNS::DRAGGER::dragShove(), and PNS::DRAGGER::dumbDragVia().

437 {
438  if( aFreeAngle )
439  {
440  dragCornerFree ( aP, aIndex, aSnappingThreshold );
441  }
442  else
443  {
444  dragCorner45 ( aP, aIndex, aSnappingThreshold );
445  }
446 }
void dragCorner45(const VECTOR2I &aP, int aIndex, int aSnappingThreshold)
Definition: pns_line.cpp:406
void dragCornerFree(const VECTOR2I &aP, int aIndex, int aSnappingThreshold)
Definition: pns_line.cpp:430
void PNS::LINE::dragCorner45 ( const VECTOR2I aP,
int  aIndex,
int  aSnappingThreshold 
)
private

Definition at line 406 of file pns_line.cpp.

References SHAPE_LINE_CHAIN::Append(), PNS::dragCornerInternal(), m_line, Reverse(), SHAPE_LINE_CHAIN::Reverse(), SHAPE_LINE_CHAIN::SegmentCount(), SHAPE_LINE_CHAIN::Simplify(), SHAPE_LINE_CHAIN::Slice(), and snapDraggedCorner().

Referenced by DragCorner().

407 {
408  SHAPE_LINE_CHAIN path;
409 
410  VECTOR2I snapped = snapDraggedCorner( m_line, aP, aIndex, aSnappingThreshold );
411 
412  if( aIndex == 0 )
413  path = dragCornerInternal( m_line.Reverse(), snapped ).Reverse();
414  else if( aIndex == m_line.SegmentCount() )
415  path = dragCornerInternal( m_line, snapped );
416  else
417  {
418  // fixme: awkward behaviour for "outwards" drags
419  path = dragCornerInternal( m_line.Slice( 0, aIndex ), snapped );
420  SHAPE_LINE_CHAIN path_rev = dragCornerInternal( m_line.Slice( aIndex, -1 ).Reverse(),
421  snapped ).Reverse();
422  path.Append( path_rev );
423  }
424 
425  path.Simplify();
426  m_line = path;
427 }
const SHAPE_LINE_CHAIN Reverse() const
Function Reverse()
const SHAPE_LINE_CHAIN Slice(int aStartIndex, int aEndIndex=-1) const
Function Slice()
void Append(int aX, int aY, bool aAllowDuplication=false)
Function Append()
SHAPE_LINE_CHAIN dragCornerInternal(const SHAPE_LINE_CHAIN &aOrigin, const VECTOR2I &aP)
Definition: pns_line.cpp:337
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
SHAPE_LINE_CHAIN & Simplify()
Function Simplify()
void Reverse()
Reverses the point/vertex order
Definition: pns_line.cpp:728
VECTOR2I snapDraggedCorner(const SHAPE_LINE_CHAIN &aPath, const VECTOR2I &aP, int aIndex, int aThreshold) const
Definition: pns_line.cpp:461
Class SHAPE_LINE_CHAIN.
int SegmentCount() const
Function SegmentCount()
void PNS::LINE::dragCornerFree ( const VECTOR2I aP,
int  aIndex,
int  aSnappingThreshold 
)
private

Definition at line 430 of file pns_line.cpp.

References m_line, SHAPE_LINE_CHAIN::Point(), and SHAPE_LINE_CHAIN::Simplify().

Referenced by DragCorner().

431 {
432  m_line.Point( aIndex ) = aP;
433  m_line.Simplify();
434 }
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
SHAPE_LINE_CHAIN & Simplify()
Function Simplify()
VECTOR2I & Point(int aIndex)
Function Point()
void PNS::LINE::DragSegment ( const VECTOR2I aP,
int  aIndex,
int  aSnappingThreshold = 0,
bool  aFreeAngle = false 
)

Definition at line 448 of file pns_line.cpp.

References dragSegment45().

Referenced by PNS::DRAGGER::dragMarkObstacles(), and PNS::DRAGGER::dragShove().

449 {
450  if( aFreeAngle )
451  {
452  assert( false );
453  }
454  else
455  {
456  dragSegment45 ( aP, aIndex, aSnappingThreshold );
457  }
458 }
void dragSegment45(const VECTOR2I &aP, int aIndex, int aSnappingThreshold)
Definition: pns_line.cpp:549
void PNS::LINE::dragSegment45 ( const VECTOR2I aP,
int  aIndex,
int  aSnappingThreshold 
)
private

Definition at line 549 of file pns_line.cpp.

References SEG::A, SHAPE_LINE_CHAIN::Append(), SEG::B, SHAPE_LINE_CHAIN::CPoint(), SHAPE_LINE_CHAIN::CSegment(), SHAPE_LINE_CHAIN::Insert(), SEG::Intersect(), DIRECTION_45::IsObtuse(), DIRECTION_45::Left(), SHAPE_LINE_CHAIN::Length(), m_line, SHAPE_LINE_CHAIN::PointCount(), SHAPE_LINE_CHAIN::Remove(), SHAPE_LINE_CHAIN::Replace(), DIRECTION_45::Right(), SHAPE_LINE_CHAIN::SegmentCount(), SHAPE_LINE_CHAIN::Simplify(), snapToNeighbourSegments(), and DIRECTION_45::ToVector().

Referenced by DragSegment().

550 {
551  SHAPE_LINE_CHAIN path( m_line );
552  VECTOR2I target( aP );
553 
554  SEG guideA[2], guideB[2];
555  int index = aIndex;
556 
557  target = snapToNeighbourSegments( path, aP, aIndex, aSnappingThreshold );
558 
559  if( index == 0 )
560  {
561  path.Insert( 0, path.CPoint( 0 ) );
562  index++;
563  }
564 
565  if( index == path.SegmentCount() - 1 )
566  {
567  path.Insert( path.PointCount() - 1, path.CPoint( -1 ) );
568  }
569 
570  SEG dragged = path.CSegment( index );
571  DIRECTION_45 drag_dir( dragged );
572 
573  SEG s_prev = path.CSegment( index - 1 );
574  SEG s_next = path.CSegment( index + 1 );
575 
576  DIRECTION_45 dir_prev( s_prev );
577  DIRECTION_45 dir_next( s_next );
578 
579  if( dir_prev == drag_dir )
580  {
581  dir_prev = dir_prev.Left();
582  path.Insert( index, path.CPoint( index ) );
583  index++;
584  }
585 
586  if( dir_next == drag_dir )
587  {
588  dir_next = dir_next.Right();
589  path.Insert( index + 1, path.CPoint( index + 1 ) );
590  }
591 
592  s_prev = path.CSegment( index - 1 );
593  s_next = path.CSegment( index + 1 );
594  dragged = path.CSegment( index );
595 
596  const bool lockEndpointA = true;
597  const bool lockEndpointB = true;
598 
599  if( aIndex == 0 )
600  {
601  if( !lockEndpointA )
602  {
603  guideA[0] = guideA[1] = SEG( dragged.A,
604  dragged.A + drag_dir.Right().Right().ToVector() );
605  }
606  else
607  {
608  guideA[0] = SEG( dragged.A, dragged.A + drag_dir.Right().ToVector() );
609  guideA[1] = SEG( dragged.A, dragged.A + drag_dir.Left().ToVector() );
610  }
611  }
612  else
613  {
614  if( dir_prev.IsObtuse(drag_dir ) )
615  {
616  guideA[0] = SEG( s_prev.A, s_prev.A + drag_dir.Left().ToVector() );
617  guideA[1] = SEG( s_prev.A, s_prev.A + drag_dir.Right().ToVector() );
618  }
619  else
620  guideA[0] = guideA[1] = SEG( dragged.A, dragged.A + dir_prev.ToVector() );
621  }
622 
623  if( aIndex == m_line.SegmentCount() - 1 )
624  {
625  if( !lockEndpointB )
626  {
627  guideB[0] = guideB[1] = SEG( dragged.B,
628  dragged.B + drag_dir.Right().Right().ToVector() );
629  }
630  else
631  {
632  guideB[0] = SEG( dragged.B, dragged.B + drag_dir.Right().ToVector() );
633  guideB[1] = SEG( dragged.B, dragged.B + drag_dir.Left().ToVector() );
634  }
635  }
636  else
637  {
638  if( dir_next.IsObtuse( drag_dir ) )
639  {
640  guideB[0] = SEG( s_next.B, s_next.B + drag_dir.Left().ToVector() );
641  guideB[1] = SEG( s_next.B, s_next.B + drag_dir.Right().ToVector() );
642  }
643  else
644  guideB[0] = guideB[1] = SEG( dragged.B, dragged.B + dir_next.ToVector() );
645  }
646 
647  SEG s_current( target, target + drag_dir.ToVector() );
648 
649  int best_len = INT_MAX;
650  SHAPE_LINE_CHAIN best;
651 
652  for( int i = 0; i < 2; i++ )
653  {
654  for( int j = 0; j < 2; j++ )
655  {
656  OPT_VECTOR2I ip1 = s_current.IntersectLines( guideA[i] );
657  OPT_VECTOR2I ip2 = s_current.IntersectLines( guideB[j] );
658 
659  SHAPE_LINE_CHAIN np;
660 
661  if( !ip1 || !ip2 )
662  continue;
663 
664  SEG s1( s_prev.A, *ip1 );
665  SEG s2( *ip1, *ip2 );
666  SEG s3( *ip2, s_next.B );
667 
668  OPT_VECTOR2I ip;
669 
670  if( (ip = s1.Intersect( s_next )) )
671  {
672  np.Append( s1.A );
673  np.Append( *ip );
674  np.Append( s_next.B );
675  }
676  else if( (ip = s3.Intersect( s_prev )) )
677  {
678  np.Append( s_prev.A );
679  np.Append( *ip );
680  np.Append( s3.B );
681  }
682  else if( (ip = s1.Intersect( s3 )) )
683  {
684  np.Append( s_prev.A );
685  np.Append( *ip );
686  np.Append( s_next.B );
687  }
688  else
689  {
690  np.Append( s_prev.A );
691  np.Append( *ip1 );
692  np.Append( *ip2 );
693  np.Append( s_next.B );
694  }
695 
696  if( np.Length() < best_len )
697  {
698  best_len = np.Length();
699  best = np;
700  }
701  }
702  }
703 
704  if( !lockEndpointA && aIndex == 0 )
705  best.Remove( 0, 0 );
706  if( !lockEndpointB && aIndex == m_line.SegmentCount() - 1 )
707  best.Remove( -1, -1 );
708 
709  if( m_line.PointCount() == 1 )
710  m_line = best;
711  else if( aIndex == 0 )
712  m_line.Replace( 0, 1, best );
713  else if( aIndex == m_line.SegmentCount() - 1 )
714  m_line.Replace( -2, -1, best );
715  else
716  m_line.Replace( aIndex, aIndex + 1, best );
717 
718  m_line.Simplify();
719 }
int PointCount() const
Function PointCount()
VECTOR2I snapToNeighbourSegments(const SHAPE_LINE_CHAIN &aPath, const VECTOR2I &aP, int aIndex, int aThreshold) const
Definition: pns_line.cpp:503
void Append(int aX, int aY, bool aAllowDuplication=false)
Function Append()
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
SHAPE_LINE_CHAIN & Simplify()
Function Simplify()
OPT< VECTOR2I > OPT_VECTOR2I
Definition: seg.h:34
Class DIRECTION_45.
Definition: direction45.h:33
void Remove(int aStartIndex, int aEndIndex)
Function Remove()
Definition: seg.h:36
Class SHAPE_LINE_CHAIN.
VECTOR2I A
Definition: seg.h:46
void Replace(int aStartIndex, int aEndIndex, const VECTOR2I &aP)
Function Replace()
int SegmentCount() const
Function SegmentCount()
int Length() const
Function Length()
VECTOR2I B
Definition: seg.h:47
void PNS::LINE::dragSegmentFree ( const VECTOR2I aP,
int  aIndex,
int  aSnappingThreshold 
)
private
SEGMENT* PNS::LINE::GetLink ( int  aIndex) const
inline

Definition at line 203 of file pns_line.h.

References m_segmentRefs.

Referenced by PNS::LINE_PLACER::removeLoops(), PNS::TOPOLOGY::SimplifyLine(), PNS::MEANDER_SKEW_PLACER::Start(), and PNS::DP_MEANDER_PLACER::Start().

204  {
205  return m_segmentRefs[aIndex];
206  }
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
bool PNS::LINE::HasLockedSegments ( ) const

Definition at line 912 of file pns_line.cpp.

References m_segmentRefs, and PNS::MK_LOCKED.

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

913 {
914  for( const SEGMENT* seg : m_segmentRefs )
915  {
916  if( seg->Marker() & MK_LOCKED )
917  return true;
918  }
919  return false;
920 }
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
Struct SEGMENT is a simple container used when filling areas with segments.
Definition: class_zone.h:57
bool PNS::LINE::HasLoops ( ) const

Definition at line 798 of file pns_line.cpp.

References abs, CPoint(), and PointCount().

Referenced by PNS::SHOVE::onCollidingSolid(), and PNS::LINE_PLACER::rhShoveOnly().

799 {
800  for( int i = 0; i < PointCount(); i++ )
801  {
802  for( int j = 0; j < PointCount(); j++ )
803  {
804  if( ( std::abs( i - j ) > 1 ) && CPoint( i ) == CPoint( j ) )
805  return true;
806  }
807  }
808 
809  return false;
810 }
#define abs(a)
Definition: auxiliary.h:84
int PointCount() const
Returns the number of points in the line
Definition: pns_line.h:135
const VECTOR2I & CPoint(int aIdx) const
Returns the aIdx-th point of the line
Definition: pns_line.h:141
virtual const SHAPE_LINE_CHAIN PNS::ITEM::Hull ( int  aClearance = 0,
int  aWalkaroundThickness = 0 
) const
inlinevirtualinherited

Reimplemented in PNS::VIA, PNS::SEGMENT, and PNS::SOLID.

Definition at line 110 of file pns_item.h.

111  {
112  return SHAPE_LINE_CHAIN();
113  }
Class SHAPE_LINE_CHAIN.
bool PNS::LINE::Is45Degree ( ) const

Definition at line 271 of file pns_line.cpp.

References SEG::A, PNS::angle(), SEG::B, SHAPE_LINE_CHAIN::CSegment(), SEG::Length(), m_line, SHAPE_LINE_CHAIN::SegmentCount(), VECTOR2< T >::x, and VECTOR2< T >::y.

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

272 {
273  for( int i = 0; i < m_line.SegmentCount(); i++ )
274  {
275  const SEG& s = m_line.CSegment( i );
276 
277  if( s.Length() < 10 )
278  continue;
279 
280  double angle = 180.0 / M_PI *
281  atan2( (double) s.B.y - (double) s.A.y,
282  (double) s.B.x - (double) s.A.x );
283 
284  if( angle < 0 )
285  angle += 360.0;
286 
287  double angle_a = fabs( fmod( angle, 45.0 ) );
288 
289  if( angle_a > 1.0 && angle_a < 44.0 )
290  return false;
291  }
292 
293  return true;
294 }
int Length() const
Function Length()
Definition: seg.h:282
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
const SEG CSegment(int aIndex) const
Function CSegment()
Definition: seg.h:36
static DIRECTION_45::AngleType angle(const VECTOR2I &a, const VECTOR2I &b)
VECTOR2I A
Definition: seg.h:46
int SegmentCount() const
Function SegmentCount()
VECTOR2I B
Definition: seg.h:47
bool PNS::LINE::IsLinked ( ) const
inline

Definition at line 186 of file pns_line.h.

References m_segmentRefs.

Referenced by PNS::NODE::Add(), ClipVertexRange(), PNS::TOPOLOGY::followTrivialPath(), IsLinkedChecked(), PNS::DIFF_PAIR::NLine(), PNS::DIFF_PAIR::PLine(), Rank(), PNS::OPTIMIZER::removeCachedSegments(), ShowLinks(), and PNS::TOPOLOGY::SimplifyLine().

187  {
188  return m_segmentRefs.size() != 0;
189  }
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
bool PNS::LINE::IsLinkedChecked ( ) const
inline

Definition at line 191 of file pns_line.h.

References IsLinked(), LinkCount(), and SegmentCount().

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

192  {
193  return IsLinked() && LinkCount() == SegmentCount();
194  }
int SegmentCount() const
Returns the number of segments in the line
Definition: pns_line.h:129
int LinkCount() const
Returns the number of segments that were assembled together to form this line.
Definition: pns_line.h:212
bool IsLinked() const
Definition: pns_line.h:186
bool PNS::ITEM::IsLocked ( ) const
inlineinherited

Definition at line 336 of file pns_item.h.

References PNS::ITEM::Marker(), and PNS::MK_LOCKED.

Referenced by ROUTER_TOOL::InlineDrag(), ROUTER_TOOL::performDragging(), and PNS::SHOVE::pushVia().

337  {
338  return Marker() & MK_LOCKED;
339  }
virtual int Marker() const
Definition: pns_item.h:311
const std::string PNS::ITEM::KindStr ( ) const
inherited

Function KindStr()

Returns the kind of the item, as string

Definition at line 63 of file pns_item.cpp.

References PNS::ITEM::JOINT_T, PNS::ITEM::LINE_T, PNS::ITEM::m_kind, PNS::ITEM::SEGMENT_T, PNS::ITEM::SOLID_T, and PNS::ITEM::VIA_T.

Referenced by PNS::TOOL_BASE::pickSingleItem(), and PNS::TOOL_BASE::updateEndItem().

64 {
65  switch( m_kind )
66  {
67  case LINE_T:
68  return "line";
69 
70  case SEGMENT_T:
71  return "segment";
72 
73  case VIA_T:
74  return "via";
75 
76  case JOINT_T:
77  return "joint";
78 
79  case SOLID_T:
80  return "solid";
81 
82  default:
83  return "unknown";
84  }
85 }
PnsKind m_kind
Definition: pns_item.h:346
virtual int PNS::ITEM::Layer ( ) const
inlinevirtualinherited

Function Layer()

Returns the item's layer, for single-layered items only.

Reimplemented in PNS::SEGMENT.

Definition at line 217 of file pns_item.h.

References PNS::ITEM::Layers(), and LAYER_RANGE::Start().

Referenced by PNS::OPTIMIZER::fanoutCleanup(), and PNS::OPTIMIZER::runSmartPads().

218  {
219  return Layers().Start();
220  }
const LAYER_RANGE & Layers() const
Function Layers()
Definition: pns_item.h:207
int Start() const
Definition: pns_layerset.h:83
bool PNS::ITEM::LayersOverlap ( const ITEM aOther) const
inlineinherited

Function LayersOverlap()

Returns true if the set of layers spanned by aOther overlaps our layers.

Definition at line 228 of file pns_item.h.

References PNS::ITEM::Layers(), and LAYER_RANGE::Overlaps().

Referenced by PNS::SHOVE::onCollidingSegment(), PNS::SHOVE::ProcessSingleLine(), and PNS::NODE::removeViaIndex().

229  {
230  return Layers().Overlaps( aOther->Layers() );
231  }
const LAYER_RANGE & Layers() const
Function Layers()
Definition: pns_item.h:207
bool Overlaps(const LAYER_RANGE &aOther) const
Definition: pns_layerset.h:68
int PNS::LINE::LinkCount ( ) const
inline

Returns the number of segments that were assembled together to form this line.

Definition at line 212 of file pns_line.h.

References m_segmentRefs.

Referenced by IsLinkedChecked(), and PNS::LINE_PLACER::removeLoops().

213  {
214  return m_segmentRefs.size();
215  }
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
SEGMENT_REFS& PNS::LINE::LinkedSegments ( )
inline

Returns the list of segments from the owning node that constitute this line (or NULL if the line is not linked)

Definition at line 181 of file pns_line.h.

References m_segmentRefs.

Referenced by PNS::NODE::Dump(), PNS::TOPOLOGY::followTrivialPath(), PNS::SHOVE::popLine(), PNS::SHOVE::ProcessSingleLine(), PNS::NODE::Remove(), PNS::OPTIMIZER::removeCachedSegments(), and PNS::SHOVE::unwindStack().

182  {
183  return m_segmentRefs;
184  }
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
void PNS::LINE::LinkSegment ( SEGMENT aSeg)
inline

Adds a reference to a segment registered in a NODE that is a part of this line.

Definition at line 174 of file pns_line.h.

References m_segmentRefs.

Referenced by PNS::NODE::Add(), and PNS::NODE::AssembleLine().

175  {
176  m_segmentRefs.push_back( aSeg );
177  }
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
void PNS::LINE::Mark ( int  aMarker)
overridevirtual

Reimplemented from PNS::ITEM.

Definition at line 84 of file pns_line.cpp.

References PNS::ITEM::m_marker, and m_segmentRefs.

Referenced by PNS::SHOVE::onCollidingSolid(), PNS::SHOVE::ProcessSingleLine(), PNS::SHOVE::ShoveLines(), and PNS::SHOVE::ShoveMultiLines().

85 {
86  m_marker = aMarker;
87 
88  for( SEGMENT* s : m_segmentRefs )
89  s->Mark( aMarker );
90 
91 }
int m_marker
Definition: pns_item.h:354
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
Struct SEGMENT is a simple container used when filling areas with segments.
Definition: class_zone.h:57
int PNS::LINE::Marker ( ) const
overridevirtual

Reimplemented from PNS::ITEM.

Definition at line 103 of file pns_line.cpp.

References PNS::ITEM::m_marker, and m_segmentRefs.

Referenced by PNS::SHOVE::onCollidingLine(), PNS::SHOVE::onCollidingSegment(), PNS::SHOVE::onCollidingSolid(), PNS::SHOVE::processHullSet(), PNS::SHOVE::ProcessSingleLine(), PNS::SHOVE::runOptimizer(), and PNS::SEGMENT::SEGMENT().

104 {
105  int marker = m_marker;
106 
107  for( SEGMENT* s : m_segmentRefs )
108  {
109  marker |= s->Marker();
110  }
111 
112  return marker;
113 }
int m_marker
Definition: pns_item.h:354
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
Struct SEGMENT is a simple container used when filling areas with segments.
Definition: class_zone.h:57
const LINE & PNS::LINE::operator= ( const LINE aOther)

Definition at line 58 of file pns_line.cpp.

References copyLinks(), m_hasVia, PNS::ITEM::m_layers, m_line, PNS::ITEM::m_marker, PNS::ITEM::m_movable, PNS::ITEM::m_net, PNS::ITEM::m_rank, m_via, and m_width.

59 {
60  m_line = aOther.m_line;
61  m_width = aOther.m_width;
62  m_net = aOther.m_net;
63  m_movable = aOther.m_movable;
64  m_layers = aOther.m_layers;
65  m_via = aOther.m_via;
66  m_hasVia = aOther.m_hasVia;
67  m_marker = aOther.m_marker;
68  m_rank = aOther.m_rank;
69 
70  copyLinks( &aOther );
71 
72  return *this;
73 }
VIA m_via
Via at the end point, if m_hasVia == true
Definition: pns_line.h:300
LAYER_RANGE m_layers
Definition: pns_item.h:350
int m_rank
Definition: pns_item.h:355
bool m_movable
Definition: pns_item.h:352
int m_marker
Definition: pns_item.h:354
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
void copyLinks(const LINE *aParent)
Copies m_segmentRefs from the line aParent.
Definition: pns_line.cpp:116
bool m_hasVia
If true, the line ends with a via
Definition: pns_line.h:297
int m_net
Definition: pns_item.h:353
int m_width
our width
Definition: pns_line.h:294
NODE* PNS::ITEM::Owner ( ) const
inlineinherited

Function Owner()

Returns the owner of this item, or NULL if there's none.

Definition at line 259 of file pns_item.h.

References PNS::ITEM::m_owner.

Referenced by PNS::SIZES_SETTINGS::inheritTrackWidth(), and PNS::LINE_PLACER::Move().

259 { return m_owner; }
NODE * m_owner
Definition: pns_item.h:349
BOARD_CONNECTED_ITEM* PNS::ITEM::Parent ( ) const
inlineinherited

Function Parent()

Returns the corresponding parent object in the host application's model.

Definition at line 157 of file pns_item.h.

References PNS::ITEM::m_parent.

Referenced by PNS_PCBNEW_RULE_RESOLVER::DpNetPair(), PNS_KICAD_IFACE::HideItem(), PNS_PCBNEW_RULE_RESOLVER::localPadClearance(), ROUTER_TOOL::prepareInteractive(), and PNS_KICAD_IFACE::RemoveItem().

158  {
159  return m_parent;
160  }
BOARD_CONNECTED_ITEM * m_parent
Definition: pns_item.h:348
int PNS::LINE::PointCount ( ) const
inline

Returns the number of points in the line

Definition at line 135 of file pns_line.h.

References m_line, and SHAPE_LINE_CHAIN::PointCount().

Referenced by PNS::OPTIMIZER::fanoutCleanup(), HasLoops(), PNS::TOPOLOGY::LeadingRatLine(), PNS::LINE_PLACER::Move(), PNS::OPTIMIZER::removeCachedSegments(), PNS::LINE_PLACER::rhShoveOnly(), PNS::WALKAROUND::Route(), PNS::TOPOLOGY::SimplifyLine(), and PNS::LINE_PLACER::simplifyNewLine().

136  {
137  return m_line.PointCount();
138  }
int PointCount() const
Function PointCount()
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
int PNS::LINE::Rank ( ) const
overridevirtual

Reimplemented from PNS::ITEM.

Definition at line 759 of file pns_line.cpp.

References IsLinked(), PNS::ITEM::m_rank, m_segmentRefs, and min.

Referenced by PNS::SHOVE::onCollidingLine(), PNS::SHOVE::onCollidingSegment(), PNS::SHOVE::onCollidingSolid(), PNS::SHOVE::onCollidingVia(), PNS::SHOVE::onReverseCollidingVia(), PNS::SEGMENT::SEGMENT(), and PNS::SHOVE::shoveIteration().

760 {
761  int min_rank = INT_MAX;
762 
763  if( IsLinked() ) {
764  for( SEGMENT *s : m_segmentRefs )
765  {
766  min_rank = std::min( min_rank, s->Rank() );
767  }
768  } else {
769  min_rank = m_rank;
770  }
771 
772  int rank = ( min_rank == INT_MAX ) ? -1 : min_rank;
773 
774  return rank;
775 }
int m_rank
Definition: pns_item.h:355
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
Struct SEGMENT is a simple container used when filling areas with segments.
Definition: class_zone.h:57
#define min(a, b)
Definition: auxiliary.h:85
bool IsLinked() const
Definition: pns_line.h:186
void PNS::LINE::RemoveVia ( )
inline

Definition at line 251 of file pns_line.h.

References m_hasVia.

Referenced by ClipToNearestObstacle(), PNS::LINE_PLACER::initPlacement(), PNS::SHOVE::onReverseCollidingVia(), and PNS::LINE_PLACER::ToggleVia().

251 { m_hasVia = false; }
bool m_hasVia
If true, the line ends with a via
Definition: pns_line.h:297
void PNS::LINE::Reverse ( )

Reverses the point/vertex order

Definition at line 728 of file pns_line.cpp.

References m_line, m_segmentRefs, SHAPE_LINE_CHAIN::Reverse(), and reverse().

Referenced by AppendVia(), dragCorner45(), PNS::TOPOLOGY::followTrivialPath(), and PNS::DRAGGER::startDragVia().

729 {
730  m_line = m_line.Reverse();
731 
732  std::reverse( m_segmentRefs.begin(), m_segmentRefs.end() );
733 }
const SHAPE_LINE_CHAIN Reverse() const
Function Reverse()
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
static void reverse(privcurve_t *curve)
Definition: trace.cpp:1020
void PNS::ITEM::SetLayer ( int  aLayer)
inlineinherited

Function SetLayer()

Sets the layers spanned by the item to a single layer aLayer.

Definition at line 197 of file pns_item.h.

References PNS::ITEM::m_layers.

Referenced by PNS::LINE_PLACER::initPlacement(), PNS::DIFF_PAIR_PLACER::propagateDpHeadForces(), PNS::DIFF_PAIR_PLACER::routeHead(), and PNS::DIFF_PAIR::updateLine().

198  {
199  m_layers = LAYER_RANGE( aLayer, aLayer );
200  }
LAYER_RANGE m_layers
Definition: pns_item.h:350
Class LAYER_RANGE.
Definition: pns_layerset.h:32
void PNS::ITEM::SetLayers ( const LAYER_RANGE aLayers)
inlineinherited

Function SetLayers()

Sets the layers spanned by the item to aLayers.

Definition at line 187 of file pns_item.h.

References PNS::ITEM::m_layers.

Referenced by PNS::TOPOLOGY::AssembleDiffPair(), PNS::NODE::AssembleLine(), PNS::VIA::Clone(), PNS::SEGMENT::SetLayer(), and PNS::VIA::VIA().

188  {
189  m_layers = aLayers;
190  }
LAYER_RANGE m_layers
Definition: pns_item.h:350
void PNS::ITEM::SetNet ( int  aNet)
inlineinherited
void PNS::ITEM::SetOwner ( NODE aOwner)
inlineinherited

Functon SetOwner()

Sets the node that owns this item. An item can belong to a single NODE or stay unowned.

Definition at line 239 of file pns_item.h.

References PNS::ITEM::m_owner.

Referenced by PNS::NODE::AssembleLine(), PNS::NODE::doRemove(), and PNS::NODE::Remove().

240  {
241  m_owner = aOwner;
242  }
NODE * m_owner
Definition: pns_item.h:349
void PNS::ITEM::SetParent ( BOARD_CONNECTED_ITEM aParent)
inlineinherited

Function SetParent()

Sets the corresponding parent object in the host application's model.

Definition at line 147 of file pns_item.h.

References PNS::ITEM::m_parent.

Referenced by PNS_KICAD_IFACE::AddItem().

148  {
149  m_parent = aParent;
150  }
BOARD_CONNECTED_ITEM * m_parent
Definition: pns_item.h:348
void PNS::LINE::SetRank ( int  aRank)
overridevirtual

Reimplemented from PNS::ITEM.

Definition at line 749 of file pns_line.cpp.

References PNS::ITEM::m_rank, and m_segmentRefs.

Referenced by PNS::SHOVE::onCollidingLine(), PNS::SHOVE::onCollidingSegment(), PNS::SHOVE::onCollidingSolid(), PNS::SHOVE::onReverseCollidingVia(), PNS::SHOVE::ShoveLines(), and PNS::SHOVE::ShoveMultiLines().

750 {
751  m_rank = aRank;
752 
753  for( SEGMENT* s : m_segmentRefs )
754  s->SetRank( aRank );
755 
756 }
int m_rank
Definition: pns_item.h:355
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
Struct SEGMENT is a simple container used when filling areas with segments.
Definition: class_zone.h:57
void PNS::LINE::SetWidth ( int  aWidth)
inline

Sets line width

Definition at line 153 of file pns_line.h.

References m_width.

Referenced by PNS::NODE::AssembleLine(), PNS::LINE_PLACER::initPlacement(), and PNS::DIFF_PAIR::updateLine().

154  {
155  m_width = aWidth;
156  }
int m_width
our width
Definition: pns_line.h:294
const SHAPE* PNS::LINE::Shape ( ) const
inlineoverridevirtual

Returns the shape of the line

Reimplemented from PNS::ITEM.

Definition at line 111 of file pns_line.h.

References m_line.

Referenced by PNS::LOGGER::Log(), and PNS::SHOVE::onCollidingVia().

112  {
113  return &m_line;
114  }
SHAPE_LINE_CHAIN m_line
The actual shape of the line
Definition: pns_line.h:291
void PNS::LINE::ShowLinks ( ) const

Prints out all linked segments

Definition at line 323 of file pns_line.cpp.

References IsLinked(), and m_segmentRefs.

324 {
325  if( !IsLinked() )
326  {
327  wxLogTrace( "PNS", "line %p: no links", this );
328  return;
329  }
330 
331  wxLogTrace( "PNS", "line %p: %d linked segs", this, (int) m_segmentRefs.size() );
332 
333  for( int i = 0; i < (int) m_segmentRefs.size(); i++ )
334  wxLogTrace( "PNS", "seg %d: %p\n", i, m_segmentRefs[i] );
335 }
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
bool IsLinked() const
Definition: pns_line.h:186
VECTOR2I PNS::LINE::snapDraggedCorner ( const SHAPE_LINE_CHAIN aPath,
const VECTOR2I aP,
int  aIndex,
int  aThreshold 
) const
private

Definition at line 461 of file pns_line.cpp.

References SHAPE_LINE_CHAIN::CSegment(), dist, EuclideanNorm(), SEG::IntersectLines(), max, min, and SHAPE_LINE_CHAIN::SegmentCount().

Referenced by dragCorner45().

463 {
464  int s_start = std::max( aIndex - 2, 0 );
465  int s_end = std::min( aIndex + 2, aPath.SegmentCount() - 1 );
466 
467  int i, j;
468  int best_dist = INT_MAX;
469  VECTOR2I best_snap = aP;
470 
471  if( aThreshold <= 0 )
472  return aP;
473 
474  for( i = s_start; i <= s_end; i++ )
475  {
476  const SEG& a = aPath.CSegment( i );
477 
478  for( j = s_start; j < i; j++ )
479  {
480  const SEG& b = aPath.CSegment( j );
481 
482  if( !( DIRECTION_45( a ).IsObtuse(DIRECTION_45( b ) ) ) )
483  continue;
484 
485  OPT_VECTOR2I ip = a.IntersectLines(b);
486 
487  if( ip )
488  {
489  int dist = ( *ip - aP ).EuclideanNorm();
490 
491  if( dist < aThreshold && dist < best_dist )
492  {
493  best_dist = dist;
494  best_snap = *ip;
495  }
496  }
497  }
498  }
499 
500  return best_snap;
501 }
double EuclideanNorm(const wxPoint &vector)
Euclidean norm of a 2D vector.
Definition: trigo.h:112
OPT_VECTOR2I IntersectLines(const SEG &aSeg) const
Function IntersectLines()
Definition: seg.h:169
static const int dist[10][10]
Definition: dist.cpp:57
const SEG CSegment(int aIndex) const
Function CSegment()
OPT< VECTOR2I > OPT_VECTOR2I
Definition: seg.h:34
Class DIRECTION_45.
Definition: direction45.h:33
Definition: seg.h:36
#define max(a, b)
Definition: auxiliary.h:86
int SegmentCount() const
Function SegmentCount()
#define min(a, b)
Definition: auxiliary.h:85
VECTOR2I PNS::LINE::snapToNeighbourSegments ( const SHAPE_LINE_CHAIN aPath,
const VECTOR2I aP,
int  aIndex,
int  aThreshold 
) const
private

Definition at line 503 of file pns_line.cpp.

References SEG::A, SHAPE_LINE_CHAIN::CSegment(), SEG::LineDistance(), and SHAPE_LINE_CHAIN::SegmentCount().

Referenced by dragSegment45().

505 {
506  VECTOR2I snap_p[2];
507  DIRECTION_45 dragDir( aPath.CSegment( aIndex ) );
508  int snap_d[2] = { -1, -1 };
509 
510  if( aThreshold == 0 )
511  return aP;
512 
513  if( aIndex >= 2 )
514  {
515  SEG s = aPath.CSegment( aIndex - 2 );
516 
517  if( DIRECTION_45( s ) == dragDir )
518  snap_d[0] = s.LineDistance( aP );
519 
520  snap_p[0] = s.A;
521  }
522 
523  if( aIndex < aPath.SegmentCount() - 2 )
524  {
525  SEG s = aPath.CSegment( aIndex + 2 );
526 
527  if( DIRECTION_45( s ) == dragDir )
528  snap_d[1] = s.LineDistance(aP);
529 
530  snap_p[1] = s.A;
531  }
532 
533  VECTOR2I best = aP;
534  int minDist = INT_MAX;
535 
536  for( int i = 0; i < 2; i++ )
537  {
538  if( snap_d[i] >= 0 && snap_d[i] < minDist && snap_d[i] <= aThreshold )
539  {
540  minDist = snap_d[i];
541  best = snap_p[i];
542  }
543  }
544 
545  return best;
546 }
const SEG CSegment(int aIndex) const
Function CSegment()
Class DIRECTION_45.
Definition: direction45.h:33
int LineDistance(const VECTOR2I &aP, bool aDetermineSide=false) const
Function LineDistance()
Definition: seg.h:337
Definition: seg.h:36
VECTOR2I A
Definition: seg.h:46
int SegmentCount() const
Function SegmentCount()
void PNS::LINE::Unmark ( int  aMarker = -1)
overridevirtual

Reimplemented from PNS::ITEM.

Definition at line 94 of file pns_line.cpp.

References PNS::ITEM::m_marker, and m_segmentRefs.

Referenced by PNS::DRAGGER::dragMarkObstacles(), PNS::DRAGGER::dragShove(), and PNS::SHOVE::onCollidingSolid().

95 {
96  for( SEGMENT* s : m_segmentRefs )
97  s->Unmark( aMarker );
98 
99  m_marker = 0;
100 }
int m_marker
Definition: pns_item.h:354
SEGMENT_REFS m_segmentRefs
List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is...
Definition: pns_line.h:288
Struct SEGMENT is a simple container used when filling areas with segments.
Definition: class_zone.h:57
bool PNS::LINE::Walkaround ( SHAPE_LINE_CHAIN  aObstacle,
SHAPE_LINE_CHAIN aPre,
SHAPE_LINE_CHAIN aWalk,
SHAPE_LINE_CHAIN aPost,
bool  aCw 
) const

Calculates a line thightly wrapping a convex hull of an obstacle object (aObstacle).

aPrePath = path from origin to the obstacle aWalkaroundPath = path around the obstacle aPostPath = past from obstacle till the end aCW = whether to walk around in clockwise or counter-clockwise direction.

Definition at line 158 of file pns_line.cpp.

References SHAPE_LINE_CHAIN::Append(), SHAPE_LINE_CHAIN::Clear(), CLine(), SHAPE_LINE_CHAIN::CPoint(), dist, SHAPE_LINE_CHAIN::Find(), SEG::Index(), SHAPE_LINE_CHAIN::Intersect(), SHAPE_LINE_CHAIN::INTERSECTION::our, SHAPE_LINE_CHAIN::INTERSECTION::p, SHAPE_LINE_CHAIN::PathLength(), SHAPE_LINE_CHAIN::PointCount(), SHAPE_LINE_CHAIN::PointInside(), SHAPE_LINE_CHAIN::SegmentCount(), SHAPE_LINE_CHAIN::SetClosed(), SHAPE_LINE_CHAIN::Simplify(), SHAPE_LINE_CHAIN::Slice(), SHAPE_LINE_CHAIN::Split(), and SHAPE_LINE_CHAIN::INTERSECTION::their.

Referenced by PNS::SHOVE::processHullSet(), PNS::WALKAROUND::singleStep(), Walkaround(), and PNS::SHOVE::walkaroundLoneVia().

160 {
161  const SHAPE_LINE_CHAIN& line( CLine() );
162  VECTOR2I ip_start;
163  VECTOR2I ip_end;
164 
165  if( line.SegmentCount() < 1 )
166  return false;
167 
168  if( aObstacle.PointInside( line.CPoint( 0 ) ) || aObstacle.PointInside( line.CPoint( -1 ) ) )
169  return false;
170 
172 
173  line.Intersect( aObstacle, ips );
174 
175  aWalk.Clear();
176  aPost.Clear();
177 
178  int nearest_dist = INT_MAX;
179  int farthest_dist = 0;
180 
181  SHAPE_LINE_CHAIN::INTERSECTION nearest, farthest;
182 
183  for( int i = 0; i < (int) ips.size(); i++ )
184  {
185  const VECTOR2I p = ips[i].p;
186  int dist = line.PathLength( p );
187 
188  if( dist < 0 )
189  return false;
190 
191  if( dist <= nearest_dist )
192  {
193  nearest_dist = dist;
194  nearest = ips[i];
195  }
196 
197  if( dist >= farthest_dist )
198  {
199  farthest_dist = dist;
200  farthest = ips[i];
201  }
202  }
203 
204  if( ips.size() <= 1 || nearest.p == farthest.p )
205  {
206  aPre = line;
207  return true;
208  }
209 
210  aPre = line.Slice( 0, nearest.our.Index() );
211  aPre.Append( nearest.p );
212  aPre.Simplify();
213 
214  aWalk.Clear();
215  aWalk.SetClosed( false );
216  aWalk.Append( nearest.p );
217 
218  assert( nearest.their.Index() >= 0 );
219  assert( farthest.their.Index() >= 0 );
220 
221  assert( nearest_dist <= farthest_dist );
222 
223  aObstacle.Split( nearest.p );
224  aObstacle.Split( farthest.p );
225 
226  int i_first = aObstacle.Find( nearest.p );
227  int i_last = aObstacle.Find( farthest.p );
228 
229  int i = i_first;
230 
231  while( i != i_last )
232  {
233  aWalk.Append( aObstacle.CPoint( i ) );
234  i += ( aCw ? 1 : -1 );
235 
236  if( i < 0 )
237  i = aObstacle.PointCount() - 1;
238  else if( i == aObstacle.PointCount() )
239  i = 0;
240  }
241 
242  aWalk.Append( farthest.p );
243  aWalk.Simplify();
244 
245  aPost.Clear();
246  aPost.Append( farthest.p );
247  aPost.Append( line.Slice( farthest.our.Index() + 1, -1 ) );
248  aPost.Simplify();
249 
250  return true;
251 }
const SHAPE_LINE_CHAIN & CLine() const
Const accessor to the underlying shape
Definition: pns_line.h:123
int Index() const
Function Index()
Definition: seg.h:300
bool PointInside(const VECTOR2I &aP) const
Function PointInside()
int Split(const VECTOR2I &aP)
Function Split()
std::vector< INTERSECTION > INTERSECTIONS
int PointCount() const
Function PointCount()
VECTOR2I p
point of intersection between our and their.
static const int dist[10][10]
Definition: dist.cpp:57
const SHAPE_LINE_CHAIN Slice(int aStartIndex, int aEndIndex=-1) const
Function Slice()
void Append(int aX, int aY, bool aAllowDuplication=false)
Function Append()
SHAPE_LINE_CHAIN & Simplify()
Function Simplify()
void SetClosed(bool aClosed)
Function SetClosed()
int Find(const VECTOR2I &aP) const
Function Find()
SEG their
segment belonging from the aOther argument of Intersect()
Class SHAPE_LINE_CHAIN.
void Clear()
Function Clear() Removes all points from the line chain.
SEG our
segment belonging from the (this) argument of Intersect()
const VECTOR2I & CPoint(int aIndex) const
Function CPoint()
void PNS::LINE::Walkaround ( const SHAPE_LINE_CHAIN aObstacle,
SHAPE_LINE_CHAIN aPath,
bool  aCw 
) const

Definition at line 254 of file pns_line.cpp.

References SHAPE_LINE_CHAIN::Append(), SHAPE_LINE_CHAIN::Simplify(), and Walkaround().

255 {
256  SHAPE_LINE_CHAIN walk, post;
257 
258  Walkaround( aObstacle, aPath, walk, post, aCw );
259  aPath.Append( walk );
260  aPath.Append( post );
261  aPath.Simplify();
262 }
bool Walkaround(SHAPE_LINE_CHAIN aObstacle, SHAPE_LINE_CHAIN &aPre, SHAPE_LINE_CHAIN &aWalk, SHAPE_LINE_CHAIN &aPost, bool aCw) const
Calculates a line thightly wrapping a convex hull of an obstacle object (aObstacle).
Definition: pns_line.cpp:158
void Append(int aX, int aY, bool aAllowDuplication=false)
Function Append()
SHAPE_LINE_CHAIN & Simplify()
Function Simplify()
Class SHAPE_LINE_CHAIN.

Member Data Documentation

bool PNS::LINE::m_hasVia
private

If true, the line ends with a via

Definition at line 297 of file pns_line.h.

Referenced by AppendVia(), EndsWithVia(), LINE(), operator=(), and RemoveVia().

PnsKind PNS::ITEM::m_kind
protectedinherited
bool PNS::ITEM::m_movable
protectedinherited

Definition at line 352 of file pns_item.h.

Referenced by PNS::ITEM::ITEM(), LINE(), operator=(), and PNS::SOLID::SOLID().

NODE* PNS::ITEM::m_owner
protectedinherited
BOARD_CONNECTED_ITEM* PNS::ITEM::m_parent
protectedinherited

Definition at line 348 of file pns_item.h.

Referenced by PNS::ITEM::ITEM(), PNS::ITEM::Parent(), and PNS::ITEM::SetParent().

SEGMENT_REFS PNS::LINE::m_segmentRefs
private

List of segments in the owning NODE (ITEM::m_owner) that constitute this line, or NULL if the line is not a part of any node.

Definition at line 288 of file pns_line.h.

Referenced by ClearSegmentLinks(), ClipVertexRange(), ContainsSegment(), copyLinks(), GetLink(), HasLockedSegments(), IsLinked(), LinkCount(), LinkedSegments(), LinkSegment(), Mark(), Marker(), Rank(), Reverse(), SetRank(), ShowLinks(), and Unmark().

VIA PNS::LINE::m_via
private

Via at the end point, if m_hasVia == true

Definition at line 300 of file pns_line.h.

Referenced by AppendVia(), LINE(), operator=(), and Via().

int PNS::LINE::m_width
private

our width

Definition at line 294 of file pns_line.h.

Referenced by LINE(), operator=(), SetWidth(), and Width().

const int PNS::ITEM::UnusedNet = INT_MAX
staticinherited

Definition at line 56 of file pns_item.h.

Referenced by PNS::ITEM::ITEM().


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