KiCad PCB EDA Suite
Loading...
Searching...
No Matches
pns_node.h
Go to the documentation of this file.
1/*
2 * KiRouter - a push-and-(sometimes-)shove PCB router
3 *
4 * Copyright (C) 2013-2014 CERN
5 * Copyright The KiCad Developers, see AUTHORS.txt for contributors.
6 *
7 * @author Tomasz Wlostowski <[email protected]>
8 *
9 * This program is free software: you can redistribute it and/or modify it
10 * under the terms of the GNU General Public License as published by the
11 * Free Software Foundation, either version 3 of the License, or (at your
12 * option) any later version.
13 *
14 * This program is distributed in the hope that it will be useful, but
15 * WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * General Public License for more details.
18 *
19 * You should have received a copy of the GNU General Public License along
20 * with this program. If not, see <http://www.gnu.org/licenses/>.
21 */
22
23#ifndef __PNS_NODE_H
24#define __PNS_NODE_H
25
26#include <vector>
27#include <list>
28#include <set>
29#include <core/minoptmax.h>
30
33
34#include "pns_item.h"
35#include "pns_joint.h"
36#include "pns_itemset.h"
37
38class ZONE;
39namespace PNS {
40
41class ARC;
42class SEGMENT;
43class LINE;
44class SOLID;
45class VIA;
46class INDEX;
47class ROUTER;
48class NODE;
49
50
52{
53 CT_CLEARANCE = 1,
55 CT_LENGTH = 3,
56 CT_WIDTH = 4,
58 CT_VIA_HOLE = 6,
65};
66
73{
77 wxString m_RuleName;
78 wxString m_FromName;
79 wxString m_ToName;
81};
82
83
88{
89 ITEM* m_head = nullptr;
90 ITEM* m_item = nullptr;
96
97 bool operator==(const OBSTACLE& other) const
98 {
99 return m_head == other.m_head && m_item == other.m_item;
100 }
101
102 bool operator<(const OBSTACLE& other) const
103 {
104 if( (uintptr_t)m_head < (uintptr_t)other.m_head )
105 return true;
106 else if ( m_head == other.m_head )
107 return (uintptr_t)m_item < (uintptr_t)other.m_item;
108 return false;
109 }
110};
111
112
114{
117 int m_limitCount = -1;
118 int m_kindMask = -1;
120 std::function<bool(const ITEM*)> m_filter = nullptr;
121 int m_layer = -1;
122};
123
124
126{
128 obstacles( aObs ),
129 options( aOpts )
130 {
131 }
132
133 std::set<OBSTACLE>& obstacles;
135};
136
137
139{
140public:
141 virtual ~RULE_RESOLVER() {}
142
143 virtual int Clearance( const ITEM* aA, const ITEM* aB, bool aUseClearanceEpsilon = true ) = 0;
144
145 virtual NET_HANDLE DpCoupledNet( NET_HANDLE aNet ) = 0;
146 virtual int DpNetPolarity( NET_HANDLE aNet ) = 0;
147 virtual bool DpNetPair( const ITEM* aItem, NET_HANDLE& aNetP, NET_HANDLE& aNetN ) = 0;
148
149 virtual int NetCode( NET_HANDLE aNet ) = 0;
150 virtual wxString NetName( NET_HANDLE aNet ) = 0;
151
152 virtual bool IsInNetTie( const ITEM* aA ) = 0;
153 virtual bool IsNetTieExclusion( const ITEM* aItem, const VECTOR2I& aCollisionPos,
154 const ITEM* aCollidingItem ) = 0;
155
156 virtual bool IsDrilledHole( const PNS::ITEM* aItem ) = 0;
157 virtual bool IsNonPlatedSlot( const PNS::ITEM* aItem ) = 0;
158
163 virtual bool IsKeepout( const ITEM* aObstacle, const ITEM* aItem, bool* aEnforce ) = 0;
164
165 virtual bool QueryConstraint( CONSTRAINT_TYPE aType, const ITEM* aItemA, const ITEM* aItemB,
166 int aLayer, CONSTRAINT* aConstraint ) = 0;
167
168 virtual void ClearCacheForItems( std::vector<const ITEM*>& aItems ) {}
169 virtual void ClearCaches() {}
170 virtual void ClearTemporaryCaches() {}
171
172 virtual int ClearanceEpsilon() const { return 0; }
173};
174
175
177{
178public:
179 OBSTACLE_VISITOR( const ITEM* aItem );
180
182 {
183 }
184
185 void SetWorld( const NODE* aNode, const NODE* aOverride = nullptr );
186
187 void SetLayerContext( int aLayer ) { m_layerContext = aLayer; }
188 void ClearLayerContext() { m_layerContext = std::nullopt; }
189
190 virtual bool operator()( ITEM* aCandidate ) = 0;
191
192protected:
193 bool visit( ITEM* aCandidate );
194
195protected:
196 const ITEM* m_item;
197
198 const NODE* m_node;
200 std::optional<int> m_layerContext;
201};
202
203
205{
206public:
207 LAYER_CONTEXT_SETTER( OBSTACLE_VISITOR& aVisitor, int aLayer ) :
208 m_visitor( aVisitor )
209 {
210 m_visitor.SetLayerContext( aLayer );
211 }
212
214 {
216 }
217
218private:
220};
221
231class NODE : public ITEM_OWNER
232{
233public:
234
237 {
240 };
241
242 typedef std::optional<OBSTACLE> OPT_OBSTACLE;
243 typedef std::vector<ITEM*> ITEM_VECTOR;
244 typedef std::set<OBSTACLE> OBSTACLES;
245
246 NODE();
247 ~NODE();
248
250 int GetClearance( const ITEM* aA, const ITEM* aB, bool aUseClearanceEpsilon = true ) const;
251
253 int GetMaxClearance() const
254 {
255 return m_maxClearance;
256 }
257
259 void SetMaxClearance( int aClearance )
260 {
261 m_maxClearance = aClearance;
262 }
263
266 {
267 m_ruleResolver = aFunc;
268 }
269
271 {
272 return m_ruleResolver;
273 }
274
276 int JointCount() const
277 {
278 return m_joints.size();
279 }
280
282 int Depth() const
283 {
284 return m_depth;
285 }
286
296 int QueryColliding( const ITEM* aItem, OBSTACLES& aObstacles,
297 const COLLISION_SEARCH_OPTIONS& aOpts = COLLISION_SEARCH_OPTIONS() ) const;
298
299 int QueryJoints( const BOX2I& aBox, std::vector<JOINT*>& aJoints,
300 PNS_LAYER_RANGE aLayerMask = PNS_LAYER_RANGE::All(), int aKindMask = ITEM::ANY_T );
301
310 OPT_OBSTACLE NearestObstacle( const LINE* aLine,
312
321 OPT_OBSTACLE CheckColliding( const ITEM* aItem, int aKindMask = ITEM::ANY_T );
322
323
332 OPT_OBSTACLE CheckColliding( const ITEM_SET& aSet, int aKindMask = ITEM::ANY_T );
333
342 OPT_OBSTACLE CheckColliding( const ITEM* aItem, const COLLISION_SEARCH_OPTIONS& aOpts );
343
350 const ITEM_SET HitTest( const VECTOR2I& aPoint ) const;
351
360 bool Add( std::unique_ptr<SEGMENT> aSegment, bool aAllowRedundant = false );
361 void Add( std::unique_ptr<SOLID> aSolid );
362 void Add( std::unique_ptr<VIA> aVia );
363 bool Add( std::unique_ptr<ARC> aArc, bool aAllowRedundant = false );
364
365 void Add( LINE& aLine, bool aAllowRedundant = false );
366
367 void AddEdgeExclusion( std::unique_ptr<SHAPE> aShape );
368 bool QueryEdgeExclusions( const VECTOR2I& aPos ) const;
369
373 void Remove( ARC* aArc );
374 void Remove( SOLID* aSolid );
375 void Remove( VIA* aVia );
376 void Remove( SEGMENT* aSegment );
377 void Remove( ITEM* aItem );
378
384 void Remove( LINE& aLine );
385
392 void Replace( ITEM* aOldItem, std::unique_ptr< ITEM > aNewItem );
393 void Replace( LINE& aOldLine, LINE& aNewLine, bool aAllowRedundantSegments = false );
394
403 NODE* Branch();
404
417 const LINE AssembleLine( LINKED_ITEM* aSeg, int* aOriginSegmentIndex = nullptr,
418 bool aStopAtLockedJoints = false,
419 bool aFollowLockedSegments = false,
420 bool aAllowSegmentSizeMismatch = true );
421
423 void Dump( bool aLong = false );
424
431 void GetUpdatedItems( ITEM_VECTOR& aRemoved, ITEM_VECTOR& aAdded );
432
441 void Commit( NODE* aNode );
442
448 const JOINT* FindJoint( const VECTOR2I& aPos, int aLayer, NET_HANDLE aNet ) const;
449
450 void LockJoint( const VECTOR2I& aPos, const ITEM* aItem, bool aLock );
451
457 const JOINT* FindJoint( const VECTOR2I& aPos, const ITEM* aItem ) const
458 {
459 return FindJoint( aPos, aItem->Layers().Start(), aItem->Net() );
460 }
461
463 int FindLinesBetweenJoints( const JOINT& aA, const JOINT& aB, std::vector<LINE>& aLines );
464
466 void FindLineEnds( const LINE& aLine, JOINT& aA, JOINT& aB );
467
469 void KillChildren();
470
471 void AllItemsInNet( NET_HANDLE aNet, std::set<ITEM*>& aItems, int aKindMask = -1 );
472
473 void ClearRanks( int aMarkerMask = MK_HEAD | MK_VIOLATION );
474
475 void RemoveByMarker( int aMarker );
476
477 ITEM* FindItemByParent( const BOARD_ITEM* aParent );
478
479 std::vector<ITEM*> FindItemsByParent( const BOARD_ITEM* aParent );
480
481 bool HasChildren() const
482 {
483 return !m_children.empty();
484 }
485
487 {
488 return m_parent;
489 }
490
492 bool Overrides( ITEM* aItem ) const
493 {
494 return m_override.find( aItem ) != m_override.end();
495 }
496
497 void FixupVirtualVias();
498
499 void AddRaw( ITEM* aItem, bool aAllowRedundant = false )
500 {
501 add( aItem, aAllowRedundant );
502 }
503
504 const std::unordered_set<ITEM*>& GetOverrides() const
505 {
506 return m_override;
507 }
508
509 VIA* FindViaByHandle ( const VIA_HANDLE& handle ) const;
510
511private:
512 void add( ITEM* aItem, bool aAllowRedundant = false );
513
515 NODE( const NODE& aB );
516 NODE& operator=( const NODE& aB );
517
519 JOINT& touchJoint( const VECTOR2I& aPos, const PNS_LAYER_RANGE& aLayers, NET_HANDLE aNet );
520
522 void linkJoint( const VECTOR2I& aPos, const PNS_LAYER_RANGE& aLayers, NET_HANDLE aNet,
523 ITEM* aWhere );
524
526 void unlinkJoint( const VECTOR2I& aPos, const PNS_LAYER_RANGE& aLayers, NET_HANDLE aNet,
527 ITEM* aWhere );
528
530 void addSolid( SOLID* aSeg );
531 void addSegment( SEGMENT* aSeg );
532 void addVia( VIA* aVia );
533 void addArc( ARC* aVia );
534 void addHole( HOLE* aHole );
535
536 void removeSolidIndex( SOLID* aSeg );
537 void removeSegmentIndex( SEGMENT* aSeg );
538 void removeViaIndex( VIA* aVia );
539 void removeArcIndex( ARC* aVia );
540
541 void doRemove( ITEM* aItem );
542 void unlinkParent();
543 void releaseChildren();
544 void releaseGarbage();
545 void rebuildJoint( const JOINT* aJoint, const ITEM* aItem );
546
547 bool isRoot() const
548 {
549 return m_parent == nullptr;
550 }
551
552 SEGMENT* findRedundantSegment( const VECTOR2I& A, const VECTOR2I& B, const PNS_LAYER_RANGE& lr,
553 NET_HANDLE aNet );
555
556 ARC* findRedundantArc( const VECTOR2I& A, const VECTOR2I& B, const PNS_LAYER_RANGE& lr,
557 NET_HANDLE aNet );
558 ARC* findRedundantArc( ARC* aSeg );
559
561 void followLine( LINKED_ITEM* aCurrent, bool aScanDirection, int& aPos, int aLimit,
562 VECTOR2I* aCorners, LINKED_ITEM** aSegments, bool* aArcReversed,
563 bool& aGuardHit, bool aStopAtLockedJoints, bool aFollowLockedSegments );
564
565private:
566 struct DEFAULT_OBSTACLE_VISITOR;
567 typedef std::unordered_multimap<JOINT::HASH_TAG, JOINT, JOINT::JOINT_TAG_HASH> JOINT_MAP;
568 typedef JOINT_MAP::value_type TagJointPair;
569
572
575 std::set<NODE*> m_children;
576
577 std::unordered_set<ITEM*> m_override;
579
585
586 std::vector< std::unique_ptr<SHAPE> > m_edgeExclusions;
587
588 std::unordered_set<ITEM*> m_garbageItems;
589};
590
591}
592
593#endif
A base class for any item which can be embedded within the BOARD container class, and therefore insta...
Definition: board_item.h:79
Definition: line.h:36
INDEX.
Definition: pns_index.h:47
Base class for PNS router board items.
Definition: pns_item.h:98
const PNS_LAYER_RANGE & Layers() const
Definition: pns_item.h:212
virtual NET_HANDLE Net() const
Definition: pns_item.h:210
A 2D point on a given set of layers and belonging to a certain net, that links together a number of b...
Definition: pns_joint.h:43
LAYER_CONTEXT_SETTER(OBSTACLE_VISITOR &aVisitor, int aLayer)
Definition: pns_node.h:207
OBSTACLE_VISITOR & m_visitor
Definition: pns_node.h:219
Represents a track on a PCB, connecting two non-trivial joints (that is, vias, pads,...
Definition: pns_line.h:62
Keep the router "world" - i.e.
Definition: pns_node.h:232
bool HasChildren() const
Definition: pns_node.h:481
NODE * Branch()
Create a lightweight copy (called branch) of self that tracks the changes (added/removed items) wrs t...
Definition: pns_node.cpp:143
void RemoveByMarker(int aMarker)
Definition: pns_node.cpp:1594
NODE * m_root
root node of the whole hierarchy
Definition: pns_node.h:574
int FindLinesBetweenJoints(const JOINT &aA, const JOINT &aB, std::vector< LINE > &aLines)
Find the joints corresponding to the ends of line aLine.
Definition: pns_node.cpp:1145
NODE * GetParent() const
Check if this branch contains an updated version of the m_item from the root branch.
Definition: pns_node.h:486
std::vector< ITEM * > ITEM_VECTOR
Definition: pns_node.h:243
int GetClearance(const ITEM *aA, const ITEM *aB, bool aUseClearanceEpsilon=true) const
Return the pre-set worst case clearance between any pair of items.
Definition: pns_node.cpp:129
void followLine(LINKED_ITEM *aCurrent, bool aScanDirection, int &aPos, int aLimit, VECTOR2I *aCorners, LINKED_ITEM **aSegments, bool *aArcReversed, bool &aGuardHit, bool aStopAtLockedJoints, bool aFollowLockedSegments)
Definition: pns_node.cpp:992
void addSolid(SOLID *aSeg)
Definition: pns_node.cpp:519
void Replace(ITEM *aOldItem, std::unique_ptr< ITEM > aNewItem)
Replace an item with another one.
Definition: pns_node.cpp:869
bool Overrides(ITEM *aItem) const
Definition: pns_node.h:492
int GetMaxClearance() const
Set the worst-case clearance between any pair of items.
Definition: pns_node.h:253
void removeSegmentIndex(SEGMENT *aSeg)
Definition: pns_node.cpp:774
void SetMaxClearance(int aClearance)
Assign a clearance resolution function object.
Definition: pns_node.h:259
COLLISION_QUERY_SCOPE
< Supported item types
Definition: pns_node.h:237
@ CQS_IGNORE_HOLE_CLEARANCE
check everything except hole2hole / hole2copper
Definition: pns_node.h:239
@ CQS_ALL_RULES
check all rules
Definition: pns_node.h:238
void rebuildJoint(const JOINT *aJoint, const ITEM *aItem)
Definition: pns_node.cpp:788
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.
Definition: pns_node.cpp:1469
void addSegment(SEGMENT *aSeg)
Definition: pns_node.cpp:654
std::vector< std::unique_ptr< SHAPE > > m_edgeExclusions
Definition: pns_node.h:586
ARC * findRedundantArc(const VECTOR2I &A, const VECTOR2I &B, const PNS_LAYER_RANGE &lr, NET_HANDLE aNet)
Definition: pns_node.cpp:1644
void releaseChildren()
Definition: pns_node.cpp:1488
JOINT_MAP::value_type TagJointPair
Definition: pns_node.h:568
void addVia(VIA *aVia)
Definition: pns_node.cpp:542
bool QueryEdgeExclusions(const VECTOR2I &aPos) const
Definition: pns_node.cpp:715
void doRemove(ITEM *aItem)
Definition: pns_node.cpp:727
OPT_OBSTACLE CheckColliding(const ITEM *aItem, int aKindMask=ITEM::ANY_T)
Check if the item collides with anything else in the world, and if found, returns the obstacle.
Definition: pns_node.cpp:410
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.
Definition: pns_node.cpp:1268
void addHole(HOLE *aHole)
Definition: pns_node.cpp:560
std::optional< OBSTACLE > OPT_OBSTACLE
Definition: pns_node.h:242
void unlinkJoint(const VECTOR2I &aPos, const PNS_LAYER_RANGE &aLayers, NET_HANDLE aNet, ITEM *aWhere)
Helpers for adding/removing items.
Definition: pns_node.cpp:1372
std::unordered_set< ITEM * > m_garbageItems
Definition: pns_node.h:588
void Dump(bool aLong=false)
Definition: pns_node.cpp:1382
void AddRaw(ITEM *aItem, bool aAllowRedundant=false)
Definition: pns_node.h:499
NODE(const NODE &aB)
nodes are not copyable
void releaseGarbage()
Definition: pns_node.cpp:1501
int Depth() const
Definition: pns_node.h:282
void addArc(ARC *aVia)
Definition: pns_node.cpp:683
void FindLineEnds(const LINE &aLine, JOINT &aA, JOINT &aB)
Destroy all child nodes. Applicable only to the root node.
Definition: pns_node.cpp:1138
RULE_RESOLVER * GetRuleResolver() const
Return the number of joints.
Definition: pns_node.h:270
JOINT & touchJoint(const VECTOR2I &aPos, const PNS_LAYER_RANGE &aLayers, NET_HANDLE aNet)
Touch a joint and links it to an m_item.
Definition: pns_node.cpp:1302
bool Add(std::unique_ptr< SEGMENT > aSegment, bool aAllowRedundant=false)
Add an item to the current node.
Definition: pns_node.cpp:665
void FixupVirtualVias()
Definition: pns_node.cpp:1179
int QueryJoints(const BOX2I &aBox, std::vector< JOINT * > &aJoints, PNS_LAYER_RANGE aLayerMask=PNS_LAYER_RANGE::All(), int aKindMask=ITEM::ANY_T)
Definition: pns_node.cpp:1679
std::set< OBSTACLE > OBSTACLES
Definition: pns_node.h:244
std::unordered_multimap< JOINT::HASH_TAG, JOINT, JOINT::JOINT_TAG_HASH > JOINT_MAP
Definition: pns_node.h:567
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.
Definition: pns_node.cpp:1047
INDEX * m_index
Geometric/Net index of the items.
Definition: pns_node.h:582
std::unordered_set< ITEM * > m_override
hash of root's items that have been changed in this node
Definition: pns_node.h:577
void AllItemsInNet(NET_HANDLE aNet, std::set< ITEM * > &aItems, int aKindMask=-1)
Definition: pns_node.cpp:1555
OPT_OBSTACLE NearestObstacle(const LINE *aLine, const COLLISION_SEARCH_OPTIONS &aOpts=COLLISION_SEARCH_OPTIONS())
Follow the line in search of an obstacle that is nearest to the starting to the line's starting point...
Definition: pns_node.cpp:286
void LockJoint(const VECTOR2I &aPos, const ITEM *aItem, bool aLock)
Definition: pns_node.cpp:1295
void SetRuleResolver(RULE_RESOLVER *aFunc)
Definition: pns_node.h:265
void removeArcIndex(ARC *aVia)
Definition: pns_node.cpp:781
int JointCount() const
Return the number of nodes in the inheritance chain (wrs to the root node).
Definition: pns_node.h:276
void AddEdgeExclusion(std::unique_ptr< SHAPE > aShape)
Definition: pns_node.cpp:709
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.
Definition: pns_node.cpp:255
NODE & operator=(const NODE &aB)
Try to find matching joint and creates a new one if not found.
int m_maxClearance
worst case item-item clearance
Definition: pns_node.h:580
const JOINT * FindJoint(const VECTOR2I &aPos, const ITEM *aItem) const
Search for a joint at a given position, linked to given item.
Definition: pns_node.h:457
bool isRoot() const
Definition: pns_node.h:547
const std::unordered_set< ITEM * > & GetOverrides() const
Definition: pns_node.h:504
VIA * FindViaByHandle(const VIA_HANDLE &handle) const
Definition: pns_node.cpp:1752
void removeViaIndex(VIA *aVia)
Definition: pns_node.cpp:849
void add(ITEM *aItem, bool aAllowRedundant=false)
Definition: pns_node.cpp:576
void KillChildren()
Definition: pns_node.cpp:1549
void removeSolidIndex(SOLID *aSeg)
Definition: pns_node.cpp:857
int m_depth
depth of the node (number of parent nodes in the inheritance chain)
Definition: pns_node.h:583
std::set< NODE * > m_children
list of nodes branched from this one
Definition: pns_node.h:575
ITEM * FindItemByParent(const BOARD_ITEM *aParent)
Definition: pns_node.cpp:1717
JOINT_MAP m_joints
hash table with the joints, linking the items.
Definition: pns_node.h:570
std::vector< ITEM * > FindItemsByParent(const BOARD_ITEM *aParent)
Definition: pns_node.cpp:1738
NODE * m_parent
node this node was branched from
Definition: pns_node.h:573
void ClearRanks(int aMarkerMask=MK_HEAD|MK_VIOLATION)
Definition: pns_node.cpp:1584
void Remove(ARC *aArc)
Remove an item from this branch.
Definition: pns_node.cpp:909
void unlinkParent()
Definition: pns_node.cpp:179
void Commit(NODE *aNode)
Apply the changes from a given branch (aNode) to the root branch.
Definition: pns_node.cpp:1524
RULE_RESOLVER * m_ruleResolver
Design rules resolver.
Definition: pns_node.h:581
~NODE()
Return the expected clearance between items a and b.
Definition: pns_node.cpp:70
SEGMENT * findRedundantSegment(const VECTOR2I &A, const VECTOR2I &B, const PNS_LAYER_RANGE &lr, NET_HANDLE aNet)
Definition: pns_node.cpp:1609
void linkJoint(const VECTOR2I &aPos, const PNS_LAYER_RANGE &aLayers, NET_HANDLE aNet, ITEM *aWhere)
Unlink an item from a joint.
Definition: pns_node.cpp:1363
const ITEM_SET HitTest(const VECTOR2I &aPoint) const
Find all items that contain the point aPoint.
Definition: pns_node.cpp:490
const NODE * m_node
node we are searching in (either root or a branch)
Definition: pns_node.h:198
const ITEM * m_item
the item we are looking for collisions with
Definition: pns_node.h:196
virtual bool operator()(ITEM *aCandidate)=0
void ClearLayerContext()
Definition: pns_node.h:188
bool visit(ITEM *aCandidate)
Definition: pns_node.cpp:203
std::optional< int > m_layerContext
Definition: pns_node.h:200
void SetLayerContext(int aLayer)
Definition: pns_node.h:187
void SetWorld(const NODE *aNode, const NODE *aOverride=nullptr)
Definition: pns_node.cpp:196
const NODE * m_override
node that overrides root entries
Definition: pns_node.h:199
virtual ~OBSTACLE_VISITOR()
Definition: pns_node.h:181
virtual int NetCode(NET_HANDLE aNet)=0
virtual ~RULE_RESOLVER()
Definition: pns_node.h:141
virtual void ClearCacheForItems(std::vector< const ITEM * > &aItems)
Definition: pns_node.h:168
virtual int ClearanceEpsilon() const
Definition: pns_node.h:172
virtual void ClearTemporaryCaches()
Definition: pns_node.h:170
virtual bool IsNonPlatedSlot(const PNS::ITEM *aItem)=0
virtual int Clearance(const ITEM *aA, const ITEM *aB, bool aUseClearanceEpsilon=true)=0
virtual bool IsNetTieExclusion(const ITEM *aItem, const VECTOR2I &aCollisionPos, const ITEM *aCollidingItem)=0
virtual bool IsDrilledHole(const PNS::ITEM *aItem)=0
virtual bool IsKeepout(const ITEM *aObstacle, const ITEM *aItem, bool *aEnforce)=0
virtual bool DpNetPair(const ITEM *aItem, NET_HANDLE &aNetP, NET_HANDLE &aNetN)=0
virtual bool QueryConstraint(CONSTRAINT_TYPE aType, const ITEM *aItemA, const ITEM *aItemB, int aLayer, CONSTRAINT *aConstraint)=0
virtual bool IsInNetTie(const ITEM *aA)=0
virtual NET_HANDLE DpCoupledNet(NET_HANDLE aNet)=0
virtual int DpNetPolarity(NET_HANDLE aNet)=0
virtual void ClearCaches()
Definition: pns_node.h:169
virtual wxString NetName(NET_HANDLE aNet)=0
Represent a contiguous set of PCB layers.
Definition: pns_layerset.h:32
int Start() const
Definition: pns_layerset.h:86
static PNS_LAYER_RANGE All()
Definition: pns_layerset.h:129
Handle a list of polygons defining a copper zone.
Definition: zone.h:74
@ SOLID
Definition: eda_shape.h:70
Push and Shove diff pair dimensions (gap) settings dialog.
CONSTRAINT_TYPE
Definition: pns_node.h:52
void * NET_HANDLE
Definition: pns_item.h:55
@ MK_VIOLATION
Definition: pns_item.h:44
@ MK_HEAD
Definition: pns_item.h:43
@ VIA
Normal via.
Definition: router_tool.cpp:96
const COLLISION_SEARCH_OPTIONS options
Definition: pns_node.h:134
std::set< OBSTACLE > & obstacles
Definition: pns_node.h:133
COLLISION_SEARCH_CONTEXT(std::set< OBSTACLE > &aObs, const COLLISION_SEARCH_OPTIONS aOpts=COLLISION_SEARCH_OPTIONS())
Definition: pns_node.h:127
std::function< bool(const ITEM *)> m_filter
Definition: pns_node.h:120
An abstract function object, returning a design rule (clearance, diff pair gap, etc) required between...
Definition: pns_node.h:73
wxString m_FromName
Definition: pns_node.h:78
bool m_Allowed
Definition: pns_node.h:76
wxString m_RuleName
Definition: pns_node.h:77
wxString m_ToName
Definition: pns_node.h:79
bool m_IsTimeDomain
Definition: pns_node.h:80
MINOPTMAX< int > m_Value
Definition: pns_node.h:75
CONSTRAINT_TYPE m_Type
Definition: pns_node.h:74
Hold an object colliding with another object, along with some useful data about the collision.
Definition: pns_node.h:88
VECTOR2I m_pos
Definition: pns_node.h:93
int m_distFirst
... and the distance thereof
Definition: pns_node.h:94
int m_clearance
Definition: pns_node.h:92
int m_maxFanoutWidth
worst case (largest) width of the tracks connected to the item
Definition: pns_node.h:95
bool operator==(const OBSTACLE &other) const
Definition: pns_node.h:97
ITEM * m_head
Line we search collisions against.
Definition: pns_node.h:89
bool operator<(const OBSTACLE &other) const
Definition: pns_node.h:102
VECTOR2I m_ipFirst
First intersection between m_head and m_hull.
Definition: pns_node.h:91
ITEM * m_item
Item found to be colliding with m_head.
Definition: pns_node.h:90