diff options
Diffstat (limited to 'basegfx')
| -rw-r--r-- | basegfx/source/polygon/b2dpolygontools.cxx | 2 | ||||
| -rw-r--r-- | basegfx/source/polygon/b2dsvgpolypolygon.cxx | 8 | ||||
| -rw-r--r-- | basegfx/source/raster/rasterconvert3d.cxx | 2 |
3 files changed, 6 insertions, 6 deletions
diff --git a/basegfx/source/polygon/b2dpolygontools.cxx b/basegfx/source/polygon/b2dpolygontools.cxx index 709a2f156626..3b4958014a38 100644 --- a/basegfx/source/polygon/b2dpolygontools.cxx +++ b/basegfx/source/polygon/b2dpolygontools.cxx @@ -3037,7 +3037,7 @@ namespace basegfx } } - // substract length of current edge + // subtract length of current edge fPositionInEdge -= fEdgeLength; } diff --git a/basegfx/source/polygon/b2dsvgpolypolygon.cxx b/basegfx/source/polygon/b2dsvgpolypolygon.cxx index 8eec134c0ca1..c4cb856186f2 100644 --- a/basegfx/source/polygon/b2dsvgpolypolygon.cxx +++ b/basegfx/source/polygon/b2dsvgpolypolygon.cxx @@ -233,7 +233,7 @@ namespace basegfx nY += nLastY; } - // ensure existance of start point + // ensure existence of start point if(!aCurrPoly.count()) { aCurrPoly.append(B2DPoint(nLastX, nLastY)); @@ -297,7 +297,7 @@ namespace basegfx nY += nLastY; } - // ensure existance of start point + // ensure existence of start point if(!aCurrPoly.count()) { aCurrPoly.append(B2DPoint(nLastX, nLastY)); @@ -348,7 +348,7 @@ namespace basegfx const double nX2Prime((nX1 * 2.0 + nX) / 3.0); const double nY2Prime((nY1 * 2.0 + nY) / 3.0); - // ensure existance of start point + // ensure existence of start point if(!aCurrPoly.count()) { aCurrPoly.append(B2DPoint(nLastX, nLastY)); @@ -388,7 +388,7 @@ namespace basegfx nY += nLastY; } - // ensure existance of start point + // ensure existence of start point if(!aCurrPoly.count()) { aCurrPoly.append(B2DPoint(nLastX, nLastY)); diff --git a/basegfx/source/raster/rasterconvert3d.cxx b/basegfx/source/raster/rasterconvert3d.cxx index 5ea062a0e95b..5132ade1cc52 100644 --- a/basegfx/source/raster/rasterconvert3d.cxx +++ b/basegfx/source/raster/rasterconvert3d.cxx @@ -111,7 +111,7 @@ namespace basegfx // sort current scanline using comparator. Only X is used there // since all entries are already in one processed line. This needs to be done - // everytime since not only new spans may have benn added or old removed, + // every time since not only new spans may have benn added or old removed, // but incrementing may also have changed the order ::std::sort(aCurrentLine.begin(), aCurrentLine.end(), lineComparator()); |