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 p5-Math-Prime-Util: update to ...



details:   https://anonhg.NetBSD.org/pkgsrc/rev/ed922721df86
branches:  trunk
changeset: 370733:ed922721df86
user:      wiz <wiz%pkgsrc.org@localhost>
date:      Mon Oct 23 13:01:48 2017 +0000

description:
p5-Math-Prime-Util: update to 0.68.

0.68 2017-10-19

    [API Changes]

    - forcomb with one argument iterates over the power set, so k=0..n
      instead of k=n.  The previous behavior was undocumented.  The new
      behavior matches Pari/GP (forsubset) and Perl6 (combinations).

    [ADDED]

    - factorialmod(n,m)               n! mod m calculated efficiently
    - is_fundamental(d)               true if d a fundamental discriminant

    [FUNCTIONALITY AND PERFORMANCE]

    - Unknown bigint classes no longer return two values after objectify.
      Thanks to Daniel ?uteu for finding this.

    - Using lastfor inside a formultiperm works correctly now.

    - randperm a little faster for k < n cases, and can handle big n
      values without running out of memory as long as k << n.
      E.g. 5000 random native ints without dups:  @r = randperm(~0,5000);

    - forpart with primes pulls min/max values in for a small speedup.

    - forderange 10-20% faster.

    - hammingweight for bigints 3-8x faster.

    - Add Math::GMPq and Math::AnyNum as possible bigint classes.  Inputs
      of these types will be relied on to stringify correctly, and if this
      results in an integer string, to intify correctly.  This should give
      a large speedup for these types.

    - Factoring native integers is 1.2x - 2x faster.  This is due to a
      number of changes.

    - Add Lehman factoring core.  Since this is not exported or used by
      default, the API for factor_lehman may change.

    - All new Montgomery math.  Uses mulredc asm from Ben Buhrow.
      Faster and smaller.  Most primality and factoring code 10% faster.

    - Speedup for factoring by running more Pollard-Rho-Brent, revising
      SQUFOF, updating HOLF, updating recipe.

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 3b52822a7c72 -r ed922721df86 math/p5-Math-Prime-Util/Makefile
--- a/math/p5-Math-Prime-Util/Makefile  Mon Oct 23 12:58:59 2017 +0000
+++ b/math/p5-Math-Prime-Util/Makefile  Mon Oct 23 13:01:48 2017 +0000
@@ -1,6 +1,6 @@
-# $NetBSD: Makefile,v 1.18 2017/09/26 14:37:13 wiz Exp $
+# $NetBSD: Makefile,v 1.19 2017/10/23 13:01:48 wiz Exp $
 
-DISTNAME=      Math-Prime-Util-0.67
+DISTNAME=      Math-Prime-Util-0.68
 PKGNAME=       p5-${DISTNAME}
 CATEGORIES=    math perl5
 MASTER_SITES=  ${MASTER_SITE_PERL_CPAN:=Math/}
diff -r 3b52822a7c72 -r ed922721df86 math/p5-Math-Prime-Util/distinfo
--- a/math/p5-Math-Prime-Util/distinfo  Mon Oct 23 12:58:59 2017 +0000
+++ b/math/p5-Math-Prime-Util/distinfo  Mon Oct 23 13:01:48 2017 +0000
@@ -1,6 +1,6 @@
-$NetBSD: distinfo,v 1.14 2017/09/26 14:37:13 wiz Exp $
+$NetBSD: distinfo,v 1.15 2017/10/23 13:01:48 wiz Exp $
 
-SHA1 (Math-Prime-Util-0.67.tar.gz) = 7f58a95832ff78e463d2856327fbc6cd29fef6fd
-RMD160 (Math-Prime-Util-0.67.tar.gz) = 8f9ea466dd1effe4e9564461cc27fac0e1d46025
-SHA512 (Math-Prime-Util-0.67.tar.gz) = 0be38e6edb2d878103e0570eeb40430527b9389676d7e861889f42b235668be67c19019fe6c756087100110fb8c40c87b0440ea5d04079c8d14db38448c9e39d
-Size (Math-Prime-Util-0.67.tar.gz) = 588847 bytes
+SHA1 (Math-Prime-Util-0.68.tar.gz) = 27c8efbdaaa7b89dea87fe31deab3be36f02b8cf
+RMD160 (Math-Prime-Util-0.68.tar.gz) = b7d844fdbd1cac14ce23946ff6a2f3731f60a83b
+SHA512 (Math-Prime-Util-0.68.tar.gz) = 6373537d10939ffa4c2542e64da575b1da73652dda26df6108e703faf148c0edec5add016d5c53cbdcd1947fe62d9bdeee752ee9699348f7092056c5c322a238
+Size (Math-Prime-Util-0.68.tar.gz) = 593993 bytes



Home | Main Index | Thread Index | Old Index