Servant.Utils.Enter

Documentation

class Enter typ arg ret | typ arg -> ret, typ ret -> arg where

Minimal complete definition

enter

Methods

enter :: arg -> typ -> ret

Instances

Enter (m a) ((:~>) * m n) (n a)

Methods

enter :: (* :~> m) n -> m a -> n a

Enter b arg ret => Enter (a -> b) arg (a -> ret)

Methods

enter :: arg -> (a -> b) -> a -> ret

(Enter typ1 arg1 ret1, Enter typ2 arg2 ret2, (~) * arg1 arg2) => Enter ((:<|>) typ1 typ2) arg1 ((:<|>) ret1 ret2)

Methods

enter :: arg1 -> (typ1 :<|> typ2) -> ret1 :<|> ret2

Servant combinators

Useful instances

liftNat :: (MonadTrans t, Monad m) => m :~> t m

Like lift.

runReaderTNat :: r -> ReaderT r m :~> m

evalStateTLNat :: Monad m => s -> StateT s m :~> m

evalStateTSNat :: Monad m => s -> StateT s m :~> m

logWriterTSNat :: MonadIO m => (w -> IO ()) -> WriterT w m :~> m

Log the contents of WriterT with the function provided as the first argument, and return the value of the WriterT computation

logWriterTLNat :: MonadIO m => (w -> IO ()) -> WriterT w m :~> m

Like logWriterTSNat, but for strict WriterT.

hoistNat :: (MFunctor t, Monad m) => (m :~> n) -> t m :~> t n

Like mmorph's hoist.

embedNat :: (MMonad t, Monad n) => (m :~> t n) -> t m :~> t n

Like mmorph's embed.

squashNat :: (Monad m, MMonad t) => t (t m) :~> t m

Like mmorph's squash.

generalizeNat :: Applicative m => Identity :~> m

Like mmorph's generalize.

natural-transformation re-exports

newtype (k :~> f) g :: forall k. (k -> *) -> (k -> *) -> * infixr 0

A natural transformation suitable for storing in a container.

Constructors

NT

Fields

• ($$) :: (~>) k f g

Instances

Transformation k f g ((:~>) k f g)

Methods

(#) :: t -> forall a. g a -> (k :~> f) g a

Enter (m a) ((:~>) * m n) (n a)

Methods

enter :: (* :~> m) n -> m a -> n a

Category (k -> *) ((:~>) k)

Methods

id :: cat a a

(.) :: cat b c -> cat a b -> cat a c

(~) (k -> *) f g => Semigroup ((:~>) k f g)

Methods

(<>) :: (k :~> f) g -> (k :~> f) g -> (k :~> f) g

sconcat :: NonEmpty ((k :~> f) g) -> (k :~> f) g

stimes :: Integral b => b -> (k :~> f) g -> (k :~> f) g

(~) (k -> *) f g => Monoid ((:~>) k f g)

Methods

mempty :: (k :~> f) g

mappend :: (k :~> f) g -> (k :~> f) g -> (k :~> f) g

mconcat :: [(k :~> f) g] -> (k :~> f) g