41 m_itemsList( nullptr ),
54 std::vector<std::shared_ptr<CLEANUP_ITEM> >* aItemsList,
55 bool aRemoveMisConnected,
bool aCleanVias,
bool aMergeSegments,
56 bool aDeleteUnconnected,
bool aDeleteTracksinPad,
57 bool aDeleteDanglingVias,
REPORTER* aReporter )
60 bool has_deleted =
false;
75 bool removeNullSegments = aMergeSegments || aRemoveMisConnected;
76 cleanup( aCleanVias, removeNullSegments, aMergeSegments , aMergeSegments );
90 cleanup(
false,
false,
true,
false );
92 if( aRemoveMisConnected )
107 if( aDeleteTracksinPad )
122 if( aDeleteUnconnected || aDeleteDanglingVias )
132 if( aDeleteUnconnected )
135 if( aDeleteDanglingVias )
145 if( has_deleted && aMergeSegments )
157 cleanup(
false,
false,
false,
true );
166 std::set<BOARD_ITEM *> toRemove;
171 if( segment->IsLocked() )
174 for(
PAD* testedPad : connectivity->GetConnectedPads( segment ) )
176 if( segment->GetNetCode() != testedPad->GetNetCode() )
178 std::shared_ptr<CLEANUP_ITEM> item;
185 item->SetItems( segment );
188 toRemove.insert( segment );
192 for(
PCB_TRACK* testedTrack : connectivity->GetConnectedTracks( segment ) )
194 if( segment->GetNetCode() != testedTrack->GetNetCode() )
196 std::shared_ptr<CLEANUP_ITEM> item;
203 item->SetItems( segment );
206 toRemove.insert( segment );
220 const std::list<CN_ITEM*>& items =
226 CN_ITEM* citem = items.front();
228 if( !citem->
Valid() )
231 const std::vector<std::shared_ptr<CN_ANCHOR>>& anchors = citem->
Anchors();
235 for(
const std::shared_ptr<CN_ANCHOR>&
anchor : anchors )
237 if(
anchor->Pos() != refpoint )
242 return anchor->ConnectedItemsCount() > 1;
251 bool item_erased =
false;
252 bool modified =
false;
254 if( !aTrack && !aVia )
264 std::deque<PCB_TRACK*> temp_tracks(
m_brd->
Tracks() );
268 if( track->IsLocked() || ( track->GetFlags() &
IS_DELETED ) > 0 )
271 if( !aVia && track->Type() ==
PCB_VIA_T )
280 std::shared_ptr<CLEANUP_ITEM> item;
287 item->SetItems( track );
303 }
while( item_erased );
311 std::set<BOARD_ITEM*> toRemove;
318 if( track->IsLocked() )
325 for(
PAD*
pad : connectivity->GetConnectedPads( track ) )
327 if(
pad->HitTest( track->GetStart() ) &&
pad->HitTest( track->GetEnd() ) )
330 track->TransformShapeToPolygon( poly, track->GetLayer(), 0,
ARC_HIGH_DEF,
339 item->SetItems( track );
342 toRemove.insert( track );
358 bool aDeleteDuplicateSegments,
bool aMergeSegments )
365 rtree.
Insert( track, track->GetLayer() );
368 std::set<BOARD_ITEM*> toRemove;
372 if( track->HasFlag(
IS_DELETED ) || track->IsLocked() )
375 if( aDeleteDuplicateVias && track->Type() ==
PCB_VIA_T )
379 if(
via->GetStart() !=
via->GetEnd() )
380 via->SetEnd(
via->GetStart() );
400 item->SetItems(
via );
404 toRemove.insert(
via );
416 if( (
pad->GetLayerSet() & all_cu ) == all_cu )
419 item->SetItems(
via,
pad );
423 toRemove.insert(
via );
431 if( aDeleteNullSegments && track->Type() !=
PCB_VIA_T )
433 if( track->IsNull() )
436 item->SetItems( track );
440 toRemove.insert( track );
444 if( aDeleteDuplicateSegments && track->Type() ==
PCB_TRACE_T && !track->IsNull() )
446 rtree.
QueryColliding( track, track->GetLayer(), track->GetLayer(),
450 return aItem->Type() == PCB_TRACE_T
451 && !aItem->HasFlag( SKIP_STRUCT )
452 && !aItem->HasFlag( IS_DELETED )
453 && !static_cast<PCB_TRACK*>( aItem )->IsNull();
458 PCB_TRACK* other = static_cast<PCB_TRACK*>( aItem );
460 if( track->IsPointOnEnds( other->GetStart() )
461 && track->IsPointOnEnds( other->GetEnd() )
462 && track->GetWidth() == other->GetWidth()
463 && track->GetLayer() == other->GetLayer() )
465 auto item = std::make_shared<CLEANUP_ITEM>( CLEANUP_DUPLICATE_TRACK );
466 item->SetItems( track );
467 m_itemsList->push_back( item );
469 track->SetFlags( IS_DELETED );
470 toRemove.insert( track );
481 removeItems( toRemove );
484 [&]( std::shared_ptr<CN_CONNECTIVITY_ALGO> connectivity ) ->
bool
487 for(
PCB_TRACK* segment : m_brd->Tracks() )
497 for(
CN_ITEM* citem : connectivity->ItemEntry( segment ).GetItems() )
501 std::vector<PCB_TRACK*> sameWidthCandidates;
502 std::vector<PCB_TRACK*> differentWidthCandidates;
506 if( !connected->Valid() )
516 if( candidateSegment->
GetWidth() == segment->GetWidth() )
518 sameWidthCandidates.push_back( candidateSegment );
522 differentWidthCandidates.push_back( candidateSegment );
528 if( !differentWidthCandidates.empty() )
531 for(
PCB_TRACK* candidate : sameWidthCandidates )
533 if( segment->ApproxCollinear( *candidate )
534 && mergeCollinearSegments( segment, candidate ) )
549 while( !m_brd->BuildConnectivity() )
552 m_connectedItemsCache.clear();
553 }
while( mergeSegments( m_brd->GetConnectivity()->GetConnectivityAlgo() ) );
556 for(
PCB_TRACK* track : m_brd->Tracks() )
582 std::set<VECTOR2I> pts;
596 pts.emplace( aSeg1->
GetEnd() );
602 pts.emplace( aSeg2->
GetEnd() );
609 if( citem->HitTest( aSeg1->
GetEnd(), ( aSeg1->
GetWidth() + 1 ) / 2 ) )
610 pts.emplace( aSeg1->
GetEnd() );
615 if( citem->HitTest( aSeg2->
GetEnd(), ( aSeg2->
GetWidth() + 1 ) / 2 ) )
616 pts.emplace( aSeg2->
GetEnd() );
622 if( item != aSeg1 && item != aSeg2 )
628 if( item != aSeg1 && item != aSeg2 )
641 int min_x = std::min( aSeg1->
GetStart().
x,
643 int min_y = std::min( aSeg1->
GetStart().
y,
645 int max_x = std::max( aSeg1->
GetStart().
x,
647 int max_y = std::max( aSeg1->
GetStart().
y,
664 for(
auto& pt : pts )
693 item->SetItems( aSeg1, aSeg2 );
constexpr int ARC_HIGH_DEF
A base class derived from BOARD_ITEM for items that can be connected and have a net,...
A base class for any item which can be embedded within the BOARD container class, and therefore insta...
void SetParentGroup(PCB_GROUP *aGroup)
virtual bool IsLocked() const
Information pertinent to a Pcbnew printed circuit board.
bool BuildConnectivity(PROGRESS_REPORTER *aReporter=nullptr)
Build or rebuild the board connectivity database for the board, especially the list of connected item...
const TRACKS & Tracks() const
void Remove(BOARD_ITEM *aBoardItem, REMOVE_MODE aMode=REMOVE_MODE::NORMAL) override
Removes an item from the container.
std::shared_ptr< CONNECTIVITY_DATA > GetConnectivity() const
Return a list of missing connections between components/tracks.
CN_ITEM represents a BOARD_CONNETED_ITEM in the connectivity system (ie: a pad, track/arc/via,...
const std::vector< CN_ITEM * > & ConnectedItems() const
std::vector< std::shared_ptr< CN_ANCHOR > > & Anchors()
COMMIT & Modify(EDA_ITEM *aItem, BASE_SCREEN *aScreen=nullptr)
Create an undo entry for an item that has been already modified.
COMMIT & Removed(EDA_ITEM *aItem, BASE_SCREEN *aScreen=nullptr)
Modify a given item in the model.
Implement an R-tree for fast spatial and layer indexing of connectable items.
void Insert(BOARD_ITEM *aItem, PCB_LAYER_ID aLayer, int aWorstClearance=0)
Insert an item into the tree on a particular layer with an optional worst clearance.
int QueryColliding(BOARD_ITEM *aRefItem, PCB_LAYER_ID aRefLayer, PCB_LAYER_ID aTargetLayer, std::function< bool(BOARD_ITEM *)> aFilter=nullptr, std::function< bool(BOARD_ITEM *)> aVisitor=nullptr, int aClearance=0) const
This is a fast test which essentially does bounding-box overlap given a worst-case clearance.
void SetFlags(EDA_ITEM_FLAGS aMask)
KICAD_T Type() const
Returns the type of object.
void ClearFlags(EDA_ITEM_FLAGS aMask=EDA_ITEM_ALL_FLAGS)
bool HasFlag(EDA_ITEM_FLAGS aFlag) const
LSET is a set of PCB_LAYER_IDs.
static LSET AllCuMask(int aCuLayerCount=MAX_CU_LAYERS)
Return a mask holding the requested number of Cu PCB_LAYER_IDs.
void SetEnd(const VECTOR2I &aEnd)
void SetStart(const VECTOR2I &aStart)
const VECTOR2I & GetStart() const
const VECTOR2I & GetEnd() const
EDA_ITEM_FLAGS IsPointOnEnds(const VECTOR2I &point, int min_dist=0) const
Return STARTPOINT if point if near (dist = min_dist) start point, ENDPOINT if point if near (dist = m...
VECTOR2I GetPosition() const override
VIATYPE GetViaType() const
virtual LSET GetLayerSet() const override
Return a std::bitset of all layers on which the item physically resides.
A pure virtual class used to derive REPORTER objects from.
virtual REPORTER & Report(const wxString &aText, SEVERITY aSeverity=RPT_SEVERITY_UNDEFINED)=0
Report a string with a given severity.
Represent a set of closed polygons.
void BooleanSubtract(const SHAPE_POLY_SET &b, POLYGON_MODE aFastMode)
Perform boolean polyset difference For aFastMode meaning, see function booleanOp.
bool IsEmpty() const
Return true if the set is empty (no polygons at all)
const std::vector< BOARD_CONNECTED_ITEM * > & getConnectedItems(PCB_TRACK *aTrack)
void deleteTracksInPads()
void removeItems(std::set< BOARD_ITEM * > &aItems)
void cleanup(bool aDeleteDuplicateVias, bool aDeleteNullSegments, bool aDeleteDuplicateSegments, bool aMergeSegments)
Geometry-based cleanup: duplicate items, null items, colinear items.
void CleanupBoard(bool aDryRun, std::vector< std::shared_ptr< CLEANUP_ITEM > > *aItemsList, bool aCleanVias, bool aRemoveMisConnected, bool aMergeSegments, bool aDeleteUnconnected, bool aDeleteTracksinPad, bool aDeleteDanglingVias, REPORTER *aReporter=nullptr)
the cleanup function.
bool testTrackEndpointIsNode(PCB_TRACK *aTrack, bool aTstStart)
bool mergeCollinearSegments(PCB_TRACK *aSeg1, PCB_TRACK *aSeg2)
helper function merge aTrackRef and aCandidate, when possible, i.e.
bool deleteDanglingTracks(bool aTrack, bool aVia)
Removes tracks or vias only connected on one end.
std::map< PCB_TRACK *, std::vector< BOARD_CONNECTED_ITEM * > > m_connectedItemsCache
std::vector< std::shared_ptr< CLEANUP_ITEM > > * m_itemsList
TRACKS_CLEANER(BOARD *aPcb, BOARD_COMMIT &aCommit)
void removeShortingTrackSegments()
@ CLEANUP_ZERO_LENGTH_TRACK
#define SKIP_STRUCT
flag indicating that the structure should be ignored
@ PCB_VIA_T
class PCB_VIA, a via (like a track segment on a copper layer)
@ PCB_ZONE_T
class ZONE, a copper pour area
@ PCB_PAD_T
class PAD, a pad in a footprint
@ PCB_ARC_T
class PCB_ARC, an arc track segment on a copper layer
@ PCB_TRACE_T
class PCB_TRACK, a track segment (segment on a copper layer)