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 (C) 2016-2023 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;
80};
81
82
87{
88 ITEM* m_head = nullptr;
89 ITEM* m_item = nullptr;
95
96 bool operator==(const OBSTACLE& other) const
97 {
98 return m_head == other.m_head && m_item == other.m_item;
99 }
100
101 bool operator<(const OBSTACLE& other) const
102 {
103 if( (uintptr_t)m_head < (uintptr_t)other.m_head )
104 return true;
105 else if ( m_head == other.m_head )
106 return (uintptr_t)m_item < (uintptr_t)other.m_item;
107 return false;
108 }
109};
110
111
113{
116 int m_limitCount = -1;
117 int m_kindMask = -1;
119 std::set<ITEM*>* m_restrictedSet = nullptr;
120};
121
122
124{
125 COLLISION_SEARCH_CONTEXT( std::set<OBSTACLE>& aObs, const COLLISION_SEARCH_OPTIONS aOpts ) :
126 obstacles( aObs ),
127 options( aOpts )
128 {
129 }
130
131 std::set<OBSTACLE>& obstacles;
133};
134
135
137{
138public:
139 virtual ~RULE_RESOLVER() {}
140
141 virtual int Clearance( const ITEM* aA, const ITEM* aB, bool aUseClearanceEpsilon = true ) = 0;
142
143 virtual NET_HANDLE DpCoupledNet( NET_HANDLE aNet ) = 0;
144 virtual int DpNetPolarity( NET_HANDLE aNet ) = 0;
145 virtual bool DpNetPair( const ITEM* aItem, NET_HANDLE& aNetP, NET_HANDLE& aNetN ) = 0;
146
147 virtual int NetCode( NET_HANDLE aNet ) = 0;
148 virtual wxString NetName( NET_HANDLE aNet ) = 0;
149
150 virtual bool IsInNetTie( const ITEM* aA ) = 0;
151 virtual bool IsNetTieExclusion( const ITEM* aItem, const VECTOR2I& aCollisionPos,
152 const ITEM* aCollidingItem ) = 0;
153
154 virtual bool IsDrilledHole( const PNS::ITEM* aItem ) = 0;
155 virtual bool IsNonPlatedSlot( const PNS::ITEM* aItem ) = 0;
156
161 virtual bool IsKeepout( const ITEM* aObstacle, const ITEM* aItem, bool* aEnforce ) = 0;
162
163 virtual bool QueryConstraint( CONSTRAINT_TYPE aType, const ITEM* aItemA, const ITEM* aItemB,
164 int aLayer, CONSTRAINT* aConstraint ) = 0;
165
166 virtual void ClearCacheForItems( std::vector<const ITEM*>& aItems ) {}
167 virtual void ClearCaches() {}
168 virtual void ClearTemporaryCaches() {}
169
170 virtual int ClearanceEpsilon() const { return 0; }
171};
172
173
175{
176public:
177 OBSTACLE_VISITOR( const ITEM* aItem );
178
180 {
181 }
182
183 void SetWorld( const NODE* aNode, const NODE* aOverride = nullptr );
184
185 virtual bool operator()( ITEM* aCandidate ) = 0;
186
187protected:
188 bool visit( ITEM* aCandidate );
189
190protected:
191 const ITEM* m_item;
192
193 const NODE* m_node;
195};
196
206class NODE : public ITEM_OWNER
207{
208public:
209
212 {
215 };
216
217 typedef std::optional<OBSTACLE> OPT_OBSTACLE;
218 typedef std::vector<ITEM*> ITEM_VECTOR;
219 typedef std::set<OBSTACLE> OBSTACLES;
220
221 NODE();
222 ~NODE();
223
225 int GetClearance( const ITEM* aA, const ITEM* aB, bool aUseClearanceEpsilon = true ) const;
226
228 int GetMaxClearance() const
229 {
230 return m_maxClearance;
231 }
232
234 void SetMaxClearance( int aClearance )
235 {
236 m_maxClearance = aClearance;
237 }
238
241 {
242 m_ruleResolver = aFunc;
243 }
244
246 {
247 return m_ruleResolver;
248 }
249
251 int JointCount() const
252 {
253 return m_joints.size();
254 }
255
257 int Depth() const
258 {
259 return m_depth;
260 }
261
271 int QueryColliding( const ITEM* aItem, OBSTACLES& aObstacles,
272 const COLLISION_SEARCH_OPTIONS& aOpts = COLLISION_SEARCH_OPTIONS() ) const;
273
274 int QueryJoints( const BOX2I& aBox, std::vector<JOINT*>& aJoints,
275 LAYER_RANGE aLayerMask = LAYER_RANGE::All(), int aKindMask = ITEM::ANY_T );
276
286 OPT_OBSTACLE NearestObstacle( const LINE* aLine,
288
297 OPT_OBSTACLE CheckColliding( const ITEM* aItem, int aKindMask = ITEM::ANY_T );
298
299
308 OPT_OBSTACLE CheckColliding( const ITEM_SET& aSet, int aKindMask = ITEM::ANY_T );
309
316 const ITEM_SET HitTest( const VECTOR2I& aPoint ) const;
317
326 bool Add( std::unique_ptr< SEGMENT >&& aSegment, bool aAllowRedundant = false );
327 void Add( std::unique_ptr< SOLID >&& aSolid );
328 void Add( std::unique_ptr< VIA >&& aVia );
329 bool Add( std::unique_ptr< ARC >&& aArc, bool aAllowRedundant = false );
330
331 void Add( LINE& aLine, bool aAllowRedundant = false );
332
333 void AddEdgeExclusion( std::unique_ptr<SHAPE> aShape );
334 bool QueryEdgeExclusions( const VECTOR2I& aPos ) const;
335
339 void Remove( ARC* aArc );
340 void Remove( SOLID* aSolid );
341 void Remove( VIA* aVia );
342 void Remove( SEGMENT* aSegment );
343 void Remove( ITEM* aItem );
344
350 void Remove( LINE& aLine );
351
358 void Replace( ITEM* aOldItem, std::unique_ptr< ITEM >&& aNewItem );
359 void Replace( LINE& aOldLine, LINE& aNewLine );
360
369 NODE* Branch();
370
382 const LINE AssembleLine( LINKED_ITEM* aSeg, int* aOriginSegmentIndex = nullptr,
383 bool aStopAtLockedJoints = false,
384 bool aFollowLockedSegments = false );
385
387 void Dump( bool aLong = false );
388
395 void GetUpdatedItems( ITEM_VECTOR& aRemoved, ITEM_VECTOR& aAdded );
396
405 void Commit( NODE* aNode );
406
412 const JOINT* FindJoint( const VECTOR2I& aPos, int aLayer, NET_HANDLE aNet ) const;
413
414 void LockJoint( const VECTOR2I& aPos, const ITEM* aItem, bool aLock );
415
421 const JOINT* FindJoint( const VECTOR2I& aPos, const ITEM* aItem ) const
422 {
423 return FindJoint( aPos, aItem->Layers().Start(), aItem->Net() );
424 }
425
427 int FindLinesBetweenJoints( const JOINT& aA, const JOINT& aB, std::vector<LINE>& aLines );
428
430 void FindLineEnds( const LINE& aLine, JOINT& aA, JOINT& aB );
431
433 void KillChildren();
434
435 void AllItemsInNet( NET_HANDLE aNet, std::set<ITEM*>& aItems, int aKindMask = -1 );
436
437 void ClearRanks( int aMarkerMask = MK_HEAD | MK_VIOLATION );
438
439 void RemoveByMarker( int aMarker );
440
441 ITEM* FindItemByParent( const BOARD_ITEM* aParent );
442
443 std::vector<ITEM*> FindItemsByZone( const ZONE* aParent );
444
445 bool HasChildren() const
446 {
447 return !m_children.empty();
448 }
449
451 {
452 return m_parent;
453 }
454
456 bool Overrides( ITEM* aItem ) const
457 {
458 return m_override.find( aItem ) != m_override.end();
459 }
460
461 void FixupVirtualVias();
462
463 void AddRaw( ITEM* aItem, bool aAllowRedundant = false )
464 {
465 add( aItem, aAllowRedundant );
466 }
467
468private:
469 void add( ITEM* aItem, bool aAllowRedundant = false );
470
472 NODE( const NODE& aB );
473 NODE& operator=( const NODE& aB );
474
476 JOINT& touchJoint( const VECTOR2I& aPos, const LAYER_RANGE& aLayers, NET_HANDLE aNet );
477
479 void linkJoint( const VECTOR2I& aPos, const LAYER_RANGE& aLayers, NET_HANDLE aNet,
480 ITEM* aWhere );
481
483 void unlinkJoint( const VECTOR2I& aPos, const LAYER_RANGE& aLayers, NET_HANDLE aNet,
484 ITEM* aWhere );
485
487 void addSolid( SOLID* aSeg );
488 void addSegment( SEGMENT* aSeg );
489 void addVia( VIA* aVia );
490 void addArc( ARC* aVia );
491 void addHole( HOLE* aHole );
492
493 void removeSolidIndex( SOLID* aSeg );
494 void removeSegmentIndex( SEGMENT* aSeg );
495 void removeViaIndex( VIA* aVia );
496 void removeArcIndex( ARC* aVia );
497
498 void doRemove( ITEM* aItem );
499 void unlinkParent();
500 void releaseChildren();
501 void releaseGarbage();
502 void rebuildJoint( const JOINT* aJoint, const ITEM* aItem );
503
504 bool isRoot() const
505 {
506 return m_parent == nullptr;
507 }
508
509 SEGMENT* findRedundantSegment( const VECTOR2I& A, const VECTOR2I& B, const LAYER_RANGE& lr,
510 NET_HANDLE aNet );
512
513 ARC* findRedundantArc( const VECTOR2I& A, const VECTOR2I& B, const LAYER_RANGE& lr,
514 NET_HANDLE aNet );
515 ARC* findRedundantArc( ARC* aSeg );
516
518 void followLine( LINKED_ITEM* aCurrent, bool aScanDirection, int& aPos, int aLimit,
519 VECTOR2I* aCorners, LINKED_ITEM** aSegments, bool* aArcReversed,
520 bool& aGuardHit, bool aStopAtLockedJoints, bool aFollowLockedSegments );
521
522private:
523 struct DEFAULT_OBSTACLE_VISITOR;
524 typedef std::unordered_multimap<JOINT::HASH_TAG, JOINT, JOINT::JOINT_TAG_HASH> JOINT_MAP;
525 typedef JOINT_MAP::value_type TagJointPair;
526
529
532 std::set<NODE*> m_children;
533
534 std::unordered_set<ITEM*> m_override;
536
542
543 std::vector< std::unique_ptr<SHAPE> > m_edgeExclusions;
544
545 std::unordered_set<ITEM*> m_garbageItems;
546};
547
548}
549
550#endif
A base class for any item which can be embedded within the BOARD container class, and therefore insta...
Definition: board_item.h:77
Represent a contiguous set of PCB layers.
Definition: pns_layerset.h:32
int Start() const
Definition: pns_layerset.h:82
static LAYER_RANGE All()
Definition: pns_layerset.h:125
INDEX.
Definition: pns_index.h:46
Base class for PNS router board items.
Definition: pns_item.h:97
virtual NET_HANDLE Net() const
Definition: pns_item.h:193
const LAYER_RANGE & Layers() const
Definition: pns_item.h:195
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
Represents a track on a PCB, connecting two non-trivial joints (that is, vias, pads,...
Definition: pns_line.h:61
Keep the router "world" - i.e.
Definition: pns_node.h:207
bool HasChildren() const
Definition: pns_node.h:445
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:1535
NODE * m_root
root node of the whole hierarchy
Definition: pns_node.h:531
SEGMENT * findRedundantSegment(const VECTOR2I &A, const VECTOR2I &B, const LAYER_RANGE &lr, NET_HANDLE aNet)
Definition: pns_node.cpp:1550
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:1101
NODE * GetParent() const
Check if this branch contains an updated version of the m_item from the root branch.
Definition: pns_node.h:450
std::vector< ITEM * > ITEM_VECTOR
Definition: pns_node.h:218
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:959
void addSolid(SOLID *aSeg)
Definition: pns_node.cpp:512
bool Overrides(ITEM *aItem) const
Definition: pns_node.h:456
int GetMaxClearance() const
Set the worst-case clearance between any pair of items.
Definition: pns_node.h:228
void removeSegmentIndex(SEGMENT *aSeg)
Definition: pns_node.cpp:759
void SetMaxClearance(int aClearance)
Assign a clearance resolution function object.
Definition: pns_node.h:234
COLLISION_QUERY_SCOPE
< Supported item types
Definition: pns_node.h:212
@ CQS_IGNORE_HOLE_CLEARANCE
check everything except hole2hole / hole2copper
Definition: pns_node.h:214
@ CQS_ALL_RULES
check all rules
Definition: pns_node.h:213
void rebuildJoint(const JOINT *aJoint, const ITEM *aItem)
Definition: pns_node.cpp:773
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:1410
void addSegment(SEGMENT *aSeg)
Definition: pns_node.cpp:646
std::vector< std::unique_ptr< SHAPE > > m_edgeExclusions
Definition: pns_node.h:543
void releaseChildren()
Definition: pns_node.cpp:1429
JOINT_MAP::value_type TagJointPair
Definition: pns_node.h:525
void addVia(VIA *aVia)
Definition: pns_node.cpp:535
bool QueryEdgeExclusions(const VECTOR2I &aPos) const
Definition: pns_node.cpp:707
void doRemove(ITEM *aItem)
Definition: pns_node.cpp:719
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:1206
void addHole(HOLE *aHole)
Definition: pns_node.cpp:553
std::optional< OBSTACLE > OPT_OBSTACLE
Definition: pns_node.h:217
std::unordered_set< ITEM * > m_garbageItems
Definition: pns_node.h:545
void Dump(bool aLong=false)
Definition: pns_node.cpp:1323
void AddRaw(ITEM *aItem, bool aAllowRedundant=false)
Definition: pns_node.h:463
NODE(const NODE &aB)
nodes are not copyable
void releaseGarbage()
Definition: pns_node.cpp:1442
int Depth() const
Definition: pns_node.h:257
void addArc(ARC *aVia)
Definition: pns_node.cpp:675
void FindLineEnds(const LINE &aLine, JOINT &aA, JOINT &aB)
Destroy all child nodes. Applicable only to the root node.
Definition: pns_node.cpp:1094
JOINT & touchJoint(const VECTOR2I &aPos, const LAYER_RANGE &aLayers, NET_HANDLE aNet)
Touch a joint and links it to an m_item.
Definition: pns_node.cpp:1243
RULE_RESOLVER * GetRuleResolver() const
Return the number of joints.
Definition: pns_node.h:245
int QueryJoints(const BOX2I &aBox, std::vector< JOINT * > &aJoints, LAYER_RANGE aLayerMask=LAYER_RANGE::All(), int aKindMask=ITEM::ANY_T)
Definition: pns_node.cpp:1620
void FixupVirtualVias()
Definition: pns_node.cpp:1135
std::set< OBSTACLE > OBSTACLES
Definition: pns_node.h:219
std::unordered_multimap< JOINT::HASH_TAG, JOINT, JOINT::JOINT_TAG_HASH > JOINT_MAP
Definition: pns_node.h:524
INDEX * m_index
Geometric/Net index of the items.
Definition: pns_node.h:539
std::vector< ITEM * > FindItemsByZone(const ZONE *aParent)
Definition: pns_node.cpp:1678
std::unordered_set< ITEM * > m_override
hash of root's items that have been changed in this node
Definition: pns_node.h:534
void AllItemsInNet(NET_HANDLE aNet, std::set< ITEM * > &aItems, int aKindMask=-1)
Definition: pns_node.cpp:1496
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:283
void LockJoint(const VECTOR2I &aPos, const ITEM *aItem, bool aLock)
Definition: pns_node.cpp:1236
void SetRuleResolver(RULE_RESOLVER *aFunc)
Definition: pns_node.h:240
void removeArcIndex(ARC *aVia)
Definition: pns_node.cpp:766
int JointCount() const
Return the number of nodes in the inheritance chain (wrs to the root node).
Definition: pns_node.h:251
void AddEdgeExclusion(std::unique_ptr< SHAPE > aShape)
Definition: pns_node.cpp:701
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:252
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:537
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:421
bool isRoot() const
Definition: pns_node.h:504
void removeViaIndex(VIA *aVia)
Definition: pns_node.cpp:818
void unlinkJoint(const VECTOR2I &aPos, const LAYER_RANGE &aLayers, NET_HANDLE aNet, ITEM *aWhere)
Helpers for adding/removing items.
Definition: pns_node.cpp:1313
void add(ITEM *aItem, bool aAllowRedundant=false)
Definition: pns_node.cpp:569
void KillChildren()
Definition: pns_node.cpp:1490
void removeSolidIndex(SOLID *aSeg)
Definition: pns_node.cpp:826
int m_depth
depth of the node (number of parent nodes in the inheritance chain)
Definition: pns_node.h:540
bool Add(std::unique_ptr< SEGMENT > &&aSegment, bool aAllowRedundant=false)
Add an item to the current node.
Definition: pns_node.cpp:657
std::set< NODE * > m_children
list of nodes branched from this one
Definition: pns_node.h:532
ITEM * FindItemByParent(const BOARD_ITEM *aParent)
Definition: pns_node.cpp:1658
JOINT_MAP m_joints
hash table with the joints, linking the items.
Definition: pns_node.h:527
ARC * findRedundantArc(const VECTOR2I &A, const VECTOR2I &B, const LAYER_RANGE &lr, NET_HANDLE aNet)
Definition: pns_node.cpp:1585
NODE * m_parent
node this node was branched from
Definition: pns_node.h:530
void ClearRanks(int aMarkerMask=MK_HEAD|MK_VIOLATION)
Definition: pns_node.cpp:1525
void Replace(ITEM *aOldItem, std::unique_ptr< ITEM > &&aNewItem)
Replace an item with another one.
Definition: pns_node.cpp:838
void Remove(ARC *aArc)
Remove an item from this branch.
Definition: pns_node.cpp:878
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:1465
RULE_RESOLVER * m_ruleResolver
Design rules resolver.
Definition: pns_node.h:538
~NODE()
Return the expected clearance between items a and b.
Definition: pns_node.cpp:70
void linkJoint(const VECTOR2I &aPos, const LAYER_RANGE &aLayers, NET_HANDLE aNet, ITEM *aWhere)
Unlink an item from a joint.
Definition: pns_node.cpp:1304
const LINE AssembleLine(LINKED_ITEM *aSeg, int *aOriginSegmentIndex=nullptr, bool aStopAtLockedJoints=false, bool aFollowLockedSegments=false)
Follow the joint map to assemble a line connecting two non-trivial joints starting from segment aSeg.
Definition: pns_node.cpp:1008
const ITEM_SET HitTest(const VECTOR2I &aPoint) const
Find all items that contain the point aPoint.
Definition: pns_node.cpp:483
const NODE * m_node
node we are searching in (either root or a branch)
Definition: pns_node.h:193
const ITEM * m_item
the item we are looking for collisions with
Definition: pns_node.h:191
virtual bool operator()(ITEM *aCandidate)=0
bool visit(ITEM *aCandidate)
Definition: pns_node.cpp:203
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:194
virtual ~OBSTACLE_VISITOR()
Definition: pns_node.h:179
virtual int NetCode(NET_HANDLE aNet)=0
virtual ~RULE_RESOLVER()
Definition: pns_node.h:139
virtual void ClearCacheForItems(std::vector< const ITEM * > &aItems)
Definition: pns_node.h:166
virtual int ClearanceEpsilon() const
Definition: pns_node.h:170
virtual void ClearTemporaryCaches()
Definition: pns_node.h:168
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:167
virtual wxString NetName(NET_HANDLE aNet)=0
Handle a list of polygons defining a copper zone.
Definition: zone.h:72
Push and Shove diff pair dimensions (gap) settings dialog.
CONSTRAINT_TYPE
Definition: pns_node.h:52
void * NET_HANDLE
Definition: pns_item.h:54
@ MK_VIOLATION
Definition: pns_item.h:43
@ MK_HEAD
Definition: pns_item.h:42
@ VIA
Normal via.
Definition: router_tool.cpp:93
const COLLISION_SEARCH_OPTIONS options
Definition: pns_node.h:132
std::set< OBSTACLE > & obstacles
Definition: pns_node.h:131
COLLISION_SEARCH_CONTEXT(std::set< OBSTACLE > &aObs, const COLLISION_SEARCH_OPTIONS aOpts)
Definition: pns_node.h:125
std::set< ITEM * > * m_restrictedSet
Definition: pns_node.h:119
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
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:87
VECTOR2I m_pos
Definition: pns_node.h:92
int m_distFirst
... and the distance thereof
Definition: pns_node.h:93
int m_clearance
Definition: pns_node.h:91
int m_maxFanoutWidth
worst case (largest) width of the tracks connected to the item
Definition: pns_node.h:94
bool operator==(const OBSTACLE &other) const
Definition: pns_node.h:96
ITEM * m_head
Line we search collisions against.
Definition: pns_node.h:88
bool operator<(const OBSTACLE &other) const
Definition: pns_node.h:101
VECTOR2I m_ipFirst
First intersection between m_head and m_hull.
Definition: pns_node.h:90
ITEM * m_item
Item found to be colliding with m_head.
Definition: pns_node.h:89