diff options
Diffstat (limited to 'basegfx/source/polygon/b2dpolygoncutandtouch.cxx')
| -rw-r--r-- | basegfx/source/polygon/b2dpolygoncutandtouch.cxx | 55 |
1 files changed, 0 insertions, 55 deletions
diff --git a/basegfx/source/polygon/b2dpolygoncutandtouch.cxx b/basegfx/source/polygon/b2dpolygoncutandtouch.cxx index 927af8828c91..3eae85f5c500 100644 --- a/basegfx/source/polygon/b2dpolygoncutandtouch.cxx +++ b/basegfx/source/polygon/b2dpolygoncutandtouch.cxx @@ -30,17 +30,13 @@ #include <vector> #include <algorithm> - #define SUBDIVIDE_FOR_CUT_TEST_COUNT (50) - - namespace basegfx { namespace { - class temporaryPoint { B2DPoint maPoint; // the new point @@ -70,12 +66,8 @@ namespace basegfx double getCut() const { return mfCut; } }; - - typedef ::std::vector< temporaryPoint > temporaryPointVector; - - class temporaryPolygonData { B2DPolygon maPolygon; @@ -89,8 +81,6 @@ namespace basegfx temporaryPointVector& getTemporaryPointVector() { return maPoints; } }; - - B2DPolygon mergeTemporaryPointsAndPolygon(const B2DPolygon& rCandidate, temporaryPointVector& rTempPoints) { // #i76891# mergeTemporaryPointsAndPolygon redesigned to be able to correctly handle @@ -180,8 +170,6 @@ namespace basegfx } } - - void adaptAndTransferCutsWithBezierSegment( const temporaryPointVector& rPointVector, const B2DPolygon& rPolygon, sal_uInt32 nInd, temporaryPointVector& rTempPoints) @@ -205,13 +193,9 @@ namespace basegfx } } - - } // end of anonymous namespace } // end of namespace basegfx - - namespace basegfx { namespace @@ -223,8 +207,6 @@ namespace basegfx void findTouches(const B2DPolygon& rEdgePolygon, const B2DPolygon& rPointPolygon, temporaryPointVector& rTempPoints); void findCuts(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB, temporaryPointVector& rTempPointsA, temporaryPointVector& rTempPointsB); - - void findEdgeCutsTwoEdges( const B2DPoint& rCurrA, const B2DPoint& rNextA, const B2DPoint& rCurrB, const B2DPoint& rNextB, @@ -277,8 +259,6 @@ namespace basegfx } } - - void findCutsAndTouchesAndCommonForBezier(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB, temporaryPointVector& rTempPointsA, temporaryPointVector& rTempPointsB) { // #i76891# @@ -399,8 +379,6 @@ namespace basegfx } } - - void findEdgeCutsBezierAndEdge( const B2DCubicBezier& rCubicA, const B2DPoint& rCurrB, const B2DPoint& rNextB, @@ -440,8 +418,6 @@ namespace basegfx } } - - void findEdgeCutsTwoBeziers( const B2DCubicBezier& rCubicA, const B2DCubicBezier& rCubicB, @@ -481,8 +457,6 @@ namespace basegfx } } - - void findEdgeCutsOneBezier( const B2DCubicBezier& rCubicA, sal_uInt32 nInd, temporaryPointVector& rTempPoints) @@ -514,8 +488,6 @@ namespace basegfx } } - - void findCuts(const B2DPolygon& rCandidate, temporaryPointVector& rTempPoints) { // find out if there are edges with intersections (self-cuts). If yes, add @@ -627,19 +599,14 @@ namespace basegfx } } - - } // end of anonymous namespace } // end of namespace basegfx - - namespace basegfx { namespace { - void findTouchesOnEdge( const B2DPoint& rCurr, const B2DPoint& rNext, const B2DPolygon& rPointPolygon, sal_uInt32 nInd, temporaryPointVector& rTempPoints) @@ -685,8 +652,6 @@ namespace basegfx } } - - void findTouchesOnCurve( const B2DCubicBezier& rCubicA, const B2DPolygon& rPointPolygon, sal_uInt32 nInd, temporaryPointVector& rTempPoints) @@ -711,8 +676,6 @@ namespace basegfx } } - - void findTouches(const B2DPolygon& rEdgePolygon, const B2DPolygon& rPointPolygon, temporaryPointVector& rTempPoints) { // find out if points from rPointPolygon touch edges from rEdgePolygon. If yes, @@ -760,19 +723,14 @@ namespace basegfx } } - - } // end of anonymous namespace } // end of namespace basegfx - - namespace basegfx { namespace { - void findCuts(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB, temporaryPointVector& rTempPointsA, temporaryPointVector& rTempPointsB) { // find out if edges from both polygons cut. If so, add entries to rTempPoints which @@ -880,19 +838,14 @@ namespace basegfx } } - - } // end of anonymous namespace } // end of namespace basegfx - - namespace basegfx { namespace tools { - B2DPolygon addPointsAtCutsAndTouches(const B2DPolygon& rCandidate) { if(rCandidate.count()) @@ -910,8 +863,6 @@ namespace basegfx } } - - B2DPolyPolygon addPointsAtCutsAndTouches(const B2DPolyPolygon& rCandidate, bool bSelfIntersections) { const sal_uInt32 nCount(rCandidate.count()); @@ -995,8 +946,6 @@ namespace basegfx } } - - B2DPolygon addPointsAtCuts(const B2DPolygon& rCandidate, const B2DPoint& rStart, const B2DPoint& rEnd) { const sal_uInt32 nCount(rCandidate.count()); @@ -1044,8 +993,6 @@ namespace basegfx return rCandidate; } - - B2DPolygon addPointsAtCuts(const B2DPolygon& rCandidate, const B2DPolyPolygon& rPolyMask) { const sal_uInt32 nCountA(rCandidate.count()); @@ -1127,8 +1074,6 @@ namespace basegfx return rCandidate; } - - } // end of namespace tools } // end of namespace basegfx |