diff options
| author | Alvin Penner <penner@vaxxine.com> | 2013-07-01 21:51:53 +0000 |
|---|---|---|
| committer | apenner <penner@vaxxine.com> | 2013-07-01 21:51:53 +0000 |
| commit | ced7761e69301a40944684fd295a04ea9e736c24 (patch) | |
| tree | 29fc25fc5a67870d3bd6d7e44d3467b3538fbf9c /src/livarot/ShapeMisc.cpp | |
| parent | LPE bend path: fix crash on "uskeleton.cuts.back()" because of empty uskeleton. (diff) | |
| download | inkscape-ced7761e69301a40944684fd295a04ea9e736c24.tar.gz inkscape-ced7761e69301a40944684fd295a04ea9e736c24.zip | |
Shape calculations. do not quantize the coordinates. (Bug 168158)
Fixed bugs:
- https://launchpad.net/bugs/168158
(bzr r12399)
Diffstat (limited to 'src/livarot/ShapeMisc.cpp')
| -rw-r--r-- | src/livarot/ShapeMisc.cpp | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/src/livarot/ShapeMisc.cpp b/src/livarot/ShapeMisc.cpp index 6fd40790f..5bb8a25ef 100644 --- a/src/livarot/ShapeMisc.cpp +++ b/src/livarot/ShapeMisc.cpp @@ -49,8 +49,8 @@ Shape::ConvertToForme (Path * dest) for (int i = 0; i < numberOfPoints(); i++) { - pData[i].rx[0] = Round (getPoint(i).x[0]); - pData[i].rx[1] = Round (getPoint(i).x[1]); + pData[i].rx[0] = /*Round*/ (getPoint(i).x[0]); + pData[i].rx[1] = /*Round*/ (getPoint(i).x[1]); } for (int i = 0; i < numberOfEdges(); i++) { @@ -199,8 +199,8 @@ Shape::ConvertToForme (Path * dest, int nbP, Path * *orig, bool splitWhenForced) for (int i = 0; i < numberOfPoints(); i++) { - pData[i].rx[0] = Round (getPoint(i).x[0]); - pData[i].rx[1] = Round (getPoint(i).x[1]); + pData[i].rx[0] = /*Round*/ (getPoint(i).x[0]); + pData[i].rx[1] = /*Round*/ (getPoint(i).x[1]); } for (int i = 0; i < numberOfEdges(); i++) { @@ -352,8 +352,8 @@ Shape::ConvertToFormeNested (Path * dest, int nbP, Path * *orig, int wildPath,in for (int i = 0; i < numberOfPoints(); i++) { - pData[i].rx[0] = Round (getPoint(i).x[0]); - pData[i].rx[1] = Round (getPoint(i).x[1]); + pData[i].rx[0] = /*Round*/ (getPoint(i).x[0]); + pData[i].rx[1] = /*Round*/ (getPoint(i).x[1]); } for (int i = 0; i < numberOfEdges(); i++) { |