diff options
author | wen <wen@pkgsrc.org> | 2016-11-28 12:36:05 +0000 |
---|---|---|
committer | wen <wen@pkgsrc.org> | 2016-11-28 12:36:05 +0000 |
commit | c98da48c73b90cad675a29cf4645d93f2651bcb1 (patch) | |
tree | 858fcec6fce2b3a8daefa6647d29064d660c929d /math/p5-Math-Prime-Util | |
parent | 92af3c04671def07ad144c1bcffe08595e795607 (diff) | |
download | pkgsrc-c98da48c73b90cad675a29cf4645d93f2651bcb1.tar.gz |
Update to 0.60
Upstream changes:
0.60 2016-10-09
[ADDED]
- vecfirstidx { expr } @n returns first index with expr true
[FUNCTIONALITY AND PERFORMANCE]
- Expanded and modified prime count sparse tables. Prime counts from 30k
to 90M are 1.2x to 2.5x faster. It has no appreciable effect on the
speed of prime counts larger than this size.
- fromdigits works with bigint first arg, no need to stringify.
Slightly faster for bigints, but slower than desired.
- Various speedups and changes for fromdigits, todigits, todigitstring.
- vecprod in PP for negative high-bit would return double not bigint.
- Lah numbers added as Stirling numbers of the third kind. They've been
in the GMP code for almost 2 years now. Also for big results, directly
call the GMP code and objectify the result.
- Small performance change to AKS (r,s) selection tuning.
- On x86_64, use Montgomery math for Pollard/Brent Rho. This speeds up
factoring significantly for large native inputs (e.g. 10-20 digits).
- Use new GMP zeta and riemannr functions if possible, making some of
our operations much faster without Math::MPFR.
- print_primes with large args will try GMP sieve for big speedup. E.g.
use bigint; print_primes(2e19,2e19+1e7);
goes from 37 minutes to 7 seconds. This also removes a mistaken blank
line at the end for certain ranges.
- PP primes tries to use GMP. Only for calls from other PP code.
- Slightly more accuracy in native ExponentialIntegral.
- Slightly more accuracy in twin_prime_count_approx.
- nth_twin_prime_approx was incorrect over 1e10 and over 2e16 would
infinite loop due to Perl double conversion.
- nth_twin_prime_approx a little faster and more accurate.
Diffstat (limited to 'math/p5-Math-Prime-Util')
-rw-r--r-- | math/p5-Math-Prime-Util/Makefile | 4 | ||||
-rw-r--r-- | math/p5-Math-Prime-Util/distinfo | 10 |
2 files changed, 7 insertions, 7 deletions
diff --git a/math/p5-Math-Prime-Util/Makefile b/math/p5-Math-Prime-Util/Makefile index b4ef529d379..4e7724275a6 100644 --- a/math/p5-Math-Prime-Util/Makefile +++ b/math/p5-Math-Prime-Util/Makefile @@ -1,6 +1,6 @@ -# $NetBSD: Makefile,v 1.13 2016/08/09 00:14:33 wen Exp $ +# $NetBSD: Makefile,v 1.14 2016/11/28 12:36:05 wen Exp $ -DISTNAME= Math-Prime-Util-0.59 +DISTNAME= Math-Prime-Util-0.60 PKGNAME= p5-${DISTNAME} CATEGORIES= math perl5 MASTER_SITES= ${MASTER_SITE_PERL_CPAN:=Math/} diff --git a/math/p5-Math-Prime-Util/distinfo b/math/p5-Math-Prime-Util/distinfo index 489250c78f4..9236fd164ca 100644 --- a/math/p5-Math-Prime-Util/distinfo +++ b/math/p5-Math-Prime-Util/distinfo @@ -1,6 +1,6 @@ -$NetBSD: distinfo,v 1.10 2016/08/09 00:14:33 wen Exp $ +$NetBSD: distinfo,v 1.11 2016/11/28 12:36:05 wen Exp $ -SHA1 (Math-Prime-Util-0.59.tar.gz) = e3293c13f197930a853d1f26f25972b4cf59eb01 -RMD160 (Math-Prime-Util-0.59.tar.gz) = 1f6c570d0c7b252274b953f506997aaa67203e69 -SHA512 (Math-Prime-Util-0.59.tar.gz) = 63dcf9658404c322b86b340db9aca237cab22954e44adfe1992c93c768d35dc191159ae268c27db8cd15242e2c54fd0e28f3f7813d1a8f8b5b9bb3d8f5931652 -Size (Math-Prime-Util-0.59.tar.gz) = 525349 bytes +SHA1 (Math-Prime-Util-0.60.tar.gz) = 8567f0193d4ffc96df28e66af435fdfe6f0ab7c5 +RMD160 (Math-Prime-Util-0.60.tar.gz) = ddbf0b8cac76cb919dc83fb05f8c8c270f2fedc0 +SHA512 (Math-Prime-Util-0.60.tar.gz) = 390121193b045fac5cb14225a785e06969e7851d86ab253cfab5cd77b50b172a5cde7747243830e5f513912a1b3519116716b668844d112af7237e7ab2c230c9 +Size (Math-Prime-Util-0.60.tar.gz) = 535032 bytes |