mwc-random
mwc-random copied to clipboard
haskell
A very fast Haskell library for generating high quality pseudo-random numbers.
I am in the middle of implementing Kachitvichyanukul, V. and Schmeiser, B. W. (1988) but the inverse method (in the current PR) could be a first step. What do you...
Hey @Shimuuar I am working on some changes in the `random-1.3` stateful interface in https://github.com/haskell/random/pull/153 Could you take a look and see if you find it sensible. Addition of `modifyGen`...
This PR takes care of some minor issues that I've ran into that are a result of either newer ghc or newer dependency Also usage of `unsafeSTToPrim` was uncalled for,...
Is there a policy regarding whether two versions of the library will generate the same pseudo-random values given the same seed, or any other way to tell whether switching from...
This is probably not meargable as-is, because it's not in the spirit of the current API, but 'foldMUniforms' could be used to implement a new fold-like function in the class...
I wrote a tiny utility for performing a Fisher–Yates shuffle [here](https://github.com/Boarders/perfect-vector-shuffle). At first I wrote this using System.Random and StdGen but was informed this was supposedly extremely slow. I then...
Hello, many times I use `mwc-random` to perform a calculation repeatedly, and then I collect the results in form of a list (or vector). Is there a way to parallelize...
Using a state vector containing the information of 4 seeds, we could provide a new API where we get 4 random numbers at a time (using SIMD instructions for example)....
I found a different (simpler) version of MWC256 that George Marsaglia himself posted on the internet. It has the same 2^8222 period and Marsaglia vetted the quality of the PRNG...
Currently library allows to generate Poisson and binomial random variate using condensed tables algorithm. It is very fast but require building lookup table which is costly. It makes this algorithm...
