KiCad PCB EDA Suite
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-2022 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 <unordered_set>
29#include <core/minoptmax.h>
30
33
34#include "pns_item.h"
35#include "pns_joint.h"
36#include "pns_itemset.h"
37
38namespace PNS {
39
40class ARC;
41class SEGMENT;
42class LINE;
43class SOLID;
44class VIA;
45class INDEX;
46class ROUTER;
47class NODE;
48
55{
56 CT_CLEARANCE = 1,
58 CT_LENGTH = 3,
59 CT_WIDTH = 4,
61 CT_VIA_HOLE = 6,
65};
66
68{
72 wxString m_RuleName;
73 wxString m_FromName;
74 wxString m_ToName;
75};
76
78{
79public:
80 virtual ~RULE_RESOLVER() {}
81
82 virtual int Clearance( const ITEM* aA, const ITEM* aB, bool aUseClearanceEpsilon = true ) = 0;
83 virtual int HoleClearance( const ITEM* aA, const ITEM* aB,
84 bool aUseClearanceEpsilon = true ) = 0;
85 virtual int HoleToHoleClearance( const ITEM* aA, const ITEM* aB,
86 bool aUseClearanceEpsilon = true ) = 0;
87
88 virtual int DpCoupledNet( int aNet ) = 0;
89 virtual int DpNetPolarity( int aNet ) = 0;
90 virtual bool DpNetPair( const ITEM* aItem, int& aNetP, int& aNetN ) = 0;
91
92 virtual bool IsDiffPair( const ITEM* aA, const ITEM* aB ) = 0;
93
94 virtual bool QueryConstraint( CONSTRAINT_TYPE aType, const PNS::ITEM* aItemA,
95 const PNS::ITEM* aItemB, int aLayer,
96 PNS::CONSTRAINT* aConstraint ) = 0;
97
98 virtual wxString NetName( int aNet ) = 0;
99
100 virtual void ClearCacheForItem( const ITEM* aItem ) {}
101};
102
107{
108 const ITEM* m_head;
109
115};
116
118{
119public:
120 OBSTACLE_VISITOR( const ITEM* aItem );
121
123 {
124 }
125
126 void SetWorld( const NODE* aNode, const NODE* aOverride = nullptr );
127
128 virtual bool operator()( ITEM* aCandidate ) = 0;
129
130protected:
131 bool visit( ITEM* aCandidate );
132
133protected:
134 const ITEM* m_item;
135
136 const NODE* m_node;
138};
139
149class NODE
150{
151public:
152
155 {
158 };
159
161 typedef std::vector<ITEM*> ITEM_VECTOR;
162 typedef std::vector<OBSTACLE> OBSTACLES;
163
164 NODE();
165 ~NODE();
166
168 int GetClearance( const ITEM* aA, const ITEM* aB, bool aUseClearanceEpsilon = true ) const;
169 int GetHoleClearance( const ITEM* aA, const ITEM* aB, bool aUseClearanceEpsilon = true ) const;
170 int GetHoleToHoleClearance( const ITEM* aA, const ITEM* aB,
171 bool aUseClearanceEpsilon = true ) const;
172
174 int GetMaxClearance() const
175 {
176 return m_maxClearance;
177 }
178
180 void SetMaxClearance( int aClearance )
181 {
182 m_maxClearance = aClearance;
183 }
184
187 {
188 m_ruleResolver = aFunc;
189 }
190
192 {
193 return m_ruleResolver;
194 }
195
197 int JointCount() const
198 {
199 return m_joints.size();
200 }
201
203 int Depth() const
204 {
205 return m_depth;
206 }
207
217 int QueryColliding( const ITEM* aItem, OBSTACLES& aObstacles, int aKindMask = ITEM::ANY_T,
218 int aLimitCount = -1, bool aDifferentNetsOnly = true, int aOverrideClearance = -1 );
219
220 int QueryJoints( const BOX2I& aBox, std::vector<JOINT*>& aJoints,
221 LAYER_RANGE aLayerMask = LAYER_RANGE::All(), int aKindMask = ITEM::ANY_T );
222
233 OPT_OBSTACLE NearestObstacle( const LINE* aLine, int aKindMask = ITEM::ANY_T,
234 const std::set<ITEM*>* aRestrictedSet = nullptr,
235 bool aUseClearanceEpsilon = true );
236
245 OPT_OBSTACLE CheckColliding( const ITEM* aItem, int aKindMask = ITEM::ANY_T );
246
247
256 OPT_OBSTACLE CheckColliding( const ITEM_SET& aSet, int aKindMask = ITEM::ANY_T );
257
264 const ITEM_SET HitTest( const VECTOR2I& aPoint ) const;
265
274 bool Add( std::unique_ptr< SEGMENT > aSegment, bool aAllowRedundant = false );
275 void Add( std::unique_ptr< SOLID > aSolid );
276 void Add( std::unique_ptr< VIA > aVia );
277 bool Add( std::unique_ptr< ARC > aArc, bool aAllowRedundant = false );
278
279 void Add( LINE& aLine, bool aAllowRedundant = false );
280
281 void AddEdgeExclusion( std::unique_ptr<SHAPE> aShape );
282
283 bool QueryEdgeExclusions( const VECTOR2I& aPos ) const;
284
288 void Remove( ARC* aArc );
289 void Remove( SOLID* aSolid );
290 void Remove( VIA* aVia );
291 void Remove( SEGMENT* aSegment );
292 void Remove( ITEM* aItem );
293
299 void Remove( LINE& aLine );
300
307 void Replace( ITEM* aOldItem, std::unique_ptr< ITEM > aNewItem );
308 void Replace( LINE& aOldLine, LINE& aNewLine );
309
318 NODE* Branch();
319
331 const LINE AssembleLine( LINKED_ITEM* aSeg, int* aOriginSegmentIndex = nullptr,
332 bool aStopAtLockedJoints = false,
333 bool aFollowLockedSegments = false );
334
336 void Dump( bool aLong = false );
337
344 void GetUpdatedItems( ITEM_VECTOR& aRemoved, ITEM_VECTOR& aAdded );
345
354 void Commit( NODE* aNode );
355
361 JOINT* FindJoint( const VECTOR2I& aPos, int aLayer, int aNet );
362
363 void LockJoint( const VECTOR2I& aPos, const ITEM* aItem, bool aLock );
364
370 JOINT* FindJoint( const VECTOR2I& aPos, const ITEM* aItem )
371 {
372 return FindJoint( aPos, aItem->Layers().Start(), aItem->Net() );
373 }
374
376 int FindLinesBetweenJoints( const JOINT& aA, const JOINT& aB, std::vector<LINE>& aLines );
377
379 void FindLineEnds( const LINE& aLine, JOINT& aA, JOINT& aB );
380
382 void KillChildren();
383
384 void AllItemsInNet( int aNet, std::set<ITEM*>& aItems, int aKindMask = -1 );
385
386 void ClearRanks( int aMarkerMask = MK_HEAD | MK_VIOLATION | MK_HOLE );
387
388 void RemoveByMarker( int aMarker );
389
390 ITEM* FindItemByParent( const BOARD_ITEM* aParent );
391
392 bool HasChildren() const
393 {
394 return !m_children.empty();
395 }
396
398 {
399 return m_parent;
400 }
401
403 bool Overrides( ITEM* aItem ) const
404 {
405 return m_override.find( aItem ) != m_override.end();
406 }
407
408 void FixupVirtualVias();
409
411 {
412 m_collisionQueryScope = aScope;
413 }
414
416 {
418 }
419
420private:
421 void Add( std::unique_ptr< ITEM > aItem, bool aAllowRedundant = false );
422
424 NODE( const NODE& aB );
425 NODE& operator=( const NODE& aB );
426
428 JOINT& touchJoint( const VECTOR2I& aPos, const LAYER_RANGE& aLayers, int aNet );
429
431 void linkJoint( const VECTOR2I& aPos, const LAYER_RANGE& aLayers, int aNet, ITEM* aWhere );
432
434 void unlinkJoint( const VECTOR2I& aPos, const LAYER_RANGE& aLayers, int aNet, ITEM* aWhere );
435
437 void addSolid( SOLID* aSeg );
438 void addSegment( SEGMENT* aSeg );
439 void addVia( VIA* aVia );
440 void addArc( ARC* aVia );
441
442 void removeSolidIndex( SOLID* aSeg );
443 void removeSegmentIndex( SEGMENT* aSeg );
444 void removeViaIndex( VIA* aVia );
445 void removeArcIndex( ARC* aVia );
446
447 void doRemove( ITEM* aItem );
448 void unlinkParent();
449 void releaseChildren();
450 void releaseGarbage();
451 void rebuildJoint( JOINT* aJoint, ITEM* aItem );
452
453 bool isRoot() const
454 {
455 return m_parent == nullptr;
456 }
457
458 SEGMENT* findRedundantSegment( const VECTOR2I& A, const VECTOR2I& B, const LAYER_RANGE& lr,
459 int aNet );
461
462 ARC* findRedundantArc( const VECTOR2I& A, const VECTOR2I& B, const LAYER_RANGE& lr, int aNet );
463 ARC* findRedundantArc( ARC* aSeg );
464
466 void followLine( LINKED_ITEM* aCurrent, bool aScanDirection, int& aPos, int aLimit,
467 VECTOR2I* aCorners, LINKED_ITEM** aSegments, bool* aArcReversed,
468 bool& aGuardHit, bool aStopAtLockedJoints, bool aFollowLockedSegments );
469
470private:
471 struct DEFAULT_OBSTACLE_VISITOR;
472 typedef std::unordered_multimap<JOINT::HASH_TAG, JOINT, JOINT::JOINT_TAG_HASH> JOINT_MAP;
473 typedef JOINT_MAP::value_type TagJointPair;
474
477
480 std::set<NODE*> m_children;
481
482 std::unordered_set<ITEM*> m_override;
484
490
491 std::vector< std::unique_ptr<SHAPE> > m_edgeExclusions;
492
493 std::unordered_set<ITEM*> m_garbageItems;
494
496};
497
498}
499
500#endif
A base class for any item which can be embedded within the BOARD container class, and therefore insta...
Definition: board_item.h:53
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:109
INDEX.
Definition: pns_index.h:46
Base class for PNS router board items.
Definition: pns_item.h:56
const LAYER_RANGE & Layers() const
Definition: pns_item.h:154
int Net() const
Definition: pns_item.h:152
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:150
bool HasChildren() const
Definition: pns_node.h:392
NODE * Branch()
Create a lightweight copy (called branch) of self that tracks the changes (added/removed items) wrs t...
Definition: pns_node.cpp:139
COLLISION_QUERY_SCOPE GetCollisionQueryScope() const
Definition: pns_node.h:415
void linkJoint(const VECTOR2I &aPos, const LAYER_RANGE &aLayers, int aNet, ITEM *aWhere)
Unlink an item from a joint.
Definition: pns_node.cpp:1280
void RemoveByMarker(int aMarker)
Definition: pns_node.cpp:1496
NODE * m_root
root node of the whole hierarchy
Definition: pns_node.h:479
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:1076
NODE * GetParent() const
Check if this branch contains an updated version of the m_item from the root branch.
Definition: pns_node.h:397
std::vector< ITEM * > ITEM_VECTOR
Definition: pns_node.h:161
int GetClearance(const ITEM *aA, const ITEM *aB, bool aUseClearanceEpsilon=true) const
Definition: pns_node.cpp:103
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:934
void SetCollisionQueryScope(COLLISION_QUERY_SCOPE aScope)
Definition: pns_node.h:410
void addSolid(SOLID *aSeg)
Definition: pns_node.cpp:564
void Replace(ITEM *aOldItem, std::unique_ptr< ITEM > aNewItem)
Replace an item with another one.
Definition: pns_node.cpp:838
bool Overrides(ITEM *aItem) const
Definition: pns_node.h:403
int GetMaxClearance() const
Set the worst-case clearance between any pair of items.
Definition: pns_node.h:174
void removeSegmentIndex(SEGMENT *aSeg)
Definition: pns_node.cpp:759
void SetMaxClearance(int aClearance)
Assign a clearance resolution function object.
Definition: pns_node.h:180
COLLISION_QUERY_SCOPE
< Supported item types
Definition: pns_node.h:155
@ CQS_IGNORE_HOLE_CLEARANCE
check everything except hole2hole / hole2copper
Definition: pns_node.h:157
@ CQS_ALL_RULES
check all rules
Definition: pns_node.h:156
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:1384
void addSegment(SEGMENT *aSeg)
Definition: pns_node.cpp:647
std::vector< std::unique_ptr< SHAPE > > m_edgeExclusions
Definition: pns_node.h:491
void releaseChildren()
Definition: pns_node.cpp:1403
int QueryColliding(const ITEM *aItem, OBSTACLES &aObstacles, int aKindMask=ITEM::ANY_T, int aLimitCount=-1, bool aDifferentNetsOnly=true, int aOverrideClearance=-1)
Find items colliding (closer than clearance) with the item aItem.
Definition: pns_node.cpp:271
JOINT_MAP::value_type TagJointPair
Definition: pns_node.h:473
void addVia(VIA *aVia)
Definition: pns_node.cpp:580
COLLISION_QUERY_SCOPE m_collisionQueryScope
Definition: pns_node.h:495
bool QueryEdgeExclusions(const VECTOR2I &aPos) const
Definition: pns_node.cpp:726
void AllItemsInNet(int aNet, std::set< ITEM * > &aItems, int aKindMask=-1)
Definition: pns_node.cpp:1457
void doRemove(ITEM *aItem)
Definition: pns_node.cpp:738
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:468
std::unordered_set< ITEM * > m_garbageItems
Definition: pns_node.h:493
void Dump(bool aLong=false)
Definition: pns_node.cpp:1297
void rebuildJoint(JOINT *aJoint, ITEM *aItem)
Definition: pns_node.cpp:773
int GetHoleToHoleClearance(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:127
NODE(const NODE &aB)
nodes are not copyable
JOINT * FindJoint(const VECTOR2I &aPos, const ITEM *aItem)
Search for a joint at a given position, linked to given item.
Definition: pns_node.h:370
void ClearRanks(int aMarkerMask=MK_HEAD|MK_VIOLATION|MK_HOLE)
Definition: pns_node.cpp:1486
void releaseGarbage()
Definition: pns_node.cpp:1416
int Depth() const
Definition: pns_node.h:203
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:1069
RULE_RESOLVER * GetRuleResolver() const
Return the number of joints.
Definition: pns_node.h:191
std::vector< OBSTACLE > OBSTACLES
Definition: pns_node.h:162
int QueryJoints(const BOX2I &aBox, std::vector< JOINT * > &aJoints, LAYER_RANGE aLayerMask=LAYER_RANGE::All(), int aKindMask=ITEM::ANY_T)
Definition: pns_node.cpp:1581
bool Add(std::unique_ptr< SEGMENT > aSegment, bool aAllowRedundant=false)
Add an item to the current node.
Definition: pns_node.cpp:656
void FixupVirtualVias()
Definition: pns_node.cpp:1110
std::unordered_multimap< JOINT::HASH_TAG, JOINT, JOINT::JOINT_TAG_HASH > JOINT_MAP
Definition: pns_node.h:472
INDEX * m_index
Geometric/Net index of the items.
Definition: pns_node.h:487
std::unordered_set< ITEM * > m_override
hash of root's items that have been changed in this node
Definition: pns_node.h:482
void LockJoint(const VECTOR2I &aPos, const ITEM *aItem, bool aLock)
Definition: pns_node.cpp:1211
void SetRuleResolver(RULE_RESOLVER *aFunc)
Definition: pns_node.h:186
ARC * findRedundantArc(const VECTOR2I &A, const VECTOR2I &B, const LAYER_RANGE &lr, int aNet)
Definition: pns_node.cpp:1546
void removeArcIndex(ARC *aVia)
Definition: pns_node.cpp:766
OPT< OBSTACLE > OPT_OBSTACLE
Definition: pns_node.h:160
int JointCount() const
Return the number of nodes in the inheritance chain (wrs to the root node).
Definition: pns_node.h:197
JOINT & touchJoint(const VECTOR2I &aPos, const LAYER_RANGE &aLayers, int aNet)
Touch a joint and links it to an m_item.
Definition: pns_node.cpp:1218
void AddEdgeExclusion(std::unique_ptr< SHAPE > aShape)
Definition: pns_node.cpp:720
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:485
OPT_OBSTACLE NearestObstacle(const LINE *aLine, int aKindMask=ITEM::ANY_T, const std::set< ITEM * > *aRestrictedSet=nullptr, bool aUseClearanceEpsilon=true)
Follow the line in search of an obstacle that is nearest to the starting to the line's starting point...
Definition: pns_node.cpp:301
void unlinkJoint(const VECTOR2I &aPos, const LAYER_RANGE &aLayers, int aNet, ITEM *aWhere)
Helpers for adding/removing items.
Definition: pns_node.cpp:1288
bool isRoot() const
Definition: pns_node.h:453
int GetHoleClearance(const ITEM *aA, const ITEM *aB, bool aUseClearanceEpsilon=true) const
Definition: pns_node.cpp:115
void removeViaIndex(VIA *aVia)
Definition: pns_node.cpp:818
void KillChildren()
Definition: pns_node.cpp:1451
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:488
std::set< NODE * > m_children
list of nodes branched from this one
Definition: pns_node.h:480
ITEM * FindItemByParent(const BOARD_ITEM *aParent)
Definition: pns_node.cpp:1619
JOINT_MAP m_joints
hash table with the joints, linking the items.
Definition: pns_node.h:475
NODE * m_parent
node this node was branched from
Definition: pns_node.h:478
JOINT * FindJoint(const VECTOR2I &aPos, int aLayer, int aNet)
Search for a joint at a given position, layer and belonging to given net.
Definition: pns_node.cpp:1181
void Remove(ARC *aArc)
Remove an item from this branch.
Definition: pns_node.cpp:873
void unlinkParent()
Definition: pns_node.cpp:176
void Commit(NODE *aNode)
Apply the changes from a given branch (aNode) to the root branch.
Definition: pns_node.cpp:1431
RULE_RESOLVER * m_ruleResolver
Design rules resolver.
Definition: pns_node.h:486
~NODE()
Return the expected clearance between items a and b.
Definition: pns_node.cpp:70
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:983
SEGMENT * findRedundantSegment(const VECTOR2I &A, const VECTOR2I &B, const LAYER_RANGE &lr, int aNet)
Definition: pns_node.cpp:1511
const ITEM_SET HitTest(const VECTOR2I &aPoint) const
Find all items that contain the point aPoint.
Definition: pns_node.cpp:535
OBSTACLE_VISITOR(const ITEM *aItem)
Definition: pns_node.cpp:185
const NODE * m_node
node we are searching in (either root or a branch)
Definition: pns_node.h:136
const ITEM * m_item
the item we are looking for collisions with
Definition: pns_node.h:134
virtual bool operator()(ITEM *aCandidate)=0
bool visit(ITEM *aCandidate)
Definition: pns_node.cpp:200
void SetWorld(const NODE *aNode, const NODE *aOverride=nullptr)
Definition: pns_node.cpp:193
const NODE * m_override
node that overrides root entries
Definition: pns_node.h:137
virtual ~OBSTACLE_VISITOR()
Definition: pns_node.h:122
virtual ~RULE_RESOLVER()
Definition: pns_node.h:80
virtual bool QueryConstraint(CONSTRAINT_TYPE aType, const PNS::ITEM *aItemA, const PNS::ITEM *aItemB, int aLayer, PNS::CONSTRAINT *aConstraint)=0
virtual int HoleToHoleClearance(const ITEM *aA, const ITEM *aB, bool aUseClearanceEpsilon=true)=0
virtual void ClearCacheForItem(const ITEM *aItem)
Definition: pns_node.h:100
virtual wxString NetName(int aNet)=0
virtual int Clearance(const ITEM *aA, const ITEM *aB, bool aUseClearanceEpsilon=true)=0
virtual int DpNetPolarity(int aNet)=0
virtual int DpCoupledNet(int aNet)=0
virtual bool IsDiffPair(const ITEM *aA, const ITEM *aB)=0
virtual bool DpNetPair(const ITEM *aItem, int &aNetP, int &aNetN)=0
virtual int HoleClearance(const ITEM *aA, const ITEM *aB, bool aUseClearanceEpsilon=true)=0
Represent a polyline containing arcs as well as line segments: A chain of connected line and/or arc s...
Push and Shove diff pair dimensions (gap) settings dialog.
CONSTRAINT_TYPE
An abstract function object, returning a design rule (clearance, diff pair gap, etc) required between...
Definition: pns_node.h:55
@ MK_VIOLATION
Definition: pns_item.h:42
@ MK_HEAD
Definition: pns_item.h:41
@ MK_HOLE
Definition: pns_item.h:45
boost::optional< T > OPT
Definition: optional.h:7
wxString m_FromName
Definition: pns_node.h:73
bool m_Allowed
Definition: pns_node.h:71
wxString m_RuleName
Definition: pns_node.h:72
wxString m_ToName
Definition: pns_node.h:74
MINOPTMAX< int > m_Value
Definition: pns_node.h:70
CONSTRAINT_TYPE m_Type
Definition: pns_node.h:69
Hold an object colliding with another object, along with some useful data about the collision.
Definition: pns_node.h:107
int m_distFirst
... and the distance thereof
Definition: pns_node.h:113
int m_maxFanoutWidth
worst case (largest) width of the tracks connected to the item
Definition: pns_node.h:114
VECTOR2I m_ipFirst
First intersection between m_head and m_hull.
Definition: pns_node.h:112
ITEM * m_item
Item found to be colliding with m_head.
Definition: pns_node.h:110
const ITEM * m_head
Item we search collisions with.
Definition: pns_node.h:108
SHAPE_LINE_CHAIN m_hull
Hull of the colliding m_item.
Definition: pns_node.h:111