2012-01-14 19:50:32 +00:00
|
|
|
/*
|
|
|
|
* This program source code file is part of KiCad, a free EDA CAD application.
|
|
|
|
*
|
2018-07-22 12:50:35 +00:00
|
|
|
* Copyright (C) 2018 Jean-Pierre Charras jp.charras at wanadoo.fr
|
|
|
|
* Copyright (C) 1992-2018 KiCad Developers, see AUTHORS.txt for contributors.
|
2012-01-14 19:50:32 +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 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
|
|
|
|
*/
|
|
|
|
|
2011-09-23 13:57:12 +00:00
|
|
|
/**
|
|
|
|
* @file class_drawsegment.h
|
|
|
|
* @brief Class to handle a graphic segment.
|
|
|
|
*/
|
2008-01-16 18:48:04 +00:00
|
|
|
|
2011-11-29 03:08:14 +00:00
|
|
|
#ifndef CLASS_DRAWSEGMENT_H_
|
|
|
|
#define CLASS_DRAWSEGMENT_H_
|
2011-08-01 15:29:27 +00:00
|
|
|
|
2012-01-23 04:33:36 +00:00
|
|
|
#include <class_board_item.h>
|
2019-05-14 12:39:34 +00:00
|
|
|
#include <common.h>
|
|
|
|
#include <convert_to_biu.h>
|
2013-05-01 17:32:36 +00:00
|
|
|
#include <math_for_graphics.h>
|
|
|
|
#include <trigo.h>
|
2011-09-23 13:57:12 +00:00
|
|
|
|
2017-10-19 21:16:06 +00:00
|
|
|
#include <geometry/shape_poly_set.h>
|
2011-09-23 13:57:12 +00:00
|
|
|
|
|
|
|
class LINE_READER;
|
|
|
|
class EDA_DRAW_FRAME;
|
|
|
|
class MODULE;
|
2013-01-12 17:32:24 +00:00
|
|
|
class MSG_PANEL_ITEM;
|
2008-01-16 18:48:04 +00:00
|
|
|
|
2011-08-01 15:29:27 +00:00
|
|
|
|
2008-01-16 18:48:04 +00:00
|
|
|
class DRAWSEGMENT : public BOARD_ITEM
|
|
|
|
{
|
2011-12-14 04:29:25 +00:00
|
|
|
protected:
|
2012-05-22 17:51:18 +00:00
|
|
|
int m_Width; ///< thickness of lines ...
|
|
|
|
wxPoint m_Start; ///< Line start point or Circle and Arc center
|
|
|
|
wxPoint m_End; ///< Line end point or circle and arc start point
|
2008-01-16 18:48:04 +00:00
|
|
|
|
2012-05-22 17:51:18 +00:00
|
|
|
STROKE_T m_Shape; ///< Shape: line, Circle, Arc
|
|
|
|
int m_Type; ///< Used in complex associations ( Dimensions.. )
|
|
|
|
double m_Angle; ///< Used only for Arcs: Arc angle in 1/10 deg
|
|
|
|
wxPoint m_BezierC1; ///< Bezier Control Point 1
|
|
|
|
wxPoint m_BezierC2; ///< Bezier Control Point 2
|
2008-01-16 18:48:04 +00:00
|
|
|
|
2017-11-16 08:38:26 +00:00
|
|
|
std::vector<wxPoint> m_BezierPoints;
|
|
|
|
SHAPE_POLY_SET m_Poly; ///< Stores the S_POLYGON shape
|
2011-08-08 23:50:55 +00:00
|
|
|
|
2015-09-03 21:05:01 +00:00
|
|
|
// Computes the bounding box for an arc
|
|
|
|
void computeArcBBox( EDA_RECT& aBBox ) const;
|
|
|
|
|
2008-01-16 18:48:04 +00:00
|
|
|
public:
|
2011-12-14 04:29:25 +00:00
|
|
|
DRAWSEGMENT( BOARD_ITEM* aParent = NULL, KICAD_T idtype = PCB_LINE_T );
|
2012-01-14 19:50:32 +00:00
|
|
|
|
2016-05-30 08:44:48 +00:00
|
|
|
// Do not create a copy constructor & operator=.
|
|
|
|
// The ones generated by the compiler are adequate.
|
2012-01-14 19:50:32 +00:00
|
|
|
|
2008-01-16 18:48:04 +00:00
|
|
|
~DRAWSEGMENT();
|
|
|
|
|
2015-02-18 16:53:46 +00:00
|
|
|
static inline bool ClassOf( const EDA_ITEM* aItem )
|
2015-02-17 23:53:57 +00:00
|
|
|
{
|
|
|
|
return aItem && PCB_LINE_T == aItem->Type();
|
|
|
|
}
|
|
|
|
|
2018-12-05 08:57:59 +00:00
|
|
|
/** Polygonal shape is not always filled.
|
|
|
|
* For now it is filled on all layers but Edge_Cut layer
|
|
|
|
*/
|
|
|
|
bool IsPolygonFilled() const { return m_Layer != Edge_Cuts; }
|
|
|
|
|
2011-12-14 04:29:25 +00:00
|
|
|
void SetWidth( int aWidth ) { m_Width = aWidth; }
|
|
|
|
int GetWidth() const { return m_Width; }
|
2011-11-29 03:08:14 +00:00
|
|
|
|
2011-12-02 21:56:47 +00:00
|
|
|
/**
|
|
|
|
* Function SetAngle
|
|
|
|
* sets the angle for arcs, and normalizes it within the range 0 - 360 degrees.
|
|
|
|
* @param aAngle is tenths of degrees, but will soon be degrees.
|
|
|
|
*/
|
|
|
|
void SetAngle( double aAngle ); // encapsulates the transition to degrees
|
2011-12-12 08:37:05 +00:00
|
|
|
double GetAngle() const { return m_Angle; }
|
2011-11-29 03:08:14 +00:00
|
|
|
|
2012-05-22 17:51:18 +00:00
|
|
|
void SetType( int aType ) { m_Type = aType; }
|
|
|
|
int GetType() const { return m_Type; }
|
2011-11-29 03:08:14 +00:00
|
|
|
|
2012-05-22 17:51:18 +00:00
|
|
|
void SetShape( STROKE_T aShape ) { m_Shape = aShape; }
|
|
|
|
STROKE_T GetShape() const { return m_Shape; }
|
2011-11-29 03:08:14 +00:00
|
|
|
|
2011-12-14 04:29:25 +00:00
|
|
|
void SetBezControl1( const wxPoint& aPoint ) { m_BezierC1 = aPoint; }
|
|
|
|
const wxPoint& GetBezControl1() const { return m_BezierC1; }
|
2011-11-29 03:08:14 +00:00
|
|
|
|
2011-12-14 04:29:25 +00:00
|
|
|
void SetBezControl2( const wxPoint& aPoint ) { m_BezierC2 = aPoint; }
|
|
|
|
const wxPoint& GetBezControl2() const { return m_BezierC2; }
|
2008-01-16 18:48:04 +00:00
|
|
|
|
2017-12-18 17:24:25 +00:00
|
|
|
void SetPosition( const wxPoint& aPos ) override;
|
|
|
|
const wxPoint GetPosition() const override;
|
2011-11-29 17:25:30 +00:00
|
|
|
|
2008-05-05 19:46:54 +00:00
|
|
|
/**
|
|
|
|
* Function GetStart
|
|
|
|
* returns the starting point of the graphic
|
|
|
|
*/
|
2011-12-14 04:29:25 +00:00
|
|
|
const wxPoint& GetStart() const { return m_Start; }
|
|
|
|
void SetStart( const wxPoint& aStart ) { m_Start = aStart; }
|
|
|
|
void SetStartY( int y ) { m_Start.y = y; }
|
|
|
|
void SetStartX( int x ) { m_Start.x = x; }
|
2008-05-05 19:46:54 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Function GetEnd
|
|
|
|
* returns the ending point of the graphic
|
|
|
|
*/
|
2011-12-14 04:29:25 +00:00
|
|
|
const wxPoint& GetEnd() const { return m_End; }
|
|
|
|
void SetEnd( const wxPoint& aEnd ) { m_End = aEnd; }
|
|
|
|
void SetEndY( int y ) { m_End.y = y; }
|
|
|
|
void SetEndX( int x ) { m_End.x = x; }
|
|
|
|
|
2013-12-19 11:33:57 +00:00
|
|
|
// Some attributes are read only, since they are "calculated" from
|
|
|
|
// m_Start, m_End, and m_Angle.
|
|
|
|
// No Set...() function for these attributes.
|
2011-12-14 04:29:25 +00:00
|
|
|
|
2016-09-24 18:53:15 +00:00
|
|
|
const wxPoint GetCenter() const override;
|
2011-12-14 04:29:25 +00:00
|
|
|
const wxPoint& GetArcStart() const { return m_End; }
|
|
|
|
const wxPoint GetArcEnd() const;
|
2018-12-08 15:26:47 +00:00
|
|
|
const wxPoint GetArcMid() const;
|
2008-05-05 19:46:54 +00:00
|
|
|
|
2012-07-05 09:29:42 +00:00
|
|
|
/**
|
|
|
|
* function GetArcAngleStart()
|
2014-02-07 18:51:04 +00:00
|
|
|
* @return the angle of the starting point of this arc, between 0 and 3600 in 0.1 deg
|
2012-07-05 09:29:42 +00:00
|
|
|
*/
|
2014-02-07 18:51:04 +00:00
|
|
|
double GetArcAngleStart() const;
|
2012-07-05 09:29:42 +00:00
|
|
|
|
2011-02-27 19:54:01 +00:00
|
|
|
/**
|
|
|
|
* Function GetRadius
|
|
|
|
* returns the radius of this item
|
|
|
|
* Has meaning only for arc and circle
|
|
|
|
*/
|
2011-12-14 04:29:25 +00:00
|
|
|
int GetRadius() const
|
2011-02-27 19:54:01 +00:00
|
|
|
{
|
2013-05-01 17:32:36 +00:00
|
|
|
double radius = GetLineLength( m_Start, m_End );
|
// Dick Hollenbeck's KiROUND R&D
// This provides better project control over rounding to int from double
// than wxRound() did. This scheme provides better logging in Debug builds
// and it provides for compile time calculation of constants.
#include <stdio.h>
#include <assert.h>
#include <limits.h>
//-----<KiROUND KIT>------------------------------------------------------------
/**
* KiROUND
* rounds a floating point number to an int using
* "round halfway cases away from zero".
* In Debug build an assert fires if will not fit into an int.
*/
#if defined( DEBUG )
// DEBUG: a macro to capture line and file, then calls this inline
static inline int KiRound( double v, int line, const char* filename )
{
v = v < 0 ? v - 0.5 : v + 0.5;
if( v > INT_MAX + 0.5 )
{
printf( "%s: in file %s on line %d, val: %.16g too ' > 0 ' for int\n", __FUNCTION__, filename, line, v );
}
else if( v < INT_MIN - 0.5 )
{
printf( "%s: in file %s on line %d, val: %.16g too ' < 0 ' for int\n", __FUNCTION__, filename, line, v );
}
return int( v );
}
#define KiROUND( v ) KiRound( v, __LINE__, __FILE__ )
#else
// RELEASE: a macro so compile can pre-compute constants.
#define KiROUND( v ) int( (v) < 0 ? (v) - 0.5 : (v) + 0.5 )
#endif
//-----</KiROUND KIT>-----------------------------------------------------------
// Only a macro is compile time calculated, an inline function causes a static constructor
// in a situation like this.
// Therefore the Release build is best done with a MACRO not an inline function.
int Computed = KiROUND( 14.3 * 8 );
int main( int argc, char** argv )
{
for( double d = double(INT_MAX)-1; d < double(INT_MAX)+8; d += 2.0 )
{
int i = KiROUND( d );
printf( "t: %d %.16g\n", i, d );
}
return 0;
}
2012-04-19 06:55:45 +00:00
|
|
|
return KiROUND( radius );
|
2011-02-27 19:54:01 +00:00
|
|
|
}
|
|
|
|
|
2013-12-19 11:33:57 +00:00
|
|
|
/**
|
|
|
|
* Initialize the start arc point. can be used for circles
|
|
|
|
* to initialize one point of the cicumference
|
|
|
|
*/
|
|
|
|
void SetArcStart( const wxPoint& aArcStartPoint )
|
|
|
|
{ m_End = aArcStartPoint; }
|
|
|
|
|
|
|
|
/** For arcs and circles:
|
|
|
|
*/
|
|
|
|
void SetCenter( const wxPoint& aCenterPoint ) { m_Start = aCenterPoint; }
|
|
|
|
|
2011-08-08 23:50:55 +00:00
|
|
|
/**
|
|
|
|
* Function GetParentModule
|
|
|
|
* returns a pointer to the parent module, or NULL if DRAWSEGMENT does not
|
|
|
|
* belong to a module.
|
|
|
|
* @return MODULE* - pointer to the parent module or NULL.
|
|
|
|
*/
|
|
|
|
MODULE* GetParentModule() const;
|
|
|
|
|
2015-01-28 10:00:48 +00:00
|
|
|
// Accessors:
|
|
|
|
const std::vector<wxPoint>& GetBezierPoints() const { return m_BezierPoints; }
|
2017-10-19 21:16:06 +00:00
|
|
|
|
2018-01-24 13:22:43 +00:00
|
|
|
/** Build and return the list of corners in a std::vector<wxPoint>
|
|
|
|
* It must be used only to convert the SHAPE_POLY_SET internal corner buffer
|
|
|
|
* to a list of wxPoints, and nothing else, because it duplicates the buffer,
|
|
|
|
* that is inefficient to know for instance the corner count
|
|
|
|
*/
|
|
|
|
const std::vector<wxPoint> BuildPolyPointsList() const;
|
|
|
|
|
|
|
|
/** @return the number of corners of the polygonal shape
|
|
|
|
*/
|
|
|
|
int GetPointCount() const;
|
|
|
|
|
|
|
|
// Accessors to the polygonal shape
|
2017-10-19 21:16:06 +00:00
|
|
|
SHAPE_POLY_SET& GetPolyShape() { return m_Poly; }
|
|
|
|
const SHAPE_POLY_SET& GetPolyShape() const { return m_Poly; }
|
2018-01-24 13:22:43 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @return true if the polygonal shape is valid (has more than 2 points)
|
|
|
|
*/
|
|
|
|
bool IsPolyShapeValid() const;
|
|
|
|
|
2017-10-19 21:16:06 +00:00
|
|
|
void SetPolyShape( const SHAPE_POLY_SET& aShape ) { m_Poly = aShape; }
|
2011-11-29 03:08:14 +00:00
|
|
|
|
2012-05-24 01:18:30 +00:00
|
|
|
void SetBezierPoints( const std::vector<wxPoint>& aPoints )
|
2011-11-29 03:08:14 +00:00
|
|
|
{
|
|
|
|
m_BezierPoints = aPoints;
|
|
|
|
}
|
|
|
|
|
2018-07-07 11:04:01 +00:00
|
|
|
/** Rebuild the m_BezierPoints vertex list that approximate the Bezier curve
|
|
|
|
* by a list of segments
|
|
|
|
* Has meaning only for S_CURVE DRAW_SEGMENT shape
|
|
|
|
* @param aMinSegLen is the min length of segments approximating the shape.
|
|
|
|
* the last segment can be shorter
|
|
|
|
* This param avoid having too many very short segment in list.
|
|
|
|
* a good value is m_Width/2 to m_Width
|
|
|
|
*/
|
|
|
|
void RebuildBezierToSegmentsPointsList( int aMinSegLen );
|
|
|
|
|
2017-10-19 21:16:06 +00:00
|
|
|
void SetPolyPoints( const std::vector<wxPoint>& aPoints );
|
2011-08-08 23:50:55 +00:00
|
|
|
|
2019-05-31 12:15:25 +00:00
|
|
|
void Print( PCB_BASE_FRAME* aFrame, wxDC* DC, const wxPoint& aOffset = ZeroOffset ) override;
|
2008-04-01 06:07:00 +00:00
|
|
|
|
2019-05-05 10:33:34 +00:00
|
|
|
void GetMsgPanelInfo( EDA_UNITS_T aUnits, std::vector<MSG_PANEL_ITEM>& aList ) override;
|
2008-01-16 18:48:04 +00:00
|
|
|
|
2019-05-05 10:33:34 +00:00
|
|
|
const EDA_RECT GetBoundingBox() const override;
|
2011-08-08 23:50:55 +00:00
|
|
|
|
2019-05-05 10:33:34 +00:00
|
|
|
bool HitTest( const wxPoint& aPosition, int aAccuracy = 0 ) const override;
|
|
|
|
bool HitTest( const EDA_RECT& aRect, bool aContained, int aAccuracy = 0 ) const override;
|
2008-01-16 18:48:04 +00:00
|
|
|
|
2016-09-24 18:53:15 +00:00
|
|
|
wxString GetClass() const override
|
2008-01-16 18:48:04 +00:00
|
|
|
{
|
|
|
|
return wxT( "DRAWSEGMENT" );
|
|
|
|
}
|
2008-01-22 20:36:46 +00:00
|
|
|
|
2008-05-05 19:46:54 +00:00
|
|
|
/**
|
|
|
|
* Function GetLength
|
|
|
|
* returns the length of the track using the hypotenuse calculation.
|
|
|
|
* @return double - the length of the track
|
|
|
|
*/
|
2019-04-14 17:58:35 +00:00
|
|
|
double GetLength() const;
|
2008-05-05 19:46:54 +00:00
|
|
|
|
2017-12-18 17:24:25 +00:00
|
|
|
virtual void Move( const wxPoint& aMoveVector ) override;
|
2009-08-01 19:26:05 +00:00
|
|
|
|
2016-09-24 18:53:15 +00:00
|
|
|
virtual void Rotate( const wxPoint& aRotCentre, double aAngle ) override;
|
2009-08-01 19:26:05 +00:00
|
|
|
|
2016-09-24 18:53:15 +00:00
|
|
|
virtual void Flip( const wxPoint& aCentre ) override;
|
2009-11-16 08:13:40 +00:00
|
|
|
|
2010-11-12 15:17:10 +00:00
|
|
|
/**
|
|
|
|
* Function TransformShapeWithClearanceToPolygon
|
2018-11-14 23:34:32 +00:00
|
|
|
* Convert the draw segment to a closed polygon
|
2009-11-16 08:13:40 +00:00
|
|
|
* Used in filling zones calculations
|
|
|
|
* Circles and arcs are approximated by segments
|
|
|
|
* @param aCornerBuffer = a buffer to store the polygon
|
|
|
|
* @param aClearanceValue = the clearance around the pad
|
2019-05-14 12:39:34 +00:00
|
|
|
* @param aError = the maximum deviation from a true arc
|
2018-11-14 23:34:32 +00:00
|
|
|
* @param ignoreLineWidth = used for edge cut items where the line width is only
|
|
|
|
* for visualization
|
2009-11-16 08:13:40 +00:00
|
|
|
*/
|
2019-05-14 12:39:34 +00:00
|
|
|
void TransformShapeWithClearanceToPolygon( SHAPE_POLY_SET& aCornerBuffer, int aClearanceValue,
|
|
|
|
int aError = ARC_HIGH_DEF, bool ignoreLineWidth = false ) const override;
|
2011-07-14 15:42:44 +00:00
|
|
|
|
2018-04-10 10:52:12 +00:00
|
|
|
virtual wxString GetSelectMenuText( EDA_UNITS_T aUnits ) const override;
|
2008-05-05 19:46:54 +00:00
|
|
|
|
2017-02-20 12:20:39 +00:00
|
|
|
virtual BITMAP_DEF GetMenuImage() const override;
|
2011-08-01 15:29:27 +00:00
|
|
|
|
2016-09-24 18:53:15 +00:00
|
|
|
virtual EDA_ITEM* Clone() const override;
|
2012-03-17 14:39:27 +00:00
|
|
|
|
2016-09-24 18:53:15 +00:00
|
|
|
virtual const BOX2I ViewBBox() const override;
|
2015-09-03 21:05:01 +00:00
|
|
|
|
2017-10-31 13:59:03 +00:00
|
|
|
virtual void SwapData( BOARD_ITEM* aImage ) override;
|
|
|
|
|
2008-04-01 06:07:00 +00:00
|
|
|
#if defined(DEBUG)
|
2016-09-24 18:53:15 +00:00
|
|
|
void Show( int nestLevel, std::ostream& os ) const override { ShowDummy( os ); }
|
2009-11-16 08:13:40 +00:00
|
|
|
#endif
|
2008-01-16 18:48:04 +00:00
|
|
|
};
|
|
|
|
|
2011-11-29 03:08:14 +00:00
|
|
|
#endif // CLASS_DRAWSEGMENT_H_
|