Codebase list libmath-prime-util-perl / afcd4e9
Add a patch to fix a spelling mistake. gregor herrmann 11 years ago
2 changed file(s) with 19 addition(s) and 0 deletion(s). Raw diff Collapse all Expand all
+1
-0
debian/patches/series less more
0 spelling.patch
+18
-0
debian/patches/spelling.patch less more
0 Description: fix a spelling mistake
1 Origin: vendor
2 Bug: https://rt.cpan.org/Ticket/Display.html?id=83395
3 Forwarded: https://rt.cpan.org/Ticket/Display.html?id=83395
4 Author: gregor herrmann <gregoa@debian.org>
5 Last-Update: 2013-02-17
6
7 --- a/lib/Math/Prime/Util.pm
8 +++ b/lib/Math/Prime/Util.pm
9 @@ -2083,7 +2083,7 @@
10
11 The current implementation decides based on the ranges whether to use a
12 segmented sieve with a fast bit count, or Lehmer's algorithm. The former
13 -is prefered for small sizes as well as small ranges. The latter is much
14 +is preferred for small sizes as well as small ranges. The latter is much
15 faster for large ranges.
16
17 The segmented sieve is very memory efficient and is quite fast even with