kicad/pcbnew/router/pns_itemset.cpp

141 lines
2.7 KiB
C++
Raw Normal View History

/*
* KiRouter - a push-and-(sometimes-)shove PCB router
*
* Copyright (C) 2013-2014 CERN
* Copyright (C) 2016 KiCad Developers, see AUTHORS.txt for contributors.
* Author: Tomasz Wlostowski <tomasz.wlostowski@cern.ch>
2013-09-26 21:53:54 +00:00
*
* This program is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation, either version 3 of the License, or (at your
* option) any later version.
2013-09-26 21:53:54 +00:00
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
2013-09-26 21:53:54 +00:00
*
* You should have received a copy of the GNU General Public License along
* with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "pns_itemset.h"
#include "pns_line.h"
namespace PNS {
ITEM_SET::~ITEM_SET()
{
}
void ITEM_SET::Add( const LINE& aLine )
{
LINE* copy = aLine.Clone();
m_items.push_back( ENTRY( copy, true ) );
}
void ITEM_SET::Prepend( const LINE& aLine )
{
LINE* copy = aLine.Clone();
m_items.insert( m_items.begin(), ENTRY( copy, true ) );
}
2015-02-18 16:53:46 +00:00
ITEM_SET& ITEM_SET::FilterLayers( int aStart, int aEnd, bool aInvert )
{
ENTRIES newItems;
LAYER_RANGE l;
2013-09-26 21:53:54 +00:00
if( aEnd < 0 )
l = LAYER_RANGE( aStart );
2013-09-26 21:53:54 +00:00
else
l = LAYER_RANGE( aStart, aEnd );
2013-09-26 21:53:54 +00:00
for( const ENTRY& ent : m_items )
2015-08-12 19:12:13 +00:00
{
if( ent.item->Layers().Overlaps( l ) ^ aInvert )
{
newItems.push_back( ent );
}
2015-08-12 19:12:13 +00:00
}
2013-09-26 21:53:54 +00:00
m_items = newItems;
2013-09-26 21:53:54 +00:00
return *this;
}
2013-09-26 21:53:54 +00:00
ITEM_SET& ITEM_SET::FilterKinds( int aKindMask, bool aInvert )
{
ENTRIES newItems;
2013-09-26 21:53:54 +00:00
for( const ENTRY& ent : m_items )
{
if( ent.item->OfKind( aKindMask ) ^ aInvert )
2015-08-12 19:12:13 +00:00
{
newItems.push_back( ent );
2015-08-12 19:12:13 +00:00
}
}
2013-09-26 21:53:54 +00:00
m_items = newItems;
2013-09-26 21:53:54 +00:00
return *this;
}
2015-02-18 16:53:46 +00:00
ITEM_SET& ITEM_SET::FilterMarker( int aMarker, bool aInvert )
{
ENTRIES newItems;
for( const ENTRY& ent : m_items )
{
if( ent.item->Marker() & aMarker )
2015-08-12 19:12:13 +00:00
{
newItems.push_back( ent );
2015-08-12 19:12:13 +00:00
}
}
m_items = newItems;
return *this;
}
2013-09-26 21:53:54 +00:00
ITEM_SET& ITEM_SET::FilterNet( int aNet, bool aInvert )
{
ENTRIES newItems;
for( const ENTRY& ent : m_items )
{
if( ( ent.item->Net() == aNet ) ^ aInvert )
2015-08-12 19:12:13 +00:00
{
newItems.push_back( ent );
2015-08-12 19:12:13 +00:00
}
}
m_items = newItems;
return *this;
}
2015-02-18 16:53:46 +00:00
ITEM_SET& ITEM_SET::ExcludeItem( const ITEM* aItem )
{
ENTRIES newItems;
2013-09-26 21:53:54 +00:00
for( const ENTRY& ent : m_items )
{
if( ent.item != aItem )
2015-08-12 19:12:13 +00:00
newItems.push_back( ent );
}
2013-09-26 21:53:54 +00:00
m_items = newItems;
2013-09-26 21:53:54 +00:00
return *this;
}
}