{-# LANGUAGE DerivingStrategies #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
module Test.StateMachine.Types.GenSym
( GenSym
, runGenSym
, genSym
, Counter
, newCounter
)
where
import Control.Monad.State
(State, get, put, runState)
import Data.Typeable
(Typeable)
import Prelude
import Test.StateMachine.Types.References
newtype GenSym a = GenSym (State Counter a)
deriving newtype (forall a b. a -> GenSym b -> GenSym a
forall a b. (a -> b) -> GenSym a -> GenSym b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: forall a b. a -> GenSym b -> GenSym a
$c<$ :: forall a b. a -> GenSym b -> GenSym a
fmap :: forall a b. (a -> b) -> GenSym a -> GenSym b
$cfmap :: forall a b. (a -> b) -> GenSym a -> GenSym b
Functor, Functor GenSym
forall a. a -> GenSym a
forall a b. GenSym a -> GenSym b -> GenSym a
forall a b. GenSym a -> GenSym b -> GenSym b
forall a b. GenSym (a -> b) -> GenSym a -> GenSym b
forall a b c. (a -> b -> c) -> GenSym a -> GenSym b -> GenSym c
forall (f :: * -> *).
Functor f
-> (forall a. a -> f a)
-> (forall a b. f (a -> b) -> f a -> f b)
-> (forall a b c. (a -> b -> c) -> f a -> f b -> f c)
-> (forall a b. f a -> f b -> f b)
-> (forall a b. f a -> f b -> f a)
-> Applicative f
<* :: forall a b. GenSym a -> GenSym b -> GenSym a
$c<* :: forall a b. GenSym a -> GenSym b -> GenSym a
*> :: forall a b. GenSym a -> GenSym b -> GenSym b
$c*> :: forall a b. GenSym a -> GenSym b -> GenSym b
liftA2 :: forall a b c. (a -> b -> c) -> GenSym a -> GenSym b -> GenSym c
$cliftA2 :: forall a b c. (a -> b -> c) -> GenSym a -> GenSym b -> GenSym c
<*> :: forall a b. GenSym (a -> b) -> GenSym a -> GenSym b
$c<*> :: forall a b. GenSym (a -> b) -> GenSym a -> GenSym b
pure :: forall a. a -> GenSym a
$cpure :: forall a. a -> GenSym a
Applicative, Applicative GenSym
forall a. a -> GenSym a
forall a b. GenSym a -> GenSym b -> GenSym b
forall a b. GenSym a -> (a -> GenSym b) -> GenSym b
forall (m :: * -> *).
Applicative m
-> (forall a b. m a -> (a -> m b) -> m b)
-> (forall a b. m a -> m b -> m b)
-> (forall a. a -> m a)
-> Monad m
return :: forall a. a -> GenSym a
$creturn :: forall a. a -> GenSym a
>> :: forall a b. GenSym a -> GenSym b -> GenSym b
$c>> :: forall a b. GenSym a -> GenSym b -> GenSym b
>>= :: forall a b. GenSym a -> (a -> GenSym b) -> GenSym b
$c>>= :: forall a b. GenSym a -> (a -> GenSym b) -> GenSym b
Monad)
runGenSym :: GenSym a -> Counter -> (a, Counter)
runGenSym :: forall a. GenSym a -> Counter -> (a, Counter)
runGenSym (GenSym State Counter a
m) = forall s a. State s a -> s -> (a, s)
runState State Counter a
m
genSym :: Typeable a => GenSym (Reference a Symbolic)
genSym :: forall a. Typeable a => GenSym (Reference a Symbolic)
genSym = forall a. State Counter a -> GenSym a
GenSym forall a b. (a -> b) -> a -> b
$ do
Counter Int
i <- forall s (m :: * -> *). MonadState s m => m s
get
forall s (m :: * -> *). MonadState s m => s -> m ()
put (Int -> Counter
Counter (Int
i forall a. Num a => a -> a -> a
+ Int
1))
forall (m :: * -> *) a. Monad m => a -> m a
return (forall a (r :: * -> *). r a -> Reference a r
Reference (forall a. Typeable a => Var -> Symbolic a
Symbolic (Int -> Var
Var Int
i)))
newtype Counter = Counter Int
deriving stock Int -> Counter -> ShowS
[Counter] -> ShowS
Counter -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Counter] -> ShowS
$cshowList :: [Counter] -> ShowS
show :: Counter -> String
$cshow :: Counter -> String
showsPrec :: Int -> Counter -> ShowS
$cshowsPrec :: Int -> Counter -> ShowS
Show
newCounter :: Counter
newCounter :: Counter
newCounter = Int -> Counter
Counter Int
0