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 4733aa9ce1d06ef352199f8c468fb50af6049d0e
Author: Dana Jacobsen <d...@acm.org>
Date:   Mon Jan 13 21:42:10 2014 -0800

    Adjust comments
---
 lib/Math/Prime/Util.pm  | 8 ++++----
 t/03-init.t             | 2 +-
 t/19-moebius.t          | 4 ++--
 t/23-primality-proofs.t | 2 +-
 t/51-primearray.t       | 2 +-
 5 files changed, 9 insertions(+), 9 deletions(-)

diff --git a/lib/Math/Prime/Util.pm b/lib/Math/Prime/Util.pm
index 4ff112a..8d0bc35 100644
--- a/lib/Math/Prime/Util.pm
+++ b/lib/Math/Prime/Util.pm
@@ -4211,7 +4211,7 @@ common contemporary use I am aware of are:
 
 =item libtommath
 
-Uses the first C<k> prime bases.  This is unacceptable for
+Uses the first C<k> prime bases.  This is problematic for
 cryptographic use, as there are known methods (e.g. Arnault 1994) for
 constructing counterexamples.  The number of bases required to avoid
 false results is unreasonably high, hence performance is slow even
@@ -4250,9 +4250,9 @@ adversarial situation we can assume the inputs will be 
selected such
 that they are one of our counterexamples.  Now we need absurdly large
 numbers of tests.  This is like playing "pick my number" but the
 number is fixed forever at the start, the guesser gets to know
-everyone else's guesses and results who has every played, and can
-keep playing as long as they like.  It's only valid if the players
-are completely oblivious to what is happening.
+everyone else's guesses and results, and can keep playing as long as
+they like.  It's only valid if the players are completely oblivious to
+what is happening.
 
 
 =head1 LIMITATIONS
diff --git a/t/03-init.t b/t/03-init.t
index d211359..3cf3e66 100644
--- a/t/03-init.t
+++ b/t/03-init.t
@@ -17,7 +17,7 @@ my $diag = "Using " .
   ((Math::Prime::Util::prime_get_config->{xs})
     ? "XS"
     : "PP") .
-  ((Math::Prime::Util::prime_get_config->{gmp}) 
+  ((Math::Prime::Util::prime_get_config->{gmp})
     ? " with MPU::GMP version $Math::Prime::Util::GMP::VERSION."
     : ".") .
   "\n";
diff --git a/t/19-moebius.t b/t/19-moebius.t
index 4995655..aee8695 100644
--- a/t/19-moebius.t
+++ b/t/19-moebius.t
@@ -58,7 +58,7 @@ if ($extra && $use64) {
   223092870 => 3516,
 
     6433477 => 900,     # 30^2
-  109851909 => -4096,   # A084235, 2^12  
+  109851909 => -4096,   # A084235, 2^12
 
       2**14 =>  -32,    # A084236
       2**15 =>   26,
@@ -79,7 +79,7 @@ if ($extra && $use64) {
 }
 
 my %totients = (
-     123456 => 41088, 
+     123456 => 41088,
      123457 => 123456,
   123456789 => 82260072,
 );
diff --git a/t/23-primality-proofs.t b/t/23-primality-proofs.t
index d5f2191..69866de 100644
--- a/t/23-primality-proofs.t
+++ b/t/23-primality-proofs.t
@@ -62,7 +62,7 @@ is( is_provable_prime(871139809), 0, "871139809 is composite" 
);
 is( is_provable_prime(1490266103), 2, "1490266103 is provably prime" );
 
 foreach my $p (@plist) {
- 
+
   SKIP: {
     skip "Broken 64-bit causes trial factor to barf", 6
       if $broken64 && $p > 2**60;
diff --git a/t/51-primearray.t b/t/51-primearray.t
index 26ea49d..64fe106 100644
--- a/t/51-primearray.t
+++ b/t/51-primearray.t
@@ -58,7 +58,7 @@ my %test_indices = (
    78901 => 1005413,
   123456 => 1632913,
 );
-  
+
 
 plan tests => 3 + 2 + scalar(keys %test_indices) + 8;
 

-- 
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