[sfcgal] 10/11: Add patch to fix spelling errors.

Bas Couwenberg sebastic at debian.org
Mon May 29 11:27:47 UTC 2017


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

sebastic pushed a commit to branch master
in repository sfcgal.

commit fb030e22b6090347677475e34e03f7e5bdd3a9a9
Author: Bas Couwenberg <sebastic at xs4all.nl>
Date:   Mon May 29 12:34:35 2017 +0200

    Add patch to fix spelling errors.
---
 debian/changelog                     |  1 +
 debian/patches/series                |  1 +
 debian/patches/spelling-errors.patch | 38 ++++++++++++++++++++++++++++++++++++
 3 files changed, 40 insertions(+)

diff --git a/debian/changelog b/debian/changelog
index 1298b44..12f407f 100644
--- a/debian/changelog
+++ b/debian/changelog
@@ -6,6 +6,7 @@ sfcgal (1.3.1-1) UNRELEASED; urgency=medium
   * Add binary package for OpenSceneGraph specific library.
   * Add symbols file for libsfcgal-osg1.
   * Update libsfcgal1 symbols for amd64.
+  * Add patch to fix spelling errors.
 
  -- Bas Couwenberg <sebastic at debian.org>  Mon, 29 May 2017 10:34:03 +0200
 
diff --git a/debian/patches/series b/debian/patches/series
new file mode 100644
index 0000000..38edaa7
--- /dev/null
+++ b/debian/patches/series
@@ -0,0 +1 @@
+spelling-errors.patch
diff --git a/debian/patches/spelling-errors.patch b/debian/patches/spelling-errors.patch
new file mode 100644
index 0000000..eff89b2
--- /dev/null
+++ b/debian/patches/spelling-errors.patch
@@ -0,0 +1,38 @@
+Description: Fix spelling errors.
+ * enought -> enough
+Author: Bas Couwenberg <sebastic at debian.org>
+Forwarded: https://github.com/Oslandia/SFCGAL/pull/141
+
+--- 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



More information about the Pkg-grass-devel mailing list