summaryrefslogtreecommitdiff
path: root/filter/source/graphicfilter
diff options
context:
space:
mode:
authorAndrea Gelmini <andrea.gelmini@gelma.net>2014-11-10 15:05:25 +0100
committerNoel Grandin <noelgrandin@gmail.com>2014-11-12 11:04:11 +0000
commitda40cac540e7d735edbe9069b3c8ec6af4530208 (patch)
treef2abda7281129e13f588c77b18780a7090c8405f /filter/source/graphicfilter
parentbb437029c1e5331bcc3f8fb2fc87837142a52f33 (diff)
Fix common typos. No automatic tools. Handmade…
Change-Id: I1ab4e23b0539f8d39974787f226e57a21f96e959 Reviewed-on: https://gerrit.libreoffice.org/12164 Reviewed-by: Noel Grandin <noelgrandin@gmail.com> Tested-by: Noel Grandin <noelgrandin@gmail.com>
Diffstat (limited to 'filter/source/graphicfilter')
-rw-r--r--filter/source/graphicfilter/epict/epict.cxx2
-rw-r--r--filter/source/graphicfilter/idxf/dxfvec.hxx2
-rw-r--r--filter/source/graphicfilter/ios2met/ios2met.cxx4
-rw-r--r--filter/source/graphicfilter/itiff/ccidecom.cxx2
4 files changed, 5 insertions, 5 deletions
diff --git a/filter/source/graphicfilter/epict/epict.cxx b/filter/source/graphicfilter/epict/epict.cxx
index 69407f6b4a82..993e1d36d67a 100644
--- a/filter/source/graphicfilter/epict/epict.cxx
+++ b/filter/source/graphicfilter/epict/epict.cxx
@@ -240,7 +240,7 @@ Polygon PictWriter::PolyPolygonToPolygon(const tools::PolyPolygon & rPolyPoly)
// At first we look for a point in aPoly1 (referenced by nBestIdx1) and a
// point in aPoly2 (referenced by nBestid2), which are as close together as
// possible. Because this is following square complexity and therefore some
- // pictures would need infinite time to export, we limit the the number of test
+ // pictures would need infinite time to export, we limit the number of test
// by the number of 1000 and cancel the search if necessary preliminarily.
// The result of this will not be wrong but rather not so beautiful.
nCountdownTests=1000;
diff --git a/filter/source/graphicfilter/idxf/dxfvec.hxx b/filter/source/graphicfilter/idxf/dxfvec.hxx
index ca84a1a9ba77..b75c25479c03 100644
--- a/filter/source/graphicfilter/idxf/dxfvec.hxx
+++ b/filter/source/graphicfilter/idxf/dxfvec.hxx
@@ -143,7 +143,7 @@ public:
// Transformation of a relative vector (so no translation)
bool TransCircleToEllipse(double fRadius, double & rEx, double & rEy) const;
- // Attemp to transform a circle (in xy plane) so that it results
+ // Attempt to transform a circle (in xy plane) so that it results
// in an aligned ellipse. If the does not work because a ellipse of
// arbitrary position would be created, sal_False is returned.
// (The center point will not be transformed, use Transform(..))
diff --git a/filter/source/graphicfilter/ios2met/ios2met.cxx b/filter/source/graphicfilter/ios2met/ios2met.cxx
index 80ea97be4496..2116ac10ca00 100644
--- a/filter/source/graphicfilter/ios2met/ios2met.cxx
+++ b/filter/source/graphicfilter/ios2met/ios2met.cxx
@@ -1078,7 +1078,7 @@ void OS2METReader::ReadArc(bool bGivenPos)
// now we still need the radius in x and y direction:
r=sqrt(q*q*(x1-cx)*(x1-cx)+p*p*(y1-cy)*(y1-cy));
rx=r/q; ry=r/p;
- // We now have to find out how the the starting and the end point
+ // We now have to find out how the starting and the end point
// have to be chosen so that point no. 2 lies inside the drawn arc:
w1=fmod((atan2(x1-cx,y1-cy)-atan2(x2-cx,y2-cy)),6.28318530718); if (w1<0) w1+=6.28318530718;
w3=fmod((atan2(x3-cx,y3-cy)-atan2(x2-cx,y2-cy)),6.28318530718); if (w3<0) w3+=6.28318530718;
@@ -2201,7 +2201,7 @@ void OS2METReader::ReadImageData(sal_uInt16 nDataID, sal_uInt16 nDataLen)
break;
case 0xfe92: { // Image Data
- // At the latest we now need the temprary BMP file and
+ // At the latest we now need the temporary BMP file and
// inside this file we need the header and the palette.
if (p->pBMP==NULL) {
p->pBMP=new SvMemoryStream();
diff --git a/filter/source/graphicfilter/itiff/ccidecom.cxx b/filter/source/graphicfilter/itiff/ccidecom.cxx
index f0b635393e8c..6cd2c4141533 100644
--- a/filter/source/graphicfilter/itiff/ccidecom.cxx
+++ b/filter/source/graphicfilter/itiff/ccidecom.cxx
@@ -311,7 +311,7 @@ const CCIHuffmanTableEntry CCIUncompTable[CCIUncompTableSize]={
// To make sure that the Huffman tables do not contain errors they were entered
// from two different sources (Phew) and compared.
// Since an error could creep in to the source code while maintaining it
-// (e.g. an accidentaly key press in the editor) the tables are listed twice
+// (e.g. an accidental key press in the editor) the tables are listed twice
// and are compared during runtime. (If the comparison fails CCIDcompressor
// throws an error) The whole thing may appear insane, but an error within the
// tables would otherwise be really hard to discover and it's very unlikely that