diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2012-11-20 22:55:55 +0000 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2012-11-20 22:55:55 +0000 |
| commit | d463240d8fd961d45b47ba96e0d93c37e1719da7 (patch) | |
| tree | 25be35855525cba941ff28f0d1ea7684dc1a258c /src/livarot/PathSimplify.cpp | |
| parent | Fix for #970355, radial gradient using object bounding box. (diff) | |
| download | inkscape-d463240d8fd961d45b47ba96e0d93c37e1719da7.tar.gz inkscape-d463240d8fd961d45b47ba96e0d93c37e1719da7.zip | |
code cleanup: quiet warnings with gcc.
(bzr r11888)
Diffstat (limited to 'src/livarot/PathSimplify.cpp')
| -rw-r--r-- | src/livarot/PathSimplify.cpp | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/livarot/PathSimplify.cpp b/src/livarot/PathSimplify.cpp index d6e916197..d9f609e87 100644 --- a/src/livarot/PathSimplify.cpp +++ b/src/livarot/PathSimplify.cpp @@ -70,10 +70,10 @@ void Path::Simplify(double treshhold) // dichomtomic method to get distance to curve approximation // a real polynomial solver would get the minimum more efficiently, but since the polynom // would likely be of degree >= 5, that would imply using some generic solver, liek using the sturm metod -double RecDistanceToCubic(Geom::Point const &iS, Geom::Point const &isD, - Geom::Point const &iE, Geom::Point const &ieD, - Geom::Point &pt, double current, int lev, double st, double et) -{ +static double RecDistanceToCubic(Geom::Point const &iS, Geom::Point const &isD, + Geom::Point const &iE, Geom::Point const &ieD, + Geom::Point &pt, double current, int lev, double st, double et) +{ if ( lev <= 0 ) { return current; } @@ -116,7 +116,7 @@ double RecDistanceToCubic(Geom::Point const &iS, Geom::Point const &isD, } -double DistanceToCubic(Geom::Point const &start, PathDescrCubicTo res, Geom::Point &pt) +static double DistanceToCubic(Geom::Point const &start, PathDescrCubicTo res, Geom::Point &pt) { Geom::Point const sp = pt - start; Geom::Point const ep = pt - res.p; |
