[SCM] branch, master, updated. debian/0.17-1-17-g9b3641d

[gregor herrmann]

The following commit has been merged in the master branch:
commit afcd4e946cd2c5728a34fb7fccba473858e96b30
Author: gregor herrmann <gregoa at debian.org>
Date:   Sun Feb 17 19:30:47 2013 +0100

    Add a patch to fix a spelling mistake.

diff --git a/debian/patches/series b/debian/patches/series
new file mode 100644
index 0000000..5299247
--- /dev/null
+++ b/debian/patches/series
@@ -0,0 +1 @@
+spelling.patch
diff --git a/debian/patches/spelling.patch b/debian/patches/spelling.patch
new file mode 100644
index 0000000..cbf63ea
--- /dev/null
+++ b/debian/patches/spelling.patch
@@ -0,0 +1,18 @@
+Description: fix a spelling mistake
+Origin: vendor
+Bug: https://rt.cpan.org/Ticket/Display.html?id=83395
+Forwarded: https://rt.cpan.org/Ticket/Display.html?id=83395
+Author: gregor herrmann <gregoa at debian.org>
+Last-Update: 2013-02-17
+
+--- a/lib/Math/Prime/Util.pm
++++ b/lib/Math/Prime/Util.pm
+@@ -2083,7 +2083,7 @@
+ 
+ The current implementation decides based on the ranges whether to use a
+ segmented sieve with a fast bit count, or Lehmer's algorithm.  The former
+-is prefered for small sizes as well as small ranges.  The latter is much
++is preferred for small sizes as well as small ranges.  The latter is much
+ faster for large ranges.
+ 
+ The segmented sieve is very memory efficient and is quite fast even with

--