tools/inc/poly.h

   1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2 /*
   3  * This file is part of the LibreOffice project.
   4  *
   5  * This Source Code Form is subject to the terms of the Mozilla Public
   6  * License, v. 2.0. If a copy of the MPL was not distributed with this
   7  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
   8  *
   9  * This file incorporates work covered by the following license notice:
  10  *
  11  *   Licensed to the Apache Software Foundation (ASF) under one or more
  12  *   contributor license agreements. See the NOTICE file distributed
  13  *   with this work for additional information regarding copyright
  14  *   ownership. The ASF licenses this file to you under the Apache
  15  *   License, Version 2.0 (the "License"); you may not use this file
  16  *   except in compliance with the License. You may obtain a copy of
  17  *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
  18  */
  19 #pragma once
  20
  21 #include <sal/types.h>
  22 #include <memory>
  23 #include <tools/poly.hxx>
  24
  25 class SAL_WARN_UNUSED ImplPolygon
  26 {
  27 public:
  28     std::unique_ptr<Point[]> mxPointAry;
  29     std::unique_ptr<PolyFlags[]> mxFlagAry;
  30     sal_uInt16      mnPoints;
  31
  32 public:
  33                     ImplPolygon() : mnPoints(0) {}
  34                     ImplPolygon( sal_uInt16 nInitSize );
  35                     ImplPolygon( sal_uInt16 nPoints, const Point* pPtAry, const PolyFlags* pInitFlags );
  36                     ImplPolygon( const ImplPolygon& rImplPoly );
  37                     ImplPolygon( ImplPolygon&& rImplPoly ) noexcept;
  38                     ImplPolygon( const tools::Rectangle& rRect );
  39                     ImplPolygon( const tools::Rectangle& rRect, sal_uInt32 nHorzRound, sal_uInt32 nVertRound);
  40                     ImplPolygon( const Point& rCenter, tools::Long nRadX, tools::Long nRadY );
  41                     ImplPolygon( const tools::Rectangle& rBound, const Point& rStart, const Point& rEnd,
  42                                     PolyStyle eStyle, bool bClockWiseArcDirection );
  43                     ImplPolygon( const Point& rBezPt1, const Point& rCtrlPt1, const Point& rBezPt2,
  44                                     const Point& rCtrlPt2, sal_uInt16 nPoints );
  45                     ImplPolygon(const basegfx::B2DPolygon& rPolygon);
  46
  47     bool            operator==( const ImplPolygon& rCandidate ) const;
  48
  49     void            ImplInitSize(sal_uInt16 nInitSize, bool bFlags = false);
  50     void            ImplSetSize( sal_uInt16 nSize, bool bResize = true );
  51     void            ImplCreateFlagArray();
  52     bool            ImplSplit( sal_uInt16 nPos, sal_uInt16 nSpace, ImplPolygon const * pInitPoly = nullptr );
  53 };
  54
  55 #define MAX_POLYGONS        SAL_MAX_UINT16
  56
  57 struct ImplPolyPolygon
  58 {
  59     std::vector<tools::Polygon> mvPolyAry;
  60
  61     typedef std::vector<tools::Polygon>::iterator iterator;
  62     typedef std::vector<tools::Polygon>::const_iterator const_iterator;
  63
  64     ImplPolyPolygon( sal_uInt16 nInitSize )
  65     {
  66        if ( !nInitSize )
  67             nInitSize = 1;
  68        mvPolyAry.reserve(nInitSize);
  69     }
  70
  71     ImplPolyPolygon( const tools::Polygon& rPoly )
  72     {
  73         if ( rPoly.GetSize() )
  74             mvPolyAry.push_back(rPoly);
  75         else
  76             mvPolyAry.reserve(16);
  77     }
  78
  79     ImplPolyPolygon(const basegfx::B2DPolyPolygon& rPolyPolygon);
  80
  81     bool operator==(ImplPolyPolygon const & other) const
  82     {
  83         return mvPolyAry == other.mvPolyAry;
  84     }
  85
  86     iterator begin() { return mvPolyAry.begin(); }
  87     iterator end() { return mvPolyAry.end(); }
  88
  89     const_iterator begin() const { return mvPolyAry.begin(); }
  90     const_iterator end() const { return mvPolyAry.end(); }
  91 };
  92
  93 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */