diff options
| author | su_v <suv-sf@users.sourceforge.net> | 2012-11-26 06:56:29 +0000 |
|---|---|---|
| committer | ~suv <suv-sf@users.sourceforge.net> | 2012-11-26 06:56:29 +0000 |
| commit | 0f140e037d3b84ca7664c9a18b5bd977b912d6c2 (patch) | |
| tree | 559b8b9215dcf4a688a480ae1dc3f557d3036d05 /src/livarot/PathSimplify.cpp | |
| parent | merge from trunk (r11871) (diff) | |
| parent | Fix undo history entry for layer renaming to be consistent with 'Rename Layer... (diff) | |
| download | inkscape-0f140e037d3b84ca7664c9a18b5bd977b912d6c2.tar.gz inkscape-0f140e037d3b84ca7664c9a18b5bd977b912d6c2.zip | |
merge from trunk (r11903)
(bzr r11668.1.42)
Diffstat (limited to '')
| -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; |
