Numerous typos fixed (identified with tools/fix_typos.sh)

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

AUTHORS

@@ -48,13 +48,13 @@ Summary view:
 https://www.openhub.net/p/grass_gis
 
 
-GRASS 7.0 major project contributers
+GRASS 7.0 major project contributors
 ------------------------------------
 
 LEAD ARCHITECTS
  - Glynn Clements <glynn at gclements plus com>: libraries
  - Markus Metz <markus.metz.giswork gmail.com>: Vector library lead
- - Soeren Gebbert: temporal framwork lead
+ - Soeren Gebbert: temporal framework lead
  - Pietro Zambelli: Python API lead
 
 GUI
@@ -136,7 +136,7 @@ Power user tester:
    Maciej "Maciek" Sieczka <msieczka at sieczka.org>
 
 
-GRASS 6.0 - 6.2 major project contributers
+GRASS 6.0 - 6.2 major project contributors
 ------------------------------------------
 
 PROJECT INTEGRATION

configure.in

@@ -1153,7 +1153,7 @@ if test -n "$USE_MYSQL"; then
 
   LOC_CHECK_LIBS(mysqlclient,mysql_query,MySQL,$MYSQLLIBPATH,MYSQLLIB,,,,$ZLIB,$SOCKLIB,$MATHLIB)
 
-  # Check for libmysqld (for embeded version of the driver)
+  # Check for libmysqld (for embedded version of the driver)
   AC_PATH_PROG(MYSQLD_CONFIG, mysql_config, no)
 
   if test "$MYSQLD_CONFIG" = "no" ; then

db/drivers/odbc/TODO

@@ -34,6 +34,6 @@ P db_driver_open_database      - add user and password, ? datasource
 x db_driver_version
 
 + implemented and works, but you can improve it
-P partialy implemented, needs improvements
+P partially implemented, needs improvements
 - not implemented, waiting for you
-x not planed now - impossible or not urgent
+x not planned now - impossible or not urgent

db/drivers/postgres/README

@@ -1,6 +1,6 @@
 Postgres driver.
 
-This driver was originaly written by Alex Shevlakov using dbf driver
+This driver was originally written by Alex Shevlakov using dbf driver
 (PostgreSQL driver forked from DBF driver by Radim Blazek).
 DBF driver was not good starting point, so I (R. Blazek) have rewritten it again
 using ODBC, postgres driver and adding new code.

db/drivers/postgres/priv.c

@@ -1,7 +1,7 @@
 /*!
   \file db/driver/postgres/priv.c
   
-  \brief DBMI - Low Level PostgreSQL database driver - privilages
+  \brief DBMI - Low Level PostgreSQL database driver - privileges
   
   This program is free software under the GNU General Public License
   (>=v2). Read the file COPYING that comes with GRASS for details.

db/drivers/sqlite/README

@@ -17,7 +17,7 @@ That is SQLite feature followed also in the driver.
 SQLite uses "type affinity", (http://www.sqlite.org/datatype3.html)
 that means column types are recommended, but not required.
 
-If the driver in GRASS has to determin column type, it first reads 
+If the driver in GRASS has to determine column type, it first reads 
 "affinity" if available (table column) and then data types of values
 in the first row. If a column in a query does not come from table and there 
 are no results, the driver cannot recognize column type.

db/drivers/sqlite/grass-sqlite.html

@@ -45,7 +45,7 @@ eval `g.gisenv`
 sqlitebrowser "$GISDBASE/$LOCATION_NAME/$MAPSET"/sqlite/sqlite.db
 </pre></div>
 
-<!-- doesnt work yet, why?:
+<!-- doesn't work yet, why?:
   ah, pending patch: http://www.sqlite.org/cvstrac/tktview?tn=1476
 
 <h2>Adding an unique ID column</h2>

include/Make/Doxyfile_arch_latex.in

@@ -1188,7 +1188,7 @@ EXT_LINKS_IN_WINDOW    = NO
 
 FORMULA_FONTSIZE       = 10
 
-# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# Use the FORMULA_TRANSPARENT tag to determine whether or not the images
 # generated for formulas are transparent PNGs. Transparent PNGs are
 # not supported properly for IE 6.0, but are supported on all modern browsers.
 # Note that when changing this option you need to delete any form_*.png files

include/dbmi.h

@@ -300,7 +300,7 @@ typedef struct _db_connection
     char *user;
     char *password;
     char *keycol;		/* name of default key column */
-    char *group;		/* deafault group to which select privilege is granted */
+    char *group;		/* default group to which select privilege is granted */
 } dbConnection;
 
 /* reclass rule */

include/defs/gmath.h

@@ -95,7 +95,7 @@ extern double **G_math_matrix_to_sband_matrix(double **, int, int);
 extern double **G_math_sband_matrix_to_matrix(double **, int, int);
 extern void G_math_Ax_sband(double ** A, double *x, double *y, int rows, int bandwidth);
 
-/*linear equation solver, most of them are multithreaded wih OpenMP*/
+/*linear equation solver, most of them are multithreaded with OpenMP*/
 extern int G_math_solver_gauss(double **, double *, double *, int );
 extern int G_math_solver_lu(double **, double *, double *, int );
 extern int G_math_solver_cholesky(double **, double *, double *, int , int );

include/imagery.h

@@ -140,7 +140,7 @@ typedef struct
 #define SC_SCATT_DATA          0 
 #define SC_SCATT_CONDITIONS    1
 
-/*! Holds list of all catagories. 
+/*! Holds list of all categories. 
     It can contain selected areas for scatter plots (SC_SCATT_CONDITIONS type) 
     or computed scatter plots (SC_SCATT_DATA type).
 */
@@ -149,7 +149,7 @@ struct scCats
     int type;        /*!< SC_SCATT_DATA -> computed scatter plots, SC_SCATT_CONDITIONS -> 
                           set conditions for scatter plots to be computed */
 
-    int n_cats;      /*!< number of alocated categories */
+    int n_cats;      /*!< number of allocated categories */
     
     int n_bands;     /*!< number of analyzed bands */
     int n_scatts;    /*!< number of possible scattter plots, which can be created from bands */

include/la.h

@@ -105,7 +105,7 @@ typedef doublereal E_f;		/* real function with -R not specified */
 #define MAX_NEG         -1	/* Indicates minimum value         */
 #define MAX_ABS          0	/* Indicates absolute value        */
 
-#define DO_COMPACT       0	/* Elliminate unnecessary rows (cols) in matrix  */
+#define DO_COMPACT       0	/* Eliminate unnecessary rows (cols) in matrix  */
 #define NO_COMPACT       1	/* ... or not                                    */
 
 

include/vect/dig_structs.h

@@ -154,7 +154,7 @@ struct field_info
     */
     char *table;
     /*!
-      \brief Name of key column (usualy 'cat')
+      \brief Name of key column (usually 'cat')
     */
     char *key;
 };
@@ -502,7 +502,7 @@ struct Format_info_cache {
     /*! 
       \brief Cache type
 
-      Currenly used only by PostGIS Topology which allows caching the
+      Currently used only by PostGIS Topology which allows caching the
       whole map (CACHE_MAP) */
     int ctype;
 };
@@ -676,7 +676,7 @@ struct Format_info_pg
     
     /*! 
       \brief Offset list used for building pseudo-topology (simple
-      features acccess)
+      features access)
     */
     struct Format_info_offset offset;
 

lib/arraystats/arraystatslib.dox

@@ -57,7 +57,7 @@ of the Association of American Geographers, 53, pp.15-26.
 [3] Grimmeau, J.P. (1977) Cartographie par plages et discontinuités
 spatiales, Paris, Espace géographique, VI, pp.49-58.
 
-\section listOfFunctios List of functions
+\section listOfFunctions List of functions
 
 - AS_option_to_algorithm()
 - AS_class_apply_algorithm()

lib/cdhc/cdhclib.dox

@@ -32,7 +32,7 @@ $(CDHCLIB)
 
 in the <tt>Makefile</tt>.
 
-\section listOfFunctios List of functions (incomplete)
+\section listOfFunctions List of functions (incomplete)
 
 - Cdhc_anderson_darling()
 - Cdhc_anderson_darling_exp()

lib/cdhc/shapiro2.c

@@ -5,7 +5,7 @@
 
 
 /* this is actually the Weisberg-Bingham stat. I need to
-   OCR the constants and implment this Cdhc_correctly */
+   OCR the constants and implement this Cdhc_correctly */
 
 double *Cdhc_shapiro_francia(double *x, int n)
 {

lib/cluster/c_distinct.c

@@ -19,7 +19,7 @@
   \param C pointer to Cluster structure
   \param separation separation value
 
-  \return distiction value
+  \return distinction value
 */
 int I_cluster_distinct(struct Cluster *C, double separation)
 {

lib/cluster/c_execmem.c

@@ -16,7 +16,7 @@
 /*!
   \brief Allocate Cluster structure
 
-  \param C poiter to Cluster structure
+  \param C pointer to Cluster structure
 
   \return 1 on success
   \return 0 on error

lib/datetime/scan.c

@@ -420,7 +420,7 @@ static int scan_tz(const char *word, int *tz)
 
 /* returns
    0 not a recognized term
-   1 valid term, but perhaps illiegal value
+   1 valid term, but perhaps illegal value
  */
 static int relative_term(const char **s,
 			 double *x, int *ndigits, int *ndecimal, int *pos)

lib/db/dbmi_base/columnfmt.c

@@ -1,7 +1,7 @@
 /*!
   \file lib/db/dbmi_base/columnfmt.c
   
-  \brief DBMI Library (base) - columns formating
+  \brief DBMI Library (base) - columns formatting
   
   (C) 1999-2009, 2011 by the GRASS Development Team
   

lib/db/dbmi_base/cursor.c

@@ -114,7 +114,7 @@ void db_set_cursor_type_readonly(dbCursor *cursor)
 }
 
 /*!
-   \brief Set cursor to be writeable (update)
+   \brief Set cursor to be writable (update)
 
    \param cursor pointer to dbCursor
 */
@@ -124,7 +124,7 @@ void db_set_cursor_type_update(dbCursor *cursor)
 }
 
 /*!
-   \brief Set cursor to be writeable (insert)
+   \brief Set cursor to be writable (insert)
 
    \param cursor pointer to dbCursor
 */

lib/db/dbmi_base/error.c

@@ -205,7 +205,7 @@ void db_print_error(void)
 static int debug_on = 0;
 
 /*!
-  \brief Turn on debuging
+  \brief Turn on debugging
 */
 void db_debug_on(void)
 {
@@ -213,7 +213,7 @@ void db_debug_on(void)
 }
 
 /*!
-  \brief Turn off debuging
+  \brief Turn off debugging
 */
 void db_debug_off(void)
 {

lib/db/dbmi_base/valuefmt.c

@@ -1,7 +1,7 @@
 /*!
   \file lib/db/dbmi_base/valuefmt.c
   
-  \brief DBMI Library (base) - value formating
+  \brief DBMI Library (base) - value formatting
   
   (C) 1999-2009, 2011 by the GRASS Development Team
   

lib/db/dbmi_client/shutdown.c

@@ -30,7 +30,7 @@
 
   \param driver pointer to dbDriver to be freed
 
-  \return 0 on sucess
+  \return 0 on success
   \return -1 on error
 */
 int db_shutdown_driver(dbDriver * driver)

lib/db/sqlp/alloc.c

@@ -3,7 +3,7 @@
 *
 * MODULE:       SQL statement parser library 
 *   	    	
-* AUTHOR(S):    lex.l and yac.y were originaly taken from unixODBC and
+* AUTHOR(S):    lex.l and yac.y were originally taken from unixODBC and
 *               probably written by Peter Harvey <pharvey@codebydesigns.com>,
 *               modifications and other code by Radim Blazek
 *

lib/db/sqlp/print.c

@@ -3,7 +3,7 @@
 *
 * MODULE:       SQL statement parser library 
 *   	    	
-* AUTHOR(S):    lex.l and yac.y were originaly taken from unixODBC and
+* AUTHOR(S):    lex.l and yac.y were originally taken from unixODBC and
 *               probably written by Peter Harvey <pharvey@codebydesigns.com>,
 *               modifications and other code by Radim Blazek
 *

lib/db/sqlp/sql.c

@@ -3,7 +3,7 @@
 *
 * MODULE:       SQL statement parser library 
 *   	    	
-* AUTHOR(S):    lex.l and yac.y were originaly taken from unixODBC and
+* AUTHOR(S):    lex.l and yac.y were originally taken from unixODBC and
 *               probably written by Peter Harvey <pharvey@codebydesigns.com>,
 *               original modifications & added code by 
 *                     Radim Blazek <radim.blazek gmail.com>

lib/db/sqlp/sqlp.l

@@ -3,7 +3,7 @@
 *
 * MODULE:       SQL statement parser library 
 *   	    	
-* AUTHOR(S):    lex.l and yac.y were originaly taken from unixODBC and
+* AUTHOR(S):    lex.l and yac.y were originally taken from unixODBC and
 *               probably written by Peter Harvey <pharvey@codebydesigns.com>,
 *               modifications and other code by Radim Blazek
 *
@@ -253,7 +253,7 @@ int my_yyinput(char *buf, int max_size)
  * yyerror
  *
  * This should be called just before failing. It formats a meaningfull
- * message and deposits it in a usefull place.
+ * message and deposits it in a useful place.
  *
  **********************************************************************/
 void yyerror( const char *s )

lib/db/sqlp/sqlp.y

@@ -2,7 +2,7 @@
 *
 * MODULE:       SQL statement parser library 
 *   	    	
-* AUTHOR(S):    lex.l and yac.y were originaly taken from unixODBC and
+* AUTHOR(S):    lex.l and yac.y were originally taken from unixODBC and
 *               probably written by Peter Harvey <pharvey@codebydesigns.com>,
 *               modifications and other code by Radim Blazek
 *

lib/dspf/cube_io.c

@@ -124,7 +124,7 @@ static char *fptr = NULL;
 
 /*
  ** expects headfax->dspfinfp to be pointing to current cube
- **  i.e. already searched up to this point  (alowing of course
+ **  i.e. already searched up to this point  (allowing of course
  **  for 0 data already read in 
  **
  **  returns num_thresholds  or 0 for no data  or  -1 on error

lib/external/shapelib/shpopen.c

@@ -1525,7 +1525,7 @@ SHPReadObject( SHPHandle psSHP, int hEntity )
         {
             char szError[200];
 
-            /* Reallocate previous successfull size for following features */
+            /* Reallocate previous successful size for following features */
             psSHP->pabyRec = malloc(psSHP->nBufSize);
 
             sprintf( szError, 
@@ -1535,7 +1535,7 @@ SHPReadObject( SHPHandle psSHP, int hEntity )
             return NULL;
         }
 
-        /* Only set new buffer size after successfull alloc */
+        /* Only set new buffer size after successful alloc */
 	psSHP->nBufSize = nEntitySize;
     }
 

lib/gis/README.TYPE

@@ -66,7 +66,7 @@ CELL x
 printf ("%ld", (long) x);
 .DE
 The way to handle scanf for CELL data is to use %ld into a long
-and assign to the CELL varaible:
+and assign to the CELL variable:
 .DS
 CELL x;
 long t;

lib/gis/asprintf.c

@@ -88,7 +88,7 @@ int G_asprintf(char **out, const char *fmt, ...)
  * terminating NULL, and return the number of characters printed.  
  * Contrary to <i>G_asprintf()</i>, any existing buffer pointed to by 
  * out of size osize is used to hold the output and enlarged if 
- * necessary. This is usefull when <i>G_rasprintf</i> is called many 
+ * necessary. This is useful when <i>G_rasprintf</i> is called many 
  * times in a loop.
  *
  * \param[out] out

lib/gis/cmprrle.c

@@ -43,7 +43,7 @@
  *     int src_sz, dst_sz;                                          *
  *     unsigned char *src, *dst;                                    *
  * ---------------------------------------------------------------- *
- * This function decompresses data compresed with RLE.              *
+ * This function decompresses data compressed with RLE.              *
  * It is equivalent to a single pass call to an external expansion  * 
  * function.                                                        *
  * If you need a continuous expansion scheme, you'll have to code   *

lib/gis/cmprzlib.c

@@ -191,7 +191,7 @@ G_zlib_expand(unsigned char *src, int src_sz, unsigned char *dst,
     c_stream.avail_out = dst_sz;
     c_stream.next_out = dst;
 
-    /* Call zlib initilization function */
+    /* Call zlib initialization function */
     err = inflateInit(&c_stream);
 
     /* If not Z_OK return error -1 */

lib/gis/distance.c

@@ -126,7 +126,7 @@ double G_distance_point_to_line_segment(double xp, double yp,
     double xq, yq, ra, rb;
     int t;
 
-    /* define the perpendicular to the segment thru the point */
+    /* define the perpendicular to the segment through the point */
     dx = x1 - x2;
     dy = y1 - y2;
 

lib/gis/error.c

@@ -119,7 +119,7 @@ void G_verbose_message(const char *msg, ...)
 /*!
  * \brief Print a message to stderr even in brief mode (verbosity=1)
  *
- * Ususally just G_percent()/G_clicker() would be shown at this level.
+ * Usually just G_percent()/G_clicker() would be shown at this level.
  * This allows important non-error/warning messages to display as well.
  *
  * The output format depends on environment variables

lib/gis/get_ellipse.c

@@ -241,7 +241,7 @@ static int compare_ellipse_names(const void *pa, const void *pb)
   \param fatal non-zero value for G_fatal_error(), otherwise
   G_warning() is used
 
-  \return 1 on sucess
+  \return 1 on success
   \return 0 on error
 */
 int G_read_ellipsoid_table(int fatal)

lib/gis/gislib.dox

@@ -70,7 +70,7 @@ This chapter is divided as follows:
 \section gislibintro Introduction
 
 The <em>GIS Library</em> is the primary programming library provided
-with the GRASS system. <b>Programs must use this libary to access the
+with the GRASS system. <b>Programs must use this library to access the
 GIS database.</b> It contains the routines which locate, create, open,
 rename, and remove GRASS database files. It contains the routines
 which read and write raster files. It contains routines which

lib/gis/handler.c

@@ -76,7 +76,7 @@ void G_add_error_handler(void (*func)(void *), void *closure)
 }
 
 /*!
-  \brief Remove existing error hander
+  \brief Remove existing error handler
 
   \param func handler to be remove
   \param closure pointer to closure data

lib/gis/intersect.c

@@ -1,6 +1,6 @@
 
 /**************************************************************
- * find interesection between two lines defined by points on the lines
+ * find intersection between two lines defined by points on the lines
  * line segment A is (ax1,ay1) to (ax2,ay2)
  * line segment B is (bx1,by1) to (bx2,by2)
  * returns

lib/gis/key_value1.c

@@ -18,7 +18,7 @@
 /*!
    \brief Allocate and initialize Key_Value structure
 
-   \return poiter to allocated Key_Value structure
+   \return pointer to allocated Key_Value structure
  */
 struct Key_Value *G_create_key_value(void)
 {
@@ -78,7 +78,7 @@ void G_set_key_value(const char *key, const char *value, struct Key_Value *kv)
    \param key key to be found
    \param kv pointer to Key_value structure
 
-   \return poiter to value of key
+   \return pointer to value of key
    \return NULL if no key found
  */
 const char *G_find_key_value(const char *key, const struct Key_Value *kv)

lib/gis/key_value3.c

@@ -47,7 +47,7 @@ void G_write_key_value_file(const char *file,
 
    \param[in]  file filename for reading
 
-   \return poiter to allocated Key_Value structure
+   \return pointer to allocated Key_Value structure
    \return NULL on error
  */
 struct Key_Value *G_read_key_value_file(const char *file)

lib/gis/ll_format.c

@@ -14,7 +14,7 @@ G_llres_format (res, buf)
 
   formats lat (latitude in degrees), or lon (longitude in degrees)
   into buf as dd:mm:ssH, where H (hemishpere) is
-      N for nothern hemishpere, S for southern,
+      N for northern hemishpere, S for southern,
       W for western hemishpere, E for eastern
       none for resolution
   (lat > 0 is northern, lat < 0 is southern)

lib/gis/ls.c

@@ -197,7 +197,7 @@ void G_ls_format(char **list, int num_items, int perline, FILE * stream)
 	    perline = 1;
     }
 
-    /* Field width to accomodate longest filename */
+    /* Field width to accommodate longest filename */
     field_width = screen_width / perline;
     /* Longest column height (i.e. num_items <= perline * column_height) */
     column_height = (num_items / perline) + ((num_items % perline) > 0);

lib/gis/parser.c

@@ -203,7 +203,7 @@ struct Flag *G_define_flag(void)
  * specified by user on command line. The option string can either
  * specify a range of values (e.g. "10-100") or a list of acceptable
  * values (e.g. "red,orange,yellow"). Unless the option string is
- * NULL, user provided input will be evaluated agaist this string.
+ * NULL, user provided input will be evaluated against this string.
  *
  * \return pointer to an Option struct
  */
@@ -497,7 +497,7 @@ int G_parser(int argc, char **argv)
 	    exit(EXIT_SUCCESS);
 	}
 
-	/* Loop thru all command line arguments */
+	/* Loop through all command line arguments */
 
 	while (--argc) {
 	    ptr = *(++argv);

lib/gis/parser_wps.c

@@ -106,7 +106,7 @@ static void print_escaped_for_xml(FILE * fp, const char *str)
  *
  * Currently only raster and vector modules are supported, but the
  * generation works with any module (more or less meaningful).
- * Most of the input options are catched:
+ * Most of the input options are caught:
  * * single and multiple raster and vector maps
  * * single and multiple string, float and integer data with default
  * values and value options (range is missing)
@@ -201,7 +201,7 @@ void G__wps_print_process_description(void)
     }
 
     wps_print_process_descriptions_begin();
-    /* store and status are supported as default. The WPS server should change this if nessessary */
+    /* store and status are supported as default. The WPS server should change this if necessary */
     wps_print_process_description_begin(store, status, identifier, title, abstract, keywords, num_keywords);
     wps_print_data_inputs_begin();
 

lib/gis/plot.c

@@ -363,7 +363,7 @@ static double wrap_east(double e0, double e1)
  *
  * \param x coordinates of vertices
  * \param y coordinates of vertices
- * \param n number of verticies
+ * \param n number of vertices
  *
  * \return 0 on success
  * \return 2 n < 3

lib/gis/proj3.c

@@ -173,7 +173,7 @@ double G_database_units_to_meters_factor(void)
   
   Returns a pointer to the name of the map datum of the current
   database. If there is no map datum explicitely associated with the
-  acutal database, the standard map datum WGS84 is returned, on error
+  actual database, the standard map datum WGS84 is returned, on error
   a NULL pointer is returned.
   
   \return datum name

lib/gis/token.c

@@ -53,7 +53,7 @@ char **G_tokenize(const char *buf, const char *delim)
 /*!
   \brief Tokenize string
   
-  This fuction behaves similarly to G_tokenize().
+  This function behaves similarly to G_tokenize().
 
   It introduces <em>valchar</em> which defines borders of token. Within
   token <em>delim</em> is ignored.

lib/gis/wind_overlap.c

@@ -18,7 +18,7 @@
 
 
 /**
- * \brief Determins if a box overlays a map window.
+ * \brief Determines if a box overlays a map window.
  *
  * Given a map <b>window</b>, and a box of <b>N</b>,<b>S</b>,<b>E</b>,<b>W</b>
  * does the box overlap the map <b>window</b>?<br>

lib/gmath/TODO

@@ -1,7 +1,7 @@
 TODO
 Date_ 2009-10-03
 * Add ATLAS wrapper for blas level 2 and level 3 functions.
-* Inlcude the HAVE_ATLAS definition in the configure system
+* Include the HAVE_ATLAS definition in the configure system
 * Replace the lu-solver in lu.c with the one from the ccmath library
   and patch all modules using lu.c
 * Implement a robust parallelizable LU solver with pivoting

lib/gmath/lu.c

@@ -53,7 +53,7 @@ int G_ludcmp(double **a, int n, int *indx, double *d)
 	}
 
 	big = 0.0;
-/* not very efficent, but this pragma helps speed things up a bit */
+/* not very efficient, but this pragma helps speed things up a bit */
 #pragma omp parallel for private(i, k, sum, dum) shared(j, n, a, vv, big, imax)
 	for (i = j; i < n; i++) {
 	    sum = a[i][j];

lib/gmath/solvers_krylov.c

@@ -53,8 +53,8 @@ static int solver_bicgstab(double **A, G_math_spvector ** Asp, double *x,
  * \param rows (int)
  * \param maxit (int) -- the maximum number of iterations
  * \param err (double) -- defines the error break criteria
- * \param prec (int) -- the preconditioner which shoudl be used 1,2 or 3
- * \return (int) -- 1 - success, 2 - not finisehd but success, 0 - matrix singular, -1 - could not solve the les
+ * \param prec (int) -- the preconditioner which should be used 1,2 or 3
+ * \return (int) -- 1 - success, 2 - not finished but success, 0 - matrix singular, -1 - could not solve the les
  * 
  * */
 int G_math_solver_pcg(double **A, double *x, double *b, int rows, int maxit,
@@ -85,8 +85,8 @@ int G_math_solver_pcg(double **A, double *x, double *b, int rows, int maxit,
  * \param bandwidth (int) -- bandwidth of matrix A
  * \param maxit (int) -- the maximum number of iterations
  * \param err (double) -- defines the error break criteria
- * \param prec (int) -- the preconditioner which shoudl be used 1,2 or 3
- * \return (int) -- 1 - success, 2 - not finisehd but success, 0 - matrix singular, -1 - could not solve the les
+ * \param prec (int) -- the preconditioner which should be used 1,2 or 3
+ * \return (int) -- 1 - success, 2 - not finished but success, 0 - matrix singular, -1 - could not solve the les
  * 
  * */
 int G_math_solver_pcg_sband(double **A, double *x, double *b, int rows, int bandwidth, int maxit,
@@ -115,8 +115,8 @@ int G_math_solver_pcg_sband(double **A, double *x, double *b, int rows, int band
  * \param rows (int)
  * \param maxit (int) -- the maximum number of iterations
  * \param err (double) -- defines the error break criteria
- * \param prec (int) -- the preconditioner which shoudl be used 1,2 or 3
- * \return (int) -- 1 - success, 2 - not finisehd but success, 0 - matrix singular, -1 - could not solve the les
+ * \param prec (int) -- the preconditioner which should be used 1,2 or 3
+ * \return (int) -- 1 - success, 2 - not finished but success, 0 - matrix singular, -1 - could not solve the les
  * 
  * */
 int G_math_solver_sparse_pcg(G_math_spvector ** Asp, double *x, double *b,
@@ -303,7 +303,7 @@ int solver_pcg(double **A, G_math_spvector ** Asp, double *x, double *b,
  * \param rows (int)
  * \param maxit (int) -- the maximum number of iterations
  * \param err (double) -- defines the error break criteria
- * \return (int) -- 1 - success, 2 - not finisehd but success, 0 - matrix singular, -1 - could not solve the les
+ * \return (int) -- 1 - success, 2 - not finished but success, 0 - matrix singular, -1 - could not solve the les
  * 
  * */
 int G_math_solver_cg(double **A, double *x, double *b, int rows, int maxit,
@@ -324,14 +324,14 @@ int G_math_solver_cg(double **A, double *x, double *b, int rows, int maxit,
  * solver will abort the calculation and writes the current result into the vector x.
  * The parameter <i>err</i> defines the error break criteria for the solver.
  *
- * \param A (double **) -- the symmetric positive definit band matrix
+ * \param A (double **) -- the symmetric positive definite band matrix
  * \param x (double *) -- the value vector
  * \param b (double *) -- the right hand side
  * \param rows (int)
  * \param bandwidth (int) -- the bandwidth of matrix A
  * \param maxit (int) -- the maximum number of iterations
  * \param err (double) -- defines the error break criteria
- * \return (int) -- 1 - success, 2 - not finisehd but success, 0 - matrix singular, -1 - could not solve the les
+ * \return (int) -- 1 - success, 2 - not finished but success, 0 - matrix singular, -1 - could not solve the les
  * 
  * */
 int G_math_solver_cg_sband(double **A, double *x, double *b, int rows, int bandwidth, int maxit, double err)
@@ -357,8 +357,8 @@ int G_math_solver_cg_sband(double **A, double *x, double *b, int rows, int bandw
  * \param b (double *) -- the right hand side
  * \param rows (int)
  * \param maxit (int) -- the maximum number of iterations
- * \param err (double) -- defines the error break criterias
- * \return (int) -- 1 - success, 2 - not finisehd but success, 0 - matrix singular, -1 - could not solve the les
+ * \param err (double) -- defines the error break criteria
+ * \return (int) -- 1 - success, 2 - not finished but success, 0 - matrix singular, -1 - could not solve the les
  * 
  * */
 int G_math_solver_sparse_cg(G_math_spvector ** Asp, double *x, double *b,
@@ -528,8 +528,8 @@ int solver_cg(double **A, G_math_spvector ** Asp, double *x, double *b,
  * \param b (double *) -- the right hand side
  * \param rows (int)
  * \param maxit (int) -- the maximum number of iterations
- * \param err (double) -- defines the error break criterias
- * \return (int) -- 1 - success, 2 - not finisehd but success, 0 - matrix singular, -1 - could not solve the les
+ * \param err (double) -- defines the error break criteria
+ * \return (int) -- 1 - success, 2 - not finished but success, 0 - matrix singular, -1 - could not solve the les
  * 
  * */
 int G_math_solver_bicgstab(double **A, double *x, double *b, int rows,
@@ -555,8 +555,8 @@ int G_math_solver_bicgstab(double **A, double *x, double *b, int rows,
  * \param b (double *) -- the right hand side
  * \param rows (int)
  * \param maxit (int) -- the maximum number of iterations
- * \param err (double) -- defines the error break criterias
- * \return (int) -- 1 - success, 2 - not finisehd but success, 0 - matrix singular, -1 - could not solve the les
+ * \param err (double) -- defines the error break criteria
+ * \return (int) -- 1 - success, 2 - not finished but success, 0 - matrix singular, -1 - could not solve the les
  * 
  * */
 int G_math_solver_sparse_bicgstab(G_math_spvector ** Asp, double *x,

lib/gmath/test/test_blas1.c

@@ -90,7 +90,7 @@ int test_blas_level_1_double(void)
 	sum++;
     }
     
-    /*test the ATALS implemenation*/
+    /*test the ATLAS implementation*/
     a = G_math_dnrm2(x, rows);
     b = G_math_dasum(x, rows);
     c = G_math_ddot(x, y, rows);
@@ -266,7 +266,7 @@ int test_blas_level_1_float(void)
 	sum++;
     }
     
-    /*test the ATALS implemenation*/
+    /*test the ATLAS implementation*/
     a = G_math_snrm2(x, rows);
     b = G_math_sasum(x, rows);
     c = G_math_sdot(x, y, rows);

lib/gmath/test/test_tools_les.c

@@ -435,7 +435,7 @@ void G_math_free_les(G_math_les * les)
 		}
 		else
 		{
-			/*We dont know if the rows have been changed by pivoting, 
+			/*We don't know if the rows have been changed by pivoting, 
 			 * so we restore the data pointer*/
 			les->A[0] = les->data;
 			G_free_matrix(les->A);
@@ -467,7 +467,7 @@ void G_math_free_f_les(G_math_f_les * les)
 		if (les->b)
 			G_free(les->b);
 
-		/*We dont know if the rows have been changed by pivoting, 
+		/*We don't know if the rows have been changed by pivoting, 
 		 * so we restore the data pointer*/
 		les->A[0] = les->data;
 		G_free_fmatrix(les->A);

lib/gpde/gpdelib.dox

@@ -71,7 +71,7 @@ int main()
     N_gwflow_data2d *data = NULL; 	/* data structure with the groundwater data		*/
     N_geom_data *geom = NULL; 		/* geometry of the calculation area (region)		*/
     N_les *les = NULL; 		/* the linear equation system structure			*/
-    N_les_callback_2d *call = NULL;	/* the callback for the groundwater flow calulation	*/
+    N_les_callback_2d *call = NULL;	/* the callback for the groundwater flow calculation	*/
 
     /* allocate the callback structure */
     call = N_alloc_les_callback_2d();
@@ -358,7 +358,7 @@ N_data_star *#N_alloc_7star(void);
 <p>
 N_data_star *#N_alloc_9star(void);
 <p>
-Memory allocation with initialisation<br>
+Memory allocation with initialization<br>
 N_data_star *#N_create_5star(double C, double W, double E, double N, double S, double V);
 <p>
 N_data_star *#N_create_7star(double C, double W, double E, double N, double S, double T, double B, double V);
@@ -538,7 +538,7 @@ typedef struct
 } N_geom_data;
 \endverbatim
 
-Use the follwoing functions to handle the geometric data structures:
+Use the following functions to handle the geometric data structures:
 
 <p>
 Creating a N_geom_data structure<br>

lib/gpde/n_arrays.c

@@ -5,7 +5,7 @@
 * AUTHOR(S):    Soeren Gebbert, Berlin (GER) Dec 2006
 * 		soerengebbert <at> gmx <dot> de
 *
-* PURPOSE:     	Array managment functions
+* PURPOSE:     	Array management functions
 * 		part of the gpde library
 *
 * COPYRIGHT:    (C) 2000 by the GRASS Development Team
@@ -217,7 +217,7 @@ void N_get_array_2d_value(N_array_2d * data, int col, int row, void *value)
 }
 
 /*!
- * \brief Returns 1 if the value of N_array_2d struct at postion col, row
+ * \brief Returns 1 if the value of N_array_2d struct at position col, row
  * is of type null, otherwise 0
  *
  * This function checks automatically the type of the array and checks for the

lib/gpde/n_arrays_calc.c

@@ -5,7 +5,7 @@
 * AUTHOR(S):    Soeren Gebbert, Berlin (GER) Dec 2006
 * 		soerengebbert <at> gmx <dot> de
 *               
-* PURPOSE:     	Higher level array managment functions 
+* PURPOSE:     	Higher level array management functions 
 * 		part of the gpde library
 *
 * COPYRIGHT:    (C) 2000 by the GRASS Development Team
@@ -137,7 +137,7 @@ void N_copy_array_2d(N_array_2d * source, N_array_2d * target)
  * The norm can be of type N_MAXIMUM_NORM or N_EUKLID_NORM.
  * All arrays must have equal sizes and offsets.
  * The complete data array inclusively offsets is used for norm calucaltion.
- * Only non-null values are used to calcualte the norm.
+ * Only non-null values are used to calculate the norm.
  *
 
  * \param a N_array_2d *
@@ -369,7 +369,7 @@ N_array_2d *N_math_array_2d(N_array_2d * a, N_array_2d * b,
 	for (i = 0 - a->offset; i < a->cols + a->offset; i++) {
 	    if (!N_is_array_2d_value_null(a, i, j) &&
 		!N_is_array_2d_value_null(b, i, j)) {
-		/*we always calulate internally with double values */
+		/*we always calculate internally with double values */
 		va = (double)N_get_array_2d_d_value(a, i, j);
 		vb = (double)N_get_array_2d_d_value(b, i, j);
 		vc = 0;
@@ -566,7 +566,7 @@ void N_copy_array_3d(N_array_3d * source, N_array_3d * target)
  * The norm can be of type N_MAXIMUM_NORM or N_EUKLID_NORM.
  * All arrays must have equal sizes and offsets.
  * The complete data array inclusively offsets is used for norm calucaltion.
- * Only non-null values are used to calcualte the norm.
+ * Only non-null values are used to calculate the norm.
  *
  * \param a N_array_3d *
  * \param b N_array_3d *
@@ -794,7 +794,7 @@ N_array_3d *N_math_array_3d(N_array_3d * a, N_array_3d * b,
 	    for (i = 0 - a->offset; i < a->cols + a->offset; i++) {
 		if (!N_is_array_3d_value_null(a, i, j, k) &&
 		    !N_is_array_3d_value_null(a, i, j, k)) {
-		    /*we always calulate internally with double values */
+		    /*we always calculate internally with double values */
 		    va = (double)N_get_array_3d_d_value(a, i, j, k);
 		    vb = (double)N_get_array_3d_d_value(b, i, j, k);
 		    vc = 0;

lib/gpde/n_arrays_io.c

@@ -5,7 +5,7 @@
 * AUTHOR(S):    Soeren Gebbert, Berlin (GER) Dec 2006
 * 		soerengebbert <at> gmx <dot> de
 *               
-* PURPOSE:     	IO array managment functions 
+* PURPOSE:     	IO array management functions 
 * 		part of the gpde library
 *
 * COPYRIGHT:    (C) 2000 by the GRASS Development Team

lib/gpde/n_geom.c

@@ -6,7 +6,7 @@
 * 		soerengebbert <at> gmx <dot> de
 *               
 * PURPOSE:      part of the gpde library
-* 		allocation, destroing and initializing the geometric struct
+* 		allocation, destroying and initializing the geometric struct
 *
 * COPYRIGHT:    (C) 2000 by the GRASS Development Team
 *
@@ -137,7 +137,7 @@ N_geom_data *N_init_geom_data_2d(struct Cell_head * region,
 
 	meters = G_database_units_to_meters_factor();	/*this function is not thread safe */
 
-	/*set the dim to 2d if it was not initiated with 3, thats a bit ugly :( */
+	/*set the dim to 2d if it was not initiated with 3, that's a bit ugly :( */
 	if (geom->dim != 3)
 	    geom->dim = 2;
 

lib/gpde/n_les_assemble.c

@@ -767,7 +767,7 @@ N_les *N_assemble_les_2d_param(int les_type, N_geom_data * geom,
  *
  * The provided les will be modified:
  *
- * Ax = b will be splitted into Ax_u + Ax_d = b
+ * Ax = b will be split into Ax_u + Ax_d = b
  *
  * x_u - the unknowns
  * x_d - the Dirichlet cells
@@ -1220,7 +1220,7 @@ N_les *N_assemble_les_3d_param(int les_type, N_geom_data * geom,
  *
  * The provided les will be modified:
  *
- * Ax = b will be splitted into Ax_u + Ax_d = b
+ * Ax = b will be split into Ax_u + Ax_d = b
  *
  * x_u - the unknowns
  * x_d - the Dirichlet cells

lib/gpde/n_tools.c

@@ -5,7 +5,7 @@
 * AUTHOR(S):    Soeren Gebbert, Berlin (GER) Dec 2006
 * 		soerengebbert <at> gmx <dot> de
 *               
-* PURPOSE:     	Array managment functions 
+* PURPOSE:     	Array management functions 
 * 		part of the gpde library
 *
 * COPYRIGHT:    (C) 2000 by the GRASS Development Team

lib/htmldriver/README

@@ -65,7 +65,7 @@ that exists in a vector file will have the same HREF tag.
 
 	export GRASS_RENDER_HTMLMINBBOX
 	GRASS_RENDER_HTMLMINBBOX=xx
-	    specifies the minimum bounding box dimenions (both width and
+	    specifies the minimum bounding box dimensions (both width and
 	    height) in order to store a polygon.  The default is '2', which
 	    means any polygon having bounding box width or height extent
 	    of less than 2 pixels will not be output as a clickable area.  

lib/imagery/iclass_perimeter.c

@@ -265,10 +265,10 @@ int make_perimeter(struct line_pnts *points, IClass_perimeter * perimeter,
     }
 
     /*
-     * now decide which verticies should be included
+     * now decide which vertices should be included
      *    local extrema are excluded
      *    local non-extrema are included
-     *    verticies of horizontal edges which are pseudo-extrema
+     *    vertices of horizontal edges which are pseudo-extrema
      *      are excluded.
      *    one vertex of horizontal edges which are pseudo-non-extrema
      *      are included.
@@ -363,7 +363,7 @@ int edge2perimeter(IClass_perimeter * perimeter, int x0, int y0, int x1,
 /*!
    \brief Adds point to perimeter.
 
-   \a perimeter has to have allocated space for \c points memeber.
+   \a perimeter has to have allocated space for \c points member.
 
    \param perimeter perimeter
    \param x,y point row and cell

lib/imagery/iscatt_core.c

@@ -680,7 +680,7 @@ static void free_compute_scatts_data(int *fd_bands,
    \param cats_rasts_conds paths to category raster conditions files representing 
     	  selected areas from mapwindow (conditions) in rasters for every category 
    \param cats_rasts_conds index in array represents corresponding category id
-   \param cats_rasts_conds for manupulation with category raster conditions file 
+   \param cats_rasts_conds for manipulation with category raster conditions file 
                 see also I_id_scatt_to_bands and I_insert_patch_to_cat_rast
    \param bands names of analyzed bands, order of bands is defined by their id
    \param n_bands number of bands
@@ -852,7 +852,7 @@ int I_compute_scatts(struct Cell_head *region, struct scCats *scatt_conds,
    Implementd for speeding up of scatter plots rendering.
 
    \param merged_arr array which will be overlayd with overlay_arr
-   \param overlay_arr array to be merged_arr overlayed with
+   \param overlay_arr array to be merged_arr overlaid with
    \param rows number of rows for the both arrays
    \param cols number of columns for the both arrays
    \param alpha transparency (0-1) of the overlay array for merging

lib/imagery/iscatt_structs.c

@@ -112,7 +112,7 @@ void I_sc_init_cats(struct scCats *cats, int n_bands, int type)
 }
 
 /*!
-   \brief Free data of struct scCats, the structure itself remains alocated.
+   \brief Free data of struct scCats, the structure itself remains allocated.
 
    \param cats pointer to existing scCats struct
  */

lib/init/grass.py

@@ -675,7 +675,7 @@ def set_browser():
     browser = os.getenv('GRASS_HTML_BROWSER')
     if not browser:
         if macosx:
-            # OSX doesn't execute browsers from the shell PATH - route thru a
+            # OSX doesn't execute browsers from the shell PATH - route through a
             # script
             browser = gpath('etc', "html_browser_mac.sh")
             os.environ['GRASS_HTML_BROWSER_MACOSX'] = "-b com.apple.helpviewer"
@@ -695,7 +695,7 @@ def set_browser():
                     break
 
     elif macosx:
-        # OSX doesn't execute browsers from the shell PATH - route thru a
+        # OSX doesn't execute browsers from the shell PATH - route through a
         # script
         os.environ['GRASS_HTML_BROWSER_MACOSX'] = "-b %s" % browser
         browser = gpath('etc', "html_browser_mac.sh")
@@ -982,7 +982,7 @@ def gui_startup(grass_gui):
     if ret == 0:
         pass
     elif ret in [1, 2]:
-        # 1 probably error comming from gis_set.py
+        # 1 probably error coming from gis_set.py
         # 2 probably file not found from python interpreter
         # formerly we were starting in text mode instead, now we just fail
         # which is more straightforward for everybody
@@ -1229,10 +1229,10 @@ def lock_mapset(mapset_path, force_gislock_removal, user, grass_gui):
                           'user': user, 'file': lockfile}))
     elif ret != 0:
         msg = _("Unable to properly access '%s'.\n"
-                "Please notify system personel.") % lockfile
+                "Please notify system personnel.") % lockfile
 
     # TODO: the gui decision should be done by the caller
-    # this needs some change to the function interafce, return tupple or
+    # this needs some change to the function interface, return tuple or
     # use exceptions (better option)
     if msg:
         if grass_gui == "wxpython":
@@ -1527,7 +1527,7 @@ def bash_startup(location, location_name, grass_env_file):
         os.environ['HISTSIZE'] = "3000"
 
     # instead of changing $HOME, start bash with: --rcfile "$LOCATION/.bashrc" ?
-    #   if so, must care be taken to explicity call .grass.bashrc et al for
+    #   if so, must care be taken to explicitly call .grass.bashrc et al for
     #   non-interactive bash batch jobs?
     userhome = os.getenv('HOME')      # save original home
     home = location                   # save .bashrc in $LOCATION

lib/init/run.c

@@ -1,6 +1,6 @@
 
 /****************************************************************
-this program runs its arguments as  a  commmand.  it  essentially
+this program runs its arguments as  a  command.  it  essentially
 does what the sh would do to look for the command. if / occurs in
 the command it runs it  as  is,  otherwise  it  search  the  PATH
 variable.  care  is  taken  to preserve the PATH variable that is

lib/iostream/mm.cpp

@@ -442,7 +442,7 @@ void operator delete[] (void *ptr) noexcept {
   MM_DEBUG cout << "delete[]: ptr=" << ptr << ","; 
 
   if (!ptr) {
-    //can this hapen? -- it does: see delete above
+    //can this happen? -- it does: see delete above
     cerr << "MM warning: operator delete [] was given a NULL pointer\n";
     cerr.flush();
     //assert(0);
@@ -486,7 +486,7 @@ MM_mode MM_register::register_new = MM_IGNORE_MEMORY_EXCEEDED;
 
 
 /* ************************************************************ */
-// The counter of mm_register_init instances.  It is implicity set to 0.
+// The counter of mm_register_init instances.  It is implicitly set to 0.
 unsigned int mm_register_init::count;
 
 // The constructor and destructor that ensure that the memory manager is

lib/lidar/zones.c

@@ -47,7 +47,7 @@ void P_zero_dim(struct Reg_dimens *dim)
  Interpolated points in Overlap are taken as they are
 
  The buffer zones Elaboration - General and General - Overlap must be
- large enough to avoid artefacts 
+ large enough to avoid artifacts 
  */
 
 int
@@ -189,13 +189,13 @@ int P_get_edge(int interpolator, struct Reg_dimens *dim, double pe, double pn)
     /* Set the edge regions dimension
      * Returns 1 on success of bilinear; 2 on success of bicubic, 0 on failure */
     if (interpolator == P_BILINEAR) {
-       	/* in case of edge artefacts, increase as multiples of 3 */
+       	/* in case of edge artifacts, increase as multiples of 3 */
 	dim->edge_v = 9 * pe;
 	dim->edge_h = 9 * pn;
 	return 1;
     }
     else if (interpolator == P_BICUBIC) {
-       	/* in case of edge artefacts, increase as multiples of 4 */
+       	/* in case of edge artifacts, increase as multiples of 4 */
 	dim->edge_v = 12 * pe;	/*3 */
 	dim->edge_h = 12 * pn;
 	return 2;

lib/linkm/README

@@ -14,7 +14,7 @@ Assumption:  malloc/free is inefficient and wasteful for things like
 Workaround:  I found myself frequently writing a program specific memory
 	     manager to allocate large chunks which were then parcelled out.
 
-Solution:   Develop a generic linked list memory manger which does all the
+Solution:   Develop a generic linked list memory manager which does all the
 	    work for you.   
 	    
 	    

lib/nviz/change_view.c

@@ -24,7 +24,7 @@
    \param height window height
 
    \return 1 on success
-   \return 0 on failure (window resized by dafault to 20x20 px)
+   \return 0 on failure (window resized by default to 20x20 px)
  */
 int Nviz_resize_window(int width, int height)
 {

lib/nviz/map_obj.c

@@ -48,7 +48,7 @@ int Nviz_new_map_obj(int type, const char *name, double value, nv_data * data)
 
     /*
      * For each type of map obj do the following --
-     *   1) Verify we havn't maxed out the number of
+     *   1) Verify we haven't maxed out the number of
      *      allowed objects.
      *   2) Call the internal library to generate a new
      *      map object of the specified type.

lib/proj/get_proj.c

@@ -52,7 +52,7 @@ static int nopt1;
  *          2 if "default" 3-parameter datum shift values from datum.table
  *            were used
  *          3 if an unrecognised datum name was passed on to PROJ.4 (and
- *            initialisation was successful
+ *            initialization was successful
  *          1 otherwise
  **/
 

lib/python/ctypes/ctypesgencore/ctypedescs.py

@@ -105,7 +105,7 @@ def visit_type_and_collect_info(ctype):
     ctype.visit(v)
     return structs, enums, typedefs, errors, identifiers
 
-# Remove one level of indirection from funtion pointer; needed for typedefs
+# Remove one level of indirection from function pointer; needed for typedefs
 # and function parameters.
 
 

lib/python/ctypes/ctypesgencore/expressions.py

@@ -254,7 +254,7 @@ class AttributeExpressionNode(ExpressionNode):
         ExpressionNode.visit(self, visitor)
 
     def evaluate(self, context):
-        return self.op(self.base.evalute(context), self.attribute)
+        return self.op(self.base.evaluate(context), self.attribute)
 
     def py_string(self, can_be_ctype):
         if can_be_ctype:

lib/python/ctypes/ctypesgencore/parser/cparser.py

@@ -138,7 +138,7 @@ class CParser(object):
     def handle_pp_error(self, message):
         '''The C preprocessor emitted an error.
 
-        The default implementatin prints the error to stderr. If processing
+        The default implementation prints the error to stderr. If processing
         can continue, it will.
         '''
         print('Preprocessor:', message, file=sys.stderr)

lib/python/ctypes/ctypesgencore/parser/yacc.py

@@ -25,7 +25,7 @@
 #
 #
 # This implements an LR parser that is constructed from grammar rules defined
-# as Python functions. The grammer is specified by supplying the BNF inside
+# as Python functions. The grammar is specified by supplying the BNF inside
 # Python documentation strings.  The inspiration for this technique was borrowed
 # from John Aycock's Spark parsing system.  PLY might be viewed as cross between
 # Spark and the GNU bison utility.

lib/python/ctypes/ctypesgencore/processor/pipeline.py

@@ -104,7 +104,7 @@ def calculate_final_inclusion(data, opts):
 def print_errors_encountered(data, opts):
     # See descriptions.py for an explanation of the error-handling mechanism
     for desc in data.all:
-        # If description would not have been included, dont bother user by
+        # If description would not have been included, don't bother user by
         # printing warnings.
         if desc.included or opts.show_all_errors:
             if opts.show_long_errors or len(desc.errors) + len(desc.warnings) <= 2:

lib/python/docs/src/gunittest_testing.rst

@@ -604,7 +604,7 @@ Location specific tests
     NC in SPF, NC in LL, NC in XY, and perhaps NC in UTM, and NC in some
     custom projection (in case of strange not-fitting projection, there is
     a danger that the results of analyses can differer significantly).
-    Moreover, the set can be extened by GRASS locations which are using
+    Moreover, the set can be extended by GRASS locations which are using
     different storage backends, e.g. PostGIS for vectors and PostgreSQL for
     temporal database. Tests can specify one or preferably more of these
     standard locations.

lib/python/docs/src/pygrass_raster.rst

@@ -177,17 +177,17 @@ methods to read a map:
     * ``get_row`` calls the C function ``Segment_get_row`` and returns a buffer
       object with the row. ::
 
-        >>> # call explicity the method
+        >>> # call explicitly the method
         >>> elev_row0 = elev.get_row(0)
-        >>> # call implicity the method
+        >>> # call implicitly the method
         >>> elev_row0 = elev[0]
 
     * ``get`` calls the C function ``Segment_get`` and returns the value of the
       map cell. ::
 
-        >>> # call explicity the method
+        >>> # call explicitly the method
         >>> elev_val_0_0 = elev.get(0, 0)
-        >>> # call implicity the method
+        >>> # call implicitly the method
         >>> elev_val_0_0 = elev[0, 0]
 
 Similarly, writing to a map uses two methods: ``put_row`` to write a row and

lib/python/gunittest/case.py

@@ -113,7 +113,7 @@ class TestCase(unittest.TestCase):
         ``g.region save=``, then sets ``WIND_OVERRIDE`` to refer
         to that region.
         """
-        # we use just the class name since we rely on the invokation system
+        # we use just the class name since we rely on the invocation system
         # where each test file is separate process and nothing runs
         # in parallel inside
         name = "tmp.%s" % (cls.__name__)
@@ -136,7 +136,7 @@ class TestCase(unittest.TestCase):
                                " or temporary region in general\n"
                                "Region to which should be now deleted ({n})"
                                " by TestCase class"
-                               "does not corresond to currently set"
+                               "does not correspond to currently set"
                                " WIND_OVERRIDE ({c})",
                                n=cls._temp_region, c=name)
         call_module("g.remove", quiet=True, flags='f', type='region', name=name)
@@ -158,7 +158,7 @@ class TestCase(unittest.TestCase):
         package which preserves the original newline characters.
 
         This function removes the burden of getting the newline characters
-        right on each platfrom. You can just use ``\n`` everywhere and this
+        right on each platform. You can just use ``\n`` everywhere and this
         function will ensure that it does not matter if for example,
         a module generates (as expected) ``\r\n`` (CRLF) newline characters
         on MS Windows.
@@ -176,7 +176,7 @@ class TestCase(unittest.TestCase):
             first=first, second=second, msg=msg)
 
     def assertLooksLike(self, actual, reference, msg=None):
-        r"""Test that ``actual`` text is the same as ``referece`` with ellipses.
+        r"""Test that ``actual`` text is the same as ``reference`` with ellipses.
 
         If ``actual`` contains platform dependent newline characters,
         these will replaced by ``\n`` which is expected to be in the test data.
@@ -599,7 +599,7 @@ class TestCase(unittest.TestCase):
 
             md5sum some_file.png
 
-        Finaly, you can use Python ``hashlib`` to obtain MD5::
+        Finally, you can use Python ``hashlib`` to obtain MD5::
 
             import hashlib
             hasher = hashlib.md5()
@@ -723,7 +723,7 @@ class TestCase(unittest.TestCase):
 
         :returns: name of a new vector
         """
-        # hash is the easiest way how to get a valied vector name
+        # hash is the easiest way how to get a valid vector name
         # TODO: introduce some function which will make file valid
         hasher = hashlib.md5()
         hasher.update(filename)
@@ -770,7 +770,7 @@ class TestCase(unittest.TestCase):
                 call_module('g.remove', flags='f', type='raster', name=diff)
         else:
             # general case
-            # TODO: we are using r.info min max and r.univar min max interchangably
+            # TODO: we are using r.info min max and r.univar min max interchangeably
             # but they might be different if region is different from map
             # not considered as an huge issue since we expect the tested maps
             # to match with region, however a documentation should containe a notice
@@ -817,7 +817,7 @@ class TestCase(unittest.TestCase):
                 call_module('g.remove', flags='f', type='raster_3d', name=diff)
         else:
             # general case
-            # TODO: we are using r.info min max and r.univar min max interchangably
+            # TODO: we are using r.info min max and r.univar min max interchangeably
             # but they might be different if region is different from map
             # not considered as an huge issue since we expect the tested maps
             # to match with region, however a documentation should contain a notice

lib/python/gunittest/checkers.py

@@ -21,7 +21,7 @@ except (ImportError, AttributeError):
     # interface, should be replaced by central keyvalue module
     # this can happen when translations are not available
     # TODO: grass should survive are give better error when tranlsations are not available
-    # even the lazy loading after firts _ call would be interesting
+    # even the lazy loading after first _ call would be interesting
     # File "...grass/script/core.py", line 40, in <module>
     # AttributeError: 'NoneType' object has no attribute 'endswith'
     KeyValue = dict
@@ -317,7 +317,7 @@ def keyvalue_equals(dict_a, dict_b, precision,
     :param dict key_equal: dictionary of functions used for comparison
         of specific keys, `def_equal` is used for the rest,
         keys in dictionary are keys in `dict_a` and `dict_b` dictionaries,
-        values are the fuctions used to comapare the given key
+        values are the functions used to comapare the given key
     :param a_is_subset: `True` if `dict_a` is a subset of `dict_b`,
         `False` otherwise
 
@@ -429,7 +429,7 @@ def proj_info_equals(text_a, text_b):
 def proj_units_equals(text_a, text_b):
     """Test if two PROJ_UNITS texts are equal."""
     def lowercase_equals(string_a, string_b, precision=None):
-        # we don't need a waring for unused precision
+        # we don't need a warning for unused precision
         # pylint: disable=W0613
         """Test equality of two strings ignoring their case using ``lower()``.
 

lib/python/gunittest/gmodules.py

@@ -97,7 +97,7 @@ def call_module(module, stdin=None,
     """
     # TODO: remove this:
     do_doctest_gettext_workaround()
-    # implemenation inspired by subprocess.check_output() function
+    # implementation inspired by subprocess.check_output() function
     if stdin:
         if 'input' in kwargs and kwargs['input'] != '-':
             raise ValueError(_("input='-' must be used when stdin is specified"))

lib/python/gunittest/loader.py

@@ -134,7 +134,7 @@ def discover_modules(start_dir, skip_dirs, testsuite_dir,
                     modules.append(GrassTestPythonModule(
                         name=name, module=None, tested_dir=root, file_dir=full,
                         abs_file_path=abs_file_path, file_type=file_type))
-                # in else with some verbose we could tell about skiped test
+                # in else with some verbose we could tell about skipped test
     return modules
 
 

lib/python/gunittest/multireport.py

@@ -278,7 +278,7 @@ def info_plot(x, xticks, xlabels, results, filename, style):
     fig.savefig(filename)
 
 
-# TODO: solve the directory inconsitencies, implemement None
+# TODO: solve the directory inconsitencies, implement None
 def main_page(results, filename, images, captions, title='Test reports',
               directory=None):
     filename = os.path.join(directory, filename)

lib/python/gunittest/multirunner.py

@@ -53,7 +53,7 @@ def main():
 
     main_report = args.main_report
     grasssrc = args.grasssrc  # TODO: can be guessed from dist    
-    # TODO: create directory accoring to date and revision and create reports there
+    # TODO: create directory according to date and revision and create reports there
 
     # some predefined variables, name of the GRASS launch script + location/mapset
     #grass7bin = 'C:\Program Files (x86)\GRASS GIS 7.2.svn\grass73svn.bat'

lib/python/gunittest/reporters.py

@@ -52,7 +52,7 @@ def keyvalue_to_text(keyvalue, sep='=', vsep='\n', isep=',',
 def replace_in_file(file_path, pattern, repl):
     """
 
-    :param repl: a repl paramter of ``re.sub()`` function
+    :param repl: a repl parameter of ``re.sub()`` function
     """
     # using tmp file to store the replaced content
     tmp_file_path = file_path + '.tmp'
@@ -392,7 +392,7 @@ class GrassTestFilesCountingReporter(object):
             self.file_pass_per = 100 * float(self.files_pass) / self.test_files
             self.file_fail_per = 100 * float(self.files_fail) / self.test_files
         else:
-            # if no tests were executed, probably something bad happend
+            # if no tests were executed, probably something bad happened
             # try to report at least something
             self.file_pass_per = None
             self.file_fail_per = None
@@ -625,7 +625,7 @@ class GrassTestFilesHtmlReporter(GrassTestFilesCountingReporter):
         super(GrassTestFilesHtmlReporter, self).end_file_test(
             module=module, cwd=cwd, returncode=returncode,
             stdout=stdout, stderr=stderr)
-        # considering others accoring to total is OK when we more or less
+        # considering others according to total is OK when we more or less
         # know that input data make sense (total >= errors + failures)
         total = test_summary.get('total', None)
         failures = test_summary.get('failures', 0)
@@ -742,7 +742,7 @@ class GrassTestFilesHtmlReporter(GrassTestFilesCountingReporter):
             # will do it for use
             # the solution is perhaps do the multi reporter more grass-specific
             # and do all common things, so that other can rely on it and
-            # moreover something can be shared with other explicity
+            # moreover something can be shared with other explicitly
             # using constructors as seems advantageous for counting
             self._file_anonymizer.anonymize(supplementary_files)
             for f in supplementary_files:
@@ -759,7 +759,7 @@ class GrassTestFilesHtmlReporter(GrassTestFilesCountingReporter):
 
         if returncode:
             pass
-            # TODO: here we don't have oportunity to write error file
+            # TODO: here we don't have opportunity to write error file
             # to stream (stdout/stderr)
             # a stream can be added and if not none, we could write
 
@@ -854,7 +854,7 @@ class GrassTestFilesKeyValueReporter(GrassTestFilesCountingReporter):
         super(GrassTestFilesKeyValueReporter, self).end_file_test(
             module=module, cwd=cwd, returncode=returncode,
             stdout=stdout, stderr=stderr)
-        # TODO: considering others accoring to total, OK?
+        # TODO: considering others according to total, OK?
         # here we are using 0 for total but HTML reporter is using None
         total = test_summary.get('total', 0)
         failures = test_summary.get('failures', 0)
@@ -992,7 +992,7 @@ class TestsuiteDirReporter(object):
     def report_for_dir(self, root, directory, test_files):
         # TODO: create object from this, so that it can be passed from
         # one function to another
-        # TODO: put the inside of for loop to another fucntion
+        # TODO: put the inside of for loop to another function
         dir_failures = 0
         dir_errors = 0
         dir_skipped = 0
@@ -1133,7 +1133,7 @@ class TestsuiteDirReporter(object):
         return row
 
     def report_for_dirs(self, root, directories):
-        # TODO: this will need chanages accoring to potential chnages in absolute/relative paths
+        # TODO: this will need chanages according to potential changes in absolute/relative paths
 
         page_name = os.path.join(root, self.main_page_name)
         page = open(page_name, 'w')

lib/python/gunittest/testsuite/test_assertions.py

@@ -46,7 +46,7 @@ class TestTextAssertions(TestCase):
                              "abc = 689...")
         self.assertLooksLike("abc = 689.159589",
                              "abc = 689.15...")
-        # this should fail accoring to the implementation
+        # this should fail according to the implementation
         # first three dots are considered as ellipses
         self.assertRaises(self.failureException,
                           self.assertLooksLike,

lib/python/gunittest/testsuite/test_checkers.py

@@ -112,7 +112,7 @@ no_defs: defined
 """
 
 PROJ_UNITS_TEXT_2 = """unit: Metre
-units: Metres
+units: Meters
 meters: 1
 """
 # what about keys and lower/upper case letters

lib/python/gunittest/testsuite/test_doctests.py

@@ -17,7 +17,7 @@ import grass.gunittest.checkers
 # and test suite, so we need to create a new type which inherits from our class
 # and contains doctest's methods
 # the alternative is to copy 500 from doctest and change what is needed
-# (this might be necessary anyway beacuse of the reports and stdout and stderr)
+# (this might be necessary anyway because of the reports and stdout and stderr)
 doctest.DocFileCase = type('DocFileCase',
                            (grass.gunittest.case.TestCase,),
                            dict(doctest.DocFileCase.__dict__))

lib/python/imaging/images2avi.py

@@ -32,7 +32,7 @@
 
 Uses ffmpeg to read and write AVI files. Requires PIL
 
-I found these sites usefull:
+I found these sites useful:
 http://www.catswhocode.com/blog/19-ffmpeg-commands-for-all-needs
 http://linux.die.net/man/1/ffmpeg
 

lib/python/imaging/images2gif.py

@@ -56,7 +56,7 @@ This code is based on gifmaker (in the scripts folder of the source
 distribution of PIL)
 
 
-Usefull links:
+Useful links:
 
   * http://tronche.com/computer-graphics/gif/
   * http://en.wikipedia.org/wiki/Graphics_Interchange_Format
@@ -145,7 +145,7 @@ def checkImages(images):
 
 def intToBin(i):
     """Integer to two bytes"""
-    # devide in two parts (bytes)
+    # divide in two parts (bytes)
     i1 = i % 256
     i2 = int(i / 256)
     # make string (little endian)
@@ -197,7 +197,7 @@ class GifWriter:
         # reserved00, lct size111=7=2^(7 + 1)=256.
         bb += '\x87'
 
-        # LZW min size code now comes later, begining of [image data] blocks
+        # LZW min size code now comes later, beginning of [image data] blocks
         return bb
 
     def getAppExt(self, loops=float('inf')):
@@ -223,7 +223,7 @@ class GifWriter:
 
     def getGraphicsControlExt(self, duration=0.1, dispose=2):
         """Graphics Control Extension. A sort of header at the start of
-        each image. Specifies duration and transparancy.
+        each image. Specifies duration and transparency.
 
         Dispose:
 
@@ -245,7 +245,7 @@ class GifWriter:
         # 2nd bit 1 == user input , next 3 bits, the low two of which are used,
         # are dispose.
         bb += intToBin(int(duration * 100))  # in 100th of seconds
-        bb += '\x00'  # no transparant color
+        bb += '\x00'  # no transparent color
         bb += '\x00'  # end
         return bb
 
@@ -406,7 +406,7 @@ class GifWriter:
 
         """
 
-        # Obtain palette for all images and count each occurance
+        # Obtain palette for all images and count each occurrence
         palettes, occur = [], []
         for im in images:
             if not pillow:
@@ -1013,7 +1013,7 @@ class NeuQuant:
         return Image.fromarray(px).convert("RGB").quantize(palette=self.paletteImage())
 
     def quantize_without_scipy(self, image):
-        """" This function can be used if no scipy is availabe.
+        """" This function can be used if no scipy is available.
         It's 7 times slower though.
 
         :param image:

lib/python/imaging/images2swf.py

@@ -33,8 +33,8 @@ arrays in an SWF movie, that can be played on a wide range of OS's.
 This module came into being because I wanted to store a series of images
 in a movie that can be viewed by other people, and which I can embed in
 flash presentations. For writing AVI or MPEG you really need a c/c++
-library, and allthough the filesize is then very small, the quality is
-sometimes not adequate. Besides I'd like to be independant of yet another
+library, and although the filesize is then very small, the quality is
+sometimes not adequate. Besides I'd like to be independent of yet another
 package. I tried writing animated gif using PIL (which is widely available),
 but the quality is so poor because it only allows for 256 different colors.
 [EDIT: thanks to Ant1, now the quality of animated gif isn't so bad!]
@@ -247,7 +247,7 @@ else:
 
     def intToUint16(i):
         i = int(i)
-        # devide in two parts (bytes)
+        # divide in two parts (bytes)
         i1 = i % 256
         i2 = int(i // 256)
         # make string (little endian)
@@ -546,7 +546,7 @@ class DoActionTag(Tag):
             elif action == 'play':
                 bb += '\x06'.encode('ascii')
             else:
-                print("warning, unkown action: %s" % action)
+                print("warning, unknown action: %s" % action)
 
         bb += intToUint8(0)
         self.bytes = bb

lib/python/pydispatch/dispatcher.py

@@ -377,7 +377,7 @@ def _removeReceiver(receiver):
     """Remove receiver from connections."""
     if not sendersBack or not connections:
         # During module cleanup the objects will be replaced with None
-           # The order of replacing many chnage, so both variables need
+           # The order of replacing many change, so both variables need
            # to be checked.
         return False
     backKey = id(receiver)

lib/python/pydispatch/robustapply.py

@@ -35,7 +35,7 @@ def function(receiver):
         # an instance-method...
         return receiver, getattr(getattr(receiver, im_func), func_code), 1
     elif not hasattr(receiver, func_code):
-        raise ValueError('unknown reciever type %s %s' % (receiver,
+        raise ValueError('unknown receiver type %s %s' % (receiver,
                                                           type(receiver)))
     return receiver, getattr(receiver, func_code), 0
 

lib/python/pydispatch/signal.py

@@ -129,7 +129,7 @@ class Signal(object):
 
         Usually, it is not needed to set the weak parameter. This method
         creates weak references for all handlers but for lambda functions, it
-        automaticaly creates (standard) references (otherwise, lambdas would be
+        automatically creates (standard) references (otherwise, lambdas would be
         garbage collected. If you want to force some behaviour, specify the
         weak parameter.
 
@@ -205,11 +205,11 @@ class Signal(object):
 
         Calling a signal from outside the class is usually not good
         practice. The only case when it is permitted is when signal is the part
-        of some globaly shared object and permision to emit is stayed in the
+        of some globaly shared object and permission to emit is stayed in the
         documentation.
 
         The parameters of the emit function must be the same as the parameters
-        of the handlers. However, handler can ommit some parameters.
+        of the handlers. However, handler can omit some parameters.
         The associated parameters shall be documented for each Signal instance.
         Use only keyword arguments when emitting.
 
@@ -233,7 +233,7 @@ class Signal(object):
         """Allows emitting signal with function call syntax.
 
         It allows handling signal as a function or other callable object.
-        So, the signal can be in the list of fuctions or can be connected as
+        So, the signal can be in the list of functions or can be connected as
         a handler for another signal.
         However, it is strongly recommended to use emit method for direct
         signal emitting.

lib/python/pygrass/gis/testsuite/test_doctests.py

@@ -17,7 +17,7 @@ from grass.pygrass.gis import region
 # and test suite, so we need to create a new type which inherits from our class
 # and contains doctest's methods
 # the alternative is to copy 500 from doctest and change what is needed
-# (this might be necessary anyway beacuse of the reports and stdout and stderr)
+# (this might be necessary anyway because of the reports and stdout and stderr)
 doctest.DocFileCase = type('DocFileCase',
                            (grass.gunittest.case.TestCase,),
                            dict(doctest.DocFileCase.__dict__))