CVS log for pkgsrc/devel/hs-splitmix/buildlink3.mk

Up to [cvs.NetBSD.org] / pkgsrc / devel / hs-splitmix

Request diff between arbitrary revisions

Keyword substitution: kv
Default branch: MAIN

recursive revbump after patching lang/ghc910

Bump all Haskell packages after switching the default compiler.

devel/hs-splitmix: update to splitmix-0.1.1

# 0.1.1

- Drop support for GHCs prior 8.6.5
- Support GHC-9.12

Recursive revbump after changing the default Haskell compiler

Revbump all Haskell after updating lang/ghc96

devel/hs-splitmix: Update to 0.1.0.5

No change log is provided by the upstream.

Bump Haskell packages after updating lang/ghc94

revbump all the Haskell packages after modifying the runtime system of lang/ghc94

Bump all Haskell packages after enabling "split sections" in mk/haskell.mk

revbump after changing the default Haskell compiler

Update to splitmix-0.1.0.4

0.1.0.4
    Add TestU01 test-suite

Bump packages that depends on GHC

*: Bump PKGREVISION for ghc-9.0.1

Update to splitmix-0.1.0.3

0.1.0.3
* Fix oops bugs in 0.1.0.2
  - It's lowercase windows.h. I blame Microsoft docs for using capital
    case Windows.h in the
    docs. https://docs.microsoft.com/en-us/windows/win32/api/processthreadsapi/nf-processthreadsapi-getprocessid
  - accidental shiftL vs shiftR mixup for 32-bit generator
    initialization. Doesn't affect Linux.

0.1.0.2
* Drop time dependency in favour of handcoded initialization
  - On Unix platforms we use /dev/urandom if it exists, otherwise use
    gettimeofday, clock and getpid.
  - On Windows we use GetCurrentProcessID, GetCurrentThreadId(),
    GetTickCount, GetSystemTime and QueryPerformanceCounter.
  - On GHCJS use Math.random()
  - Using time is a fallback option (e.g. for Hugs).

0.1.0.1
* Add INLINEABLE pragmas to bitmaskWithRejection* functions
* Support GHC-9.0

0.1
* Drop random dependency
  unconditionally. https://github.com/phadej/splitmix/issues/34

0.0.5
* Add nextInteger
* Use smaller range in bitmaskWithRejection32 and 64, when upper bound
  is 2^n - 1. This changes generated values when they were on the
  boundary.

0.0.4
* Add bitmaskWithRejection32' and bitmaskWithRejection64' which
  generate numbers in closed range [0, n]. Unticked variants generate
  in closed-open range [0, n).

Import splitmix-0.0.3

Pure Haskell implementation of SplitMix described in

Guy L. Steele, Jr., Doug Lea, and Christine H. Flood. 2014. Fast
splittable pseudorandom number generators. In Proceedings of the 2014
ACM International Conference on Object Oriented Programming Systems
Languages & Applications (OOPSLA '14). ACM, New York, NY, USA,
453-472. DOI: https://doi.org/10.1145/2660193.2660195

The paper describes a new algorithm SplitMix for splittable
pseudorandom number generator that is quite fast: 9 64 bit
arithmetic/logical operations per 64 bits generated.

SplitMix is tested with two standard statistical test suites
(DieHarder and TestU01, this implementation only using the former) and
it appears to be adequate for "everyday" use, such as Monte Carlo
algorithms and randomized data structures where speed is important.

In particular, it should not be used for cryptographic or security
applications, because generated sequences of pseudorandom values are
too predictable (the mixing functions are easily inverted, and two
successive outputs suffice to reconstruct the internal state).