bulk fixing of typos in comments (using tools/fix_typos.sh)

git-svn-id: https://svn.osgeo.org/grass/grass/trunk@73852 15284696-431f-4ddb-bdfa-cd5b030d7da7

display/d.legend/draw.c

@@ -1,7 +1,7 @@
 /* draw.c:
  *    Compute position of legend, title, labels and ticks
  *    Extracted from original d.legend/main.c for background purpose
- *    Moving to seperate file: Adam Laza, GSoC 2016
+ *    Moving to separate file: Adam Laza, GSoC 2016
  *
  *    Copyright (C) 2014 by Hamish Bowman, and the GRASS Development Team*
  *    This program is free software under the GPL (>=v2)
@@ -895,7 +895,7 @@ void draw(const char *map_name, int maptype, int color, int thin, int lines,
 
         /* Display sidebar histogram, if requested.
            /  In case of horizontal legend, maximum of histogram - max_hist
-           will efect the title position */
+           will affect the title position */
         max_hist = 0;
         if (histo->answer) {
             render_range.min = (DCELL) (fp ? dmin : min_ind);

display/d.vect/shape.c

@@ -183,7 +183,7 @@ int display_shape(struct Map_info *Map, int type, struct cat_list *Clist, const
 	    z_style = NULL;
 	}
         else if (rgb_column) {
-            /* this should not happend, zcolor and rgb_columns are mutually exclusive */
+            /* this should not happen, zcolor and rgb_columns are mutually exclusive */
 	    z_style = NULL;
         }
 	else {

doc/vector/v.example/main.c

@@ -6,7 +6,7 @@
  * AUTHOR(S):  GRASS Development Team, Radim Blazek, Maris Nartiss
  *
  * PURPOSE:    copies vector data from source map to destination map
- *             prints out all point coordinates and atributes
+ *             prints out all point coordinates and attributes
  *
  * COPYRIGHT:  (C) 2002-2009 by the GRASS Development Team
  *
@@ -226,6 +226,6 @@ int main(int argc, char *argv[])
     Vect_close(&Out);
     db_close_database_shutdown_driver(driver);
 
-    /* Don't forget to report to caller sucessfull end of data processing :) */
+    /* Don't forget to report to caller successful end of data processing :) */
     exit(EXIT_SUCCESS);
 }

general/g.region/printwindow.c

@@ -534,7 +534,7 @@ void print_window(struct Cell_head *window, int print_flag, int flat_flag)
     }
 
     /* flag.bbox
-       Calculate the largest bouding box in lat-lon coordinates 
+       Calculate the largest bounding box in lat-lon coordinates 
        and print it to stdout
      */
     if (print_flag & PRINT_MBBOX) {

general/g.rename/testsuite/test_overwrite.py

@@ -76,7 +76,7 @@ class RasterRenameTestCase(TestCase):
                 self.fail(msg)
 
     def test_overwrite_existing_raster(self):
-        """Test that existing raster is overriden if desired"""
+        """Test that existing raster is overridden if desired"""
         runivar_source = SimpleModule('r.univar', flags='g', map='rename_3')
         self.runModule(runivar_source, expecting_stdout=True)
         original_runivar_source = text_to_keyvalue(runivar_source.outputs.stdout,

general/g.setproj/get_deg.c

@@ -4,9 +4,9 @@
  *                    Provide a means of collecting user lat/long
  *                    data, in different formats; convert to
  *                       decimal degrees
- *    Input arguements : lat or long string   and
+ *    Input arguments : lat or long string   and
  *                       a 1 for latitude or 0 for longitude
- *    Output arguements: decimal degrees in string
+ *    Output arguments: decimal degrees in string
  *
  *            Note: All functions are callable directly see
  *                    g.get_stp       g.get_fips      g.stp_proj  geo

general/g.setproj/get_num.c

@@ -50,7 +50,7 @@ int get_LL_stuff(const struct proj_parm *parm, const struct proj_desc *desc,
     char answer[200];
     char buff[256];
 
-    /*  get LONCEN value arguements */
+    /*  get LONCEN value arguments */
     if (parm->def_exists == 1) {
 	if (lat == 1) {
 	    G_format_northing(parm->deflt, buff, PROJECTION_LL);

general/g.setproj/main.c

@@ -23,8 +23,8 @@
  *          Provides a means of creating a new projection
  *             information file
  *
- *  ------Rev 4.+ arguements --------------------------------------
- *    Input arguements:
+ *  ------Rev 4.+ arguments --------------------------------------
+ *    Input arguments:
  *             m.setproj set=mapset for output project info file
  *                    proj=projection of the output project info file
  *

imagery/i.atcorr/computations.cpp

@@ -163,7 +163,7 @@ double trunca()
 /*
   Decompose the atmosphere in a finite number of layers. For each layer, DISCRE
   provides the optical thickness, the proportion of molecules and aerosols assuming an exponential
-  distribution for each constituants. Figure 1 illustrate the way molecules and aerosols are mixed in a
+  distribution for each constituents. Figure 1 illustrate the way molecules and aerosols are mixed in a
   realistic atmosphere. For molecules, the scale height is 8km. For aerosols it is assumed to be 2km
   unless otherwise specified by the user (using aircraft measurements).
 */
@@ -1395,7 +1395,7 @@ void atmref(const double tamoy, const double trmoy, const double pizmoy,
     }
 
     /* rayleigh+aerosol=romix,aerosol=roaero reflectance computed
-       using sucessive order of scattering method
+       using successive order of scattering method
        3 cases: satellite,plane,ground */
     if (alt.palt > 0) 
     {

imagery/i.atcorr/main.cpp

@@ -85,8 +85,8 @@ struct Options
     /* flags */
     struct Flag *oint;		/* output data as integer */
     struct Flag *irad;		/* treat input values as reflectance instead of radiance values */
-    struct Flag *etmafter;	/* treat input data as a satelite image of type etm+ taken after July 1, 2000 */
-    struct Flag *etmbefore;	/* treat input data as a satelite image of type etm+ taken before July 1, 2000 */
+    struct Flag *etmafter;	/* treat input data as a satellite image of type etm+ taken after July 1, 2000 */
+    struct Flag *etmbefore;	/* treat input data as a satellite image of type etm+ taken before July 1, 2000 */
 };
 
 struct ScaleRange
@@ -116,7 +116,7 @@ static void read_scale(Option *, ScaleRange &);
 /* 
    Adjust the region to that of the input raster.
    Atmospheric corrections should be done on the whole
-   satelite image, not just portions.
+   satellite image, not just portions.
  */
 static void adjust_region(const char *name)
 {

imagery/i.evapo.pm/functions.c

@@ -17,7 +17,7 @@ extern DCELL f_d(DCELL);
 #define Tko 293.16		/* [K]                   reference temperature at sea level */
 #define eta 0.0065		/* [K/m]                 constant lapse rate */
 #define Ao 0			/* [m]                   altitude at sea level */
-#define g 9.81			/* [m/s]                 gravitational accelleration */
+#define g 9.81			/* [m/s]                 gravitational acceleration */
 #define R 287			/* [J/kg*K]              specific gas constant */
 #define Zw 2			/* [m]                   height of  wind measurements */
 #define Zh 2			/* [m]                   height of  humidity measurements */

imagery/i.his.rgb/his2rgb.c

@@ -2,7 +2,7 @@
 /******************************************************************************
 NAME:                         HIS2RGB
  
-PURPOSE    To proces hue,intensity,saturation bands to red,green,blue.
+PURPOSE    To process hue,intensity,saturation bands to red,green,blue.
  
 ALGORITHM:
    Get hue, intensity, saturation from input buffer

imagery/i.ortho.photo/README

@@ -1,7 +1,7 @@
 STATUS:
 	The i.ortho.photo suite of modules has been temporarily disabled 
 	from GRASS 7 as they are heavily dependent on the text-based
-	Vask libary and interactive XDRIVER monitors, both of which
+	Vask library and interactive XDRIVER monitors, both of which
 	have been removed. As the modules are rewritten to run in non-
 	interactive mode or with a wxPython frontend, they will be
 	added back into GRASS 7. This work will be undertaken in the

imagery/i.ortho.photo/alg_photo_rectify.txt

@@ -148,7 +148,7 @@ rectify.c
           	ref equ: case good
           		E21 = -943.487394	 -0.990568	 0.540622 
           		N21 = -1672.101767	 -0.719668	 -0.167699 
-          	 got psuedo pts: row 0 	 col 0 
+          	 got pseudo pts: row 0 	 col 0 
           		compute geo matrix
           		perform georef 
           		write matrix 
@@ -187,7 +187,7 @@ rectify.c
           	ref equ: case good
           		E21 = -1388.336416	 -0.227609	 0.176021 
           		N21 = -765.007897	 0.036045	 0.516496 
-          	 got psuedo pts: row 21 	 col 27 
+          	 got pseudo pts: row 21 	 col 27 
           		compute geo matrix
           		perform georef 
           		write matrix 
@@ -225,7 +225,7 @@ rectify.c
           	ref equ: case good
           		E21 = -1382.560261	 -0.243551	 0.194739 
           		N21 = -748.402304	 0.027409	 0.505204 
-          	 got psuedo pts: row 22 	 col 27 
+          	 got pseudo pts: row 22 	 col 27 
           		compute geo matrix
           		perform georef 
           		write matrix 

imagery/i.ortho.photo/lib/orthoref.c

@@ -189,7 +189,7 @@ int I_compute_ortho_equations(struct Ortho_Control_Points *cpz,
 	double dist_grnd, dist_photo;
 	double meanx, meany, meanX, meanY, meanZ;
 	
-	/* set intial XC and YC from mean values of control points */
+	/* set initial XC and YC from mean values of control points */
 	meanx = meany = meanX = meanY = meanZ = 0;
 	x = y = X = Y = 0;
 	n = 0;
@@ -283,7 +283,7 @@ int I_compute_ortho_equations(struct Ortho_Control_Points *cpz,
     epsilon.x[5][0] = *Kappa;
 
 /************************** Start Iterations *****************************/
-    /* itererate untill convergence */
+    /* itererate until convergence */
 
     for (iter = 0; iter <= MAX_ITERS; iter++) {
 	/*  break if converged */

imagery/i.segment/flag.h

@@ -10,7 +10,7 @@
  ** int nrows, ncols;
  **     opens the structure flag.  
  **     The flag structure will be a two dimensional array of bits the
- **     size of nrows by ncols.  Will initalize flags to zero (unset).
+ **     size of nrows by ncols.  Will initialize flags to zero (unset).
  **
  ** flag_destroy(flags)
  ** FLAG *flags;

imagery/i.segment/mean_shift.c

@@ -15,7 +15,7 @@
 
 int remove_small_clumps(struct globals *globals);
 
-/* standard gauss funtion:
+/* standard gauss function:
  * a * exp(-(x - m)^2 / (2 * stddev^2)
  * a is not needed because the sum of weights is calculated for each 
  * sampling window

imagery/i.smap/decimate.c

@@ -18,7 +18,7 @@ void make_pyramid(LIKELIHOOD **** ll_pym,	/* log likelihood pyramid, ll_pym[scal
     int wd, ht;
     struct Region region_buff;
 
-    /* save region stucture */
+    /* save region structure */
     copy_reg(region, &region_buff);
 
     D = 0;

imagery/i.smap/reg_util.c

@@ -7,7 +7,7 @@ int levels_reg(struct Region *region)
     int wd, ht;
     struct Region region_buff;
 
-    /* save region stucture */
+    /* save region structure */
     copy_reg(region, &region_buff);
 
     D = 0;

include/iostream/empq_impl.h

@@ -293,7 +293,7 @@ em_pqueue<T,Key>::em_pqueue() {
   
   //assign M/2 to AMI_STREAMS and compute arity
   /* arity is mainly constrained by the size of an AMI_STREAM; the
-     rest of the memory must accomodate for arity * max_nbuf
+     rest of the memory must accommodate for arity * max_nbuf
      *sizeof(AMI_STREAM); there are some temporary stuff like arity *
      sizeof(long) (the deleted array), arity * sizeof(T) (the array of
      keys for merging) and so on, but the main factor is the
@@ -338,11 +338,11 @@ em_pqueue<T,Key>::em_pqueue() {
     buff[i] = NULL;
   }
 
-  //max nb of items the structure can accomodate (constrained by max_nbuf)
+  //max nb of items the structure can accommodate (constrained by max_nbuf)
   cout << "EM_PQUEUE: maximum length is " << maxlen() << "\n";
   cout.flush(); 
   
-  //check that structure can accomodate N elements
+  //check that structure can accommodate N elements
   //  assert(N < buf_arity * (buf_arity + 1) * bufsize);
   //assert(N < maxlen());  
   mm_avail = getAvailableMemory();

include/iostream/mm.h

@@ -86,7 +86,7 @@ enum MM_stream_usage {
 
 
 
-// Declarations of a very simple memory manager desgined to work with
+// Declarations of a very simple memory manager designed to work with
 // BTEs that rely on the underlying OS to manage physical memory.
 class MM_register {
 private:

lib/gis/adj_cellhd.c

@@ -516,7 +516,7 @@ int G_adjust_window_ll(struct Cell_head *cellhd)
     char buf[100], buf2[100];
     double diff;
     double old, new;
-    struct Cell_head cellhds;	/* everyting in seconds, not degrees */
+    struct Cell_head cellhds;	/* everything in seconds, not degrees */
 
     /* lat/lon checks */
     if (cellhd->proj != PROJECTION_LL)

lib/gis/lz4.c

@@ -824,7 +824,7 @@ LZ4_FORCE_INLINE int LZ4_compress_generic(
 _next_match:
         /* at this stage, the following variables must be correctly set :
          * - ip : at start of LZ operation
-         * - match : at start of previous pattern occurence; can be within current prefix, or within extDict
+         * - match : at start of previous pattern occurrence; can be within current prefix, or within extDict
          * - offset : if maybe_ext_memSegment==1 (constant)
          * - lowLimit : must be == dictionary to mean "match is within extDict"; must be == source otherwise
          * - token and *token : position to write 4-bits for match length; higher 4-bits for literal length supposed already written

lib/ogsf/gk2.c

@@ -418,7 +418,7 @@ int GK_delete_key(float pos, float precis, int justone)
    pre-existing keyframe. e.g., if anykey.pos - newkey.pos <= precis,
    GK_add_key() will fail unless force_replace is TRUE.
 
-   \param pos postion
+   \param pos position
    \param fmaks
    \param force_replace
    \param precis precision value

lib/ogsf/gs.c

@@ -964,7 +964,7 @@ int gs_masked(typbuff * tb, int col, int row, int offset)
    \param coloratt color attribute
    \param offset offset value
 
-   \return packed color for catagory at offset
+   \return packed color for category at offset
  */
 int gs_mapcolor(typbuff * cobuff, gsurf_att * coloratt, int offset)
 {

lib/ogsf/gsd_label.c

@@ -31,7 +31,7 @@ GLuint label_id;
 /*!
    \brief Put label
 
-   \todo Allocate label dynamicaly
+   \todo Allocate label dynamically
 
    \param fontbase fontbase settings
    \param size font size

lib/ogsf/gsd_objs.c

@@ -29,7 +29,7 @@
 static void init_stuff(void);
 
 /*!
-   \brief vertices for octohedron
+   \brief vertices for octahedron
  */
 float Octo[6][3] = {
     {1.0, 0.0, 0.0},
@@ -43,7 +43,7 @@ float Octo[6][3] = {
 #define ONORM .57445626
 
 /*!
-   \brief normals for flat-shaded octohedron
+   \brief normals for flat-shaded octahedron
  */
 float OctoN[8][3] = {
     {ONORM, ONORM, ONORM},

lib/ogsf/gsd_prim.c

@@ -76,7 +76,7 @@ static float ogl_mat_emis[4];
 static float ogl_mat_shin;
 
 /*!
-   \brief Mostly for flushing drawing commands accross a network
+   \brief Mostly for flushing drawing commands across a network
 
    glFlush doesn't block, so if blocking is desired use glFinish.
  */
@@ -372,7 +372,7 @@ void gsd_bgnpolygon(void)
 {
     /* OGLXXX
      * special cases for polygons:
-     *  independant quads: use GL_QUADS
+     *  independent quads: use GL_QUADS
      *  independent triangles: use GL_TRIANGLES
      */
     glBegin(GL_POLYGON);

lib/ogsf/gsdrape.c

@@ -9,7 +9,7 @@
    specific triangle edge is intersected, but on a broader sense with
    the horizontal, vertical, and diagonal seams in the grid, then
    the intersections are ordered.  If quadstrips are used for drawing 
-   rather than tmesh, triangulation is not consistant; for diagonal
+   rather than tmesh, triangulation is not consistent; for diagonal
    intersections, the proper diagonal to intersect would need to be
    determined according to the algorithm used by qstrip (look at nearby
    normals). It may be faster to go ahead and find the intersections 
@@ -1328,7 +1328,7 @@ int XY_intersect_plane(float *intersect, float *plane)
    \brief Define plane 
 
    \param p1,p2,p3 three point on plane
-   \param[out] plane plane defintion
+   \param[out] plane plane definition
 
    \return 1
  */

lib/ogsf/gsds.c

@@ -5,7 +5,7 @@
 
    GRASS OpenGL gsurf OGSF Library 
 
-   The idea here is to treat datasets as seperate objects, which SHOULD:
+   The idea here is to treat datasets as separate objects, which SHOULD:
    - allow easier reuse of data for different attributes.
    - allow a mechanism for changing data and have changes reflected
    in each attribute using that data.

lib/ogsf/gvl2.c

@@ -30,7 +30,7 @@ static RASTER3D_Region wind3;
 static double Region[6];
 
 /*!
-   \brief Library intialization for volumes
+   \brief Library initialization for volumes
 
    Set region extent (N,S,W,E,T,B)
  */

lib/ogsf/gvl_calc.c

@@ -930,7 +930,7 @@ int slice_calc(geovol * gvl, int ndx_slc, void *colors)
     f_rows = distz / modz;
     rows = f_rows > (int)f_rows ? (int)f_rows + 1 : (int)f_rows;
 
-    /* set x,y intially to first slice point */
+    /* set x,y initially to first slice point */
     x = slice->x1;
     y = slice->y1;
 

lib/ogsf/gvld.c

@@ -23,7 +23,7 @@
 
 #include "mc33_table.h"
 
-/* usefull macros */
+/* useful macros */
 #define READ() gvl_read_char(pos[i]++, gvl->isosurf[i]->data)
 
 /*!
@@ -563,7 +563,7 @@ int gvld_slice(geovol * gvl, int ndx)
     stepy = (slice->y2 - slice->y1) / f_cols;
     stepz = (slice->z2 - slice->z1) / f_rows;
 
-    /* set x,y intially to first slice pt */
+    /* set x,y initially to first slice pt */
     x = (slice->x1);
     y = (slice->y1);
 

lib/raster/color_org.c

@@ -75,7 +75,7 @@ static int organize_fp_lookup(struct Colors *colors, int mod)
     qsort((char *)cp->fp_lookup.vals, cp->fp_lookup.nalloc,
 	  sizeof(DCELL), &double_comp);
 
-    /* now find the rule to apply inbetween each 2 values in a list */
+    /* now find the rule to apply between each 2 values in a list */
     for (i = 0; i < cp->fp_lookup.nalloc - 1; i++) {
 	val = (cp->fp_lookup.vals[i] + cp->fp_lookup.vals[i + 1]) / 2.;
 	/* fprintf (stderr, "%lf %lf ", cp->fp_lookup.vals[i], cp->fp_lookup.vals[i+1]); */

lib/raster/rasterlib.dox

@@ -1408,7 +1408,7 @@ see if they are integer, and if they are, the integer mechanism is
 used)
  - fp_lookup - a lookup table for floating point numbers is added. It
 orders the end points of fp intervals into array with a pointer to a
-color rule for each inteval, and the binary search is then used when
+color rule for each interval, and the binary search is then used when
 looking up colors instead of linearly searching through all color
 rules.
 

lib/raster3d/raster3dlib.dox

@@ -664,7 +664,7 @@ void Rast3d_printError(char (*msg)(char *)) This function prints the
 <P>
 void Rast3d_fatalError(char (*msg)(char *)) This function prints the
   error message <EM>msg</EM> to <EM>stderr</EM>, flushes <EM>stdout</EM> 
-  and <EM>stderr</EM>, and terminates the program with a segementation fault.
+  and <EM>stderr</EM>, and terminates the program with a segmentation fault.
 
 <P>
 

lib/rst/interp_float/segmen2d_parallel.c

@@ -163,8 +163,8 @@ int IL_interp_segments_2d_parallel(struct interp_params *params, struct tree_inf
                 ymx = ((struct quaddata *)(all_leafs[i_cnt]->data))->ymax;
                 i = 0;
                 MAXENC = 0;
-                /* data is a window with zero points; some fields don't make sence in this case
-                   so they are zero (like resolution,dimentions */
+                /* data is a window with zero points; some fields don't make sense in this case
+                   so they are zero (like resolution,dimensions */
                 /* CHANGE */
                 /* Calcutaing kmin for surrent segment (depends on the size) */
 

mswindows/external/rbatch/batchfiles.md

@@ -377,7 +377,7 @@ overwrite such packages delete them from the target first using the Windows
 
 ## el.js ##
 
-`el.js` runs its arguments elevated (i.e. with Adminstrator privileges).  For example,
+`el.js` runs its arguments elevated (i.e. with Administrator privileges).  For example,
 
 	el R touch
 

mswindows/external/rbatch/batchfiles.tex

@@ -306,7 +306,7 @@ R.bat gui
 
 \subsection{el.js}
 
-\texttt{el.js} runs its arguments elevated (i.e.~with Adminstrator
+\texttt{el.js} runs its arguments elevated (i.e.~with Administrator
 privileges).
 
 \subsection{clip2r.js}

raster/r.contour/README

@@ -86,13 +86,13 @@ The original r.contour worked pretty well, so I assume that most
 problems may be due to the floating point and NULL (which would
 change the handling of special cases and which probably wasn't taken
 care of.)
-I don't remeber who ported r.contour to FP - it might have been Olga
+I don't remember who ported r.contour to FP - it might have been Olga
 Waupotitsch (she did most of the FP port).  Bill is right, I don't believe
 that Terry (she is a woman, BTW) could help too much here. I use r.contour
 occasionally and I don't remember any problems, although I usually run it
 without mask, so NULLs may be the most problematic issue (Terry left before
 those were introduced.) I hope that Bill's description of the algorithm will
-be helpfull,
+be helpful,
 
 Helena
 --------------------------------------------------

raster/r.cost/flag.h

@@ -10,7 +10,7 @@
  ** int nrows, ncols;
  **     opens the structure flag.  
  **     The flag structure will be a two dimensional array of bits the
- **     size of nrows by ncols.  Will initalize flags to zero (unset).
+ **     size of nrows by ncols.  Will initialize flags to zero (unset).
  **
  ** flag_destroy(flags)
  ** FLAG *flags;

raster/r.cost/main.c

@@ -418,7 +418,7 @@ int main(int argc, char *argv[])
     G_debug(1, "  %d rows, %d cols", nrows, ncols);
 
     /* this is most probably the limitation of r.cost for large datasets
-     * segment size needs to be reduced to avoid unecessary disk IO
+     * segment size needs to be reduced to avoid unnecessary disk IO
      * but it doesn't make sense to go down to 1
      * so use 64 segment rows and cols for <= 200 million cells
      * for larger regions, 32 segment rows and cols

raster/r.distance/distance.c

@@ -88,7 +88,7 @@ int null_distance(const char *name1, const char *name2, int *zerro_row, int *zer
     int nrows, ncols, row, col;
     void *cell1, *cell2;
 
-    /* NOTE: no need to controll, if the map exists. it should be checked in edge.c */
+    /* NOTE: no need to control, if the map exists. it should be checked in edge.c */
     mapset = G_find_raster2(name1, "");
     maptype1 = Rast_map_type(name1, mapset);
     mapd1 = Rast_open_old(name1, mapset);

raster/r.fill.stats/main.c

@@ -309,7 +309,7 @@ void collect_values_and_frequencies_filtered(double val1, double val2,
 
 
 /*
- * Simple double comparision function for use by qsort().
+ * Simple double comparison function for use by qsort().
  * This is needed for calculating median statistics.
  */
 int compare_dbl(const void *val1, const void *val2)

raster/r.gwflow/r.gwflow.html

@@ -35,7 +35,7 @@ This is an indicator of the quality of the numerical result.
 <h2>NOTES</h2>
 
 The groundwater flow calculation is based on Darcy's law and a numerical implicit
-finite volume discretization. The discretization results in a symmetric and positive definit
+finite volume discretization. The discretization results in a symmetric and positive definite
 linear equation system in form of <i>Ax = b</i>, which must be solved. The groundwater flow partial
 differential equation is of the following form:
 

raster/r.lake/main.c

@@ -70,7 +70,7 @@ void save_map(FCELL ** out, int out_fd, int rows, int cols, int flag,
 		*volume += cellsize * out[row][col];
 	    }
 
-	    /* Get min/max depth. Can be usefull ;) */
+	    /* Get min/max depth. Can be useful ;) */
 	    if (out[row][col] > *max_depth)
 		*max_depth = out[row][col];
 	    if (out[row][col] < *min_depth)

raster/r.li/r.li.daemon/daemon.h

@@ -241,7 +241,7 @@ int raster_Output(int fd, int aid, struct g_area *g, double res);
  /**
   * \brief calculates a simple index for code debugging
   * \param fd file descriptor of raster
-  * \param par the parameters of index not included in funtion 
+  * \param par the parameters of index not included in function 
   * declaration
   * \param result where to return result
   * \return 0 on error, 1 otherwise

raster/r.out.gdal/main.c

@@ -15,7 +15,7 @@
 *
 *****************************************************************************/
 
-/* Undefine this if you do not want any extra funtion calls before G_parse() */
+/* Undefine this if you do not want any extra function calls before G_parse() */
 #define __ALLOW_DYNAMIC_OPTIONS__
 
 #include <stdlib.h>
@@ -680,7 +680,7 @@ int main(int argc, char *argv[])
 	}
     }
 
-    /* Finaly create user requested raster format from memory raster 
+    /* Finally create user requested raster format from memory raster 
      * if in-memory driver was used */
     if (hMEMDS) {
 	hDstDS =

raster/r.proj/main.c

@@ -42,7 +42,7 @@
 *		 needed amount of memory will be allocated for the projection
 *	
 *		 Bugfixes 20050328: added floor() before (int) typecasts to in avoid
-*		 assymetrical rounding errors. Added missing offset outcellhd.ew_res/2 
+*		 asymmetrical rounding errors. Added missing offset outcellhd.ew_res/2 
 *		 to initial xcoord for each row in main projection loop (we want to  project 
 *		 center of cell, not border).
 *

raster/r.random.cells/flag.h

@@ -29,7 +29,7 @@ FLAG *FlagCreate(int nrows, int ncols);
 
 /**	opens the structure flag.  
 **	The flag structure will be a two dimensional array of bits the
-**	size of nrows by ncols.  Will initalize flags to zero (unset).
+**	size of nrows by ncols.  Will initialize flags to zero (unset).
 **/
 void FlagDestroy(FLAG * flags);
 

raster/r.random/local_proto.h

@@ -28,7 +28,7 @@ typedef unsigned long long gcell_count;
 typedef unsigned long gcell_count;
 #endif
 
-/* Put all the state infomation into a struct */
+/* Put all the state information into a struct */
 struct rr_state
 {
     char *inraster, *inrcover, *outraster, *outvector;

raster/r.ros/main.c

@@ -18,7 +18,7 @@
  * cell is based on the Fortran code by Pat Andrews (1983)
  * of the Northern Forest Fire Laboratory, USDA Forest
  * Service. These three raster map layers are expected to
- * be the inputs for a seperate GRASS raster module 
+ * be the inputs for a separate GRASS raster module 
  * 'r.spread'.
  * 
  * 'r.ros' can be run in two standard GRASS modes:
@@ -637,7 +637,7 @@ int main(int argc, char *argv[])
 		aspect[col] = (630 - aspect[col]) % 360;
 
 	    /* assign some dead fuel moisture if not completely 
-	     *     given based on emperical relationship*/
+	     *     given based on empirical relationship*/
 	    if (!(parm.mois_10h->answer || parm.mois_100h->answer)) {
 		moisture[1] = moisture[0] + 0.01;
 		moisture[2] = moisture[0] + 0.02;

raster/r.ros/spot_dist.c

@@ -67,7 +67,7 @@ double B[14] = { 0, -1.21, -1.32, -1.19, -1.05, -0.92, -0.94,
  *        and in Chase (1984) equation for source z
  * @param maxros maximal ROS used in Byram's equation
  * @param speed wind speed used to compute mean windspeed at 6 meter
- *        accoring to Chase (1984) influencing the target z
+ *        according to Chase (1984) influencing the target z
  * @param angle direction of maximal ROS, i.e. the direction of spotting
  *        (if you think that only direction of wind influences the spotting
  *        then this should be the wind direction)

raster/r.spread/spot.c

@@ -31,7 +31,7 @@
  *	3) the landing firebrand may ignite spread based on fine fuel
  *	   moisture dictated probability simplified from Rothermel (1983);
  *	4) spotting travel time is proportional to but slower than windspeed;
- *	5) there is an elapsed time to reach equilibium rate of spread (ROS).
+ *	5) there is an elapsed time to reach equilibrium rate of spread (ROS).
  *	   This elapsed time is proportional to the ROS. 
  * Refs:
  * Chase, C. H., 1984, Spotting distance from wind-driven surface fires --

raster/r.stream.extract/flag.h

@@ -11,7 +11,7 @@
  *     sets the flag at position bitno to zero.
  *
  * int flag_get(flag, bitno)
- *     checks if the flag is set at postion bitno.
+ *     checks if the flag is set at position bitno.
  *
  * Examples:
  * set flag at position 0: FLAG_SET(flag, 0)

raster/r.sun/main.c

@@ -1,6 +1,6 @@
 
 /*******************************************************************************
-r.sun: This program was writen by Jaro Hofierka in Summer 1993 and re-engineered
+r.sun: This program was written by Jaro Hofierka in Summer 1993 and re-engineered
 in 1996-1999. In cooperation with Marcel Suri and Thomas Huld from JRC in Ispra
 a new version of r.sun was prepared using ESRA solar radiation formulas.
 See manual pages for details.

raster/r.sun/rsunglobals.h

@@ -1,6 +1,6 @@
 
 /*******************************************************************************
-r.sun: rsunglobals.h. This program was writen by Jaro Hofierka in Summer 1993 and re-engineered
+r.sun: rsunglobals.h. This program was written by Jaro Hofierka in Summer 1993 and re-engineered
 in 1996-1999. In cooperation with Marcel Suri and Thomas Huld from JRC in Ispra
 a new version of r.sun was prepared using ESRA solar radiation formulas.
 See manual pages for details.

raster/r.sun/rsunlib.c

@@ -1,5 +1,5 @@
 /****************************************************************************
- r.sun: rsunlib.c. This program was writen by Jaro Hofierka in Summer 1993
+ r.sun: rsunlib.c. This program was written by Jaro Hofierka in Summer 1993
    and re-engineered in 1996-1999. In cooperation with Marcel Suri and
    Thomas Huld from JRC in Ispra a new version of r.sun was prepared using
    ESRA solar radiation formulas.  See the manual page for details.

raster/r.sun/sunradstruct.h

@@ -1,6 +1,6 @@
 
 /*******************************************************************************
-r.sun: sunradstruct.h. This program was writen by Jaro Hofierka in Summer 1993 and re-engineered
+r.sun: sunradstruct.h. This program was written by Jaro Hofierka in Summer 1993 and re-engineered
 in 1996-1999. In cooperation with Marcel Suri and Thomas Huld from JRC in Ispra
 a new version of r.sun was prepared using ESRA solar radiation formulas.
 See manual pages for details.

raster/r.sunhours/solpos00.c

@@ -305,7 +305,7 @@ static long int validate(struct posdata *pdat)
 
     /* No absurd dates, please. */
     if (pdat->function & L_GEOM) {
-	if ((pdat->year < 1950) || (pdat->year > 2050))	/* limits of algoritm */
+	if ((pdat->year < 1950) || (pdat->year > 2050))	/* limits of algorithm */
 	    retval |= (1L << S_YEAR_ERROR);
 	if (!(pdat->function & S_DOY) &&
 	    ((pdat->month < 1) || (pdat->month > 12)))

raster/r.sunmask/solpos00.c

@@ -305,7 +305,7 @@ static long int validate(struct posdata *pdat)
 
     /* No absurd dates, please. */
     if (pdat->function & L_GEOM) {
-	if ((pdat->year < 1950) || (pdat->year > 2050))	/* limits of algoritm */
+	if ((pdat->year < 1950) || (pdat->year > 2050))	/* limits of algorithm */
 	    retval |= (1L << S_YEAR_ERROR);
 	if (!(pdat->function & S_DOY) &&
 	    ((pdat->month < 1) || (pdat->month > 12)))

raster/r.surf.area/main.c

@@ -44,8 +44,8 @@
 
 /* Modified by Eric G. Miller to work with FP rasters and to handle
  * NULL value cells.  I'm not too sure how bad the surface area
- * calculation will get if there are alot of NULL cells mixed around.
- * Added function prototypes and removed a couple unneccessary typedefs
+ * calculation will get if there are a lot of NULL cells mixed around.
+ * Added function prototypes and removed a couple unnecessary typedefs
  * Added the add_null_area() function.
  * 2000-10-17
  */

raster/r.surf.contour/flag.h

@@ -6,7 +6,7 @@
  ** int nrows, ncols;
  **     opens the structure flag.  
  **     The flag structure will be a two dimensional array of bits the
- **     size of nrows by ncols.  Will initalize flags to zero (unset).
+ **     size of nrows by ncols.  Will initialize flags to zero (unset).
  **
  ** flag_destroy(flags)
  ** FLAG *flags;

raster/r.terraflow/main.cpp

@@ -408,7 +408,7 @@ setSinkWatershedColorTable(char* cellname) {
 
 
 
-/* print the largest interm file that will be generated during
+/* print the largest interim file that will be generated during
    r.terraflow */
 void
 printMaxSortSize(long nodata_count) {
@@ -548,7 +548,7 @@ main(int argc, char *argv[]) {
   long nodata_count;
   elstr = cell2stream<elevation_type>(opt->elev_grid, elevation_type_max,
 									  &nodata_count);
-  /* print the largest interm file that will be generated */
+  /* print the largest interim file that will be generated */
   printMaxSortSize(nodata_count);
   
 

raster/r.terraflow/water.cpp

@@ -349,7 +349,7 @@ generateWatersheds(AMI_STREAM<waterWindowType> **waterWindows,
 				  winp->getDepth(k),
 				  winp->i + i, winp->j + j);
 #ifndef NDEBUG
-	      /* dont insert if preceeds us */
+	      /* dont insert if precedes us */
 	      if(winp->getPriority() < prio) {
 		fillPLabel plabel(prio, label);
 		pq->insert(plabel);

raster/r.to.vect/lines.c

@@ -18,7 +18,7 @@
  * USA CERL on nov, 1993
  * because the previous implementation was incosistent
  * stopped in the middle of map, because it tried to continue
- * a line wich was presumed to have been started earlier
+ * a line which was presumed to have been started earlier
  * but in fact was not started.
  * also the write_line() complained that the lines end unexpectedly
  *
@@ -333,13 +333,13 @@ static int update_list(int count)
 		    v_list[col - 1].right = new_ptr1;
 	    }
 	    else {		/* lower-left */
-		/* if the non-zero neigbours are adjacent */
+		/* if the non-zero neighbors are adjacent */
 		if (mr && br)
 		    h_ptr = start_line(1);
 		else if ((br && bc) || (bl && bc))
 		    v_list[col].center = start_line(1);
 		else
-		    /* the non-zero neigbours are not adjacent */
+		    /* the non-zero neighbors are not adjacent */
 		{		/* starting in middle of line */
 		    new_ptr1 = get_ptr();
 		    new_ptr2 = get_ptr();

raster/r.viewshed/distribute.cpp

@@ -1015,7 +1015,7 @@ int compute_n_sectors()
        //technically, if there is not enough memory to hold two
        //blocks, the function should enter solve_in_memory; so there
        //is not enough memory to solve in memory nor to
-       //distribute...this shoudl happen only under tests with very
+       //distribute...this should happen only under tests with very
        //very little memory. just set nsect=2 and hope that it
        //works */
 

raster/r.viewshed/eventlist.h

@@ -96,7 +96,7 @@ void print_event(AEvent a, int debug_level);
 
     /*computes the distance from the event to the viewpoint. Note: all 3
        //events associate to a cell are considered at the same distance, from
-       //the center of teh cell to the viewpoint */
+       //the center of the cell to the viewpoint */
 double get_square_distance_from_viewpoint(const AEvent & a,
 					  const Viewpoint & vp);
 

raster/r.viewshed/grid.cpp

@@ -116,7 +116,7 @@ Grid *create_empty_grid()
 
 
 /* ------------------------------------------------------------ */
-/* allocate memroy for grid_data; grid must have a header that gives
+/* allocate memory for grid_data; grid must have a header that gives
    the dimensions */
 void alloc_grid_data(Grid * pgrid)
 {

raster/r.viewshed/grid.h

@@ -56,7 +56,7 @@ extern "C"
 typedef float surface_type;
 typedef FCELL G_SURFACE_T;
 
-/* this should accomodate grid sizes up to 2^16-1=65,535
+/* this should accommodate grid sizes up to 2^16-1=65,535
    If this is not enough, change type and recompile */
 typedef unsigned short int dimensionType;
 static const dimensionType maxDimension = USHRT_MAX - 1;

raster/r.viewshed/rbbst.cpp

@@ -632,7 +632,7 @@ double find_max_value(TreeNode * root)
 	return SMALLEST_GRADIENT;
     assert(root);
     /*assert(root->value.maxGradient != SMALLEST_GRADIENT);
-       //LT: this shoudl be fixed
+       //LT: this should be fixed
        //if (root->value.maxGradient != SMALLEST_GRADIENT) */
     return root->value.maxGradient;
 }

raster/r.walk/flag.h

@@ -10,7 +10,7 @@
  ** int nrows, ncols;
  **     opens the structure flag.  
  **     The flag structure will be a two dimensional array of bits the
- **     size of nrows by ncols.  Will initalize flags to zero (unset).
+ **     size of nrows by ncols.  Will initialize flags to zero (unset).
  **
  ** flag_destroy(flags)
  ** FLAG *flags;

raster/r.walk/main.c

@@ -531,7 +531,7 @@ int main(int argc, char *argv[])
     G_debug(1, " NS resolution %s (%g)", buf, window.ns_res);
 
     /* this is most probably the limitation of r.walk for large datasets
-     * segment size needs to be reduced to avoid unecessary disk IO
+     * segment size needs to be reduced to avoid unnecessary disk IO
      * but it doesn't make sense to go down to 1
      * so use 64 segment rows and cols for <= 200 million cells
      * for larger regions, 32 segment rows and cols

raster/r.watershed/ram/do_cum.c

@@ -239,8 +239,8 @@ int do_cum(void)
  * 
  * implemented here:
  * Holmgren (1994) with modifications to honour A * path in order to get
- * out of depressions and across obstacles with gracefull flow convergence
- * before depressions/obstacles and gracefull flow divergence after 
+ * out of depressions and across obstacles with graceful flow convergence
+ * before depressions/obstacles and graceful flow divergence after 
  * depressions/obstacles
  * 
  * Topographic Convergence Index (TCI)

raster/r.watershed/ram/flag.h

@@ -10,7 +10,7 @@
  ** int nrows, ncols;
  **     opens the structure flag.  
  **     The flag structure will be a two dimensional array of bits the
- **     size of nrows by ncols.  Will initalize flags to zero (unset).
+ **     size of nrows by ncols.  Will initialize flags to zero (unset).
  **
  ** flag_destroy(flags)
  ** FLAG *flags;

raster/r.watershed/seg/do_cum.c

@@ -252,8 +252,8 @@ int do_cum(void)
  * 
  * implemented here:
  * Holmgren (1994) with modifications to honour A * path in order to get
- * out of depressions and across obstacles with gracefull flow convergence
- * before depressions/obstacles and gracefull flow divergence after 
+ * out of depressions and across obstacles with graceful flow convergence
+ * before depressions/obstacles and graceful flow divergence after 
  * depressions/obstacles
  * 
  * Topographic Convergence Index (TCI)

raster/r.watershed/seg/flag.h

@@ -11,7 +11,7 @@
  *     sets the flag at position bitno to zero.
  *
  * int flag_get(flag, bitno)
- *     checks if the flag is set at postion bitno.
+ *     checks if the flag is set at position bitno.
  *
  * Examples:
  * set flag at position 0: FLAG_SET(flag, 0)

raster/r.watershed/shed/print.c

@@ -60,7 +60,7 @@ int print_output(OUTPUT * output)
 	fprintf(output->out_file, "             Area       Percent Basin\n");
 	for (b = 0; b < output->num_maps; b++) {
 	    fprintf(output->out_file,
-		    "<< %20s >> map layer, average catagory value: %.2f\n",
+		    "<< %20s >> map layer, average category value: %.2f\n",
 		    output->maps[b].name,
 		    ((double)output->maps[b].basins[c].sum_values) /
 		    output->basin_facts[c].num_cells);

raster3d/r3.gwflow/r3.gwflow.html

@@ -21,7 +21,7 @@ specific yield raster map to zero.
 
 The groundwater flow calculation is based on Darcy's law and a numerical
 implicit finite volume discretization. The discretization results in a
-symmetric and positive definit linear equation system in form of
+symmetric and positive definite linear equation system in form of
 <i>Ax = b</i>, which must be solved. The groundwater flow partial
 differential equation is of the following form:
 

raster3d/r3.retile/test.r3.retile.sh

@@ -1,4 +1,4 @@
-# The module r3.retile is the object of ths test case
+# The module r3.retile is the object of the test case
 
 
 # We need to set a specific region in the

raster3d/r3.showdspf/get_color_ogl.c

@@ -167,7 +167,7 @@ Gets new color values for D_spec->ctable from file cfile,
 which is the original (per threshold) color table 
 (i.e. gets out of per cube color mode).
 If unable to open cfile (colortable file), prints error message 
-andd uses default color table.
+and uses default color table.
 ******************************************************************************/
 void no_color_file(D_spec, cfile)
      struct dspec *D_spec;

raster3d/r3.showdspf/main_ogl.c

@@ -220,7 +220,7 @@ int main(int argc, char **argv)
 	Headfax.g3mapin = g3map;
 
 	/* currently seems rather redundant, but may have future use to
-	   keep them seperate. */
+	   keep them separate. */
 	copy_head(&G3header, &Headfax);
 
 	/* INIT */
@@ -804,7 +804,7 @@ do_draw(file_info * Headp, file_info * G3p, struct dspec *D_spec,
 	do__draw_solid(Headp, G3p, D_spec, Cap);
     else if (type & DRAW_CAP)
 	draw_cap_side(D_spec, Headp, G3p, Cap, (type >> 16) & 0x3f);
-    /* bring over arguement to DRAW_CAP in high 16 bits to low 16 */
+    /* bring over argument to DRAW_CAP in high 16 bits to low 16 */
     /*    and AND with   00111111  for sides 1-6 */
 
 
@@ -933,7 +933,7 @@ do_draw_no_transformations(file_info * Headp, file_info * G3p,
 	do__draw_solid(Headp, G3p, D_spec, Cap);
     else if (type & DRAW_CAP)
 	draw_cap_side(D_spec, Headp, G3p, Cap, (type >> 16) & 0x3f);
-    /* bring over arguement to DRAW_CAP in high 16 bits to low 16 */
+    /* bring over argument to DRAW_CAP in high 16 bits to low 16 */
     /*    and AND with   00111111  for sides 1-6 */
 
 }

raster3d/r3.showdspf/new_init_graphics.c

@@ -152,7 +152,7 @@ void new_getsize(long *x, long *y)
   initializeFonts()
   This function initializes the OpenGL display lists required for drawing 
   2D text in a 3D window.  FontBase will end up pointing to a sequence
-  of display lists in which each individual display charactor in a font.
+  of display lists in which each individual display character in a font.
   The font chosen in a Courier Bold font chosen to match the font used 
   by the IRISGL charstr() function.
   -------------------------------------------------------------------

raster3d/r3.stats/support.c

@@ -353,7 +353,7 @@ void check_range_value(stat_table *stats, double value)
  *                                                                     / \ 
  *                                                               [[7,8]]  [[8,9]]
  *
- * Searching the value 5.5 will result in the follwoing steps:
+ * Searching the value 5.5 will result in the following steps:
  *
  * value 5.5 in range of
  * 1.) left array index = 0 - right array index = 8 -> range [0 - 9]

raster3d/r3.to.rast/main.c

@@ -135,7 +135,7 @@ void set_params()
 }
 
 /* ************************************************************************* */
-/* Write the slices to seperate raster maps ******************************** */
+/* Write the slices to separate raster maps ******************************** */
 
 /* ************************************************************************* */
 /* coefficients are used only when needed, otherwise the original values

tools/module_synopsis.sh

@@ -2,7 +2,7 @@
 ############################################################################
 #
 # TOOL:         module_synopsis.sh
-# AUTHOR:       M. Hamish Bowman, Dept. Marine Science, Otago Univeristy,
+# AUTHOR:       M. Hamish Bowman, Dept. Marine Science, Otago University,
 #                 New Zealand
 # PURPOSE:      Runs through GRASS modules and creates a synopsis list of
 #		  module names and descriptions.
@@ -240,7 +240,7 @@ sed -i -e 's+\(a href="\)\([^#\.h]\)+\1../../grass64/manuals/html64_user/\2+'
   <li> db.* - <a href="#db">database</a> commands
   <li> g.* - <a href="#g">general</a> commands
   <li> i.* - <a href="#i">imagery</a> commands
-  <li> m.* - <a href="#m">miscellanous</a> commands
+  <li> m.* - <a href="#m">miscellaneous</a> commands
   <li> ps.* - <a href="#ps">PostScript</a> commands
   <li> r.* - <a href="#r">raster</a> commands
   <li> r3.* - <a href="#r3">raster3D</a> commands
@@ -380,7 +380,7 @@ cat << EOF > "${TMP}.tex"
 \item [db.{*}]database commands
 \item [g.{*}]general commands
 \item [i.{*}]imagery commands
-\item [m.{*}]miscellanous commands
+\item [m.{*}]miscellaneous commands
 \item [ps.{*}]postscript commands
 \item [r.{*}]raster commands
 \item [r3.{*}]raster3D commands

tools/pylintrc.txt

@@ -13,7 +13,7 @@
 #   pylint --rcfile=../../tools/pylintrc.txt -f parseable -r n -i y lmgr/
 
 # A lot of errors need to be ignored now to avoid a large number of messages.
-# Files need to be fixed one by one (partialy without this configuration).
+# Files need to be fixed one by one (partially without this configuration).
 
 # Save this file ~/.pylintrc on Linux
 

vector/v.in.ogr/main.c

@@ -1486,7 +1486,7 @@ int main(int argc, char *argv[])
 	/* It is not to clean to snap centroids, but I have seen data with 2 duplicate polygons
 	 * (as far as decimal places were printed) and centroids were not identical */
 	/* Disabled, because the mechanism has changed:
-	 * at this stage, there are no centroids yet, centroids are caluclated 
+	 * at this stage, there are no centroids yet, centroids are calculated 
 	 * later for output areas, not fo input polygons */
 	/*
 	   fprintf ( stderr, separator );

vector/v.label.sa/main.c

@@ -5,7 +5,7 @@
  * PURPOSE:      Create paint labels, but use a Simulated Annealing
  *               algorithm to avoid overlapping labels.
  *               This file contains the command line parsing and main function.
- *               The paint label file writing funtion (print_label()) is also
+ *               The paint label file writing function (print_label()) is also
  *               part of this file.
  * COPYRIGHT:    (C) 2007 by the GRASS Development Team
  *

vector/v.profile/main.c

@@ -742,7 +742,7 @@ int main(int argc, char *argv[])
     if (ascii != NULL)
         fclose(ascii);
 
-    /* Don't forget to report to caller sucessfull end of data processing :) */
+    /* Don't forget to report to caller successful end of data processing :) */
     exit(EXIT_SUCCESS);
 }