basegfx/test/boxclipper.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 <sal/types.h>
  21 #include <cppunit/TestAssert.h>
  22 #include <cppunit/TestFixture.h>
  23 #include <cppunit/extensions/HelperMacros.h>
  24
  25 #include <basegfx/range/b2dpolyrange.hxx>
  26 #include <basegfx/polygon/b2dpolygon.hxx>
  27 #include <basegfx/polygon/b2dpolygontools.hxx>
  28 #include <basegfx/polygon/b2dpolypolygontools.hxx>
  29 #include <basegfx/polygon/b2dpolypolygoncutter.hxx>
  30 #include <basegfx/polygon/b2dpolypolygon.hxx>
  31 #include <comphelper/random.hxx>
  32 #include <rtl/math.hxx>
  33
  34 using namespace ::basegfx;
  35
  36 namespace basegfx2d
  37 {
  38
  39 static bool compare(const B2DPoint& left, const B2DPoint& right)
  40 {
  41     return left.getX()<right.getX()
  42         || (rtl::math::approxEqual(left.getX(),right.getX()) && left.getY()<right.getY());
  43 }
  44
  45 class boxclipper : public CppUnit::TestFixture
  46 {
  47 private:
  48     B2DPolyRange aDisjunctRanges;
  49     B2DPolyRange aEqualRanges;
  50     B2DPolyRange aIntersectionN;
  51     B2DPolyRange aIntersectionE;
  52     B2DPolyRange aIntersectionS;
  53     B2DPolyRange aIntersectionW;
  54     B2DPolyRange aIntersectionNE;
  55     B2DPolyRange aIntersectionSE;
  56     B2DPolyRange aIntersectionSW;
  57     B2DPolyRange aIntersectionNW;
  58     B2DPolyRange aRingIntersection;
  59     B2DPolyRange aRingIntersection2;
  60     B2DPolyRange aRingIntersectExtraStrip;
  61     B2DPolyRange aComplexIntersections;
  62     B2DPolyRange aRandomIntersections;
  63
  64 public:
  65     // initialise your test code values here.
  66     void setUp() override
  67     {
  68         B2DRange aCenter(100, 100, -100, -100);
  69         B2DRange aOffside(800, 800, 1000, 1000);
  70         B2DRange aNorth(100, 0, -100, -200);
  71         B2DRange aSouth(100, 200, -100, 0);
  72         B2DRange aEast(0, 100, 200, -100);
  73         B2DRange aWest(-200, 100, 0, -100);
  74         B2DRange aNorthEast(0, 0, 200, -200);
  75         B2DRange aSouthEast(0, 0, 200, 200);
  76         B2DRange aSouthWest(0, 0, -200, 200);
  77         B2DRange aNorthWest(0, 0, -200, -200);
  78
  79         B2DRange aNorth2(-150, 50,  150,  350);
  80         B2DRange aSouth2(-150, -50, 150, -350);
  81         B2DRange aEast2 (50,  -150, 350,  150);
  82         B2DRange aWest2 (-50, -150,-350,  150);
  83
  84         aDisjunctRanges.appendElement( aCenter, B2VectorOrientation::Negative );
  85         aDisjunctRanges.appendElement( aOffside, B2VectorOrientation::Negative );
  86
  87         aEqualRanges.appendElement( aCenter, B2VectorOrientation::Negative );
  88         aEqualRanges.appendElement( aCenter, B2VectorOrientation::Negative );
  89
  90         aIntersectionN.appendElement( aCenter, B2VectorOrientation::Negative );
  91         aIntersectionN.appendElement( aNorth, B2VectorOrientation::Negative );
  92
  93         aIntersectionE.appendElement( aCenter, B2VectorOrientation::Negative );
  94         aIntersectionE.appendElement( aEast, B2VectorOrientation::Negative );
  95
  96         aIntersectionS.appendElement( aCenter, B2VectorOrientation::Negative );
  97         aIntersectionS.appendElement( aSouth, B2VectorOrientation::Negative );
  98
  99         aIntersectionW.appendElement( aCenter, B2VectorOrientation::Negative );
 100         aIntersectionW.appendElement( aWest, B2VectorOrientation::Negative );
 101
 102         aIntersectionNE.appendElement( aCenter, B2VectorOrientation::Negative );
 103         aIntersectionNE.appendElement( aNorthEast, B2VectorOrientation::Negative );
 104
 105         aIntersectionSE.appendElement( aCenter, B2VectorOrientation::Negative );
 106         aIntersectionSE.appendElement( aSouthEast, B2VectorOrientation::Negative );
 107
 108         aIntersectionSW.appendElement( aCenter, B2VectorOrientation::Negative );
 109         aIntersectionSW.appendElement( aSouthWest, B2VectorOrientation::Negative );
 110
 111         aIntersectionNW.appendElement( aCenter, B2VectorOrientation::Negative );
 112         aIntersectionNW.appendElement( aNorthWest, B2VectorOrientation::Negative );
 113
 114         aRingIntersection.appendElement( aNorth2, B2VectorOrientation::Negative );
 115         aRingIntersection.appendElement( aEast2, B2VectorOrientation::Negative );
 116         aRingIntersection.appendElement( aSouth2, B2VectorOrientation::Negative );
 117
 118         aRingIntersection2 = aRingIntersection;
 119         aRingIntersection2.appendElement( aWest2, B2VectorOrientation::Negative );
 120
 121         aRingIntersectExtraStrip = aRingIntersection2;
 122         aRingIntersectExtraStrip.appendElement( B2DRange(0, -25, 200, 25),
 123                                                 B2VectorOrientation::Negative );
 124
 125         aComplexIntersections.appendElement( aCenter, B2VectorOrientation::Negative );
 126         aComplexIntersections.appendElement( aOffside, B2VectorOrientation::Negative );
 127         aComplexIntersections.appendElement( aCenter, B2VectorOrientation::Negative );
 128         aComplexIntersections.appendElement( aNorth, B2VectorOrientation::Negative );
 129         aComplexIntersections.appendElement( aEast, B2VectorOrientation::Negative );
 130         aComplexIntersections.appendElement( aSouth, B2VectorOrientation::Negative );
 131         aComplexIntersections.appendElement( aWest, B2VectorOrientation::Negative );
 132         aComplexIntersections.appendElement( aNorthEast, B2VectorOrientation::Negative );
 133         aComplexIntersections.appendElement( aSouthEast, B2VectorOrientation::Negative );
 134         aComplexIntersections.appendElement( aSouthWest, B2VectorOrientation::Negative );
 135         aComplexIntersections.appendElement( aNorthWest, B2VectorOrientation::Negative );
 136
 137 #ifdef GENERATE_RANDOM
 138         for( int i=0; i<800; ++i )
 139         {
 140             B2DRange aRandomRange(
 141                 getRandomOrdinal( 1000 ),
 142                 getRandomOrdinal( 1000 ),
 143                 getRandomOrdinal( 1000 ),
 144                 getRandomOrdinal( 1000 ) );
 145
 146             aRandomIntersections.appendElement( aRandomRange, B2VectorOrientation::Negative );
 147         }
 148 #else
 149         static constexpr OUString randomSvg=u"m394 783h404v57h-404zm-197-505h571v576h-571zm356-634h75v200h-75zm-40-113h403v588h-403zm93-811h111v494h-111zm-364-619h562v121h-562zm-134-8h292v27h-292zm110 356h621v486h-621zm78-386h228v25h-228zm475-345h201v201h-201zm-2-93h122v126h-122zm-417-243h567v524h-567zm-266-738h863v456h-863zm262-333h315v698h-315zm-328-826h43v393h-43zm830-219h120v664h-120zm-311-636h221v109h-221zm-500 137h628v19h-628zm681-94h211v493h-211zm-366-646h384v355h-384zm-189-199h715v247h-715zm165-459h563v601h-563zm258-479h98v606h-98zm270-517h65v218h-65zm-44-259h96v286h-96zm-599-202h705v468h-705zm216-803h450v494h-450zm-150-22h26v167h-26zm-55-599h50v260h-50zm190-278h490v387h-490zm-290-453h634v392h-634zm257 189h552v300h-552zm-151-690h136v455h-136zm12-597h488v432h-488zm501-459h48v39h-48zm-224-112h429v22h-429zm-281 102h492v621h-492zm519-158h208v17h-208zm-681-563h56v427h-56zm126-451h615v392h-615zm-47-410h598v522h-598zm-32 316h79v110h-79zm-71-129h18v127h-18zm126-993h743v589h-743zm211-430h428v750h-428zm61-554h100v220h-100zm-353-49h658v157h-658zm778-383h115v272h-115zm-249-541h119v712h-119zm203 86h94v40h-94z"_ustr;
 150         B2DPolyPolygon randomPoly;
 151         CPPUNIT_ASSERT(utils::importFromSvgD(randomPoly, randomSvg, false, nullptr));
 152         for (auto const& aPolygon : std::as_const(randomPoly))
 153             aRandomIntersections.appendElement(aPolygon.getB2DRange(), B2VectorOrientation::Negative);
 154 #endif
 155     }
 156
 157     B2DPolyPolygon normalizePoly( const B2DPolyPolygon& rPoly ) const
 158     {
 159         B2DPolyPolygon aRes;
 160         for( sal_uInt32 i=0; i<rPoly.count(); ++i )
 161         {
 162             B2DPolygon aTmp=rPoly.getB2DPolygon(i);
 163             if( utils::getOrientation(aTmp) == B2VectorOrientation::Negative )
 164                 aTmp.flip();
 165
 166             aTmp=utils::removeNeutralPoints(aTmp);
 167             std::vector<B2DPoint> aTmp2(aTmp.count());
 168             for(sal_uInt32 j=0; j<aTmp.count(); ++j)
 169                 aTmp2[j] = aTmp.getB2DPoint(j);
 170
 171             std::vector<B2DPoint>::iterator pSmallest=aTmp2.end();
 172             for(std::vector<B2DPoint>::iterator pCurr=aTmp2.begin(); pCurr!=aTmp2.end(); ++pCurr)
 173             {
 174                 if( pSmallest == aTmp2.end() || compare(*pCurr, *pSmallest) )
 175                 {
 176                     pSmallest=pCurr;
 177                 }
 178             }
 179
 180             if( pSmallest != aTmp2.end() )
 181                 std::rotate(aTmp2.begin(),pSmallest,aTmp2.end());
 182
 183             aTmp.clear();
 184             for(const auto& rCurr : aTmp2)
 185                 aTmp.append(rCurr);
 186
 187             aRes.append(aTmp);
 188         }
 189
 190         // boxclipper & generic clipper disagree slightly on area-less
 191         // polygons (one or two points only)
 192         aRes = utils::stripNeutralPolygons(aRes);
 193
 194         // now, sort all polygons with increasing 0th point
 195         std::sort(aRes.begin(),
 196                   aRes.end(),
 197                   [](const B2DPolygon& aPolygon1, const B2DPolygon& aPolygon2) {
 198                       return compare(aPolygon1.getB2DPoint(0),
 199                           aPolygon2.getB2DPoint(0)); } );
 200
 201         return aRes;
 202     }
 203
 204     void verifyPoly(const char* sName, const char* sSvg, const B2DPolyRange& toTest) const
 205     {
 206         B2DPolyPolygon aTmp1;
 207         CPPUNIT_ASSERT_MESSAGE(sName,
 208                                utils::importFromSvgD(
 209                                    aTmp1, OUString::createFromAscii(sSvg), false, nullptr));
 210
 211         const OUString aSvg=
 212             utils::exportToSvgD(toTest.solveCrossovers(), true, true, false);
 213         B2DPolyPolygon aTmp2;
 214         CPPUNIT_ASSERT_MESSAGE(sName,
 215                                utils::importFromSvgD(
 216                                    aTmp2, aSvg, false, nullptr));
 217
 218         CPPUNIT_ASSERT_EQUAL_MESSAGE(
 219             sName,
 220             normalizePoly(aTmp1), normalizePoly(aTmp2));
 221     }
 222
 223     void verifyPoly()
 224     {
 225         const char* const disjunct="m-100-100v200h200v-200zm900 900v200h200v-200z";
 226         const char* const equal="m-100-100v200h200v-200zm200 0h-200v200h200v-200z";
 227         const char* const intersectionN="m-100-100v100h200v-100zm200 0v-100h-200v100 200h200v-200z";
 228         const char* const intersectionE="m0-100v200h100v-200zm0 0h-100v200h100 200v-200z";
 229         const char* const intersectionS="m-100 0v100h200v-100zm0-100v200 100h200v-100-200z";
 230         const char* const intersectionW="m-100-100v200h100v-200zm0 0h-100v200h100 200v-200z";
 231         const char* const intersectionNE="m0-100v100h100v-100zm0-100v100h-100v200h200v-100h100v-200z";
 232         const char* const intersectionSE="m0 0v100h100v-100zm100 0v-100h-200v200h100v100h200v-200z";
 233         const char* const intersectionSW="m-100 0v100h100v-100zm0-100v100h-100v200h200v-100h100v-200z";
 234         const char* const intersectionNW="m-100-100v100h100v-100zm100 0v-100h-200v200h100v100h200v-200z";
 235         const char* const ringIntersection="m50-150v100h100v-100zm0 200v100h100v-100zm100-200v-200h-300v300h200v100h-200v300h300v-200h200v-300z";
 236         const char* const ringIntersection2="m-150 50v100h100v-100zm0-200v100h100v-100zm100 200v-100h100v100z"
 237                                       "m100-200v100h100v-100zm0 200v100h100v-100zm100-200v-200h-300v200h-200v300h200v200h300v-200h200v-300z";
 238         const char* const ringIntersectExtraStrip="m-150 50v100h100v-100zm0-200v100h100v-100zm100 200v-100h100v25h-50v50h50v25z"
 239                                             "m100-200v100h100v-100zm0 200v100h100v-100zm0-75v50h150v-50z"
 240                                             "m100-125v-200h-300v200h-200v300h200v200h300v-200h200v-300z";
 241         const char* const complexIntersections="m0 0zm0 0zm0 0zm0 0v-100 100h-100 100v100-100h100zm0 0v-100 100h-100 100v100-100h100z"
 242                                          "m100 0v-100h-100-100v100 100h100 100v-100zm0 0v-100h-100-100v100 100h100 100v-100z"
 243                                          "m0 0v-100h-100v-100 100h-100v100h-100 100v100h100v100-100h100v-100h100z"
 244                                          "m0-100v-100h-100-100v100h-100v100 100h100v100h100 100v-100h100v-100-100z"
 245                                          "m100 0v-100h-200-100-100v100 200 100h100 100 200v-100-200zm600 900v200h200v-200z";
 246         const char* const randomIntersections="m20-4515v393h43v-393zm34-8690v127h18v-127zm24 674v427h56v-427zm126-451v16-16z"
 247                                          "m22 3470v260h50v-260zm55 599v167h26v-167zm-49-1831v455h136v-455z"
 248                                          "m10 8845v19h158v-19zm54-38v25h228v-25zm156-13245v108h100v-108z"
 249                                          "m101 14826v200h75v-200zm-205-3000v365h315v-365zm-309-1877v19h628v-19z"
 250                                          "m549-1398v127h98v-127zm18 5351v215h111v-215zm-362-10061v152h488v-152z"
 251                                          "m488 0v-469h-492v621h4v280h488v-432zm-378 5368v48h384v-48zm274-10182v712h119v-712z"
 252                                          "m-424 3173v-94h-47v110h47v96h551v-112zm-105-2249v157h353v112h100v-112h205v-157z"
 253                                          "m284 5177v203h377v-203zm337 4727v66h40v-66zm-326 6110v57h374v-57zm351-12583v39h48v-39z"
 254                                          "m23 12583v-505h-571v576h571v-14h30v-57zm-368-2682v-8h-292v27h134v102h562v-121z"
 255                                          "m-9-12299v320h428v-320zm364 1216v-410h-598v316h-32v110h32v96h47v280h615v-392z"
 256                                          "m-537 11431v486h388v279h111v-279h122v-486zm112-4621v142h550v-142zm101-2719v494h450v-494z"
 257                                          "m340 6609v33h120v-33zm-85-4349v-479h-98v479h-258v459h-165v247h189v307h384v-307h142v-105h13v-601z"
 258                                          "m-270-3159v36h490v-36zm442 2163v7h52v-7zm-345 7158v588h403v-588zm378-1813v-93h-122v126h2v155h148v-188z"
 259                                          "m19-5345v-259h-96v266h44v20h52v-20h10v-7zm-91-6571v-430h-428v430h-211v589h743v-589z"
 260                                          "m101 6571v-461h-705v468h599v20h44v191h65v-218zm-89-8442v40h94v-40zm-71 10742v-43h-221v109h181v427h211v-493z"
 261                                          "m0-4727v-189h-634v392h257v97h33v351h490v-351h29v-300zm-97 6698v-333h-315v333h-262v456h863v-456z"
 262                                          "m-142-8556v22h429v-22zm238-56v17h208v-17zm91 7234v664h120v-664zm69 2452v-336h-567v524h419v13h201v-201z"
 263                                          "m-42-13332v272h115v-272z";
 264
 265         verifyPoly("disjunct", disjunct, aDisjunctRanges);
 266         verifyPoly("equal", equal, aEqualRanges);
 267         verifyPoly("intersectionN", intersectionN, aIntersectionN);
 268         verifyPoly("intersectionE", intersectionE, aIntersectionE);
 269         verifyPoly("intersectionS", intersectionS, aIntersectionS);
 270         verifyPoly("intersectionW", intersectionW, aIntersectionW);
 271         verifyPoly("intersectionNE", intersectionNE, aIntersectionNE);
 272         verifyPoly("intersectionSE", intersectionSE, aIntersectionSE);
 273         verifyPoly("intersectionSW", intersectionSW, aIntersectionSW);
 274         verifyPoly("intersectionNW", intersectionNW, aIntersectionNW);
 275         verifyPoly("ringIntersection", ringIntersection, aRingIntersection);
 276         verifyPoly("ringIntersection2", ringIntersection2, aRingIntersection2);
 277         verifyPoly("ringIntersectExtraStrip", ringIntersectExtraStrip, aRingIntersectExtraStrip);
 278         verifyPoly("complexIntersections", complexIntersections, aComplexIntersections);
 279         verifyPoly("randomIntersections", randomIntersections, aRandomIntersections);
 280     }
 281
 282     void dumpSvg(const char* pName,
 283                  const ::basegfx::B2DPolyPolygon& rPoly) const
 284     {
 285         (void)pName; (void)rPoly;
 286 #if OSL_DEBUG_LEVEL > 2
 287         fprintf(stderr, "%s - svg:d=\"%s\"\n",
 288                 pName, OUStringToOString(
 289                     basegfx::utils::exportToSvgD(rPoly, , true, true, false),
 290                     RTL_TEXTENCODING_UTF8).getStr() );
 291 #endif
 292     }
 293
 294     void getPolyPolygon()
 295     {
 296         dumpSvg("disjunct",aDisjunctRanges.solveCrossovers());
 297         dumpSvg("equal",aEqualRanges.solveCrossovers());
 298         dumpSvg("intersectionN",aIntersectionN.solveCrossovers());
 299         dumpSvg("intersectionE",aIntersectionE.solveCrossovers());
 300         dumpSvg("intersectionS",aIntersectionS.solveCrossovers());
 301         dumpSvg("intersectionW",aIntersectionW.solveCrossovers());
 302         dumpSvg("intersectionNE",aIntersectionNE.solveCrossovers());
 303         dumpSvg("intersectionSE",aIntersectionSE.solveCrossovers());
 304         dumpSvg("intersectionSW",aIntersectionSW.solveCrossovers());
 305         dumpSvg("intersectionNW",aIntersectionNW.solveCrossovers());
 306         dumpSvg("ringIntersection",aRingIntersection.solveCrossovers());
 307         dumpSvg("ringIntersection2",aRingIntersection2.solveCrossovers());
 308         dumpSvg("aRingIntersectExtraStrip",aRingIntersectExtraStrip.solveCrossovers());
 309         dumpSvg("complexIntersections",aComplexIntersections.solveCrossovers());
 310         dumpSvg("randomIntersections",aRandomIntersections.solveCrossovers());
 311
 312         CPPUNIT_ASSERT_MESSAGE("getPolyPolygon", true );
 313     }
 314
 315     void validatePoly( const char* pName, const B2DPolyRange& rRange ) const
 316     {
 317         B2DPolyPolygon genericClip;
 318         const sal_uInt32 nCount=rRange.count();
 319         for( sal_uInt32 i=0; i<nCount; ++i )
 320         {
 321             B2DPolygon aRect=utils::createPolygonFromRect(std::get<0>(rRange.getElement(i)));
 322             if( std::get<1>(rRange.getElement(i)) == B2VectorOrientation::Negative )
 323                 aRect.flip();
 324
 325             genericClip.append(aRect);
 326         }
 327
 328 #if OSL_DEBUG_LEVEL > 2
 329         fprintf(stderr, "%s input      - svg:d=\"%s\"\n",
 330                 pName, OUStringToOString(
 331                     basegfx::utils::exportToSvgD(
 332                         genericClip, , true, true, false),
 333                     RTL_TEXTENCODING_UTF8).getStr() );
 334 #endif
 335
 336         const B2DPolyPolygon boxClipResult=rRange.solveCrossovers();
 337         const OUString boxClipSvg(
 338             basegfx::utils::exportToSvgD(
 339                 normalizePoly(boxClipResult), true, true, false));
 340 #if OSL_DEBUG_LEVEL > 2
 341         fprintf(stderr, "%s boxclipper - svg:d=\"%s\"\n",
 342                 pName, OUStringToOString(
 343                     boxClipSvg,
 344                     RTL_TEXTENCODING_UTF8).getStr() );
 345 #endif
 346
 347         genericClip = utils::solveCrossovers(genericClip);
 348         const OUString genericClipSvg(
 349             basegfx::utils::exportToSvgD(
 350                 normalizePoly(genericClip), true, true, false));
 351 #if OSL_DEBUG_LEVEL > 2
 352         fprintf(stderr, "%s genclipper - svg:d=\"%s\"\n",
 353                 pName, OUStringToOString(
 354                     genericClipSvg,
 355                     RTL_TEXTENCODING_UTF8).getStr() );
 356 #endif
 357
 358         CPPUNIT_ASSERT_EQUAL_MESSAGE(pName,
 359                                boxClipSvg, genericClipSvg);
 360     }
 361
 362     void validatePoly()
 363     {
 364         validatePoly("disjunct", aDisjunctRanges);
 365         validatePoly("equal", aEqualRanges);
 366         validatePoly("intersectionN", aIntersectionN);
 367         validatePoly("intersectionE", aIntersectionE);
 368         validatePoly("intersectionS", aIntersectionS);
 369         validatePoly("intersectionW", aIntersectionW);
 370         validatePoly("intersectionNE", aIntersectionNE);
 371         validatePoly("intersectionSE", aIntersectionSE);
 372         validatePoly("intersectionSW", aIntersectionSW);
 373         validatePoly("intersectionNW", aIntersectionNW);
 374         // subtle differences on Solaris Intel, comparison not smart enough
 375         // (due to floating point inaccuracies)
 376         //validatePoly("ringIntersection", aRingIntersection);
 377         //validatePoly("ringIntersection2", aRingIntersection2);
 378         //validatePoly("ringIntersectExtraStrip", aRingIntersectExtraStrip);
 379         // generic clipper buggy here, likely
 380         //validatePoly("complexIntersections", aComplexIntersections);
 381         //validatePoly("randomIntersections", aRandomIntersections);
 382     }
 383
 384     // Change the following lines only, if you add, remove or rename
 385     // member functions of the current class,
 386     // because these macros are need by auto register mechanism.
 387
 388     CPPUNIT_TEST_SUITE(boxclipper);
 389     CPPUNIT_TEST(validatePoly);
 390     CPPUNIT_TEST(verifyPoly);
 391     CPPUNIT_TEST(getPolyPolygon);
 392     CPPUNIT_TEST_SUITE_END();
 393 };
 394
 395 CPPUNIT_TEST_SUITE_REGISTRATION(basegfx2d::boxclipper);
 396 } // namespace basegfx2d
 397
 398 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */