/* * This program source code file is part of KICAD, a free EDA CAD application. * * Copyright (C) 2021 Ola Rinta-Koski * Copyright (C) 2021 Kicad Developers, see AUTHORS.txt for contributors. * * Outline font class * * 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 OUTLINE_DECOMPOSER_H #define OUTLINE_DECOMPOSER_H #include #ifdef _MSC_VER #include #else #include #endif #include FT_FREETYPE_H #include FT_OUTLINE_H #include #include #include namespace KIFONT { struct CONTOUR { std::vector m_Points; int m_Winding = 0; FT_Orientation m_Orientation; }; class OUTLINE_DECOMPOSER { public: OUTLINE_DECOMPOSER( FT_Outline& aOutline ); bool OutlineToSegments( std::vector* aContours ); private: void newContour(); void addContourPoint( const VECTOR2D& p ); bool approximateBezierCurve( std::vector& result, const std::vector& bezier ) const; bool approximateQuadraticBezierCurve( std::vector& result, const std::vector& bezier ) const; bool approximateCubicBezierCurve( std::vector& result, const std::vector& bezier ) const; /** * @return 1 if aContour is in clockwise order, -1 if it is in counterclockwise order, * or 0 if the winding can't be determined. */ int winding( const std::vector& aContour ) const; inline static unsigned int onCurve( char aTags ) { return aTags & 0x1; } inline static unsigned int thirdOrderBezierPoint( char aTags ) { return onCurve( aTags ) ? 0 : aTags & 0x2; } inline static unsigned int secondOrderBezierPoint( char aTags ) { return onCurve( aTags ) ? 0 : !thirdOrderBezierPoint( aTags ); } inline static unsigned int hasDropout( char aTags ) { return aTags & 0x4; } inline static unsigned int dropoutMode( char aTags ) { return hasDropout( aTags ) ? ( aTags & 0x38 ) : 0; } // FT_Outline_Decompose callbacks static int moveTo( const FT_Vector* aEndPoint, void* aCallbackData ); static int lineTo( const FT_Vector* aEndPoint, void* aCallbackData ); static int quadraticTo( const FT_Vector* aControlPoint, const FT_Vector* aEndPoint, void* aCallbackData ); static int cubicTo( const FT_Vector* aFirstControlPoint, const FT_Vector* aSecondControlPoint, const FT_Vector* aEndPoint, void* aCallbackData ); private: FT_Outline& m_outline; std::vector* m_contours; VECTOR2D m_lastEndPoint; }; } //namespace KIFONT #endif // OUTLINE_DECOMPOSER_H