Update to 0.14

Upstream changes:
0.14  29 November 2012

    - Compilation and test issues:
          Fix compilation on NetBSD
          Try to fix compilation on Win32 + MSVC
          Speed up some testing, helps a lot with Cygwin on slow machines
          Speed up a lot of slow PP areas, especially used by test suite

    - XS AKS extended from half-word to full-word.

    - Add functions:
           jordan_totient          generalization of Euler Totient
           divisor_sum             run coderef for every divisor

    - Allow environment variables MPU_NO_XS and MPU_NO_GMP to turn off XS and
      GMP support respectively if they are defined and equal to 1.

    - Lehmer prime count for Pure Perl code, including use in nth_prime.
         prime count 10^9 using sieve:
            71.9s   PP sieve
             0.47s  XS sieve
         prime count 10^9 using Lehmer:
             0.70s  PP lehmer
             0.03s  XS lehmer

    - Moved bignum Zeta and R to separate file, only loaded when needed.
      Helpful to get the big rarely-used tables out of the main loading.

    - Quote arguments to Math::Big{Int,Float} in a few places it wasn't.
      Math::Big* coerces the input to a signed value if it isn't a string,
      which causes us all sorts of grief.

0.13  19 November 2012

    - Fix an issue with prime count, and make prime count available as a
      standalone program using primesieve.

0.12  17 November 2012

    - Add bin/primes.pl and bin/factor.pl

    - Add functions:
           primorial               product of primes <= n
           pn_primorial            product of first n primes
           prime_set_config        set config options
           RiemannZeta             export and make accurate for small reals
           is_provable_prime       prove primes after BPSW
           is_aks_prime            prove prime via AKS

    - Add 'assume_rh' configuration option (default: false) which can be set
      to allow functions to assume the Riemann Hypothesis.

    - Use the Schoenfeld bound for Pi(x) (x large) if assume_rh is true.

    - valgrind testing

    - Use long doubles for math functions.

    - Some fixes and speedups for ranged primes().

    - In the PP code, use 2 MR bases for more numbers when possible.

    - Fixup of racing SQUFOF, and switch to use it in factor().

    - Complete rewrite of XS p-1 factor routine, includes second stage.

    - bug fix for prime_count on edge of cache.

    - prime_count will use Lehmer prime counting algorithm for largish
      sizes (above 4 million).  This is MUCH faster than sieving.

    - nth_prime now uses the fast Lehmer prime count below the lower limit,
      then sieves up from there.  This makes a big speed difference for inputs
      over 10^6 or so -- over 100x faster for 10^9 and up.

2 files changed, 12 insertions, 6 deletions

diff --git a/math/p5-Math-Prime-Util/Makefile b/math/p5-Math-Prime-Util/Makefile
index c55f1c3e15d..c471e4ca9f1 100644
--- a/math/p5-Math-Prime-Util/Makefile
+++ b/math/p5-Math-Prime-Util/Makefile
@@ -1,6 +1,6 @@
-# $NetBSD: Makefile,v 1.1 2012/10/19 07:30:32 sno Exp $
+# $NetBSD: Makefile,v 1.2 2012/11/30 08:24:50 wen Exp $
 
-DISTNAME=	Math-Prime-Util-0.11
+DISTNAME=	Math-Prime-Util-0.14
 PKGNAME=	p5-${DISTNAME}
 CATEGORIES=	math perl5
 MASTER_SITES=	${MASTER_SITE_PERL_CPAN:=Math/}
@@ -10,6 +10,12 @@ HOMEPAGE=	http://search.cpan.org/dist/Math-Prime-Util/
 COMMENT=	Perl5 utilities related to prime numbers
 LICENSE=	${PERL5_LICENSE}
 
+SUBST_CLASSES+=		perl
+SUBST_STAGE.perl=	post-patch
+SUBST_MESSAGE.perl=	Fixing path to perl
+SUBST_FILES.perl+=	bin/factor.pl bin/primes.pl
+SUBST_SED.perl=		-e "s|/usr/bin/env perl|${PERL5}|"
+
 USE_LANGUAGES+=	c
 
 PERL5_PACKLIST=		auto/Math/Prime/Util/.packlist
diff --git a/math/p5-Math-Prime-Util/distinfo b/math/p5-Math-Prime-Util/distinfo
index 24a02137f8a..c6228362cd1 100644
--- a/math/p5-Math-Prime-Util/distinfo
+++ b/math/p5-Math-Prime-Util/distinfo
@@ -1,5 +1,5 @@
-$NetBSD: distinfo,v 1.1 2012/10/19 07:30:32 sno Exp $
+$NetBSD: distinfo,v 1.2 2012/11/30 08:24:50 wen Exp $
 
-SHA1 (Math-Prime-Util-0.11.tar.gz) = 6367b8438eddc0cfde6f9129a64c75f6a4f43b98
-RMD160 (Math-Prime-Util-0.11.tar.gz) = 3f861e4ec28d8b23d4d0da7e4df76ac20ba5aeda
-Size (Math-Prime-Util-0.11.tar.gz) = 119319 bytes
+SHA1 (Math-Prime-Util-0.14.tar.gz) = a187e9e2e4e829e30ae11eb2ebea18e9d5cc66df
+RMD160 (Math-Prime-Util-0.14.tar.gz) = 1d575765c29c0ba675ad9f856119a7320c14b604
+Size (Math-Prime-Util-0.14.tar.gz) = 174944 bytes