100 m_world = std::make_unique<NODE>( );
110 m_world->SetRuleResolver(
nullptr );
127 NODE* node =
nullptr;
160 wxCHECK( node, ret );
164 for(
const OBSTACLE& obstacle : obs )
165 ret.
Add( obstacle.m_item,
false );
184 if( aStartItems.
Empty() )
191 m_dragger = std::make_unique<COMPONENT_DRAGGER>(
this );
202 m_dragger = std::make_unique<DRAGGER>(
this );
217 if(
m_dragger->Start( aP, aStartItems ) )
232 if(
Settings().AllowDRCViolations() )
245 wxString failureReason;
250 if( item->BoardItem() && item->BoardItem()->GetLayer() ==
Edge_Cuts )
253 if( !item->Layers().Overlaps( aLayer ) )
256 if( item->IsRoutable() )
258 failureReason = wxEmptyString;
265 switch( parent->
Type() )
271 if(
pad->GetAttribute() == PAD_ATTRIB::NPTH )
272 failureReason =
_(
"Cannot start routing from a non-plated hole." );
278 ZONE* zone =
static_cast<ZONE*
>( parent );
282 failureReason = wxString::Format(
_(
"Rule area '%s' disallows tracks." ),
287 failureReason =
_(
"Rule area disallows tracks." );
295 failureReason =
_(
"Cannot start routing from a text item." );
304 if( !failureReason.IsEmpty() )
317 dummyStartSeg.
Append( startPoint );
318 dummyStartSeg.
Append( startPoint,
true );
320 dummyStartLine.
SetShape( dummyStartSeg );
322 dummyStartLine.
SetNet( aStartItem ? aStartItem->
Net() : 0 );
333 ITEM_SET dummyStartSet( &dummyStartLine );
338 for(
ITEM* item : highlightedItems )
350 SetFailureReason(
_(
"Cannot start a differential pair in the middle of nowhere." ) );
366 LINE dummyStartLineA;
367 LINE dummyStartLineB;
375 dummyStartLineA.
SetShape( dummyStartSegA );
380 dummyStartLineB.
SetShape( dummyStartSegB );
399 dummyStartSet.
Add( dummyStartLineA );
400 dummyStartSet.
Add( dummyStartLineB );
403 for(
ITEM* item : highlightedItems )
428 m_placer = std::make_unique<LINE_PLACER>(
this );
432 m_placer = std::make_unique<DIFF_PAIR_PLACER>(
this );
436 m_placer = std::make_unique<MEANDER_PLACER>(
this );
440 m_placer = std::make_unique<DP_MEANDER_PLACER>(
this );
444 m_placer = std::make_unique<MEANDER_SKEW_PLACER>(
this );
456 if(
m_placer->Start( aP, aStartItem ) )
499 ITEM*& aOtherEndItem )
507 if( placer ==
nullptr || placer->
Traces().
Size() == 0 )
512 if( trace ==
nullptr )
542 aOtherEndLayers = it->
Layers();
556 if( placer ==
nullptr || placer->
Traces().
Size() == 0 )
561 if( current ==
nullptr )
567 ITEM* otherEndItem =
nullptr;
580 Move( otherEnd, otherEndItem );
582 }
while( placer->
CurrentEnd() != moveResultPoint && triesLeft );
586 return FixRoute( otherEnd, otherEndItem,
false );
596 if( placer ==
nullptr || placer->
Traces().
Size() == 0 )
601 if( current ==
nullptr )
608 ITEM* otherEndItem =
nullptr;
617 int nextLayer = otherEndLayers.
Overlaps( currentLayer ) ? currentLayer : otherEndLayers.
Start();
619 if( !
StartRouting( otherEnd, otherEndItem, nextLayer ) )
623 Move( currentEnd, current );
644 [&](
ITEM* currentItem,
ITEM* itemToMark )
646 std::unique_ptr<ITEM> tmp( itemToMark->Clone() );
649 bool removeOriginal =
true;
651 clearance = aNode->
GetClearance( currentItem, itemToMark );
654 tmp->SetLayer( currentItem->
Layer() );
656 if( itemToMark->IsCompoundShapePrimitive() )
660 removeOriginal =
false;
666 aRemoved.push_back( itemToMark );
677 LINE* l =
static_cast<LINE*
>( item );
691 for(
const OBSTACLE& obs : obstacles )
694 if( draggedItems.
Contains( obs.m_item ) )
697 obs.m_item->Mark( obs.m_item->Marker() |
MK_VIOLATION );
698 updateItem( item, obs.m_item );
703 LINE* line =
static_cast<LINE*
>( item );
725 std::vector<const PNS::ITEM*> cacheCheckItems( added.begin(), added.end() );
728 for(
ITEM* item : added )
734 for(
ITEM* item : removed )
753 bool ret =
m_placer->Move( aP, aEndItem );
761 const LINE* l =
static_cast<const LINE*
>( item );
774 int annularWidth = std::max( 0,
via.Diameter() -
via.Drill() ) / 2;
775 int excessHoleClearance = holeClearance - annularWidth;
777 if( excessHoleClearance > clearance )
778 clearance = excessHoleClearance;
794 std::vector<PNS::ITEM*>& aHeads )
796 NODE *node =
nullptr;
801 node =
m_placer->CurrentNode(
true );
818 aHeads.push_back( item->Clone() );
833 for(
ITEM* item : removed )
835 bool is_changed =
false;
841 for( NODE::ITEM_VECTOR::iterator added_it = added.begin();
842 added_it != added.end(); ++added_it )
844 if( ( *added_it )->Parent() && ( *added_it )->Parent() == item->Parent() )
846 changed.push_back( *added_it );
847 added.erase( added_it );
854 if( !is_changed && !item->IsVirtual() )
858 for(
ITEM* item : added )
860 if( !item->IsVirtual() )
864 for(
ITEM* item : changed )
866 if( !item->IsVirtual() )
885 rv =
m_placer->FixRoute( aP, aEndItem, aForceFinish );
928 std::vector<NET_HANDLE> nets;
968 return m_placer->SetLayer( aLayer );
978 bool toggle = !
m_placer->IsPlacingVia();
994 return std::vector<NET_HANDLE>();
static const ADVANCED_CFG & GetCfg()
Get the singleton instance's config, which is shared by all consumers.
A base class for any item which can be embedded within the BOARD container class, and therefore insta...
@ ROUNDED_90
H/V with filleted corners.
@ MITERED_90
H/V only (90-degree corners)
@ ROUNDED_45
H/V/45 with filleted corners.
@ MITERED_45
H/V/45 with mitered corners (default)
KICAD_T Type() const
Returns the type of object.
Represent a contiguous set of PCB layers.
bool IsMultilayer() const
bool Overlaps(const LAYER_RANGE &aOther) const
static bool FindDpPrimitivePair(NODE *aWorld, const VECTOR2I &aP, ITEM *aItem, DP_PRIMITIVE_PAIR &aPair, wxString *aErrorMsg=nullptr)
Store starting/ending primitives (pads, vias or segments) for a differential pair.
const VECTOR2I & AnchorN() const
const VECTOR2I & AnchorP() const
virtual const ITEM_SET Traces()=0
Function Traces()
int Count(int aKindMask=-1) const
void Add(const LINE &aLine)
bool Contains(ITEM *aItem) const
std::vector< ITEM * > & Items()
const std::vector< ITEM * > & CItems() const
Base class for PNS router board items.
virtual NET_HANDLE Net() const
void SetNet(NET_HANDLE aNet)
virtual int Layer() const
void SetLayer(int aLayer)
const LAYER_RANGE & Layers() const
virtual VECTOR2I Anchor(int n) const
A 2D point on a given set of layers and belonging to a certain net, that links together a number of b...
Single track placement algorithm.
bool SplitAdjacentSegments(NODE *aNode, ITEM *aSeg, const VECTOR2I &aP)
Check if point aP lies on segment aSeg.
Represents a track on a PCB, connecting two non-trivial joints (that is, vias, pads,...
ITEM * GetBlockingObstacle() const
void SetShape(const SHAPE_LINE_CHAIN &aLine)
Return the shape of the line.
void SetWidth(int aWidth)
Return line width.
void Log(EVENT_TYPE evt, const VECTOR2I &pos=VECTOR2I(), const ITEM *item=nullptr, const SIZES_SETTINGS *sizes=nullptr)
Keep the router "world" - i.e.
std::vector< ITEM * > ITEM_VECTOR
int GetClearance(const ITEM *aA, const ITEM *aB, bool aUseClearanceEpsilon=true) const
Return the pre-set worst case clearance between any pair of items.
void GetUpdatedItems(ITEM_VECTOR &aRemoved, ITEM_VECTOR &aAdded)
Return the list of items removed and added in this branch with respect to the root branch.
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.
std::set< OBSTACLE > OBSTACLES
int QueryColliding(const ITEM *aItem, OBSTACLES &aObstacles, const COLLISION_SEARCH_OPTIONS &aOpts=COLLISION_SEARCH_OPTIONS()) const
Find items colliding (closer than clearance) with the item aItem.
const ITEM_SET HitTest(const VECTOR2I &aPoint) const
Find all items that contain the point aPoint.
virtual NODE * CurrentNode(bool aLoopsRemoved=false) const =0
Function CurrentNode()
virtual const VECTOR2I & CurrentEnd() const =0
Function CurrentEnd()
virtual const ITEM_SET Traces()=0
Function Traces()
virtual const VECTOR2I & CurrentStart() const =0
Function CurrentStart()
virtual int CurrentLayer() const =0
Function CurrentLayer()
virtual const std::vector< NET_HANDLE > CurrentNets() const =0
Function CurrentNets()
virtual void RemoveItem(ITEM *aItem)=0
virtual void UpdateItem(ITEM *aItem)=0
virtual DEBUG_DECORATOR * GetDebugDecorator()=0
virtual void HideItem(ITEM *aItem)=0
virtual void UpdateNet(NET_HANDLE aNet)=0
virtual void AddItem(ITEM *aItem)=0
virtual void EraseView()=0
virtual void SyncWorld(NODE *aNode)=0
virtual void DisplayItem(const ITEM *aItem, int aClearance, bool aEdit=false, bool aIsHeadTrace=false)=0
void updateView(NODE *aNode, ITEM_SET &aCurrent, bool aDragging=false)
void SetMode(ROUTER_MODE aMode)
bool moveDragging(const VECTOR2I &aP, ITEM *aItem)
bool SwitchLayer(int layer)
void ClearViewDecorations()
bool getNearestRatnestAnchor(VECTOR2I &aOtherEnd, LAYER_RANGE &aOtherEndLayers, ITEM *&aOtherEndItem)
PLACEMENT_ALGO * Placer()
void UpdateSizes(const SIZES_SETTINGS &aSizes)
Applies stored settings.
void SetFailureReason(const wxString &aReason)
bool m_forceMarkObstaclesMode
std::unique_ptr< DRAG_ALGO > m_dragger
void SetInterface(ROUTER_IFACE *aIface)
void markViolations(NODE *aNode, ITEM_SET &aCurrent, NODE::ITEM_VECTOR &aRemoved)
std::unique_ptr< PLACEMENT_ALGO > m_placer
bool isStartingPointRoutable(const VECTOR2I &aWhere, ITEM *aItem, int aLayer)
bool IsPlacingVia() const
RULE_RESOLVER * GetRuleResolver() const
const ITEM_SET QueryHoverItems(const VECTOR2I &aP, bool aUseClearance=false)
ROUTING_SETTINGS & Settings()
bool FixRoute(const VECTOR2I &aP, ITEM *aItem, bool aForceFinish=false)
bool movePlacing(const VECTOR2I &aP, ITEM *aItem)
bool RoutingInProgress() const
static ROUTER * GetInstance()
std::optional< VECTOR2I > UndoLastSegment()
void BreakSegment(ITEM *aItem, const VECTOR2I &aP)
void SetOrthoMode(bool aEnable)
bool StartDragging(const VECTOR2I &aP, ITEM *aItem, int aDragMode=DM_ANY)
bool StartRouting(const VECTOR2I &aP, ITEM *aItem, int aLayer)
int GetCurrentLayer() const
void GetUpdatedItems(std::vector< PNS::ITEM * > &aRemoved, std::vector< PNS::ITEM * > &aAdded, std::vector< PNS::ITEM * > &aHeads)
std::unique_ptr< NODE > m_world
void ToggleViaPlacement()
ROUTING_SETTINGS * m_settings
const std::vector< NET_HANDLE > GetCurrentNets() const
bool Move(const VECTOR2I &aP, ITEM *aItem)
void SetCornerMode(DIRECTION_45::CORNER_MODE aMode)
DIRECTION_45::CORNER_MODE GetCornerMode() const
virtual void ClearCacheForItems(std::vector< const ITEM * > &aItems)
virtual int Clearance(const ITEM *aA, const ITEM *aB, bool aUseClearanceEpsilon=true)=0
virtual void ClearCaches()
int DiffPairWidth() const
int BoardMinTrackWidth() const
ITEM * NearestUnconnectedItem(const JOINT *aStart, int *aAnchor=nullptr, int aKindMask=ITEM::ANY_T)
bool NearestUnconnectedAnchorPoint(const LINE *aTrack, VECTOR2I &aPoint, LAYER_RANGE &aLayers, ITEM *&aItem)
Represent a polyline containing arcs as well as line segments: A chain of connected line and/or arc s...
void Append(int aX, int aY, bool aAllowDuplication=false)
Append a new point at the end of the line chain.
Handle a list of polygons defining a copper zone.
const wxString & GetZoneName() const
static bool empty(const wxTextEntryBase *aCtrl)
Push and Shove diff pair dimensions (gap) settings dialog.
static ROUTER * theRouter
@ PNS_MODE_ROUTE_DIFF_PAIR
@ PNS_MODE_TUNE_DIFF_PAIR
@ PNS_MODE_TUNE_DIFF_PAIR_SKEW
Hold an object colliding with another object, along with some useful data about the collision.
@ PCB_TEXTBOX_T
class PCB_TEXTBOX, wrapped text on a layer
@ PCB_ZONE_T
class ZONE, a copper pour area
@ PCB_TEXT_T
class PCB_TEXT, text on a layer
@ PCB_FIELD_T
class PCB_FIELD, text associated with a footprint property
@ PCB_PAD_T
class PAD, a pad in a footprint