diff options
| author | Andrea Gelmini <andrea.gelmini@gelma.net> | 2015-06-22 14:31:42 +0200 |
|---|---|---|
| committer | Michael Stahl <mstahl@redhat.com> | 2015-06-22 12:36:21 +0000 |
| commit | aade27554d427649810f5635133519cadfa8002f (patch) | |
| tree | 7f87acd42d9b3821f969444cc0a65e8f27988503 /basegfx | |
| parent | eb0c9b43e7f09054a864eb44c24c43b27c0f21f5 (diff) | |
Fix typos
Change-Id: I60ed5eb658d50cbc7dc572facb5463b7527b4d9b
Reviewed-on: https://gerrit.libreoffice.org/16408
Reviewed-by: Michael Stahl <mstahl@redhat.com>
Tested-by: Michael Stahl <mstahl@redhat.com>
Diffstat (limited to 'basegfx')
| -rw-r--r-- | basegfx/source/polygon/b2dlinegeometry.cxx | 2 | ||||
| -rw-r--r-- | basegfx/source/polygon/b2dtrapezoid.cxx | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/basegfx/source/polygon/b2dlinegeometry.cxx b/basegfx/source/polygon/b2dlinegeometry.cxx index 2c07558966b1..4cccf1df5bf1 100644 --- a/basegfx/source/polygon/b2dlinegeometry.cxx +++ b/basegfx/source/polygon/b2dlinegeometry.cxx @@ -520,7 +520,7 @@ namespace basegfx // is created; one cut point is known, but there is a 2nd one in the caps geometry. // Solve by using tooling. // Remark: This nearly never happens due to curve preparations to extreme points - // and maximum angle turning, but I constructed a test case and checkd that it is + // and maximum angle turning, but I constructed a test case and checked that it is // working propery. const B2DPolyPolygon aTemp(tools::solveCrossovers(aBezierPolygon)); const sal_uInt32 nTempCount(aTemp.count()); diff --git a/basegfx/source/polygon/b2dtrapezoid.cxx b/basegfx/source/polygon/b2dtrapezoid.cxx index e49f7f6de1c0..2baf2a4a5f7b 100644 --- a/basegfx/source/polygon/b2dtrapezoid.cxx +++ b/basegfx/source/polygon/b2dtrapezoid.cxx @@ -610,7 +610,7 @@ namespace basegfx // Ystart again. Some cases lead to a restart of the process, some allow consuming the // edges and create the intended trapezoid. - // Be careful when doing chages here: It is essential to keep all possible paths + // Be careful when doing changes here: it is essential to keep all possible paths // in valid states and to be numerically correct. This is especially needed e.g. // by using fTools::equal(..) in the more robust small-value incarnation. B1DRange aLeftRange; |