[libmath-prime-util-perl] 160/181: Changes for Math::BigInt::Pari (it doesn't play well with others)
Partha P. Mukherjee
ppm-guest at moszumanska.debian.org
Thu May 21 18:51:17 UTC 2015
This is an automated email from the git hooks/post-receive script.
ppm-guest pushed a commit to annotated tag v0.36
in repository libmath-prime-util-perl.
commit e0d50c868f48df5cb9df55dd0f32229ab6fc9b14
Author: Dana Jacobsen <dana at acm.org>
Date: Fri Jan 10 18:19:04 2014 -0800
Changes for Math::BigInt::Pari (it doesn't play well with others)
---
lib/Math/Prime/Util.pm | 2 +-
t/92-release-pod-coverage.t | 2 +-
xt/primality-proofs.pl | 2 +-
xt/test-bpsw.pl | 4 ++--
4 files changed, 5 insertions(+), 5 deletions(-)
diff --git a/lib/Math/Prime/Util.pm b/lib/Math/Prime/Util.pm
index b74c021..aaec9ce 100644
--- a/lib/Math/Prime/Util.pm
+++ b/lib/Math/Prime/Util.pm
@@ -2201,7 +2201,7 @@ __END__
=encoding utf8
-=for stopwords forprimes forcomposites fordivisors Möbius Deléglise totient moebius mertens liouville znorder irand primesieve uniqued k-tuples von SoE pari yafu fonction qui compte le nombre nombres voor PhD superset sqrt(N) gcd(A^M k-th (10001st primegen libtommath kronecker znprimroot gcd lcm
+=for stopwords forprimes forcomposites fordivisors Möbius Deléglise totient moebius mertens liouville znorder irand primesieve uniqued k-tuples von SoE pari yafu fonction qui compte le nombre nombres voor PhD superset sqrt(N) gcd(A^M k-th (10001st primegen libtommath kronecker znprimroot znlog gcd lcm
=head1 NAME
diff --git a/t/92-release-pod-coverage.t b/t/92-release-pod-coverage.t
index 8ba995a..1eff345 100644
--- a/t/92-release-pod-coverage.t
+++ b/t/92-release-pod-coverage.t
@@ -62,7 +62,7 @@ sub mpu_public_regex {
partitions
chebyshev_theta chebyshev_psi
divisor_sum
- carmichael_lambda kronecker znorder znprimroot legendre_phi
+ carmichael_lambda kronecker znorder znprimroot znlog legendre_phi
ExponentialIntegral LogarithmicIntegral RiemannZeta RiemannR
/;
my $pattern = '^(' . join('|', @funcs) . ')$';
diff --git a/xt/primality-proofs.pl b/xt/primality-proofs.pl
index 16daeda..d14860b 100755
--- a/xt/primality-proofs.pl
+++ b/xt/primality-proofs.pl
@@ -2,7 +2,7 @@
use warnings;
use strict;
use Math::Prime::Util ':all';
-use Math::BigInt lib=>"GMP";
+use Math::BigInt lib=>"GMP,Pari";
if (!Math::Prime::Util::prime_get_config->{gmp}) {
print "\nYou should install Math::Prime::Util::GMP.\n\n";
diff --git a/xt/test-bpsw.pl b/xt/test-bpsw.pl
index e14ae35..04256d9 100755
--- a/xt/test-bpsw.pl
+++ b/xt/test-bpsw.pl
@@ -81,7 +81,7 @@ print "\n";
}
if (1) {
-use bigint try => 'GMP';
+use bigint try => 'GMP,Pari';
my $big_base = 2**64 + 1;
my $range = 2**1024 - 1;
my $end_base = $big_base + $range;
@@ -106,7 +106,7 @@ my $num_rns = 100;
my $len_rns = 100;
my $count = -1;
-use bigint try => 'GMP';
+use bigint try => 'GMP,Pari';
my @rns; # make the primality tests at least lift a finger.
while (@rns < $num_rns) {
--
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