Control.Monad.Schedule.RoundRobin

Documentation

newtype RoundRobinT m a

Any monad can be trivially scheduled by executing all actions after each other, step by step.

Constructors

RoundRobinT

Fields

• unRoundRobin :: m a

Instances

MonadTrans RoundRobinT

Defined in Control.Monad.Schedule.RoundRobin

Methods

lift :: Monad m => m a -> RoundRobinT m a

Monad m => Monad (RoundRobinT m)

Defined in Control.Monad.Schedule.RoundRobin

Methods

(>>=) :: RoundRobinT m a -> (a -> RoundRobinT m b) -> RoundRobinT m b

(>>) :: RoundRobinT m a -> RoundRobinT m b -> RoundRobinT m b

return :: a -> RoundRobinT m a

Functor m => Functor (RoundRobinT m)

Defined in Control.Monad.Schedule.RoundRobin

Methods

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

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

Applicative m => Applicative (RoundRobinT m)

Defined in Control.Monad.Schedule.RoundRobin

Methods

pure :: a -> RoundRobinT m a

(<*>) :: RoundRobinT m (a -> b) -> RoundRobinT m a -> RoundRobinT m b

liftA2 :: (a -> b -> c) -> RoundRobinT m a -> RoundRobinT m b -> RoundRobinT m c

(*>) :: RoundRobinT m a -> RoundRobinT m b -> RoundRobinT m b

(<*) :: RoundRobinT m a -> RoundRobinT m b -> RoundRobinT m a

MonadIO m => MonadIO (RoundRobinT m)

Defined in Control.Monad.Schedule.RoundRobin

Methods

liftIO :: IO a -> RoundRobinT m a

Monad m => MonadSchedule (RoundRobinT m)

Execute only the first action, and leave the others for later, preserving the order.

Defined in Control.Monad.Schedule.RoundRobin

Methods

schedule :: NonEmpty (RoundRobinT m a) -> RoundRobinT m (NonEmpty a, [RoundRobinT m a])