[sfcgal] 05/06: Drop spelling-errors.patch, applied upstream.

[Bas Couwenberg]

This is an automated email from the git hooks/post-receive script.

sebastic pushed a commit to branch master
in repository sfcgal.

commit 1294ff06bf798e4269e54ba4a34e69476792fd37
Author: Bas Couwenberg <sebastic at xs4all.nl>
Date:   Fri Sep 15 20:50:49 2017 +0200

    Drop spelling-errors.patch, applied upstream.
---
 debian/changelog                     |  1 +
 debian/patches/series                |  1 -
 debian/patches/spelling-errors.patch | 39 ------------------------------------
 3 files changed, 1 insertion(+), 40 deletions(-)

diff --git a/debian/changelog b/debian/changelog
index 1023df8..c27492e 100644
--- a/debian/changelog
+++ b/debian/changelog
@@ -1,6 +1,7 @@
 sfcgal (1.3.2-1) UNRELEASED; urgency=medium
 
   * New upstream release.
+  * Drop spelling-errors.patch, applied upstream.
 
  -- Bas Couwenberg <sebastic at debian.org>  Fri, 15 Sep 2017 20:49:16 +0200
 
diff --git a/debian/patches/series b/debian/patches/series
deleted file mode 100644
index 38edaa7..0000000
--- a/debian/patches/series
+++ /dev/null
@@ -1 +0,0 @@
-spelling-errors.patch
diff --git a/debian/patches/spelling-errors.patch b/debian/patches/spelling-errors.patch
deleted file mode 100644
index 281d70a..0000000
--- a/debian/patches/spelling-errors.patch
+++ /dev/null
@@ -1,39 +0,0 @@
-Description: Fix spelling errors.
- * enought -> enough
-Author: Bas Couwenberg <sebastic at debian.org>
-Forwarded: https://github.com/Oslandia/SFCGAL/pull/141
-Applied-Upstream: https://github.com/Oslandia/SFCGAL/commit/aa5c4d76dd1c53d13996343e02cf4a652aac1ec3
-
---- a/src/algorithm/distance.cpp
-+++ b/src/algorithm/distance.cpp
-@@ -496,7 +496,7 @@ double distanceGeometryCollectionToGeome
-     // point of BS(gAi) there is no need to compute the distance(gAj, gB)
-     // since it will be greater than distance(gAi, gB)
-     //
--    // The aim is not to find the minimal bounding sphere, but a good enought sphere than
-+    // The aim is not to find the minimal bounding sphere, but a good enough sphere than
-     // encloses all points
-     std::set<size_t> noTest;
- 
---- a/src/algorithm/distance3d.cpp
-+++ b/src/algorithm/distance3d.cpp
-@@ -588,7 +588,7 @@ double distanceGeometryCollectionToGeome
-     // point of BS(gAi) there is no need to compute the distance(gAj, gB)
-     // since it will be greater than distance(gAi, gB)
-     //
--    // The aim is not to find the minimal bounding sphere, but a good enought sphere than
-+    // The aim is not to find the minimal bounding sphere, but a good enough sphere than
-     // encloses all points
-     std::set<size_t> noTest;
- 
---- a/src/algorithm/isValid.cpp
-+++ b/src/algorithm/isValid.cpp
-@@ -183,7 +183,7 @@ const Validity isValid( const Polygon& p
- 
-     for ( size_t r=0; r != numRings; ++r ) {
-         if ( p.ringN( r ).numPoints() < 4 ) {
--            return Validity::invalid( ( boost::format( "not enought points in ring %d" ) % r ).str() );
-+            return Validity::invalid( ( boost::format( "not enough points in ring %d" ) % r ).str() );
-         }
- 
- //        const Validity v = isValid( p.ringN(r) );

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-grass/sfcgal.git