{-# LANGUAGE DerivingVia #-}

module Control.Monad.State.Delayed.Trans where

import Control.Monad.State.Delayed.Class
import Control.Monad.State.Delayed.Delayer
import Control.Monad.Trans
import Data.Foreign (unsafeRefEq)
import HPrelude

type DelayedStateT :: Type -> (Type -> Type) -> Type -> Type
newtype DelayedStateT s m a = DelayedStateT (Delayer s -> m a)
  deriving ((forall a b.
 (a -> b) -> DelayedStateT s m a -> DelayedStateT s m b)
-> (forall a b. a -> DelayedStateT s m b -> DelayedStateT s m a)
-> Functor (DelayedStateT s m)
forall a b. a -> DelayedStateT s m b -> DelayedStateT s m a
forall a b. (a -> b) -> DelayedStateT s m a -> DelayedStateT s m b
forall s (m :: * -> *) a b.
Functor m =>
a -> DelayedStateT s m b -> DelayedStateT s m a
forall s (m :: * -> *) a b.
Functor m =>
(a -> b) -> DelayedStateT s m a -> DelayedStateT s m b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
$cfmap :: forall s (m :: * -> *) a b.
Functor m =>
(a -> b) -> DelayedStateT s m a -> DelayedStateT s m b
fmap :: forall a b. (a -> b) -> DelayedStateT s m a -> DelayedStateT s m b
$c<$ :: forall s (m :: * -> *) a b.
Functor m =>
a -> DelayedStateT s m b -> DelayedStateT s m a
<$ :: forall a b. a -> DelayedStateT s m b -> DelayedStateT s m a
Functor, Functor (DelayedStateT s m)
Functor (DelayedStateT s m) =>
(forall a. a -> DelayedStateT s m a)
-> (forall a b.
    DelayedStateT s m (a -> b)
    -> DelayedStateT s m a -> DelayedStateT s m b)
-> (forall a b c.
    (a -> b -> c)
    -> DelayedStateT s m a
    -> DelayedStateT s m b
    -> DelayedStateT s m c)
-> (forall a b.
    DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m b)
-> (forall a b.
    DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m a)
-> Applicative (DelayedStateT s m)
forall a. a -> DelayedStateT s m a
forall a b.
DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m a
forall a b.
DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m b
forall a b.
DelayedStateT s m (a -> b)
-> DelayedStateT s m a -> DelayedStateT s m b
forall a b c.
(a -> b -> c)
-> DelayedStateT s m a
-> DelayedStateT s m b
-> DelayedStateT s m c
forall s (m :: * -> *).
Applicative m =>
Functor (DelayedStateT s m)
forall s (m :: * -> *) a. Applicative m => a -> DelayedStateT s m a
forall s (m :: * -> *) a b.
Applicative m =>
DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m a
forall s (m :: * -> *) a b.
Applicative m =>
DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m b
forall s (m :: * -> *) a b.
Applicative m =>
DelayedStateT s m (a -> b)
-> DelayedStateT s m a -> DelayedStateT s m b
forall s (m :: * -> *) a b c.
Applicative m =>
(a -> b -> c)
-> DelayedStateT s m a
-> DelayedStateT s m b
-> DelayedStateT s m 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
$cpure :: forall s (m :: * -> *) a. Applicative m => a -> DelayedStateT s m a
pure :: forall a. a -> DelayedStateT s m a
$c<*> :: forall s (m :: * -> *) a b.
Applicative m =>
DelayedStateT s m (a -> b)
-> DelayedStateT s m a -> DelayedStateT s m b
<*> :: forall a b.
DelayedStateT s m (a -> b)
-> DelayedStateT s m a -> DelayedStateT s m b
$cliftA2 :: forall s (m :: * -> *) a b c.
Applicative m =>
(a -> b -> c)
-> DelayedStateT s m a
-> DelayedStateT s m b
-> DelayedStateT s m c
liftA2 :: forall a b c.
(a -> b -> c)
-> DelayedStateT s m a
-> DelayedStateT s m b
-> DelayedStateT s m c
$c*> :: forall s (m :: * -> *) a b.
Applicative m =>
DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m b
*> :: forall a b.
DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m b
$c<* :: forall s (m :: * -> *) a b.
Applicative m =>
DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m a
<* :: forall a b.
DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m a
Applicative, Applicative (DelayedStateT s m)
Applicative (DelayedStateT s m) =>
(forall a b.
 DelayedStateT s m a
 -> (a -> DelayedStateT s m b) -> DelayedStateT s m b)
-> (forall a b.
    DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m b)
-> (forall a. a -> DelayedStateT s m a)
-> Monad (DelayedStateT s m)
forall a. a -> DelayedStateT s m a
forall a b.
DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m b
forall a b.
DelayedStateT s m a
-> (a -> DelayedStateT s m b) -> DelayedStateT s m b
forall s (m :: * -> *). Monad m => Applicative (DelayedStateT s m)
forall s (m :: * -> *) a. Monad m => a -> DelayedStateT s m a
forall s (m :: * -> *) a b.
Monad m =>
DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m b
forall s (m :: * -> *) a b.
Monad m =>
DelayedStateT s m a
-> (a -> DelayedStateT s m b) -> DelayedStateT s m 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
$c>>= :: forall s (m :: * -> *) a b.
Monad m =>
DelayedStateT s m a
-> (a -> DelayedStateT s m b) -> DelayedStateT s m b
>>= :: forall a b.
DelayedStateT s m a
-> (a -> DelayedStateT s m b) -> DelayedStateT s m b
$c>> :: forall s (m :: * -> *) a b.
Monad m =>
DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m b
>> :: forall a b.
DelayedStateT s m a -> DelayedStateT s m b -> DelayedStateT s m b
$creturn :: forall s (m :: * -> *) a. Monad m => a -> DelayedStateT s m a
return :: forall a. a -> DelayedStateT s m a
Monad, Monad (DelayedStateT s m)
Monad (DelayedStateT s m) =>
(forall a. IO a -> DelayedStateT s m a)
-> MonadIO (DelayedStateT s m)
forall a. IO a -> DelayedStateT s m a
forall s (m :: * -> *). MonadIO m => Monad (DelayedStateT s m)
forall s (m :: * -> *) a. MonadIO m => IO a -> DelayedStateT s m a
forall (m :: * -> *).
Monad m =>
(forall a. IO a -> m a) -> MonadIO m
$cliftIO :: forall s (m :: * -> *) a. MonadIO m => IO a -> DelayedStateT s m a
liftIO :: forall a. IO a -> DelayedStateT s m a
MonadIO, MonadIO (DelayedStateT s m)
MonadIO (DelayedStateT s m) =>
(forall b.
 ((forall a. DelayedStateT s m a -> IO a) -> IO b)
 -> DelayedStateT s m b)
-> MonadUnliftIO (DelayedStateT s m)
forall b.
((forall a. DelayedStateT s m a -> IO a) -> IO b)
-> DelayedStateT s m b
forall s (m :: * -> *).
MonadUnliftIO m =>
MonadIO (DelayedStateT s m)
forall s (m :: * -> *) b.
MonadUnliftIO m =>
((forall a. DelayedStateT s m a -> IO a) -> IO b)
-> DelayedStateT s m b
forall (m :: * -> *).
MonadIO m =>
(forall b. ((forall a. m a -> IO a) -> IO b) -> m b)
-> MonadUnliftIO m
$cwithRunInIO :: forall s (m :: * -> *) b.
MonadUnliftIO m =>
((forall a. DelayedStateT s m a -> IO a) -> IO b)
-> DelayedStateT s m b
withRunInIO :: forall b.
((forall a. DelayedStateT s m a -> IO a) -> IO b)
-> DelayedStateT s m b
MonadUnliftIO) via ReaderT (Delayer s) m

runDelayedStateT :: (Monad m) => Delayer s -> DelayedStateT s m a -> m a
runDelayedStateT :: forall (m :: * -> *) s a.
Monad m =>
Delayer s -> DelayedStateT s m a -> m a
runDelayedStateT Delayer s
d (DelayedStateT Delayer s -> m a
f) = Delayer s -> m a
f Delayer s
d

instance MonadTrans (DelayedStateT s) where
  lift :: forall (m :: * -> *) a. Monad m => m a -> DelayedStateT s m a
lift = (Delayer s -> m a) -> DelayedStateT s m a
forall s (m :: * -> *) a. (Delayer s -> m a) -> DelayedStateT s m a
DelayedStateT ((Delayer s -> m a) -> DelayedStateT s m a)
-> (m a -> Delayer s -> m a) -> m a -> DelayedStateT s m a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. m a -> Delayer s -> m a
forall a b. a -> b -> a
const

instance (MonadUnliftIO m, MonadState s m) => MonadState s (DelayedStateT s m) where
  state :: forall a. (s -> (a, s)) -> DelayedStateT s m a
state s -> (a, s)
f = (Delayer s -> m a) -> DelayedStateT s m a
forall s (m :: * -> *) a. (Delayer s -> m a) -> DelayedStateT s m a
DelayedStateT ((Delayer s -> m a) -> DelayedStateT s m a)
-> (Delayer s -> m a) -> DelayedStateT s m a
forall a b. (a -> b) -> a -> b
$ \(Delayer NominalDiffTime
timeout MVar (Maybe (DelayerState s))
var) -> do
    let handleStateChange :: s -> m (Maybe (DelayerState s))
handleStateChange s
newState = do
          newDelState <- ((forall a. m a -> IO a) -> IO (DelayerState s))
-> m (DelayerState s)
forall b. ((forall a. m a -> IO a) -> IO b) -> m b
forall (m :: * -> *) b.
MonadUnliftIO m =>
((forall a. m a -> IO a) -> IO b) -> m b
withRunInIO
            (((forall a. m a -> IO a) -> IO (DelayerState s))
 -> m (DelayerState s))
-> ((forall a. m a -> IO a) -> IO (DelayerState s))
-> m (DelayerState s)
forall a b. (a -> b) -> a -> b
$ \forall a. m a -> IO a
runInIO -> NominalDiffTime -> s -> (s -> IO ()) -> IO (DelayerState s)
forall s.
NominalDiffTime -> s -> (s -> IO ()) -> IO (DelayerState s)
mkTimedOutDelayerState NominalDiffTime
timeout s
newState
              ((s -> IO ()) -> IO (DelayerState s))
-> (s -> IO ()) -> IO (DelayerState s)
forall a b. (a -> b) -> a -> b
$ \s
s -> MVar (Maybe (DelayerState s))
-> (Maybe (DelayerState s) -> IO (Maybe (DelayerState s), ()))
-> IO ()
forall (m :: * -> *) a b.
MonadUnliftIO m =>
MVar a -> (a -> m (a, b)) -> m b
modifyMVar MVar (Maybe (DelayerState s))
var ((Maybe (DelayerState s) -> IO (Maybe (DelayerState s), ()))
 -> IO ())
-> (Maybe (DelayerState s) -> IO (Maybe (DelayerState s), ()))
-> IO ()
forall a b. (a -> b) -> a -> b
$ IO (Maybe (DelayerState s), ())
-> Maybe (DelayerState s) -> IO (Maybe (DelayerState s), ())
forall a b. a -> b -> a
const (IO (Maybe (DelayerState s), ())
 -> Maybe (DelayerState s) -> IO (Maybe (DelayerState s), ()))
-> IO (Maybe (DelayerState s), ())
-> Maybe (DelayerState s)
-> IO (Maybe (DelayerState s), ())
forall a b. (a -> b) -> a -> b
$ m () -> IO ()
forall a. m a -> IO a
runInIO (s -> m ()
forall s (m :: * -> *). MonadState s m => s -> m ()
put s
s) IO ()
-> (Maybe (DelayerState s), ()) -> IO (Maybe (DelayerState s), ())
forall (f :: * -> *) a b. Functor f => f a -> b -> f b
$> (Maybe (DelayerState s)
forall a. Maybe a
Nothing, ())
          pure (Just newDelState)

    MVar (Maybe (DelayerState s))
-> (Maybe (DelayerState s) -> m (Maybe (DelayerState s), a)) -> m a
forall (m :: * -> *) a b.
MonadUnliftIO m =>
MVar a -> (a -> m (a, b)) -> m b
modifyMVar MVar (Maybe (DelayerState s))
var ((Maybe (DelayerState s) -> m (Maybe (DelayerState s), a)) -> m a)
-> (Maybe (DelayerState s) -> m (Maybe (DelayerState s), a)) -> m a
forall a b. (a -> b) -> a -> b
$ \Maybe (DelayerState s)
ds'm -> case Maybe (DelayerState s)
ds'm of
      -- no previous suspended state, check if f changes the state
      -- if it does, create a new suspended state
      Maybe (DelayerState s)
Nothing -> do
        baseState <- m s
forall s (m :: * -> *). MonadState s m => m s
get
        let (a, newState) = f baseState
        if unsafeRefEq baseState newState
          then pure (Nothing, a)
          else do
            nvar <- handleStateChange newState
            pure (nvar, a)

      -- there is a previous suspended state
      -- check if f changes the state, if it does, create a new suspended state and cancel the previous one
      Just (DelayerState s
delayedState Async ()
fiber) -> do
        let (a
a, s
newState) = s -> (a, s)
f s
delayedState

        if s -> s -> Bool
forall a. a -> a -> Bool
unsafeRefEq s
delayedState s
newState
          then (Maybe (DelayerState s), a) -> m (Maybe (DelayerState s), a)
forall a. a -> m a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Maybe (DelayerState s)
ds'm, a
a)
          else do
            IO () -> m ()
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO () -> m ()) -> IO () -> m ()
forall a b. (a -> b) -> a -> b
$ Async () -> TimeoutKilled -> IO ()
forall e (m :: * -> *) a.
(Exception e, MonadIO m) =>
Async a -> e -> m ()
cancelWith Async ()
fiber TimeoutKilled
TimeoutKilled
            nvar <- s -> m (Maybe (DelayerState s))
handleStateChange s
newState
            pure (nvar, a)

instance (MonadUnliftIO m, MonadState s m) => MonadDelayedState s (DelayedStateT s m) where
  commit :: DelayedStateT s m ()
commit = (Delayer s -> m ()) -> DelayedStateT s m ()
forall s (m :: * -> *) a. (Delayer s -> m a) -> DelayedStateT s m a
DelayedStateT ((Delayer s -> m ()) -> DelayedStateT s m ())
-> (Delayer s -> m ()) -> DelayedStateT s m ()
forall a b. (a -> b) -> a -> b
$ \(Delayer NominalDiffTime
_ MVar (Maybe (DelayerState s))
var) -> MVar (Maybe (DelayerState s))
-> (Maybe (DelayerState s) -> m ()) -> m ()
forall (m :: * -> *) a b.
MonadUnliftIO m =>
MVar a -> (a -> m b) -> m b
withMVar MVar (Maybe (DelayerState s))
var ((Maybe (DelayerState s) -> m ()) -> m ())
-> (Maybe (DelayerState s) -> m ()) -> m ()
forall a b. (a -> b) -> a -> b
$ \case
    Maybe (DelayerState s)
Nothing -> m ()
forall (f :: * -> *). Applicative f => f ()
pass
    Just (DelayerState s
s Async ()
fiber) -> do
      IO () -> m ()
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO () -> m ()) -> IO () -> m ()
forall a b. (a -> b) -> a -> b
$ Async () -> TimeoutKilled -> IO ()
forall e (m :: * -> *) a.
(Exception e, MonadIO m) =>
Async a -> e -> m ()
cancelWith Async ()
fiber TimeoutKilled
TimeoutKilled
      s -> m ()
forall s (m :: * -> *). MonadState s m => s -> m ()
put s
s