diff options
author | Thorsten Behrens <Thorsten.Behrens@CIB.de> | 2015-05-24 21:45:10 +0200 |
---|---|---|
committer | Thorsten Behrens <Thorsten.Behrens@CIB.de> | 2015-05-24 21:50:20 +0200 |
commit | cd6ee5de8ef7345ba219f0d50e9e1ee45332e55f (patch) | |
tree | 6c0469a2fdca0f7a3a7986da4c76376c36cb3942 /include/basegfx/polygon | |
parent | e9bb2e6f09d711833e659db3b229326d5e997266 (diff) |
comments: fix mis-use of eventual in English
The adjective was used as the German meaning, which translates to
maybe or possibly.
Change-Id: Iaf5b38f628b23796829a1c4bd3919d4e13b874f0
Diffstat (limited to 'include/basegfx/polygon')
-rw-r--r-- | include/basegfx/polygon/b2dpolygontools.hxx | 2 | ||||
-rw-r--r-- | include/basegfx/polygon/b2dpolypolygoncutter.hxx | 4 | ||||
-rw-r--r-- | include/basegfx/polygon/b2dpolypolygontools.hxx | 4 |
3 files changed, 5 insertions, 5 deletions
diff --git a/include/basegfx/polygon/b2dpolygontools.hxx b/include/basegfx/polygon/b2dpolygontools.hxx index dc0cf11f9d6b..02cc43dbb594 100644 --- a/include/basegfx/polygon/b2dpolygontools.hxx +++ b/include/basegfx/polygon/b2dpolygontools.hxx @@ -94,7 +94,7 @@ namespace basegfx For detailed discussion see B2DPolygon::getB2DRange() @param rCandidate - The B2DPolygon eventually containing bezier segments + The B2DPolygon possibly containing bezier segments @return The outer range of the bezier curve diff --git a/include/basegfx/polygon/b2dpolypolygoncutter.hxx b/include/basegfx/polygon/b2dpolypolygoncutter.hxx index cfa2449cb7c5..37ce2ab9e3bd 100644 --- a/include/basegfx/polygon/b2dpolypolygoncutter.hxx +++ b/include/basegfx/polygon/b2dpolypolygoncutter.hxx @@ -50,8 +50,8 @@ namespace basegfx Same as above, but for single polygons. Result will be free of self-intersections. When result contains multiple polygons, it may be necessary to rearrange their - orientations since holes may have been created (use - correctOrientations eventually). + orientations since holes may have been created (possibly use + correctOrientations). */ BASEGFX_DLLPUBLIC B2DPolyPolygon solveCrossovers(const B2DPolygon& rCandidate); diff --git a/include/basegfx/polygon/b2dpolypolygontools.hxx b/include/basegfx/polygon/b2dpolypolygontools.hxx index 11fed4743019..42fda3ed1ded 100644 --- a/include/basegfx/polygon/b2dpolypolygontools.hxx +++ b/include/basegfx/polygon/b2dpolypolygontools.hxx @@ -74,7 +74,7 @@ namespace basegfx This method just expands by the range of every sub-Polygon. @param rCandidate - The B2DPolyPolygon eventually containing bezier segments + The B2DPolyPolygon possibly containing bezier segments @return The outer range of the polygon @@ -170,7 +170,7 @@ namespace basegfx // This method will correct a pair of polyPolygons where the goal is to keep same point count // to allow direct point association and also to remove self-intersections produced by shrinks. - // This method will eventually change both polyPolygons to reach that goal because there are cases + // This method might possibly change both polyPolygons to reach that goal because there are cases // where it is necessary to add new cut points to the original BASEGFX_DLLPUBLIC void correctGrowShrinkPolygonPair(B2DPolyPolygon& rOriginal, B2DPolyPolygon& rGrown); |