[libmath-prime-util-perl] 05/05: text cleanup

Partha P. Mukherjee ppm-guest at moszumanska.debian.org
Thu May 21 18:44:12 UTC 2015


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

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

commit d9467f300b78673f2f40da200d9bdc3c2443279c
Author: Dana Jacobsen <dana at acm.org>
Date:   Mon Jun 4 11:08:17 2012 -0600

    text cleanup
---
 Changes          | 4 ++--
 Makefile.PL      | 4 ----
 t/14-nthprime.t  | 2 +-
 t/50-factoring.t | 2 +-
 4 files changed, 4 insertions(+), 8 deletions(-)

diff --git a/Changes b/Changes
index 0660a2b..1d2347f 100644
--- a/Changes
+++ b/Changes
@@ -1,4 +1,4 @@
 Revision history for Perl extension Math::Prime::Util.
 
-0.01  3 June 2012
-    - Original release
+0.01  4 June 2012
+    - Initial release
diff --git a/Makefile.PL b/Makefile.PL
index 88587fd..63a6a51 100644
--- a/Makefile.PL
+++ b/Makefile.PL
@@ -17,10 +17,6 @@ WriteMakefile1(
                       'Exporter'         => '5.562',
                       'XSLoader'         => '0.01',
                     },
-    # Example:
-    #META_MERGE   => {
-    #                  recommends => { 'Data::BitStream' => 0, },
-    #                },
 
     MIN_PERL_VERSION => 5.006002,
 );
diff --git a/t/14-nthprime.t b/t/14-nthprime.t
index fcc1674..3b5e48a 100644
--- a/t/14-nthprime.t
+++ b/t/14-nthprime.t
@@ -48,7 +48,7 @@ my %nthprimes64 = (
 while (my($n, $nth) = each (%nthprimes32)) {
   cmp_ok( nth_prime_upper($n), '>=', $nth, "nth_prime($n) <= upper estimate" );
   cmp_ok( nth_prime_lower($n), '<=', $nth, "nth_prime($n) >= lower estimate" );
-  
+
   if ( ($n <= 2000000) || $extra ) {
     is( nth_prime($n), $nth, "nth_prime($n) = $nth" );
   }
diff --git a/t/50-factoring.t b/t/50-factoring.t
index 15da997..da2bf28 100644
--- a/t/50-factoring.t
+++ b/t/50-factoring.t
@@ -34,7 +34,7 @@ foreach my $n (@testn) {
   # Do they multiply to the number?
   my $product = 1;  $product *= $_ for @f;
   is( $product, $n, "$n = [ $facstring ]" );
-  
+
   # Are they all prime?
   my $isprime = 1; $isprime *= is_prime($_) for @f;
   if ($n < 2) {

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