[pkgsrc/trunk]: pkgsrc/math/p5-Math-Prime-Util Update to 0.73

[wen <wen%pkgsrc.org@localhost>]

details:   https://anonhg.NetBSD.org/pkgsrc/rev/1aabd2cb9256
branches:  trunk
changeset: 317636:1aabd2cb9256
user:      wen <wen%pkgsrc.org@localhost>
date:      Sat Jan 12 12:50:10 2019 +0000

description:
Update to 0.73

Upstream changes:
0.73 2018-11-15

    [ADDED]

    - inverse_totient(n)              the image of euler_phi(n)

    [FIXES]

    - Try to work around 32-bit platforms in semiprime approximations.
      Cannot reproduce on any of my 32-bit test platforms.

    - Fix RT 127605, memory use in for... iterators.


0.72 2018-11-08

    [ADDED]

    - nth_semiprime(n)                the nth semiprime
    - nth_semiprime_approx(n)         fast approximate nth semiprime
    - semiprime_count_approx(n)       fast approximate semiprime count
    - semi_primes                     as primes but for semiprimes
    - forsetproduct {...} \@a,\@b,... Cartesian product of list refs

    [FIXES]

    - Some platforms are extremely slow for is_pillai.  Speed up tests.

    - Ensure random_factored_integer factor list is sorted min->max.

    - forcomposites didn't check lastfor on every callback.

    - Sun's compilers, in a valid interpretation of the code, generated
      divide by zero code for pillai testing.

    [FUNCTIONALITY AND PERFORMANCE]

    - chebyshev_theta and chebyshev_psi redone and uses a table.
      Large inputs are significantly faster.

    - Convert some FP functions to use quadmath if possible.  Without
      quadmath there should be no change.  With quadmath functions like
      LogarithmicIntegral and LambertW will be slower but more accurate.

    - semiprime_count for non-trivial inputs uses a segmented sieve and
      precalculates primes for larger values so can run 2-3x faster.

    - forsemiprimes uses a sieve so large ranges are much faster.

    - ranged moebius more efficient for small intervals.

    - Thanks to GRAY for his module Set::Product which has clean and
      clever XS code, which I used to improve my code.

    - forfactored uses multicall.  Up to 2x faster.

    - forperm, forcomb, forderange uses multicall.  2-3x faster.

    - Frobenius-Khashin algorithm changed from 2013 version to 2016/2018.

diffstat:

 math/p5-Math-Prime-Util/Makefile |   4 ++--
 math/p5-Math-Prime-Util/distinfo |  10 +++++-----
 2 files changed, 7 insertions(+), 7 deletions(-)

diffs (27 lines):

diff -r 5430ca1e1147 -r 1aabd2cb9256 math/p5-Math-Prime-Util/Makefile
--- a/math/p5-Math-Prime-Util/Makefile  Sat Jan 12 12:26:15 2019 +0000
+++ b/math/p5-Math-Prime-Util/Makefile  Sat Jan 12 12:50:10 2019 +0000
@@ -1,6 +1,6 @@
-# $NetBSD: Makefile,v 1.23 2018/09/02 07:29:32 wiz Exp $
+# $NetBSD: Makefile,v 1.24 2019/01/12 12:50:10 wen Exp $
 
-DISTNAME=      Math-Prime-Util-0.71
+DISTNAME=      Math-Prime-Util-0.73
 PKGNAME=       p5-${DISTNAME}
 CATEGORIES=    math perl5
 MASTER_SITES=  ${MASTER_SITE_PERL_CPAN:=Math/}
diff -r 5430ca1e1147 -r 1aabd2cb9256 math/p5-Math-Prime-Util/distinfo
--- a/math/p5-Math-Prime-Util/distinfo  Sat Jan 12 12:26:15 2019 +0000
+++ b/math/p5-Math-Prime-Util/distinfo  Sat Jan 12 12:50:10 2019 +0000
@@ -1,6 +1,6 @@
-$NetBSD: distinfo,v 1.18 2018/09/02 07:29:32 wiz Exp $
+$NetBSD: distinfo,v 1.19 2019/01/12 12:50:10 wen Exp $
 
-SHA1 (Math-Prime-Util-0.71.tar.gz) = 272fc5cdd4065b8b845ba176c37f8441747bd6c9
-RMD160 (Math-Prime-Util-0.71.tar.gz) = daf4ed5b4b7ab274cd01d91de507f6d3743499ab
-SHA512 (Math-Prime-Util-0.71.tar.gz) = a7ad135227672af78917e6d4adf782eef1d092801436d13268f21fa838529a7e3ef99bcdc177c490d954d56c96a99cb3ab803a5e3a824b29dc1024d0289bf6c8
-Size (Math-Prime-Util-0.71.tar.gz) = 599678 bytes
+SHA1 (Math-Prime-Util-0.73.tar.gz) = d7a74202d9f449f762470f82630db8cac9ba7420
+RMD160 (Math-Prime-Util-0.73.tar.gz) = acd1e11eb7df7568eae227c5e7172c95755694eb
+SHA512 (Math-Prime-Util-0.73.tar.gz) = a772ba116b51c906e1f6d25d8bc1cbda93c01220998f9606aabc767fe8d0973b71a86f027b3a2a6cc75de026813a70ea825532f2070ecfadbe697834a025404e
+Size (Math-Prime-Util-0.73.tar.gz) = 617032 bytes