Naming conventions.

This commit is contained in:
Jeff Young 2020-11-01 14:03:13 +00:00
parent f600450ee6
commit c351b3c31f
8 changed files with 12 additions and 12 deletions

View File

@ -84,7 +84,7 @@ public:
* Function Insert()
* Inserts an item into the tree.
*/
void insert( BOARD_ITEM* aItem, int aWorstClearance = 0, int aLayer = UNDEFINED_LAYER )
void Insert( BOARD_ITEM* aItem, int aWorstClearance = 0, int aLayer = UNDEFINED_LAYER )
{
std::vector<SHAPE*> subshapes;

View File

@ -164,7 +164,7 @@ bool DRC_TEST_PROVIDER_COPPER_CLEARANCE::Run()
if( item->Type() == PCB_FP_TEXT_T && !static_cast<FP_TEXT*>( item )->IsVisible() )
return true;
m_copperTree.insert( item, m_largestClearance );
m_copperTree.Insert( item, m_largestClearance );
return true;
};
@ -198,7 +198,7 @@ bool DRC_TEST_PROVIDER_COPPER_CLEARANCE::Run()
for( int layer : zone->GetLayerSet().Seq() )
{
if( IsCopperLayer( layer ) )
m_zoneTrees[ zone ]->insert( zone, layer );
m_zoneTrees[ zone ]->Insert( zone, layer );
}
}

View File

@ -317,7 +317,7 @@ bool test::DRC_TEST_PROVIDER_DIFF_PAIR_COUPLING::Run()
auto addToTree =
[&copperTree]( BOARD_ITEM *item ) -> bool
{
copperTree.insert( item );
copperTree.Insert( item );
return true;
};

View File

@ -195,7 +195,7 @@ bool DRC_TEST_PROVIDER_EDGE_CLEARANCE::Run()
forEachGeometryItem( s_allBasicItemsButZones, LSET::AllCuMask(), queryBoardGeometryItems );
for( const std::unique_ptr<PCB_SHAPE>& edge : edges )
edgesTree.insert( edge.get(), m_largestClearance );
edgesTree.Insert( edge.get(), m_largestClearance );
wxString val;
wxGetEnv( "WXTRACE", &val );

View File

@ -144,7 +144,7 @@ bool DRC_TEST_PROVIDER_HOLE_CLEARANCE::Run()
// Check for round hole
if( pad->GetDrillSize().x && pad->GetDrillSize().x == pad->GetDrillSize().y )
m_holeTree.insert( item, m_largestClearance, F_Cu );
m_holeTree.Insert( item, m_largestClearance, F_Cu );
}
else if( item->Type() == PCB_VIA_T )
{
@ -152,7 +152,7 @@ bool DRC_TEST_PROVIDER_HOLE_CLEARANCE::Run()
// Check for drilled hole
if( via->GetViaType() == VIATYPE::THROUGH )
m_holeTree.insert( item, m_largestClearance, F_Cu );
m_holeTree.Insert( item, m_largestClearance, F_Cu );
}
return true;

View File

@ -116,7 +116,7 @@ bool DRC_TEST_PROVIDER_SILK_CLEARANCE::Run()
auto addToSilkTree =
[&silkTree]( BOARD_ITEM* item ) -> bool
{
silkTree.insert( item );
silkTree.Insert( item );
return true;
};
@ -133,7 +133,7 @@ bool DRC_TEST_PROVIDER_SILK_CLEARANCE::Run()
if( !reportProgress( ii++, targets, delta ) )
return false;
targetTree.insert( item );
targetTree.Insert( item );
return true;
};

View File

@ -108,14 +108,14 @@ bool DRC_TEST_PROVIDER_SILK_TO_MASK::Run()
auto addMaskToTree =
[&maskTree]( BOARD_ITEM *item ) -> bool
{
maskTree.insert( item );
maskTree.Insert( item );
return true;
};
auto addSilkToTree =
[&silkTree]( BOARD_ITEM *item ) -> bool
{
silkTree.insert( item );
silkTree.Insert( item );
return true;
};

View File

@ -263,7 +263,7 @@ void TRACKS_CLEANER::cleanup( bool aDeleteDuplicateVias, bool aDeleteNullSegment
for( TRACK* track : m_brd->Tracks() )
{
track->ClearFlags( IS_DELETED | SKIP_STRUCT );
rtree.insert( track );
rtree.Insert( track );
}
std::set<BOARD_ITEM*> toRemove;