[GRASS-SVN] r69300 - in grass/trunk: lib/raster raster/r.out.gdal temporal/t.rast.out.vtk vector/v.buffer vector/v.net.flow vector/v.net.visibility vector/v.random

[svn_grass at osgeo.org]

Author: neteler
Date: 2016-08-30 06:28:34 -0700 (Tue, 30 Aug 2016)
New Revision: 69300

Modified:
   grass/trunk/lib/raster/get_row.c
   grass/trunk/raster/r.out.gdal/main.c
   grass/trunk/temporal/t.rast.out.vtk/t.rast.out.vtk.html
   grass/trunk/vector/v.buffer/v.buffer.html
   grass/trunk/vector/v.net.flow/v.net.flow.html
   grass/trunk/vector/v.net.visibility/v.net.visibility.html
   grass/trunk/vector/v.random/v.random.html
Log:
fix various spelling errors (fixes trac #3138, contributed by Sebastiaan Couwenberg)

Modified: grass/trunk/lib/raster/get_row.c
===================================================================
--- grass/trunk/lib/raster/get_row.c	2016-08-30 12:59:20 UTC (rev 69299)
+++ grass/trunk/lib/raster/get_row.c	2016-08-30 13:28:34 UTC (rev 69300)
@@ -436,7 +436,7 @@
    finally the values in work_buf are converted into 
    type Y and put into 'cell'.
    if type X == type Y the intermediate step of storing the values in 
-   work_buf might be ommited. check the appropriate function for XY to
+   work_buf might be omitted. check the appropriate function for XY to
    determine the procedure of conversion. 
  */
 static void transfer_to_cell_XX(int fd, void *cell)

Modified: grass/trunk/raster/r.out.gdal/main.c
===================================================================
--- grass/trunk/raster/r.out.gdal/main.c	2016-08-30 12:59:20 UTC (rev 69299)
+++ grass/trunk/raster/r.out.gdal/main.c	2016-08-30 13:28:34 UTC (rev 69300)
@@ -254,7 +254,7 @@
     mapset = G_find_raster2(input->answer, "");
 
     if (mapset != NULL) {
-	/* Add input to "group". "Group" whith 1 raster (band) will exist only in memory. */
+	/* Add input to "group". "Group" with 1 raster (band) will exist only in memory. */
 	I_init_group_ref(&ref);
 	I_add_file_to_group_ref(input->answer, mapset, &ref);
     }

Modified: grass/trunk/temporal/t.rast.out.vtk/t.rast.out.vtk.html
===================================================================
--- grass/trunk/temporal/t.rast.out.vtk/t.rast.out.vtk.html	2016-08-30 12:59:20 UTC (rev 69299)
+++ grass/trunk/temporal/t.rast.out.vtk/t.rast.out.vtk.html	2016-08-30 13:28:34 UTC (rev 69300)
@@ -10,7 +10,7 @@
 In this simple example we create several raster maps with random values 
 and one elevation map. The random value raster maps are registered in a 
 space time raster dataset. All maps of this space time raster dataset 
-are exported using <b>t.rast.out.vtk</b> into the directoy 
+are exported using <b>t.rast.out.vtk</b> into the directory 
 <b>/tmp/test1</b>.
 
 

Modified: grass/trunk/vector/v.buffer/v.buffer.html
===================================================================
--- grass/trunk/vector/v.buffer/v.buffer.html	2016-08-30 12:59:20 UTC (rev 69299)
+++ grass/trunk/vector/v.buffer/v.buffer.html	2016-08-30 13:28:34 UTC (rev 69300)
@@ -133,7 +133,7 @@
 <img src="v_buffer_areas_int.png" border="1"><br>
 Internal buffer of 50m inside the "lakes" polygons (map subset, original areas
 shown in black) <br>
-Not all features are buffered, only the polygons that allow to create inside
+Not all features are buffered, only the polygons that allow creation inside
 a topological cleaned polygon.
 </center>
 

Modified: grass/trunk/vector/v.net.flow/v.net.flow.html
===================================================================
--- grass/trunk/vector/v.net.flow/v.net.flow.html	2016-08-30 12:59:20 UTC (rev 69299)
+++ grass/trunk/vector/v.net.flow/v.net.flow.html	2016-08-30 13:28:34 UTC (rev 69300)
@@ -5,10 +5,10 @@
 
 <h2>NOTES</h2>
 The two sets of nodes are called <em>sources</em> and <em>sink</em> 
-and <em>v.net.flow</em> finds the maximimum flow from the former to 
+and <em>v.net.flow</em> finds the maximum flow from the former to 
 the latter ones. Edge capacities can be specified by <b>arc_column</b> 
 for forward direction and <b>arc_backward_column</b> for backward direction. If 
-the latter parameter is ommited then the same capacity is used in 
+the latter parameter is omitted then the same capacity is used in 
 either direction. The sets are given by the respective <b>cats</b>, 
 <b>layer</b> and <b>where</b> parameters. Maximum flow corresponds 
 to the maximum amount of water possibly flowing through the network 

Modified: grass/trunk/vector/v.net.visibility/v.net.visibility.html
===================================================================
--- grass/trunk/vector/v.net.visibility/v.net.visibility.html	2016-08-30 12:59:20 UTC (rev 69299)
+++ grass/trunk/vector/v.net.visibility/v.net.visibility.html	2016-08-30 13:28:34 UTC (rev 69300)
@@ -21,7 +21,7 @@
 If you compute a shortest path after computing the visibility graph
 you will notice that this path might go through a vertex of a line. If
 this is not what you wanted you might need to process the map
-in <em><a href="v.buffer.html">v.buffer</a></em>, initially whith a
+in <em><a href="v.buffer.html">v.buffer</a></em>, initially with a
 small value. Example:
 
 <div class="code"><pre>

Modified: grass/trunk/vector/v.random/v.random.html
===================================================================
--- grass/trunk/vector/v.random/v.random.html	2016-08-30 12:59:20 UTC (rev 69299)
+++ grass/trunk/vector/v.random/v.random.html	2016-08-30 13:28:34 UTC (rev 69300)
@@ -158,7 +158,7 @@
 </center>
 
 
-<h3>Stratified random sampling: Random sampling from vector map with spatial contraints</h3>
+<h3>Stratified random sampling: Random sampling from vector map with spatial constraints</h3>
 
 Generating n points for each individual area: in this example two random
 points in each water body: