Module Test.QuickCheckGen

Test case generation.

Imports

• import Prelude.Math as Math
• import frege.Prelude as Prelude
• import Prelude.PreludeArrays as PreludeArrays
• import Prelude.PreludeBase as PreludeBase
• import Prelude.PreludeDecimal as PreludeDecimal
• import Prelude.PreludeIO as PreludeIO
• import Prelude.PreludeList as PreludeList
• import Prelude.PreludeMonad as PreludeMonad
• import Prelude.PreludeText as PreludeText
• import System.Random as Random
• import Java.util.Regex as Regexp

Table of Content

• Definitions

  data Gen a

  variant ∷ Integral n ⇒ n → Gen a → Gen a

  sized ∷ (Int → Gen a) → Gen a

  resize ∷ Int → Gen a → Gen a

  choose ∷ Random a ⇒ (a, a) → Gen a

  promote ∷ Monad m ⇒ m (Gen a) → Gen (m a)

  sample' ∷ Gen a → IO [a]

  sample ∷ Show a ⇒ Gen a → IO ()

  suchThat ∷ Gen a → (a → Bool) → Gen a

  suchThatMaybe ∷ Gen a → (a → Bool) → Gen (Maybe a)

  oneof ∷ [Gen a] → Gen a

  frequency ∷ [(Int, Gen a)] → Gen a

  elements ∷ [a] → Gen a

  growingElements ∷ [a] → Gen a

  listOf ∷ Gen a → Gen [a]

  listOf1 ∷ Gen a → Gen [a]

  vectorOf ∷ Int → Gen a → Gen [a]

• Instances

  instance Functor Gen

  instance Monad Gen

• Functions and Values by Type

Definitions

data Gen a

Generator type

Constructors

MkGen {unGen ∷ StdGen → Int → a}

Member Functions

unGen ∷ Gen 𝖆 → StdGen → Int → 𝖆

access field unGen

variant ∷ Integral n ⇒ n → Gen a → Gen a

sized ∷ (Int → Gen a) → Gen a

Used to construct generators that depend on the size parameter.

resize ∷ Int → Gen a → Gen a

Overrides the size parameter. Returns a generator which uses the given size instead of the runtime-size parameter.

choose ∷ Random a ⇒ (a, a) → Gen a

Generates a random element in the given inclusive range.

promote ∷ Monad m ⇒ m (Gen a) → Gen (m a)

Promotes a monadic generator to a generator of monadic values.

sample' ∷ Gen a → IO [a]

Generates some example values.

sample ∷ Show a ⇒ Gen a → IO ()

Generates some example values and prints them to IO.stdout.

suchThat ∷ Gen a → (a → Bool) → Gen a

Generates a value that satisfies a predicate.

suchThatMaybe ∷ Gen a → (a → Bool) → Gen (Maybe a)

Tries to generate a value that satisfies a predicate.

oneof ∷ [Gen a] → Gen a

Randomly uses one of the given generators. The input list must be non-empty.

frequency ∷ [(Int, Gen a)] → Gen a

Chooses one of the given generators, with a weighted random distribution. The input list must be non-empty.

elements ∷ [a] → Gen a

Generates one of the given values. The input list must be non-empty.

growingElements ∷ [a] → Gen a

Takes a list of elements of increasing size, and chooses among an initial segment of the list. The size of this initial segment increases with the size parameter. The input list must be non-empty.

listOf ∷ Gen a → Gen [a]

Generates a list of random length.

The maximum length depends on the size parameter.

listOf1 ∷ Gen a → Gen [a]

Generates a non-empty list of random length.

The maximum length depends on the size parameter.

vectorOf ∷ Int → Gen a → Gen [a]

Generates a list of the given length.

Instances

instance Functor Gen

Member Functions

fmap ∷ (𝖆 → 𝖇) → Gen 𝖆 → Gen 𝖇
infixl  4

instance Monad Gen

Member Functions

*> ∷ Gen 𝖆 → Gen 𝖇 → Gen 𝖇
infixl  4

inherited from Applicative.*>

<* ∷ Gen 𝖆 → Gen 𝖇 → Gen 𝖆
infixl  4

inherited from Applicative.<*

<*> ∷ Gen (𝖆→𝖇) → Gen 𝖆 → Gen 𝖇
infixl  4

>> ∷ Gen 𝖆 → Gen 𝖇 → Gen 𝖇
infixl  3

inherited from Monad.>>

>>= ∷ Gen 𝖆 → (𝖆 → Gen 𝖇) → Gen 𝖇
infixl  3

join ∷ Gen (Gen 𝖆) → Gen 𝖆

inherited from Monad.join

pure ∷ 𝖆 → Gen 𝖆

Functions and Values by Type

(Int → Gen a) → Gen a

sized

(StdGen → Int → a) → Gen a

Gen.MkGen

[(Int, Gen a)] → Gen a

frequency

[Gen a] → Gen a

oneof

[a] → Gen a

elements, growingElements

Gen (Gen 𝖆) → Gen 𝖆

Monad_Gen.join

Gen a → (a → Bool) → Gen (Maybe a)

suchThatMaybe

Gen a → (a → Bool) → Gen a

suchThat

Gen a → IO [a]

sample'

Gen a → Gen [a]

listOf, listOf1

Gen 𝖆 → StdGen → Int → 𝖆

Gen.unGen

Int → Gen a → Gen [a]

vectorOf

Int → Gen a → Gen a

resize

𝖆 → Gen 𝖆

Monad_Gen.pure

𝖆 → Bool

Gen.has$unGen

Show a ⇒ Gen a → IO ()

sample

Random a ⇒ (a, a) → Gen a

choose

(𝖆 → 𝖇) → Gen 𝖆 → Gen 𝖇

Functor_Gen.fmap

Gen (𝖆→𝖇) → Gen 𝖆 → Gen 𝖇

Monad_Gen.<*>

Gen 𝖆 → (𝖆 → Gen 𝖇) → Gen 𝖇

Monad_Gen.>>=

Gen 𝖆 → (StdGen→Int→𝖇) → Gen 𝖇

Gen.upd$unGen

Gen 𝖆 → Gen 𝖇 → Gen 𝖆

Monad_Gen.<*

Gen 𝖆 → Gen 𝖇 → Gen 𝖇

Monad_Gen.*>, Monad_Gen.>>

Gen 𝖇 → (-> StdGen (Int→𝖇)→StdGen→Int→𝖆) → Gen 𝖆

Gen.chg$unGen

Integral n ⇒ n → Gen a → Gen a

variant

Monad m ⇒ m (Gen a) → Gen (m a)

promote