typos in comments

git-svn-id: http://svn.code.sf.net/p/netpbm/code/trunk@1582 9d0c8265-081b-0410-96cb-a4ca84ce46f8

7 files changed, 13 insertions, 13 deletions

diff --git a/editor/pamflip/pamflip.c b/editor/pamflip/pamflip.c
index 6cbe4edf..2f711184 100644
--- a/editor/pamflip/pamflip.c
+++ b/editor/pamflip/pamflip.c
@@ -12,7 +12,7 @@
 
 /*
    transformNonPbmChunk() is the general transformation function.
-   It can tranform anything, albeit slowly and expensively.
+   It can transform anything, albeit slowly and expensively.
    
    The following are enhancements for specific cases:
    
diff --git a/editor/pamflip/pamflip_sse.c b/editor/pamflip/pamflip_sse.c
index f9a126d5..5a256f9d 100644
--- a/editor/pamflip/pamflip_sse.c
+++ b/editor/pamflip/pamflip_sse.c
@@ -4,7 +4,7 @@
   This is part of the Pamflip program.  It contains code that exploits
   the SSE facility of some CPUs.
 
-  This code was orginally written by Akira Urushibata ("Douso") in 2010 and is
+  This code was originally written by Akira Urushibata ("Douso") in 2010 and is
   contributed to the public domain by all authors.
 
   The author makes the following request (which is not a reservation of legal
diff --git a/editor/pamperspective.c b/editor/pamperspective.c
index 0291afb4..a75e5243 100644
--- a/editor/pamperspective.c
+++ b/editor/pamperspective.c
@@ -536,7 +536,7 @@ parseCommandLine(int argc, const char * argv[],
                            parse_enum (bool_text[i], bool_token,
                                        bool_option_name[i]));
 
-  /* Propagate values where neccessary */
+  /* Propagate values where necessary */
 
   if (float_spec[10])           /* --margin */
     for (i=11; i<15; i++)       /* --top_margin through --right_margin */
diff --git a/editor/pamscale.c b/editor/pamscale.c
index a113f328..16c24429 100644
--- a/editor/pamscale.c
+++ b/editor/pamscale.c
@@ -927,7 +927,7 @@ typedef struct {
            window.  The index order is NOT the order of the rows in the
            image.  E.g. line[0] isn't always the topmost row of the window.
            Rather, the rows are arranged in a cycle and you have to know
-           indpendently where the topmost one is.  E.g. the rows of a 5
+           independently where the topmost one is.  E.g. the rows of a 5
            line window with topmost row at index 3 might be:
 
               line[0] = Row 24
@@ -1058,7 +1058,7 @@ createWeightList(unsigned int          const targetPos,
       10*.022 + 20*.521 + 30*.457 = 24
 
 -----------------------------------------------------------------------------*/
-    /* 'windowCenter', is the continous position within the source of
+    /* 'windowCenter', is the continuous position within the source of
        the center of the window that will influence target pixel
        'targetPos'.  'left' and 'right' are the edges of the window.
        'leftPixel' and 'rightPixel' are the pixel positions of the
@@ -1648,7 +1648,7 @@ horizontalScale(tuplen *     const inputtuplenrow,
                 float        const xscale,
                 float *      const stretchP) {
 /*----------------------------------------------------------------------------
-  Take the input row 'inputtuplenrow', decribed by *inpamP, and scale
+  Take the input row 'inputtuplenrow', described by *inpamP, and scale
   it by a factor of 'xscale', to create the output row 'newtuplenrow',
   described by *outpamP.
 
diff --git a/editor/pamthreshold.c b/editor/pamthreshold.c
index 15ed271a..8369602d 100644
--- a/editor/pamthreshold.c
+++ b/editor/pamthreshold.c
@@ -302,7 +302,7 @@ analyzeDistribution(struct pam *          const inpamP,
         pm_error("Unable to allocate space for %lu-entry histogram",
                  inpamP->maxval+1);
 
-    /* Initialize histogram -- zero occurences of everything */
+    /* Initialize histogram -- zero occurrences of everything */
     for (i = 0; i <= inpamP->maxval; ++i)
         histogram[i] = 0;
 
@@ -376,7 +376,7 @@ computeGlobalThreshold(struct pam *         const inpamP,
    Compute the proper threshold to use for the image described by
    *inpamP, and:
 
-     'histogram' describes the frequency of occurence of the various sample
+     'histogram' describes the frequency of occurrence of the various sample
      values in the image.
 
      'globalRange' describes the range (minimum, maximum) of sample values
diff --git a/editor/pnmpad.c b/editor/pnmpad.c
index bbb85e8b..1904b687 100644
--- a/editor/pnmpad.c
+++ b/editor/pnmpad.c
@@ -163,7 +163,7 @@ static void
 parseCommandLineOld(int argc, const char ** argv,
                     struct cmdlineInfo * const cmdlineP) {
 
-    /* This syntax was abandonned in February 2002. */
+    /* This syntax was abandoned in February 2002. */
     pm_message("Warning: old style options are deprecated!");
 
     cmdlineP->xsize = cmdlineP->ysize = 0;
diff --git a/editor/pnmstitch.c b/editor/pnmstitch.c
index e7887232..849445fb 100644
--- a/editor/pnmstitch.c
+++ b/editor/pnmstitch.c
@@ -77,7 +77,7 @@
  *      - Add RotateCrop filter algorithm (in-memory copy of image,
  *        detect least loss horizontal crop on a rotated image).
  *      - pnmstitch should be generalized to handle transformation
- *        occuring on the left image, currently it blends assuming
+ *        occurring on the left image, currently it blends assuming
  *        that there is no transformation effects on the left image.
  *      - user selectable blending algorithms?
  */
@@ -893,7 +893,7 @@ stitchOneRow(Image *    const Left,
      *  We scale the overlap of the left and right images, we need to
      * discover and hold on to the left edge of the right image to
      * determine the rate at which we blend. Most (7/8) of the blending
-     * occurs in the first half of the overlap to reduce the occurences
+     * occurs in the first half of the overlap to reduce the occurrences
      * of blending artifacts. If there is no overlap, the image present
      * has no blending activity, this is determined by the black
      * background and is not through an alpha layer to help reduce
@@ -1393,7 +1393,7 @@ LinearConstrain(Stitcher * me, int x, int y, int width, int height)
  *  width sliver of the left hand side of the right image and compare
  *  the sample to the left hand image. Accuracy is honored over speed.
  *  The image overlap is expected between 7/16 to 1/16 in the horizontal
- *  position, and a minumum of 5/8 in the vertical dimension.
+ *  position, and a minimum of 5/8 in the vertical dimension.
  *
  *  Blind alleys:
  *      - reduced resolution can match in totally wrong regions,
@@ -2071,7 +2071,7 @@ BiLinearConstrain(Stitcher * me, int x, int y, int width, int height)
  *  width sliver of the left hand side of the right image and compare
  *  the sample to the left hand image. Accuracy is honored over speed.
  *  The image overlap is expected between 7/16 to 1/16 in the horizontal
- *  position, and a minumum of 5/8 in the vertical dimension.
+ *  position, and a minimum of 5/8 in the vertical dimension.
  *
  *  Blind alleys:
  *      - Tried a simpler constraint for right side to be `back'