Hoogle Search

Within LTS Haskell 12.18 (ghc-8.4.4)

  1. 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.

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

    tf-random System.Random.TF.Instances

    No documentation available.

  3. newtype GRandomSum a

    one-liner-instances 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!

  4. GRandomSum :: a -> GRandomSum a

    one-liner-instances System.Random.OneLiner

    No documentation available.

  5. gRandomSum :: forall a g . (ADT a, Constraints a Random, RandomGen g) => g -> (a, g)

    one-liner-instances System.Random.OneLiner

    random implemented by selecting a random constructor and sequencing random for all components.

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

    one-liner-instances System.Random.OneLiner

    randoms implemented by repeatedly calling gRandomSum.

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

    one-liner-instances System.Random.OneLiner

    randoms implemented by repeatedly calling gRandom.

  8. getGRandomSum :: GRandomSum a -> a

    one-liner-instances System.Random.OneLiner

    No documentation available.

Page 1 of 1