Remove unused code

2 files changed, 0 insertions, 63 deletions

diff --git a/basegfx/source/polygon/b2dpolygontools.cxx b/basegfx/source/polygon/b2dpolygontools.cxx
index c8d2b37cce93..2104a53c5ef6 100644
--- a/basegfx/source/polygon/b2dpolygontools.cxx
+++ b/basegfx/source/polygon/b2dpolygontools.cxx
@@ -978,19 +978,6 @@ namespace basegfx
             }
         }
 
-        B2DPolygon getSnippetRelative(const B2DPolygon& rCandidate, double fFrom, double fTo, double fLength)
-        {
-            // get length if not given
-            if(fTools::equalZero(fLength))
-            {
-                fLength = getLength(rCandidate);
-            }
-
-            // multiply distances with real length to get absolute position and
-            // use getSnippetAbsolute
-            return getSnippetAbsolute(rCandidate, fFrom * fLength, fTo * fLength, fLength);
-        }
-
         CutFlagValue findCut(
             const B2DPolygon& rCandidate,
             sal_uInt32 nIndex1, sal_uInt32 nIndex2,
@@ -2499,30 +2486,6 @@ namespace basegfx
             return aRetval;
         }
 
-        double getDistancePointToEndlessRay(const B2DPoint& rPointA, const B2DPoint& rPointB, const B2DPoint& rTestPoint, double& rCut)
-        {
-            if(rPointA.equal(rPointB))
-            {
-                rCut = 0.0;
-                const B2DVector aVector(rTestPoint - rPointA);
-                return aVector.getLength();
-            }
-            else
-            {
-                // get the relative cut value on line vector (Vector1) for cut with perpendicular through TestPoint
-                const B2DVector aVector1(rPointB - rPointA);
-                const B2DVector aVector2(rTestPoint - rPointA);
-                const double fDividend((aVector2.getX() * aVector1.getX()) + (aVector2.getY() * aVector1.getY()));
-                const double fDivisor((aVector1.getX() * aVector1.getX()) + (aVector1.getY() * aVector1.getY()));
-
-                rCut = fDividend / fDivisor;
-
-                const B2DPoint aCutPoint(rPointA + rCut * aVector1);
-                const B2DVector aVector(rTestPoint - aCutPoint);
-                return aVector.getLength();
-            }
-        }
-
         double getSmallestDistancePointToEdge(const B2DPoint& rPointA, const B2DPoint& rPointB, const B2DPoint& rTestPoint, double& rCut)
         {
             if(rPointA.equal(rPointB))
diff --git a/basegfx/source/polygon/b2dpolypolygontools.cxx b/basegfx/source/polygon/b2dpolypolygontools.cxx
index e372f725a24f..c49f6a8ab3c9 100644
--- a/basegfx/source/polygon/b2dpolypolygontools.cxx
+++ b/basegfx/source/polygon/b2dpolypolygontools.cxx
@@ -238,20 +238,6 @@ namespace basegfx
             }
         }
 
-        B2DRange getRangeWithControlPoints(const B2DPolyPolygon& rCandidate)
-        {
-            B2DRange aRetval;
-            const sal_uInt32 nPolygonCount(rCandidate.count());
-
-            for(sal_uInt32 a(0L); a < nPolygonCount; a++)
-            {
-                B2DPolygon aCandidate = rCandidate.getB2DPolygon(a);
-                aRetval.expand(tools::getRangeWithControlPoints(aCandidate));
-            }
-
-            return aRetval;
-        }
-
         B2DRange getRange(const B2DPolyPolygon& rCandidate)
         {
             B2DRange aRetval;
@@ -526,18 +512,6 @@ namespace basegfx
             }
         }
 
-        B2DPolyPolygon reSegmentPolyPolygonEdges(const B2DPolyPolygon& rCandidate, sal_uInt32 nSubEdges, bool bHandleCurvedEdges, bool bHandleStraightEdges)
-        {
-            B2DPolyPolygon aRetval;
-
-            for(sal_uInt32 a(0L); a < rCandidate.count(); a++)
-            {
-                aRetval.append(reSegmentPolygonEdges(rCandidate.getB2DPolygon(a), nSubEdges, bHandleCurvedEdges, bHandleStraightEdges));
-            }
-
-            return aRetval;
-        }
-
         //////////////////////////////////////////////////////////////////////
         // comparators with tolerance for 2D PolyPolygons