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 <atomic>
25#include <common.h>
26#include <pcb_shape.h>
27#include <pcb_board_outline.h>
29#include <footprint.h>
30#include <pad.h>
31#include <pcb_track.h>
32#include <geometry/seg.h>
34#include <drc/drc_engine.h>
35#include <drc/drc_item.h>
36#include <drc/drc_rule.h>
38#include <drc/drc_rtree.h>
39#include <thread_pool.h>
40#include <mutex>
41
42/*
43 Board edge clearance test. Checks all items for their mechanical clearances against the board
44 edge.
45 Errors generated:
46 - DRCE_EDGE_CLEARANCE
47 - DRCE_SILK_EDGE_CLEARANCE
48*/
49
56
57
59{
60public:
66
68
69 virtual bool Run() override;
70
71 virtual const wxString GetName() const override { return wxT( "edge_clearance" ); }
72
73private:
74 void resolveSilkDisposition( BOARD_ITEM* aItem, const SHAPE* aItemShape, const SHAPE_POLY_SET& aBoardOutline );
75
76 bool testAgainstEdge( BOARD_ITEM* item, SHAPE* itemShape, PCB_LAYER_ID shapeLayer, BOARD_ITEM* other,
77 DRC_CONSTRAINT_T aConstraintType, PCB_DRC_CODE aErrorCode );
78
79private:
80 std::vector<PAD*> m_castellatedPads;
84
85 std::map<BOARD_ITEM*, SILK_DISPOSITION> m_silkDisposition;
86 std::mutex m_silkMutex;
87};
88
89
91 const SHAPE_POLY_SET& aBoardOutline )
92{
93 SILK_DISPOSITION disposition = UNKNOWN;
94
95 if( aItemShape->Type() == SH_COMPOUND )
96 {
97 const SHAPE_COMPOUND* compound = static_cast<const SHAPE_COMPOUND*>( aItemShape );
98
99 for( const SHAPE* elem : compound->Shapes() )
100 {
101 SILK_DISPOSITION elem_disposition = aBoardOutline.Contains( elem->Centre() ) ? ON_BOARD : OFF_BOARD;
102
103 if( disposition == UNKNOWN )
104 {
105 disposition = elem_disposition;
106 }
107 else if( disposition != elem_disposition )
108 {
109 disposition = CROSSES_EDGE;
110 break;
111 }
112 }
113 }
114 else
115 {
116 disposition = aBoardOutline.Contains( aItemShape->Centre() ) ? ON_BOARD : OFF_BOARD;
117 }
118
119 {
120 std::lock_guard<std::mutex> lock( m_silkMutex );
121 m_silkDisposition[aItem] = disposition;
122 }
123
124 if( disposition == CROSSES_EDGE )
125 {
126 BOARD_ITEM* nearestEdge = nullptr;
127 VECTOR2I itemPos = aItem->GetCenter();
128 VECTOR2I nearestEdgePt = aBoardOutline.Outline( 0 ).NearestPoint( itemPos, false );
129
130 for( int outlineIdx = 1; outlineIdx < aBoardOutline.OutlineCount(); ++outlineIdx )
131 {
132 VECTOR2I otherEdgePt = aBoardOutline.Outline( outlineIdx ).NearestPoint( itemPos, false );
133
134 if( otherEdgePt.SquaredDistance( itemPos ) < nearestEdgePt.SquaredDistance( itemPos ) )
135 nearestEdgePt = otherEdgePt;
136 }
137
138 for( BOARD_ITEM* edge : m_edgesTree.GetObjectsAt( nearestEdgePt, Edge_Cuts, m_epsilon ) )
139 {
140 if( edge->HitTest( nearestEdgePt, m_epsilon ) )
141 {
142 nearestEdge = edge;
143 break;
144 }
145 }
146
147 if( !nearestEdge )
148 return;
149
150 auto constraint = m_drcEngine->EvalRules( SILK_CLEARANCE_CONSTRAINT, nearestEdge, aItem, UNDEFINED_LAYER );
151 int minClearance = constraint.GetValue().Min();
152
153 if( constraint.GetSeverity() != RPT_SEVERITY_IGNORE && minClearance >= 0 )
154 {
155 std::shared_ptr<DRC_ITEM> drcItem = DRC_ITEM::Create( DRCE_SILK_EDGE_CLEARANCE );
156
157 // Report clearance info if there is any, even though crossing is just a straight-up collision
158 if( minClearance > 0 )
159 {
160 drcItem->SetErrorDetail( formatMsg( _( "(%s clearance %s; actual %s)" ),
161 constraint.GetName(),
162 minClearance,
163 0 ) );
164 }
165
166 drcItem->SetItems( nearestEdge->m_Uuid, aItem->m_Uuid );
167 drcItem->SetViolatingRule( constraint.GetParentRule() );
168 reportTwoPointGeometry( drcItem, nearestEdgePt, nearestEdgePt, nearestEdgePt, aItem->GetLayer() );
169 }
170 }
171#if 0
172 // If you want "Silk outside board edge" errors:
173 else if( disposition == OFF_BOARD )
174 {
175 std::shared_ptr<DRC_ITEM> drcItem = DRC_ITEM::Create( DRCE_SILK_EDGE_CLEARANCE );
176 drcItem->SetErrorMessage( _( "Silkscreen outside board edge" ) );
177
178 drcItem->SetItems( aItem->m_Uuid );
179 reportTwoPointGeometry( drcItem, aItem->GetCenter(), aItem->GetCenter(), aItem->GetCenter(),
180 aItem->GetLayer() );
181 }
182#endif
183}
184
185
187 BOARD_ITEM* edge, DRC_CONSTRAINT_T aConstraintType,
188 PCB_DRC_CODE aErrorCode )
189{
190 std::shared_ptr<SHAPE> shape;
191
192 if( edge->Type() == PCB_PAD_T )
193 shape = edge->GetEffectiveHoleShape();
194 else
195 shape = edge->GetEffectiveShape( Edge_Cuts );
196
197 auto constraint = m_drcEngine->EvalRules( aConstraintType, edge, item, UNDEFINED_LAYER );
198 int minClearance = constraint.GetValue().Min();
199 int actual;
200 VECTOR2I pos;
201
202 if( constraint.GetSeverity() != RPT_SEVERITY_IGNORE && minClearance >= 0 )
203 {
204 if( itemShape->Collide( shape.get(), std::max( 0, minClearance - m_epsilon ), &actual, &pos ) )
205 {
206 if( item->Type() == PCB_TRACE_T || item->Type() == PCB_ARC_T )
207 {
208 // Edge collisions are allowed inside the holes of castellated pads
209 for( PAD* castellatedPad : m_castellatedPads )
210 {
211 if( castellatedPad->GetEffectiveHoleShape()->Collide( pos ) )
212 return true;
213 }
214 }
215
216 std::shared_ptr<DRC_ITEM> drcItem = DRC_ITEM::Create( aErrorCode );
217
218 // Only report clearance info if there is any; otherwise it's just a straight collision
219 if( minClearance > 0 )
220 {
221 drcItem->SetErrorDetail( formatMsg( _( "(%s clearance %s; actual %s)" ),
222 constraint.GetName(),
223 minClearance,
224 actual ) );
225 }
226
227 drcItem->SetItems( edge->m_Uuid, item->m_Uuid );
228 drcItem->SetViolatingRule( constraint.GetParentRule() );
229 reportTwoItemGeometry( drcItem, pos, edge, item, shapeLayer, actual );
230
231 if( aErrorCode == DRCE_SILK_EDGE_CLEARANCE )
232 {
233 std::lock_guard<std::mutex> lock( m_silkMutex );
235 }
236
237 if( item->Type() == PCB_TRACE_T || item->Type() == PCB_ARC_T )
238 return m_drcEngine->GetReportAllTrackErrors();
239 else
240 return false; // don't report violations with multiple edges; one is enough
241 }
242 }
243
244 return true;
245}
246
247
249{
250 if( !m_drcEngine->IsErrorLimitExceeded( DRCE_EDGE_CLEARANCE ) )
251 {
252 if( !reportPhase( _( "Checking copper to board edge clearances..." ) ) )
253 return false; // DRC cancelled
254 }
255 else if( !m_drcEngine->IsErrorLimitExceeded( DRCE_SILK_EDGE_CLEARANCE ) )
256 {
257 if( !reportPhase( _( "Checking silk to board edge clearances..." ) ) )
258 return false; // DRC cancelled
259 }
260 else
261 {
262 REPORT_AUX( wxT( "Edge clearance violations ignored. Tests not run." ) );
263 return true; // continue with other tests
264 }
265
266 m_board = m_drcEngine->GetBoard();
267 m_castellatedPads.clear();
268 m_epsilon = m_board->GetDesignSettings().GetDRCEpsilon();
269 m_edgesTree.clear();
270 m_silkDisposition.clear();
271
272 DRC_CONSTRAINT worstClearanceConstraint;
273
274 if( m_drcEngine->QueryWorstConstraint( EDGE_CLEARANCE_CONSTRAINT, worstClearanceConstraint ) )
275 m_largestEdgeClearance = worstClearanceConstraint.GetValue().Min();
276
277 /*
278 * Build an RTree of the various edges (including NPTH holes) and margins found on the board.
279 */
280 std::vector<std::unique_ptr<PCB_SHAPE>> edges;
281
283 [&]( BOARD_ITEM *item ) -> bool
284 {
285 PCB_SHAPE* shape = static_cast<PCB_SHAPE*>( item );
286 STROKE_PARAMS stroke = shape->GetStroke();
287
288 if( item->IsOnLayer( Edge_Cuts ) )
289 stroke.SetWidth( 0 );
290
291 if( shape->GetShape() == SHAPE_T::RECTANGLE && !shape->IsSolidFill() )
292 {
293 // A single rectangle for the board would defeat the RTree, so convert to edges
294 if( shape->GetCornerRadius() > 0 )
295 {
296 for( SHAPE* subshape : shape->MakeEffectiveShapes( true ) )
297 {
298 if( SHAPE_SEGMENT* segment = dynamic_cast<SHAPE_SEGMENT*>( subshape ) )
299 {
300 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
301 edges.back()->SetShape( SHAPE_T::SEGMENT );
302 edges.back()->SetStart( segment->GetStart() );
303 edges.back()->SetEnd( segment->GetEnd() );
304 edges.back()->SetStroke( stroke );
305 }
306 else if( SHAPE_ARC* arc = dynamic_cast<SHAPE_ARC*>( subshape ) )
307 {
308 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
309 edges.back()->SetShape( SHAPE_T::ARC );
310 edges.back()->SetArcGeometry( arc->GetP0(), arc->GetArcMid(), arc->GetP1() );
311 edges.back()->SetStroke( stroke );
312 }
313 else
314 {
315 wxFAIL_MSG(
316 wxString::Format( "Unexpected effective shape type %d for rounded rectangle",
317 (int) subshape->Type() ) );
318 continue;
319 }
320 }
321 }
322 else
323 {
324 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
325 edges.back()->SetShape( SHAPE_T::SEGMENT );
326 edges.back()->SetEndX( shape->GetStartX() );
327 edges.back()->SetStroke( stroke );
328 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
329 edges.back()->SetShape( SHAPE_T::SEGMENT );
330 edges.back()->SetEndY( shape->GetStartY() );
331 edges.back()->SetStroke( stroke );
332 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
333 edges.back()->SetShape( SHAPE_T::SEGMENT );
334 edges.back()->SetStartX( shape->GetEndX() );
335 edges.back()->SetStroke( stroke );
336 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
337 edges.back()->SetShape( SHAPE_T::SEGMENT );
338 edges.back()->SetStartY( shape->GetEndY() );
339 edges.back()->SetStroke( stroke );
340 }
341 }
342 else if( shape->GetShape() == SHAPE_T::POLY && !shape->IsSolidFill() )
343 {
344 // A single polygon for the board would defeat the RTree, so convert to edges.
345 SHAPE_LINE_CHAIN poly = shape->GetPolyShape().Outline( 0 );
346
347 for( size_t ii = 0; ii < poly.GetSegmentCount(); ++ii )
348 {
349 SEG seg = poly.CSegment( ii );
350 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
351 edges.back()->SetShape( SHAPE_T::SEGMENT );
352 edges.back()->SetStart( seg.A );
353 edges.back()->SetEnd( seg.B );
354 edges.back()->SetStroke( stroke );
355 }
356 }
357 else
358 {
359 edges.emplace_back( static_cast<PCB_SHAPE*>( shape->Clone() ) );
360 edges.back()->SetStroke( stroke );
361 }
362
363 return true;
364 } );
365
366 for( const std::unique_ptr<PCB_SHAPE>& edge : edges )
367 {
368 for( PCB_LAYER_ID layer : { Edge_Cuts, Margin } )
369 {
370 if( edge->IsOnLayer( layer ) )
371 m_edgesTree.Insert( edge.get(), layer, m_largestEdgeClearance );
372 }
373 }
374
375 for( FOOTPRINT* footprint : m_board->Footprints() )
376 {
377 for( PAD* pad : footprint->Pads() )
378 {
379 if( pad->GetAttribute() == PAD_ATTRIB::NPTH && pad->HasHole() )
380 {
381 // edge-clearances are for milling tolerances (drilling tolerances are handled
382 // by hole-clearances)
383 if( pad->GetDrillSizeX() != pad->GetDrillSizeY() )
385 }
386
387 if( pad->GetProperty() == PAD_PROP::CASTELLATED )
388 m_castellatedPads.push_back( pad );
389 }
390 }
391
392 m_edgesTree.Build();
393
394 /*
395 * Collect all testable (item, layer, shape) tuples, then test against edges in parallel.
396 * Flattening to per-layer work units ensures even distribution across threads, since
397 * zones with many layers become many separate work units rather than one heavy item.
398 * Pre-fetching shapes avoids per-zone mutex contention during parallel testing.
399 */
400 struct WORK_UNIT
401 {
402 BOARD_ITEM* item;
403 PCB_LAYER_ID shapeLayer;
404 std::shared_ptr<SHAPE> shape;
405 };
406
407 std::vector<WORK_UNIT> workUnits;
408
410 [&]( BOARD_ITEM *item ) -> bool
411 {
412 if( isInvisibleText( item ) )
413 return true;
414
415 if( item->Type() == PCB_PAD_T )
416 {
417 PAD* pad = static_cast<PAD*>( item );
418
419 if( pad->GetProperty() == PAD_PROP::CASTELLATED
420 || pad->GetAttribute() == PAD_ATTRIB::CONN )
421 {
422 return true;
423 }
424 }
425
426 std::vector<PCB_LAYER_ID> layersToTest;
427
428 switch( item->Type() )
429 {
430 case PCB_PAD_T:
431 layersToTest = static_cast<PAD*>( item )->Padstack().UniqueLayers();
432 break;
433
434 case PCB_VIA_T:
435 layersToTest = static_cast<PCB_VIA*>( item )->Padstack().UniqueLayers();
436 break;
437
438 case PCB_ZONE_T:
439 for( PCB_LAYER_ID layer : item->GetLayerSet() )
440 layersToTest.push_back( layer );
441
442 break;
443
444 default:
445 layersToTest = { UNDEFINED_LAYER };
446 }
447
448 for( PCB_LAYER_ID layer : layersToTest )
449 {
450 workUnits.push_back(
451 { item, layer, item->GetEffectiveShape( layer ) } );
452 }
453
454 return true;
455 } );
456
457 std::atomic<size_t> done( 0 );
458 size_t count = workUnits.size();
459
460 auto processWorkUnit =
461 [&]( const int idx ) -> size_t
462 {
463 if( m_drcEngine->IsCancelled() )
464 {
465 done.fetch_add( 1 );
466 return 0;
467 }
468
469 bool testCopper = !m_drcEngine->IsErrorLimitExceeded( DRCE_EDGE_CLEARANCE );
470 bool testSilk = !m_drcEngine->IsErrorLimitExceeded( DRCE_SILK_EDGE_CLEARANCE );
471
472 if( !testCopper && !testSilk )
473 {
474 done.fetch_add( 1 );
475 return 0;
476 }
477
478 WORK_UNIT& wu = workUnits[idx];
479 BOARD_ITEM* item = wu.item;
480
481 for( PCB_LAYER_ID testLayer : { Edge_Cuts, Margin } )
482 {
483 if( testCopper && item->IsOnCopperLayer() )
484 {
485 m_edgesTree.QueryColliding( item, wu.shapeLayer, testLayer, nullptr,
486 [&]( BOARD_ITEM* edge ) -> bool
487 {
488 return testAgainstEdge( item, wu.shape.get(),
489 wu.shapeLayer, edge,
490 EDGE_CLEARANCE_CONSTRAINT,
491 DRCE_EDGE_CLEARANCE );
492 },
494 }
495
496 if( testSilk
497 && ( item->IsOnLayer( F_SilkS )
498 || item->IsOnLayer( B_SilkS ) ) )
499 {
500 m_edgesTree.QueryColliding( item, wu.shapeLayer, testLayer, nullptr,
501 [&]( BOARD_ITEM* edge ) -> bool
502 {
503 return testAgainstEdge( item, wu.shape.get(),
504 wu.shapeLayer, edge,
505 SILK_CLEARANCE_CONSTRAINT,
506 DRCE_SILK_EDGE_CLEARANCE );
507 },
509 }
510 }
511
512 if( testSilk
513 && ( item->IsOnLayer( F_SilkS ) || item->IsOnLayer( B_SilkS ) ) )
514 {
515 bool needsResolution = false;
516
517 {
518 std::lock_guard<std::mutex> lock( m_silkMutex );
519 needsResolution = m_silkDisposition[item] == UNKNOWN;
520 }
521
522 if( needsResolution && m_board->BoardOutline()->HasOutline() )
523 {
524 resolveSilkDisposition( item, wu.shape.get(),
525 m_board->BoardOutline()->GetOutline() );
526 }
527 }
528
529 done.fetch_add( 1 );
530 return 1;
531 };
532
534 size_t numBlocks = count;
535 auto futures = tp.submit_loop( 0, count, processWorkUnit, numBlocks );
536
537 while( done < count )
538 {
539 reportProgress( done, count );
540
541 if( m_drcEngine->IsCancelled() )
542 {
543 for( auto& f : futures )
544 f.wait();
545
546 break;
547 }
548
549 std::this_thread::sleep_for( std::chrono::milliseconds( 250 ) );
550 }
551
552 return !m_drcEngine->IsCancelled();
553}
554
555
556namespace detail
557{
559}
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:268
virtual VECTOR2I GetCenter() const
This defaults to the center of the bounding box if not overridden.
Definition board_item.h:136
virtual bool IsOnLayer(PCB_LAYER_ID aLayer) const
Test to see if this object is on the given layer.
Definition board_item.h:350
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:288
virtual bool IsOnCopperLayer() const
Definition board_item.h:175
virtual std::shared_ptr< SHAPE_SEGMENT > GetEffectiveHoleShape() const
const MINOPTMAX< int > & GetValue() const
Definition drc_rule.h:196
static std::shared_ptr< DRC_ITEM > Create(int aErrorCode)
Constructs a DRC_ITEM for the given error code.
Definition drc_item.cpp:407
Implement an R-tree for fast spatial and layer indexing of connectable items.
Definition drc_rtree.h:50
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, PCB_LAYER_ID shapeLayer, 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:528
KICAD_T Type() const
Returns the type of object.
Definition eda_item.h:112
int GetStartY() const
Definition eda_shape.h:187
int GetEndX() const
Definition eda_shape.h:230
virtual std::vector< SHAPE * > MakeEffectiveShapes(bool aEdgeOnly=false) const
Make a set of SHAPE objects representing the EDA_SHAPE.
Definition eda_shape.h:390
SHAPE_POLY_SET & GetPolyShape()
SHAPE_T GetShape() const
Definition eda_shape.h:181
int GetEndY() const
Definition eda_shape.h:229
bool IsSolidFill() const
Definition eda_shape.h:129
int GetStartX() const
Definition eda_shape.h:188
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:561
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:53
@ SILK_CLEARANCE_CONSTRAINT
Definition drc_rule.h:62
@ EDGE_CLEARANCE_CONSTRAINT
Definition drc_rule.h:59
#define REPORT_AUX(s)
#define _(s)
@ SEGMENT
Definition eda_shape.h:47
@ RECTANGLE
Use RECTANGLE instead of RECT to avoid collision in a Windows header.
Definition eda_shape.h:48
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
thread_pool & GetKiCadThreadPool()
Get a reference to the current thread pool.
static thread_pool * tp
BS::priority_thread_pool thread_pool
Definition thread_pool.h:31
@ PCB_SHAPE_T
class PCB_SHAPE, a segment not on copper layers
Definition typeinfo.h:85
@ PCB_VIA_T
class PCB_VIA, a via (like a track segment on a copper layer)
Definition typeinfo.h:94
@ PCB_ZONE_T
class ZONE, a copper pour area
Definition typeinfo.h:105
@ PCB_PAD_T
class PAD, a pad in a footprint
Definition typeinfo.h:84
@ PCB_ARC_T
class PCB_ARC, an arc track segment on a copper layer
Definition typeinfo.h:95
@ PCB_TRACE_T
class PCB_TRACK, a track segment (segment on a copper layer)
Definition typeinfo.h:93
VECTOR2< int32_t > VECTOR2I
Definition vector2d.h:687