{-# LANGUAGE Rank2Types #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE UndecidableInstances #-}
module Control.Monad.Trans.Loop (
LoopT(..),
stepLoopT,
continue,
exit,
continueWith,
exitWith,
foreach,
while,
doWhile,
once,
repeatLoopT,
iterateLoopT,
liftLocalLoopT,
) where
import Control.Applicative (Applicative(pure, (<*>)))
import Control.Monad.Base (MonadBase(liftBase), liftBaseDefault)
import Control.Monad.IO.Class (MonadIO(liftIO))
import Control.Monad.Trans.Class (MonadTrans(lift))
newtype LoopT c e m a = LoopT
{ forall c e (m :: * -> *) a.
LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
runLoopT :: forall r.
(c -> m r)
-> (e -> m r)
-> (a -> m r)
-> m r
}
instance Functor (LoopT c e m) where
fmap :: forall a b. (a -> b) -> LoopT c e m a -> LoopT c e m b
fmap a -> b
f LoopT c e m a
m = (forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r)
-> LoopT c e m b
forall c e (m :: * -> *) a.
(forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
LoopT ((forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r)
-> LoopT c e m b)
-> (forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r)
-> LoopT c e m b
forall a b. (a -> b) -> a -> b
$ \c -> m r
next e -> m r
fin b -> m r
cont -> LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
forall c e (m :: * -> *) a.
LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
runLoopT LoopT c e m a
m c -> m r
next e -> m r
fin (b -> m r
cont (b -> m r) -> (a -> b) -> a -> m r
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> b
f)
instance Applicative (LoopT c e m) where
pure :: forall a. a -> LoopT c e m a
pure a
a = (forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
forall c e (m :: * -> *) a.
(forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
LoopT ((forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a)
-> (forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
forall a b. (a -> b) -> a -> b
$ \c -> m r
_ e -> m r
_ a -> m r
cont -> a -> m r
cont a
a
LoopT c e m (a -> b)
f1 <*> :: forall a b. LoopT c e m (a -> b) -> LoopT c e m a -> LoopT c e m b
<*> LoopT c e m a
f2 = (forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r)
-> LoopT c e m b
forall c e (m :: * -> *) a.
(forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
LoopT ((forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r)
-> LoopT c e m b)
-> (forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r)
-> LoopT c e m b
forall a b. (a -> b) -> a -> b
$ \c -> m r
next e -> m r
fin b -> m r
cont ->
LoopT c e m (a -> b)
-> forall r. (c -> m r) -> (e -> m r) -> ((a -> b) -> m r) -> m r
forall c e (m :: * -> *) a.
LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
runLoopT LoopT c e m (a -> b)
f1 c -> m r
next e -> m r
fin (((a -> b) -> m r) -> m r) -> ((a -> b) -> m r) -> m r
forall a b. (a -> b) -> a -> b
$ \a -> b
f ->
LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
forall c e (m :: * -> *) a.
LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
runLoopT LoopT c e m a
f2 c -> m r
next e -> m r
fin (b -> m r
cont (b -> m r) -> (a -> b) -> a -> m r
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> b
f)
instance Monad (LoopT c e m) where
return :: forall a. a -> LoopT c e m a
return a
a = (forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
forall c e (m :: * -> *) a.
(forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
LoopT ((forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a)
-> (forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
forall a b. (a -> b) -> a -> b
$ \c -> m r
_ e -> m r
_ a -> m r
cont -> a -> m r
cont a
a
LoopT c e m a
m >>= :: forall a b. LoopT c e m a -> (a -> LoopT c e m b) -> LoopT c e m b
>>= a -> LoopT c e m b
k = (forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r)
-> LoopT c e m b
forall c e (m :: * -> *) a.
(forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
LoopT ((forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r)
-> LoopT c e m b)
-> (forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r)
-> LoopT c e m b
forall a b. (a -> b) -> a -> b
$ \c -> m r
next e -> m r
fin b -> m r
cont ->
LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
forall c e (m :: * -> *) a.
LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
runLoopT LoopT c e m a
m c -> m r
next e -> m r
fin ((a -> m r) -> m r) -> (a -> m r) -> m r
forall a b. (a -> b) -> a -> b
$ \a
a ->
LoopT c e m b
-> forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r
forall c e (m :: * -> *) a.
LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
runLoopT (a -> LoopT c e m b
k a
a) c -> m r
next e -> m r
fin b -> m r
cont
instance MonadTrans (LoopT c e) where
lift :: forall (m :: * -> *) a. Monad m => m a -> LoopT c e m a
lift m a
m = (forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
forall c e (m :: * -> *) a.
(forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
LoopT ((forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a)
-> (forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
forall a b. (a -> b) -> a -> b
$ \c -> m r
_ e -> m r
_ a -> m r
cont -> m a
m m a -> (a -> m r) -> m r
forall a b. m a -> (a -> m b) -> m b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= a -> m r
cont
instance MonadIO m => MonadIO (LoopT c e m) where
liftIO :: forall a. IO a -> LoopT c e m a
liftIO = m a -> LoopT c e m a
forall (m :: * -> *) a. Monad m => m a -> LoopT c e m a
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift (m a -> LoopT c e m a) -> (IO a -> m a) -> IO a -> LoopT c e m a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. IO a -> m a
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO
instance MonadBase b m => MonadBase b (LoopT c e m) where
liftBase :: forall α. b α -> LoopT c e m α
liftBase = b α -> LoopT c e m α
forall (t :: (* -> *) -> * -> *) (b :: * -> *) (m :: * -> *) α.
(MonadTrans t, MonadBase b m) =>
b α -> t m α
liftBaseDefault
stepLoopT :: Monad m => LoopT c e m c -> (c -> m e) -> m e
stepLoopT :: forall (m :: * -> *) c e.
Monad m =>
LoopT c e m c -> (c -> m e) -> m e
stepLoopT LoopT c e m c
body c -> m e
next = LoopT c e m c
-> forall r. (c -> m r) -> (e -> m r) -> (c -> m r) -> m r
forall c e (m :: * -> *) a.
LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
runLoopT LoopT c e m c
body c -> m e
next e -> m e
forall a. a -> m a
forall (m :: * -> *) a. Monad m => a -> m a
return c -> m e
next
continue :: LoopT () e m a
continue :: forall e (m :: * -> *) a. LoopT () e m a
continue = () -> LoopT () e m a
forall c e (m :: * -> *) a. c -> LoopT c e m a
continueWith ()
exit :: LoopT c () m a
exit :: forall c (m :: * -> *) a. LoopT c () m a
exit = () -> LoopT c () m a
forall e c (m :: * -> *) a. e -> LoopT c e m a
exitWith ()
continueWith :: c -> LoopT c e m a
continueWith :: forall c e (m :: * -> *) a. c -> LoopT c e m a
continueWith c
c = (forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
forall c e (m :: * -> *) a.
(forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
LoopT ((forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a)
-> (forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
forall a b. (a -> b) -> a -> b
$ \c -> m r
next e -> m r
_ a -> m r
_ -> c -> m r
next c
c
exitWith :: e -> LoopT c e m a
exitWith :: forall e c (m :: * -> *) a. e -> LoopT c e m a
exitWith e
e = (forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
forall c e (m :: * -> *) a.
(forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
LoopT ((forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a)
-> (forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
forall a b. (a -> b) -> a -> b
$ \c -> m r
_ e -> m r
fin a -> m r
_ -> e -> m r
fin e
e
foreach :: Monad m => [a] -> (a -> LoopT c () m c) -> m ()
foreach :: forall (m :: * -> *) a c.
Monad m =>
[a] -> (a -> LoopT c () m c) -> m ()
foreach [a]
list a -> LoopT c () m c
body = [a] -> m ()
loop [a]
list
where loop :: [a] -> m ()
loop [] = () -> m ()
forall a. a -> m a
forall (m :: * -> *) a. Monad m => a -> m a
return ()
loop (a
x:[a]
xs) = LoopT c () m c -> (c -> m ()) -> m ()
forall (m :: * -> *) c e.
Monad m =>
LoopT c e m c -> (c -> m e) -> m e
stepLoopT (a -> LoopT c () m c
body a
x) (\c
_ -> [a] -> m ()
loop [a]
xs)
while :: Monad m => m Bool -> LoopT c () m c -> m ()
while :: forall (m :: * -> *) c. Monad m => m Bool -> LoopT c () m c -> m ()
while m Bool
cond LoopT c () m c
body = m ()
loop
where loop :: m ()
loop = do Bool
b <- m Bool
cond
if Bool
b then LoopT c () m c -> (c -> m ()) -> m ()
forall (m :: * -> *) c e.
Monad m =>
LoopT c e m c -> (c -> m e) -> m e
stepLoopT LoopT c () m c
body (\c
_ -> m ()
loop)
else () -> m ()
forall a. a -> m a
forall (m :: * -> *) a. Monad m => a -> m a
return ()
doWhile :: Monad m => LoopT a a m a -> m Bool -> m a
doWhile :: forall (m :: * -> *) a. Monad m => LoopT a a m a -> m Bool -> m a
doWhile LoopT a a m a
body m Bool
cond = m a
loop
where loop :: m a
loop = LoopT a a m a -> (a -> m a) -> m a
forall (m :: * -> *) c e.
Monad m =>
LoopT c e m c -> (c -> m e) -> m e
stepLoopT LoopT a a m a
body ((a -> m a) -> m a) -> (a -> m a) -> m a
forall a b. (a -> b) -> a -> b
$ \a
a -> do
Bool
b <- m Bool
cond
if Bool
b then m a
loop
else a -> m a
forall a. a -> m a
forall (m :: * -> *) a. Monad m => a -> m a
return a
a
once :: Monad m => LoopT a a m a -> m a
once :: forall (m :: * -> *) a. Monad m => LoopT a a m a -> m a
once LoopT a a m a
body = LoopT a a m a
-> forall r. (a -> m r) -> (a -> m r) -> (a -> m r) -> m r
forall c e (m :: * -> *) a.
LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
runLoopT LoopT a a m a
body a -> m a
forall a. a -> m a
forall (m :: * -> *) a. Monad m => a -> m a
return a -> m a
forall a. a -> m a
forall (m :: * -> *) a. Monad m => a -> m a
return a -> m a
forall a. a -> m a
forall (m :: * -> *) a. Monad m => a -> m a
return
repeatLoopT :: Monad m => LoopT c e m a -> m e
repeatLoopT :: forall (m :: * -> *) c e a. Monad m => LoopT c e m a -> m e
repeatLoopT LoopT c e m a
body = m e
loop
where loop :: m e
loop = LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
forall c e (m :: * -> *) a.
LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
runLoopT LoopT c e m a
body (\c
_ -> m e
loop) e -> m e
forall a. a -> m a
forall (m :: * -> *) a. Monad m => a -> m a
return (\a
_ -> m e
loop)
iterateLoopT :: Monad m => c -> (c -> LoopT c e m c) -> m e
iterateLoopT :: forall (m :: * -> *) c e.
Monad m =>
c -> (c -> LoopT c e m c) -> m e
iterateLoopT c
z c -> LoopT c e m c
body = c -> m e
loop c
z
where loop :: c -> m e
loop c
c = LoopT c e m c -> (c -> m e) -> m e
forall (m :: * -> *) c e.
Monad m =>
LoopT c e m c -> (c -> m e) -> m e
stepLoopT (c -> LoopT c e m c
body c
c) c -> m e
loop
liftLocalLoopT :: Monad m => (forall a. m a -> m a) -> LoopT c e m b -> LoopT c e m b
liftLocalLoopT :: forall (m :: * -> *) c e b.
Monad m =>
(forall a. m a -> m a) -> LoopT c e m b -> LoopT c e m b
liftLocalLoopT forall a. m a -> m a
f LoopT c e m b
cb = (forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r)
-> LoopT c e m b
forall c e (m :: * -> *) a.
(forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r)
-> LoopT c e m a
LoopT ((forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r)
-> LoopT c e m b)
-> (forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r)
-> LoopT c e m b
forall a b. (a -> b) -> a -> b
$ \c -> m r
next e -> m r
fin b -> m r
cont -> do
m r
m <- m (m r) -> m (m r)
forall a. m a -> m a
f (m (m r) -> m (m r)) -> m (m r) -> m (m r)
forall a b. (a -> b) -> a -> b
$ LoopT c e m b
-> forall r. (c -> m r) -> (e -> m r) -> (b -> m r) -> m r
forall c e (m :: * -> *) a.
LoopT c e m a
-> forall r. (c -> m r) -> (e -> m r) -> (a -> m r) -> m r
runLoopT LoopT c e m b
cb (m r -> m (m r)
forall a. a -> m a
forall (m :: * -> *) a. Monad m => a -> m a
return (m r -> m (m r)) -> (c -> m r) -> c -> m (m r)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. c -> m r
next) (m r -> m (m r)
forall a. a -> m a
forall (m :: * -> *) a. Monad m => a -> m a
return (m r -> m (m r)) -> (e -> m r) -> e -> m (m r)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. e -> m r
fin) (m r -> m (m r)
forall a. a -> m a
forall (m :: * -> *) a. Monad m => a -> m a
return (m r -> m (m r)) -> (b -> m r) -> b -> m (m r)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. b -> m r
cont)
m r
m