/* * This program source code file is part of KICAD, a free EDA CAD application. * * Copyright (C) 2013 CERN * @author Maciej Suminski * * 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 */ /** * @file ratsnest_viewitem.cpp * @brief Class that draws missing connections on a PCB. */ #include #include #include #include #include #include namespace KIGFX { RATSNEST_VIEWITEM::RATSNEST_VIEWITEM( RN_DATA* aData ) : EDA_ITEM( NOT_USED ), m_data( aData ) { } const BOX2I RATSNEST_VIEWITEM::ViewBBox() const { // Make it always visible BOX2I bbox; bbox.SetMaximum(); return bbox; } void RATSNEST_VIEWITEM::ViewDraw( int aLayer, KIGFX::VIEW* aView ) const { auto gal = aView->GetGAL(); gal->SetIsStroke( true ); gal->SetIsFill( false ); gal->SetLineWidth( 1.0 ); auto rs = aView->GetPainter()->GetSettings(); auto color = rs->GetColor( NULL, LAYER_RATSNEST ); int highlightedNet = rs->GetHighlightNetCode(); // Dynamic ratsnest (for e.g. dragged items) for( int i = 1; i < m_data->GetNetCount(); ++i ) { RN_NET& net = m_data->GetNet( i ); if( !net.IsVisible() ) continue; // Set brighter color for the temporary ratsnest gal->SetStrokeColor( color.Brightened( 0.8 ) ); // Draw the "dynamic" ratsnest (i.e. for objects that may be currently being moved) for( const RN_NODE_PTR& node : net.GetSimpleNodes() ) { // Skipping nodes with higher reference count avoids displaying redundant lines if( node->GetRefCount() > 1 ) continue; RN_NODE_PTR dest = net.GetClosestNode( node, LINE_TARGET() ); if( dest ) { VECTOR2D origin( node->GetX(), node->GetY() ); VECTOR2D end( dest->GetX(), dest->GetY() ); gal->DrawLine( origin, end ); } } // Draw the "static" ratsnest if( i != highlightedNet ) gal->SetStrokeColor( color ); // using the default ratsnest color for not highlighted const std::vector* edges = net.GetUnconnected(); if( edges == NULL ) continue; for( const RN_EDGE_MST_PTR& edge : *edges ) { const RN_NODE_PTR& sourceNode = edge->GetSourceNode(); const RN_NODE_PTR& targetNode = edge->GetTargetNode(); VECTOR2D source( sourceNode->GetX(), sourceNode->GetY() ); VECTOR2D target( targetNode->GetX(), targetNode->GetY() ); gal->DrawLine( source, target ); } } } void RATSNEST_VIEWITEM::ViewGetLayers( int aLayers[], int& aCount ) const { aCount = 1; aLayers[0] = LAYER_RATSNEST; } }