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

ppm-guest pushed a commit to annotated tag v0.17
in repository libmath-prime-util-perl.

commit 3419e58fea7b6bf5cdc92aae79876587721f6f57
Author: Dana Jacobsen <d...@acm.org>
Date:   Thu Dec 20 01:02:48 2012 -0800

    Update versions and dates for release
---
 Changes                | 6 ++++--
 Makefile.PL            | 2 +-
 README                 | 4 ++--
 lib/Math/Prime/Util.pm | 4 ++--
 4 files changed, 9 insertions(+), 7 deletions(-)

diff --git a/Changes b/Changes
index 61b3475..5f361fa 100644
--- a/Changes
+++ b/Changes
@@ -1,6 +1,6 @@
 Revision history for Perl extension Math::Prime::Util.
 
-0.17  18 December 2012
+0.17  20 December 2012
 
     - Perl 5.8.1 - 5.8.7 miscalculates 12345 ** 4, which I used in a test.
 
@@ -10,7 +10,9 @@ Revision history for Perl extension Math::Prime::Util.
       practical application now that we use Lehmer's method for counts, but
       there are some cases that can still show speedups.
 
-    - Changed the rand functionality yet again.  Sorry.
+    - Changed the rand functionality yet again.  Sorry.  This should give
+      better support for plugging in crypto RNG's when used from other
+      modules.
 
 0.16  11 December 2012
 
diff --git a/Makefile.PL b/Makefile.PL
index e5d16cc..c81d6a6 100644
--- a/Makefile.PL
+++ b/Makefile.PL
@@ -33,7 +33,7 @@ WriteMakefile1(
                       'Math::BigFloat'   => '1.59',
                     },
     META_MERGE   => {
-                      recommends => { 'Math::Prime::Util::GMP' => 0.04, },
+                      recommends => { 'Math::Prime::Util::GMP' => 0.06, },
                       recommends => { 'Math::BigInt::GMP' => 0, },
                       recommends => { 'Math::MPFR' => 0, },
                     },
diff --git a/README b/README
index b838094..be92e29 100644
--- a/README
+++ b/README
@@ -1,9 +1,9 @@
-Math::Prime::Util version 0.16
+Math::Prime::Util version 0.17
 
 A set of utilities related to prime numbers.  These include multiple sieving
 methods, is_prime, prime_count, nth_prime, approximations and bounds for
 the prime_count and nth prime, next_prime and prev_prime, moebius and totient
-functions, integer factoring, and more.
+functions, random primes, integer factoring, and more.
 
 The default sieving and factoring are intended to be the fastest on CPAN.
 Current measurements show it is faster than:
diff --git a/lib/Math/Prime/Util.pm b/lib/Math/Prime/Util.pm
index d196d5f..5ec8880 100644
--- a/lib/Math/Prime/Util.pm
+++ b/lib/Math/Prime/Util.pm
@@ -5,7 +5,7 @@ use Carp qw/croak confess carp/;
 
 BEGIN {
   $Math::Prime::Util::AUTHORITY = 'cpan:DANAJ';
-  $Math::Prime::Util::VERSION = '0.16';
+  $Math::Prime::Util::VERSION = '0.17';
 }
 
 # parent is cleaner, and in the Perl 5.10.1 / 5.12.0 core, but not earlier.
@@ -1750,7 +1750,7 @@ Math::Prime::Util - Utilities related to prime numbers, 
including fast sieves an
 
 =head1 VERSION
 
-Version 0.16
+Version 0.17
 
 
 =head1 SYNOPSIS

-- 
Alioth's /usr/local/bin/git-commit-notice on 
/srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git

_______________________________________________
Pkg-perl-cvs-commits mailing list
Pkg-perl-cvs-commits@lists.alioth.debian.org
http://lists.alioth.debian.org/cgi-bin/mailman/listinfo/pkg-perl-cvs-commits

Reply via email to