File: spelling.patch

package info (click to toggle)
libmath-combinatorics-perl 0.09-5
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 144 kB
  • sloc: perl: 412; makefile: 2
file content (33 lines) | stat: -rw-r--r-- 1,344 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
Description: fix typos found by lintian
Author: Florian Schlichting <fsfs@debian.org>
Forwarded: https://rt.cpan.org/Ticket/Display.html?id=125736

--- a/lib/Math/Combinatorics.pm
+++ b/lib/Math/Combinatorics.pm
@@ -109,7 +109,7 @@
 
  http://mathworld.wolfram.com/String.html
 
-"Morse signals: diferent signals of 3 positions using the two symbols - and .".
+"Morse signals: different signals of 3 positions using the two symbols - and .".
 
  $o = Math::Combinatorics->new( count=>3 , data=>[qw(. -)] , frequency=>[3,3] );
  while ( my @x = $o->next_multiset ) {
@@ -170,7 +170,7 @@
 
  * Need more extensive unit tests.
 
-   * tests for new()'s frequency argment
+   * tests for new()'s frequency argument
 
  * A known bug (more of a missing feature, actually) does not allow parameterization of k
  for nPk in permute().  it is assumed k == n.  L</permute()> for details.  You can work
@@ -218,7 +218,7 @@
 
  Usage   : my @combinations = combine($k,@n);
  Function: implements nCk (n choose k), or n!/(k!*(n-k!)).
-           returns all unique unorderd combinations of k items from set n.
+           returns all unique unordered combinations of k items from set n.
            items in n are assumed to be character data, and are
            copied into the return data structure (see "Returns" below).
  Example : my @n = qw(a b c);