[libmath-prime-util-perl] 53/54: Allow some author tests to run better on 32-bit Perl
Partha P. Mukherjee
ppm-guest at moszumanska.debian.org
Thu May 21 18:52:11 UTC 2015
This is an automated email from the git hooks/post-receive script.
ppm-guest pushed a commit to annotated tag v0.38
in repository libmath-prime-util-perl.
commit 21fc61fc7359c97fa9df9ccdf3caf6e09a432403
Author: Dana Jacobsen <dana at acm.org>
Date: Fri Feb 28 14:58:20 2014 -0800
Allow some author tests to run better on 32-bit Perl
---
TODO | 2 ++
bench/bench-is-prime.pl | 3 ++-
bench/bench-miller-rabin.pl | 1 +
3 files changed, 5 insertions(+), 1 deletion(-)
diff --git a/TODO b/TODO
index 021d8b0..2839e67 100644
--- a/TODO
+++ b/TODO
@@ -68,3 +68,5 @@
- Ensure a fast path for Math::GMP from MPU -> MPU:GMP -> GMP, and back.
- znlog better implementation
+
+- Add Shawe-Taylor random primes, from FIPS-186-4.
diff --git a/bench/bench-is-prime.pl b/bench/bench-is-prime.pl
index 7320ec7..e5cf876 100755
--- a/bench/bench-is-prime.pl
+++ b/bench/bench-is-prime.pl
@@ -13,7 +13,8 @@ my $numbers = 1000;
my $is64bit = (~0 > 4294967295);
my $maxdigits = ($is64bit) ? 20 : 10; # Noting the range is limited for max.
-my $randf = Math::Prime::Util::_get_rand_func();
+use Math::Prime::Util::RandomPrimes;
+my $randf = Math::Prime::Util::RandomPrimes::get_randf();
my $rand_ndigit_gen = sub {
my $digits = shift;
diff --git a/bench/bench-miller-rabin.pl b/bench/bench-miller-rabin.pl
index 3db5731..eb768e4 100755
--- a/bench/bench-miller-rabin.pl
+++ b/bench/bench-miller-rabin.pl
@@ -5,6 +5,7 @@ use Math::Primality;
use Math::Prime::XS;
use Math::Prime::Util;
use Math::Prime::Util::GMP;
+use Math::BigInt try=>"GMP,Pari";
#use Math::Prime::FastSieve;
use Benchmark qw/:all/;
use List::Util qw/min max/;
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git
More information about the Pkg-perl-cvs-commits
mailing list