| clipper.hpp | clipper.hpp | |||
|---|---|---|---|---|
| /************************************************************************** ***** | /************************************************************************** ***** | |||
| * * | * * | |||
| * Author : Angus Johnson * | * Author : Angus Johnson * | |||
| * Version : 6.2.0 | * Version : 6.2.1 | |||
| * | * | |||
| * Date : 2 October 2014 | * Date : 31 October 2014 | |||
| * | * | |||
| * Website : http://www.angusj.com * | * Website : http://www.angusj.com * | |||
| * Copyright : Angus Johnson 2010-2014 * | * Copyright : Angus Johnson 2010-2014 * | |||
| * * | * * | |||
| * License: * | * License: * | |||
| * Use, modification & distribution is subject to Boost Software License Ver 1. * | * Use, modification & distribution is subject to Boost Software License Ver 1. * | |||
| * http://www.boost.org/LICENSE_1_0.txt * | * http://www.boost.org/LICENSE_1_0.txt * | |||
| * * | * * | |||
| * Attributions: * | * Attributions: * | |||
| * The code in this library is an extension of Bala Vatti's clipping algorit hm: * | * The code in this library is an extension of Bala Vatti's clipping algorit hm: * | |||
| * "A generic solution to polygon clipping" * | * "A generic solution to polygon clipping" * | |||
| skipping to change at line 321 | skipping to change at line 321 | |||
| void ProcessHorizontal(TEdge *horzEdge, bool isTopOfScanbeam); | void ProcessHorizontal(TEdge *horzEdge, bool isTopOfScanbeam); | |||
| void AddLocalMaxPoly(TEdge *e1, TEdge *e2, const IntPoint &pt); | void AddLocalMaxPoly(TEdge *e1, TEdge *e2, const IntPoint &pt); | |||
| OutPt* AddLocalMinPoly(TEdge *e1, TEdge *e2, const IntPoint &pt); | OutPt* AddLocalMinPoly(TEdge *e1, TEdge *e2, const IntPoint &pt); | |||
| OutRec* GetOutRec(int idx); | OutRec* GetOutRec(int idx); | |||
| void AppendPolygon(TEdge *e1, TEdge *e2); | void AppendPolygon(TEdge *e1, TEdge *e2); | |||
| void IntersectEdges(TEdge *e1, TEdge *e2, IntPoint &pt); | void IntersectEdges(TEdge *e1, TEdge *e2, IntPoint &pt); | |||
| OutRec* CreateOutRec(); | OutRec* CreateOutRec(); | |||
| OutPt* AddOutPt(TEdge *e, const IntPoint &pt); | OutPt* AddOutPt(TEdge *e, const IntPoint &pt); | |||
| void DisposeAllOutRecs(); | void DisposeAllOutRecs(); | |||
| void DisposeOutRec(PolyOutList::size_type index); | void DisposeOutRec(PolyOutList::size_type index); | |||
| bool ProcessIntersections(const cInt botY, const cInt topY); | bool ProcessIntersections(const cInt topY); | |||
| void BuildIntersectList(const cInt botY, const cInt topY); | void BuildIntersectList(const cInt topY); | |||
| void ProcessIntersectList(); | void ProcessIntersectList(); | |||
| void ProcessEdgesAtTopOfScanbeam(const cInt topY); | void ProcessEdgesAtTopOfScanbeam(const cInt topY); | |||
| void BuildResult(Paths& polys); | void BuildResult(Paths& polys); | |||
| void BuildResult2(PolyTree& polytree); | void BuildResult2(PolyTree& polytree); | |||
| void SetHoleState(TEdge *e, OutRec *outrec); | void SetHoleState(TEdge *e, OutRec *outrec); | |||
| void DisposeIntersectNodes(); | void DisposeIntersectNodes(); | |||
| bool FixupIntersectionOrder(); | bool FixupIntersectionOrder(); | |||
| void FixupOutPolygon(OutRec &outrec); | void FixupOutPolygon(OutRec &outrec); | |||
| bool IsHole(TEdge *e); | bool IsHole(TEdge *e); | |||
| bool FindOwnerFromSplitRecs(OutRec &outRec, OutRec *&currOrfl); | bool FindOwnerFromSplitRecs(OutRec &outRec, OutRec *&currOrfl); | |||
| End of changes. 2 change blocks. | ||||
| 6 lines changed or deleted | 6 lines changed or added | |||