2013-05-26 04:36:44 +00:00
|
|
|
/*
|
|
|
|
* This program source code file is part of KiCad, a free EDA CAD application.
|
|
|
|
*
|
|
|
|
* Copyright (C) 2009 Jean-Pierre Charras, jaen-pierre.charras@gipsa-lab.inpg.com
|
2021-03-25 21:13:01 +00:00
|
|
|
* Copyright (C) 1992-2021 KiCad Developers, see AUTHORS.txt for contributors.
|
2013-05-26 04:36:44 +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
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _SCH_LINE_H_
|
|
|
|
#define _SCH_LINE_H_
|
|
|
|
|
2019-05-10 19:57:24 +00:00
|
|
|
#include <sch_item.h>
|
2022-09-20 18:41:16 +00:00
|
|
|
#include <wx/pen.h> // for wxPenStyle
|
|
|
|
#include <list> // for std::list
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2013-09-25 19:09:57 +00:00
|
|
|
class NETLIST_OBJECT_LIST;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2019-04-30 13:54:32 +00:00
|
|
|
|
2013-05-26 04:36:44 +00:00
|
|
|
/**
|
2017-11-18 13:10:32 +00:00
|
|
|
* Segment description base class to describe items which have 2 end points (track, wire,
|
|
|
|
* draw line ...)
|
2013-05-26 04:36:44 +00:00
|
|
|
*/
|
|
|
|
class SCH_LINE : public SCH_ITEM
|
|
|
|
{
|
|
|
|
public:
|
2017-11-13 03:53:27 +00:00
|
|
|
static const enum wxPenStyle PenStyle[];
|
|
|
|
|
2022-01-04 01:00:40 +00:00
|
|
|
SCH_LINE( const VECTOR2I& pos = VECTOR2I( 0, 0 ), int layer = LAYER_NOTES );
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2019-12-13 13:19:28 +00:00
|
|
|
SCH_LINE( const VECTOR2D& pos, int layer = LAYER_NOTES ) :
|
2022-01-04 01:00:40 +00:00
|
|
|
SCH_LINE( VECTOR2I( pos.x, pos.y ), layer )
|
2019-12-13 13:19:28 +00:00
|
|
|
{}
|
|
|
|
|
2013-05-26 04:36:44 +00:00
|
|
|
SCH_LINE( const SCH_LINE& aLine );
|
|
|
|
|
|
|
|
~SCH_LINE() { }
|
|
|
|
|
2019-08-29 14:59:36 +00:00
|
|
|
static inline bool ClassOf( const EDA_ITEM* aItem )
|
|
|
|
{
|
|
|
|
return aItem && SCH_LINE_T == aItem->Type();
|
|
|
|
}
|
|
|
|
|
2016-09-25 17:06:49 +00:00
|
|
|
wxString GetClass() const override
|
2013-05-26 04:36:44 +00:00
|
|
|
{
|
|
|
|
return wxT( "SCH_LINE" );
|
|
|
|
}
|
|
|
|
|
2022-05-02 08:42:15 +00:00
|
|
|
/**
|
|
|
|
* @brief This function travel though all the connected wire segments
|
|
|
|
* to look for connected labels.
|
|
|
|
* @param aSheet - the sheet where the current wire segment is located
|
|
|
|
* @return returns the name of the wire if connected labels found, otherwise empty string
|
|
|
|
*/
|
|
|
|
wxString GetNetname(const SCH_SHEET_PATH &aSheet);
|
|
|
|
|
2022-08-21 19:54:07 +00:00
|
|
|
bool IsType( const std::vector<KICAD_T>& aScanTypes ) const override
|
2021-10-12 20:05:37 +00:00
|
|
|
{
|
|
|
|
if( SCH_ITEM::IsType( aScanTypes ) )
|
|
|
|
return true;
|
|
|
|
|
2022-08-20 09:27:35 +00:00
|
|
|
for( KICAD_T scanType : aScanTypes )
|
2021-10-12 20:05:37 +00:00
|
|
|
{
|
2022-08-20 09:27:35 +00:00
|
|
|
if( scanType == SCH_ITEM_LOCATE_WIRE_T && m_layer == LAYER_WIRE )
|
2021-10-12 20:05:37 +00:00
|
|
|
return true;
|
|
|
|
|
2022-08-20 09:27:35 +00:00
|
|
|
if ( scanType == SCH_ITEM_LOCATE_BUS_T && m_layer == LAYER_BUS )
|
2021-10-12 20:05:37 +00:00
|
|
|
return true;
|
|
|
|
|
2022-08-20 09:27:35 +00:00
|
|
|
if ( scanType == SCH_ITEM_LOCATE_GRAPHIC_LINE_T && m_layer == LAYER_NOTES )
|
2021-10-12 20:05:37 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2022-01-01 06:04:08 +00:00
|
|
|
bool IsEndPoint( const VECTOR2I& aPoint ) const
|
2013-05-26 04:36:44 +00:00
|
|
|
{
|
|
|
|
return aPoint == m_start || aPoint == m_end;
|
|
|
|
}
|
|
|
|
|
2022-01-01 06:04:08 +00:00
|
|
|
int GetAngleFrom( const VECTOR2I& aPoint ) const;
|
|
|
|
int GetReverseAngleFrom( const VECTOR2I& aPoint ) const;
|
2021-03-18 16:37:53 +00:00
|
|
|
|
2022-02-10 18:38:40 +00:00
|
|
|
/**
|
|
|
|
* Gets the angle between the start and end lines.
|
|
|
|
*
|
|
|
|
* @return Line angle in radians.
|
|
|
|
*/
|
|
|
|
inline EDA_ANGLE Angle() const
|
|
|
|
{
|
|
|
|
return ( EDA_ANGLE( (VECTOR2I) m_end - (VECTOR2I) m_start ) );
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Saves the current line angle. Useful when dragging a line and its important to
|
|
|
|
* be able to restart the line from length 0 in the correct direction.
|
|
|
|
*/
|
2022-11-25 15:04:36 +00:00
|
|
|
inline void StoreAngle()
|
|
|
|
{
|
|
|
|
if( !IsNull() )
|
|
|
|
m_storedAngle = Angle();
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void StoreAngle( const EDA_ANGLE& aAngle ) { m_storedAngle = aAngle; }
|
2022-02-10 18:38:40 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns the angle stored by StoreAngle()
|
|
|
|
*
|
|
|
|
* @return Stored angle in radians.
|
|
|
|
*/
|
|
|
|
inline EDA_ANGLE GetStoredAngle() const { return m_storedAngle; }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Checks if line is orthogonal (to the grid).
|
|
|
|
*
|
|
|
|
* @return True if orthogonal, false if not or the line is zero length.
|
|
|
|
*/
|
|
|
|
inline bool IsOrthogonal() const { return Angle().IsCardinal(); }
|
|
|
|
|
2013-05-26 04:36:44 +00:00
|
|
|
bool IsNull() const { return m_start == m_end; }
|
|
|
|
|
2022-01-01 06:04:08 +00:00
|
|
|
VECTOR2I GetStartPoint() const { return m_start; }
|
|
|
|
void SetStartPoint( const VECTOR2I& aPosition ) { m_start = aPosition; }
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2022-02-16 14:15:13 +00:00
|
|
|
VECTOR2I GetMidPoint() const { return ( m_start + m_end ) / 2; }
|
|
|
|
|
2022-01-01 06:04:08 +00:00
|
|
|
VECTOR2I GetEndPoint() const { return m_end; }
|
|
|
|
void SetEndPoint( const VECTOR2I& aPosition ) { m_end = aPosition; }
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2021-11-28 17:08:30 +00:00
|
|
|
void SetLastResolvedState( const SCH_ITEM* aItem ) override
|
|
|
|
{
|
|
|
|
const SCH_LINE* aLine = dynamic_cast<const SCH_LINE*>( aItem );
|
|
|
|
|
|
|
|
if( aLine )
|
|
|
|
{
|
2023-01-25 17:33:47 +00:00
|
|
|
m_stroke = aLine->GetStroke();
|
2021-11-28 17:08:30 +00:00
|
|
|
m_lastResolvedLineStyle = aLine->m_lastResolvedLineStyle;
|
|
|
|
m_lastResolvedWidth = aLine->m_lastResolvedWidth;
|
|
|
|
m_lastResolvedColor = aLine->m_lastResolvedColor;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-12-28 00:55:11 +00:00
|
|
|
void SetLineStyle( const PLOT_DASH_TYPE aStyle );
|
|
|
|
void SetLineStyle( const int aStyleId );
|
|
|
|
PLOT_DASH_TYPE GetLineStyle() const;
|
2017-10-31 16:33:37 +00:00
|
|
|
|
2020-07-08 18:29:16 +00:00
|
|
|
/// @return the style that the line should be drawn in
|
|
|
|
/// this might be set on the line or inherited from the line's netclass
|
|
|
|
PLOT_DASH_TYPE GetEffectiveLineStyle() const;
|
|
|
|
|
2020-06-17 19:59:27 +00:00
|
|
|
void SetLineColor( const COLOR4D& aColor );
|
2017-10-31 16:33:37 +00:00
|
|
|
|
|
|
|
void SetLineColor( const double r, const double g, const double b, const double a );
|
|
|
|
|
2020-02-03 16:46:58 +00:00
|
|
|
/// Returns COLOR4D::UNSPECIFIED if a custom color hasn't been set for this line
|
2017-10-31 16:33:37 +00:00
|
|
|
COLOR4D GetLineColor() const;
|
|
|
|
|
|
|
|
void SetLineWidth( const int aSize );
|
|
|
|
|
2020-06-17 19:59:27 +00:00
|
|
|
virtual bool HasLineStroke() const override { return true; }
|
2020-06-19 11:48:00 +00:00
|
|
|
virtual STROKE_PARAMS GetStroke() const override { return m_stroke; }
|
|
|
|
virtual void SetStroke( const STROKE_PARAMS& aStroke ) override { m_stroke = aStroke; }
|
2020-06-17 19:59:27 +00:00
|
|
|
|
2020-10-21 16:23:19 +00:00
|
|
|
bool IsStrokeEquivalent( const SCH_LINE* aLine )
|
|
|
|
{
|
|
|
|
if( m_stroke.GetWidth() != aLine->GetStroke().GetWidth() )
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if( m_stroke.GetColor() != aLine->GetStroke().GetColor() )
|
|
|
|
return false;
|
|
|
|
|
|
|
|
PLOT_DASH_TYPE style_a = m_stroke.GetPlotStyle();
|
|
|
|
PLOT_DASH_TYPE style_b = aLine->GetStroke().GetPlotStyle();
|
|
|
|
|
|
|
|
return style_a == style_b
|
|
|
|
|| ( style_a == PLOT_DASH_TYPE::DEFAULT && style_b == PLOT_DASH_TYPE::SOLID )
|
|
|
|
|| ( style_a == PLOT_DASH_TYPE::SOLID && style_b == PLOT_DASH_TYPE::DEFAULT );
|
|
|
|
}
|
|
|
|
|
2020-06-17 19:59:27 +00:00
|
|
|
int GetLineSize() const { return m_stroke.GetWidth(); }
|
2017-10-31 16:33:37 +00:00
|
|
|
|
2019-08-03 19:44:20 +00:00
|
|
|
void ViewGetLayers( int aLayers[], int& aCount ) const override;
|
|
|
|
|
2022-08-31 09:15:42 +00:00
|
|
|
const BOX2I GetBoundingBox() const override;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @return The length of the line segment.
|
|
|
|
*/
|
|
|
|
double GetLength() const;
|
|
|
|
|
2022-01-01 06:04:08 +00:00
|
|
|
void Print( const RENDER_SETTINGS* aSettings, const VECTOR2I& aOffset ) override;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2020-04-14 12:25:00 +00:00
|
|
|
int GetPenWidth() const override;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2022-01-01 06:04:08 +00:00
|
|
|
void Move( const VECTOR2I& aMoveVector ) override;
|
|
|
|
void MoveStart( const VECTOR2I& aMoveVector );
|
|
|
|
void MoveEnd( const VECTOR2I& aMoveVector );
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2021-02-16 20:45:25 +00:00
|
|
|
void MirrorVertically( int aCenter ) override;
|
|
|
|
void MirrorHorizontally( int aCenter ) override;
|
2022-01-01 06:04:08 +00:00
|
|
|
void Rotate( const VECTOR2I& aCenter ) override;
|
|
|
|
void RotateStart( const VECTOR2I& aCenter );
|
|
|
|
void RotateEnd( const VECTOR2I& aCenter );
|
2013-05-26 04:36:44 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Check line against \a aLine to see if it overlaps and merge if it does.
|
|
|
|
*
|
2017-11-27 19:27:24 +00:00
|
|
|
* This method will return an equivalent of the union of line and \a aLine if the
|
2013-05-26 04:36:44 +00:00
|
|
|
* two lines overlap. This method is used to merge multiple line segments into a single
|
|
|
|
* line.
|
|
|
|
*
|
2021-03-25 21:13:01 +00:00
|
|
|
* @param aScreen is the current screen.
|
|
|
|
* @param aLine is the line to compare.
|
|
|
|
* @param aCheckJunctions is used to indicate if we need to check for a junction if the two
|
|
|
|
* segments are colinear and touch.
|
2017-11-27 19:27:24 +00:00
|
|
|
* @return New line that combines the two or NULL on non-overlapping segments.
|
2013-05-26 04:36:44 +00:00
|
|
|
*/
|
2020-10-21 17:41:44 +00:00
|
|
|
SCH_LINE* MergeOverlap( SCH_SCREEN* aScreen, SCH_LINE* aLine, bool aCheckJunctions );
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2023-01-15 12:28:25 +00:00
|
|
|
/**
|
|
|
|
* Break this segment into two at the specified point.
|
|
|
|
*
|
|
|
|
* @note No checks are made to verify if aPoint is contained within the segment. That is
|
|
|
|
* the responsibility of the caller.
|
|
|
|
*
|
|
|
|
* @note It is the responsibility of the caller to add the newly created segment
|
|
|
|
* to the screen.
|
|
|
|
*
|
|
|
|
* @param aPoint Point at which to break the segment
|
|
|
|
* @return The newly created segment.
|
|
|
|
*/
|
|
|
|
SCH_LINE* BreakAt( const VECTOR2I& aPoint );
|
|
|
|
|
2020-12-20 18:44:13 +00:00
|
|
|
bool IsParallel( const SCH_LINE* aLine ) const;
|
2017-10-16 21:38:57 +00:00
|
|
|
|
2016-09-24 18:53:15 +00:00
|
|
|
void GetEndPoints( std::vector<DANGLING_END_ITEM>& aItemList ) override;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2020-01-17 02:33:16 +00:00
|
|
|
bool UpdateDanglingState( std::vector<DANGLING_END_ITEM>& aItemList,
|
|
|
|
const SCH_SHEET_PATH* aPath = nullptr ) override;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2018-08-30 22:43:42 +00:00
|
|
|
bool IsStartDangling() const { return m_startIsDangling; }
|
|
|
|
bool IsEndDangling() const { return m_endIsDangling; }
|
2016-09-25 17:06:49 +00:00
|
|
|
bool IsDangling() const override { return m_startIsDangling || m_endIsDangling; }
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2016-09-24 18:53:15 +00:00
|
|
|
bool IsConnectable() const override;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2022-01-01 06:04:08 +00:00
|
|
|
std::vector<VECTOR2I> GetConnectionPoints() const override;
|
2019-06-11 20:17:05 +00:00
|
|
|
|
2021-11-25 18:36:30 +00:00
|
|
|
bool ConnectionPropagatesTo( const EDA_ITEM* aItem ) const override;
|
|
|
|
|
2022-01-01 06:04:08 +00:00
|
|
|
void GetSelectedPoints( std::vector<VECTOR2I>& aPoints ) const;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2017-12-19 17:45:56 +00:00
|
|
|
bool CanConnect( const SCH_ITEM* aItem ) const override;
|
|
|
|
|
2023-01-12 03:27:44 +00:00
|
|
|
wxString GetItemDescription( UNITS_PROVIDER* aUnitsProvider ) const override;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2021-03-08 02:59:07 +00:00
|
|
|
BITMAPS GetMenuImage() const override;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2016-09-24 18:53:15 +00:00
|
|
|
bool operator <( const SCH_ITEM& aItem ) const override;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2022-01-01 06:04:08 +00:00
|
|
|
VECTOR2I GetPosition() const override { return m_start; }
|
|
|
|
void SetPosition( const VECTOR2I& aPosition ) override;
|
2022-03-03 14:35:57 +00:00
|
|
|
VECTOR2I GetSortPosition() const override { return GetMidPoint(); }
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2022-01-01 06:04:08 +00:00
|
|
|
bool IsPointClickableAnchor( const VECTOR2I& aPos ) const override
|
2020-10-01 23:53:47 +00:00
|
|
|
{
|
|
|
|
return ( GetStartPoint() == aPos && IsStartDangling() )
|
|
|
|
|| ( GetEndPoint() == aPos && IsEndDangling() );
|
|
|
|
}
|
|
|
|
|
2022-01-01 06:04:08 +00:00
|
|
|
bool HitTest( const VECTOR2I& aPosition, int aAccuracy = 0 ) const override;
|
2022-08-31 09:33:46 +00:00
|
|
|
bool HitTest( const BOX2I& aRect, bool aContained, int aAccuracy = 0 ) const override;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2022-02-10 19:49:25 +00:00
|
|
|
void Plot( PLOTTER* aPlotter, bool aBackground ) const override;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2016-09-24 18:53:15 +00:00
|
|
|
EDA_ITEM* Clone() const override;
|
2013-05-26 04:36:44 +00:00
|
|
|
|
2017-10-31 16:33:37 +00:00
|
|
|
void SwapData( SCH_ITEM* aItem ) override;
|
|
|
|
|
2020-04-24 13:36:10 +00:00
|
|
|
void GetMsgPanelInfo( EDA_DRAW_FRAME* aFrame, std::vector<MSG_PANEL_ITEM>& aList ) override;
|
2019-03-11 21:32:05 +00:00
|
|
|
|
2013-05-26 04:36:44 +00:00
|
|
|
#if defined(DEBUG)
|
2016-09-25 17:06:49 +00:00
|
|
|
void Show( int nestLevel, std::ostream& os ) const override;
|
2013-05-26 04:36:44 +00:00
|
|
|
#endif
|
|
|
|
|
2019-12-26 15:15:34 +00:00
|
|
|
/**
|
2021-03-25 21:13:01 +00:00
|
|
|
* Return if the line is a graphic (non electrical line)
|
2019-12-26 15:15:34 +00:00
|
|
|
*
|
|
|
|
* Currently, anything on the internal NOTES layer is a graphic line
|
|
|
|
*/
|
|
|
|
bool IsGraphicLine() const;
|
|
|
|
|
2020-05-09 21:19:34 +00:00
|
|
|
/**
|
2021-03-25 21:13:01 +00:00
|
|
|
* Return true if the line is a wire.
|
2020-05-09 21:19:34 +00:00
|
|
|
*
|
|
|
|
* @return true if this line is on the wire layer.
|
|
|
|
*/
|
|
|
|
bool IsWire() const;
|
|
|
|
|
2021-02-17 19:43:07 +00:00
|
|
|
/**
|
2021-03-25 21:13:01 +00:00
|
|
|
* Return true if the line is a bus.
|
2021-02-17 19:43:07 +00:00
|
|
|
*
|
|
|
|
* @return true if this line is on the bus layer.
|
|
|
|
*/
|
|
|
|
bool IsBus() const;
|
|
|
|
|
2013-05-26 04:36:44 +00:00
|
|
|
private:
|
2022-05-02 08:42:15 +00:00
|
|
|
/**
|
|
|
|
* @brief Recursively called function to travel through the connected wires and find a connected
|
|
|
|
* net name label
|
|
|
|
* @param line - the wire segment to start the recursive lookup
|
|
|
|
* @param checkedLines - a lsit containing the already checked wire segments, to prevent the
|
|
|
|
* infinite recursion in the case if someone draws a rectangle for e.g.
|
|
|
|
* @param aSheet - the sheet where the lookup is performed
|
|
|
|
* @return With the net name if a connected label found, otherwise with an empty string
|
|
|
|
*/
|
|
|
|
wxString FindWireSegmentNetNameRecursive( SCH_LINE *line, std::list<const SCH_LINE*>& checkedLines,
|
|
|
|
const SCH_SHEET_PATH &aSheet ) const;
|
2022-01-01 06:04:08 +00:00
|
|
|
bool doIsConnected( const VECTOR2I& aPosition ) const override;
|
2021-03-25 21:13:01 +00:00
|
|
|
|
2021-07-17 19:56:18 +00:00
|
|
|
bool m_startIsDangling; ///< True if start point is not connected.
|
|
|
|
bool m_endIsDangling; ///< True if end point is not connected.
|
2022-01-01 06:04:08 +00:00
|
|
|
VECTOR2I m_start; ///< Line start point
|
|
|
|
VECTOR2I m_end; ///< Line end point
|
2022-02-10 18:38:40 +00:00
|
|
|
EDA_ANGLE m_storedAngle; ///< Stored angle
|
2021-07-17 19:56:18 +00:00
|
|
|
STROKE_PARAMS m_stroke; ///< Line stroke properties.
|
2021-11-24 13:19:50 +00:00
|
|
|
|
|
|
|
// If real-time connectivity gets disabled (due to being too slow on a particular
|
|
|
|
// design), we can no longer rely on getting the NetClass to find netclass-specific
|
|
|
|
// linestyles, linewidths and colors.
|
|
|
|
mutable PLOT_DASH_TYPE m_lastResolvedLineStyle;
|
|
|
|
mutable int m_lastResolvedWidth;
|
|
|
|
mutable COLOR4D m_lastResolvedColor;
|
2013-05-26 04:36:44 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
#endif // _SCH_LINE_H_
|