Pure Random Generator
genByteString :: RandomGen g => Int -> g -> (ByteString, g)
In favor of `uniformByteString`
Generates a ByteString of the specified size using a pure pseudo-random
number generator. See uniformByteStringM for the monadic version.
====Examples
>>> import System.Random
>>> import Data.ByteString
>>> let pureGen = mkStdGen 137
>>> :seti -Wno-deprecations
>>> unpack . fst . genByteString 10 $ pureGen
[51,123,251,37,49,167,90,109,1,4]
getStdGen :: MonadIO m => m StdGen
Gets the global pseudo-random number generator. Extracts the contents of
globalStdGen
getStdRandom :: MonadIO m => (StdGen -> (a, StdGen)) -> m a
Uses the supplied function to get a value from the current global
random generator, and updates the global generator with the new generator
returned by the function. For example, rollDice produces a pseudo-random integer
between 1 and 6:
>>> rollDice = getStdRandom (randomR (1, 6))
>>> replicateM 10 (rollDice :: IO Int)
[1,1,1,4,5,6,1,2,2,5]
This is an outdated function and it is recommended to switch to its
equivalent applyAtomicGen instead, possibly with the
globalStdGen if relying on the global state is
acceptable.
>>> import System.Random.Stateful
>>> rollDice = applyAtomicGen (uniformR (1, 6)) globalStdGen
>>> replicateM 10 (rollDice :: IO Int)
[2,1,1,5,4,3,6,6,3,2]
initStdGen :: MonadIO m => m StdGen
Initialize StdGen using system entropy (i.e. /dev/urandom) when it is
available, while falling back on using system time as the seed.
mkSeed :: forall g m. (SeedGen g, F.MonadFail m) => ByteArray -> m (Seed g)
Construct a `Seed` from a `ByteArray` of expected length. Whenever `ByteArray` does
not match the `SeedSize` specified by the pseudo-random generator, this function will
`F.fail`.
mkSeedFromByteString :: (SeedGen g, F.MonadFail m) => BS.ByteString -> m (Seed g)
Just like `mkSeed`, but uses `ByteString` as argument. Results in a memcopy of the seed.
mkStdGen :: Int -> StdGen
Constructs a StdGen deterministically from an `Int` seed. See `mkStdGen64` for a `Word64`
variant that is architecture agnostic.
Constructs a StdGen deterministically from a `Word64` seed.
The difference between `mkStdGen` is that `mkStdGen64` will work the same on 64-bit and
32-bit architectures, while the former can only use 32-bit of information for
initializing the psuedo-random number generator on 32-bit operating systems
newStdGen :: MonadIO m => m StdGen
Applies split to the current global pseudo-random generator
globalStdGen, updates it with one of the results,
and returns the other.
nonEmptyFromSeed :: forall g. SeedGen g => Seed g -> NonEmpty Word64
Convert a `Seed` to a list of 64bit words.
nonEmptyToSeed :: forall g. SeedGen g => NonEmpty Word64 -> Seed g
Construct a seed from a list of 64-bit words. At most `SeedSize` many bytes will be used.
randomIO :: (Random a, MonadIO m) => m a
A variant of randomM that uses the global
pseudo-random number generator globalStdGen.
>>> import Data.Int
>>> randomIO :: IO Int32
114794456
This function is equivalent to getStdRandom random and is included in
this interface for historical reasons and backwards compatibility. It is
recommended to use uniformM instead, possibly with
the globalStdGen if relying on the global state is
acceptable.
>>> import System.Random.Stateful
>>> uniformM globalStdGen :: IO Int32
-1768545016
randomRIO :: (Random a, MonadIO m) => (a, a) -> m a
A variant of randomRM that uses the global
pseudo-random number generator globalStdGen
>>> randomRIO (2020, 2100) :: IO Int
2028
Similar to randomIO, this function is equivalent to @getStdRandom
randomR@ and is included in this interface for historical reasons and
backwards compatibility. It is recommended to use
uniformRM instead, possibly with the
globalStdGen if relying on the global state is
acceptable.
>>> import System.Random.Stateful
>>> uniformRM (2020, 2100) globalStdGen :: IO Int
2044
seedGenTypeName :: forall g. SeedGen g => String
This is a function that shows the name of the generator type, which is useful for
error reporting.
seedSize :: forall g. SeedGen g => Int
Get the expected size of the `Seed` in number bytes
seedSizeProxy :: forall proxy g. SeedGen g => proxy g -> Int
Just like `seedSize`, except it accepts a proxy as an argument.
setStdGen :: MonadIO m => StdGen -> m ()
Sets the global pseudo-random number generator. Overwrites the contents of
globalStdGen
unSeed :: Seed g -> ByteArray
Unwrap the `Seed` and get the underlying `ByteArray`
Just like `unSeed`, but produced a `ByteString`. Results in a memcopy of the seed.
uniform :: (Uniform a, RandomGen g) => g -> (a, g)
Generates a value uniformly distributed over all possible values of that
type.
This is a pure version of uniformM.
====Examples
>>> import System.Random
>>> let pureGen = mkStdGen 137
>>> uniform pureGen :: (Bool, StdGen)
(True,StdGen {unStdGen = SMGen 11285859549637045894 7641485672361121627})
You can use type applications to disambiguate the type of the generated numbers:
>>> :seti -XTypeApplications
>>> uniform @Bool pureGen
(True,StdGen {unStdGen = SMGen 11285859549637045894 7641485672361121627})
uniformByteArray :: RandomGen g => Bool -> Int -> g -> (ByteArray, g)
Efficiently generates a sequence of pseudo-random bytes in a platform
independent manner.
BoolShould byte array be allocated in pinned or unpinned memory.
IntNumber of bytes to generate
gPure pseudo-random numer generator
uniformByteString :: RandomGen g => Int -> g -> (ByteString, g)
Generates a ByteString of the specified size using a pure pseudo-random
number generator. See uniformByteStringM for the monadic version.
====Examples
>>> import System.Random
>>> import Data.ByteString (unpack)
>>> let pureGen = mkStdGen 137
>>> unpack . fst $ uniformByteString 10 pureGen
[51,123,251,37,49,167,90,109,1,4]
uniformFillMutableByteArray :: RandomGen g => MutableByteArray s -> Int -> Int -> g -> ST s g
Fill in a slice of a mutable byte array with randomly generated bytes. This function
does not fail, instead it clamps the offset and number of bytes to generate into a valid
range.
Mutable array to fill with random bytes
IntOffset into a mutable array from the beginning in number of bytes. Offset will be
clamped into the range between 0 and the total size of the mutable array
IntNumber of randomly generated bytes to write into the array. This number will be
clamped between 0 and the total size of the array without the offset.
uniformList :: (Uniform a, RandomGen g) => Int -> g -> ([a], g)
Produce a list of the supplied length with elements generated uniformly.
See `uniformListM` for a stateful counterpart.
====Examples
>>> let gen = mkStdGen 2023
>>> import Data.Word (Word16)
>>> uniformList 5 gen :: ([Word16], StdGen)
([56342,15850,25292,14347,13919],StdGen {unStdGen = SMGen 6446154349414395371 1920468677557965761})
uniformListR :: (UniformRange a, RandomGen g) => Int -> (a, a) -> g -> ([a], g)
Produce a list of the supplied length with elements generated uniformly.
See `uniformListM` for a stateful counterpart.
====Examples
>>> let gen = mkStdGen 2023
>>> uniformListR 10 (20, 30) gen :: ([Int], StdGen)
([26,30,27,24,30,25,27,21,27,27],StdGen {unStdGen = SMGen 12965503083958398648 1920468677557965761})
uniformR :: (UniformRange a, RandomGen g) => (a, a) -> g -> (a, g)
Generates a value uniformly distributed over the provided range, which
is interpreted as inclusive in the lower and upper bound.
uniformR (1 :: Int, 4 :: Int) generates values uniformly from the set
\{1,2,3,4\}
The following law should hold to make the function always defined:
uniformR (a, b) = uniformR (b, a)
This is a pure version of uniformRM.
====Examples
>>> import System.Random
>>> let pureGen = mkStdGen 137
>>> uniformR (1 :: Int, 4 :: Int) pureGen
(4,StdGen {unStdGen = SMGen 11285859549637045894 7641485672361121627})
You can use type applications to disambiguate the type of the generated numbers:
>>> :seti -XTypeApplications
>>> uniformR @Int (1, 4) pureGen
(4,StdGen {unStdGen = SMGen 11285859549637045894 7641485672361121627})
uniformRs :: (UniformRange a, RandomGen g) => (a, a) -> g -> [a]
Produce an infinite list of pseudo-random values in a specified range. Same as
`uniforms`, integrates nicely with list fusion. There is no way to recover the final
generator, therefore either use `split` before calling `uniformRs` or use
`uniformListR` instead.
Similar to `randomRs`, except it relies on `UniformRange` type class instead of
`Random`.
====Examples
>>> let gen = mkStdGen 2023
>>> take 5 $ uniformRs (10, 100) gen :: [Int]
[32,86,21,57,39]
uniformShuffleList :: RandomGen g => [a] -> g -> ([a], g)
Shuffle elements of a list in a uniformly random order.
====Examples
>>> uniformShuffleList "ELVIS" $ mkStdGen 252
("LIVES",StdGen {unStdGen = SMGen 17676540583805057877 5302934877338729551})
uniforms :: (Uniform a, RandomGen g) => g -> [a]
Produce an infinite list of pseudo-random values. Integrates nicely with list
fusion. Naturally, there is no way to recover the final generator, therefore either use
`split` before calling `uniforms` or use `uniformList` instead.
Similar to `randoms`, except it relies on `Uniform` type class instead of `Random`
====Examples
>>> let gen = mkStdGen 2023
>>> import Data.Word (Word16)
>>> take 5 $ uniforms gen :: [Word16]
[56342,15850,25292,14347,13919]
withSeed :: SeedGen g => Seed g -> (g -> (a, g)) -> (a, Seed g)
Helper function that allows for operating directly on the `Seed`, while supplying a
function that uses the pseudo-random number generator that is constructed from that
`Seed`.
====Example
>>> :set -XTypeApplications
>>> import System.Random
>>> withSeed (nonEmptyToSeed (pure 2024) :: Seed StdGen) (uniform @Int)
(1039666877624726199,Seed [0xe9, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00])
withSeedFile :: (SeedGen g, MonadIO m) => FilePath -> (Seed g -> m (a, Seed g)) -> m a
Read the seed from a file and use it for constructing a pseudo-random number
generator. After supplied action has been applied to the constructed generator, the
resulting generator will be converted back to a seed and written to the same file.
withSeedM :: (SeedGen g, Functor f) => Seed g -> (g -> f (a, g)) -> f (a, Seed g)
Same as `withSeed`, except it is useful with monadic computation and frozen generators.
See `System.Random.Stateful.withSeedMutableGen` for a helper that also handles seeds
for mutable pseduo-random number generators.
A type class for data with a finite number of inhabitants. This type class
is used in the default implementation of Uniform.
Users are not supposed to write instances of Finite manually.
There is a default implementation in terms of Generic instead.
>>> :seti -XDeriveGeneric -XDeriveAnyClass
>>> import GHC.Generics (Generic)
>>> data MyBool = MyTrue | MyFalse deriving (Generic, Finite)
>>> data Action = Code MyBool | Eat (Maybe Bool) | Sleep deriving (Generic, Finite)
The class of types for which random values can be generated. Most
instances of `Random` will produce values that are uniformly distributed on the full
range, but for those types without a well-defined "full range" some sensible default
subrange will be selected.
Random exists primarily for backwards compatibility with version 1.1 of
this library. In new code, use the better specified Uniform and
UniformRange instead.
randomR :: RandomGen g => (a, a) -> g -> (a, g)
Takes a range (lo,hi) and a pseudo-random number generator
g, and returns a pseudo-random value uniformly distributed over the
closed interval [lo,hi], together with a new generator. It is unspecified
what happens if lo>hi, but usually the values will simply get swapped.
>>> let gen = mkStdGen 26
>>> fst $ randomR ('a', 'z') gen
'z'
>>> fst $ randomR ('a', 'z') gen
'z'
For continuous types there is no requirement that the values lo and hi are ever
produced, but they may be, depending on the implementation and the interval.
There is no requirement to follow the Ord instance and the concept of range can be
defined on per type basis. For example product types will treat their values
independently:
>>> fst $ randomR (('a', 5.0), ('z', 10.0)) $ mkStdGen 26
('z',5.22694980853051)
In case when a lawful range is desired `uniformR` should be used
instead.
random :: RandomGen g => g -> (a, g)
The same as randomR, but using a default range determined by the type:
randomRs :: RandomGen g => (a, a) -> g -> [a]
Plural variant of randomR, producing an infinite list of
pseudo-random values instead of returning a new generator.
randoms :: RandomGen g => g -> [a]
Plural variant of random, producing an infinite list of
pseudo-random values instead of returning a new generator.
RandomGen is an interface to pure pseudo-random number generators.
StdGen is the standard RandomGen instance provided by this library.
next :: g -> (Int, g)
No longer used
Returns an Int that is uniformly distributed over the range returned by
genRange (including both end points), and a new generator. Using next
is inefficient as all operations go via Integer. See
[here](https:/alexey.kuleshevi.chblog20191221random-benchmarks) for
more details. It is thus deprecated.
genWord8 :: g -> (Word8, g)
Returns a Word8 that is uniformly distributed over the entire Word8
range.
genWord16 :: g -> (Word16, g)
Returns a Word16 that is uniformly distributed over the entire Word16
range.
genWord32 :: g -> (Word32, g)
Returns a Word32 that is uniformly distributed over the entire Word32
range.
genWord64 :: g -> (Word64, g)
Returns a Word64 that is uniformly distributed over the entire Word64
range.
genWord32R :: Word32 -> g -> (Word32, g)
genWord32R upperBound g returns a Word32 that is uniformly
distributed over the range [0, upperBound].
genWord64R :: Word64 -> g -> (Word64, g)
genWord64R upperBound g returns a Word64 that is uniformly
distributed over the range [0, upperBound].
In favor of `System.Random.uniformShortByteString`
Same as `uniformByteArray` `False`, but for `ShortByteString`.
genShortByteString n g returns a ShortByteString of length n filled with
pseudo-random bytes.
Note - This function will be removed from the type class in the next major release as
it is no longer needed because of `unsafeUniformFillMutableByteArray`.
Fill in the supplied `MutableByteArray` with uniformly generated random bytes. This function
is unsafe because it is not required to do any bounds checking. For a safe variant use
`System.Random.Sateful.uniformFillMutableByteArrayM` instead.
Default type class implementation uses `defaultUnsafeUniformFillMutableByteArray`.
Mutable array to fill with random bytes
IntOffset into a mutable array from the beginning in number of bytes. Offset must
be non-negative, but this will not be checked
IntNumber of randomly generated bytes to write into the array. Number of bytes
must be non-negative and less then the total size of the array, minus the
offset. This also will be checked.
genRange :: g -> (Int, Int)
No longer used
Yields the range of values returned by next.
It is required that:
If (a, b) = genRange g, then a < b.
genRange must not examine its argument so the value it returns is
determined only by the instance of RandomGen.
The default definition spans the full range of Int.
split :: g -> (g, g)
In favor of `splitGen`
Returns two distinct pseudo-random number generators.
Implementations should take care to ensure that the resulting generators
are not correlated. Some pseudo-random number generators are not
splittable. In that case, the split implementation should fail with a
descriptive error message.
newtype Seed g
This is a binary form of pseudo-random number generator's state. It is designed to be
safe and easy to use for input/output operations like restoring from file, transmitting
over the network, etc.
Constructor is not exported, becasue it is important for implementation to enforce the
invariant of the underlying byte array being of the exact same length as the generator has
specified in `System.Random.Seed.SeedSize`. Use `System.Random.Seed.mkSeed` and
`System.Random.Seed.unSeed` to get access to the raw bytes in a safe manner.
class (KnownNat (SeedSize g), 1 <= SeedSize g, Typeable g) => SeedGen g
Interface for converting a pure pseudo-random number generator to and from non-empty
sequence of bytes. Seeds are stored in Little-Endian order regardless of the platform
it is being used on, which provides cross-platform compatibility, while providing
optimal performance for the most common platform type.
Conversion to and from a `Seed` serves as a building block for implementing
serialization for any pure or frozen pseudo-random number generator.
It is not trivial to implement platform independence. For this reason this type class
has two alternative ways of creating an instance for this class. The easiest way for
constructing a platform indepent seed is by converting the inner state of a generator
to and from a list of 64 bit words using `toSeed64` and `fromSeed64` respectively. In
that case cross-platform support will be handled automaticaly.
>>> :set -XDataKinds -XTypeFamilies
>>> import Data.Word (Word8, Word32)
>>> import Data.Bits ((.|.), shiftR, shiftL)
>>> import Data.List.NonEmpty (NonEmpty ((:|)))
>>> data FiveByteGen = FiveByteGen Word8 Word32 deriving Show
>>> :{
instance SeedGen FiveByteGen where
type SeedSize FiveByteGen = 5
fromSeed64 (w64 :| _) =
FiveByteGen (fromIntegral (w64 `shiftR` 32)) (fromIntegral w64)
toSeed64 (FiveByteGen x1 x4) =
let w64 = (fromIntegral x1 `shiftL` 32) .|. fromIntegral x4
in (w64 :| [])
:}
>>> FiveByteGen 0x80 0x01020304
FiveByteGen 128 16909060
>>> fromSeed (toSeed (FiveByteGen 0x80 0x01020304))
FiveByteGen 128 16909060
>>> toSeed (FiveByteGen 0x80 0x01020304)
Seed [0x04, 0x03, 0x02, 0x01, 0x80]
>>> toSeed64 (FiveByteGen 0x80 0x01020304)
549772722948 :| []
However, when performance is of utmost importance or default handling of cross platform
independence is not sufficient, then an adventurous developer can try implementing
conversion into bytes directly with `toSeed` and `fromSeed`.
Properties that must hold:
> fromSeed (toSeed gen) == gen
> fromSeed64 (toSeed64 gen) == gen
Note, that there is no requirement for every `Seed` to roundtrip, eg. this proprty does
not even hold for `StdGen`:
>>> let seed = nonEmptyToSeed (0xab :| [0xff00]) :: Seed StdGen
>>> seed == toSeed (fromSeed seed)
False
SeedSize :: SeedSize g :: Nat
Number of bytes that is required for storing the full state of a pseudo-random
number generator. It should be big enough to satisfy the roundtrip property:
> fromSeed (toSeed gen) == gen
Convert from a binary representation to a pseudo-random number generator
toSeed :: g -> Seed g
Convert to a binary representation of a pseudo-random number generator
fromSeed64 :: NonEmpty Word64 -> g
Construct pseudo-random number generator from a list of words. Whenever list does
not have enough bytes to satisfy the `SeedSize` requirement, it will be padded with
zeros. On the other hand when it has more than necessary, extra bytes will be dropped.
For example if `SeedSize` is set to 2, then only the lower 16 bits of the first
element in the list will be used.
toSeed64 :: g -> NonEmpty Word64
Convert pseudo-random number generator to a list of words
In case when `SeedSize` is not a multiple of 8, then the upper bits of the last word
in the list will be set to zero.
class RandomGen g => SplitGen g
Pseudo-random generators that can be split into two separate and independent
psuedo-random generators should provide an instance for this type class.
Historically this functionality was included in the `RandomGen` type class in the
`split` function, however, few pseudo-random generators possess this property of
splittability. This lead the old `split` function being usually implemented in terms of
`error`.
Returns two distinct pseudo-random number generators.
Implementations should take care to ensure that the resulting generators
are not correlated.
The standard pseudo-random number generator.
The class of types for which a uniformly distributed value can be drawn
from all possible values of the type.
The class of types for which a uniformly distributed value can be drawn
from a range.
Monadic Random Generator
This module provides type classes and instances for the following concepts:
- Monadic pseudo-random number generators
StatefulGen is an interface to
monadic pseudo-random number generators.
- Monadic adapters
StateGenM, AtomicGenM, IOGenM, 'STGenM` and TGenM
turn a RandomGen instance into a StatefulGen instance.
- Drawing from a range
UniformRange is used to generate a value of a
type uniformly within a range.
This library provides instances of UniformRange for many common
numeric types.
- Drawing from the entire domain of a type
Uniform is used to generate a
value of a type uniformly over all possible values of that type.
This library provides instances of Uniform for many common bounded
numeric types.
Usage
In monadic code, use the relevant Uniform and UniformRange instances to
generate pseudo-random values via uniformM and uniformRM, respectively.
As an example, rollsM generates n pseudo-random values of Word in the range @[1,
6]@ in a StatefulGen context; given a monadic pseudo-random number generator, you
can run this probabilistic computation using
[mwc-random](https:/hackage.haskell.orgpackage/mwc-random) as follows:
>>> import Control.Monad (replicateM)
>>> :{
let rollsM :: StatefulGen g m => Int -> g -> m [Word]
rollsM n = replicateM n . uniformRM (1, 6)
:}
import qualified System.Random.MWC as MWC
>>> monadicGen <- MWC.create
>>> rollsM 10 monadicGen :: IO [Word]
[3,4,3,1,4,6,1,6,1,4]
Given a pure pseudo-random number generator, you can run the monadic pseudo-random
number computation rollsM in StateT, IO, ST or STM
context by applying a monadic adapter like StateGenM, AtomicGenM, IOGenM,
STGenM or TGenM (see [monadic-adapters](#monadicadapters)) to the pure
pseudo-random number generator.
>>> let pureGen = mkStdGen 42
>>> newIOGenM pureGen >>= rollsM 10 :: IO [Word]
[1,1,3,2,4,5,3,4,6,2]
Mutable pseudo-random number generator interfaces
Pseudo-random number generators come in two flavours: pure and monadic.
RandomGen: pure pseudo-random number generators
See System.Random module.
StatefulGen: monadic pseudo-random number generators- These generators mutate their
own state as they produce pseudo-random values. They generally live in
StateT, ST, IO or STM or some other transformer
on top of those monads.
StatefulGen is an interface to monadic pseudo-random number generators.
uniformWord32R upperBound g generates a Word32 that is uniformly
distributed over the range [0, upperBound].
uniformWord64R upperBound g generates a Word64 that is uniformly
distributed over the range [0, upperBound].
Generates a Word8 that is uniformly distributed over the entire Word8
range.
The default implementation extracts a Word8 from uniformWord32.
Generates a Word16 that is uniformly distributed over the entire
Word16 range.
The default implementation extracts a Word16 from uniformWord32.
Generates a Word32 that is uniformly distributed over the entire
Word32 range.
The default implementation extracts a Word32 from uniformWord64.
Generates a Word64 that is uniformly distributed over the entire
Word64 range.
The default implementation combines two Word32 from uniformWord32 into
one Word64.
In favor of `uniformShortByteStringM`
uniformShortByteString n g generates a ShortByteString of length n
filled with pseudo-random bytes.
class StatefulGen (MutableGen f m) m => FrozenGen f m
This class is designed for mutable pseudo-random number generators that have a frozen
imutable counterpart that can be manipulated in pure code.
It also works great with frozen generators that are based on pure generators that have
a `RandomGen` instance.
Here are a few laws, which are important for this type class:
overwriteGen mg fg >> freezeGen mg = pure fg
overwriteGen mg fg = modifyGen mg (const ((), fg)
freezeGen mg = modifyGen mg (\fg -> (fg, fg))
MutableGen :: MutableGen f m = (g :: Type) | g -> f
Represents the state of the pseudo-random number generator for use with
thawGen and freezeGen.
freezeGen :: MutableGen f m -> m f
Saves the state of the pseudo-random number generator as a frozen seed.
modifyGen :: MutableGen f m -> (f -> (a, f)) -> m a
Apply a pure function to the frozen pseudo-random number generator.
overwriteGen :: MutableGen f m -> f -> m ()
Overwrite contents of the mutable pseudo-random number generator with the
supplied frozen one
class FrozenGen f m => ThawedGen f m
Functionality for thawing frozen generators is not part of the `FrozenGen` class,
becase not all mutable generators support functionality of creating new mutable
generators, which is what thawing is in its essence. For this reason `StateGen` does
not have an instance for this type class, but it has one for `FrozenGen`.
Here is an important law that relates this type class to `FrozenGen`
traverse thawGen fgs >>= traverse freezeGen = pure fgs
thawGen :: f -> m (MutableGen f m)
Create a new mutable pseudo-random number generator from its frozen state.
withMutableGen :: ThawedGen f m => f -> (MutableGen f m -> m a) -> m (a, f)
Runs a mutable pseudo-random number generator from its FrozenGen state.
====Examples
>>> import Data.Int (Int8)
>>> withMutableGen (IOGen (mkStdGen 217)) (uniformListM 5) :: IO ([Int8], IOGen StdGen)
([-74,37,-50,-2,3],IOGen {unIOGen = StdGen {unStdGen = SMGen 4273268533320920145 15251669095119325999}})
withMutableGen_ :: ThawedGen f m => f -> (MutableGen f m -> m a) -> m a
Same as withMutableGen, but only returns the generated value.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 137
>>> withMutableGen_ (IOGen pureGen) (uniformRM (1 :: Int, 6 :: Int))
4
withSeedMutableGen :: (SeedGen g, ThawedGen g m) => Seed g -> (MutableGen g m -> m a) -> m (a, Seed g)
Just like `withMutableGen`, except uses a `Seed` instead of a frozen generator.
====Examples
Here is good example of how `withSeedMutableGen` can be used with `withSeedFile`, which uses a locally stored seed.
First we define a reportSeed function that will print the contents of a seed file as a list of bytes:
>>> import Data.ByteString as BS (readFile, writeFile, unpack)
>>> :seti -XOverloadedStrings
>>> let reportSeed fp = print . ("Seed: " <>) . show . BS.unpack =<< BS.readFile fp
Given a file path, write an `StdGen` seed into the file:
>>> :seti -XFlexibleContexts -XScopedTypeVariables
>>> let writeInitSeed fp = BS.writeFile fp (unSeedToByteString (toSeed (mkStdGen 2025)))
Apply a `StatefulGen` monadic action that uses `IOGen` `StdGen`, restored from the seed in the given path:
>>> let withMutableSeedFile fp action = withSeedFile fp (\(seed :: Seed (IOGen StdGen)) -> withSeedMutableGen seed action)
Given a path and an action initialize the seed file and apply the action using that seed:
>>> let withInitSeedFile fp action = writeInitSeed fp *> reportSeed fp *> withMutableSeedFile fp action <* reportSeed fp
For the sake of example we will use a temporary directory for storing the seed. Here we
report the contents of the seed file before and after we shuffle a list:
>>> import UnliftIO.Temporary (withSystemTempDirectory)
>>> withSystemTempDirectory "random" (\fp -> withInitSeedFile (fp ++ "/seed.bin") (uniformShuffleListM [1..10]))
"Seed: [183,178,143,77,132,163,109,14,157,105,82,99,148,82,109,173]"
"Seed: [60,105,117,203,187,138,69,39,157,105,82,99,148,82,109,173]"
[7,5,4,3,1,8,10,6,9,2]
withSeedMutableGen_ :: (SeedGen g, ThawedGen g m) => Seed g -> (MutableGen g m -> m a) -> m a
Just like `withSeedMutableGen`, except it doesn't return the final generator, only
the resulting value. This is slightly more efficient, since it doesn't incur overhead
from freezeing the mutable generator
randomM :: forall a g m. (Random a, RandomGen g, FrozenGen g m) => MutableGen g m -> m a
Generates a pseudo-random value using monadic interface and `Random` instance.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 139
>>> g <- newIOGenM pureGen
>>> randomM g :: IO Double
0.33775117339631733
You can use type applications to disambiguate the type of the generated numbers:
>>> :seti -XTypeApplications
>>> randomM @Double g
0.9156875994165681
randomRM :: forall a g m. (Random a, RandomGen g, FrozenGen g m) => (a, a) -> MutableGen g m -> m a
Generates a pseudo-random value using monadic interface and `Random` instance.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 137
>>> g <- newIOGenM pureGen
>>> randomRM (1, 100) g :: IO Int
52
You can use type applications to disambiguate the type of the generated numbers:
>>> :seti -XTypeApplications
>>> randomRM @Int (1, 100) g
2
splitGenM :: (SplitGen f, FrozenGen f m) => MutableGen f m -> m f
Splits a pseudo-random number generator into two. Overwrites the mutable
pseudo-random number generator with one of the immutable pseudo-random number
generators produced by a `split` function and returns the other.
splitMutableGenM :: (SplitGen f, ThawedGen f m) => MutableGen f m -> m (MutableGen f m)
Splits a pseudo-random number generator into two. Overwrites the mutable wrapper with
one of the resulting generators and returns the other as a new mutable generator.
Deprecated
class (RandomGen r, StatefulGen g m) => RandomGenM g r m
In favor of `FrozenGen`
Interface to operations on RandomGen wrappers like IOGenM and StateGenM.
In favor of `modifyGen`
Monadic adapters for pure pseudo-random number generators
Pure pseudo-random number generators can be used in monadic code via the
adapters StateGenM, AtomicGenM, IOGenM, STGenM and TGenM
Pure adapter in MonadState
Wrapper for pure state gen, which acts as an immutable seed for the corresponding
stateful generator `StateGenM`
StateGen :: g -> StateGen g
Opaque data type that carries the type of a pure pseudo-random number
generator.
runStateGen :: RandomGen g => g -> (StateGenM g -> State g a) -> (a, g)
Runs a monadic generating action in the `State` monad using a pure
pseudo-random number generator.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 137
>>> runStateGen pureGen randomM :: (Int, StdGen)
(7879794327570578227,StdGen {unStdGen = SMGen 11285859549637045894 7641485672361121627})
runStateGen_ :: RandomGen g => g -> (StateGenM g -> State g a) -> a
Runs a monadic generating action in the `State` monad using a pure
pseudo-random number generator. Returns only the resulting pseudo-random
value.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 137
>>> runStateGen_ pureGen randomM :: Int
7879794327570578227
runStateGenT :: RandomGen g => g -> (StateGenM g -> StateT g m a) -> m (a, g)
Runs a monadic generating action in the `StateT` monad using a pure
pseudo-random number generator.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 137
>>> runStateGenT pureGen randomM :: IO (Int, StdGen)
(7879794327570578227,StdGen {unStdGen = SMGen 11285859549637045894 7641485672361121627})
runStateGenT_ :: (RandomGen g, Functor f) => g -> (StateGenM g -> StateT g f a) -> f a
Runs a monadic generating action in the `StateT` monad using a pure
pseudo-random number generator. Returns only the resulting pseudo-random
value.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 137
>>> runStateGenT_ pureGen randomM :: IO Int
7879794327570578227
runStateGenST :: RandomGen g => g -> (forall s. StateGenM g -> StateT g (ST s) a) -> (a, g)
Runs a monadic generating action in the `ST` monad using a pure
pseudo-random number generator.
runStateGenST_ :: RandomGen g => g -> (forall s. StateGenM g -> StateT g (ST s) a) -> a
Runs a monadic generating action in the `ST` monad using a pure
pseudo-random number generator. Same as `runStateGenST`, but discards the
resulting generator.
Mutable thread-safe adapter in IO
Frozen version of mutable `AtomicGenM` generator
AtomicGen :: g -> AtomicGen g
Wraps an IORef that holds a pure pseudo-random number generator. All
operations are performed atomically.
AtomicGenM :: IORef g -> AtomicGenM g
unAtomicGenM :: AtomicGenM g -> IORef g
newAtomicGenM :: MonadIO m => g -> m (AtomicGenM g)
Creates a new AtomicGenM.
applyAtomicGen :: MonadIO m => (g -> (a, g)) -> AtomicGenM g -> m a
Atomically applies a pure operation to the wrapped pseudo-random number
generator.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 137
>>> g <- newAtomicGenM pureGen
>>> applyAtomicGen random g :: IO Int
7879794327570578227
Global mutable standard pseudo-random number generator. This is the same
generator that was historically used by `randomIO` and `randomRIO` functions.
>>> import Control.Monad (replicateM)
>>> replicateM 10 (uniformRM ('a', 'z') globalStdGen)
"tdzxhyfvgr"
Mutable adapter in IO
Frozen version of mutable `IOGenM` generator
IOGen :: g -> IOGen g
unIOGen :: IOGen g -> g
Wraps an IORef that holds a pure pseudo-random number generator.
IOGenM is safe in the presence of exceptions, but not concurrency.
IOGenM is slower than StateGenM due to the extra pointer indirection.
IOGenM is faster than AtomicGenM since the IORef operations used by
IOGenM are not atomic.
An example use case is writing pseudo-random bytes into a file:
>>> import UnliftIO.Temporary (withSystemTempFile)
>>> import Data.ByteString (hPutStr)
>>> let ioGen g = withSystemTempFile "foo.bin" $ \_ h -> uniformRM (0, 100) g >>= flip uniformByteStringM g >>= hPutStr h
and then run it:
>>> newIOGenM (mkStdGen 1729) >>= ioGen
IOGenM :: IORef g -> IOGenM g
unIOGenM :: IOGenM g -> IORef g
newIOGenM :: MonadIO m => g -> m (IOGenM g)
applyIOGen :: MonadIO m => (g -> (a, g)) -> IOGenM g -> m a
Applies a pure operation to the wrapped pseudo-random number generator.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 137
>>> g <- newIOGenM pureGen
>>> applyIOGen random g :: IO Int
7879794327570578227
Mutable adapter in ST
Frozen version of mutable `STGenM` generator
STGen :: g -> STGen g
unSTGen :: STGen g -> g
Wraps an STRef that holds a pure pseudo-random number generator.
STGenM is safe in the presence of exceptions, but not concurrency.
STGenM is slower than StateGenM due to the extra pointer indirection.
STGenM :: STRef s g -> STGenM g s
unSTGenM :: STGenM g s -> STRef s g
newSTGenM :: g -> ST s (STGenM g s)
applySTGen :: (g -> (a, g)) -> STGenM g s -> ST s a
Applies a pure operation to the wrapped pseudo-random number generator.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 137
>>> (runSTGen pureGen (\g -> applySTGen random g)) :: (Int, StdGen)
(7879794327570578227,StdGen {unStdGen = SMGen 11285859549637045894 7641485672361121627})
runSTGen :: RandomGen g => g -> (forall s. STGenM g s -> ST s a) -> (a, g)
Runs a monadic generating action in the `ST` monad using a pure
pseudo-random number generator.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 137
>>> (runSTGen pureGen (\g -> applySTGen random g)) :: (Int, StdGen)
(7879794327570578227,StdGen {unStdGen = SMGen 11285859549637045894 7641485672361121627})
runSTGen_ :: RandomGen g => g -> (forall s. STGenM g s -> ST s a) -> a
Runs a monadic generating action in the `ST` monad using a pure
pseudo-random number generator. Returns only the resulting pseudo-random
value.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 137
>>> (runSTGen_ pureGen (\g -> applySTGen random g)) :: Int
7879794327570578227
Mutable thread-safe adapter in STM
newtype TGen g
Frozen version of mutable `TGenM` generator
TGen :: g -> TGen g
unTGen :: TGen g -> g
Wraps a TVar that holds a pure pseudo-random number generator.
TGenM :: TVar g -> TGenM g
unTGenM :: TGenM g -> TVar g
newTGenM :: g -> STM (TGenM g)
Creates a new TGenM in `STM`.
newTGenMIO :: MonadIO m => g -> m (TGenM g)
Creates a new TGenM in `IO`.
applyTGen :: (g -> (a, g)) -> TGenM g -> STM a
Applies a pure operation to the wrapped pseudo-random number generator.
====Examples
>>> import Control.Concurrent.STM
>>> import System.Random.Stateful
>>> import Data.Int (Int32)
>>> let pureGen = mkStdGen 137
>>> stmGen <- newTGenMIO pureGen
>>> atomically $ applyTGen uniform stmGen :: IO Int32
637238067
Pseudo-random values of various types
This library provides two type classes to generate pseudo-random values:
Types may have instances for both or just one of UniformRange and
Uniform. A few examples illustrate this:
Int, Word16 and Bool are instances of both UniformRange and
Uniform.
Integer, Float and Double each have an instance for UniformRange
but no Uniform instance.
A hypothetical type Radian representing angles by taking values in the
range [0, 2π) has a trivial Uniform instance, but no UniformRange
instance: the problem is that two given Radian values always span two
ranges, one clockwise and one anti-clockwise.
It is trivial to construct a Uniform (a, b) instance given
Uniform a and Uniform b (and this library provides this tuple
instance).
On the other hand, there is no correct way to construct a
UniformRange (a, b) instance based on just UniformRange a and
UniformRange b.
uniformViaFiniteM :: (StatefulGen g m, Generic a, GFinite (Rep a)) => g -> m a
A definition of Uniform for Finite types.
If your data has several fields of sub-Word cardinality,
this instance may be more efficient than one, derived via Generic and GUniform.
>>> :seti -XDeriveGeneric -XDeriveAnyClass
>>> import GHC.Generics (Generic)
>>> import System.Random.Stateful
>>> data Triple = Triple Word8 Word8 Word8 deriving (Show, Generic, Finite)
>>> instance Uniform Triple where uniformM = uniformViaFiniteM
>>> gen <- newIOGenM (mkStdGen 42)
>>> uniformListM 5 gen :: IO [Triple]
[Triple 60 226 48,Triple 234 194 151,Triple 112 96 95,Triple 51 251 15,Triple 6 0 208]
isInRangeOrd :: Ord a => (a, a) -> a -> Bool
Utilize `Ord` instance to decide if a value is within the range. Designed to be used
for implementing `isInRange`
isInRangeEnum :: Enum a => (a, a) -> a -> Bool
Utilize `Enum` instance to decide if a value is within the range. Designed to be used
for implementing `isInRange`
Lists
uniformListM :: (StatefulGen g m, Uniform a) => Int -> g -> m [a]
Generates a list of pseudo-random values.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 137
>>> g <- newIOGenM pureGen
>>> uniformListM 10 g :: IO [Bool]
[True,True,True,True,False,True,True,False,False,False]
uniformListRM :: (StatefulGen g m, UniformRange a) => Int -> (a, a) -> g -> m [a]
Generates a list of pseudo-random values in a specified range.
====Examples
>>> import System.Random.Stateful
>>> let pureGen = mkStdGen 137
>>> g <- newIOGenM pureGen
>>> uniformListRM 10 (20, 30) g :: IO [Int]
[23,21,28,25,28,28,26,25,29,27]
uniformShuffleListM :: StatefulGen g m => [a] -> g -> m [a]
Shuffle elements of a list in a uniformly random order.
====Examples
>>> import System.Random.Stateful
>>> runStateGen_ (mkStdGen 127) $ uniformShuffleListM "ELVIS"
"LIVES"
Generators for sequences of pseudo-random bytes
uniformByteArrayM :: Bool -> Int -> g -> m ByteArray
uniformByteArrayM n g generates a ByteArray of length n
filled with pseudo-random bytes.
BoolShould `ByteArray` be allocated as pinned memory or not
IntSize of the newly created `ByteArray` in number of bytes.
gGenerator to use for filling in the newly created `ByteArray`
uniformByteStringM :: StatefulGen g m => Int -> g -> m ByteString
Generates a pseudo-random ByteString of the specified size.
uniformShortByteStringM :: StatefulGen g m => Int -> g -> m ShortByteString
uniformShortByteString n g generates a ShortByteString of length n
filled with pseudo-random bytes.
Helper functions for createing instances
** Sequences of bytes
fillByteArrayST :: Bool -> Int -> ST s Word64 -> ST s ByteArray
Using an `ST` action that generates 8 bytes at a time fill in a new `ByteArray` in
architecture agnostic manner.
genShortByteStringIO :: Int -> IO Word64 -> IO ShortByteString
In favor of `fillByteArrayST`
Efficiently fills in a new `ShortByteString` in a platform independent manner.
IO action that can generate 8 random bytes at a time
IntNumber of bytes to generate
genShortByteStringST :: Int -> ST s Word64 -> ST s ShortByteString
In favor of `fillByteArrayST`, since `uniformShortByteString`, which it was used for, was also deprecated
Same as genShortByteStringIO, but runs in ST.
Efficiently generates a sequence of pseudo-random bytes in a platform
independent manner.
IntNumber of random bytes to write into the array
gST action that can generate 8 random bytes at a time
Floating point numbers
uniformDouble01M :: forall g m. StatefulGen g m => g -> m Double
Generates uniformly distributed Double in the range [0, 1].
Numbers are generated by generating uniform Word64 and dividing
it by 2^{64}. It's used to implement UniformRange instance for
Double.
Generates uniformly distributed Double in the range
(0, 1]. Number is generated as 2^{-64}/2+\operatorname{uniformDouble01M}.
Constant is 1/2 of smallest nonzero value which could be generated
by uniformDouble01M.
uniformFloat01M :: forall g m. StatefulGen g m => g -> m Float
Generates uniformly distributed Float in the range [0, 1].
Numbers are generated by generating uniform Word32 and dividing
it by 2^{32}. It's used to implement UniformRange instance for Float.
uniformFloatPositive01M :: forall g m. StatefulGen g m => g -> m Float
Generates uniformly distributed Float in the range
(0, 1]. Number is generated as 2^{-32}/2+\operatorname{uniformFloat01M}.
Constant is 1/2 of smallest nonzero value which could be generated
by uniformFloat01M.
Enum types
Word
uniformWordR :: StatefulGen g m => Word -> g -> m Word
Architecture specific `Word` generation in the specified lower range
WordMaximum value to generate
Appendix
How to implement StatefulGen
Typically, a monadic pseudo-random number generator has facilities to save
and restore its internal state in addition to generating pseudo-random numbers.
Here is an example instance for the monadic pseudo-random number generator
from the mwc-random package:
import qualified System.Random.MWC as MWC
import qualified Data.Vector.Generic as G
instance (s ~ PrimState m, PrimMonad m) => StatefulGen (MWC.Gen s) m where
uniformWord8 = MWC.uniform
uniformWord16 = MWC.uniform
uniformWord32 = MWC.uniform
uniformWord64 = MWC.uniform
uniformByteArrayM isPinned n g = stToPrim (fillByteArrayST isPinned n (MWC.uniform g))
instance PrimMonad m => FrozenGen MWC.Seed m where
type MutableGen MWC.Seed m = MWC.Gen (PrimState m)
freezeGen = MWC.save
overwriteGen (Gen mv) (Seed v) = G.copy mv v
instance PrimMonad m => ThawedGen MWC.Seed m where
thawGen = MWC.restore
FrozenGen
`FrozenGen` gives us ability to use most of stateful pseudo-random number generator in
its immutable form, if one exists that is. The biggest benefit that can be drawn from
a polymorphic access to a stateful pseudo-random number generator in a frozen form is
the ability to serialize, deserialize and possibly even use the stateful generator in a
pure setting without knowing the actual type of a generator ahead of time. For example
we can write a function that accepts a frozen state of some pseudo-random number
generator and produces a short list with random even integers.
>>> import Data.Int (Int8)
>>> import Control.Monad (replicateM)
>>> :{
myCustomRandomList :: ThawedGen f m => f -> m [Int8]
myCustomRandomList f =
withMutableGen_ f $ \gen -> do
len <- uniformRM (5, 10) gen
replicateM len $ do
x <- uniformM gen
pure $ if even x then x else x + 1
:}
and later we can apply it to a frozen version of a stateful generator, such as `STGen`:
>>> print $ runST $ myCustomRandomList (STGen (mkStdGen 217))
[-50,-2,4,-8,-58,-40,24,-32,-110,24]
Alternatively, instead of discarding the final state of the generator, as it happens
above, we could have used `withMutableGen`, which together with the result would give
us back its frozen form. This would allow us to store the end state of our generator
somewhere for the later reuse.
Floating point number caveats
scaleFloating :: forall a w. (RealFloat a, Integral w, Bounded w, FiniteBits w) => a -> a -> w -> a
This is the function that is used to scale a floating point value from random word range to
the custom [low, high] range.
wUniformly distributed unsigned integral value that will be used for converting to a floating
point value and subsequent scaling to the specified range
Due to rounding errors, floating point operations are neither associative nor
distributive the way the corresponding operations on real numbers are. Additionally,
floating point numbers admit special values NaN as well as negative and positive
infinity.
The UniformRange instances for Float and Double use the following
procedure to generate a random value in a range for uniformRM (l, h) g:
Generate an unsigned integral of matching width w uniformly.
Check whether h - l overflows to infinity and, if it does, then convert
w to a floating point number in [0.0, 1.0] range through division
of w by the highest possible value:
x = `fromIntegral` w / `fromIntegral` `maxBound`
Then we scale and clamp it before returning it:
`max` (`min` (x * l + (1 - x) * h) (`max` l h)) (`min` l h)
Clamping is necessary, because otherwise it would be possible to run into a
degenerate case when a scaled value is outside the specified range due to
rounding errors.
Whenever h - l does not overflow, we use this common formula for scaling:
l + (h - l) * x. However, instead of using [0.0, 1.0] range we
use the top most bit of w to decide whether we will treat the generated
floating point value as [0.0, 0.5] range or [0.5, 1.0] range and
use the left over bits to produce a floating point value in the half unit
range:
x = `fromIntegral` (`clearBit` w 31) / `fromIntegral` `maxBound`
Further scaling depends on the top most bit:
if `testBit` w 31
then l + (h - l) * x
else h + (l - h) * x
Because of this clever technique the result does not need clamping, since
scaled values are guaranteed to stay within the specified range. Another reason
why this tecnique is used for the common case instead of the one described in
2. is because it avoids usage of 1 - x, which consequently reduces loss
of randomness due to rounding.
What happens when NaN or Infinity are given to uniformRM? We first
define them as constants:
>>> nan = read "NaN" :: Float
>>> inf = read "Infinity" :: Float
>>> g <- newIOGenM (mkStdGen 2024)
>>> uniformRM (nan, 1) g
NaN
>>> uniformRM (-1, nan) g
NaN
>>> uniformRM (-inf, inf) g
NaN
>>> uniformRM (inf, -inf) g
NaN
>>> uniformRM (inf, 1) g
Infinity
>>> uniformRM (-inf, 1) g
-Infinity
>>> uniformRM (1, inf) g
Infinity
>>> uniformRM (1, -inf) g
-Infinity
Note that the [GCC 10.1.0 C++ standard library](https:/gcc.gnu.orggit?p=gcc.git;a=blob;f=libstdc%2B%2B-v3includebitsrandom.h;h=19307fbc3ca401976ef6823e8fda893e4a263751;hb=63fa67847628e5f358e7e2e7edb8314f0ee31f30#l1859),
the [Java 10 standard library](https:/docs.oracle.comjavase10docsapijavautilRandom.html#doubles%28double,double%29)
and [CPython 3.8](https:/github.compythoncpythonblob3.8Lib/random.py#L417)
use a similar procedure to generate floating point values in a range.
References
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
Instances
49
instance (RandomGen r, MonadIO m) => RandomGenM (IOGenM r) r minstance (RandomGen r, MonadIO m) => RandomGenM (AtomicGenM r) r minstance (RandomGen r, MonadState r m) => RandomGenM (StateGenM r) r minstance RandomGen r => RandomGenM (STGenM r s) r (ST s)instance RandomGen r => RandomGenM (TGenM r) r STMinstance Eq g => Eq (AtomicGen g)instance Ord g => Ord (AtomicGen g)instance Show g => Show (AtomicGen g)instance RandomGen g => RandomGen (AtomicGen g)instance SplitGen g => SplitGen (AtomicGen g)instance Storable g => Storable (AtomicGen g)instance NFData g => NFData (AtomicGen g)instance SeedGen g => SeedGen (AtomicGen g)instance (RandomGen g, MonadIO m) => StatefulGen (AtomicGenM g) minstance (RandomGen g, MonadIO m) => FrozenGen (AtomicGen g) minstance (RandomGen g, MonadIO m) => ThawedGen (AtomicGen g) minstance Eq g => Eq (IOGen g)instance Ord g => Ord (IOGen g)instance Show g => Show (IOGen g)instance RandomGen g => RandomGen (IOGen g)instance SplitGen g => SplitGen (IOGen g)instance Storable g => Storable (IOGen g)instance NFData g => NFData (IOGen g)instance SeedGen g => SeedGen (IOGen g)instance (RandomGen g, MonadIO m) => StatefulGen (IOGenM g) minstance (RandomGen g, MonadIO m) => FrozenGen (IOGen g) minstance (RandomGen g, MonadIO m) => ThawedGen (IOGen g) minstance Eq g => Eq (STGen g)instance Ord g => Ord (STGen g)instance Show g => Show (STGen g)instance RandomGen g => RandomGen (STGen g)instance SplitGen g => SplitGen (STGen g)instance Storable g => Storable (STGen g)instance NFData g => NFData (STGen g)instance SeedGen g => SeedGen (STGen g)instance RandomGen g => StatefulGen (STGenM g s) (ST s)instance RandomGen g => FrozenGen (STGen g) (ST s)instance RandomGen g => ThawedGen (STGen g) (ST s)instance Eq g => Eq (TGen g)instance Ord g => Ord (TGen g)instance Show g => Show (TGen g)instance RandomGen g => RandomGen (TGen g)instance SplitGen g => SplitGen (TGen g)instance Storable g => Storable (TGen g)instance NFData g => NFData (TGen g)instance SeedGen g => SeedGen (TGen g)instance RandomGen g => StatefulGen (TGenM g) STMinstance RandomGen g => FrozenGen (TGen g) STMinstance RandomGen g => ThawedGen (TGen g) STM
- Maintainer
- libraries@haskell.org
- Copyright
- (c) The University of Glasgow 2001
- License
- BSD-style (see the file LICENSE in the 'random' repository)