Hoogle Search

Within LTS Haskell 22.19 (ghc-9.6.4)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. randomRs :: (Random a, RandomGen g) => (a, a) -> g -> [a]

   random	System.Random

   Plural variant of randomR, producing an infinite list of pseudo-random values instead of returning a new generator.

2. randomRs :: (Random a, RandomGen g) => (a, a) -> g -> [a]

   tf-random	System.Random.TF.Instances

   No documentation available.

3. gRandomRSum :: forall a g . (ADT a, Constraints a Random, RandomGen g) => (a, a) -> g -> (a, g)

   one-liner-instances	System.Random.OneLiner

   randomR implemented by sequencing randomR between all components. If given a range of items made with different constructors, will be error!

4. gRandomRSums :: forall a g . (ADT a, Constraints a Random, RandomGen g) => (a, a) -> g -> [a]

   one-liner-instances	System.Random.OneLiner

   randomRs implemented by repeatedly calling gRandomRSum. If given a range of items made with different constructors, will be error!

5. gRandomRs :: forall a g . (ADTRecord a, Constraints a Random, RandomGen g) => (a, a) -> g -> [a]

   one-liner-instances	System.Random.OneLiner

   randomRs implemented by repeatedly calling gRandomR.

6. gRandomRSumM :: forall a g m r . (ADT a, Constraints a Random, RandomGenM g r m) => (a, a) -> g -> m a

   one-liner-instances	System.Random.Stateful.OneLiner

   Uses the Random instance instead of the Uniform instance.

Page 1 of 1