Test.BDD.LanguageFree

Free monads to introduce do notation in 'Language'

Module : Copyright : (c) Paolo Veronelli 2017 License : All rights reserved Maintainer: [e-mail] Stability : experimental Portability: non-portable

Documentation

given :: m a -> Free (GivenFree m) a

givenAndAfter_ :: Functor m => m r -> (r -> m ()) -> Free (GivenFree m) ()

givenAndAfter :: m (b, r) -> (r -> m ()) -> Free (GivenFree m) b

then_ :: (t -> m ()) -> Free (ThenFree m t) ()

then__ :: m () -> Free (ThenFree m t) ()

when_ :: m t -> Free (ThenFree m t) b -> Free (GivenFree m) ()

data GivenFree m a

Instances

Functor (GivenFree m)

Defined in Test.BDD.LanguageFree

Methods

fmap :: (a -> b) -> GivenFree m a -> GivenFree m b

(<$) :: a -> GivenFree m b -> GivenFree m a

data ThenFree m t a

Instances

Functor (ThenFree m t)

Defined in Test.BDD.LanguageFree

Methods

fmap :: (a -> b) -> ThenFree m t a -> ThenFree m t b

(<$) :: a -> ThenFree m t b -> ThenFree m t a

type FreeBDD m x = Free (GivenFree m) x

testFreeBDD :: MonadCatch m => Free (GivenFree m) x -> m (BDDResult m)

data BDDResult m

Constructors

Failed SomeException (m ())

Succeded (m ())