[grass] 04/09: Drop spelling-errors2.patch, applied upstream.
Bas Couwenberg
sebastic at debian.org
Mon Sep 19 09:34:15 UTC 2016
This is an automated email from the git hooks/post-receive script.
sebastic pushed a commit to branch master
in repository grass.
commit c1fec17c2938089f88e2ad986e8771d3820b4554
Author: Bas Couwenberg <sebastic at xs4all.nl>
Date: Mon Sep 19 09:35:58 2016 +0200
Drop spelling-errors2.patch, applied upstream.
---
debian/changelog | 1 +
debian/patches/series | 1 -
debian/patches/spelling-errors2.patch | 91 -----------------------------------
3 files changed, 1 insertion(+), 92 deletions(-)
diff --git a/debian/changelog b/debian/changelog
index 8dee56c..c477f35 100644
--- a/debian/changelog
+++ b/debian/changelog
@@ -3,6 +3,7 @@ grass (7.0.5~rc2-1) UNRELEASED; urgency=medium
* New upstream release candidate.
* Drop libmysqlclient-dev dependency, default-libmysqlclient-dev should be
used instead, but its dependencies cannot be satisfied on mips64el.
+ * Drop spelling-errors2.patch, applied upstream.
-- Bas Couwenberg <sebastic at debian.org> Mon, 19 Sep 2016 09:31:05 +0200
diff --git a/debian/patches/series b/debian/patches/series
index 301023b..70fc821 100644
--- a/debian/patches/series
+++ b/debian/patches/series
@@ -3,4 +3,3 @@ instdir
no-fail-html.patch
appstream.patch
spelling-errors.patch
-spelling-errors2.patch
diff --git a/debian/patches/spelling-errors2.patch b/debian/patches/spelling-errors2.patch
deleted file mode 100644
index a28468d..0000000
--- a/debian/patches/spelling-errors2.patch
+++ /dev/null
@@ -1,91 +0,0 @@
-Description: Fix spelling errors.
- directoy -> directory
- maximimum -> maximum
- ommited -> omitted
- whith -> with
- contraints -> constraints
- allow to create -> allow creation
-Author: Bas Couwenberg <sebastic at debian.org>
-Forwarded: https://trac.osgeo.org/grass/ticket/3138
-
---- a/temporal/t.rast.out.vtk/t.rast.out.vtk.html
-+++ b/temporal/t.rast.out.vtk/t.rast.out.vtk.html
-@@ -10,7 +10,7 @@ ParaView. The VTK legacy files are creat
- 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>.
-
-
---- a/vector/v.net.flow/v.net.flow.html
-+++ b/vector/v.net.flow/v.net.flow.html
-@@ -5,10 +5,10 @@ between two sets of nodes.
-
- <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
---- a/lib/raster/get_row.c
-+++ b/lib/raster/get_row.c
-@@ -426,7 +426,7 @@ static void gdal_values_double(int fd, c
- 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)
---- a/raster/r.out.gdal/main.c
-+++ b/raster/r.out.gdal/main.c
-@@ -254,7 +254,7 @@ int main(int argc, char *argv[])
- 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);
- }
---- a/vector/v.net.visibility/v.net.visibility.html
-+++ b/vector/v.net.visibility/v.net.visibility.html
-@@ -21,7 +21,7 @@ or <em><a href="d.path.html">d.path</a><
- 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>
---- a/vector/v.random/v.random.html
-+++ b/vector/v.random/v.random.html
-@@ -158,7 +158,7 @@ Random points only sampled in forested a
- </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:
---- a/vector/v.buffer/v.buffer.html
-+++ b/vector/v.buffer/v.buffer.html
-@@ -133,7 +133,7 @@ v.buffer input=lakes output=lakes_buffer
- <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>
-
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-grass/grass.git
More information about the Pkg-grass-devel
mailing list