rng-utils

RNG within an IORef for convenient concurrent use

https://bitbucket.org/soostone/rng-utils

Version on this page:	0.3.0
LTS Haskell 21.23:	0.3.1
Stackage Nightly 2023-12-05:	0.3.1
Latest on Hackage:	0.3.1

See all snapshots rng-utils appears in

BSD-3-Clause licensed by Ozgun Ataman, Snap Framework Authors

Maintained by ozgun.ataman@soostone.com

This version can be pinned in stack with:rng-utils-0.3.0@sha256:a5a0075b05b92ea1b210064a48da03a55dc200e20c1b0ac539ef61d52d248aea,1564

Module documentation for 0.3.0

Data
- Data.RNG

Depends on 3 packages(full list with versions):

base, bytestring, random

rng-utils

This simple utility wraps an IORef around random for the common use case of initializing an RNG once and using it in various places within an IO context. The haddocks should otherwise be self explanatory.

Any comments, improvement opportunities, feedback most welcome.

Upgrade Notes

In version 0.3.0, rng-utils switched from targeting mwc-random to random. random sees more use in the Haskell ecosystem, has fewer dependencies and the performance difference was negligible in comparison to the concurrency mechanism. If you feel strongly that mwc-random should be part of the library, let us know in an issue and we can look into supporting multiple backends.

Changes

0.3.0

Switch to IORef instead of MVar. This should provide better performance under high contention.
Swap out internal RNG for System.Random. It turns out that the gains to be had by using mwc-random are outshadowed by the mutation inherent to this library, so it is preferable to leverage System.Random which appears to be more commonly used and has better coverage of types to generate.
Add rngRIO and rngIO convenience functions for generating values.