basegfx/source/tools/unopolypolygon.cxx

   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
  20 #include <com/sun/star/geometry/AffineMatrix2D.hpp>
  21 #include <com/sun/star/lang/IllegalArgumentException.hpp>
  22 #include <com/sun/star/rendering/RenderState.hpp>
  23 #include <com/sun/star/rendering/ViewState.hpp>
  24 #include <com/sun/star/rendering/XCanvas.hpp>
  25 #include <com/sun/star/rendering/CompositeOperation.hpp>
  26
  27 #include <basegfx/matrix/b2dhommatrix.hxx>
  28 #include <basegfx/range/b2drange.hxx>
  29 #include <basegfx/range/b2drectangle.hxx>
  30 #include <basegfx/point/b2dpoint.hxx>
  31 #include <basegfx/utils/canvastools.hxx>
  32 #include <basegfx/polygon/b2dpolygon.hxx>
  33 #include <basegfx/polygon/b2dpolypolygontools.hxx>
  34 #include <basegfx/utils/unopolypolygon.hxx>
  35 #include <basegfx/matrix/b2dhommatrixtools.hxx>
  36 #include <cppuhelper/supportsservice.hxx>
  37
  38 using namespace ::com::sun::star;
  39
  40 namespace basegfx
  41 {
  42 namespace unotools
  43 {
  44     UnoPolyPolygon::UnoPolyPolygon( const B2DPolyPolygon& rPolyPoly ) :
  45         UnoPolyPolygonBase( m_aMutex ),
  46         maPolyPoly( rPolyPoly ),
  47         meFillRule( rendering::FillRule_EVEN_ODD )
  48     {
  49         // or else races will haunt us.
  50         maPolyPoly.makeUnique();
  51     }
  52
  53     void SAL_CALL UnoPolyPolygon::addPolyPolygon(
  54         const geometry::RealPoint2D&                        position,
  55         const uno::Reference< rendering::XPolyPolygon2D >&  polyPolygon )
  56     {
  57         osl::MutexGuard const guard( m_aMutex );
  58         modifying();
  59
  60         // TODO(F1): Correctly fulfill the UNO API
  61         // specification. This will probably result in a vector of
  62         // poly-polygons to be stored in this object.
  63
  64         const sal_Int32 nPolys( polyPolygon->getNumberOfPolygons() );
  65
  66         if( !polyPolygon.is() || !nPolys )
  67         {
  68             // invalid or empty polygon - nothing to do.
  69             return;
  70         }
  71
  72         B2DPolyPolygon        aSrcPoly;
  73         const UnoPolyPolygon* pSrc( dynamic_cast< UnoPolyPolygon* >(polyPolygon.get()) );
  74
  75         // try to extract polygon data from interface. First,
  76         // check whether it's the same implementation object,
  77         // which we can tunnel then.
  78         if( pSrc )
  79         {
  80             aSrcPoly = pSrc->getPolyPolygon();
  81         }
  82         else
  83         {
  84             // not a known implementation object - try data source
  85             // interfaces
  86             uno::Reference< rendering::XBezierPolyPolygon2D > xBezierPoly(
  87                 polyPolygon,
  88                 uno::UNO_QUERY );
  89
  90             if( xBezierPoly.is() )
  91             {
  92                 aSrcPoly = unotools::polyPolygonFromBezier2DSequenceSequence(
  93                     xBezierPoly->getBezierSegments( 0,
  94                                                     nPolys,
  95                                                     0,
  96                                                     -1 ) );
  97             }
  98             else
  99             {
 100                 uno::Reference< rendering::XLinePolyPolygon2D > xLinePoly(
 101                     polyPolygon,
 102                     uno::UNO_QUERY );
 103
 104                 // no implementation class and no data provider
 105                 // found - contract violation.
 106                 if( !xLinePoly.is() )
 107                     throw lang::IllegalArgumentException(
 108                         "UnoPolyPolygon::addPolyPolygon(): Invalid input "
 109                         "poly-polygon, cannot retrieve vertex data",
 110                         static_cast<cppu::OWeakObject*>(this), 1);
 111
 112                 aSrcPoly = unotools::polyPolygonFromPoint2DSequenceSequence(
 113                     xLinePoly->getPoints( 0,
 114                                           nPolys,
 115                                           0,
 116                                           -1 ) );
 117             }
 118         }
 119
 120         const B2DRange  aBounds( utils::getRange( aSrcPoly ) );
 121         const B2DVector     aOffset( unotools::b2DPointFromRealPoint2D( position ) -
 122                                              aBounds.getMinimum() );
 123
 124         if( !aOffset.equalZero() )
 125         {
 126             const B2DHomMatrix aTranslate(utils::createTranslateB2DHomMatrix(aOffset));
 127             aSrcPoly.transform( aTranslate );
 128         }
 129
 130         maPolyPoly.append( aSrcPoly );
 131     }
 132
 133     sal_Int32 SAL_CALL UnoPolyPolygon::getNumberOfPolygons()
 134     {
 135         osl::MutexGuard const guard( m_aMutex );
 136         return maPolyPoly.count();
 137     }
 138
 139     sal_Int32 SAL_CALL UnoPolyPolygon::getNumberOfPolygonPoints(
 140         sal_Int32 polygon )
 141     {
 142         osl::MutexGuard const guard( m_aMutex );
 143         checkIndex( polygon );
 144
 145         return maPolyPoly.getB2DPolygon(polygon).count();
 146     }
 147
 148     rendering::FillRule SAL_CALL UnoPolyPolygon::getFillRule()
 149     {
 150         osl::MutexGuard const guard( m_aMutex );
 151         return meFillRule;
 152     }
 153
 154     void SAL_CALL UnoPolyPolygon::setFillRule(
 155         rendering::FillRule fillRule )
 156     {
 157         osl::MutexGuard const guard( m_aMutex );
 158         modifying();
 159
 160         meFillRule = fillRule;
 161     }
 162
 163     sal_Bool SAL_CALL UnoPolyPolygon::isClosed(
 164         sal_Int32 index )
 165     {
 166         osl::MutexGuard const guard( m_aMutex );
 167         checkIndex( index );
 168
 169         return maPolyPoly.getB2DPolygon(index).isClosed();
 170     }
 171
 172     void SAL_CALL UnoPolyPolygon::setClosed(
 173         sal_Int32 index,
 174         sal_Bool closedState )
 175     {
 176         osl::MutexGuard const guard( m_aMutex );
 177         modifying();
 178
 179         if( index == -1 )
 180         {
 181             // set all
 182             maPolyPoly.setClosed( closedState );
 183         }
 184         else
 185         {
 186             checkIndex( index );
 187
 188             // fetch referenced polygon, change state
 189             B2DPolygon aTmp( maPolyPoly.getB2DPolygon(index) );
 190             aTmp.setClosed( closedState );
 191
 192             // set back to container
 193             maPolyPoly.setB2DPolygon( index, aTmp );
 194         }
 195     }
 196
 197     uno::Sequence< uno::Sequence< geometry::RealPoint2D > > SAL_CALL UnoPolyPolygon::getPoints(
 198         sal_Int32 nPolygonIndex,
 199         sal_Int32 nNumberOfPolygons,
 200         sal_Int32 nPointIndex,
 201         sal_Int32 nNumberOfPoints )
 202     {
 203         osl::MutexGuard const guard( m_aMutex );
 204
 205         return unotools::pointSequenceSequenceFromB2DPolyPolygon(
 206             getSubsetPolyPolygon( nPolygonIndex,
 207                                   nNumberOfPolygons,
 208                                   nPointIndex,
 209                                   nNumberOfPoints ) );
 210     }
 211
 212     void SAL_CALL UnoPolyPolygon::setPoints(
 213         const uno::Sequence< uno::Sequence< geometry::RealPoint2D > >& points,
 214         sal_Int32 nPolygonIndex )
 215     {
 216         osl::MutexGuard const guard( m_aMutex );
 217         modifying();
 218
 219         const B2DPolyPolygon& rNewPolyPoly(
 220             unotools::polyPolygonFromPoint2DSequenceSequence( points ) );
 221
 222         if( nPolygonIndex == -1 )
 223         {
 224             maPolyPoly = rNewPolyPoly;
 225         }
 226         else
 227         {
 228             checkIndex( nPolygonIndex );
 229
 230             maPolyPoly.insert( nPolygonIndex, rNewPolyPoly );
 231         }
 232     }
 233
 234     geometry::RealPoint2D SAL_CALL UnoPolyPolygon::getPoint(
 235         sal_Int32 nPolygonIndex,
 236         sal_Int32 nPointIndex )
 237     {
 238         osl::MutexGuard const guard( m_aMutex );
 239         checkIndex( nPolygonIndex );
 240
 241         const B2DPolygon& rPoly( maPolyPoly.getB2DPolygon( nPolygonIndex ) );
 242
 243         if( nPointIndex < 0 || nPointIndex >= static_cast<sal_Int32>(rPoly.count()) )
 244             throw lang::IndexOutOfBoundsException();
 245
 246         return unotools::point2DFromB2DPoint( rPoly.getB2DPoint( nPointIndex ) );
 247     }
 248
 249     void SAL_CALL UnoPolyPolygon::setPoint(
 250         const geometry::RealPoint2D& point,
 251         sal_Int32 nPolygonIndex,
 252         sal_Int32 nPointIndex )
 253     {
 254         osl::MutexGuard const guard( m_aMutex );
 255         checkIndex( nPolygonIndex );
 256         modifying();
 257
 258         B2DPolygon aPoly( maPolyPoly.getB2DPolygon( nPolygonIndex ) );
 259
 260         if( nPointIndex < 0 || nPointIndex >= static_cast<sal_Int32>(aPoly.count()) )
 261             throw lang::IndexOutOfBoundsException();
 262
 263         aPoly.setB2DPoint( nPointIndex,
 264                            unotools::b2DPointFromRealPoint2D( point ) );
 265         maPolyPoly.setB2DPolygon( nPolygonIndex, aPoly );
 266     }
 267
 268     uno::Sequence< uno::Sequence< geometry::RealBezierSegment2D > > SAL_CALL UnoPolyPolygon::getBezierSegments(
 269         sal_Int32 nPolygonIndex,
 270         sal_Int32 nNumberOfPolygons,
 271         sal_Int32 nPointIndex,
 272         sal_Int32 nNumberOfPoints )
 273     {
 274         osl::MutexGuard const guard( m_aMutex );
 275         return unotools::bezierSequenceSequenceFromB2DPolyPolygon(
 276             getSubsetPolyPolygon( nPolygonIndex,
 277                                   nNumberOfPolygons,
 278                                   nPointIndex,
 279                                   nNumberOfPoints ) );
 280     }
 281
 282     void SAL_CALL UnoPolyPolygon::setBezierSegments(
 283         const uno::Sequence< uno::Sequence< geometry::RealBezierSegment2D > >&  points,
 284         sal_Int32                                                               nPolygonIndex )
 285     {
 286         osl::MutexGuard const guard( m_aMutex );
 287         modifying();
 288         const B2DPolyPolygon& rNewPolyPoly(
 289             unotools::polyPolygonFromBezier2DSequenceSequence( points ) );
 290
 291         if( nPolygonIndex == -1 )
 292         {
 293             maPolyPoly = rNewPolyPoly;
 294         }
 295         else
 296         {
 297             checkIndex( nPolygonIndex );
 298
 299             maPolyPoly.insert( nPolygonIndex, rNewPolyPoly );
 300         }
 301     }
 302
 303     geometry::RealBezierSegment2D SAL_CALL UnoPolyPolygon::getBezierSegment( sal_Int32 nPolygonIndex,
 304                                                                              sal_Int32 nPointIndex )
 305     {
 306         osl::MutexGuard const guard( m_aMutex );
 307         checkIndex( nPolygonIndex );
 308
 309         const B2DPolygon& rPoly( maPolyPoly.getB2DPolygon( nPolygonIndex ) );
 310         const sal_uInt32  nPointCount(rPoly.count());
 311
 312         if( nPointIndex < 0 || nPointIndex >= static_cast<sal_Int32>(nPointCount) )
 313             throw lang::IndexOutOfBoundsException();
 314
 315         const B2DPoint& rPt( rPoly.getB2DPoint( nPointIndex ) );
 316         const B2DPoint& rCtrl0( rPoly.getNextControlPoint(nPointIndex) );
 317         const B2DPoint& rCtrl1( rPoly.getPrevControlPoint((nPointIndex + 1) % nPointCount) );
 318
 319         return geometry::RealBezierSegment2D( rPt.getX(),
 320                                               rPt.getY(),
 321                                               rCtrl0.getX(),
 322                                               rCtrl0.getY(),
 323                                               rCtrl1.getX(),
 324                                               rCtrl1.getY() );
 325     }
 326
 327     void SAL_CALL UnoPolyPolygon::setBezierSegment( const geometry::RealBezierSegment2D& segment,
 328                                                          sal_Int32                       nPolygonIndex,
 329                                                          sal_Int32                       nPointIndex )
 330     {
 331         osl::MutexGuard const guard( m_aMutex );
 332         checkIndex( nPolygonIndex );
 333         modifying();
 334
 335         B2DPolygon aPoly( maPolyPoly.getB2DPolygon( nPolygonIndex ) );
 336         const sal_uInt32 nPointCount(aPoly.count());
 337
 338         if( nPointIndex < 0 || nPointIndex >= static_cast<sal_Int32>(nPointCount) )
 339             throw lang::IndexOutOfBoundsException();
 340
 341         aPoly.setB2DPoint( nPointIndex,
 342                            B2DPoint( segment.Px,
 343                                      segment.Py ) );
 344         aPoly.setNextControlPoint(nPointIndex,
 345                                   B2DPoint(segment.C1x, segment.C1y));
 346         aPoly.setPrevControlPoint((nPointIndex + 1) % nPointCount,
 347                                   B2DPoint(segment.C2x, segment.C2y));
 348
 349         maPolyPoly.setB2DPolygon( nPolygonIndex, aPoly );
 350     }
 351
 352     B2DPolyPolygon UnoPolyPolygon::getSubsetPolyPolygon(
 353         sal_Int32 nPolygonIndex,
 354         sal_Int32 nNumberOfPolygons,
 355         sal_Int32 nPointIndex,
 356         sal_Int32 nNumberOfPoints ) const
 357     {
 358         osl::MutexGuard const guard( m_aMutex );
 359         checkIndex( nPolygonIndex );
 360
 361         const sal_Int32 nPolyCount( maPolyPoly.count() );
 362
 363         // check for "full polygon" case
 364         if( !nPolygonIndex &&
 365             !nPointIndex &&
 366             nNumberOfPolygons == nPolyCount &&
 367             nNumberOfPoints == -1 )
 368         {
 369             return maPolyPoly;
 370         }
 371
 372         B2DPolyPolygon aSubsetPoly;
 373
 374         // create temporary polygon (as an extract from maPoly,
 375         // which contains the requested subset)
 376         for( sal_Int32 i=nPolygonIndex; i<nNumberOfPolygons; ++i )
 377         {
 378             checkIndex(i);
 379
 380             const B2DPolygon& rCurrPoly( maPolyPoly.getB2DPolygon(i) );
 381
 382             sal_Int32 nFirstPoint(0);
 383             sal_Int32 nLastPoint(nPolyCount-1);
 384
 385             if( nPointIndex && i==nPolygonIndex )
 386             {
 387                 // very first polygon - respect nPointIndex, if
 388                 // not zero
 389
 390                 // empty polygon - impossible to specify _any_
 391                 // legal value except 0 here!
 392                 if( !nPolyCount && nPointIndex )
 393                     throw lang::IndexOutOfBoundsException();
 394
 395                 nFirstPoint = nPointIndex;
 396             }
 397
 398             if( i==nNumberOfPolygons-1 && nNumberOfPoints != -1 )
 399             {
 400                 // very last polygon - respect nNumberOfPoints
 401
 402                 // empty polygon - impossible to specify _any_
 403                 // legal value except -1 here!
 404                 if( !nPolyCount )
 405                     throw lang::IndexOutOfBoundsException();
 406
 407                 nLastPoint = nFirstPoint+nNumberOfPoints;
 408             }
 409
 410             if( !nPolyCount )
 411             {
 412                 // empty polygon - index checks already performed
 413                 // above, now simply append empty polygon
 414                 aSubsetPoly.append( rCurrPoly );
 415             }
 416             else
 417             {
 418                 if( nFirstPoint < 0 || nFirstPoint >= nPolyCount )
 419                     throw lang::IndexOutOfBoundsException();
 420
 421                 if( nLastPoint < 0 || nLastPoint >= nPolyCount )
 422                     throw lang::IndexOutOfBoundsException();
 423
 424                 B2DPolygon aTmp;
 425                 for( sal_Int32 j=nFirstPoint; j<nLastPoint; ++j )
 426                     aTmp.append( rCurrPoly.getB2DPoint(j) );
 427
 428                 aSubsetPoly.append( aTmp );
 429             }
 430         }
 431
 432         return aSubsetPoly;
 433     }
 434
 435 #define IMPLEMENTATION_NAME "gfx::internal::UnoPolyPolygon"
 436 #define SERVICE_NAME "com.sun.star.rendering.PolyPolygon2D"
 437     OUString SAL_CALL UnoPolyPolygon::getImplementationName()
 438     {
 439         return OUString( IMPLEMENTATION_NAME );
 440     }
 441
 442     sal_Bool SAL_CALL UnoPolyPolygon::supportsService( const OUString& ServiceName )
 443     {
 444         return cppu::supportsService(this, ServiceName);
 445     }
 446
 447     uno::Sequence< OUString > SAL_CALL UnoPolyPolygon::getSupportedServiceNames()
 448     {
 449         return { SERVICE_NAME };
 450     }
 451
 452     B2DPolyPolygon UnoPolyPolygon::getPolyPolygon() const
 453     {
 454         osl::MutexGuard const guard( m_aMutex );
 455
 456         // detach result from us
 457         B2DPolyPolygon aRet( maPolyPoly );
 458         aRet.makeUnique();
 459         return aRet;
 460     }
 461
 462 }
 463 }
 464
 465 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */