quickcheck-state-machine-0.4.1: Test monadic programs using state machine based models

Copyright(C) 2017 ATS Advanced Telematic Systems GmbH
LicenseBSD-style (see the file LICENSE)
MaintainerStevan Andjelkovic <stevan.andjelkovic@here.com>
Stabilityprovisional
Portabilitynon-portable (GHC extensions)
Safe HaskellNone
LanguageHaskell2010

Test.StateMachine.Types

Description

 

Documentation

data StateMachine model cmd m resp Source #

Constructors

StateMachine 

Fields

data Command cmd Source #

Constructors

Command !(cmd Symbolic) !(Set Var) 
Instances
Show (cmd Symbolic) => Show (Command cmd) Source # 
Instance details

Defined in Test.StateMachine.Types

Methods

showsPrec :: Int -> Command cmd -> ShowS #

show :: Command cmd -> String #

showList :: [Command cmd] -> ShowS #

(Generic1 cmd, GConName1 (Rep1 cmd)) => GConName (Command cmd) Source # 
Instance details

Defined in Test.StateMachine.ConstructorName

newtype Commands cmd Source #

Constructors

Commands 

Fields

Instances
Show (cmd Symbolic) => Show (Commands cmd) Source # 
Instance details

Defined in Test.StateMachine.Types

Methods

showsPrec :: Int -> Commands cmd -> ShowS #

show :: Commands cmd -> String #

showList :: [Commands cmd] -> ShowS #

Semigroup (Commands cmd) Source # 
Instance details

Defined in Test.StateMachine.Types

Methods

(<>) :: Commands cmd -> Commands cmd -> Commands cmd #

sconcat :: NonEmpty (Commands cmd) -> Commands cmd #

stimes :: Integral b => b -> Commands cmd -> Commands cmd #

Monoid (Commands cmd) Source # 
Instance details

Defined in Test.StateMachine.Types

Methods

mempty :: Commands cmd #

mappend :: Commands cmd -> Commands cmd -> Commands cmd #

mconcat :: [Commands cmd] -> Commands cmd #

data ParallelCommandsF t cmd Source #

Constructors

ParallelCommands 

Fields

Instances
(Show (cmd Symbolic), Show (t (Commands cmd))) => Show (ParallelCommandsF t cmd) Source # 
Instance details

Defined in Test.StateMachine.Types

data Pair a Source #

Constructors

Pair 

Fields

Instances
Functor Pair Source # 
Instance details

Defined in Test.StateMachine.Types

Methods

fmap :: (a -> b) -> Pair a -> Pair b #

(<$) :: a -> Pair b -> Pair a #

Foldable Pair Source # 
Instance details

Defined in Test.StateMachine.Types

Methods

fold :: Monoid m => Pair m -> m #

foldMap :: Monoid m => (a -> m) -> Pair a -> m #

foldr :: (a -> b -> b) -> b -> Pair a -> b #

foldr' :: (a -> b -> b) -> b -> Pair a -> b #

foldl :: (b -> a -> b) -> b -> Pair a -> b #

foldl' :: (b -> a -> b) -> b -> Pair a -> b #

foldr1 :: (a -> a -> a) -> Pair a -> a #

foldl1 :: (a -> a -> a) -> Pair a -> a #

toList :: Pair a -> [a] #

null :: Pair a -> Bool #

length :: Pair a -> Int #

elem :: Eq a => a -> Pair a -> Bool #

maximum :: Ord a => Pair a -> a #

minimum :: Ord a => Pair a -> a #

sum :: Num a => Pair a -> a #

product :: Num a => Pair a -> a #

Traversable Pair Source # 
Instance details

Defined in Test.StateMachine.Types

Methods

traverse :: Applicative f => (a -> f b) -> Pair a -> f (Pair b) #

sequenceA :: Applicative f => Pair (f a) -> f (Pair a) #

mapM :: Monad m => (a -> m b) -> Pair a -> m (Pair b) #

sequence :: Monad m => Pair (m a) -> m (Pair a) #

Eq a => Eq (Pair a) Source # 
Instance details

Defined in Test.StateMachine.Types

Methods

(==) :: Pair a -> Pair a -> Bool #

(/=) :: Pair a -> Pair a -> Bool #

Ord a => Ord (Pair a) Source # 
Instance details

Defined in Test.StateMachine.Types

Methods

compare :: Pair a -> Pair a -> Ordering #

(<) :: Pair a -> Pair a -> Bool #

(<=) :: Pair a -> Pair a -> Bool #

(>) :: Pair a -> Pair a -> Bool #

(>=) :: Pair a -> Pair a -> Bool #

max :: Pair a -> Pair a -> Pair a #

min :: Pair a -> Pair a -> Pair a #

Show a => Show (Pair a) Source # 
Instance details

Defined in Test.StateMachine.Types

Methods

showsPrec :: Int -> Pair a -> ShowS #

show :: Pair a -> String #

showList :: [Pair a] -> ShowS #

fromPair :: Pair a -> (a, a) Source #

toPair :: (a, a) -> Pair a Source #