[BACK]Return to distinfo CVS log [TXT][DIR] Up to [cvs.NetBSD.org] / pkgsrc / math / p5-Math-Prime-Util

File: [cvs.NetBSD.org] / pkgsrc / math / p5-Math-Prime-Util / distinfo (download)

Revision 1.16, Mon Nov 13 15:22:31 2017 UTC (22 months ago) by wiz
Branch: MAIN
Changes since 1.15: +5 -5 lines

p5-Math-Prime-Util: update to 0.69.

0.69 2017-11-08

    [ADDED]

    - is_totient(n)                   true if euler_phi(x) == n for some x

    [FUNCTIONALITY AND PERFORMANCE]

    - is_square_free uses abs(n), like Pari and moebius.

    - is_primitive_root could be wrong with even n on some platforms.

    - euler_phi and moebius with negative range inputs weren't consistent.

    - factorialmod given a large n and m where m was a composite with
      large square factors was incorrect.  Fixed.

    - numtoperm will accept negative k values (k is always mod n!)

    - Split XS mapping of many primality tests.  Makes more sense and
      improves performance for some calls.

    - Split final test in PP cluster sieve.

    - Support some new Math::Prime::Util::GMP functions from 0.47.

    - C spigot Pi is 30-60% faster on x86_64 by using 32-bit types.

    - Reworked some factoring code.

    - Remove ISAAC (Perl and C) since we use ChaCha.

    - Each thread allocs a new const array again instead of sharing.

$NetBSD: distinfo,v 1.16 2017/11/13 15:22:31 wiz Exp $

SHA1 (Math-Prime-Util-0.69.tar.gz) = 61bcc8f871fd43154cc09a8a853d2516e877fb0f
RMD160 (Math-Prime-Util-0.69.tar.gz) = 3150689afb090de221699c502fb3d445d8398e33
SHA512 (Math-Prime-Util-0.69.tar.gz) = 07780f28398b6e2cfbc1ccaa2cce2d3b32ea000ec9fc3909d9650c0c9dc6f24c0982de8ce52bc3dcfc525e10ad2d5a687a1833a6fab82008345fdba78fbfdfeb
Size (Math-Prime-Util-0.69.tar.gz) = 593915 bytes