2014-07-09 13:10:32 +00:00
|
|
|
/*
|
|
|
|
* This program source code file is part of KiCad, a free EDA CAD application.
|
|
|
|
*
|
|
|
|
* Copyright (C) 2014 CERN
|
|
|
|
* @author Maciej Suminski <maciej.suminski@cern.ch>
|
|
|
|
*
|
|
|
|
* 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 2
|
|
|
|
* of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, you may find one here:
|
|
|
|
* http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
|
|
|
|
* or you may search the http://www.gnu.org website for the version 2 license,
|
|
|
|
* or you may write to the Free Software Foundation, Inc.,
|
|
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "selection_conditions.h"
|
|
|
|
#include "selection_tool.h"
|
2015-06-19 15:32:33 +00:00
|
|
|
#include <class_board_connected_item.h>
|
2014-07-09 13:10:32 +00:00
|
|
|
|
|
|
|
#include <boost/bind.hpp>
|
|
|
|
|
|
|
|
|
|
|
|
bool SELECTION_CONDITIONS::NotEmpty( const SELECTION& aSelection )
|
|
|
|
{
|
|
|
|
return !aSelection.Empty();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-03-10 08:36:04 +00:00
|
|
|
bool SELECTION_CONDITIONS::OnlyConnectedItems( const SELECTION& aSelection )
|
|
|
|
{
|
|
|
|
if( aSelection.Empty() )
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for( int i = 0; i < aSelection.Size(); ++i )
|
|
|
|
{
|
|
|
|
KICAD_T type = aSelection.Item<EDA_ITEM>( i )->Type();
|
|
|
|
|
|
|
|
if( type != PCB_PAD_T && type != PCB_VIA_T && type != PCB_TRACE_T && type != PCB_ZONE_T )
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-07-15 12:08:50 +00:00
|
|
|
SELECTION_CONDITION SELECTION_CONDITIONS::SameNet( bool aAllowUnconnected )
|
2015-06-19 15:32:33 +00:00
|
|
|
{
|
2015-07-15 12:08:50 +00:00
|
|
|
return boost::bind( &SELECTION_CONDITIONS::sameNetFunc, _1, aAllowUnconnected );
|
2015-06-19 15:32:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
SELECTION_CONDITION SELECTION_CONDITIONS::SameLayer()
|
|
|
|
{
|
|
|
|
return boost::bind( &SELECTION_CONDITIONS::sameLayerFunc, _1 );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-07-09 13:10:32 +00:00
|
|
|
SELECTION_CONDITION SELECTION_CONDITIONS::HasType( KICAD_T aType )
|
|
|
|
{
|
|
|
|
return boost::bind( &SELECTION_CONDITIONS::hasTypeFunc, _1, aType );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
SELECTION_CONDITION SELECTION_CONDITIONS::OnlyType( KICAD_T aType )
|
|
|
|
{
|
|
|
|
return boost::bind( &SELECTION_CONDITIONS::onlyTypeFunc, _1, aType );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-07-09 11:35:49 +00:00
|
|
|
SELECTION_CONDITION SELECTION_CONDITIONS::OnlyTypes( const std::vector<KICAD_T>& aTypes )
|
|
|
|
{
|
|
|
|
return boost::bind( &SELECTION_CONDITIONS::onlyTypesFunc, _1, aTypes );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-05-04 16:35:20 +00:00
|
|
|
SELECTION_CONDITION SELECTION_CONDITIONS::OnlyTypes( const KICAD_T aTypes[] )
|
|
|
|
{
|
|
|
|
return boost::bind( &SELECTION_CONDITIONS::onlyTypesFuncArr, _1, aTypes );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-07-09 13:10:32 +00:00
|
|
|
SELECTION_CONDITION SELECTION_CONDITIONS::Count( int aNumber )
|
|
|
|
{
|
|
|
|
return boost::bind( &SELECTION_CONDITIONS::countFunc, _1, aNumber );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
SELECTION_CONDITION SELECTION_CONDITIONS::MoreThan( int aNumber )
|
|
|
|
{
|
|
|
|
return boost::bind( &SELECTION_CONDITIONS::moreThanFunc, _1, aNumber );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
SELECTION_CONDITION SELECTION_CONDITIONS::LessThan( int aNumber )
|
|
|
|
{
|
|
|
|
return boost::bind( &SELECTION_CONDITIONS::lessThanFunc, _1, aNumber );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-07-15 12:08:50 +00:00
|
|
|
bool SELECTION_CONDITIONS::sameNetFunc( const SELECTION& aSelection, bool aAllowUnconnected )
|
2015-06-19 15:32:33 +00:00
|
|
|
{
|
|
|
|
if( aSelection.Empty() )
|
|
|
|
return false;
|
|
|
|
|
2015-07-15 12:08:50 +00:00
|
|
|
int netcode = -1; // -1 stands for 'net code is not yet determined'
|
2015-06-19 15:32:33 +00:00
|
|
|
|
|
|
|
for( int i = 0; i < aSelection.Size(); ++i )
|
|
|
|
{
|
2015-07-15 12:08:50 +00:00
|
|
|
int current_netcode = -1;
|
|
|
|
|
2015-06-19 15:32:33 +00:00
|
|
|
const BOARD_CONNECTED_ITEM* item =
|
|
|
|
dynamic_cast<const BOARD_CONNECTED_ITEM*>( aSelection.Item<EDA_ITEM>( i ) );
|
|
|
|
|
2015-07-15 12:08:50 +00:00
|
|
|
if( item )
|
|
|
|
{
|
|
|
|
current_netcode = item->GetNetCode();
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if( !aAllowUnconnected )
|
|
|
|
return false;
|
|
|
|
else
|
|
|
|
// if it is not a BOARD_CONNECTED_ITEM, treat it as if there was no net assigned
|
|
|
|
current_netcode = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
assert( current_netcode >= 0 );
|
2015-06-19 15:32:33 +00:00
|
|
|
|
|
|
|
if( netcode < 0 )
|
|
|
|
{
|
2015-07-15 12:08:50 +00:00
|
|
|
netcode = current_netcode;
|
2015-06-19 15:32:33 +00:00
|
|
|
|
2015-07-15 12:08:50 +00:00
|
|
|
if( netcode == NETINFO_LIST::UNCONNECTED && !aAllowUnconnected )
|
2015-06-19 15:32:33 +00:00
|
|
|
return false;
|
|
|
|
}
|
2015-07-30 11:49:35 +00:00
|
|
|
else if( netcode != current_netcode )
|
2015-06-19 15:32:33 +00:00
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool SELECTION_CONDITIONS::sameLayerFunc( const SELECTION& aSelection )
|
|
|
|
{
|
|
|
|
if( aSelection.Empty() )
|
|
|
|
return false;
|
|
|
|
|
|
|
|
LSET layerSet;
|
|
|
|
layerSet.set();
|
|
|
|
|
|
|
|
for( int i = 0; i < aSelection.Size(); ++i )
|
|
|
|
{
|
|
|
|
const BOARD_ITEM* item = dynamic_cast<const BOARD_ITEM*>( aSelection.Item<EDA_ITEM>( i ) );
|
|
|
|
|
|
|
|
if( !item )
|
|
|
|
return false;
|
|
|
|
|
|
|
|
layerSet &= item->GetLayerSet();
|
|
|
|
|
|
|
|
if( !layerSet.any() ) // there are no common layers left
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-07-09 13:10:32 +00:00
|
|
|
bool SELECTION_CONDITIONS::hasTypeFunc( const SELECTION& aSelection, KICAD_T aType )
|
|
|
|
{
|
|
|
|
for( int i = 0; i < aSelection.Size(); ++i )
|
|
|
|
{
|
|
|
|
if( aSelection.Item<EDA_ITEM>( i )->Type() == aType )
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool SELECTION_CONDITIONS::onlyTypeFunc( const SELECTION& aSelection, KICAD_T aType )
|
|
|
|
{
|
2014-07-09 14:50:31 +00:00
|
|
|
if( aSelection.Empty() )
|
|
|
|
return false;
|
|
|
|
|
2014-07-09 13:10:32 +00:00
|
|
|
for( int i = 0; i < aSelection.Size(); ++i )
|
|
|
|
{
|
|
|
|
if( aSelection.Item<EDA_ITEM>( i )->Type() != aType )
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-07-09 11:35:49 +00:00
|
|
|
bool SELECTION_CONDITIONS::onlyTypesFunc( const SELECTION& aSelection, const std::vector<KICAD_T>& aTypes )
|
|
|
|
{
|
|
|
|
if( aSelection.Empty() )
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for( int i = 0; i < aSelection.Size(); ++i )
|
|
|
|
{
|
|
|
|
bool valid = false;
|
|
|
|
|
|
|
|
for( std::vector<KICAD_T>::const_iterator it = aTypes.begin(); it != aTypes.end(); ++it )
|
|
|
|
{
|
|
|
|
if( aSelection.Item<EDA_ITEM>( i )->Type() == *it )
|
|
|
|
{
|
|
|
|
valid = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if( !valid )
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-05-04 16:35:20 +00:00
|
|
|
bool SELECTION_CONDITIONS::onlyTypesFuncArr( const SELECTION& aSelection, const KICAD_T aTypes[] )
|
|
|
|
{
|
|
|
|
if( aSelection.Empty() )
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for( int i = 0; i < aSelection.Size(); ++i )
|
|
|
|
{
|
|
|
|
bool valid = false;
|
|
|
|
const KICAD_T* type = aTypes;
|
|
|
|
|
|
|
|
while( *type != EOT )
|
|
|
|
{
|
|
|
|
if( aSelection.Item<EDA_ITEM>( i )->Type() == *type )
|
|
|
|
{
|
|
|
|
valid = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
++type;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( !valid )
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-07-09 13:10:32 +00:00
|
|
|
bool SELECTION_CONDITIONS::countFunc( const SELECTION& aSelection, int aNumber )
|
|
|
|
{
|
|
|
|
return aSelection.Size() == aNumber;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool SELECTION_CONDITIONS::moreThanFunc( const SELECTION& aSelection, int aNumber )
|
|
|
|
{
|
|
|
|
return aSelection.Size() > aNumber;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool SELECTION_CONDITIONS::lessThanFunc( const SELECTION& aSelection, int aNumber )
|
|
|
|
{
|
2015-06-05 15:48:59 +00:00
|
|
|
return aSelection.Size() < aNumber;
|
2014-07-09 13:10:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
SELECTION_CONDITION operator||( const SELECTION_CONDITION& aConditionA,
|
|
|
|
const SELECTION_CONDITION& aConditionB )
|
|
|
|
{
|
|
|
|
return boost::bind( &SELECTION_CONDITIONS::orFunc, aConditionA, aConditionB, _1 );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
SELECTION_CONDITION operator&&( const SELECTION_CONDITION& aConditionA,
|
|
|
|
const SELECTION_CONDITION& aConditionB )
|
|
|
|
{
|
|
|
|
return boost::bind( &SELECTION_CONDITIONS::andFunc, aConditionA, aConditionB, _1 );
|
|
|
|
}
|