1*cdf0e10cSrcweir /************************************************************************* 2*cdf0e10cSrcweir * 3*cdf0e10cSrcweir * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4*cdf0e10cSrcweir * 5*cdf0e10cSrcweir * Copyright 2008 by Sun Microsystems, Inc. 6*cdf0e10cSrcweir * 7*cdf0e10cSrcweir * OpenOffice.org - a multi-platform office productivity suite 8*cdf0e10cSrcweir * 9*cdf0e10cSrcweir * $RCSfile: b2dmultirange.cxx,v $ 10*cdf0e10cSrcweir * $Revision: 1.8 $ 11*cdf0e10cSrcweir * 12*cdf0e10cSrcweir * This file is part of OpenOffice.org. 13*cdf0e10cSrcweir * 14*cdf0e10cSrcweir * OpenOffice.org is free software: you can redistribute it and/or modify 15*cdf0e10cSrcweir * it under the terms of the GNU Lesser General Public License version 3 16*cdf0e10cSrcweir * only, as published by the Free Software Foundation. 17*cdf0e10cSrcweir * 18*cdf0e10cSrcweir * OpenOffice.org is distributed in the hope that it will be useful, 19*cdf0e10cSrcweir * but WITHOUT ANY WARRANTY; without even the implied warranty of 20*cdf0e10cSrcweir * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 21*cdf0e10cSrcweir * GNU Lesser General Public License version 3 for more details 22*cdf0e10cSrcweir * (a copy is included in the LICENSE file that accompanied this code). 23*cdf0e10cSrcweir * 24*cdf0e10cSrcweir * You should have received a copy of the GNU Lesser General Public License 25*cdf0e10cSrcweir * version 3 along with OpenOffice.org. If not, see 26*cdf0e10cSrcweir * <http://www.openoffice.org/license.html> 27*cdf0e10cSrcweir * for a copy of the LGPLv3 License. 28*cdf0e10cSrcweir * 29*cdf0e10cSrcweir ************************************************************************/ 30*cdf0e10cSrcweir 31*cdf0e10cSrcweir // MARKER(update_precomp.py): autogen include statement, do not remove 32*cdf0e10cSrcweir #include "precompiled_basegfx.hxx" 33*cdf0e10cSrcweir #include <basegfx/tools/b2dclipstate.hxx> 34*cdf0e10cSrcweir 35*cdf0e10cSrcweir #include <basegfx/range/b2drange.hxx> 36*cdf0e10cSrcweir #include <basegfx/range/b2dpolyrange.hxx> 37*cdf0e10cSrcweir #include <basegfx/range/b2drangeclipper.hxx> 38*cdf0e10cSrcweir #include <basegfx/polygon/b2dpolygon.hxx> 39*cdf0e10cSrcweir #include <basegfx/polygon/b2dpolygontools.hxx> 40*cdf0e10cSrcweir #include <basegfx/polygon/b2dpolypolygon.hxx> 41*cdf0e10cSrcweir #include <basegfx/polygon/b2dpolypolygontools.hxx> 42*cdf0e10cSrcweir #include <basegfx/polygon/b2dpolypolygoncutter.hxx> 43*cdf0e10cSrcweir 44*cdf0e10cSrcweir namespace basegfx 45*cdf0e10cSrcweir { 46*cdf0e10cSrcweir namespace tools 47*cdf0e10cSrcweir { 48*cdf0e10cSrcweir struct ImplB2DClipState 49*cdf0e10cSrcweir { 50*cdf0e10cSrcweir public: 51*cdf0e10cSrcweir enum Operation {UNION, INTERSECT, XOR, SUBTRACT}; 52*cdf0e10cSrcweir 53*cdf0e10cSrcweir ImplB2DClipState() : 54*cdf0e10cSrcweir maPendingPolygons(), 55*cdf0e10cSrcweir maPendingRanges(), 56*cdf0e10cSrcweir maClipPoly(), 57*cdf0e10cSrcweir mePendingOps(UNION) 58*cdf0e10cSrcweir {} 59*cdf0e10cSrcweir 60*cdf0e10cSrcweir explicit ImplB2DClipState( const B2DRange& rRange ) : 61*cdf0e10cSrcweir maPendingPolygons(), 62*cdf0e10cSrcweir maPendingRanges(), 63*cdf0e10cSrcweir maClipPoly( 64*cdf0e10cSrcweir tools::createPolygonFromRect(rRange)), 65*cdf0e10cSrcweir mePendingOps(UNION) 66*cdf0e10cSrcweir {} 67*cdf0e10cSrcweir 68*cdf0e10cSrcweir explicit ImplB2DClipState( const B2DPolygon& rPoly ) : 69*cdf0e10cSrcweir maPendingPolygons(), 70*cdf0e10cSrcweir maPendingRanges(), 71*cdf0e10cSrcweir maClipPoly(rPoly), 72*cdf0e10cSrcweir mePendingOps(UNION) 73*cdf0e10cSrcweir {} 74*cdf0e10cSrcweir 75*cdf0e10cSrcweir explicit ImplB2DClipState( const B2DPolyPolygon& rPoly ) : 76*cdf0e10cSrcweir maPendingPolygons(), 77*cdf0e10cSrcweir maPendingRanges(), 78*cdf0e10cSrcweir maClipPoly(rPoly), 79*cdf0e10cSrcweir mePendingOps(UNION) 80*cdf0e10cSrcweir {} 81*cdf0e10cSrcweir 82*cdf0e10cSrcweir bool isCleared() const 83*cdf0e10cSrcweir { 84*cdf0e10cSrcweir return !maClipPoly.count() 85*cdf0e10cSrcweir && !maPendingPolygons.count() 86*cdf0e10cSrcweir && !maPendingRanges.count(); 87*cdf0e10cSrcweir } 88*cdf0e10cSrcweir 89*cdf0e10cSrcweir void makeClear() 90*cdf0e10cSrcweir { 91*cdf0e10cSrcweir maPendingPolygons.clear(); 92*cdf0e10cSrcweir maPendingRanges.clear(); 93*cdf0e10cSrcweir maClipPoly.clear(); 94*cdf0e10cSrcweir mePendingOps = UNION; 95*cdf0e10cSrcweir } 96*cdf0e10cSrcweir 97*cdf0e10cSrcweir bool isNullClipPoly() const 98*cdf0e10cSrcweir { 99*cdf0e10cSrcweir return maClipPoly.count() == 1 100*cdf0e10cSrcweir && !maClipPoly.getB2DPolygon(0).count(); 101*cdf0e10cSrcweir } 102*cdf0e10cSrcweir 103*cdf0e10cSrcweir bool isNull() const 104*cdf0e10cSrcweir { 105*cdf0e10cSrcweir return !maPendingPolygons.count() 106*cdf0e10cSrcweir && !maPendingRanges.count() 107*cdf0e10cSrcweir && isNullClipPoly(); 108*cdf0e10cSrcweir } 109*cdf0e10cSrcweir 110*cdf0e10cSrcweir void makeNull() 111*cdf0e10cSrcweir { 112*cdf0e10cSrcweir maPendingPolygons.clear(); 113*cdf0e10cSrcweir maPendingRanges.clear(); 114*cdf0e10cSrcweir maClipPoly.clear(); 115*cdf0e10cSrcweir maClipPoly.append(B2DPolygon()); 116*cdf0e10cSrcweir mePendingOps = UNION; 117*cdf0e10cSrcweir } 118*cdf0e10cSrcweir 119*cdf0e10cSrcweir bool operator==(const ImplB2DClipState& rRHS) const 120*cdf0e10cSrcweir { 121*cdf0e10cSrcweir return maPendingPolygons == rRHS.maPendingPolygons 122*cdf0e10cSrcweir && maPendingRanges == rRHS.maPendingRanges 123*cdf0e10cSrcweir && maClipPoly == rRHS.maClipPoly 124*cdf0e10cSrcweir && mePendingOps == rRHS.mePendingOps; 125*cdf0e10cSrcweir } 126*cdf0e10cSrcweir 127*cdf0e10cSrcweir void addRange(const B2DRange& rRange, Operation eOp) 128*cdf0e10cSrcweir { 129*cdf0e10cSrcweir if( rRange.isEmpty() ) 130*cdf0e10cSrcweir return; 131*cdf0e10cSrcweir 132*cdf0e10cSrcweir commitPendingPolygons(); 133*cdf0e10cSrcweir if( mePendingOps != eOp ) 134*cdf0e10cSrcweir commitPendingRanges(); 135*cdf0e10cSrcweir 136*cdf0e10cSrcweir mePendingOps = eOp; 137*cdf0e10cSrcweir maPendingRanges.appendElement( 138*cdf0e10cSrcweir rRange, 139*cdf0e10cSrcweir ORIENTATION_POSITIVE); 140*cdf0e10cSrcweir } 141*cdf0e10cSrcweir 142*cdf0e10cSrcweir void addPolygon(B2DPolygon aPoly, Operation eOp) 143*cdf0e10cSrcweir { 144*cdf0e10cSrcweir commitPendingRanges(); 145*cdf0e10cSrcweir if( mePendingOps != eOp ) 146*cdf0e10cSrcweir commitPendingPolygons(); 147*cdf0e10cSrcweir 148*cdf0e10cSrcweir mePendingOps = eOp; 149*cdf0e10cSrcweir maPendingPolygons.append(aPoly); 150*cdf0e10cSrcweir } 151*cdf0e10cSrcweir 152*cdf0e10cSrcweir void addPolyPolygon(B2DPolyPolygon aPoly, Operation eOp) 153*cdf0e10cSrcweir { 154*cdf0e10cSrcweir commitPendingRanges(); 155*cdf0e10cSrcweir if( mePendingOps != eOp ) 156*cdf0e10cSrcweir commitPendingPolygons(); 157*cdf0e10cSrcweir 158*cdf0e10cSrcweir mePendingOps = eOp; 159*cdf0e10cSrcweir maPendingPolygons.append(aPoly); 160*cdf0e10cSrcweir } 161*cdf0e10cSrcweir 162*cdf0e10cSrcweir void addClipState(const ImplB2DClipState& rOther, Operation eOp) 163*cdf0e10cSrcweir { 164*cdf0e10cSrcweir if( rOther.mePendingOps == mePendingOps 165*cdf0e10cSrcweir && !rOther.maClipPoly.count() 166*cdf0e10cSrcweir && !rOther.maPendingPolygons.count() ) 167*cdf0e10cSrcweir { 168*cdf0e10cSrcweir maPendingRanges.appendPolyRange( rOther.maPendingRanges ); 169*cdf0e10cSrcweir } 170*cdf0e10cSrcweir else 171*cdf0e10cSrcweir { 172*cdf0e10cSrcweir commitPendingRanges(); 173*cdf0e10cSrcweir commitPendingPolygons(); 174*cdf0e10cSrcweir rOther.commitPendingRanges(); 175*cdf0e10cSrcweir rOther.commitPendingPolygons(); 176*cdf0e10cSrcweir 177*cdf0e10cSrcweir maPendingPolygons = rOther.maClipPoly; 178*cdf0e10cSrcweir mePendingOps = eOp; 179*cdf0e10cSrcweir } 180*cdf0e10cSrcweir } 181*cdf0e10cSrcweir 182*cdf0e10cSrcweir void unionRange(const B2DRange& rRange) 183*cdf0e10cSrcweir { 184*cdf0e10cSrcweir if( isCleared() ) 185*cdf0e10cSrcweir return; 186*cdf0e10cSrcweir 187*cdf0e10cSrcweir addRange(rRange,UNION); 188*cdf0e10cSrcweir } 189*cdf0e10cSrcweir 190*cdf0e10cSrcweir void unionPolygon(const B2DPolygon& rPoly) 191*cdf0e10cSrcweir { 192*cdf0e10cSrcweir if( isCleared() ) 193*cdf0e10cSrcweir return; 194*cdf0e10cSrcweir 195*cdf0e10cSrcweir addPolygon(rPoly,UNION); 196*cdf0e10cSrcweir } 197*cdf0e10cSrcweir 198*cdf0e10cSrcweir void unionPolyPolygon(const B2DPolyPolygon& rPolyPoly) 199*cdf0e10cSrcweir { 200*cdf0e10cSrcweir if( isCleared() ) 201*cdf0e10cSrcweir return; 202*cdf0e10cSrcweir 203*cdf0e10cSrcweir addPolyPolygon(rPolyPoly,UNION); 204*cdf0e10cSrcweir } 205*cdf0e10cSrcweir 206*cdf0e10cSrcweir void unionClipState(const ImplB2DClipState& rOther) 207*cdf0e10cSrcweir { 208*cdf0e10cSrcweir if( isCleared() ) 209*cdf0e10cSrcweir return; 210*cdf0e10cSrcweir 211*cdf0e10cSrcweir addClipState(rOther, UNION); 212*cdf0e10cSrcweir } 213*cdf0e10cSrcweir 214*cdf0e10cSrcweir void intersectRange(const B2DRange& rRange) 215*cdf0e10cSrcweir { 216*cdf0e10cSrcweir if( isNull() ) 217*cdf0e10cSrcweir return; 218*cdf0e10cSrcweir 219*cdf0e10cSrcweir addRange(rRange,INTERSECT); 220*cdf0e10cSrcweir } 221*cdf0e10cSrcweir 222*cdf0e10cSrcweir void intersectPolygon(const B2DPolygon& rPoly) 223*cdf0e10cSrcweir { 224*cdf0e10cSrcweir if( isNull() ) 225*cdf0e10cSrcweir return; 226*cdf0e10cSrcweir 227*cdf0e10cSrcweir addPolygon(rPoly,INTERSECT); 228*cdf0e10cSrcweir } 229*cdf0e10cSrcweir 230*cdf0e10cSrcweir void intersectPolyPolygon(const B2DPolyPolygon& rPolyPoly) 231*cdf0e10cSrcweir { 232*cdf0e10cSrcweir if( isNull() ) 233*cdf0e10cSrcweir return; 234*cdf0e10cSrcweir 235*cdf0e10cSrcweir addPolyPolygon(rPolyPoly,INTERSECT); 236*cdf0e10cSrcweir } 237*cdf0e10cSrcweir 238*cdf0e10cSrcweir void intersectClipState(const ImplB2DClipState& rOther) 239*cdf0e10cSrcweir { 240*cdf0e10cSrcweir if( isNull() ) 241*cdf0e10cSrcweir return; 242*cdf0e10cSrcweir 243*cdf0e10cSrcweir addClipState(rOther, INTERSECT); 244*cdf0e10cSrcweir } 245*cdf0e10cSrcweir 246*cdf0e10cSrcweir void subtractRange(const B2DRange& rRange ) 247*cdf0e10cSrcweir { 248*cdf0e10cSrcweir if( isNull() ) 249*cdf0e10cSrcweir return; 250*cdf0e10cSrcweir 251*cdf0e10cSrcweir addRange(rRange,SUBTRACT); 252*cdf0e10cSrcweir } 253*cdf0e10cSrcweir 254*cdf0e10cSrcweir void subtractPolygon(const B2DPolygon& rPoly) 255*cdf0e10cSrcweir { 256*cdf0e10cSrcweir if( isNull() ) 257*cdf0e10cSrcweir return; 258*cdf0e10cSrcweir 259*cdf0e10cSrcweir addPolygon(rPoly,SUBTRACT); 260*cdf0e10cSrcweir } 261*cdf0e10cSrcweir 262*cdf0e10cSrcweir void subtractPolyPolygon(const B2DPolyPolygon& rPolyPoly) 263*cdf0e10cSrcweir { 264*cdf0e10cSrcweir if( isNull() ) 265*cdf0e10cSrcweir return; 266*cdf0e10cSrcweir 267*cdf0e10cSrcweir addPolyPolygon(rPolyPoly,SUBTRACT); 268*cdf0e10cSrcweir } 269*cdf0e10cSrcweir 270*cdf0e10cSrcweir void subtractClipState(const ImplB2DClipState& rOther) 271*cdf0e10cSrcweir { 272*cdf0e10cSrcweir if( isNull() ) 273*cdf0e10cSrcweir return; 274*cdf0e10cSrcweir 275*cdf0e10cSrcweir addClipState(rOther, SUBTRACT); 276*cdf0e10cSrcweir } 277*cdf0e10cSrcweir 278*cdf0e10cSrcweir void xorRange(const B2DRange& rRange) 279*cdf0e10cSrcweir { 280*cdf0e10cSrcweir addRange(rRange,XOR); 281*cdf0e10cSrcweir } 282*cdf0e10cSrcweir 283*cdf0e10cSrcweir void xorPolygon(const B2DPolygon& rPoly) 284*cdf0e10cSrcweir { 285*cdf0e10cSrcweir addPolygon(rPoly,XOR); 286*cdf0e10cSrcweir } 287*cdf0e10cSrcweir 288*cdf0e10cSrcweir void xorPolyPolygon(const B2DPolyPolygon& rPolyPoly) 289*cdf0e10cSrcweir { 290*cdf0e10cSrcweir addPolyPolygon(rPolyPoly,XOR); 291*cdf0e10cSrcweir } 292*cdf0e10cSrcweir 293*cdf0e10cSrcweir void xorClipState(const ImplB2DClipState& rOther) 294*cdf0e10cSrcweir { 295*cdf0e10cSrcweir addClipState(rOther, XOR); 296*cdf0e10cSrcweir } 297*cdf0e10cSrcweir 298*cdf0e10cSrcweir B2DPolyPolygon getClipPoly() const 299*cdf0e10cSrcweir { 300*cdf0e10cSrcweir commitPendingRanges(); 301*cdf0e10cSrcweir commitPendingPolygons(); 302*cdf0e10cSrcweir 303*cdf0e10cSrcweir return maClipPoly; 304*cdf0e10cSrcweir } 305*cdf0e10cSrcweir 306*cdf0e10cSrcweir private: 307*cdf0e10cSrcweir void commitPendingPolygons() const 308*cdf0e10cSrcweir { 309*cdf0e10cSrcweir if( !maPendingPolygons.count() ) 310*cdf0e10cSrcweir return; 311*cdf0e10cSrcweir 312*cdf0e10cSrcweir // assumption: maClipPoly has kept polygons prepared for 313*cdf0e10cSrcweir // clipping; i.e. no neutral polygons & correct 314*cdf0e10cSrcweir // orientation 315*cdf0e10cSrcweir maPendingPolygons = tools::prepareForPolygonOperation(maPendingPolygons); 316*cdf0e10cSrcweir const bool bIsEmpty=isNullClipPoly(); 317*cdf0e10cSrcweir const bool bIsCleared=!maClipPoly.count(); 318*cdf0e10cSrcweir switch(mePendingOps) 319*cdf0e10cSrcweir { 320*cdf0e10cSrcweir case UNION: 321*cdf0e10cSrcweir OSL_ASSERT( !bIsCleared ); 322*cdf0e10cSrcweir 323*cdf0e10cSrcweir if( bIsEmpty ) 324*cdf0e10cSrcweir maClipPoly = maPendingPolygons; 325*cdf0e10cSrcweir else 326*cdf0e10cSrcweir maClipPoly = tools::solvePolygonOperationOr( 327*cdf0e10cSrcweir maClipPoly, 328*cdf0e10cSrcweir maPendingPolygons); 329*cdf0e10cSrcweir break; 330*cdf0e10cSrcweir case INTERSECT: 331*cdf0e10cSrcweir OSL_ASSERT( !bIsEmpty ); 332*cdf0e10cSrcweir 333*cdf0e10cSrcweir if( bIsCleared ) 334*cdf0e10cSrcweir maClipPoly = maPendingPolygons; 335*cdf0e10cSrcweir else 336*cdf0e10cSrcweir maClipPoly = tools::solvePolygonOperationAnd( 337*cdf0e10cSrcweir maClipPoly, 338*cdf0e10cSrcweir maPendingPolygons); 339*cdf0e10cSrcweir break; 340*cdf0e10cSrcweir case XOR: 341*cdf0e10cSrcweir if( bIsEmpty ) 342*cdf0e10cSrcweir maClipPoly = maPendingPolygons; 343*cdf0e10cSrcweir else if( bIsCleared ) 344*cdf0e10cSrcweir { 345*cdf0e10cSrcweir // not representable, strictly speaking, 346*cdf0e10cSrcweir // using polygons with the common even/odd 347*cdf0e10cSrcweir // or nonzero winding number fill rule. If 348*cdf0e10cSrcweir // we'd want to represent it, fill rule 349*cdf0e10cSrcweir // would need to be "non-negative winding 350*cdf0e10cSrcweir // number" (and we then would return 351*cdf0e10cSrcweir // 'holes' here) 352*cdf0e10cSrcweir 353*cdf0e10cSrcweir // going for an ugly hack meanwhile 354*cdf0e10cSrcweir maClipPoly = tools::solvePolygonOperationXor( 355*cdf0e10cSrcweir B2DPolyPolygon( 356*cdf0e10cSrcweir tools::createPolygonFromRect(B2DRange(-1E20,-1E20,1E20,1E20))), 357*cdf0e10cSrcweir maPendingPolygons); 358*cdf0e10cSrcweir } 359*cdf0e10cSrcweir else 360*cdf0e10cSrcweir maClipPoly = tools::solvePolygonOperationXor( 361*cdf0e10cSrcweir maClipPoly, 362*cdf0e10cSrcweir maPendingPolygons); 363*cdf0e10cSrcweir break; 364*cdf0e10cSrcweir case SUBTRACT: 365*cdf0e10cSrcweir OSL_ASSERT( !bIsEmpty ); 366*cdf0e10cSrcweir 367*cdf0e10cSrcweir // first union all pending ones, subtract en bloc then 368*cdf0e10cSrcweir maPendingPolygons = solveCrossovers(maPendingPolygons); 369*cdf0e10cSrcweir maPendingPolygons = stripNeutralPolygons(maPendingPolygons); 370*cdf0e10cSrcweir maPendingPolygons = stripDispensablePolygons(maPendingPolygons, false); 371*cdf0e10cSrcweir 372*cdf0e10cSrcweir if( bIsCleared ) 373*cdf0e10cSrcweir { 374*cdf0e10cSrcweir // not representable, strictly speaking, 375*cdf0e10cSrcweir // using polygons with the common even/odd 376*cdf0e10cSrcweir // or nonzero winding number fill rule. If 377*cdf0e10cSrcweir // we'd want to represent it, fill rule 378*cdf0e10cSrcweir // would need to be "non-negative winding 379*cdf0e10cSrcweir // number" (and we then would return 380*cdf0e10cSrcweir // 'holes' here) 381*cdf0e10cSrcweir 382*cdf0e10cSrcweir // going for an ugly hack meanwhile 383*cdf0e10cSrcweir maClipPoly = tools::solvePolygonOperationDiff( 384*cdf0e10cSrcweir B2DPolyPolygon( 385*cdf0e10cSrcweir tools::createPolygonFromRect(B2DRange(-1E20,-1E20,1E20,1E20))), 386*cdf0e10cSrcweir maPendingPolygons); 387*cdf0e10cSrcweir } 388*cdf0e10cSrcweir else 389*cdf0e10cSrcweir maClipPoly = tools::solvePolygonOperationDiff( 390*cdf0e10cSrcweir maClipPoly, 391*cdf0e10cSrcweir maPendingPolygons); 392*cdf0e10cSrcweir break; 393*cdf0e10cSrcweir } 394*cdf0e10cSrcweir 395*cdf0e10cSrcweir maPendingPolygons.clear(); 396*cdf0e10cSrcweir mePendingOps = UNION; 397*cdf0e10cSrcweir } 398*cdf0e10cSrcweir 399*cdf0e10cSrcweir void commitPendingRanges() const 400*cdf0e10cSrcweir { 401*cdf0e10cSrcweir if( !maPendingRanges.count() ) 402*cdf0e10cSrcweir return; 403*cdf0e10cSrcweir 404*cdf0e10cSrcweir // use the specialized range clipper for the win 405*cdf0e10cSrcweir B2DPolyPolygon aCollectedRanges; 406*cdf0e10cSrcweir const bool bIsEmpty=isNullClipPoly(); 407*cdf0e10cSrcweir const bool bIsCleared=!maClipPoly.count(); 408*cdf0e10cSrcweir switch(mePendingOps) 409*cdf0e10cSrcweir { 410*cdf0e10cSrcweir case UNION: 411*cdf0e10cSrcweir OSL_ASSERT( !bIsCleared ); 412*cdf0e10cSrcweir 413*cdf0e10cSrcweir aCollectedRanges = maPendingRanges.solveCrossovers(); 414*cdf0e10cSrcweir aCollectedRanges = stripNeutralPolygons(aCollectedRanges); 415*cdf0e10cSrcweir aCollectedRanges = stripDispensablePolygons(aCollectedRanges, false); 416*cdf0e10cSrcweir if( bIsEmpty ) 417*cdf0e10cSrcweir maClipPoly = aCollectedRanges; 418*cdf0e10cSrcweir else 419*cdf0e10cSrcweir maClipPoly = tools::solvePolygonOperationOr( 420*cdf0e10cSrcweir maClipPoly, 421*cdf0e10cSrcweir aCollectedRanges); 422*cdf0e10cSrcweir break; 423*cdf0e10cSrcweir case INTERSECT: 424*cdf0e10cSrcweir OSL_ASSERT( !bIsEmpty ); 425*cdf0e10cSrcweir 426*cdf0e10cSrcweir aCollectedRanges = maPendingRanges.solveCrossovers(); 427*cdf0e10cSrcweir aCollectedRanges = stripNeutralPolygons(aCollectedRanges); 428*cdf0e10cSrcweir if( maPendingRanges.count() > 1 ) 429*cdf0e10cSrcweir aCollectedRanges = stripDispensablePolygons(aCollectedRanges, true); 430*cdf0e10cSrcweir 431*cdf0e10cSrcweir if( bIsCleared ) 432*cdf0e10cSrcweir maClipPoly = aCollectedRanges; 433*cdf0e10cSrcweir else 434*cdf0e10cSrcweir maClipPoly = tools::solvePolygonOperationAnd( 435*cdf0e10cSrcweir maClipPoly, 436*cdf0e10cSrcweir aCollectedRanges); 437*cdf0e10cSrcweir break; 438*cdf0e10cSrcweir case XOR: 439*cdf0e10cSrcweir aCollectedRanges = maPendingRanges.solveCrossovers(); 440*cdf0e10cSrcweir aCollectedRanges = stripNeutralPolygons(aCollectedRanges); 441*cdf0e10cSrcweir aCollectedRanges = correctOrientations(aCollectedRanges); 442*cdf0e10cSrcweir 443*cdf0e10cSrcweir if( bIsEmpty ) 444*cdf0e10cSrcweir maClipPoly = aCollectedRanges; 445*cdf0e10cSrcweir else if( bIsCleared ) 446*cdf0e10cSrcweir { 447*cdf0e10cSrcweir // not representable, strictly speaking, 448*cdf0e10cSrcweir // using polygons with the common even/odd 449*cdf0e10cSrcweir // or nonzero winding number fill rule. If 450*cdf0e10cSrcweir // we'd want to represent it, fill rule 451*cdf0e10cSrcweir // would need to be "non-negative winding 452*cdf0e10cSrcweir // number" (and we then would return 453*cdf0e10cSrcweir // 'holes' here) 454*cdf0e10cSrcweir 455*cdf0e10cSrcweir // going for an ugly hack meanwhile 456*cdf0e10cSrcweir maClipPoly = tools::solvePolygonOperationXor( 457*cdf0e10cSrcweir B2DPolyPolygon( 458*cdf0e10cSrcweir tools::createPolygonFromRect(B2DRange(-1E20,-1E20,1E20,1E20))), 459*cdf0e10cSrcweir aCollectedRanges); 460*cdf0e10cSrcweir } 461*cdf0e10cSrcweir else 462*cdf0e10cSrcweir maClipPoly = tools::solvePolygonOperationXor( 463*cdf0e10cSrcweir maClipPoly, 464*cdf0e10cSrcweir aCollectedRanges); 465*cdf0e10cSrcweir break; 466*cdf0e10cSrcweir case SUBTRACT: 467*cdf0e10cSrcweir OSL_ASSERT( !bIsEmpty ); 468*cdf0e10cSrcweir 469*cdf0e10cSrcweir // first union all pending ranges, subtract en bloc then 470*cdf0e10cSrcweir aCollectedRanges = maPendingRanges.solveCrossovers(); 471*cdf0e10cSrcweir aCollectedRanges = stripNeutralPolygons(aCollectedRanges); 472*cdf0e10cSrcweir aCollectedRanges = stripDispensablePolygons(aCollectedRanges, false); 473*cdf0e10cSrcweir 474*cdf0e10cSrcweir if( bIsCleared ) 475*cdf0e10cSrcweir { 476*cdf0e10cSrcweir // not representable, strictly speaking, 477*cdf0e10cSrcweir // using polygons with the common even/odd 478*cdf0e10cSrcweir // or nonzero winding number fill rule. If 479*cdf0e10cSrcweir // we'd want to represent it, fill rule 480*cdf0e10cSrcweir // would need to be "non-negative winding 481*cdf0e10cSrcweir // number" (and we then would return 482*cdf0e10cSrcweir // 'holes' here) 483*cdf0e10cSrcweir 484*cdf0e10cSrcweir // going for an ugly hack meanwhile 485*cdf0e10cSrcweir maClipPoly = tools::solvePolygonOperationDiff( 486*cdf0e10cSrcweir B2DPolyPolygon( 487*cdf0e10cSrcweir tools::createPolygonFromRect(B2DRange(-1E20,-1E20,1E20,1E20))), 488*cdf0e10cSrcweir aCollectedRanges); 489*cdf0e10cSrcweir } 490*cdf0e10cSrcweir else 491*cdf0e10cSrcweir maClipPoly = tools::solvePolygonOperationDiff( 492*cdf0e10cSrcweir maClipPoly, 493*cdf0e10cSrcweir aCollectedRanges); 494*cdf0e10cSrcweir break; 495*cdf0e10cSrcweir } 496*cdf0e10cSrcweir 497*cdf0e10cSrcweir maPendingRanges.clear(); 498*cdf0e10cSrcweir mePendingOps = UNION; 499*cdf0e10cSrcweir } 500*cdf0e10cSrcweir 501*cdf0e10cSrcweir mutable B2DPolyPolygon maPendingPolygons; 502*cdf0e10cSrcweir mutable B2DPolyRange maPendingRanges; 503*cdf0e10cSrcweir mutable B2DPolyPolygon maClipPoly; 504*cdf0e10cSrcweir mutable Operation mePendingOps; 505*cdf0e10cSrcweir }; 506*cdf0e10cSrcweir 507*cdf0e10cSrcweir B2DClipState::B2DClipState() : 508*cdf0e10cSrcweir mpImpl() 509*cdf0e10cSrcweir {} 510*cdf0e10cSrcweir 511*cdf0e10cSrcweir B2DClipState::~B2DClipState() 512*cdf0e10cSrcweir {} 513*cdf0e10cSrcweir 514*cdf0e10cSrcweir B2DClipState::B2DClipState( const B2DClipState& rOrig ) : 515*cdf0e10cSrcweir mpImpl(rOrig.mpImpl) 516*cdf0e10cSrcweir {} 517*cdf0e10cSrcweir 518*cdf0e10cSrcweir B2DClipState::B2DClipState( const B2DRange& rRange ) : 519*cdf0e10cSrcweir mpImpl( ImplB2DClipState(rRange) ) 520*cdf0e10cSrcweir {} 521*cdf0e10cSrcweir 522*cdf0e10cSrcweir B2DClipState::B2DClipState( const B2DPolygon& rPoly ) : 523*cdf0e10cSrcweir mpImpl( ImplB2DClipState(rPoly) ) 524*cdf0e10cSrcweir {} 525*cdf0e10cSrcweir 526*cdf0e10cSrcweir B2DClipState::B2DClipState( const B2DPolyPolygon& rPolyPoly ) : 527*cdf0e10cSrcweir mpImpl( ImplB2DClipState(rPolyPoly) ) 528*cdf0e10cSrcweir {} 529*cdf0e10cSrcweir 530*cdf0e10cSrcweir B2DClipState& B2DClipState::operator=( const B2DClipState& rRHS ) 531*cdf0e10cSrcweir { 532*cdf0e10cSrcweir mpImpl = rRHS.mpImpl; 533*cdf0e10cSrcweir return *this; 534*cdf0e10cSrcweir } 535*cdf0e10cSrcweir 536*cdf0e10cSrcweir void B2DClipState::makeUnique() 537*cdf0e10cSrcweir { 538*cdf0e10cSrcweir mpImpl.make_unique(); 539*cdf0e10cSrcweir } 540*cdf0e10cSrcweir 541*cdf0e10cSrcweir void B2DClipState::makeNull() 542*cdf0e10cSrcweir { 543*cdf0e10cSrcweir mpImpl->makeNull(); 544*cdf0e10cSrcweir } 545*cdf0e10cSrcweir 546*cdf0e10cSrcweir bool B2DClipState::isNull() const 547*cdf0e10cSrcweir { 548*cdf0e10cSrcweir return mpImpl->isNull(); 549*cdf0e10cSrcweir } 550*cdf0e10cSrcweir 551*cdf0e10cSrcweir void B2DClipState::makeClear() 552*cdf0e10cSrcweir { 553*cdf0e10cSrcweir mpImpl->makeClear(); 554*cdf0e10cSrcweir } 555*cdf0e10cSrcweir 556*cdf0e10cSrcweir bool B2DClipState::isCleared() const 557*cdf0e10cSrcweir { 558*cdf0e10cSrcweir return mpImpl->isCleared(); 559*cdf0e10cSrcweir } 560*cdf0e10cSrcweir 561*cdf0e10cSrcweir bool B2DClipState::operator==(const B2DClipState& rRHS) const 562*cdf0e10cSrcweir { 563*cdf0e10cSrcweir if(mpImpl.same_object(rRHS.mpImpl)) 564*cdf0e10cSrcweir return true; 565*cdf0e10cSrcweir 566*cdf0e10cSrcweir return ((*mpImpl) == (*rRHS.mpImpl)); 567*cdf0e10cSrcweir } 568*cdf0e10cSrcweir 569*cdf0e10cSrcweir bool B2DClipState::operator!=(const B2DClipState& rRHS) const 570*cdf0e10cSrcweir { 571*cdf0e10cSrcweir return !(*this == rRHS); 572*cdf0e10cSrcweir } 573*cdf0e10cSrcweir 574*cdf0e10cSrcweir void B2DClipState::unionRange(const B2DRange& rRange) 575*cdf0e10cSrcweir { 576*cdf0e10cSrcweir mpImpl->unionRange(rRange); 577*cdf0e10cSrcweir } 578*cdf0e10cSrcweir 579*cdf0e10cSrcweir void B2DClipState::unionPolygon(const B2DPolygon& rPoly) 580*cdf0e10cSrcweir { 581*cdf0e10cSrcweir mpImpl->unionPolygon(rPoly); 582*cdf0e10cSrcweir } 583*cdf0e10cSrcweir 584*cdf0e10cSrcweir void B2DClipState::unionPolyPolygon(const B2DPolyPolygon& rPolyPoly) 585*cdf0e10cSrcweir { 586*cdf0e10cSrcweir mpImpl->unionPolyPolygon(rPolyPoly); 587*cdf0e10cSrcweir } 588*cdf0e10cSrcweir 589*cdf0e10cSrcweir void B2DClipState::unionClipState(const B2DClipState& rState) 590*cdf0e10cSrcweir { 591*cdf0e10cSrcweir mpImpl->unionClipState(*rState.mpImpl); 592*cdf0e10cSrcweir } 593*cdf0e10cSrcweir 594*cdf0e10cSrcweir void B2DClipState::intersectRange(const B2DRange& rRange) 595*cdf0e10cSrcweir { 596*cdf0e10cSrcweir mpImpl->intersectRange(rRange); 597*cdf0e10cSrcweir } 598*cdf0e10cSrcweir 599*cdf0e10cSrcweir void B2DClipState::intersectPolygon(const B2DPolygon& rPoly) 600*cdf0e10cSrcweir { 601*cdf0e10cSrcweir mpImpl->intersectPolygon(rPoly); 602*cdf0e10cSrcweir } 603*cdf0e10cSrcweir 604*cdf0e10cSrcweir void B2DClipState::intersectPolyPolygon(const B2DPolyPolygon& rPolyPoly) 605*cdf0e10cSrcweir { 606*cdf0e10cSrcweir mpImpl->intersectPolyPolygon(rPolyPoly); 607*cdf0e10cSrcweir } 608*cdf0e10cSrcweir 609*cdf0e10cSrcweir void B2DClipState::intersectClipState(const B2DClipState& rState) 610*cdf0e10cSrcweir { 611*cdf0e10cSrcweir mpImpl->intersectClipState(*rState.mpImpl); 612*cdf0e10cSrcweir } 613*cdf0e10cSrcweir 614*cdf0e10cSrcweir void B2DClipState::subtractRange(const B2DRange& rRange) 615*cdf0e10cSrcweir { 616*cdf0e10cSrcweir mpImpl->subtractRange(rRange); 617*cdf0e10cSrcweir } 618*cdf0e10cSrcweir 619*cdf0e10cSrcweir void B2DClipState::subtractPolygon(const B2DPolygon& rPoly) 620*cdf0e10cSrcweir { 621*cdf0e10cSrcweir mpImpl->subtractPolygon(rPoly); 622*cdf0e10cSrcweir } 623*cdf0e10cSrcweir 624*cdf0e10cSrcweir void B2DClipState::subtractPolyPolygon(const B2DPolyPolygon& rPolyPoly) 625*cdf0e10cSrcweir { 626*cdf0e10cSrcweir mpImpl->subtractPolyPolygon(rPolyPoly); 627*cdf0e10cSrcweir } 628*cdf0e10cSrcweir 629*cdf0e10cSrcweir void B2DClipState::subtractClipState(const B2DClipState& rState) 630*cdf0e10cSrcweir { 631*cdf0e10cSrcweir mpImpl->subtractClipState(*rState.mpImpl); 632*cdf0e10cSrcweir } 633*cdf0e10cSrcweir 634*cdf0e10cSrcweir void B2DClipState::xorRange(const B2DRange& rRange) 635*cdf0e10cSrcweir { 636*cdf0e10cSrcweir mpImpl->xorRange(rRange); 637*cdf0e10cSrcweir } 638*cdf0e10cSrcweir 639*cdf0e10cSrcweir void B2DClipState::xorPolygon(const B2DPolygon& rPoly) 640*cdf0e10cSrcweir { 641*cdf0e10cSrcweir mpImpl->xorPolygon(rPoly); 642*cdf0e10cSrcweir } 643*cdf0e10cSrcweir 644*cdf0e10cSrcweir void B2DClipState::xorPolyPolygon(const B2DPolyPolygon& rPolyPoly) 645*cdf0e10cSrcweir { 646*cdf0e10cSrcweir mpImpl->xorPolyPolygon(rPolyPoly); 647*cdf0e10cSrcweir } 648*cdf0e10cSrcweir 649*cdf0e10cSrcweir void B2DClipState::xorClipState(const B2DClipState& rState) 650*cdf0e10cSrcweir { 651*cdf0e10cSrcweir mpImpl->xorClipState(*rState.mpImpl); 652*cdf0e10cSrcweir } 653*cdf0e10cSrcweir 654*cdf0e10cSrcweir B2DPolyPolygon B2DClipState::getClipPoly() const 655*cdf0e10cSrcweir { 656*cdf0e10cSrcweir return mpImpl->getClipPoly(); 657*cdf0e10cSrcweir } 658*cdf0e10cSrcweir 659*cdf0e10cSrcweir } // end of namespace tools 660*cdf0e10cSrcweir } // end of namespace basegfx 661*cdf0e10cSrcweir 662*cdf0e10cSrcweir // eof 663