1*b1cdbd2cSJim Jagielski /************************************************************** 2*b1cdbd2cSJim Jagielski * 3*b1cdbd2cSJim Jagielski * Licensed to the Apache Software Foundation (ASF) under one 4*b1cdbd2cSJim Jagielski * or more contributor license agreements. See the NOTICE file 5*b1cdbd2cSJim Jagielski * distributed with this work for additional information 6*b1cdbd2cSJim Jagielski * regarding copyright ownership. The ASF licenses this file 7*b1cdbd2cSJim Jagielski * to you under the Apache License, Version 2.0 (the 8*b1cdbd2cSJim Jagielski * "License"); you may not use this file except in compliance 9*b1cdbd2cSJim Jagielski * with the License. You may obtain a copy of the License at 10*b1cdbd2cSJim Jagielski * 11*b1cdbd2cSJim Jagielski * http://www.apache.org/licenses/LICENSE-2.0 12*b1cdbd2cSJim Jagielski * 13*b1cdbd2cSJim Jagielski * Unless required by applicable law or agreed to in writing, 14*b1cdbd2cSJim Jagielski * software distributed under the License is distributed on an 15*b1cdbd2cSJim Jagielski * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY 16*b1cdbd2cSJim Jagielski * KIND, either express or implied. See the License for the 17*b1cdbd2cSJim Jagielski * specific language governing permissions and limitations 18*b1cdbd2cSJim Jagielski * under the License. 19*b1cdbd2cSJim Jagielski * 20*b1cdbd2cSJim Jagielski *************************************************************/ 21*b1cdbd2cSJim Jagielski 22*b1cdbd2cSJim Jagielski 23*b1cdbd2cSJim Jagielski 24*b1cdbd2cSJim Jagielski #ifndef _BGFX_POLYGON_B2DPOLYPOLYGON_HXX 25*b1cdbd2cSJim Jagielski #define _BGFX_POLYGON_B2DPOLYPOLYGON_HXX 26*b1cdbd2cSJim Jagielski 27*b1cdbd2cSJim Jagielski #include <sal/types.h> 28*b1cdbd2cSJim Jagielski #include <o3tl/cow_wrapper.hxx> 29*b1cdbd2cSJim Jagielski #include <basegfx/range/b2drange.hxx> 30*b1cdbd2cSJim Jagielski 31*b1cdbd2cSJim Jagielski // predeclarations 32*b1cdbd2cSJim Jagielski class ImplB2DPolyPolygon; 33*b1cdbd2cSJim Jagielski 34*b1cdbd2cSJim Jagielski namespace basegfx 35*b1cdbd2cSJim Jagielski { 36*b1cdbd2cSJim Jagielski class B2DPolygon; 37*b1cdbd2cSJim Jagielski class B2DHomMatrix; 38*b1cdbd2cSJim Jagielski } // end of namespace basegfx 39*b1cdbd2cSJim Jagielski 40*b1cdbd2cSJim Jagielski ////////////////////////////////////////////////////////////////////////////// 41*b1cdbd2cSJim Jagielski 42*b1cdbd2cSJim Jagielski namespace basegfx 43*b1cdbd2cSJim Jagielski { 44*b1cdbd2cSJim Jagielski class B2DPolyPolygon 45*b1cdbd2cSJim Jagielski { 46*b1cdbd2cSJim Jagielski public: 47*b1cdbd2cSJim Jagielski typedef o3tl::cow_wrapper< ImplB2DPolyPolygon > ImplType; 48*b1cdbd2cSJim Jagielski 49*b1cdbd2cSJim Jagielski private: 50*b1cdbd2cSJim Jagielski ImplType mpPolyPolygon; 51*b1cdbd2cSJim Jagielski 52*b1cdbd2cSJim Jagielski public: 53*b1cdbd2cSJim Jagielski B2DPolyPolygon(); 54*b1cdbd2cSJim Jagielski B2DPolyPolygon(const B2DPolyPolygon& rPolyPolygon); 55*b1cdbd2cSJim Jagielski explicit B2DPolyPolygon(const B2DPolygon& rPolygon); 56*b1cdbd2cSJim Jagielski ~B2DPolyPolygon(); 57*b1cdbd2cSJim Jagielski 58*b1cdbd2cSJim Jagielski // assignment operator 59*b1cdbd2cSJim Jagielski B2DPolyPolygon& operator=(const B2DPolyPolygon& rPolyPolygon); 60*b1cdbd2cSJim Jagielski 61*b1cdbd2cSJim Jagielski /// unshare this poly-polygon (and all included polygons) with all internally shared instances 62*b1cdbd2cSJim Jagielski void makeUnique(); 63*b1cdbd2cSJim Jagielski 64*b1cdbd2cSJim Jagielski // compare operators 65*b1cdbd2cSJim Jagielski bool operator==(const B2DPolyPolygon& rPolyPolygon) const; 66*b1cdbd2cSJim Jagielski bool operator!=(const B2DPolyPolygon& rPolyPolygon) const; 67*b1cdbd2cSJim Jagielski 68*b1cdbd2cSJim Jagielski // polygon interface 69*b1cdbd2cSJim Jagielski sal_uInt32 count() const; 70*b1cdbd2cSJim Jagielski 71*b1cdbd2cSJim Jagielski B2DPolygon getB2DPolygon(sal_uInt32 nIndex) const; 72*b1cdbd2cSJim Jagielski void setB2DPolygon(sal_uInt32 nIndex, const B2DPolygon& rPolygon); 73*b1cdbd2cSJim Jagielski 74*b1cdbd2cSJim Jagielski // test for curve 75*b1cdbd2cSJim Jagielski bool areControlPointsUsed() const; 76*b1cdbd2cSJim Jagielski 77*b1cdbd2cSJim Jagielski // insert/append single polygon 78*b1cdbd2cSJim Jagielski void insert(sal_uInt32 nIndex, const B2DPolygon& rPolygon, sal_uInt32 nCount = 1); 79*b1cdbd2cSJim Jagielski void append(const B2DPolygon& rPolygon, sal_uInt32 nCount = 1); 80*b1cdbd2cSJim Jagielski 81*b1cdbd2cSJim Jagielski /** Default adaptive subdivision access 82*b1cdbd2cSJim Jagielski 83*b1cdbd2cSJim Jagielski For details refer to B2DPolygon::getDefaultAdaptiveSubdivision() 84*b1cdbd2cSJim Jagielski 85*b1cdbd2cSJim Jagielski @return 86*b1cdbd2cSJim Jagielski The default subdivision of this polygon 87*b1cdbd2cSJim Jagielski */ 88*b1cdbd2cSJim Jagielski B2DPolyPolygon getDefaultAdaptiveSubdivision() const; 89*b1cdbd2cSJim Jagielski 90*b1cdbd2cSJim Jagielski /** Get the B2DRange (Rectangle dimensions) of this B2DPolyPolygon 91*b1cdbd2cSJim Jagielski 92*b1cdbd2cSJim Jagielski For details refer to B2DPolygon::getB2DRange() 93*b1cdbd2cSJim Jagielski 94*b1cdbd2cSJim Jagielski @return 95*b1cdbd2cSJim Jagielski The outer range of the bezier curve/polygon 96*b1cdbd2cSJim Jagielski */ 97*b1cdbd2cSJim Jagielski B2DRange getB2DRange() const; 98*b1cdbd2cSJim Jagielski 99*b1cdbd2cSJim Jagielski // insert/append multiple polygons 100*b1cdbd2cSJim Jagielski void insert(sal_uInt32 nIndex, const B2DPolyPolygon& rPolyPolygon); 101*b1cdbd2cSJim Jagielski void append(const B2DPolyPolygon& rPolyPolygon); 102*b1cdbd2cSJim Jagielski 103*b1cdbd2cSJim Jagielski // remove 104*b1cdbd2cSJim Jagielski void remove(sal_uInt32 nIndex, sal_uInt32 nCount = 1); 105*b1cdbd2cSJim Jagielski 106*b1cdbd2cSJim Jagielski // reset to empty state 107*b1cdbd2cSJim Jagielski void clear(); 108*b1cdbd2cSJim Jagielski 109*b1cdbd2cSJim Jagielski // closed state 110*b1cdbd2cSJim Jagielski bool isClosed() const; 111*b1cdbd2cSJim Jagielski void setClosed(bool bNew); 112*b1cdbd2cSJim Jagielski 113*b1cdbd2cSJim Jagielski // flip polygon direction 114*b1cdbd2cSJim Jagielski void flip(); 115*b1cdbd2cSJim Jagielski 116*b1cdbd2cSJim Jagielski // test if PolyPolygon has double points 117*b1cdbd2cSJim Jagielski bool hasDoublePoints() const; 118*b1cdbd2cSJim Jagielski 119*b1cdbd2cSJim Jagielski // remove double points, at the begin/end and follow-ups, too 120*b1cdbd2cSJim Jagielski void removeDoublePoints(); 121*b1cdbd2cSJim Jagielski 122*b1cdbd2cSJim Jagielski // apply transformation given in matrix form to the polygon 123*b1cdbd2cSJim Jagielski void transform(const basegfx::B2DHomMatrix& rMatrix); 124*b1cdbd2cSJim Jagielski 125*b1cdbd2cSJim Jagielski // polygon iterators (same iterator validity conditions as for vector) 126*b1cdbd2cSJim Jagielski const B2DPolygon* begin() const; 127*b1cdbd2cSJim Jagielski const B2DPolygon* end() const; 128*b1cdbd2cSJim Jagielski B2DPolygon* begin(); 129*b1cdbd2cSJim Jagielski B2DPolygon* end(); 130*b1cdbd2cSJim Jagielski }; 131*b1cdbd2cSJim Jagielski 132*b1cdbd2cSJim Jagielski // typedef for a vector of B2DPolyPolygons 133*b1cdbd2cSJim Jagielski typedef ::std::vector< B2DPolyPolygon > B2DPolyPolygonVector; 134*b1cdbd2cSJim Jagielski 135*b1cdbd2cSJim Jagielski } // end of namespace basegfx 136*b1cdbd2cSJim Jagielski 137*b1cdbd2cSJim Jagielski #endif /* _BGFX_POLYGON_B2DPOLYPOLYGON_HXX */ 138