[libmath-prime-util-perl] 16/17: Final changes for release

[Partha P. Mukherjee]

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

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

commit 1adab041ebb40139c4eb1072a092fa64270a1667
Author: Dana Jacobsen <dana at acm.org>
Date:   Fri Feb 22 22:07:20 2013 -0800

    Final changes for release
---
 Changes                | 6 ++++--
 lib/Math/Prime/Util.pm | 2 +-
 2 files changed, 5 insertions(+), 3 deletions(-)

diff --git a/Changes b/Changes
index a2e6c17..c842455 100644
--- a/Changes
+++ b/Changes
@@ -1,8 +1,10 @@
 Revision history for Perl extension Math::Prime::Util.
 
-0.21  ? February 2012
+0.21 22 February 2012
 
-    - Switch to using Bytes::Random::Secure for random primes.
+    - Switch to using Bytes::Random::Secure for random primes.  This is a
+      big change in that it is the first non-CORE module used.  However, it
+      gets rid of lots of possible stupidness from system rand.
 
     - Spelling fixes in documentation.
 
diff --git a/lib/Math/Prime/Util.pm b/lib/Math/Prime/Util.pm
index 82ca25c..5778fe4 100644
--- a/lib/Math/Prime/Util.pm
+++ b/lib/Math/Prime/Util.pm
@@ -2422,7 +2422,7 @@ function is defined as C<sum(moebius(1..n))>.  This is a much more efficient
 solution for larger inputs.  For example, computing Mertens(100M) takes:
 
    time    approx mem
-     0.4s      8MB     mertens(100_000_000)
+     0.36s     0.1MB   mertens(100_000_000)
     74.8s   7000MB     List::Util::sum(moebius(1,100_000_000))
    325.7s      0MB     $sum += moebius($_) for 1..100_000_000
 

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