[libmath-prime-util-perl] 38/72: Use mpu method to get new oo iterator

[Partha P. Mukherjee]

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

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

commit 1401eeb596bd949c91f9d08395731eac08c64c82
Author: Dana Jacobsen <d...@acm.org>
Date:   Thu Sep 19 17:52:52 2013 -0700

    Use mpu method to get new oo iterator
---
 xt/primes-edgecases.pl | 28 +++++++++++++++++++---------
 1 file changed, 19 insertions(+), 9 deletions(-)

diff --git a/xt/primes-edgecases.pl b/xt/primes-edgecases.pl
index 88f58b0..b0d340c 100755
--- a/xt/primes-edgecases.pl
+++ b/xt/primes-edgecases.pl
@@ -2,7 +2,6 @@
 use strict;
 use warnings;
 use Math::Prime::Util ':all';
-use Math::Prime::Util::PrimeIterator;
 use Test::More;
 
 my @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/;
@@ -19,7 +18,15 @@ foreach my $b (0 .. $end) {
     is_deeply( gen_primes($b,$e), \@p, "primes($b,$e)");
     is_deeply( gen_forprimes($b,$e), \@p, "forprimes {} $b,$e");
     is_deeply( gen_piterate($b,$e), \@p, "prime_iterator($b) while <= $e");
-    is_deeply( gen_ooiterate($b,$e), \@p, "prime_iterator object $b to $e");
+  }
+}
+SKIP: {
+  skip "No OO iterator", (($end+1)*($end+2)/2) unless defined 
&Math::Prime::Util::prime_iterator_object;
+  foreach my $b (0 .. $end) {
+    foreach my $e ($b .. $end) {
+      my @p = grep { $_ >= $b && $_ <= $e } @primes;
+      is_deeply( gen_ooiterate($b,$e), \@p, "prime_iterator object $b to $e");
+    }
   }
 }
 
@@ -37,12 +44,15 @@ foreach my $bdelta (reverse 0 .. 100) {
     is_deeply( gen_piterate($b,$e), \@p, "prime_iterator($b) while <= $e");
   }
 }
-diag "\nChecking numbers near end with OO iterator\n";
-foreach my $bdelta (reverse 0 .. 100) {
-  foreach my $edelta (reverse 0 .. $bdelta) {
-    my ($b, $e) = (~0 - $bdelta, ~0 - $edelta);
-    my @p = grep { $_ >= $b && $_ <= $e } @lprimes;
-    is_deeply( gen_ooiterate($b,$e), \@p, "prime_iterator object $b to $e");
+SKIP: {
+  skip "No OO iterator", ((101*102)/2) unless defined 
&Math::Prime::Util::prime_iterator_object;
+  diag "\nChecking numbers near end with OO iterator\n";
+  foreach my $bdelta (reverse 0 .. 100) {
+    foreach my $edelta (reverse 0 .. $bdelta) {
+      my ($b, $e) = (~0 - $bdelta, ~0 - $edelta);
+      my @p = grep { $_ >= $b && $_ <= $e } @lprimes;
+      is_deeply( gen_ooiterate($b,$e), \@p, "prime_iterator object $b to $e");
+    }
   }
 }
 
@@ -114,7 +124,7 @@ sub gen_piterate {
 sub gen_ooiterate {
   my($b, $e) = @_;
   my @p;
-  my $it = Math::Prime::Util::PrimeIterator->new($b);
+  my $it = prime_iterator_object($b);
   push @p, $it->iterate while $it->value <= $e;
   return \@p;
 }

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