summaryrefslogtreecommitdiff
path: root/pcbnew/tools/edit_points.cpp
diff options
context:
space:
mode:
authorsaurabhb172020-02-26 15:57:49 +0530
committersaurabhb172020-02-26 15:57:49 +0530
commitaa35045840b78d3f48212db45da59a2e5c69b223 (patch)
tree6acee185a4dc19113fcbf0f9a3d6941085dedaf7 /pcbnew/tools/edit_points.cpp
parent0db48f6533517ecebfd9f0693f89deca28408b76 (diff)
downloadKiCad-eSim-aa35045840b78d3f48212db45da59a2e5c69b223.tar.gz
KiCad-eSim-aa35045840b78d3f48212db45da59a2e5c69b223.tar.bz2
KiCad-eSim-aa35045840b78d3f48212db45da59a2e5c69b223.zip
Added main execs
Diffstat (limited to 'pcbnew/tools/edit_points.cpp')
-rw-r--r--pcbnew/tools/edit_points.cpp227
1 files changed, 227 insertions, 0 deletions
diff --git a/pcbnew/tools/edit_points.cpp b/pcbnew/tools/edit_points.cpp
new file mode 100644
index 0000000..cbd2a77
--- /dev/null
+++ b/pcbnew/tools/edit_points.cpp
@@ -0,0 +1,227 @@
+/*
+ * 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 <boost/foreach.hpp>
+
+#include <gal/graphics_abstraction_layer.h>
+#include "edit_points.h"
+
+bool EDIT_POINT::WithinPoint( const VECTOR2I& aPoint, unsigned int aSize ) const
+{
+ // Corners of the EDIT_POINT square
+ VECTOR2I topLeft = GetPosition() - aSize;
+ VECTOR2I bottomRight = GetPosition() + aSize;
+
+ return ( aPoint.x > topLeft.x && aPoint.y > topLeft.y &&
+ aPoint.x < bottomRight.x && aPoint.y < bottomRight.y );
+}
+
+
+EDIT_POINTS::EDIT_POINTS( EDA_ITEM* aParent ) :
+ EDA_ITEM( NOT_USED ), m_parent( aParent )
+{
+}
+
+
+EDIT_POINT* EDIT_POINTS::FindPoint( const VECTOR2I& aLocation )
+{
+ float size = m_view->ToWorld( EDIT_POINT::POINT_SIZE );
+
+ std::deque<EDIT_POINT>::iterator pit, pitEnd;
+ for( pit = m_points.begin(), pitEnd = m_points.end(); pit != pitEnd; ++pit )
+ {
+ EDIT_POINT& point = *pit;
+
+ if( point.WithinPoint( aLocation, size ) )
+ return &point;
+ }
+
+ std::deque<EDIT_LINE>::iterator lit, litEnd;
+ for( lit = m_lines.begin(), litEnd = m_lines.end(); lit != litEnd; ++lit )
+ {
+ EDIT_LINE& line = *lit;
+
+ if( line.WithinPoint( aLocation, size ) )
+ return &line;
+ }
+
+ return NULL;
+}
+
+
+int EDIT_POINTS::GetContourStartIdx( int aPointIdx ) const
+{
+ int lastIdx = 0;
+
+ BOOST_FOREACH( int idx, m_contours )
+ {
+ if( idx >= aPointIdx )
+ return lastIdx;
+
+ lastIdx = idx + 1;
+ }
+
+ return lastIdx;
+}
+
+
+int EDIT_POINTS::GetContourEndIdx( int aPointIdx ) const
+{
+ BOOST_FOREACH( int idx, m_contours )
+ {
+ if( idx >= aPointIdx )
+ return idx;
+ }
+
+ return m_points.size() - 1;
+}
+
+
+bool EDIT_POINTS::IsContourStart( int aPointIdx ) const
+{
+ BOOST_FOREACH( int idx, m_contours )
+ {
+ if( idx + 1 == aPointIdx )
+ return true;
+
+ // the list is sorted, so we cannot expect it any further
+ if( idx > aPointIdx )
+ break;
+ }
+
+ return ( aPointIdx == 0 );
+}
+
+
+bool EDIT_POINTS::IsContourEnd( int aPointIdx ) const
+{
+ BOOST_FOREACH( int idx, m_contours )
+ {
+ if( idx == aPointIdx )
+ return true;
+
+ // the list is sorted, so we cannot expect it any further
+ if( idx > aPointIdx )
+ break;
+ }
+
+ // the end of the list surely is the end of a contour
+ return ( aPointIdx == (int) m_points.size() - 1 );
+}
+
+
+EDIT_POINT* EDIT_POINTS::Previous( const EDIT_POINT& aPoint, bool aTraverseContours )
+{
+ for( unsigned int i = 0; i < m_points.size(); ++i )
+ {
+ if( m_points[i] == aPoint )
+ {
+ if( !aTraverseContours && IsContourStart( i ) )
+ return &m_points[GetContourEndIdx( i )];
+
+ if( i == 0 )
+ return &m_points[m_points.size() - 1];
+ else
+ return &m_points[i - 1];
+ }
+ }
+
+ return NULL;
+}
+
+
+EDIT_LINE* EDIT_POINTS::Previous( const EDIT_LINE& aLine )
+{
+ for( unsigned int i = 0; i < m_lines.size(); ++i )
+ {
+ if( m_lines[i] == aLine )
+ {
+ if( i == 0 )
+ return &m_lines[m_lines.size() - 1];
+ else
+ return &m_lines[i - 1];
+ }
+ }
+
+ return NULL;
+}
+
+
+EDIT_POINT* EDIT_POINTS::Next( const EDIT_POINT& aPoint, bool aTraverseContours )
+{
+ for( unsigned int i = 0; i < m_points.size(); ++i )
+ {
+ if( m_points[i] == aPoint )
+ {
+ if( !aTraverseContours && IsContourEnd( i ) )
+ return &m_points[GetContourStartIdx( i )];
+
+ if( i == m_points.size() - 1 )
+ return &m_points[0];
+ else
+ return &m_points[i + 1];
+ }
+ }
+
+ return NULL;
+}
+
+
+EDIT_LINE* EDIT_POINTS::Next( const EDIT_LINE& aLine )
+{
+ for( unsigned int i = 0; i < m_lines.size(); ++i )
+ {
+ if( m_lines[i] == aLine )
+ {
+ if( i == m_lines.size() - 1 )
+ return &m_lines[0];
+ else
+ return &m_lines[i + 1];
+ }
+ }
+
+ return NULL;
+}
+
+
+void EDIT_POINTS::ViewDraw( int aLayer, KIGFX::GAL* aGal ) const
+{
+ aGal->SetFillColor( KIGFX::COLOR4D( 1.0, 1.0, 1.0, 1.0 ) );
+ aGal->SetIsFill( true );
+ aGal->SetIsStroke( false );
+ aGal->PushDepth();
+ aGal->SetLayerDepth( aGal->GetMinDepth() );
+
+ float size = m_view->ToWorld( EDIT_POINT::POINT_SIZE );
+
+ BOOST_FOREACH( const EDIT_POINT& point, m_points )
+ aGal->DrawRectangle( point.GetPosition() - size / 2, point.GetPosition() + size / 2 );
+
+ BOOST_FOREACH( const EDIT_LINE& line, m_lines )
+ {
+ aGal->DrawCircle( line.GetPosition(), size / 2 );
+ }
+
+ aGal->PopDepth();
+}