[libmath-prime-util-perl] 03/15: Speed up primality proof tests on non-64-bit machines
Partha P. Mukherjee
ppm-guest at moszumanska.debian.org
Thu May 21 18:48:46 UTC 2015
This is an automated email from the git hooks/post-receive script.
ppm-guest pushed a commit to annotated tag v0.29
in repository libmath-prime-util-perl.
commit 8d113970c93d601523335c98763a925de38b988e
Author: Dana Jacobsen <dana at acm.org>
Date: Tue May 28 09:17:16 2013 -0700
Speed up primality proof tests on non-64-bit machines
---
t/23-primality-proofs.t | 3 +++
1 file changed, 3 insertions(+)
diff --git a/t/23-primality-proofs.t b/t/23-primality-proofs.t
index ceefc4b..66a8aed 100644
--- a/t/23-primality-proofs.t
+++ b/t/23-primality-proofs.t
@@ -11,6 +11,7 @@ use Math::Prime::Util qw/is_prime is_provable_prime is_provable_prime_with_cert
use Math::BigInt try => 'GMP';
my $extra = defined $ENV{EXTENDED_TESTING} && $ENV{EXTENDED_TESTING};
+my $use64 = ~0 > 4294967295;
my $broken64 = (18446744073709550592 == ~0);
my @plist = qw/20907001 809120722675364249 677826928624294778921
@@ -51,6 +52,8 @@ foreach my $p (@plist) {
SKIP: {
skip "Broken 64-bit causes trial factor to barf", 5
if $broken64 && $p > 2**48;
+ skip "These take a long time on non-64-bit. Skipping", 5
+ if !$use64 && !$extra && $p =~ /^(6778|9800)/;
my($isp, $cert_ref) = is_provable_prime_with_cert($p);
is( $isp, 2, " is_provable_prime_with_cert returns 2" );
ok( defined($cert_ref) && ref($cert_ref) eq 'ARRAY' && scalar(@$cert_ref) >= 1,
--
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