Hoogle Search
Within LTS Haskell 12.18 (ghc8.4.4)
randoms :: (Random a, RandomGen g) => g > [a]
random System.Random Plural variant of random, producing an infinite list of random values instead of returning a new generator.
randoms :: (Random a, RandomGen g) => g > [a]
tfrandom System.Random.TF.Instances No documentation available.

onelinerinstances System.Random.OneLiner If a is a data type whose fields are all instances of Random, then GRandom a has a Random instance. Will one day be able to be used with DerivingVia syntax, to derive instances automatically. A version of GRandom that works for data types with multiple constructors. If your type has only one constructor, it might be more performant to use GRandom. Note that the "ranged" variants are partial: if given a range of items made with different constructors, will be error!
GRandomSum :: a > GRandomSum a
onelinerinstances System.Random.OneLiner No documentation available.
gRandomSum :: forall a g . (ADT a, Constraints a Random, RandomGen g) => g > (a, g)
onelinerinstances System.Random.OneLiner random implemented by selecting a random constructor and sequencing random for all components.
gRandomSums :: forall a g . (ADT a, Constraints a Random, RandomGen g) => g > [a]
onelinerinstances System.Random.OneLiner randoms implemented by repeatedly calling gRandomSum.
gRandoms :: forall a g . (ADTRecord a, Constraints a Random, RandomGen g) => g > [a]
onelinerinstances System.Random.OneLiner getGRandomSum :: GRandomSum a > a
onelinerinstances System.Random.OneLiner No documentation available.
Page 1 of 1