haskal
/
kicad
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Use kicad_algo when possible

This commit is contained in:
Seth Hillbrand 2023-09-20 10:32:31 -07:00
parent 2f475d99dd
commit 16324facaf
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
eeschema/connection_graph.cpp
View File

@ -25,6 +25,7 @@
#include <vector> #include <vector>
#include <unordered_map> #include <unordered_map>
#include <core/profile.h> #include <core/profile.h>
#include <core/kicad_algo.h>
#include <common.h> #include <common.h>
#include <core/kicad_algo.h> #include <core/kicad_algo.h>
#include <erc.h> #include <erc.h>
@ -974,8 +975,7 @@ void CONNECTION_GRAPH::updateItemConnectivity( const SCH_SHEET_PATH& aSheet,
{ {
std::vector<SCH_ITEM*> connection_vec = it.second; std::vector<SCH_ITEM*> connection_vec = it.second;
std::sort( connection_vec.begin(), connection_vec.end() ); std::sort( connection_vec.begin(), connection_vec.end() );
connection_vec.erase( std::unique( connection_vec.begin(), connection_vec.end() ), alg::remove_duplicates( connection_vec );
connection_vec.end() );
// Pre-scan to see if we have a bus at this location // Pre-scan to see if we have a bus at this location
SCH_LINE* busLine = aSheet.LastScreen()->GetBus( it.first ); SCH_LINE* busLine = aSheet.LastScreen()->GetBus( it.first );