Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

  1. newtype Sequential (m :: Type -> Type) (state :: Type -> Type -> Type)

    hedgehog Hedgehog

    A sequence of actions to execute.

  2. Sequential :: [Action m state] -> Sequential (m :: Type -> Type) (state :: (Type -> Type) -> Type)

    hedgehog Hedgehog

    No documentation available.

  3. checkSequential :: MonadIO m => Group -> m Bool

    hedgehog Hedgehog

    Check a group of properties sequentially. Using Template Haskell for property discovery: 

    tests :: IO Bool
tests =
checkSequential $$(discover)
    With manually specified properties: 
    tests :: IO Bool
tests =
checkSequential $ Group "Test.Example" [
("prop_reverse", prop_reverse)
]

  4. executeSequential :: (MonadTest m, MonadCatch m, HasCallStack) => (forall (v :: Type -> Type) . () => state v) -> Sequential m state -> m ()

    hedgehog Hedgehog

    Executes a list of actions sequentially, verifying that all post-conditions are met and no exceptions are thrown. To generate a sequence of actions to execute, see the sequential combinator in the Hedgehog.Gen module.

  5. sequentialActions :: Sequential (m :: Type -> Type) (state :: (Type -> Type) -> Type) -> [Action m state]

    hedgehog Hedgehog

    The sequence of actions.

  6. frequency :: MonadGen m => [(Int, m a)] -> m a

    hedgehog Hedgehog.Gen

    Uses a weighted distribution to randomly select one of the generators in the list. This generator shrinks towards the first generator in the list. The input list must be non-empty.

  7. seq :: MonadGen m => Range Int -> m a -> m (Seq a)

    hedgehog Hedgehog.Gen

    Generates a seq using a Range to determine the length.

  8. sequential :: forall gen (m :: Type -> Type) state . (MonadGen gen, MonadTest m) => Range Int -> (forall (v :: Type -> Type) . () => state v) -> [Command gen m state] -> gen (Sequential m state)

    hedgehog Hedgehog.Gen

    Generates a sequence of actions from an initial model state and set of commands.

  9. subsequence :: MonadGen m => [a] -> m [a]

    hedgehog Hedgehog.Gen

    Generates a random subsequence of a list. For example: 

    Gen.print (Gen.subsequence [1..5])

    === Outcome ===
[1,2,4]
=== Shrinks ===
[]
[2,4]
[1,4]
[1,2]

  10. frequency :: MonadGen m => [(Int, m a)] -> m a

    hedgehog Hedgehog.Internal.Gen

    Uses a weighted distribution to randomly select one of the generators in the list. This generator shrinks towards the first generator in the list. The input list must be non-empty.

Page 167 of many | Previous | Next