Control.Monad.Trans.Order.Lazy

The Order monad

type Order o = OrderT o Identity

evalOrder :: (forall o. Order o a) -> a

evalOrderWith :: Algorithm -> (forall o. Order o a) -> a

The OrderT monad transformer

data OrderT o m a

Instances

MonadTrans (OrderT o)

Methods

lift :: Monad m => m a -> OrderT o m a

Monad m => Monad (OrderT o m)

Methods

(>>=) :: OrderT o m a -> (a -> OrderT o m b) -> OrderT o m b

(>>) :: OrderT o m a -> OrderT o m b -> OrderT o m b

return :: a -> OrderT o m a

fail :: String -> OrderT o m a

Functor m => Functor (OrderT o m)

Methods

fmap :: (a -> b) -> OrderT o m a -> OrderT o m b

(<$) :: a -> OrderT o m b -> OrderT o m a

Monad m => Applicative (OrderT o m)

Methods

pure :: a -> OrderT o m a

(<*>) :: OrderT o m (a -> b) -> OrderT o m a -> OrderT o m b

(*>) :: OrderT o m a -> OrderT o m b -> OrderT o m b

(<*) :: OrderT o m a -> OrderT o m b -> OrderT o m a

MonadIO m => MonadIO (OrderT o m)

Methods

liftIO :: IO a -> OrderT o m a

MonadPlus m => Alternative (OrderT o m)

Methods

empty :: OrderT o m a

(<|>) :: OrderT o m a -> OrderT o m a -> OrderT o m a

some :: OrderT o m a -> OrderT o m [a]

many :: OrderT o m a -> OrderT o m [a]

MonadPlus m => MonadPlus (OrderT o m)

Methods

mzero :: OrderT o m a

mplus :: OrderT o m a -> OrderT o m a -> OrderT o m a

evalOrderT :: Monad m => (forall o. OrderT o m a) -> m a

evalOrderTWith :: Monad m => Algorithm -> (forall o. OrderT o m a) -> m a

force :: Monad m => OrderT o m ()

Elements

newMinimum :: Monad m => OrderT o m (Element o)

newMaximum :: Monad m => OrderT o m (Element o)

newAfter :: Monad m => Element o -> OrderT o m (Element o)

newBefore :: Monad m => Element o -> OrderT o m (Element o)