40 m_draggedSegmentIndex = 0;
43 m_freeAngleMode =
false;
44 m_forceMarkObstaclesMode =
false;
62 if(
via->PushoutForce( node, lead, force,
ITEM::ANY_T, iterLimit ) )
64 via->SetPos(
via->Pos() + force );
74 int w2 = aSeg->
Width() / 2;
76 auto distA = ( aP - aSeg->
Seg().
A ).EuclideanNorm();
77 auto distB = ( aP - aSeg->
Seg().
B ).EuclideanNorm();
83 psnap = aSeg->
Seg().
A;
85 else if( distB <= w2 )
87 psnap = aSeg->
Seg().
B;
101 if( item->IsVirtual() && item->OfKind(
ITEM::VIA_T ))
102 return static_cast<VVIA*
>( item );
111 int w2 = aSeg->
Width() / 2;
116 auto distA = ( aP - aSeg->
Seg().
A ).EuclideanNorm();
117 auto distB = ( aP - aSeg->
Seg().
B ).EuclideanNorm();
119 if( distA < w2 || distB < w2 )
174 bool foundVia =
false;
204 if( aPrimitives.
Empty() )
207 ITEM* startItem = aPrimitives[0];
231 PNS_DBG(
Dbg(), Message, wxString::Format(
"StartDragging: item %p [kind %d]",
232 startItem, (
int) startItem->
Kind() ) );
234 switch( startItem->
Kind() )
260 m_mode =
static_cast<int>( aMode );
322 if(
Settings().AllowDRCViolations() )
345 LINE draggedLine( *l );
380 bool viaPropOk =
false;
387 std::unique_ptr<VIA> draggedVia =
Clone( *
via );
389 draggedVia->SetPos( aP );
394 vias.insert( draggedVia.get() );
402 viaTargetPos = draggedVia->Pos();
417 LINE draggedLine( *l );
424 if (
m_world->CheckColliding( &draggedLine ) )
450 LINE draggedPostOpt, origLine( aOrig );
455 if(
Settings().GetOptimizeEntireDraggedTrack() )
462 if(
Settings().SmoothDraggedSegments() )
476 affectedArea =
BOX2I( aP );
479 PNS_DBG(
Dbg(), AddShape, *affectedArea,
RED, 0, wxT(
"drag-affected-area" ) );
486 optimizer.
Optimize( &aDragged, &draggedPostOpt, &origLine );
491 draggedPostOpt = aDragged;
555 if (
m_world->CheckColliding( &dragged ) )
561 draggedWalk = dragged;
614 auto preShoveNode =
m_shove->CurrentNode();
618 preShoveNode->Remove( draggedPreShove );
625 LINE draggedPostShove( draggedPreShove );
631 draggedPostShove =
m_shove->GetModifiedHead( 0 );
641 draggedPostShove.
Unmark();
663 PNS_DBG(
Dbg(), Message, wxString::Format(
"head-mod %d",
664 m_shove->HeadsModified() ? 1: 0 ) );
668 newVia =
m_shove->GetModifiedHeadVia( 0 );
670 PNS_DBG(
Dbg(), Message, wxString::Format(
"newvia %d %d %d %d",
std::optional< BOX2I > OPT_BOX2I
void SetDebugDecorator(DEBUG_DECORATOR *aDecorator)
Assign a debug decorator allowing this algo to draw extra graphics for visual debugging.
void SetLogger(LOGGER *aLogger)
virtual LOGGER * Logger()
ROUTER * Router() const
Return current router settings.
ROUTING_SETTINGS & Settings() const
Return the logger object, allowing to dump geometry to a file.
DEBUG_DECORATOR * Dbg() const
ITEM_SET m_draggedItems
If true, moves the connection lines without maintaining 45 degrees corners.
PNS::DRAG_MODE Mode() const override
void optimizeAndUpdateDraggedLine(LINE &aDragged, const LINE &aOrig, const VECTOR2I &aP)
const ITEM_SET findViaFanoutByHandle(NODE *aNode, const VIA_HANDLE &handle)
bool startDragSegment(const VECTOR2D &aP, SEGMENT *aSeg)
VECTOR2D m_lastValidPoint
Contains the list of items that are currently modified by the dragger.
virtual bool Start(const VECTOR2I &aP, ITEM_SET &aPrimitives) override
Function Start()
NODE * CurrentNode() const override
Function CurrentNode()
bool dragViaMarkObstacles(const VIA_HANDLE &aHandle, NODE *aNode, const VECTOR2I &aP)
bool Drag(const VECTOR2I &aP) override
Function Drag()
bool startDragVia(VIA *aVia)
int m_draggedSegmentIndex
const std::vector< NET_HANDLE > CurrentNets() const override
Function CurrentNets()
bool dragShove(const VECTOR2I &aP)
void SetMode(PNS::DRAG_MODE aDragMode) override
bool dragMarkObstacles(const VECTOR2I &aP)
bool FixRoute(bool aForceCommit) override
Function FixRoute()
std::unique_ptr< SHOVE > m_shove
bool dragWalkaround(const VECTOR2I &aP)
VVIA * checkVirtualVia(const VECTOR2D &aP, SEGMENT *aSeg)
bool dragViaWalkaround(const VIA_HANDLE &aHandle, NODE *aNode, const VECTOR2I &aP)
bool m_forceMarkObstaclesMode
const ITEM_SET Traces() override
Function Traces()
bool tryWalkaround(NODE *aNode, LINE &aOrig, LINE &aWalk)
bool startDragArc(const VECTOR2D &aP, ARC *aArc)
MOUSE_TRAIL_TRACER m_mouseTrailTracer
bool propagateViaForces(NODE *node, std::set< VIA * > &vias)
DRAG_ALGO(ROUTER *aRouter)
void Add(const LINE &aLine)
std::vector< ITEM * > & Items()
Base class for PNS router board items.
virtual void Unmark(int aMarker=-1) const
PnsKind Kind() const
Return the type (kind) of the item.
A 2D point on a given set of layers and belonging to a certain net, that links together a number of b...
const std::vector< ITEM * > & LinkList() const
Represents a track on a PCB, connecting two non-trivial joints (that is, vias, pads,...
OPT_BOX2I ChangedArea(const LINE *aOther) const
const SHAPE_LINE_CHAIN & CLine() const
SHAPE_LINE_CHAIN & Line()
void DragCorner(const VECTOR2I &aP, int aIndex, bool aFreeAngle=false, DIRECTION_45 aPreferredEndingDirection=DIRECTION_45())
void SetSnapThreshhold(int aThreshhold)
virtual void Unmark(int aMarker=-1) const override
void DragSegment(const VECTOR2I &aP, int aIndex, bool aFreeAngle=false)
void Reverse()
Clip the line to the nearest obstacle, traversing from the line's start vertex (0).
virtual LINE * Clone() const override
Return a deep copy of the item.
virtual void ClearLinks()
Return the number of segments that were assembled together to form this line.
Keep the router "world" - i.e.
const JOINT * FindJoint(const VECTOR2I &aPos, int aLayer, NET_HANDLE aNet) const
Search for a joint at a given position, layer and belonging to given net.
const LINE AssembleLine(LINKED_ITEM *aSeg, int *aOriginSegmentIndex=nullptr, bool aStopAtLockedJoints=false, bool aFollowLockedSegments=false, bool aAllowSegmentSizeMismatch=true)
Follow the joint map to assemble a line connecting two non-trivial joints starting from segment aSeg.
Perform various optimizations of the lines being routed, attempting to make the lines shorter and les...
void SetPreserveVertex(const VECTOR2I &aV)
void SetRestrictArea(const BOX2I &aArea, bool aStrict=true)
void SetEffortLevel(int aEffort)
static bool Optimize(LINE *aLine, int aEffortLevel, NODE *aWorld, const VECTOR2I &aV=VECTOR2I(0, 0))
@ LIMIT_CORNER_COUNT
Do not attempt to optimize if the resulting line's corner count is outside the predefined range.
@ MERGE_SEGMENTS
Reduce corner cost iteratively.
@ MERGE_COLINEAR
Merge co-linear segments.
int ViaForcePropIterationLimit() const
bool SmoothDraggedSegments() const
Enable/disable smoothing segments during dragging.
PNS_MODE Mode() const
Set the routing mode.
int Width() const override
@ SHP_DONT_LOCK_ENDPOINTS
const VIA_HANDLE MakeHandle() const
void SetIterationLimit(const int aIterLimit)
void SetLengthLimit(bool aEnable, double aLengthExpansionFactor)
void SetSolidsOnly(bool aSolidsOnly)
STATUS Route(const LINE &aInitialPath, LINE &aWalkPath, bool aOptimize=true)
void SetAllowedPolicies(std::vector< WALK_POLICY > aPolicies)
int Split(const VECTOR2I &aP, bool aExact=false)
Insert the point aP belonging to one of the our segments, splitting the adjacent segment in two.
int PointCount() const
Return the number of points (vertices) in this line chain.
const VECTOR2I NearestPoint(const VECTOR2I &aP, bool aAllowInternalShapePoints=true) const
Find a point on the line chain that is closest to point aP.
int Find(const VECTOR2I &aP, int aThreshold=0) const
Search for point aP.
Push and Shove diff pair dimensions (gap) settings dialog.
@ RM_MarkObstacles
Ignore collisions, mark obstacles.
@ RM_Walkaround
Only walk around.
std::unique_ptr< typename std::remove_const< T >::type > Clone(const T &aItem)
#define PNS_DBG(dbg, method,...)
LINE lines[MaxWalkPolicies]
STATUS status[MaxWalkPolicies]
Casted dyn_cast(From aObject)
A lightweight dynamic downcast.
VECTOR2< int32_t > VECTOR2I
VECTOR2< double > VECTOR2D