KiCad PCB EDA Suite
Loading...
Searching...
No Matches
drc_test_provider_edge_clearance.cpp
Go to the documentation of this file.
1/*
2 * This program source code file is part of KiCad, a free EDA CAD application.
3 *
4 * Copyright The KiCad Developers.
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version 2
9 * of the License, or (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, you may find one here:
18 * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
19 * or you may search the http://www.gnu.org website for the version 2 license,
20 * or you may write to the Free Software Foundation, Inc.,
21 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
22 */
23
24#include <common.h>
25#include <pcb_shape.h>
26#include <pcb_board_outline.h>
28#include <footprint.h>
29#include <pad.h>
30#include <pcb_track.h>
31#include <geometry/seg.h>
33#include <drc/drc_engine.h>
34#include <drc/drc_item.h>
35#include <drc/drc_rule.h>
37#include <drc/drc_rtree.h>
38
39/*
40 Board edge clearance test. Checks all items for their mechanical clearances against the board
41 edge.
42 Errors generated:
43 - DRCE_EDGE_CLEARANCE
44 - DRCE_SILK_EDGE_CLEARANCE
45*/
46
53
54
56{
57public:
63
65
66 virtual bool Run() override;
67
68 virtual const wxString GetName() const override { return wxT( "edge_clearance" ); }
69
70private:
71 void resolveSilkDisposition( BOARD_ITEM* aItem, const SHAPE* aItemShape, const SHAPE_POLY_SET& aBoardOutline );
72
73 bool testAgainstEdge( BOARD_ITEM* item, SHAPE* itemShape, BOARD_ITEM* other, DRC_CONSTRAINT_T aConstraintType,
74 PCB_DRC_CODE aErrorCode );
75
76private:
77 std::vector<PAD*> m_castellatedPads;
81
82 std::map<BOARD_ITEM*, SILK_DISPOSITION> m_silkDisposition;
83};
84
85
87 const SHAPE_POLY_SET& aBoardOutline )
88{
89 SILK_DISPOSITION disposition = UNKNOWN;
90
91 if( aItemShape->Type() == SH_COMPOUND )
92 {
93 const SHAPE_COMPOUND* compound = static_cast<const SHAPE_COMPOUND*>( aItemShape );
94
95 for( const SHAPE* elem : compound->Shapes() )
96 {
97 SILK_DISPOSITION elem_disposition = aBoardOutline.Contains( elem->Centre() ) ? ON_BOARD : OFF_BOARD;
98
99 if( disposition == UNKNOWN )
100 {
101 disposition = elem_disposition;
102 }
103 else if( disposition != elem_disposition )
104 {
105 disposition = CROSSES_EDGE;
106 break;
107 }
108 }
109 }
110 else
111 {
112 disposition = aBoardOutline.Contains( aItemShape->Centre() ) ? ON_BOARD : OFF_BOARD;
113 }
114
115 m_silkDisposition[aItem] = disposition;
116
117 if( disposition == CROSSES_EDGE )
118 {
119 BOARD_ITEM* nearestEdge = nullptr;
120 VECTOR2I itemPos = aItem->GetCenter();
121 VECTOR2I nearestEdgePt = aBoardOutline.Outline( 0 ).NearestPoint( itemPos, false );
122
123 for( int outlineIdx = 1; outlineIdx < aBoardOutline.OutlineCount(); ++outlineIdx )
124 {
125 VECTOR2I otherEdgePt = aBoardOutline.Outline( outlineIdx ).NearestPoint( itemPos, false );
126
127 if( otherEdgePt.SquaredDistance( itemPos ) < nearestEdgePt.SquaredDistance( itemPos ) )
128 nearestEdgePt = otherEdgePt;
129 }
130
131 for( BOARD_ITEM* edge : m_edgesTree.GetObjectsAt( nearestEdgePt, Edge_Cuts, m_epsilon ) )
132 {
133 if( edge->HitTest( nearestEdgePt, m_epsilon ) )
134 {
135 nearestEdge = edge;
136 break;
137 }
138 }
139
140 if( !nearestEdge )
141 return;
142
143 auto constraint = m_drcEngine->EvalRules( SILK_CLEARANCE_CONSTRAINT, nearestEdge, aItem, UNDEFINED_LAYER );
144 int minClearance = constraint.GetValue().Min();
145
146 if( constraint.GetSeverity() != RPT_SEVERITY_IGNORE && minClearance >= 0 )
147 {
148 std::shared_ptr<DRC_ITEM> drcItem = DRC_ITEM::Create( DRCE_SILK_EDGE_CLEARANCE );
149
150 // Report clearance info if there is any, even though crossing is just a straight-up collision
151 if( minClearance > 0 )
152 {
153 drcItem->SetErrorDetail( formatMsg( _( "(%s clearance %s; actual %s)" ),
154 constraint.GetName(),
155 minClearance,
156 0 ) );
157 }
158
159 drcItem->SetItems( nearestEdge->m_Uuid, aItem->m_Uuid );
160 drcItem->SetViolatingRule( constraint.GetParentRule() );
161 reportTwoPointGeometry( drcItem, nearestEdgePt, nearestEdgePt, nearestEdgePt, aItem->GetLayer() );
162 }
163 }
164#if 0
165 // If you want "Silk outside board edge" errors:
166 else if( disposition == OFF_BOARD )
167 {
168 std::shared_ptr<DRC_ITEM> drcItem = DRC_ITEM::Create( DRCE_SILK_EDGE_CLEARANCE );
169 drcItem->SetErrorMessage( _( "Silkscreen outside board edge" ) );
170
171 drcItem->SetItems( aItem->m_Uuid );
172 reportTwoPointGeometry( drcItem, aItem->GetCenter(), aItem->GetCenter(), aItem->GetCenter(),
173 aItem->GetLayer() );
174 }
175#endif
176}
177
178
180 DRC_CONSTRAINT_T aConstraintType, PCB_DRC_CODE aErrorCode )
181{
182 std::shared_ptr<SHAPE> shape;
183
184 if( edge->Type() == PCB_PAD_T )
185 shape = edge->GetEffectiveHoleShape();
186 else
187 shape = edge->GetEffectiveShape( Edge_Cuts );
188
189 auto constraint = m_drcEngine->EvalRules( aConstraintType, edge, item, UNDEFINED_LAYER );
190 int minClearance = constraint.GetValue().Min();
191 int actual;
192 VECTOR2I pos;
193
194 if( constraint.GetSeverity() != RPT_SEVERITY_IGNORE && minClearance >= 0 )
195 {
196 if( itemShape->Collide( shape.get(), std::max( 0, minClearance - m_epsilon ), &actual, &pos ) )
197 {
198 if( item->Type() == PCB_TRACE_T || item->Type() == PCB_ARC_T )
199 {
200 // Edge collisions are allowed inside the holes of castellated pads
201 for( PAD* castellatedPad : m_castellatedPads )
202 {
203 if( castellatedPad->GetEffectiveHoleShape()->Collide( pos ) )
204 return true;
205 }
206 }
207
208 std::shared_ptr<DRC_ITEM> drcItem = DRC_ITEM::Create( aErrorCode );
209
210 // Only report clearance info if there is any; otherwise it's just a straight collision
211 if( minClearance > 0 )
212 {
213 drcItem->SetErrorDetail( formatMsg( _( "(%s clearance %s; actual %s)" ),
214 constraint.GetName(),
215 minClearance,
216 actual ) );
217 }
218
219 drcItem->SetItems( edge->m_Uuid, item->m_Uuid );
220 drcItem->SetViolatingRule( constraint.GetParentRule() );
221 reportTwoItemGeometry( drcItem, pos, edge, item, Edge_Cuts, actual );
222
223 if( aErrorCode == DRCE_SILK_EDGE_CLEARANCE )
225
226 if( item->Type() == PCB_TRACE_T || item->Type() == PCB_ARC_T )
227 return m_drcEngine->GetReportAllTrackErrors();
228 else
229 return false; // don't report violations with multiple edges; one is enough
230 }
231 }
232
233 return true;
234}
235
236
238{
239 if( !m_drcEngine->IsErrorLimitExceeded( DRCE_EDGE_CLEARANCE ) )
240 {
241 if( !reportPhase( _( "Checking copper to board edge clearances..." ) ) )
242 return false; // DRC cancelled
243 }
244 else if( !m_drcEngine->IsErrorLimitExceeded( DRCE_SILK_EDGE_CLEARANCE ) )
245 {
246 if( !reportPhase( _( "Checking silk to board edge clearances..." ) ) )
247 return false; // DRC cancelled
248 }
249 else
250 {
251 REPORT_AUX( wxT( "Edge clearance violations ignored. Tests not run." ) );
252 return true; // continue with other tests
253 }
254
255 m_board = m_drcEngine->GetBoard();
256 m_castellatedPads.clear();
257 m_epsilon = m_board->GetDesignSettings().GetDRCEpsilon();
258 m_edgesTree.clear();
259 m_silkDisposition.clear();
260
261 DRC_CONSTRAINT worstClearanceConstraint;
262
263 if( m_drcEngine->QueryWorstConstraint( EDGE_CLEARANCE_CONSTRAINT, worstClearanceConstraint ) )
264 m_largestEdgeClearance = worstClearanceConstraint.GetValue().Min();
265
266 /*
267 * Build an RTree of the various edges (including NPTH holes) and margins found on the board.
268 */
269 std::vector<std::unique_ptr<PCB_SHAPE>> edges;
270
272 [&]( BOARD_ITEM *item ) -> bool
273 {
274 PCB_SHAPE* shape = static_cast<PCB_SHAPE*>( item );
275 STROKE_PARAMS stroke = shape->GetStroke();
276
277 if( item->IsOnLayer( Edge_Cuts ) )
278 stroke.SetWidth( 0 );
279
280 if( shape->GetShape() == SHAPE_T::RECTANGLE && !shape->IsSolidFill() )
281 {
282 // A single rectangle for the board would defeat the RTree, so convert to edges
283 if( shape->GetCornerRadius() > 0 )
284 {
285 for( SHAPE* seg : shape->MakeEffectiveShapes( true ) )
286 {
287 wxCHECK2( dynamic_cast<SHAPE_SEGMENT*>( seg ), continue );
288
289 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
290 edges.back()->SetShape( SHAPE_T::SEGMENT );
291 edges.back()->SetStart( seg->GetStart() );
292 edges.back()->SetEnd( seg->GetEnd() );
293 edges.back()->SetStroke( stroke );
294 }
295 }
296 else
297 {
298 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
299 edges.back()->SetShape( SHAPE_T::SEGMENT );
300 edges.back()->SetEndX( shape->GetStartX() );
301 edges.back()->SetStroke( stroke );
302 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
303 edges.back()->SetShape( SHAPE_T::SEGMENT );
304 edges.back()->SetEndY( shape->GetStartY() );
305 edges.back()->SetStroke( stroke );
306 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
307 edges.back()->SetShape( SHAPE_T::SEGMENT );
308 edges.back()->SetStartX( shape->GetEndX() );
309 edges.back()->SetStroke( stroke );
310 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
311 edges.back()->SetShape( SHAPE_T::SEGMENT );
312 edges.back()->SetStartY( shape->GetEndY() );
313 edges.back()->SetStroke( stroke );
314 }
315 }
316 else if( shape->GetShape() == SHAPE_T::POLY && !shape->IsSolidFill() )
317 {
318 // A single polygon for the board would defeat the RTree, so convert to edges.
319 SHAPE_LINE_CHAIN poly = shape->GetPolyShape().Outline( 0 );
320
321 for( size_t ii = 0; ii < poly.GetSegmentCount(); ++ii )
322 {
323 SEG seg = poly.CSegment( ii );
324 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
325 edges.back()->SetShape( SHAPE_T::SEGMENT );
326 edges.back()->SetStart( seg.A );
327 edges.back()->SetEnd( seg.B );
328 edges.back()->SetStroke( stroke );
329 }
330 }
331 else
332 {
333 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
334 edges.back()->SetStroke( stroke );
335 }
336
337 return true;
338 } );
339
340 for( const std::unique_ptr<PCB_SHAPE>& edge : edges )
341 {
342 for( PCB_LAYER_ID layer : { Edge_Cuts, Margin } )
343 {
344 if( edge->IsOnLayer( layer ) )
345 m_edgesTree.Insert( edge.get(), layer, m_largestEdgeClearance );
346 }
347 }
348
349 for( FOOTPRINT* footprint : m_board->Footprints() )
350 {
351 for( PAD* pad : footprint->Pads() )
352 {
353 if( pad->GetAttribute() == PAD_ATTRIB::NPTH && pad->HasHole() )
354 {
355 // edge-clearances are for milling tolerances (drilling tolerances are handled
356 // by hole-clearances)
357 if( pad->GetDrillSizeX() != pad->GetDrillSizeY() )
359 }
360
361 if( pad->GetProperty() == PAD_PROP::CASTELLATED )
362 m_castellatedPads.push_back( pad );
363 }
364 }
365
366 /*
367 * Test copper and silk items against the set of edges.
368 */
369 const int progressDelta = 200;
370 int count = 0;
371 int ii = 0;
372
374 [&]( BOARD_ITEM *item ) -> bool
375 {
376 count++;
377 return true;
378 } );
379
381 [&]( BOARD_ITEM *item ) -> bool
382 {
383 bool testCopper = !m_drcEngine->IsErrorLimitExceeded( DRCE_EDGE_CLEARANCE );
384 bool testSilk = !m_drcEngine->IsErrorLimitExceeded( DRCE_SILK_EDGE_CLEARANCE );
385
386 if( !testCopper && !testSilk )
387 return false; // All limits exceeded; we're done
388
389 if( !reportProgress( ii++, count, progressDelta ) )
390 return false; // DRC cancelled; we're done
391
392 if( isInvisibleText( item ) )
393 return true; // Continue with other items
394
395 if( item->Type() == PCB_PAD_T )
396 {
397 PAD* pad = static_cast<PAD*>( item );
398
399 if( pad->GetProperty() == PAD_PROP::CASTELLATED || pad->GetAttribute() == PAD_ATTRIB::CONN )
400 return true; // Continue with other items
401 }
402
403 std::vector<PCB_LAYER_ID> layersToTest;
404
405 switch( item->Type() )
406 {
407 case PCB_PAD_T:
408 layersToTest = static_cast<PAD*>( item )->Padstack().UniqueLayers();
409 break;
410
411 case PCB_VIA_T:
412 layersToTest = static_cast<PCB_VIA*>( item )->Padstack().UniqueLayers();
413 break;
414
415 case PCB_ZONE_T:
416 for( PCB_LAYER_ID layer : item->GetLayerSet() )
417 layersToTest.push_back( layer );
418
419 break;
420
421 default:
422 layersToTest = { UNDEFINED_LAYER };
423 }
424
425 for( PCB_LAYER_ID shapeLayer : layersToTest )
426 {
427 const std::shared_ptr<SHAPE>& itemShape = item->GetEffectiveShape( shapeLayer );
428
429 for( PCB_LAYER_ID testLayer : { Edge_Cuts, Margin } )
430 {
431 if( testCopper && item->IsOnCopperLayer() )
432 {
433 m_edgesTree.QueryColliding( item, shapeLayer, testLayer, nullptr,
434 [&]( BOARD_ITEM* edge ) -> bool
435 {
436 return testAgainstEdge( item, itemShape.get(), edge,
439 },
441 }
442
443 if( testSilk && ( item->IsOnLayer( F_SilkS ) || item->IsOnLayer( B_SilkS ) ) )
444 {
445 m_edgesTree.QueryColliding( item, shapeLayer, testLayer, nullptr,
446 [&]( BOARD_ITEM* edge ) -> bool
447 {
448 return testAgainstEdge( item, itemShape.get(), edge,
451 },
453 }
454 }
455
456 if( testSilk && ( item->IsOnLayer( F_SilkS ) || item->IsOnLayer( B_SilkS ) ) )
457 {
458 if( m_silkDisposition[item] == UNKNOWN && m_board->BoardOutline()->HasOutline() )
459 resolveSilkDisposition( item, itemShape.get(), m_board->BoardOutline()->GetOutline() );
460 }
461 }
462
463 return true;
464 } );
465
466 return !m_drcEngine->IsCancelled();
467}
468
469
470namespace detail
471{
473}
A base class for any item which can be embedded within the BOARD container class, and therefore insta...
Definition board_item.h:84
virtual PCB_LAYER_ID GetLayer() const
Return the primary layer this item is on.
Definition board_item.h:237
virtual VECTOR2I GetCenter() const
This defaults to the center of the bounding box if not overridden.
Definition board_item.h:117
virtual bool IsOnLayer(PCB_LAYER_ID aLayer) const
Test to see if this object is on the given layer.
Definition board_item.h:319
virtual std::shared_ptr< SHAPE > GetEffectiveShape(PCB_LAYER_ID aLayer=UNDEFINED_LAYER, FLASHING aFlash=FLASHING::DEFAULT) const
Some pad shapes can be complex (rounded/chamfered rectangle), even without considering custom shapes.
virtual LSET GetLayerSet() const
Return a std::bitset of all layers on which the item physically resides.
Definition board_item.h:257
virtual bool IsOnCopperLayer() const
Definition board_item.h:156
virtual std::shared_ptr< SHAPE_SEGMENT > GetEffectiveHoleShape() const
const MINOPTMAX< int > & GetValue() const
Definition drc_rule.h:187
static std::shared_ptr< DRC_ITEM > Create(int aErrorCode)
Constructs a DRC_ITEM for the given error code.
Definition drc_item.cpp:405
Implement an R-tree for fast spatial and layer indexing of connectable items.
Definition drc_rtree.h:49
void resolveSilkDisposition(BOARD_ITEM *aItem, const SHAPE *aItemShape, const SHAPE_POLY_SET &aBoardOutline)
virtual bool Run() override
Run this provider against the given PCB with configured options (if any).
virtual ~DRC_TEST_PROVIDER_EDGE_CLEARANCE()=default
std::map< BOARD_ITEM *, SILK_DISPOSITION > m_silkDisposition
virtual const wxString GetName() const override
bool testAgainstEdge(BOARD_ITEM *item, SHAPE *itemShape, BOARD_ITEM *other, DRC_CONSTRAINT_T aConstraintType, PCB_DRC_CODE aErrorCode)
virtual bool reportPhase(const wxString &aStageName)
int forEachGeometryItem(const std::vector< KICAD_T > &aTypes, const LSET &aLayers, const std::function< bool(BOARD_ITEM *)> &aFunc)
void reportTwoItemGeometry(std::shared_ptr< DRC_ITEM > &aDrcItem, const VECTOR2I &aMarkerPos, const BOARD_ITEM *aItem1, const BOARD_ITEM *aItem2, PCB_LAYER_ID aLayer, int aDistance)
void reportTwoPointGeometry(std::shared_ptr< DRC_ITEM > &aDrcItem, const VECTOR2I &aMarkerPos, const VECTOR2I &ptA, const VECTOR2I &ptB, PCB_LAYER_ID aLayer)
static std::vector< KICAD_T > s_allBasicItems
bool isInvisibleText(const BOARD_ITEM *aItem) const
wxString formatMsg(const wxString &aFormatString, const wxString &aSource, double aConstraint, double aActual, EDA_DATA_TYPE aDataType=EDA_DATA_TYPE::DISTANCE)
virtual bool reportProgress(size_t aCount, size_t aSize, size_t aDelta=1)
const KIID m_Uuid
Definition eda_item.h:527
KICAD_T Type() const
Returns the type of object.
Definition eda_item.h:111
int GetStartY() const
Definition eda_shape.h:175
int GetEndX() const
Definition eda_shape.h:218
virtual std::vector< SHAPE * > MakeEffectiveShapes(bool aEdgeOnly=false) const
Make a set of SHAPE objects representing the EDA_SHAPE.
Definition eda_shape.h:379
SHAPE_POLY_SET & GetPolyShape()
Definition eda_shape.h:337
SHAPE_T GetShape() const
Definition eda_shape.h:169
int GetEndY() const
Definition eda_shape.h:217
bool IsSolidFill() const
Definition eda_shape.h:117
int GetStartX() const
Definition eda_shape.h:176
int GetCornerRadius() const
LSET is a set of PCB_LAYER_IDs.
Definition lset.h:37
static const LSET & AllLayersMask()
Definition lset.cpp:641
T Min() const
Definition minoptmax.h:33
Definition pad.h:55
STROKE_PARAMS GetStroke() const override
Definition pcb_shape.h:91
EDA_ITEM * Clone() const override
Create a duplicate of this item with linked list members set to NULL.
Definition seg.h:42
VECTOR2I A
Definition seg.h:49
VECTOR2I B
Definition seg.h:50
SHAPE_TYPE Type() const
Return the type of the shape.
Definition shape.h:98
const std::vector< SHAPE * > & Shapes() const
Represent a polyline containing arcs as well as line segments: A chain of connected line and/or arc s...
const VECTOR2I NearestPoint(const VECTOR2I &aP, bool aAllowInternalShapePoints=true) const
Find a point on the line chain that is closest to point aP.
virtual size_t GetSegmentCount() const override
const SEG CSegment(int aIndex) const
Return a constant copy of the aIndex segment in the line chain.
Represent a set of closed polygons.
SHAPE_LINE_CHAIN & Outline(int aIndex)
Return the reference to aIndex-th outline in the set.
int OutlineCount() const
Return the number of outlines in the set.
bool Contains(const VECTOR2I &aP, int aSubpolyIndex=-1, int aAccuracy=0, bool aUseBBoxCaches=false) const
Return true if a given subpolygon contains the point aP.
An abstract shape on 2D plane.
Definition shape.h:126
virtual bool Collide(const VECTOR2I &aP, int aClearance=0, int *aActual=nullptr, VECTOR2I *aLocation=nullptr) const
Check if the boundary of shape (this) lies closer to the point aP than aClearance,...
Definition shape.h:181
virtual VECTOR2I Centre() const
Compute a center-of-mass of the shape.
Definition shape.h:232
Simple container to manage line stroke parameters.
void SetWidth(int aWidth)
constexpr extended_type SquaredDistance(const VECTOR2< T > &aVector) const
Compute the squared distance between two vectors.
Definition vector2d.h:569
The common library.
PCB_DRC_CODE
Definition drc_item.h:38
@ DRCE_SILK_EDGE_CLEARANCE
Definition drc_item.h:99
@ DRCE_EDGE_CLEARANCE
Definition drc_item.h:47
DRC_CONSTRAINT_T
Definition drc_rule.h:47
@ SILK_CLEARANCE_CONSTRAINT
Definition drc_rule.h:56
@ EDGE_CLEARANCE_CONSTRAINT
Definition drc_rule.h:53
#define REPORT_AUX(s)
#define _(s)
@ SEGMENT
Definition eda_shape.h:45
@ RECTANGLE
Use RECTANGLE instead of RECT to avoid collision in a Windows header.
Definition eda_shape.h:46
PCB_LAYER_ID
A quick note on layer IDs:
Definition layer_ids.h:60
@ Edge_Cuts
Definition layer_ids.h:112
@ Margin
Definition layer_ids.h:113
@ F_SilkS
Definition layer_ids.h:100
@ UNDEFINED_LAYER
Definition layer_ids.h:61
@ B_SilkS
Definition layer_ids.h:101
static DRC_REGISTER_TEST_PROVIDER< DRC_TEST_PROVIDER_ANNULAR_WIDTH > dummy
@ NPTH
like PAD_PTH, but not plated mechanical use only, no connection allowed
Definition padstack.h:103
@ CONN
Like smd, does not appear on the solder paste layer (default) Note: also has a special attribute in G...
Definition padstack.h:100
@ CASTELLATED
a pad with a castellated through hole
Definition padstack.h:121
@ RPT_SEVERITY_IGNORE
@ SH_COMPOUND
compound shape, consisting of multiple simple shapes
Definition shape.h:53
int actual
@ PCB_SHAPE_T
class PCB_SHAPE, a segment not on copper layers
Definition typeinfo.h:88
@ PCB_VIA_T
class PCB_VIA, a via (like a track segment on a copper layer)
Definition typeinfo.h:97
@ PCB_ZONE_T
class ZONE, a copper pour area
Definition typeinfo.h:108
@ PCB_PAD_T
class PAD, a pad in a footprint
Definition typeinfo.h:87
@ PCB_ARC_T
class PCB_ARC, an arc track segment on a copper layer
Definition typeinfo.h:98
@ PCB_TRACE_T
class PCB_TRACK, a track segment (segment on a copper layer)
Definition typeinfo.h:96
VECTOR2< int32_t > VECTOR2I
Definition vector2d.h:695