---
- branch: MAIN
  date: Tue Sep 26 14:37:13 UTC 2017
  files:
  - new: '1.18'
    old: '1.17'
    path: pkgsrc/math/p5-Math-Prime-Util/Makefile
    pathrev: pkgsrc/math/p5-Math-Prime-Util/Makefile@1.18
    type: modified
  - new: '1.14'
    old: '1.13'
    path: pkgsrc/math/p5-Math-Prime-Util/distinfo
    pathrev: pkgsrc/math/p5-Math-Prime-Util/distinfo@1.14
    type: modified
  id: 20170926T143713Z.6a737b06f8e65bea0f94963b6f106a6d05f194f8
  log: |
    p5-Math-Prime-Util: update to 0.67.

    0.67 2017-09-23

        [ADDED]

        - lastfor                         stops forprimes (etc.) iterations
        - is_square(n)                    returns 1 if n is a perfect square
        - is_polygonal(n,k)               returns 1 if n is a k-gonal number

        [FUNCTIONALITY AND PERFORMANCE]

        - shuffle prototype is @ instead of ;@, so matches List::Util.

        - On Perl 5.8 and earlier we will call PP instead of trying
          direct-to-GMP.  Works around a bug in XS trying to turn the
          result into an object where 5.8.7 and earlier gets lost.

        - We create more const integers, which speeds up common uses of
          permutations.

        - CSPRNG now stores context per-thread rather than using a single
          mutex-protected context.  This speeds up anything using random
          numbers a fair amount, especially with threaded Perls.

        - With the above two optimizations, randperm(144) is 2.5x faster.

        - threading test has threaded srand/irand test added back in, showing
          context is per-thread.  Each thread gets its own sequence and calls
          to srand/csrand and using randomness doesn't impact other threads.
  module: pkgsrc
  subject: 'CVS commit: pkgsrc/math/p5-Math-Prime-Util'
  unixtime: '1506436633'
  user: wiz