seq package:registry-hedgehog

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

Generates a seq using a Range to determine the length.

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)

registry-hedgehog Test.Tasty.Hedgehogx

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

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

registry-hedgehog Test.Tasty.Hedgehogx

The sequence of actions.

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

registry-hedgehog Test.Tasty.Hedgehogx

A sequence of actions to execute.

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

registry-hedgehog Test.Tasty.Hedgehogx

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

registry-hedgehog Test.Tasty.Hedgehogx

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)
]

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

registry-hedgehog Test.Tasty.Hedgehogx

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.

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

registry-hedgehog Test.Tasty.Hedgehogx

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]