CWS gnumake4: convert basegfx to new build system [hg:e8f9d107b59a]

1 files changed, 73 insertions, 72 deletions

diff --git a/basegfx/inc/basegfx/polygon/b2dpolygontools.hxx b/basegfx/inc/basegfx/polygon/b2dpolygontools.hxx
index 7d1d0bc9660c..977b498a9e1f 100644
--- a/basegfx/inc/basegfx/polygon/b2dpolygontools.hxx
+++ b/basegfx/inc/basegfx/polygon/b2dpolygontools.hxx
@@ -34,6 +34,7 @@
 #include <basegfx/polygon/b2dpolypolygon.hxx>
 #include <basegfx/polygon/b3dpolygon.hxx>
 #include <vector>
+#include <basegfx/basegfxdllapi.h>
 
 //////////////////////////////////////////////////////////////////////////////
 
@@ -48,8 +49,8 @@ namespace basegfx
         // B2DPolygon tools
 
         // open/close with point add/remove and control point corrections
-        void openWithGeometryChange(B2DPolygon& rCandidate);
-        void closeWithGeometryChange(B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC void openWithGeometryChange(B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC void closeWithGeometryChange(B2DPolygon& rCandidate);
 
         /** Check if given polygon is closed.
 
@@ -60,20 +61,20 @@ namespace basegfx
             start/end points) and sets the Closed()-state of the
             polygon correctly.
         */
-        void checkClosed(B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC void checkClosed(B2DPolygon& rCandidate);
 
         // Get successor and predecessor indices. Returning the same index means there
         // is none. Same for successor.
-        sal_uInt32 getIndexOfPredecessor(sal_uInt32 nIndex, const B2DPolygon& rCandidate);
-        sal_uInt32 getIndexOfSuccessor(sal_uInt32 nIndex, const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC sal_uInt32 getIndexOfPredecessor(sal_uInt32 nIndex, const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC sal_uInt32 getIndexOfSuccessor(sal_uInt32 nIndex, const B2DPolygon& rCandidate);
 
         // Get orientation of Polygon
-        B2VectorOrientation getOrientation(const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC B2VectorOrientation getOrientation(const B2DPolygon& rCandidate);
 
         // isInside tests for B2dPoint and other B2dPolygon. On border is not inside as long as
         // not true is given in bWithBorder flag.
-        bool isInside(const B2DPolygon& rCandidate, const B2DPoint& rPoint, bool bWithBorder = false);
-        bool isInside(const B2DPolygon& rCandidate, const B2DPolygon& rPolygon, bool bWithBorder = false);
+        BASEGFX_DLLPUBLIC bool isInside(const B2DPolygon& rCandidate, const B2DPoint& rPoint, bool bWithBorder = false);
+        BASEGFX_DLLPUBLIC bool isInside(const B2DPolygon& rCandidate, const B2DPolygon& rPolygon, bool bWithBorder = false);
 
         /** Get the range of a polygon including bezier control points
 
@@ -85,7 +86,7 @@ namespace basegfx
             @return
             The outer range of the bezier curve containing bezier control points
         */
-        B2DRange getRangeWithControlPoints(const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC B2DRange getRangeWithControlPoints(const B2DPolygon& rCandidate);
 
         /** Get the range of a polygon
 
@@ -98,53 +99,53 @@ namespace basegfx
             @return
             The outer range of the bezier curve
         */
-        B2DRange getRange(const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC B2DRange getRange(const B2DPolygon& rCandidate);
 
         // get signed area of polygon
-        double getSignedArea(const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC double getSignedArea(const B2DPolygon& rCandidate);
 
         // get area of polygon
-        double getArea(const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC double getArea(const B2DPolygon& rCandidate);
 
         /** get length of polygon edge from point nIndex to nIndex + 1 */
-        double getEdgeLength(const B2DPolygon& rCandidate, sal_uInt32 nIndex);
+        BASEGFX_DLLPUBLIC double getEdgeLength(const B2DPolygon& rCandidate, sal_uInt32 nIndex);
 
         /** get length of polygon */
-        double getLength(const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC double getLength(const B2DPolygon& rCandidate);
 
         // get position on polygon for absolute given distance. If
         // length is given, it is assumed the correct polygon length, if 0.0 it is calculated
         // using getLength(...)
-        B2DPoint getPositionAbsolute(const B2DPolygon& rCandidate, double fDistance, double fLength = 0.0);
+        BASEGFX_DLLPUBLIC B2DPoint getPositionAbsolute(const B2DPolygon& rCandidate, double fDistance, double fLength = 0.0);
 
         // get position on polygon for relative given distance in range [0.0 .. 1.0]. If
         // length is given, it is assumed the correct polygon length, if 0.0 it is calculated
         // using getLength(...)
-        B2DPoint getPositionRelative(const B2DPolygon& rCandidate, double fDistance, double fLength = 0.0);
+        BASEGFX_DLLPUBLIC B2DPoint getPositionRelative(const B2DPolygon& rCandidate, double fDistance, double fLength = 0.0);
 
         // get a snippet from given polygon for absolute distances. The polygon is assumed
         // to be opened (not closed). fFrom and fTo need to be in range [0.0 .. fLength], where
         // fTo >= fFrom. If length is given, it is assumed the correct polygon length,
         // if 0.0 it is calculated using getLength(...)
-        B2DPolygon getSnippetAbsolute(const B2DPolygon& rCandidate, double fFrom, double fTo, double fLength = 0.0);
+        BASEGFX_DLLPUBLIC B2DPolygon getSnippetAbsolute(const B2DPolygon& rCandidate, double fFrom, double fTo, double fLength = 0.0);
 
         // get a snippet from given polygon for relative distances. The polygon is assumed
         // to be opened (not closed). fFrom and fTo need to be in range [0.0 .. 1.0], where
         // fTo >= fFrom. If length is given, it is assumed the correct polygon length,
         // if 0.0 it is calculated using getLength(...)
-        B2DPolygon getSnippetRelative(const B2DPolygon& rCandidate, double fFrom = 0.0, double fTo = 1.0, double fLength = 0.0);
+        BASEGFX_DLLPUBLIC B2DPolygon getSnippetRelative(const B2DPolygon& rCandidate, double fFrom = 0.0, double fTo = 1.0, double fLength = 0.0);
 
         // Continuity check for point with given index
-        B2VectorContinuity getContinuityInPoint(const B2DPolygon& rCandidate, sal_uInt32 nIndex);
+        BASEGFX_DLLPUBLIC B2VectorContinuity getContinuityInPoint(const B2DPolygon& rCandidate, sal_uInt32 nIndex);
 
         // Subdivide all contained curves. Use distanceBound value if given.
-        B2DPolygon adaptiveSubdivideByDistance(const B2DPolygon& rCandidate, double fDistanceBound = 0.0);
+        BASEGFX_DLLPUBLIC B2DPolygon adaptiveSubdivideByDistance(const B2DPolygon& rCandidate, double fDistanceBound = 0.0);
 
         // Subdivide all contained curves. Use angleBound value if given.
-        B2DPolygon adaptiveSubdivideByAngle(const B2DPolygon& rCandidate, double fAngleBound = 0.0);
+        BASEGFX_DLLPUBLIC B2DPolygon adaptiveSubdivideByAngle(const B2DPolygon& rCandidate, double fAngleBound = 0.0);
 
         // #i37443# Subdivide all contained curves.
-        B2DPolygon adaptiveSubdivideByCount(const B2DPolygon& rCandidate, sal_uInt32 nCount = 0L);
+        BASEGFX_DLLPUBLIC B2DPolygon adaptiveSubdivideByCount(const B2DPolygon& rCandidate, sal_uInt32 nCount = 0L);
 
         // Definitions for the cut flags used from the findCut methods
         typedef sal_uInt16 CutFlagValue;
@@ -161,7 +162,7 @@ namespace basegfx
         // Calculate cut between the points given by the two indices. pCut1
         // and pCut2 will contain the cut coordinate on each edge in ]0.0, 1.0]
         // (if given) and the return value will contain a cut description.
-        CutFlagValue findCut(
+        BASEGFX_DLLPUBLIC CutFlagValue findCut(
             const B2DPolygon& rCandidate,
             sal_uInt32 nIndex1, sal_uInt32 nIndex2,
             CutFlagValue aCutFlags = CUTFLAG_DEFAULT,
@@ -169,7 +170,7 @@ namespace basegfx
 
         // This version is working with two indexed edges from different
         // polygons.
-        CutFlagValue findCut(
+        BASEGFX_DLLPUBLIC CutFlagValue findCut(
             const B2DPolygon& rCandidate1, sal_uInt32 nIndex1,
             const B2DPolygon& rCandidate2, sal_uInt32 nIndex2,
             CutFlagValue aCutFlags = CUTFLAG_DEFAULT,
@@ -177,7 +178,7 @@ namespace basegfx
 
         // This version works with two points and vectors to define the
         // edges for the cut test.
-        CutFlagValue findCut(
+        BASEGFX_DLLPUBLIC CutFlagValue findCut(
             const B2DPoint& rEdge1Start, const B2DVector& rEdge1Delta,
             const B2DPoint& rEdge2Start, const B2DVector& rEdge2Delta,
             CutFlagValue aCutFlags = CUTFLAG_DEFAULT,
@@ -186,7 +187,7 @@ namespace basegfx
         // test if point is on the given edge in range ]0.0..1.0[ without
         // the start/end points. If so, return true and put the parameter
         // value in pCut (if provided)
-        bool isPointOnEdge(
+        BASEGFX_DLLPUBLIC bool isPointOnEdge(
             const B2DPoint& rPoint,
             const B2DPoint& rEdgeStart,
             const B2DVector& rEdgeDelta,
@@ -225,7 +226,7 @@ namespace basegfx
             The sumed-up length of the rDotDashArray. If zero, it will
             be calculated internally.
         */
-        void applyLineDashing(
+        BASEGFX_DLLPUBLIC void applyLineDashing(
             const B2DPolygon& rCandidate,
             const ::std::vector<double>& rDotDashArray,
             B2DPolyPolygon* pLineTarget,
@@ -236,13 +237,13 @@ namespace basegfx
         // by the two given points. Can be used for HitTesting. The epsilon-range
         // is defined to be the rectangle centered to the given edge, using height
         // 2 x fDistance, and the circle around both points with radius fDistance.
-        bool isInEpsilonRange(const B2DPoint& rEdgeStart, const B2DPoint& rEdgeEnd, const B2DPoint& rTestPosition, double fDistance);
+        BASEGFX_DLLPUBLIC bool isInEpsilonRange(const B2DPoint& rEdgeStart, const B2DPoint& rEdgeEnd, const B2DPoint& rTestPosition, double fDistance);
 
         // test if point is inside epsilon-range around the given Polygon. Can be used
         // for HitTesting. The epsilon-range is defined to be the rectangle centered
         // to the given edge, using height 2 x fDistance, and the circle around both points
         // with radius fDistance.
-        bool isInEpsilonRange(const B2DPolygon& rCandidate, const B2DPoint& rTestPosition, double fDistance);
+        BASEGFX_DLLPUBLIC bool isInEpsilonRange(const B2DPolygon& rCandidate, const B2DPoint& rTestPosition, double fDistance);
 
         /** Create a polygon from a rectangle.
 
@@ -253,7 +254,7 @@ namespace basegfx
             Radius of the edge rounding, relative to the rectangle size. 0.0 means no
             rounding, 1.0 will lead to an ellipse
          */
-        B2DPolygon createPolygonFromRect( const B2DRectangle& rRect, double fRadius );
+        BASEGFX_DLLPUBLIC B2DPolygon createPolygonFromRect( const B2DRectangle& rRect, double fRadius );
 
         /** Create a polygon from a rectangle.
 
@@ -265,15 +266,15 @@ namespace basegfx
             Radius of the edge rounding, relative to the rectangle size. 0.0 means no
             rounding, 1.0 will lead to an ellipse
          */
-        B2DPolygon createPolygonFromRect( const B2DRectangle& rRect, double fRadiusX, double fRadiusY );
+        BASEGFX_DLLPUBLIC B2DPolygon createPolygonFromRect( const B2DRectangle& rRect, double fRadiusX, double fRadiusY );
 
         /** Create a polygon from a rectangle.
          */
-        B2DPolygon createPolygonFromRect( const B2DRectangle& rRect );
+        BASEGFX_DLLPUBLIC B2DPolygon createPolygonFromRect( const B2DRectangle& rRect );
 
         /** Create the unit polygon
          */
-        B2DPolygon createUnitPolygon();
+        BASEGFX_DLLPUBLIC B2DPolygon createUnitPolygon();
 
         /** Create a circle polygon with given radius.
 
@@ -287,7 +288,7 @@ namespace basegfx
             @param fRadius
             Radius of the circle
          */
-        B2DPolygon createPolygonFromCircle( const B2DPoint& rCenter, double fRadius );
+        BASEGFX_DLLPUBLIC B2DPolygon createPolygonFromCircle( const B2DPoint& rCenter, double fRadius );
 
         /** create a polygon which describes the unit circle and close it
 
@@ -299,7 +300,7 @@ namespace basegfx
             this is the lowest one). This is needed since when lines are dashed, toe old
             geometry started at bottom point, else it would look different.
          */
-        B2DPolygon createPolygonFromUnitCircle(sal_uInt32 nStartQuadrant = 0);
+        BASEGFX_DLLPUBLIC B2DPolygon createPolygonFromUnitCircle(sal_uInt32 nStartQuadrant = 0);
 
         /** Create an ellipse polygon with given radii.
 
@@ -316,13 +317,13 @@ namespace basegfx
             @param fRadiusY
             Radius of the ellipse in Y direction
          */
-        B2DPolygon createPolygonFromEllipse( const B2DPoint& rCenter, double fRadiusX, double fRadiusY );
+        BASEGFX_DLLPUBLIC B2DPolygon createPolygonFromEllipse( const B2DPoint& rCenter, double fRadiusX, double fRadiusY );
 
         /** Create an unit ellipse polygon with the given angles, from start to end
          */
-        B2DPolygon createPolygonFromEllipseSegment( const B2DPoint& rCenter, double fRadiusX, double fRadiusY, double   fStart, double fEnd );
+        BASEGFX_DLLPUBLIC B2DPolygon createPolygonFromEllipseSegment( const B2DPoint& rCenter, double fRadiusX, double fRadiusY, double fStart, double fEnd );
 
-        B2DPolygon createPolygonFromUnitEllipseSegment( double fStart, double fEnd );
+        BASEGFX_DLLPUBLIC B2DPolygon createPolygonFromUnitEllipseSegment( double fStart, double fEnd );
 
         /** Predicate whether a given polygon is a rectangle.
 
@@ -334,111 +335,111 @@ namespace basegfx
             enumerations of a rectangle's vertices). Note that
             intermediate points and duplicate points are ignored.
          */
-        bool isRectangle( const B2DPolygon& rPoly );
+        BASEGFX_DLLPUBLIC bool isRectangle( const B2DPolygon& rPoly );
 
         // create 3d polygon from given 2d polygon. The given fZCoordinate is used to expand the
         // third coordinate.
-        B3DPolygon createB3DPolygonFromB2DPolygon(const B2DPolygon& rCandidate, double fZCoordinate = 0.0);
+        BASEGFX_DLLPUBLIC B3DPolygon createB3DPolygonFromB2DPolygon(const B2DPolygon& rCandidate, double fZCoordinate = 0.0);
 
         // create 2d PolyPolygon from given 3d PolyPolygon. All coordinates are transformed using the given
         // matrix and the resulting x,y is used to form the new polygon.
-        B2DPolygon createB2DPolygonFromB3DPolygon(const B3DPolygon& rCandidate, const B3DHomMatrix& rMat);
+        BASEGFX_DLLPUBLIC B2DPolygon createB2DPolygonFromB3DPolygon(const B3DPolygon& rCandidate, const B3DHomMatrix& rMat);
 
         // create simplified version of the original polygon by
         // replacing segments with spikes/loops and self intersections
         // by several trivial sub-segments
-        B2DPolygon createSimplifiedPolygon(const B2DPolygon&);
+        BASEGFX_DLLPUBLIC B2DPolygon createSimplifiedPolygon(const B2DPolygon&);
 
         // calculate the distance to the given endless ray and return. The relative position on the edge is returned in Cut.
         // That position may be less than 0.0 or more than 1.0
-        double getDistancePointToEndlessRay(const B2DPoint& rPointA, const B2DPoint& rPointB, const B2DPoint& rTestPoint, double& rCut);
+        BASEGFX_DLLPUBLIC double getDistancePointToEndlessRay(const B2DPoint& rPointA, const B2DPoint& rPointB, const B2DPoint& rTestPoint, double& rCut);
 
         // calculate the smallest distance to given edge and return. The relative position on the edge is returned in Cut.
         // That position is in the range [0.0 .. 1.0] and the returned distance is adapted accordingly to the start or end
         // point of the edge
-        double getSmallestDistancePointToEdge(const B2DPoint& rPointA, const B2DPoint& rPointB, const B2DPoint& rTestPoint, double& rCut);
+        BASEGFX_DLLPUBLIC double getSmallestDistancePointToEdge(const B2DPoint& rPointA, const B2DPoint& rPointB, const B2DPoint& rTestPoint, double& rCut);
 
         // for each contained edge calculate the smallest distance. Return the index to the smallest
         // edge in rEdgeIndex. The relative position on the edge is returned in rCut.
         // If nothing was found (e.g. empty input plygon), DBL_MAX is returned.
-        double getSmallestDistancePointToPolygon(const B2DPolygon& rCandidate, const B2DPoint& rTestPoint, sal_uInt32& rEdgeIndex, double& rCut);
+        BASEGFX_DLLPUBLIC double getSmallestDistancePointToPolygon(const B2DPolygon& rCandidate, const B2DPoint& rTestPoint, sal_uInt32& rEdgeIndex, double& rCut);
 
         // distort single point. rOriginal describes the original range, where the given points describe the distorted corresponding points.
-        B2DPoint distort(const B2DPoint& rCandidate, const B2DRange& rOriginal, const B2DPoint& rTopLeft, const B2DPoint& rTopRight, const B2DPoint& rBottomLeft, const B2DPoint& rBottomRight);
+        BASEGFX_DLLPUBLIC B2DPoint distort(const B2DPoint& rCandidate, const B2DRange& rOriginal, const B2DPoint& rTopLeft, const B2DPoint& rTopRight, const B2DPoint& rBottomLeft, const B2DPoint& rBottomRight);
 
         // distort polygon. rOriginal describes the original range, where the given points describe the distorted corresponding points.
-        B2DPolygon distort(const B2DPolygon& rCandidate, const B2DRange& rOriginal, const B2DPoint& rTopLeft, const B2DPoint& rTopRight, const B2DPoint& rBottomLeft, const B2DPoint& rBottomRight);
+        BASEGFX_DLLPUBLIC B2DPolygon distort(const B2DPolygon& rCandidate, const B2DRange& rOriginal, const B2DPoint& rTopLeft, const B2DPoint& rTopRight, const B2DPoint& rBottomLeft, const B2DPoint& rBottomRight);
 
         // rotate polygon around given point with given angle.
-        B2DPolygon rotateAroundPoint(const B2DPolygon& rCandidate, const B2DPoint& rCenter, double fAngle);
+        BASEGFX_DLLPUBLIC B2DPolygon rotateAroundPoint(const B2DPolygon& rCandidate, const B2DPoint& rCenter, double fAngle);
 
         // expand all segments (which are not yet) to curve segments. This is done with setting the control
         // vectors on the 1/3 resp. 2/3 distances on each segment.
-        B2DPolygon expandToCurve(const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC B2DPolygon expandToCurve(const B2DPolygon& rCandidate);
 
         // expand given segment to curve segment. This is done with setting the control
         // vectors on the 1/3 resp. 2/3 distances. The return value describes if a change took place.
-        bool expandToCurveInPoint(B2DPolygon& rCandidate, sal_uInt32 nIndex);
+        BASEGFX_DLLPUBLIC bool expandToCurveInPoint(B2DPolygon& rCandidate, sal_uInt32 nIndex);
 
         // set continuity for the whole curve. If not a curve, nothing will change. Non-curve points are not changed, too.
         B2DPolygon setContinuity(const B2DPolygon& rCandidate, B2VectorContinuity eContinuity);
 
         // set continuity for given index. If not a curve, nothing will change. Non-curve points are not changed, too.
         // The return value describes if a change took place.
-        bool setContinuityInPoint(B2DPolygon& rCandidate, sal_uInt32 nIndex, B2VectorContinuity eContinuity);
+        BASEGFX_DLLPUBLIC bool setContinuityInPoint(B2DPolygon& rCandidate, sal_uInt32 nIndex, B2VectorContinuity eContinuity);
 
         // test if polygon contains neutral points. A neutral point is one whos orientation is neutral
         // e.g. positioned on the edge of it's predecessor and successor
-        bool hasNeutralPoints(const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC bool hasNeutralPoints(const B2DPolygon& rCandidate);
 
         // remove neutral points. A neutral point is one whos orientation is neutral
         // e.g. positioned on the edge of it's predecessor and successor
-        B2DPolygon removeNeutralPoints(const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC B2DPolygon removeNeutralPoints(const B2DPolygon& rCandidate);
 
         // tests if polygon is convex
-        bool isConvex(const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC bool isConvex(const B2DPolygon& rCandidate);
 
         // calculates the orientation at edge nIndex
-        B2VectorOrientation getOrientationForIndex(const B2DPolygon& rCandidate, sal_uInt32 nIndex);
+        BASEGFX_DLLPUBLIC B2VectorOrientation getOrientationForIndex(const B2DPolygon& rCandidate, sal_uInt32 nIndex);
 
         // calculates if given point is on given line, taking care of the numerical epsilon
-        bool isPointOnLine(const B2DPoint& rStart, const B2DPoint& rEnd, const B2DPoint& rCandidate, bool bWithPoints = false);
+        BASEGFX_DLLPUBLIC bool isPointOnLine(const B2DPoint& rStart, const B2DPoint& rEnd, const B2DPoint& rCandidate, bool bWithPoints = false);
 
         // calculates if given point is on given polygon, taking care of the numerical epsilon. Uses
         // isPointOnLine internally
-        bool isPointOnPolygon(const B2DPolygon& rCandidate, const B2DPoint& rPoint, bool bWithPoints = true);
+        BASEGFX_DLLPUBLIC bool isPointOnPolygon(const B2DPolygon& rCandidate, const B2DPoint& rPoint, bool bWithPoints = true);
 
         // test if candidate is inside triangle
-        bool isPointInTriangle(const B2DPoint& rA, const B2DPoint& rB, const B2DPoint& rC, const B2DPoint& rCandidate, bool bWithBorder = false);
+        BASEGFX_DLLPUBLIC bool isPointInTriangle(const B2DPoint& rA, const B2DPoint& rB, const B2DPoint& rC, const B2DPoint& rCandidate, bool bWithBorder = false);
 
         // test if candidateA and candidateB are on the same side of the given line
-        bool arePointsOnSameSideOfLine(const B2DPoint& rStart, const B2DPoint& rEnd, const B2DPoint& rCandidateA, const B2DPoint& rCandidateB, bool bWithLine = false);
+        BASEGFX_DLLPUBLIC bool arePointsOnSameSideOfLine(const B2DPoint& rStart, const B2DPoint& rEnd, const B2DPoint& rCandidateA, const B2DPoint& rCandidateB, bool bWithLine = false);
 
         // add triangles for given rCandidate to rTarget. For each triangle, 3 points will be added to rCandidate.
         // All triangles will go from the start point of rCandidate to two consecutive points, building (rCandidate.count() - 2)
         // triangles.
-        void addTriangleFan(const B2DPolygon& rCandidate, B2DPolygon& rTarget);
+        BASEGFX_DLLPUBLIC void addTriangleFan(const B2DPolygon& rCandidate, B2DPolygon& rTarget);
 
         // grow for polygon. Move all geometry in each point in the direction of the normal in that point
         // with the given amount. Value may be negative.
-        B2DPolygon growInNormalDirection(const B2DPolygon& rCandidate, double fValue);
+        BASEGFX_DLLPUBLIC B2DPolygon growInNormalDirection(const B2DPolygon& rCandidate, double fValue);
 
         // force all sub-polygons to a point count of nSegments
-        B2DPolygon reSegmentPolygon(const B2DPolygon& rCandidate, sal_uInt32 nSegments);
+        BASEGFX_DLLPUBLIC B2DPolygon reSegmentPolygon(const B2DPolygon& rCandidate, sal_uInt32 nSegments);
 
         // create polygon state at t from 0.0 to 1.0 between the two polygons. Both polygons must have the same
         // organisation, e.g. same amount of points
-        B2DPolygon interpolate(const B2DPolygon& rOld1, const B2DPolygon& rOld2, double t);
+        BASEGFX_DLLPUBLIC B2DPolygon interpolate(const B2DPolygon& rOld1, const B2DPolygon& rOld2, double t);
 
-        bool isPolyPolygonEqualRectangle( const B2DPolyPolygon& rPolyPoly, const B2DRange& rRect );
+        BASEGFX_DLLPUBLIC bool isPolyPolygonEqualRectangle( const B2DPolyPolygon& rPolyPoly, const B2DRange& rRect );
 
         // #i76891# Try to remove existing curve segments if they are simply edges
-        B2DPolygon simplifyCurveSegments(const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC B2DPolygon simplifyCurveSegments(const B2DPolygon& rCandidate);
 
         // makes the given indexed point the new polygon start point. To do that, the points in the
         // polygon will be rotated. This is only valid for closed polygons, for non-closed ones
         // an assertion will be triggered
-        B2DPolygon makeStartPoint(const B2DPolygon& rCandidate, sal_uInt32 nIndexOfNewStatPoint);
+        BASEGFX_DLLPUBLIC B2DPolygon makeStartPoint(const B2DPolygon& rCandidate, sal_uInt32 nIndexOfNewStatPoint);
 
         /** create edges of given length along given B2DPolygon
 
@@ -468,7 +469,7 @@ namespace basegfx
             @return
             The newly created polygon
          */
-        B2DPolygon createEdgesOfGivenLength(const B2DPolygon& rCandidate, double fLength, double fStart = 0.0, double fEnd = 0.0);
+        BASEGFX_DLLPUBLIC B2DPolygon createEdgesOfGivenLength(const B2DPolygon& rCandidate, double fLength, double fStart = 0.0, double fEnd = 0.0);
 
         /** Create Waveline along given polygon
             The implementation is based on createEdgesOfGivenLength and creates a curve
@@ -485,7 +486,7 @@ namespace basegfx
             @param fgWaveHeight
             The height of the waveline (amplitude)
         */
-        B2DPolygon createWaveline(const B2DPolygon& rCandidate, double fWaveWidth, double fWaveHeight);
+        BASEGFX_DLLPUBLIC B2DPolygon createWaveline(const B2DPolygon& rCandidate, double fWaveWidth, double fWaveHeight);
 
         /** split each edge of a polygon in exactly nSubEdges equidistant edges
 
@@ -507,12 +508,12 @@ namespace basegfx
             into nSubEdges part curved edges of equidistant length. If not,
             straight edges will just be copied.
         */
-        B2DPolygon reSegmentPolygonEdges(const B2DPolygon& rCandidate, sal_uInt32 nSubEdges, bool bHandleCurvedEdges, bool bHandleStraightEdges);
+        BASEGFX_DLLPUBLIC B2DPolygon reSegmentPolygonEdges(const B2DPolygon& rCandidate, sal_uInt32 nSubEdges, bool bHandleCurvedEdges, bool bHandleStraightEdges);
 
         //////////////////////////////////////////////////////////////////////
         // comparators with tolerance for 2D Polygons
-        bool equal(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB, const double& rfSmallValue);
-        bool equal(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB);
+        BASEGFX_DLLPUBLIC bool equal(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB, const double& rfSmallValue);
+        BASEGFX_DLLPUBLIC bool equal(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB);
 
         /** snap some polygon coordinates to discrete coordinates
 
@@ -526,7 +527,7 @@ namespace basegfx
             @return
             The modified version of the source polygon
         */
-        B2DPolygon snapPointsOfHorizontalOrVerticalEdges(const B2DPolygon& rCandidate);
+        BASEGFX_DLLPUBLIC B2DPolygon snapPointsOfHorizontalOrVerticalEdges(const B2DPolygon& rCandidate);
 
     } // end of namespace tools
 } // end of namespace basegfx