1 files changed, 0 insertions, 121 deletions
diff --git a/basebmp/source/polypolygonrenderer.cxx b/basebmp/source/polypolygonrenderer.cxx
deleted file mode 100644
index 91cd27340bd0..000000000000
--- a/basebmp/source/polypolygonrenderer.cxx
+++ /dev/null
@@ -1,121 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
-/*
- * This file is part of the LibreOffice project.
- *
- * This Source Code Form is subject to the terms of the Mozilla Public
- * License, v. 2.0. If a copy of the MPL was not distributed with this
- * file, You can obtain one at http://mozilla.org/MPL/2.0/.
- *
- * This file incorporates work covered by the following license notice:
- *
- *   Licensed to the Apache Software Foundation (ASF) under one or more
- *   contributor license agreements. See the NOTICE file distributed
- *   with this work for additional information regarding copyright
- *   ownership. The ASF licenses this file to you under the Apache
- *   License, Version 2.0 (the "License"); you may not use this file
- *   except in compliance with the License. You may obtain a copy of
- *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
- */
-
-#include <polypolygonrenderer.hxx>
-
-#include <algorithm>
-
-
-namespace basebmp
-{
-namespace detail
-{
-    sal_uInt32 setupGlobalEdgeTable( VectorOfVectorOfVertices&      rGET,
-                                     basegfx::B2DPolyPolygon const& rPolyPoly,
-                                     sal_Int32                      nMinY )
-    {
-        sal_Int32 const nNumScanlines( (sal_Int32)rGET.size() );
-
-        // add all polygons to GET
-        for( sal_uInt32 i(0), nCount(rPolyPoly.count());
-             i<nCount;
-             ++i )
-        {
-            // add all vertices to GET
-            const basegfx::B2DPolygon& rPoly( rPolyPoly.getB2DPolygon(i) );
-            for( sal_uInt32 k(0), nVertices(rPoly.count());
-                 k<nVertices;
-                 ++k )
-            {
-                const basegfx::B2DPoint& rP1( rPoly.getB2DPoint(k) );
-                const basegfx::B2DPoint& rP2( rPoly.getB2DPoint( (k + 1) % nVertices ) );
-
-                const sal_Int32 nVertexYP1( basegfx::fround(rP1.getY()) );
-                const sal_Int32 nVertexYP2( basegfx::fround(rP2.getY()) );
-
-                // insert only vertices which are not strictly
-                // horizontal. Strictly horizontal vertices don't add
-                // any information that is not already present - due
-                // to their adjacent vertices.
-                if(nVertexYP1 != nVertexYP2)
-                {
-                    if( nVertexYP2 < nVertexYP1 )
-                    {
-                        const sal_Int32 nStartScanline(nVertexYP2 - nMinY);
-
-                        // edge direction is upwards - add with swapped vertices
-                        if( nStartScanline < nNumScanlines )
-                            rGET[ nStartScanline ].push_back( Vertex(rP2, rP1, false) );
-                    }
-                    else
-                    {
-                        const sal_Int32 nStartScanline(nVertexYP1 - nMinY);
-
-                        if( nStartScanline < nNumScanlines )
-                            rGET[ nStartScanline ].push_back( Vertex(rP1, rP2, true) );
-                    }
-                }
-            }
-        }
-
-        // now sort all scanlines individually, with increasing x
-        // coordinates
-        VectorOfVectorOfVertices::iterator       aIter( rGET.begin() );
-        const VectorOfVectorOfVertices::iterator aEnd( rGET.end() );
-        sal_uInt32                               nVertexCount(0);
-        RasterConvertVertexComparator            aComp;
-        while( aIter != aEnd )
-        {
-            std::sort( aIter->begin(),
-                       aIter->end(),
-                       aComp );
-            nVertexCount += aIter->size();
-
-            ++aIter;
-        }
-
-        return nVertexCount;
-    }
-
-    void sortAET( VectorOfVertexPtr& rAETSrc,
-                  VectorOfVertexPtr& rAETDest )
-    {
-        static RasterConvertVertexComparator aComp;
-
-        rAETDest.clear();
-
-        // prune AET from ended edges
-        VectorOfVertexPtr::iterator iter( rAETSrc.begin() );
-        VectorOfVertexPtr::iterator const end( rAETSrc.end() );
-        while( iter != end )
-        {
-            if( (*iter)->mnYCounter > 0 )
-                rAETDest.push_back( *iter );
-            ++iter;
-        }
-
-        // stable sort is necessary, to avoid segment crossing where
-        // none was intended.
-        std::stable_sort( rAETDest.begin(), rAETDest.end(), aComp );
-    }
-
-} // namespace detail
-} // namespace basebmp
-
-/* vim:set shiftwidth=4 softtabstop=4 expandtab: */