tools/source/generic/poly2.cxx

   1 /*************************************************************************
   2  *
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * Copyright 2008 by Sun Microsystems, Inc.
   6  *
   7  * OpenOffice.org - a multi-platform office productivity suite
   8  *
   9  * $RCSfile: poly2.cxx,v $
  10  * $Revision: 1.23 $
  11  *
  12  * This file is part of OpenOffice.org.
  13  *
  14  * OpenOffice.org is free software: you can redistribute it and/or modify
  15  * it under the terms of the GNU Lesser General Public License version 3
  16  * only, as published by the Free Software Foundation.
  17  *
  18  * OpenOffice.org is distributed in the hope that it will be useful,
  19  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  20  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  21  * GNU Lesser General Public License version 3 for more details
  22  * (a copy is included in the LICENSE file that accompanied this code).
  23  *
  24  * You should have received a copy of the GNU Lesser General Public License
  25  * version 3 along with OpenOffice.org.  If not, see
  26  * <http://www.openoffice.org/license.html>
  27  * for a copy of the LGPLv3 License.
  28  *
  29  ************************************************************************/
  30
  31 // MARKER(update_precomp.py): autogen include statement, do not remove
  32 #include "precompiled_tools.hxx"
  33
  34 #define _SV_POLY2_CXX
  35
  36 #define POLY_CLIP_INT   0
  37 #define POLY_CLIP_UNION 1
  38 #define POLY_CLIP_DIFF  2
  39 #define POLY_CLIP_XOR   3
  40
  41 #include <rtl/math.hxx>
  42 #include <poly.h>
  43 #include <tools/poly.hxx>
  44 #include <tools/debug.hxx>
  45 #include <tools/stream.hxx>
  46 #include <tools/vcompat.hxx>
  47 #include <basegfx/polygon/b2dpolypolygon.hxx>
  48 #include <basegfx/polygon/b2dpolygon.hxx>
  49 #include <basegfx/polygon/b2dpolypolygoncutter.hxx>
  50
  51 // ---------------
  52 // - PolyPolygon -
  53 // ---------------
  54
  55 DBG_NAME( PolyPolygon )
  56
  57 // -----------------------------------------------------------------------
  58
  59 ImplPolyPolygon::ImplPolyPolygon( USHORT nInitSize )
  60 {
  61     mnRefCount  = 1;
  62     mnCount     = nInitSize;
  63     mnSize              = nInitSize;
  64     mnResize    = 16;
  65     mpPolyAry   = new SVPPOLYGON[ nInitSize ];
  66 }
  67
  68 // -----------------------------------------------------------------------
  69
  70 ImplPolyPolygon::ImplPolyPolygon( const ImplPolyPolygon& rImplPolyPoly )
  71 {
  72     mnRefCount  = 1;
  73     mnCount     = rImplPolyPoly.mnCount;
  74     mnSize              = rImplPolyPoly.mnSize;
  75     mnResize    = rImplPolyPoly.mnResize;
  76
  77     if ( rImplPolyPoly.mpPolyAry )
  78     {
  79         mpPolyAry = new SVPPOLYGON[mnSize];
  80         for ( USHORT i = 0; i < mnCount; i++ )
  81             mpPolyAry[i] = new Polygon( *rImplPolyPoly.mpPolyAry[i] );
  82     }
  83     else
  84         mpPolyAry = NULL;
  85 }
  86
  87 // -----------------------------------------------------------------------
  88
  89 ImplPolyPolygon::~ImplPolyPolygon()
  90 {
  91     if ( mpPolyAry )
  92     {
  93         for ( USHORT i = 0; i < mnCount; i++ )
  94             delete mpPolyAry[i];
  95         delete[] mpPolyAry;
  96     }
  97 }
  98
  99 // =======================================================================
 100
 101 PolyPolygon::PolyPolygon( USHORT nInitSize, USHORT nResize )
 102 {
 103     DBG_CTOR( PolyPolygon, NULL );
 104
 105     if ( nInitSize > MAX_POLYGONS )
 106         nInitSize = MAX_POLYGONS;
 107     else if ( !nInitSize )
 108         nInitSize = 1;
 109     if ( nResize > MAX_POLYGONS )
 110         nResize = MAX_POLYGONS;
 111     else if ( !nResize )
 112         nResize = 1;
 113     mpImplPolyPolygon = new ImplPolyPolygon( nInitSize, nResize );
 114 }
 115
 116 // -----------------------------------------------------------------------
 117
 118 PolyPolygon::PolyPolygon( const Polygon& rPoly )
 119 {
 120     DBG_CTOR( PolyPolygon, NULL );
 121
 122     if ( rPoly.GetSize() )
 123     {
 124         mpImplPolyPolygon = new ImplPolyPolygon( 1 );
 125         mpImplPolyPolygon->mpPolyAry[0] = new Polygon( rPoly );
 126     }
 127     else
 128         mpImplPolyPolygon = new ImplPolyPolygon( 16, 16 );
 129 }
 130
 131 // -----------------------------------------------------------------------
 132
 133 PolyPolygon::PolyPolygon( USHORT nPoly, const USHORT* pPointCountAry,
 134                           const Point* pPtAry )
 135 {
 136     DBG_CTOR( PolyPolygon, NULL );
 137
 138     if ( nPoly > MAX_POLYGONS )
 139         nPoly = MAX_POLYGONS;
 140
 141     mpImplPolyPolygon = new ImplPolyPolygon( nPoly );
 142     for ( USHORT i = 0; i < nPoly; i++ )
 143     {
 144         mpImplPolyPolygon->mpPolyAry[i] = new Polygon( *pPointCountAry, pPtAry );
 145         pPtAry += *pPointCountAry;
 146         pPointCountAry++;
 147     }
 148 }
 149
 150 // -----------------------------------------------------------------------
 151
 152 PolyPolygon::PolyPolygon( const PolyPolygon& rPolyPoly )
 153 {
 154     DBG_CTOR( PolyPolygon, NULL );
 155     DBG_CHKOBJ( &rPolyPoly, PolyPolygon, NULL );
 156     DBG_ASSERT( rPolyPoly.mpImplPolyPolygon->mnRefCount < 0xFFFFFFFE, "PolyPolygon: RefCount overflow" );
 157
 158     mpImplPolyPolygon = rPolyPoly.mpImplPolyPolygon;
 159     mpImplPolyPolygon->mnRefCount++;
 160 }
 161
 162 // -----------------------------------------------------------------------
 163
 164 PolyPolygon::~PolyPolygon()
 165 {
 166     DBG_DTOR( PolyPolygon, NULL );
 167
 168     if ( mpImplPolyPolygon->mnRefCount > 1 )
 169         mpImplPolyPolygon->mnRefCount--;
 170     else
 171         delete mpImplPolyPolygon;
 172 }
 173
 174 // -----------------------------------------------------------------------
 175
 176 void PolyPolygon::Insert( const Polygon& rPoly, USHORT nPos )
 177 {
 178     DBG_CHKTHIS( PolyPolygon, NULL );
 179
 180     if ( mpImplPolyPolygon->mnCount >= MAX_POLYGONS )
 181         return;
 182
 183     if ( mpImplPolyPolygon->mnRefCount > 1 )
 184     {
 185         mpImplPolyPolygon->mnRefCount--;
 186         mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon );
 187     }
 188
 189     if ( nPos > mpImplPolyPolygon->mnCount )
 190         nPos = mpImplPolyPolygon->mnCount;
 191
 192     if ( !mpImplPolyPolygon->mpPolyAry )
 193         mpImplPolyPolygon->mpPolyAry = new SVPPOLYGON[mpImplPolyPolygon->mnSize];
 194     else if ( mpImplPolyPolygon->mnCount == mpImplPolyPolygon->mnSize )
 195     {
 196         USHORT          nOldSize = mpImplPolyPolygon->mnSize;
 197         USHORT          nNewSize = nOldSize + mpImplPolyPolygon->mnResize;
 198         SVPPOLYGON* pNewAry;
 199
 200         if ( nNewSize >= MAX_POLYGONS )
 201             nNewSize = MAX_POLYGONS;
 202         pNewAry = new SVPPOLYGON[nNewSize];
 203         memcpy( pNewAry, mpImplPolyPolygon->mpPolyAry, nPos*sizeof(SVPPOLYGON) );
 204         memcpy( pNewAry+nPos+1, mpImplPolyPolygon->mpPolyAry+nPos,
 205                 (nOldSize-nPos)*sizeof(SVPPOLYGON) );
 206         delete[] mpImplPolyPolygon->mpPolyAry;
 207         mpImplPolyPolygon->mpPolyAry = pNewAry;
 208         mpImplPolyPolygon->mnSize = nNewSize;
 209     }
 210     else if ( nPos < mpImplPolyPolygon->mnCount )
 211     {
 212         memmove( mpImplPolyPolygon->mpPolyAry+nPos+1,
 213                  mpImplPolyPolygon->mpPolyAry+nPos,
 214                  (mpImplPolyPolygon->mnCount-nPos)*sizeof(SVPPOLYGON) );
 215     }
 216
 217     mpImplPolyPolygon->mpPolyAry[nPos] = new Polygon( rPoly );
 218     mpImplPolyPolygon->mnCount++;
 219 }
 220
 221 // -----------------------------------------------------------------------
 222
 223 void PolyPolygon::Remove( USHORT nPos )
 224 {
 225     DBG_CHKTHIS( PolyPolygon, NULL );
 226     DBG_ASSERT( nPos < Count(), "PolyPolygon::Remove(): nPos >= nSize" );
 227
 228     if ( mpImplPolyPolygon->mnRefCount > 1 )
 229     {
 230         mpImplPolyPolygon->mnRefCount--;
 231         mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon );
 232     }
 233
 234     delete mpImplPolyPolygon->mpPolyAry[nPos];
 235     mpImplPolyPolygon->mnCount--;
 236     memmove( mpImplPolyPolygon->mpPolyAry+nPos,
 237              mpImplPolyPolygon->mpPolyAry+nPos+1,
 238              (mpImplPolyPolygon->mnCount-nPos)*sizeof(SVPPOLYGON) );
 239 }
 240
 241 // -----------------------------------------------------------------------
 242
 243 void PolyPolygon::Replace( const Polygon& rPoly, USHORT nPos )
 244 {
 245     DBG_CHKTHIS( PolyPolygon, NULL );
 246     DBG_ASSERT( nPos < Count(), "PolyPolygon::Replace(): nPos >= nSize" );
 247
 248     if ( mpImplPolyPolygon->mnRefCount > 1 )
 249     {
 250         mpImplPolyPolygon->mnRefCount--;
 251         mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon );
 252     }
 253
 254     delete mpImplPolyPolygon->mpPolyAry[nPos];
 255     mpImplPolyPolygon->mpPolyAry[nPos] = new Polygon( rPoly );
 256 }
 257
 258 // -----------------------------------------------------------------------
 259
 260 const Polygon& PolyPolygon::GetObject( USHORT nPos ) const
 261 {
 262     DBG_CHKTHIS( PolyPolygon, NULL );
 263     DBG_ASSERT( nPos < Count(), "PolyPolygon::GetObject(): nPos >= nSize" );
 264
 265     return *(mpImplPolyPolygon->mpPolyAry[nPos]);
 266 }
 267
 268 // -----------------------------------------------------------------------
 269
 270 BOOL PolyPolygon::IsRect() const
 271 {
 272     BOOL bIsRect = FALSE;
 273     if ( Count() == 1 )
 274         bIsRect = mpImplPolyPolygon->mpPolyAry[ 0 ]->IsRect();
 275     return bIsRect;
 276 }
 277
 278 // -----------------------------------------------------------------------
 279
 280 void PolyPolygon::Clear()
 281 {
 282     DBG_CHKTHIS( PolyPolygon, NULL );
 283
 284     if ( mpImplPolyPolygon->mnRefCount > 1 )
 285     {
 286         mpImplPolyPolygon->mnRefCount--;
 287         mpImplPolyPolygon = new ImplPolyPolygon( mpImplPolyPolygon->mnResize,
 288                                                  mpImplPolyPolygon->mnResize );
 289     }
 290     else
 291     {
 292         if ( mpImplPolyPolygon->mpPolyAry )
 293         {
 294             for ( USHORT i = 0; i < mpImplPolyPolygon->mnCount; i++ )
 295                 delete mpImplPolyPolygon->mpPolyAry[i];
 296             delete[] mpImplPolyPolygon->mpPolyAry;
 297             mpImplPolyPolygon->mpPolyAry = NULL;
 298             mpImplPolyPolygon->mnCount   = 0;
 299             mpImplPolyPolygon->mnSize    = mpImplPolyPolygon->mnResize;
 300         }
 301     }
 302 }
 303
 304 // -----------------------------------------------------------------------
 305
 306 void PolyPolygon::Optimize( ULONG nOptimizeFlags, const PolyOptimizeData* pData )
 307 {
 308     DBG_CHKTHIS( PolyPolygon, NULL );
 309
 310     if( nOptimizeFlags )
 311     {
 312         double          fArea;
 313         const BOOL      bEdges = ( nOptimizeFlags & POLY_OPTIMIZE_EDGES ) == POLY_OPTIMIZE_EDGES;
 314         USHORT          nPercent = 0;
 315
 316         if( bEdges )
 317         {
 318             const Rectangle aBound( GetBoundRect() );
 319
 320             fArea = ( aBound.GetWidth() + aBound.GetHeight() ) * 0.5;
 321             nPercent = pData ? pData->GetPercentValue() : 50;
 322             nOptimizeFlags &= ~POLY_OPTIMIZE_EDGES;
 323         }
 324
 325         // watch for ref counter
 326         if( mpImplPolyPolygon->mnRefCount > 1 )
 327         {
 328             mpImplPolyPolygon->mnRefCount--;
 329             mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon );
 330         }
 331
 332         // Optimize polygons
 333         for( USHORT i = 0, nPolyCount = mpImplPolyPolygon->mnCount; i < nPolyCount; i++ )
 334         {
 335             if( bEdges )
 336             {
 337                 mpImplPolyPolygon->mpPolyAry[ i ]->Optimize( POLY_OPTIMIZE_NO_SAME );
 338                 Polygon::ImplReduceEdges( *( mpImplPolyPolygon->mpPolyAry[ i ] ), fArea, nPercent );
 339             }
 340
 341             if( nOptimizeFlags )
 342                 mpImplPolyPolygon->mpPolyAry[ i ]->Optimize( nOptimizeFlags, pData );
 343         }
 344     }
 345 }
 346
 347 // -----------------------------------------------------------------------
 348
 349 void PolyPolygon::GetSimple( PolyPolygon& rResult ) const
 350 {
 351     DBG_CHKTHIS( PolyPolygon, NULL );
 352
 353     rResult.Clear();
 354
 355     Polygon aPolygon;
 356
 357     for( USHORT i = 0; i < mpImplPolyPolygon->mnCount; i++ )
 358     {
 359         mpImplPolyPolygon->mpPolyAry[ i ]->GetSimple( aPolygon );
 360         rResult.Insert( aPolygon );
 361     }
 362 }
 363
 364 // -----------------------------------------------------------------------
 365
 366 void PolyPolygon::AdaptiveSubdivide( PolyPolygon& rResult, const double d ) const
 367 {
 368     DBG_CHKTHIS( PolyPolygon, NULL );
 369
 370     rResult.Clear();
 371
 372     Polygon aPolygon;
 373
 374     for( USHORT i = 0; i < mpImplPolyPolygon->mnCount; i++ )
 375     {
 376         mpImplPolyPolygon->mpPolyAry[ i ]->AdaptiveSubdivide( aPolygon, d );
 377         rResult.Insert( aPolygon );
 378     }
 379 }
 380
 381 // -----------------------------------------------------------------------
 382
 383 void PolyPolygon::GetIntersection( const PolyPolygon& rPolyPoly, PolyPolygon& rResult ) const
 384 {
 385     ImplDoOperation( rPolyPoly, rResult, POLY_CLIP_INT );
 386 }
 387
 388 // -----------------------------------------------------------------------
 389
 390 void PolyPolygon::GetUnion( const PolyPolygon& rPolyPoly, PolyPolygon& rResult ) const
 391 {
 392     ImplDoOperation( rPolyPoly, rResult, POLY_CLIP_UNION );
 393 }
 394
 395 // -----------------------------------------------------------------------
 396
 397 void PolyPolygon::GetDifference( const PolyPolygon& rPolyPoly, PolyPolygon& rResult ) const
 398 {
 399     ImplDoOperation( rPolyPoly, rResult, POLY_CLIP_DIFF );
 400 }
 401
 402 // -----------------------------------------------------------------------
 403
 404 void PolyPolygon::GetXOR( const PolyPolygon& rPolyPoly, PolyPolygon& rResult ) const
 405 {
 406     ImplDoOperation( rPolyPoly, rResult, POLY_CLIP_XOR );
 407 }
 408
 409 // -----------------------------------------------------------------------
 410
 411 void PolyPolygon::ImplDoOperation( const PolyPolygon& rPolyPoly, PolyPolygon& rResult, ULONG nOperation ) const
 412 {
 413     // Convert to B2DPolyPolygon, temporarily. It might be
 414     // advantageous in the future, to have a PolyPolygon adaptor that
 415     // just simulates a B2DPolyPolygon here...
 416     basegfx::B2DPolyPolygon aMergePolyPolygonA( getB2DPolyPolygon() );
 417     basegfx::B2DPolyPolygon aMergePolyPolygonB( rPolyPoly.getB2DPolyPolygon() );
 418
 419     // normalize the two polypolygons before. Force properly oriented
 420     // polygons.
 421     aMergePolyPolygonA = basegfx::tools::prepareForPolygonOperation( aMergePolyPolygonA );
 422     aMergePolyPolygonB = basegfx::tools::prepareForPolygonOperation( aMergePolyPolygonB );
 423
 424     switch( nOperation )
 425     {
 426         // All code extracted from svx/source/svdraw/svedtv2.cxx
 427         // -----------------------------------------------------
 428
 429         case POLY_CLIP_UNION:
 430         {
 431             // merge A and B (OR)
 432             aMergePolyPolygonA = basegfx::tools::solvePolygonOperationOr(aMergePolyPolygonA, aMergePolyPolygonB);
 433             break;
 434         }
 435
 436         case POLY_CLIP_DIFF:
 437         {
 438             // substract B from A (DIFF)
 439             aMergePolyPolygonA = basegfx::tools::solvePolygonOperationDiff(aMergePolyPolygonA, aMergePolyPolygonB);
 440             break;
 441         }
 442
 443         case POLY_CLIP_XOR:
 444         {
 445             // compute XOR between poly A and B
 446             aMergePolyPolygonA = basegfx::tools::solvePolygonOperationXor(aMergePolyPolygonA, aMergePolyPolygonB);
 447             break;
 448         }
 449
 450         default:
 451         case POLY_CLIP_INT:
 452         {
 453             // cut poly 1 against polys 2..n (AND)
 454             aMergePolyPolygonA = basegfx::tools::solvePolygonOperationAnd(aMergePolyPolygonA, aMergePolyPolygonB);
 455             break;
 456         }
 457     }
 458
 459     rResult = PolyPolygon( aMergePolyPolygonA );
 460 }
 461
 462 // -----------------------------------------------------------------------
 463
 464 USHORT PolyPolygon::Count() const
 465 {
 466     DBG_CHKTHIS( PolyPolygon, NULL );
 467     return mpImplPolyPolygon->mnCount;
 468 }
 469
 470 // -----------------------------------------------------------------------
 471
 472 void PolyPolygon::Move( long nHorzMove, long nVertMove )
 473 {
 474     DBG_CHKTHIS( PolyPolygon, NULL );
 475
 476     // Diese Abfrage sollte man fuer die DrawEngine durchfuehren
 477     if( nHorzMove || nVertMove )
 478     {
 479         // Referenzcounter beruecksichtigen
 480         if ( mpImplPolyPolygon->mnRefCount > 1 )
 481         {
 482             mpImplPolyPolygon->mnRefCount--;
 483             mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon );
 484         }
 485
 486         // Punkte verschieben
 487         USHORT nPolyCount = mpImplPolyPolygon->mnCount;
 488         for ( USHORT i = 0; i < nPolyCount; i++ )
 489             mpImplPolyPolygon->mpPolyAry[i]->Move( nHorzMove, nVertMove );
 490     }
 491 }
 492
 493 // -----------------------------------------------------------------------
 494
 495 void PolyPolygon::Translate( const Point& rTrans )
 496 {
 497     DBG_CHKTHIS( PolyPolygon, NULL );
 498
 499     // Referenzcounter beruecksichtigen
 500     if( mpImplPolyPolygon->mnRefCount > 1 )
 501     {
 502         mpImplPolyPolygon->mnRefCount--;
 503         mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon );
 504     }
 505
 506     // Punkte verschieben
 507     for ( USHORT i = 0, nCount = mpImplPolyPolygon->mnCount; i < nCount; i++ )
 508         mpImplPolyPolygon->mpPolyAry[ i ]->Translate( rTrans );
 509 }
 510
 511 // -----------------------------------------------------------------------
 512
 513 void PolyPolygon::Scale( double fScaleX, double fScaleY )
 514 {
 515     DBG_CHKTHIS( PolyPolygon, NULL );
 516
 517     // Referenzcounter beruecksichtigen
 518     if( mpImplPolyPolygon->mnRefCount > 1 )
 519     {
 520         mpImplPolyPolygon->mnRefCount--;
 521         mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon );
 522     }
 523
 524     // Punkte verschieben
 525     for ( USHORT i = 0, nCount = mpImplPolyPolygon->mnCount; i < nCount; i++ )
 526         mpImplPolyPolygon->mpPolyAry[ i ]->Scale( fScaleX, fScaleY );
 527 }
 528
 529 // -----------------------------------------------------------------------
 530
 531 void PolyPolygon::Rotate( const Point& rCenter, USHORT nAngle10 )
 532 {
 533     DBG_CHKTHIS( PolyPolygon, NULL );
 534     nAngle10 %= 3600;
 535
 536     if( nAngle10 )
 537     {
 538         const double fAngle = F_PI1800 * nAngle10;
 539         Rotate( rCenter, sin( fAngle ), cos( fAngle ) );
 540     }
 541 }
 542
 543 // -----------------------------------------------------------------------
 544
 545 void PolyPolygon::Rotate( const Point& rCenter, double fSin, double fCos )
 546 {
 547     DBG_CHKTHIS( PolyPolygon, NULL );
 548
 549     // Referenzcounter beruecksichtigen
 550     if( mpImplPolyPolygon->mnRefCount > 1 )
 551     {
 552         mpImplPolyPolygon->mnRefCount--;
 553         mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon );
 554     }
 555
 556     // Punkte verschieben
 557     for ( USHORT i = 0, nCount = mpImplPolyPolygon->mnCount; i < nCount; i++ )
 558         mpImplPolyPolygon->mpPolyAry[ i ]->Rotate( rCenter, fSin, fCos );
 559 }
 560
 561 // -----------------------------------------------------------------------
 562
 563 void PolyPolygon::SlantX( long nYRef, double fSin, double fCos )
 564 {
 565     DBG_CHKTHIS( PolyPolygon, NULL );
 566
 567     // Referenzcounter beruecksichtigen
 568     if( mpImplPolyPolygon->mnRefCount > 1 )
 569     {
 570         mpImplPolyPolygon->mnRefCount--;
 571         mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon );
 572     }
 573
 574     // Punkte verschieben
 575     for ( USHORT i = 0, nCount = mpImplPolyPolygon->mnCount; i < nCount; i++ )
 576         mpImplPolyPolygon->mpPolyAry[ i ]->SlantX( nYRef, fSin, fCos );
 577 }
 578
 579 // -----------------------------------------------------------------------
 580
 581 void PolyPolygon::SlantY( long nXRef, double fSin, double fCos )
 582 {
 583     DBG_CHKTHIS( PolyPolygon, NULL );
 584
 585     // Referenzcounter beruecksichtigen
 586     if( mpImplPolyPolygon->mnRefCount > 1 )
 587     {
 588         mpImplPolyPolygon->mnRefCount--;
 589         mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon );
 590     }
 591
 592     // Punkte verschieben
 593     for ( USHORT i = 0, nCount = mpImplPolyPolygon->mnCount; i < nCount; i++ )
 594         mpImplPolyPolygon->mpPolyAry[ i ]->SlantY( nXRef, fSin, fCos );
 595 }
 596
 597 // -----------------------------------------------------------------------
 598
 599 void PolyPolygon::Distort( const Rectangle& rRefRect, const Polygon& rDistortedRect )
 600 {
 601     DBG_CHKTHIS( PolyPolygon, NULL );
 602
 603     // Referenzcounter beruecksichtigen
 604     if( mpImplPolyPolygon->mnRefCount > 1 )
 605     {
 606         mpImplPolyPolygon->mnRefCount--;
 607         mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon );
 608     }
 609
 610     // Punkte verschieben
 611     for ( USHORT i = 0, nCount = mpImplPolyPolygon->mnCount; i < nCount; i++ )
 612         mpImplPolyPolygon->mpPolyAry[ i ]->Distort( rRefRect, rDistortedRect );
 613 }
 614
 615
 616 // -----------------------------------------------------------------------
 617
 618 void PolyPolygon::Clip( const Rectangle& rRect )
 619 {
 620     // Polygon-Clippen
 621     USHORT nPolyCount = mpImplPolyPolygon->mnCount;
 622     USHORT i;
 623
 624     if ( !nPolyCount )
 625         return;
 626
 627     // Referenzcounter beruecksichtigen
 628     if ( mpImplPolyPolygon->mnRefCount > 1 )
 629     {
 630         mpImplPolyPolygon->mnRefCount--;
 631         mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon );
 632     }
 633
 634     // Erst jedes Polygon Clippen und dann die leeren entfernen
 635     for ( i = 0; i < nPolyCount; i++ )
 636         mpImplPolyPolygon->mpPolyAry[i]->Clip( rRect );
 637     while ( nPolyCount )
 638     {
 639         if ( GetObject( nPolyCount-1 ).GetSize() <= 2 )
 640             Remove( nPolyCount-1 );
 641         nPolyCount--;
 642     }
 643 }
 644
 645 // -----------------------------------------------------------------------
 646
 647 Rectangle PolyPolygon::GetBoundRect() const
 648 {
 649     DBG_CHKTHIS( PolyPolygon, NULL );
 650
 651     long        nXMin=0, nXMax=0, nYMin=0, nYMax=0;
 652     BOOL        bFirst = TRUE;
 653     USHORT      nPolyCount = mpImplPolyPolygon->mnCount;
 654
 655     for ( USHORT n = 0; n < nPolyCount; n++ )
 656     {
 657         const Polygon*  pPoly = mpImplPolyPolygon->mpPolyAry[n];
 658         const Point*    pAry = pPoly->GetConstPointAry();
 659         USHORT                  nPointCount = pPoly->GetSize();
 660
 661         for ( USHORT i = 0; i < nPointCount; i++ )
 662         {
 663             const Point* pPt = &pAry[ i ];
 664
 665             if ( bFirst )
 666             {
 667                 nXMin = nXMax = pPt->X();
 668                 nYMin = nYMax = pPt->Y();
 669                 bFirst = FALSE;
 670             }
 671             else
 672             {
 673                 if ( pPt->X() < nXMin )
 674                     nXMin = pPt->X();
 675                 if ( pPt->X() > nXMax )
 676                     nXMax = pPt->X();
 677                 if ( pPt->Y() < nYMin )
 678                     nYMin = pPt->Y();
 679                 if ( pPt->Y() > nYMax )
 680                     nYMax = pPt->Y();
 681             }
 682         }
 683     }
 684
 685     if ( !bFirst )
 686         return Rectangle( nXMin, nYMin, nXMax, nYMax );
 687     else
 688         return Rectangle();
 689 }
 690
 691 // -----------------------------------------------------------------------
 692
 693 Polygon& PolyPolygon::operator[]( USHORT nPos )
 694 {
 695     DBG_CHKTHIS( PolyPolygon, NULL );
 696     DBG_ASSERT( nPos < Count(), "PolyPolygon::[](): nPos >= nSize" );
 697
 698     if ( mpImplPolyPolygon->mnRefCount > 1 )
 699     {
 700         mpImplPolyPolygon->mnRefCount--;
 701         mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon );
 702     }
 703
 704     return *(mpImplPolyPolygon->mpPolyAry[nPos]);
 705 }
 706
 707 // -----------------------------------------------------------------------
 708
 709 PolyPolygon& PolyPolygon::operator=( const PolyPolygon& rPolyPoly )
 710 {
 711     DBG_CHKTHIS( PolyPolygon, NULL );
 712     DBG_CHKOBJ( &rPolyPoly, PolyPolygon, NULL );
 713     DBG_ASSERT( rPolyPoly.mpImplPolyPolygon->mnRefCount < 0xFFFFFFFE, "PolyPolygon: RefCount overflow" );
 714
 715     rPolyPoly.mpImplPolyPolygon->mnRefCount++;
 716
 717     if ( mpImplPolyPolygon->mnRefCount > 1 )
 718         mpImplPolyPolygon->mnRefCount--;
 719     else
 720         delete mpImplPolyPolygon;
 721
 722     mpImplPolyPolygon = rPolyPoly.mpImplPolyPolygon;
 723     return *this;
 724 }
 725
 726 // -----------------------------------------------------------------------
 727
 728 BOOL PolyPolygon::operator==( const PolyPolygon& rPolyPoly ) const
 729 {
 730     DBG_CHKTHIS( PolyPolygon, NULL );
 731     DBG_CHKOBJ( &rPolyPoly, PolyPolygon, NULL );
 732
 733     if ( rPolyPoly.mpImplPolyPolygon == mpImplPolyPolygon )
 734         return TRUE;
 735     else
 736         return FALSE;
 737 }
 738
 739 // -----------------------------------------------------------------------
 740
 741 sal_Bool PolyPolygon::IsEqual( const PolyPolygon& rPolyPoly ) const
 742 {
 743     sal_Bool bIsEqual = sal_True;
 744     if ( Count() != rPolyPoly.Count() )
 745         bIsEqual = sal_False;
 746     else
 747     {
 748         sal_uInt16 i;
 749         for ( i = 0; i < Count(); i++ )
 750         {
 751             if (!GetObject( i ).IsEqual( rPolyPoly.GetObject( i ) ) )
 752             {
 753                 bIsEqual = sal_False;
 754                 break;
 755             }
 756         }
 757     }
 758     return bIsEqual;
 759 }
 760
 761 // -----------------------------------------------------------------------
 762
 763 SvStream& operator>>( SvStream& rIStream, PolyPolygon& rPolyPoly )
 764 {
 765     DBG_CHKOBJ( &rPolyPoly, PolyPolygon, NULL );
 766     DBG_ASSERTWARNING( rIStream.GetVersion(), "PolyPolygon::>> - Solar-Version not set on rIStream" );
 767
 768     Polygon* pPoly;
 769     USHORT       nPolyCount;
 770
 771     // Anzahl der Polygone einlesen
 772     rIStream >> nPolyCount;
 773
 774     // Daten anlegen
 775     if( nPolyCount )
 776     {
 777         // Referenzcounter beruecksichtigen
 778         if ( rPolyPoly.mpImplPolyPolygon->mnRefCount > 1 )
 779             rPolyPoly.mpImplPolyPolygon->mnRefCount--;
 780         else
 781             delete rPolyPoly.mpImplPolyPolygon;
 782
 783         rPolyPoly.mpImplPolyPolygon = new ImplPolyPolygon( nPolyCount );
 784
 785         for ( USHORT i = 0; i < nPolyCount; i++ )
 786         {
 787             pPoly = new Polygon;
 788             rIStream >> *pPoly;
 789             rPolyPoly.mpImplPolyPolygon->mpPolyAry[i] = pPoly;
 790         }
 791     }
 792     else
 793         rPolyPoly = PolyPolygon();
 794
 795     return rIStream;
 796 }
 797
 798 // -----------------------------------------------------------------------
 799
 800 SvStream& operator<<( SvStream& rOStream, const PolyPolygon& rPolyPoly )
 801 {
 802     DBG_CHKOBJ( &rPolyPoly, PolyPolygon, NULL );
 803     DBG_ASSERTWARNING( rOStream.GetVersion(), "PolyPolygon::<< - Solar-Version not set on rOStream" );
 804
 805     // Anzahl der Polygone rausschreiben
 806     USHORT nPolyCount = rPolyPoly.mpImplPolyPolygon->mnCount;
 807     rOStream << nPolyCount;
 808
 809     // Die einzelnen Polygone ausgeben
 810     for ( USHORT i = 0; i < nPolyCount; i++ )
 811         rOStream << *(rPolyPoly.mpImplPolyPolygon->mpPolyAry[i]);
 812
 813     return rOStream;
 814 }
 815
 816 // -----------------------------------------------------------------------
 817
 818 void PolyPolygon::Read( SvStream& rIStream )
 819 {
 820     VersionCompat aCompat( rIStream, STREAM_READ );
 821
 822     DBG_CHKTHIS( PolyPolygon, NULL );
 823     DBG_ASSERTWARNING( rIStream.GetVersion(), "PolyPolygon::>> - Solar-Version not set on rIStream" );
 824
 825     Polygon* pPoly;
 826     USHORT       nPolyCount;
 827
 828     // Anzahl der Polygone einlesen
 829     rIStream >> nPolyCount;
 830
 831     // Daten anlegen
 832     if( nPolyCount )
 833     {
 834         // Referenzcounter beruecksichtigen
 835         if ( mpImplPolyPolygon->mnRefCount > 1 )
 836             mpImplPolyPolygon->mnRefCount--;
 837         else
 838             delete mpImplPolyPolygon;
 839
 840         mpImplPolyPolygon = new ImplPolyPolygon( nPolyCount );
 841
 842         for ( USHORT i = 0; i < nPolyCount; i++ )
 843         {
 844             pPoly = new Polygon;
 845             pPoly->ImplRead( rIStream );
 846             mpImplPolyPolygon->mpPolyAry[i] = pPoly;
 847         }
 848     }
 849     else
 850         *this = PolyPolygon();
 851 }
 852
 853 // -----------------------------------------------------------------------
 854
 855 void PolyPolygon::Write( SvStream& rOStream ) const
 856 {
 857     VersionCompat aCompat( rOStream, STREAM_WRITE, 1 );
 858
 859     DBG_CHKTHIS( PolyPolygon, NULL );
 860     DBG_ASSERTWARNING( rOStream.GetVersion(), "PolyPolygon::<< - Solar-Version not set on rOStream" );
 861
 862     // Anzahl der Polygone rausschreiben
 863     USHORT nPolyCount = mpImplPolyPolygon->mnCount;
 864     rOStream << nPolyCount;
 865
 866     // Die einzelnen Polygone ausgeben
 867     for ( USHORT i = 0; i < nPolyCount; i++ )
 868         mpImplPolyPolygon->mpPolyAry[i]->ImplWrite( rOStream );;
 869 }
 870
 871 // -----------------------------------------------------------------------
 872 // convert to basegfx::B2DPolyPolygon and return
 873 basegfx::B2DPolyPolygon PolyPolygon::getB2DPolyPolygon() const
 874 {
 875     basegfx::B2DPolyPolygon aRetval;
 876
 877     for(sal_uInt16 a(0); a < mpImplPolyPolygon->mnCount; a++)
 878     {
 879         Polygon* pCandidate = mpImplPolyPolygon->mpPolyAry[a];
 880         aRetval.append(pCandidate->getB2DPolygon());
 881     }
 882
 883     return aRetval;
 884 }
 885
 886 // -----------------------------------------------------------------------
 887 // constructor to convert from basegfx::B2DPolyPolygon
 888 PolyPolygon::PolyPolygon(const basegfx::B2DPolyPolygon& rPolyPolygon)
 889 {
 890     DBG_CTOR( PolyPolygon, NULL );
 891     const sal_uInt16 nCount(sal_uInt16(rPolyPolygon.count()));
 892     DBG_ASSERT(sal_uInt32(nCount) == rPolyPolygon.count(),
 893         "PolyPolygon::PolyPolygon: Too many sub-polygons in given basegfx::B2DPolyPolygon (!)");
 894
 895     if ( nCount )
 896     {
 897         mpImplPolyPolygon = new ImplPolyPolygon( nCount );
 898
 899         for(sal_uInt16 a(0); a < nCount; a++)
 900         {
 901             basegfx::B2DPolygon aCandidate(rPolyPolygon.getB2DPolygon(sal_uInt32(a)));
 902             mpImplPolyPolygon->mpPolyAry[a] = new Polygon( aCandidate );
 903         }
 904     }
 905     else
 906     {
 907         mpImplPolyPolygon = new ImplPolyPolygon( 16, 16 );
 908     }
 909 }
 910
 911 // eof