Fix typos

Change-Id: Ice72f8d9971e15dd6ef365e64cd567b8581a92d3
Reviewed-on: https://gerrit.libreoffice.org/21797
Tested-by: Jenkins <ci@libreoffice.org>
Reviewed-by: Ashod Nakashian <ashnakash@gmail.com>

5 files changed, 7 insertions, 7 deletions

diff --git a/basegfx/source/matrix/b2dhommatrix.cxx b/basegfx/source/matrix/b2dhommatrix.cxx
index 0e098cdd4757..07d10e6bebff 100644
--- a/basegfx/source/matrix/b2dhommatrix.cxx
+++ b/basegfx/source/matrix/b2dhommatrix.cxx
@@ -349,7 +349,7 @@ namespace basegfx
                 double fCrossXY(aUnitVecX.cross(aUnitVecY));
 
                 // get rotation by calculating angle of X unit vector relative to (1, 0).
-                // This is before the parallell test following the motto to extract
+                // This is before the parallel test following the motto to extract
                 // as much as possible
                 rRotate = atan2(aUnitVecX.getY(), aUnitVecX.getX());
 
@@ -364,7 +364,7 @@ namespace basegfx
 
                     // unit vectors are parallel, thus not linear independent. No
                     // useful decomposition possible. This should not happen since
-                    // the only way to get the unit vectors nearly parallell is
+                    // the only way to get the unit vectors nearly parallel is
                     // a very big shearing. Anyways, be prepared for hand-filled
                     // matrices
                     // Eventually used rotations or shears are lost
diff --git a/basegfx/source/polygon/b2dlinegeometry.cxx b/basegfx/source/polygon/b2dlinegeometry.cxx
index 2b6f6f95e999..5527dd0d0a0f 100644
--- a/basegfx/source/polygon/b2dlinegeometry.cxx
+++ b/basegfx/source/polygon/b2dlinegeometry.cxx
@@ -866,7 +866,7 @@ namespace basegfx
 
                             if(B2VectorOrientation::Neutral == aOrientation)
                             {
-                                   // they are parallell or empty; if they are both not zero and point
+                                   // they are parallel or empty; if they are both not zero and point
                                    // in opposite direction, a half-circle is needed
                                    if(!aTangentPrev.equalZero() && !aTangentEdge.equalZero())
                                    {
diff --git a/basegfx/source/polygon/b2dpolygonclipper.cxx b/basegfx/source/polygon/b2dpolygonclipper.cxx
index 7087c542de2a..fcf6fa00642b 100644
--- a/basegfx/source/polygon/b2dpolygonclipper.cxx
+++ b/basegfx/source/polygon/b2dpolygonclipper.cxx
@@ -226,7 +226,7 @@ namespace basegfx
 
             if(!bInside)
             {
-                // cutting off the outer parts of filled polygons at parallell
+                // cutting off the outer parts of filled polygons at parallel
                 // lines to the axes is only possible for the inner part, not for
                 // the outer part which means cutting a hole into the original polygon.
                 // This is because the inner part is a logical AND-operation of
@@ -326,7 +326,7 @@ namespace basegfx
             else
             {
                 // for details, see comment in clipPolygonOnRange for the "cutting off
-                // the outer parts of filled polygons at parallell lines" explanations
+                // the outer parts of filled polygons at parallel lines" explanations
                 const B2DPolygon aClip(createPolygonFromRect(rRange));
 
                 return clipPolyPolygonOnPolyPolygon(rCandidate, B2DPolyPolygon(aClip), bInside, bStroke);
diff --git a/basegfx/source/raster/rasterconvert3d.cxx b/basegfx/source/raster/rasterconvert3d.cxx
index a2b3b6905b6a..2ccd4a3ab031 100644
--- a/basegfx/source/raster/rasterconvert3d.cxx
+++ b/basegfx/source/raster/rasterconvert3d.cxx
@@ -285,7 +285,7 @@ namespace basegfx
                 const sal_uInt32 nYDelta(static_cast<sal_uInt32>(nYEnd - nYStart));
                 const double fInvYDelta(1.0 / nYDelta);
 
-                // non-horizontal line, create two parallell entries. These will be sorted by
+                // non-horizontal line, create two parallel entries. These will be sorted by
                 // X anyways, so no need to distinguish the case here
                 maLineEntries.push_back(RasterConversionLineEntry3D(
                     aStart.getX(), (aEnd.getX() - aStart.getX()) * fInvYDelta,
diff --git a/basegfx/source/workbench/bezierclip.hxx b/basegfx/source/workbench/bezierclip.hxx
index bb9153be3680..11ab32109414 100644
--- a/basegfx/source/workbench/bezierclip.hxx
+++ b/basegfx/source/workbench/bezierclip.hxx
@@ -76,7 +76,7 @@ Polygon2D convexHull( const Polygon2D& rPoly );
 // TODO: find proper epsilon here (try ::std::numeric_limits<NumType>::epsilon()?)!
 #define DBL_EPSILON 1.0e-100
 
-/* little approximate comparions */
+/* little approximate comparisons */
 template <typename NumType> bool tolZero( NumType n ) { return fabs(n) < DBL_EPSILON; }
 template <typename NumType> bool tolEqual( NumType n1, NumType n2 ) { return tolZero(n1-n2); }
 template <typename NumType> bool tolLessEqual( NumType n1, NumType n2 ) { return tolEqual(n1,n2) || n1<n2; }