shape_simple.h

Go to the documentation of this file.

/*
 * This program source code file is part of KiCad, a free EDA CAD application.
 *
 * Copyright The KiCad Developers, see AUTHORS.txt for contributors.
 *
 * 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, see <https://www.gnu.org/licenses/>.
 */
 
#ifndef __SHAPE_SIMPLE_H
#define __SHAPE_SIMPLE_H
 
#include <geometry/seg.h>
#include <geometry/shape.h>
#include <geometry/shape_line_chain.h>
#include <math/box2.h>
#include <math/vector2d.h>

 
class SHAPE_SIMPLE : public SHAPE_LINE_CHAIN_BASE
{
public:
    SHAPE_SIMPLE() :
        SHAPE_LINE_CHAIN_BASE( SH_SIMPLE )
    {
        m_points.SetClosed( true );
    }
 
    SHAPE_SIMPLE( const SHAPE_LINE_CHAIN& aPoly ) :
        SHAPE_LINE_CHAIN_BASE( SH_SIMPLE ),
        m_points( aPoly )
    {
        m_points.SetClosed( true );
    }
 
    SHAPE_SIMPLE( const SHAPE_SIMPLE& aOther ) :
       SHAPE_LINE_CHAIN_BASE( SH_SIMPLE ), m_points( aOther.m_points )
    {}
 
    SHAPE* Clone() const override
    {
        return new SHAPE_SIMPLE( *this );
    }

    void Clear()
    {
        m_points.Clear();
    }

    const BOX2I BBox( int aClearance = 0 ) const override
    {
        return m_points.BBox( aClearance );
    }

    int PointCount() const
    {
        return m_points.PointCount();
    }

    const VECTOR2I& CPoint( int aIndex ) const
    {
        return m_points.CPoint( aIndex );
    }

    const VECTOR2D CDPoint( int aIndex ) const
    {
        const VECTOR2I& v = CPoint( aIndex );
        return VECTOR2D( v.x, v.y );
    }

    const SHAPE_LINE_CHAIN& Vertices() const
    {
        return m_points;
    }

    void Append( int aX, int aY )
    {
        VECTOR2I v( aX, aY );
        Append( v );
    }

    void Append( const VECTOR2I& aP )
    {
        m_points.Append( aP );
    }

    bool Collide( const SEG& aSeg, int aClearance = 0, int* aActual = nullptr,
                  VECTOR2I* aLocation = nullptr ) const override
    {
        return m_points.Collide( aSeg, aClearance, aActual, aLocation );
    }
 
    void Rotate( const EDA_ANGLE& aAngle, const VECTOR2I& aCenter = { 0, 0 } ) override
    {
        m_points.Rotate( aAngle, aCenter );
    }
 
    void Move( const VECTOR2I& aVector ) override
    {
        m_points.Move( aVector );
    }
 
    bool IsSolid() const override
    {
        return true;
    }
 
    virtual const VECTOR2I GetPoint( int aIndex ) const override { return m_points.CPoint(aIndex); }
    virtual const SEG GetSegment( int aIndex ) const override { return m_points.CSegment(aIndex); }
    virtual size_t GetPointCount() const override { return m_points.PointCount(); }
    virtual size_t GetSegmentCount() const override { return m_points.SegmentCount(); }
 
    bool IsClosed() const override
    {
        return true;
    }
 
    void TransformToPolygon( SHAPE_POLY_SET& aBuffer, int aError,
                             ERROR_LOC aErrorLoc ) const override;
 
private:
    // vertices
    SHAPE_LINE_CHAIN m_points;
};
 
#endif // __SHAPE_SIMPLE_H