kicad/pcbnew/router/pns_segment.h

127 lines
2.9 KiB
C
Raw Normal View History

/*
* KiRouter - a push-and-(sometimes-)shove PCB router
*
* Copyright (C) 2013-2014 CERN
* Copyright (C) 2016 KiCad Developers, see AUTHORS.txt for contributors.
* Author: Tomasz Wlostowski <tomasz.wlostowski@cern.ch>
2013-09-26 21:53:54 +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 3 of the License, or (at your
* option) any later version.
2013-09-26 21:53:54 +00:00
*
* 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.
2013-09-26 21:53:54 +00:00
*
* You should have received a copy of the GNU General Public License along
* with this program. If not, see <http://www.gnu.org/licenses/>.
*/
2013-09-26 21:53:54 +00:00
#ifndef __PNS_SEGMENT_H
#define __PNS_SEGMENT_H
#include <math/vector2d.h>
#include <geometry/seg.h>
#include <geometry/shape_segment.h>
#include <geometry/shape_line_chain.h>
#include "pns_line.h"
#include "pns_linked_item.h"
namespace PNS {
class NODE;
class SEGMENT : public LINKED_ITEM
2013-09-26 21:53:54 +00:00
{
public:
SEGMENT() :
LINKED_ITEM( SEGMENT_T )
{}
2013-09-26 21:53:54 +00:00
SEGMENT( const SEG& aSeg, int aNet ) :
LINKED_ITEM( SEGMENT_T ),
m_seg( aSeg, 0 )
2013-09-26 21:53:54 +00:00
{
m_net = aNet;
}
2013-09-26 21:53:54 +00:00
SEGMENT( const LINE& aParentLine, const SEG& aSeg ) :
LINKED_ITEM( SEGMENT_T ),
m_seg( aSeg, aParentLine.Width() )
2013-09-26 21:53:54 +00:00
{
m_net = aParentLine.Net();
m_layers = aParentLine.Layers();
m_marker = aParentLine.Marker();
m_rank = aParentLine.Rank();
2015-07-22 08:46:56 +00:00
}
2013-09-26 21:53:54 +00:00
static inline bool ClassOf( const ITEM* aItem )
{
return aItem && SEGMENT_T == aItem->Kind();
}
2015-02-18 16:53:46 +00:00
2016-09-24 18:53:15 +00:00
SEGMENT* Clone() const override;
2013-09-26 21:53:54 +00:00
2016-09-25 17:06:49 +00:00
const SHAPE* Shape() const override
2013-09-26 21:53:54 +00:00
{
return static_cast<const SHAPE*>( &m_seg );
2013-09-26 21:53:54 +00:00
}
void SetWidth( int aWidth ) override
2013-09-26 21:53:54 +00:00
{
m_seg.SetWidth(aWidth);
2013-09-26 21:53:54 +00:00
}
int Width() const override
2013-09-26 21:53:54 +00:00
{
return m_seg.GetWidth();
2013-09-26 21:53:54 +00:00
}
const SEG& Seg() const
2013-09-26 21:53:54 +00:00
{
return m_seg.GetSeg();
2013-09-26 21:53:54 +00:00
}
const SHAPE_LINE_CHAIN CLine() const
2013-09-26 21:53:54 +00:00
{
return SHAPE_LINE_CHAIN( { m_seg.GetSeg().A, m_seg.GetSeg().B } );
2013-09-26 21:53:54 +00:00
}
void SetEnds( const VECTOR2I& a, const VECTOR2I& b )
{
m_seg.SetSeg( SEG ( a, b ) );
2015-02-18 16:53:46 +00:00
}
2013-09-26 21:53:54 +00:00
void SwapEnds()
{
SEG tmp = m_seg.GetSeg();
m_seg.SetSeg( SEG (tmp.B , tmp.A ) );
2013-09-26 21:53:54 +00:00
}
const SHAPE_LINE_CHAIN Hull( int aClearance, int aWalkaroundThickness, int aLayer = -1 ) const override;
2016-09-25 17:06:49 +00:00
virtual VECTOR2I Anchor( int n ) const override
{
if( n == 0 )
return m_seg.GetSeg().A;
else
return m_seg.GetSeg().B;
}
2016-09-25 17:06:49 +00:00
virtual int AnchorCount() const override
{
2015-02-18 16:53:46 +00:00
return 2;
}
private:
SHAPE_SEGMENT m_seg;
};
}
#endif