KiCad PCB EDA Suite
Loading...
Searching...
No Matches
drc_test_provider_connection_width.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 (C) 2022-2024 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 3
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/gpl-3.0.html
19 * or you may search the http://www.gnu.org website for the version 3 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 <algorithm>
25#include <atomic>
26#include <deque>
27#include <optional>
28#include <utility>
29
30#include <wx/debug.h>
31
32#include <board.h>
35#include <drc/drc_rule.h>
36#include <drc/drc_item.h>
38#include <drc/drc_rtree.h>
40#include <footprint.h>
41#include <geometry/seg.h>
43#include <geometry/vertex_set.h>
44#include <math/box2.h>
45#include <math/vector2d.h>
46#include <pcb_shape.h>
47#include <progress_reporter.h>
48#include <core/thread_pool.h>
49#include <pcb_track.h>
50#include <pad.h>
51#include <zone.h>
52
53/*
54 Checks for copper connections that are less than the specified minimum width
55
56 Errors generated:
57 - DRCE_CONNECTION_WIDTH
58*/
59
61{
64
65 bool operator==(const NETCODE_LAYER_CACHE_KEY& other) const
66 {
67 return Netcode == other.Netcode && Layer == other.Layer;
68 }
69};
70
71
72namespace std
73{
74 template <>
76 {
77 std::size_t operator()( const NETCODE_LAYER_CACHE_KEY& k ) const
78 {
79 constexpr std::size_t prime = 19937;
80
81 return hash<int>()( k.Netcode ) ^ ( hash<int>()( k.Layer ) * prime );
82 }
83 };
84}
85
86
88{
89public:
91 {
92 }
93
95 {
96 }
97
98 virtual bool Run() override;
99
100 virtual const wxString GetName() const override
101 {
102 return wxT( "copper width" );
103 };
104
105 virtual const wxString GetDescription() const override
106 {
107 return wxT( "Checks copper nets for connections less than a specified minimum" );
108 }
109
110private:
111 wxString layerDesc( PCB_LAYER_ID aLayer );
112};
113
114
116{
117public:
118 POLYGON_TEST( int aLimit ) :
119 VERTEX_SET( 0 ),
120 m_limit( aLimit )
121 {
122 };
123
124 bool FindPairs( const SHAPE_LINE_CHAIN& aPoly )
125 {
126 m_hits.clear();
127 m_vertices.clear();
128 m_bbox = aPoly.BBox();
129
130 createList( aPoly );
131
132 m_vertices.front().updateList();
133
134 VERTEX* p = m_vertices.front().next;
135 std::set<VERTEX*> all_hits;
136
137 while( p != &m_vertices.front() )
138 {
139 VERTEX* match = nullptr;
140
141 // Only run the expensive search if we don't already have a match for the point
142 if( ( all_hits.empty() || all_hits.count( p ) == 0 ) && ( match = getKink( p ) ) != nullptr )
143 {
144 if( !all_hits.count( match ) && m_hits.emplace( p->i, match->i ).second )
145 {
146 all_hits.emplace( p );
147 all_hits.emplace( match );
148 all_hits.emplace( p->next );
149 all_hits.emplace( p->prev );
150 all_hits.emplace( match->next );
151 all_hits.emplace( match->prev );
152 }
153 }
154
155 p = p->next;
156 }
157
158 return !m_hits.empty();
159 }
160
161 std::set<std::pair<int, int>>& GetVertices()
162 {
163 return m_hits;
164 }
165
166
175 bool isSubstantial( const VERTEX* aA, const VERTEX* aB ) const
176 {
177 bool x_change = false;
178 bool y_change = false;
179
180 // This is a failsafe in case of invalid lists. Never check
181 // more than the total number of points in m_vertices
182 size_t checked = 0;
183 size_t total_pts = m_vertices.size();
184
185 const VERTEX* p0 = aA;
186 const VERTEX* p = getNextOutlineVertex( p0 );
187
188 while( !same_point( p, aB ) // We've reached the other inflection point
189 && !same_point( p, aA ) // We've gone around in a circle
190 && checked < total_pts // Fail-safe for invalid lists
191 && !( x_change && y_change ) ) // We've found a substantial change in both directions
192 {
193 double diff_x = std::abs( p->x - p0->x );
194 double diff_y = std::abs( p->y - p0->y );
195
196 // Check for a substantial change in the x or y direction
197 // This is measured by the set value of the minimum connection width
198 if( diff_x > m_limit )
199 x_change = true;
200
201 if( diff_y > m_limit )
202 y_change = true;
203
204 p = getNextOutlineVertex( p );
205
206 ++checked;
207 }
208
209 wxCHECK_MSG( checked < total_pts, false, wxT( "Invalid polygon detected. Missing points to check" ) );
210
211 if( !same_point( p, aA ) && ( !x_change || !y_change ) )
212 return false;
213
214 p = getPrevOutlineVertex( p0 );
215
216 x_change = false;
217 y_change = false;
218 checked = 0;
219
220 while( !same_point( p, aB ) // We've reached the other inflection point
221 && !same_point( p, aA ) // We've gone around in a circle
222 && checked < total_pts // Fail-safe for invalid lists
223 && !( x_change && y_change ) ) // We've found a substantial change in both directions
224 {
225 double diff_x = std::abs( p->x - p0->x );
226 double diff_y = std::abs( p->y - p0->y );
227
228 // Floating point zeros can have a negative sign, so we need to
229 // ensure that only substantive diversions count for a direction
230 // change
231 if( diff_x > m_limit )
232 x_change = true;
233
234 if( diff_y > m_limit )
235 y_change = true;
236
237 p = getPrevOutlineVertex( p );
238
239 ++checked;
240 }
241
242 wxCHECK_MSG( checked < total_pts, false, wxT( "Invalid polygon detected. Missing points to check" ) );
243
244 return ( same_point( p, aA ) || ( x_change && y_change ) );
245 }
246
247
248 VERTEX* getKink( VERTEX* aPt ) const
249 {
250 // The point needs to be at a concave surface
251 if( locallyInside( aPt->prev, aPt->next ) )
252 return nullptr;
253
254 // z-order range for the current point ± limit bounding box
255 const int32_t maxZ = zOrder( aPt->x + m_limit, aPt->y + m_limit );
256 const int32_t minZ = zOrder( aPt->x - m_limit, aPt->y - m_limit );
257 const SEG::ecoord limit2 = SEG::Square( m_limit );
258
259 // first look for points in increasing z-order
260 VERTEX* p = aPt->nextZ;
261 SEG::ecoord min_dist = std::numeric_limits<SEG::ecoord>::max();
262 VERTEX* retval = nullptr;
263
264 while( p && p->z <= maxZ )
265 {
266 int delta_i = std::abs( p->i - aPt->i );
267 VECTOR2D diff( p->x - aPt->x, p->y - aPt->y );
268 SEG::ecoord dist2 = diff.SquaredEuclideanNorm();
269
270 if( delta_i > 1 && dist2 < limit2 && dist2 < min_dist && dist2 > 0
271 && locallyInside( p, aPt ) && isSubstantial( p, aPt ) && isSubstantial( aPt, p ) )
272 {
273 min_dist = dist2;
274 retval = p;
275 }
276
277 p = p->nextZ;
278 }
279
280 p = aPt->prevZ;
281
282 while( p && p->z >= minZ )
283 {
284 int delta_i = std::abs( p->i - aPt->i );
285 VECTOR2D diff( p->x - aPt->x, p->y - aPt->y );
286 SEG::ecoord dist2 = diff.SquaredEuclideanNorm();
287
288 if( delta_i > 1 && dist2 < limit2 && dist2 < min_dist && dist2 > 0
289 && locallyInside( p, aPt ) && isSubstantial( p, aPt ) && isSubstantial( aPt, p ) )
290 {
291 min_dist = dist2;
292 retval = p;
293 }
294
295 p = p->prevZ;
296 }
297 return retval;
298 }
299
300private:
302 std::set<std::pair<int, int>> m_hits;
303};
304
305
307{
308 return wxString::Format( wxT( "(%s)" ), m_drcEngine->GetBoard()->GetLayerName( aLayer ) );
309}
310
311
313{
315 return true; // Continue with other tests
316
317 if( !reportPhase( _( "Checking nets for minimum connection width..." ) ) )
318 return false; // DRC cancelled
319
320 LSET copperLayerSet = m_drcEngine->GetBoard()->GetEnabledLayers() & LSET::AllCuMask();
321 LSEQ copperLayers = copperLayerSet.Seq();
322 BOARD* board = m_drcEngine->GetBoard();
323
324 /*
325 * Build a set of distinct minWidths specified by various DRC rules. We'll run a test for
326 * each distinct minWidth, and then decide if any copper which failed that minWidth actually
327 * was required to abide by it or not.
328 */
329 std::set<int> distinctMinWidths
331
332 if( m_drcEngine->IsCancelled() )
333 return false; // DRC cancelled
334
335 struct ITEMS_POLY
336 {
337 std::set<BOARD_ITEM*> Items;
338 SHAPE_POLY_SET Poly;
339 };
340
341 std::unordered_map<NETCODE_LAYER_CACHE_KEY, ITEMS_POLY> dataset;
342 std::atomic<size_t> done( 1 );
343
344 auto calc_effort =
345 [&]( const std::set<BOARD_ITEM*>& items, PCB_LAYER_ID aLayer ) -> size_t
346 {
347 size_t effort = 0;
348
349 for( BOARD_ITEM* item : items )
350 {
351 if( item->Type() == PCB_ZONE_T )
352 {
353 ZONE* zone = static_cast<ZONE*>( item );
354 effort += zone->GetFilledPolysList( aLayer )->FullPointCount();
355 }
356 else
357 {
358 effort += 4;
359 }
360 }
361
362 return effort;
363 };
364
365 /*
366 * For each net, on each layer, build a polygonSet which contains all the copper associated
367 * with that net on that layer.
368 */
369 auto build_netlayer_polys =
370 [&]( int aNetcode, const PCB_LAYER_ID aLayer ) -> size_t
371 {
372 if( m_drcEngine->IsCancelled() )
373 return 0;
374
375 ITEMS_POLY& itemsPoly = dataset[ { aNetcode, aLayer } ];
376
377 for( BOARD_ITEM* item : itemsPoly.Items )
378 {
379 item->TransformShapeToPolygon( itemsPoly.Poly, aLayer, 0, ARC_HIGH_DEF,
381 }
382
383 itemsPoly.Poly.Fracture( SHAPE_POLY_SET::PM_FAST );
384
385 done.fetch_add( calc_effort( itemsPoly.Items, aLayer ) );
386
387 return 1;
388 };
389
390 /*
391 * Examine all necks in a given polygonSet which fail a given minWidth.
392 */
393 auto min_checker =
394 [&]( const ITEMS_POLY& aItemsPoly, const PCB_LAYER_ID aLayer, int aMinWidth ) -> size_t
395 {
396 if( m_drcEngine->IsCancelled() )
397 return 0;
398
399 POLYGON_TEST test( aMinWidth );
400
401 for( int ii = 0; ii < aItemsPoly.Poly.OutlineCount(); ++ii )
402 {
403 const SHAPE_LINE_CHAIN& chain = aItemsPoly.Poly.COutline( ii );
404
405 test.FindPairs( chain );
406 auto& ret = test.GetVertices();
407
408 for( const std::pair<int, int>& pt : ret )
409 {
410 /*
411 * We've found a neck that fails the given aMinWidth. We now need to know
412 * if the objects the produced the copper at this location are required to
413 * abide by said aMinWidth or not. (If so, we have a violation.)
414 *
415 * We find the contributingItems by hit-testing at the choke point (the
416 * centre point of the neck), and then run the rules engine on those
417 * contributingItems. If the reported constraint matches aMinWidth, then
418 * we've got a violation.
419 */
420 SEG span( chain.CPoint( pt.first ), chain.CPoint( pt.second ) );
421 VECTOR2I location = ( span.A + span.B ) / 2;
422 int dist = ( span.A - span.B ).EuclideanNorm();
423
424 std::vector<BOARD_ITEM*> contributingItems;
425
426 for( auto* item : board->m_CopperItemRTreeCache->GetObjectsAt( location,
427 aLayer,
428 aMinWidth ) )
429 {
430 if( item->HitTest( location, aMinWidth ) )
431 contributingItems.push_back( item );
432 }
433
434 for( auto& [ zone, rtree ] : board->m_CopperZoneRTreeCache )
435 {
436 if( !rtree.get() )
437 continue;
438
439 auto obj_list = rtree->GetObjectsAt( location, aLayer, aMinWidth );
440
441 if( !obj_list.empty() && zone->HitTestFilledArea( aLayer, location, aMinWidth ) )
442 {
443 contributingItems.push_back( zone );
444 }
445 }
446
447 if( !contributingItems.empty() )
448 {
449 BOARD_ITEM* item1 = contributingItems[0];
450 BOARD_ITEM* item2 = contributingItems.size() > 1 ? contributingItems[1]
451 : nullptr;
453 item1, item2, aLayer );
454
455 if( c.Value().Min() == aMinWidth + board->GetDesignSettings().GetDRCEpsilon() )
456 {
458 wxString msg;
459
460 msg = formatMsg( _( "(%s minimum connection width %s; actual %s)" ),
461 c.GetName(),
462 c.Value().Min(),
463 dist );
464
465 msg += wxS( " " ) + layerDesc( aLayer );
466
467 drce->SetErrorMessage( drce->GetErrorText() + wxS( " " ) + msg );
468 drce->SetViolatingRule( c.GetParentRule() );
469
470 for( BOARD_ITEM* item : contributingItems )
471 drce->AddItem( item );
472
473 reportViolation( drce, location, aLayer );
474 }
475 }
476 }
477 }
478
479 done.fetch_add( calc_effort( aItemsPoly.Items, aLayer ) );
480
481 return 1;
482 };
483
484 for( PCB_LAYER_ID layer : copperLayers )
485 {
486 for( ZONE* zone : board->m_DRCCopperZones )
487 {
488 if( !zone->GetIsRuleArea() && zone->IsOnLayer( layer ) )
489 dataset[ { zone->GetNetCode(), layer } ].Items.emplace( zone );
490 }
491
492 for( PCB_TRACK* track : board->Tracks() )
493 {
494 if( PCB_VIA* via = dynamic_cast<PCB_VIA*>( track ) )
495 {
496 if( via->FlashLayer( static_cast<int>( layer ) ) )
497 dataset[ { via->GetNetCode(), layer } ].Items.emplace( via );
498 }
499 else if( track->IsOnLayer( layer ) )
500 {
501 dataset[ { track->GetNetCode(), layer } ].Items.emplace( track );
502 }
503 }
504
505 for( FOOTPRINT* fp : board->Footprints() )
506 {
507 for( PAD* pad : fp->Pads() )
508 {
509 if( pad->FlashLayer( static_cast<int>( layer ) ) )
510 dataset[ { pad->GetNetCode(), layer } ].Items.emplace( pad );
511 }
512
513 // Footprint zones are also in the m_DRCCopperZones cache
514 }
515 }
516
518 std::vector<std::future<size_t>> returns;
519 size_t total_effort = 0;
520
521 for( const auto& [ netLayer, itemsPoly ] : dataset )
522 total_effort += calc_effort( itemsPoly.Items, netLayer.Layer );
523
524 total_effort += std::max( (size_t) 1, total_effort ) * distinctMinWidths.size();
525
526 returns.reserve( dataset.size() );
527
528 for( const auto& [ netLayer, itemsPoly ] : dataset )
529 {
530 returns.emplace_back( tp.submit( build_netlayer_polys, netLayer.Netcode, netLayer.Layer ) );
531 }
532
533 for( std::future<size_t>& ret : returns )
534 {
535 std::future_status status = ret.wait_for( std::chrono::milliseconds( 250 ) );
536
537 while( status != std::future_status::ready )
538 {
539 reportProgress( done, total_effort );
540 status = ret.wait_for( std::chrono::milliseconds( 250 ) );
541 }
542 }
543
544 returns.clear();
545 returns.reserve( dataset.size() * distinctMinWidths.size() );
546 int epsilon = board->GetDesignSettings().GetDRCEpsilon();
547
548 for( const auto& [ netLayer, itemsPoly ] : dataset )
549 {
550 for( int minWidth : distinctMinWidths )
551 {
552 if( ( minWidth -= epsilon ) <= 0 )
553 continue;
554
555 returns.emplace_back( tp.submit( min_checker, itemsPoly, netLayer.Layer, minWidth ) );
556 }
557 }
558
559 for( std::future<size_t>& ret : returns )
560 {
561 std::future_status status = ret.wait_for( std::chrono::milliseconds( 250 ) );
562
563 while( status != std::future_status::ready )
564 {
565 reportProgress( done, total_effort );
566 status = ret.wait_for( std::chrono::milliseconds( 250 ) );
567 }
568 }
569
570 return true;
571}
572
573
574namespace detail
575{
577}
constexpr int ARC_HIGH_DEF
Definition: base_units.h:120
A base class for any item which can be embedded within the BOARD container class, and therefore insta...
Definition: board_item.h:79
virtual void TransformShapeToPolygon(SHAPE_POLY_SET &aBuffer, PCB_LAYER_ID aLayer, int aClearance, int aError, ERROR_LOC aErrorLoc, bool ignoreLineWidth=false) const
Convert the item shape to a closed polygon.
Definition: board_item.cpp:221
Information pertinent to a Pcbnew printed circuit board.
Definition: board.h:289
LSET GetEnabledLayers() const
A proxy function that calls the corresponding function in m_BoardSettings.
Definition: board.cpp:757
std::vector< ZONE * > m_DRCCopperZones
Definition: board.h:1293
const FOOTPRINTS & Footprints() const
Definition: board.h:330
const TRACKS & Tracks() const
Definition: board.h:328
std::shared_ptr< DRC_RTREE > m_CopperItemRTreeCache
Definition: board.h:1287
const wxString GetLayerName(PCB_LAYER_ID aLayer) const
Return the name of a aLayer.
Definition: board.cpp:575
std::unordered_map< ZONE *, std::unique_ptr< DRC_RTREE > > m_CopperZoneRTreeCache
Definition: board.h:1286
BOARD_DESIGN_SETTINGS & GetDesignSettings() const
Definition: board.cpp:874
wxString GetName() const
Definition: drc_rule.h:150
MINOPTMAX< int > & Value()
Definition: drc_rule.h:143
DRC_RULE * GetParentRule() const
Definition: drc_rule.h:146
BOARD * GetBoard() const
Definition: drc_engine.h:89
std::set< int > QueryDistinctConstraints(DRC_CONSTRAINT_T aConstraintId)
bool IsErrorLimitExceeded(int error_code)
DRC_CONSTRAINT EvalRules(DRC_CONSTRAINT_T aConstraintType, const BOARD_ITEM *a, const BOARD_ITEM *b, PCB_LAYER_ID aLayer, REPORTER *aReporter=nullptr)
Definition: drc_engine.cpp:652
bool IsCancelled() const
static std::shared_ptr< DRC_ITEM > Create(int aErrorCode)
Constructs a DRC_ITEM for the given error code.
Definition: drc_item.cpp:352
virtual const wxString GetDescription() const override
virtual const wxString GetName() const override
virtual bool Run() override
Run this provider against the given PCB with configured options (if any).
Represent a DRC "provider" which runs some DRC functions over a BOARD and spits out DRC_ITEM and posi...
wxString formatMsg(const wxString &aFormatString, const wxString &aSource, double aConstraint, double aActual)
virtual bool reportPhase(const wxString &aStageName)
virtual void reportViolation(std::shared_ptr< DRC_ITEM > &item, const VECTOR2I &aMarkerPos, int aMarkerLayer)
DRC_ENGINE * m_drcEngine
virtual bool reportProgress(size_t aCount, size_t aSize, size_t aDelta=1)
LSEQ is a sequence (and therefore also a set) of PCB_LAYER_IDs.
Definition: lseq.h:47
LSET is a set of PCB_LAYER_IDs.
Definition: lset.h:35
LSEQ Seq(const PCB_LAYER_ID *aWishListSequence, unsigned aCount) const
Return an LSEQ from the union of this LSET and a desired sequence.
Definition: lset.cpp:392
static LSET AllCuMask(int aCuLayerCount=MAX_CU_LAYERS)
Return a mask holding the requested number of Cu PCB_LAYER_IDs.
Definition: lset.cpp:732
T Min() const
Definition: minoptmax.h:33
Definition: pad.h:54
bool isSubstantial(const VERTEX *aA, const VERTEX *aB) const
Checks to see if there is a "substantial" protrusion in each polygon produced by the cut from aA to a...
VERTEX * getKink(VERTEX *aPt) const
bool FindPairs(const SHAPE_LINE_CHAIN &aPoly)
std::set< std::pair< int, int > > & GetVertices()
std::set< std::pair< int, int > > m_hits
Definition: seg.h:42
VECTOR2I A
Definition: seg.h:49
VECTOR2I::extended_type ecoord
Definition: seg.h:44
VECTOR2I B
Definition: seg.h:50
static SEG::ecoord Square(int a)
Definition: seg.h:123
Represent a polyline containing arcs as well as line segments: A chain of connected line and/or arc s...
const VECTOR2I & CPoint(int aIndex) const
Return a reference to a given point in the line chain.
const BOX2I BBox(int aClearance=0) const override
Compute a bounding box of the shape, with a margin of aClearance a collision.
Represent a set of closed polygons.
extended_type SquaredEuclideanNorm() const
Compute the squared euclidean norm of the vector, which is defined as (x ** 2 + y ** 2).
Definition: vector2d.h:302
std::deque< VERTEX > m_vertices
Definition: vertex_set.h:339
int32_t zOrder(const double aX, const double aY) const
Note that while the inputs are doubles, these are scaled by the size of the bounding box to fit into ...
Definition: vertex_set.cpp:61
VERTEX * createList(const SHAPE_LINE_CHAIN &points, VERTEX *aTail=nullptr, void *aUserData=nullptr)
Create a list of vertices from a line chain.
Definition: vertex_set.cpp:9
bool locallyInside(const VERTEX *a, const VERTEX *b) const
Check whether the segment from vertex a -> vertex b is inside the polygon around the immediate area o...
Definition: vertex_set.cpp:150
BOX2I m_bbox
Definition: vertex_set.h:338
VERTEX * getPrevOutlineVertex(const VERTEX *aPt) const
Get the previous vertex in the outline, avoiding steiner points and points that overlap with splits.
Definition: vertex_set.cpp:121
VERTEX * getNextOutlineVertex(const VERTEX *aPt) const
Get the next vertex in the outline, avoiding steiner points and points that overlap with splits.
Definition: vertex_set.cpp:94
bool same_point(const VERTEX *aA, const VERTEX *aB) const
Check if two vertices are at the same point.
Definition: vertex_set.cpp:89
const double x
Definition: vertex_set.h:231
VERTEX * next
Definition: vertex_set.h:237
VERTEX * prevZ
Definition: vertex_set.h:243
VERTEX * nextZ
Definition: vertex_set.h:244
VERTEX * prev
Definition: vertex_set.h:236
const int i
Definition: vertex_set.h:230
int32_t z
Definition: vertex_set.h:240
const double y
Definition: vertex_set.h:232
Handle a list of polygons defining a copper zone.
Definition: zone.h:73
bool GetIsRuleArea() const
Accessors to parameters used in Rule Area zones:
Definition: zone.h:711
const std::shared_ptr< SHAPE_POLY_SET > & GetFilledPolysList(PCB_LAYER_ID aLayer) const
Definition: zone.h:616
virtual bool IsOnLayer(PCB_LAYER_ID) const override
Test to see if this object is on the given layer.
Definition: zone.cpp:340
@ DRCE_CONNECTION_WIDTH
Definition: drc_item.h:56
@ CONNECTION_WIDTH_CONSTRAINT
Definition: drc_rule.h:74
#define _(s)
@ ERROR_OUTSIDE
PCB_LAYER_ID
A quick note on layer IDs:
Definition: layer_ids.h:60
static DRC_REGISTER_TEST_PROVIDER< DRC_TEST_PROVIDER_ANNULAR_WIDTH > dummy
STL namespace.
EDA_ANGLE abs(const EDA_ANGLE &aAngle)
Definition: eda_angle.h:390
const double epsilon
bool operator==(const NETCODE_LAYER_CACHE_KEY &other) const
std::size_t operator()(const NETCODE_LAYER_CACHE_KEY &k) const
static thread_pool * tp
Definition: thread_pool.cpp:30
BS::thread_pool thread_pool
Definition: thread_pool.h:30
thread_pool & GetKiCadThreadPool()
Get a reference to the current thread pool.
Definition: thread_pool.cpp:32
@ PCB_ZONE_T
class ZONE, a copper pour area
Definition: typeinfo.h:107