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

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

commit 7e66d0d2ef8f132ea4141770b7078d40598c86c0
Author: Dana Jacobsen <d...@acm.org>
Date:   Wed Jun 6 04:17:47 2012 -0600

    New tests and benchmarks
---
 Changes                    |   2 +
 MANIFEST                   |   3 ++
 examples/bench-is-prime.pl |  38 +++++++++++++++
 t/15-probprime.t           | 112 +++++++++++++++++++++++++++++++++++++++++++++
 4 files changed, 155 insertions(+)

diff --git a/Changes b/Changes
index 7fa319c..d5f7bd5 100644
--- a/Changes
+++ b/Changes
@@ -2,6 +2,8 @@ Revision history for Perl extension Math::Prime::Util.
 
 0.03  6 June 2012
     - Speed up factoring a little by moving some work into the XS routine.
+    - fixed powmod routine
+    - Add Miller-Rabin and deterministic probable prime functions.
 
 0.02  5 June 2012
     - Back off new_ok to new/isa_ok to keep Test::More requirements low.
diff --git a/MANIFEST b/MANIFEST
index 139595c..3c724f3 100644
--- a/MANIFEST
+++ b/MANIFEST
@@ -15,6 +15,8 @@ util.h
 util.c
 examples/bench-nthprime.pl
 examples/bench-factor-semiprime.pl
+examples/bench-is-prime.pl
+examples/test-factoring.pl
 t/01-load.t
 t/02-can.t
 t/03-init.t
@@ -23,6 +25,7 @@ t/11-primes.t
 t/12-nextprime.t
 t/13-primecount.t
 t/14-nthprime.t
+t/15-probprime.t
 t/30-relations.t
 t/50-factoring.t
 t/90-release-perlcritic.t
diff --git a/examples/bench-is-prime.pl b/examples/bench-is-prime.pl
new file mode 100755
index 0000000..8dff8f7
--- /dev/null
+++ b/examples/bench-is-prime.pl
@@ -0,0 +1,38 @@
+#!/usr/bin/perl -w
+
+use strict;
+#use Math::Primality;
+use Math::Prime::XS;
+use Math::Prime::Util;
+#use Math::Prime::FastSieve;
+use Benchmark qw/:all/;
+use List::Util qw/min max/;
+my $count = shift || -5;
+
+test_at_mag($_) for (4, 8, 12, 16);
+
+
+sub test_at_mag {
+  my $magnitude = shift;
+
+  my $base = 10 ** ($magnitude-1);
+  my $max = 10 ** $magnitude;
+  my $digits = $magnitude+1;
+  my @nums = map { $base+int(rand($max-$base)) } (1 .. 200);
+  my $min_num = min @nums;
+  my $max_num = max @nums;
+
+  #my $sieve = Math::Prime::FastSieve::Sieve->new(10 ** $magnitude + 1);
+  #Math::Prime::Util::prime_precalc(10 ** $magnitude + 1);
+
+  print "is_prime for random $digits-digit numbers ($min_num - $max_num)\n";
+
+  cmpthese($count,{
+    #'Math::Primality' => sub { Math::Primality::is_prime($_) for @nums },
+    'M::P::XS' => sub { Math::Prime::XS::is_prime($_) for @nums },
+    #'M::P::FS' => sub { $sieve->isprime($_) for @nums },
+    'M::P::U' => sub { Math::Prime::Util::is_prime($_) for @nums },
+    'MPU prob' => sub { Math::Prime::Util::is_prob_prime($_) for @nums },
+  });
+  print "\n";
+}
diff --git a/t/15-probprime.t b/t/15-probprime.t
new file mode 100644
index 0000000..79a8779
--- /dev/null
+++ b/t/15-probprime.t
@@ -0,0 +1,112 @@
+#!/usr/bin/env perl
+use strict;
+use warnings;
+
+use Test::More;
+use Math::Prime::Util qw/is_prime is_prob_prime miller_rabin/;
+
+my $use64 = Math::Prime::Util::_maxbits > 32;
+my $extra = defined $ENV{RELEASE_TESTING} && $ENV{RELEASE_TESTING};
+
+plan tests => 6 + 19 + 3573 + (5 + 29 + 22 + 23 + 16) + 15 + 27
+              + ($use64 ? 5+1 : 0)
+              + ($extra ? 6 : 0)
+              + (($extra && $use64) ? 19 : 0);
+
+# Some of these tests were inspired by Math::Primality's tests
+
+ok(is_prob_prime(2)  == 2,  '2 is prime');
+ok(is_prob_prime(1)  == 0,  '1 is not prime');
+ok(is_prob_prime(0)  == 0,  '0 is not prime');
+ok(is_prob_prime(-1) == 0, '-1 is not prime');
+ok(is_prob_prime(-2) == 0, '-2 is not prime');
+ok(is_prob_prime(20) == 0, '20 is not prime');
+
+# powers of 2
+foreach my $k (2 .. 20) {
+  my $k2 = 2**$k;
+  ok(!is_prob_prime($k2), "2**$k=$k2 is not prime");
+}
+
+my @small_primes = qw/
+2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71
+73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173
+179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281
+283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409
+419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541
+547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659
+661 673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809
+811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937 941
+947 953 967 971 977 983 991 997 1009 1013 1019 1021 1031 1033 1039 1049 1051 
1061 1063 1069
+1087 1091 1093 1097 1103 1109 1117 1123 1129 1151 1153 1163 1171 1181 1187 
1193 1201 1213 1217 1223
+1229 1231 1237 1249 1259 1277 1279 1283 1289 1291 1297 1301 1303 1307 1319 
1321 1327 1361 1367 1373
+1381 1399 1409 1423 1427 1429 1433 1439 1447 1451 1453 1459 1471 1481 1483 
1487 1489 1493 1499 1511
+1523 1531 1543 1549 1553 1559 1567 1571 1579 1583 1597 1601 1607 1609 1613 
1619 1621 1627 1637 1657
+1663 1667 1669 1693 1697 1699 1709 1721 1723 1733 1741 1747 1753 1759 1777 
1783 1787 1789 1801 1811
+1823 1831 1847 1861 1867 1871 1873 1877 1879 1889 1901 1907 1913 1931 1933 
1949 1951 1973 1979 1987
+1993 1997 1999 2003 2011 2017 2027 2029 2039 2053 2063 2069 2081 2083 2087 
2089 2099 2111 2113 2129
+2131 2137 2141 2143 2153 2161 2179 2203 2207 2213 2221 2237 2239 2243 2251 
2267 2269 2273 2281 2287
+2293 2297 2309 2311 2333 2339 2341 2347 2351 2357 2371 2377 2381 2383 2389 
2393 2399 2411 2417 2423
+2437 2441 2447 2459 2467 2473 2477 2503 2521 2531 2539 2543 2549 2551 2557 
2579 2591 2593 2609 2617
+2621 2633 2647 2657 2659 2663 2671 2677 2683 2687 2689 2693 2699 2707 2711 
2713 2719 2729 2731 2741
+2749 2753 2767 2777 2789 2791 2797 2801 2803 2819 2833 2837 2843 2851 2857 
2861 2879 2887 2897 2903
+2909 2917 2927 2939 2953 2957 2963 2969 2971 2999 3001 3011 3019 3023 3037 
3041 3049 3061 3067 3079
+3083 3089 3109 3119 3121 3137 3163 3167 3169 3181 3187 3191 3203 3209 3217 
3221 3229 3251 3253 3257
+3259 3271 3299 3301 3307 3313 3319 3323 3329 3331 3343 3347 3359 3361 3371 
3373 3389 3391 3407 3413
+3433 3449 3457 3461 3463 3467 3469 3491 3499 3511 3517 3527 3529 3533 3539 
3541 3547 3557 3559 3571
+/;
+my %small_primes;
+map { $small_primes{$_} = 1; } @small_primes;
+
+foreach my $n (0 .. 3572) {
+  if (defined $small_primes{$n}) {
+    ok(is_prob_prime($n)==2, "$n is prime");
+  } else {
+    ok(!is_prob_prime($n), "$n is not prime");
+  }
+}
+
+map { ok(!is_prob_prime($_), "A006945 number $_ is not prime") }
+  qw/9 2047 1373653 25326001 3215031751/;
+
+map { ok(!is_prob_prime($_), "A006945 number $_ is not prime") }
+  qw/2152302898747 3474749660383 341550071728321 341550071728321 
3825123056546413051/ if $use64;
+
+map { ok(!is_prob_prime($_), "Carmichael Number $_ is not prime") }
+  qw/561 1105 1729 2465 2821 6601 8911 10585 15841 29341 41041 46657 52633
+     62745 63973 75361 101101 340561 488881 852841 1857241 6733693
+     9439201 17236801 23382529 34657141 56052361 146843929 216821881/;
+
+map { ok(!is_prob_prime($_), "Pseudoprime (base 2) $_ is not prime" ) }
+  qw/341 561 645 1105 1387 1729 1905 2047 2465 2701 2821 3277 4033 4369 4371
+     4681 5461 6601 7957 8321 52633 88357/;
+
+map { ok(!is_prob_prime($_), "Pseudoprime (base 3) $_ is not prime" ) }
+  qw/121 703 1891 3281 8401 8911 10585 12403 16531 18721 19345 23521 31621
+     44287 47197 55969 63139 74593 79003 82513 87913 88573 97567/;
+
+map { ok(!is_prob_prime($_), "Pseudoprime (base 5) $_ is not prime" ) }
+  qw/781 1541 5461 5611 7813 13021 14981 15751 24211 25351 29539 38081
+     40501 44801 53971 79381/;
+
+map { ok(is_prob_prime($_)==2, "Primegap start $_ is prime" ) }
+  qw/2 3 7 23 89 113 523 887 1129 1327 9551 15683 19609 31397 155921/;
+
+map { ok(is_prob_prime($_)==2, "Primegap end $_ is prime" ) }
+  qw/5 11 29 97 127 541 907 1151 1361 9587 15727 19661 31469 156007 360749
+     370373 492227 1349651 1357333 2010881 4652507 17051887 20831533 47326913
+     122164969 189695893 191913031/;
+
+map { ok(is_prob_prime($_)==2, "Primegap end $_ is prime" ) }
+  qw/10726905041/ if $use64;
+
+map { ok(is_prob_prime($_)==2, "Primegap end $_ is prime" ) }
+  qw/387096383 436273291 1294268779 1453168433 2300942869 3842611109/ if 
$extra;
+
+map { ok(is_prob_prime($_)==2, "Primegap end $_ is prime" ) }
+  qw/4302407713 20678048681 22367085353
+     25056082543 42652618807 127976334671 182226896239 241160624143
+     297501075799 303371455241 304599508537 416608695821 461690510011
+     614487453523 738832927927 1346294310749 1408695493609 1968188556461
+     2614941710599/
+  if $use64 && $extra;

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