pkgsrc-Changes-HG archive
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index][Old Index]
[pkgsrc/trunk]: pkgsrc/math/p5-Math-Prime-Util Update to 0.59
details: https://anonhg.NetBSD.org/pkgsrc/rev/4a0fff6c77fe
branches: trunk
changeset: 350907:4a0fff6c77fe
user: wen <wen%pkgsrc.org@localhost>
date: Tue Aug 09 00:14:33 2016 +0000
description:
Update to 0.59
Upstream changes:
0.59 2016-08-03
[ADDED]
- is_prime_power Returns k if n=p^k for p a prime.
- logint(n,b) Integer logarithm. Largest e s.t. b^e <= n.
- rootint(n,k) Integer k-th root.
- ramanujan_sum(k,n) Ramanujan's sum
[FUNCTIONALITY AND PERFORMANCE]
- Fixes for quadmath:
+ Fix "infinity" in t/11-primes.t.
+ Fix native Pi to use quads.
+ Trim some threading tests.
- Fix fromdigits memory error with large string.
- Remove 3 threading tests that were causing issues with Perl -DDEBUGGING.
- foroddcomposites with some odd start values could index incorrectly.
- is_primitive_root(1,0) returns 0 instead of fp exception.
- mertens() uses a little less memory.
- 2x speedup for znlog with bigint values.
- is_pseudoprime() and is_euler_pseudoprime() use Montgomery math so are
much faster. They seem to be ~5% faster than Miller-Rabin now.
- is_catalan_pseudoprime 1.1x to 1.4x faster.
- is_perrin_pseudoprime over 10x faster.
Uses Adams/Shanks doubling and Montgomery math.
Single core, odd composites: ~8M range/s.
- Add restricted Perrin pseudoprimes using an optional argument.
- Add bloom filters to reject non-perfect cubes, fifths, and sevenths.
is_power about 2-3x faster for native inputs.
- forcomposites / foroddcomposites about 1.2x faster past 64-bit.
- exp_mangoldt rewritten to use is_prime_power.
- Integer root code rewritten and now exported.
- We've been hacking around the problem of older Perls autovivifying
functions at compile time. This makes functions that don't exist
return true when asked if they're defined, which causes us distress.
Store the available GMP functions before loading the PP code.
XS code knows MPU::GMP version and calls as appropriate. This works
around the auto-vivication, and lets us choose to call the GMP
function based on version instead of just existence.
E.g. GMP's is_power was added in 0.19, but didn't support negative
powers until 0.28.
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 0845cdcb8b37 -r 4a0fff6c77fe math/p5-Math-Prime-Util/Makefile
--- a/math/p5-Math-Prime-Util/Makefile Tue Aug 09 00:11:11 2016 +0000
+++ b/math/p5-Math-Prime-Util/Makefile Tue Aug 09 00:14:33 2016 +0000
@@ -1,6 +1,6 @@
-# $NetBSD: Makefile,v 1.12 2016/07/26 06:50:24 wen Exp $
+# $NetBSD: Makefile,v 1.13 2016/08/09 00:14:33 wen Exp $
-DISTNAME= Math-Prime-Util-0.58
+DISTNAME= Math-Prime-Util-0.59
PKGNAME= p5-${DISTNAME}
CATEGORIES= math perl5
MASTER_SITES= ${MASTER_SITE_PERL_CPAN:=Math/}
diff -r 0845cdcb8b37 -r 4a0fff6c77fe math/p5-Math-Prime-Util/distinfo
--- a/math/p5-Math-Prime-Util/distinfo Tue Aug 09 00:11:11 2016 +0000
+++ b/math/p5-Math-Prime-Util/distinfo Tue Aug 09 00:14:33 2016 +0000
@@ -1,6 +1,6 @@
-$NetBSD: distinfo,v 1.9 2016/07/26 06:50:24 wen Exp $
+$NetBSD: distinfo,v 1.10 2016/08/09 00:14:33 wen Exp $
-SHA1 (Math-Prime-Util-0.58.tar.gz) = 75124da5144d4bca88dabf28d26e66154aa5cdad
-RMD160 (Math-Prime-Util-0.58.tar.gz) = 35da58a27b3410efc39bef8a47c8b8a3b4eb3757
-SHA512 (Math-Prime-Util-0.58.tar.gz) = c47b7bcf5c4d1149e425d47304fc9e7974663c4598d9dc5acce8b34d6f3d46941669ec89a65b18efd48a258bea195a8778ca9aa0572949c7886bb992f585b6a9
-Size (Math-Prime-Util-0.58.tar.gz) = 515967 bytes
+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
Home |
Main Index |
Thread Index |
Old Index