[med-svn] [mcl] 04/05: Fix further spelling issues
Andreas Tille
tille at debian.org
Mon Jan 22 12:05:17 UTC 2018
This is an automated email from the git hooks/post-receive script.
tille pushed a commit to branch master
in repository mcl.
commit aaf9ea13ad72e4d328b2f46a13ba8e7ace3272ea
Author: Andreas Tille <tille at debian.org>
Date: Mon Jan 22 13:00:46 2018 +0100
Fix further spelling issues
---
debian/changelog | 1 +
debian/patches/spelling.patch | 64 +++++++++++++++++++++++++++++++++++++++++++
2 files changed, 65 insertions(+)
diff --git a/debian/changelog b/debian/changelog
index d73c3de..8f35a97 100644
--- a/debian/changelog
+++ b/debian/changelog
@@ -6,6 +6,7 @@ mcl (1:14-137+ds-1) UNRELEASED; urgency=medium
prevent building the package twice in a row
* Standards-Version: 4.1.3
* debhelper 11
+ * Fix further spelling issues
-- Andreas Tille <tille at debian.org> Mon, 22 Jan 2018 11:30:15 +0100
diff --git a/debian/patches/spelling.patch b/debian/patches/spelling.patch
index 498696b..7842969 100644
--- a/debian/patches/spelling.patch
+++ b/debian/patches/spelling.patch
@@ -117,6 +117,15 @@ Description: Fix spelling
loading networks is by using \mysib{mcxload}. The option
\genopt{-write-expanded} can be useful for exploring more complicated input
transformations that incorporate an expansion step, but is not really
+@@ -974,7 +974,7 @@ option.}
+ although this almost never happens in practice, as it requires some
+ particular type of symmetry to be present in the input graph (not just any
+ symmetry will do). Mathematically speaking, this is a conjecture and not a
+- theorem, but the present author wil eat his shoe if it fails to be true (for
++ theorem, but the present author will eat his shoe if it fails to be true (for
+ marzipan values of shoe). It is easy though to construct an input graph for
+ which certain mcl settings result in overlap - for example a line graph on
+ an odd number of nodes. The default is to excise overlapping parts and
@@ -1421,7 +1421,7 @@ with value 0.8.}
Euclidean data. So mcl in its canonical form is certainly not fit for
boundary detection or image segmentation. I experimented with a modified
@@ -410,3 +419,58 @@ Description: Fix spelling
*
* support growing files. and look at other items in the grep source code.
*/
+--- a/scripts/mlm-quilt
++++ b/scripts/mlm-quilt
+@@ -12,7 +12,7 @@
+ #
+ # !!!
+ # try tree search with depth 2 when testing descend.
+-# !encapsulate PN_keep etc initalization and updating.
++# !encapsulate PN_keep etc initialization and updating.
+ # write clusters with scores, consensus.
+
+ # [bc-9-1-02|fam41/rip26] mlmimpromptu --ignore-size=3 --fnannot=../data/paf41.ipro
+--- a/src/mcl/procinit.c
++++ b/src/mcl/procinit.c
+@@ -209,7 +209,7 @@ mcxOptAnchor mclProcOptions[] =
+ , MCX_OPT_HASARG | MCX_OPT_HIDDEN
+ , PROC_OPT_RPRUNE
+ , "<int>"
+- , "use inital pruning cutoff <MAX>/<int>"
++ , "use initial pruning cutoff <MAX>/<int>"
+ }
+ , { "-skid"
+ , MCX_OPT_HASARG | MCX_OPT_HIDDEN
+--- a/src/shmx/mcxdiameter.c
++++ b/src/shmx/mcxdiameter.c
+@@ -916,7 +916,7 @@ void compute_scores_up_vc /
+ )
+ { dim j
+ ; for (j=0;j<N_COLS(up);j++)
+- up->cols[j].val = 1.0 /* accumulator; initalised */
++ up->cols[j].val = 1.0 /* accumulator; initialised */
+ /* question: initialise everywhere? */
+
+ ; for (j=0;j<n_order;j++)
+--- a/doc/clmorder.azm
++++ b/doc/clmorder.azm
+@@ -66,7 +66,7 @@
+ {\defopt{-o}{<fname>}}
+ }
+ \car{
+- As decribed above.
++ As described above.
+ }
+
+ \'end{itemize}
+--- a/doc/mcxload.azm
++++ b/doc/mcxload.azm
+@@ -467,7 +467,7 @@
+ {\defopt{-pack-rnum}{<num>}{set row range}}
+ }
+ \car{
+- The \genopt{-packed} option allows to read machine-readable data
++ The \genopt{-packed} option allows one to read machine-readable data
+ directly. The data has to correspond to the data types for indexes
+ and values with with MCL was compiled. The use of \genopt{-pack-cnum}
+ and \genopt{-pack-rnum} is required to set the limits of
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-med/mcl.git
More information about the debian-med-commit
mailing list