pipes-3.1.0: Compositional pipelines

Control.Proxy.Core.Fast

Contents

Description

This is an internal module, meaning that it is unsafe to import unless you understand the risks.

This module provides the fast proxy implementation, which achieves its speed by weakening the monad transformer laws. These laws do not hold if you can pattern match on the constructors, as the following counter-example illustrates:

lift . return = M . return . Pure

return = Pure

lift . return /= return

These laws only hold when viewed through certain safe observation functions, like runProxy and observe.

Also, you really should not use the constructors anyway, let alone the concrete type and instead you should stick to the Proxy type class API. This not only ensures that your code does not violate the monad transformer laws, but also guarantees that it works with the other proxy implementations and with any proxy transformers.

Synopsis

# Types

data ProxyFast a' a b' b m r Source #

A ProxyFast communicates with an upstream interface and a downstream interface.

The type variables of ProxyFast req_a' resp_a req_b' resp_b m r signify:

• req_a' - The request supplied to the upstream interface
• resp_a - The response provided by the upstream interface
• req_b' - The request supplied by the downstream interface
• resp_b - The response provided to the downstream interface
• m  - The base monad
• r  - The final return value

Constructors

 Request a' (a -> ProxyFast a' a b' b m r) Respond b (b' -> ProxyFast a' a b' b m r) M (m (ProxyFast a' a b' b m r)) Pure r

Instances

 Source # MethodsliftIO_P :: MonadIO m => IO r -> ProxyFast a' a b' b m r Source # Source # Methods(\>\) :: Monad m => (b' -> ProxyFast a' a x' x m b) -> (c' -> ProxyFast b' b x' x m c) -> c' -> ProxyFast a' a x' x m c Source #(/>/) :: Monad m => (a -> ProxyFast x' x b' b m a') -> (b -> ProxyFast x' x c' c m b') -> a -> ProxyFast x' x c' c m a' Source # Source # Methodsrequest :: Monad m => a' -> ProxyFast a' a b' b m a Source #respond :: Monad m => b -> ProxyFast a' a b' b m b' Source #(>->) :: Monad m => (b' -> ProxyFast a' a b' b m r) -> (c' -> ProxyFast b' b c' c m r) -> c' -> ProxyFast a' a c' c m r Source #(>~>) :: Monad m => (a -> ProxyFast a' a b' b m r) -> (b -> ProxyFast b' b c' c m r) -> a -> ProxyFast a' a c' c m r Source #return_P :: Monad m => r -> ProxyFast a' a b' b m r Source #(?>=) :: Monad m => ProxyFast a' a b' b m r -> (r -> ProxyFast a' a b' b m r') -> ProxyFast a' a b' b m r' Source #lift_P :: Monad m => m r -> ProxyFast a' a b' b m r Source #hoist_P :: Monad m => (forall r. m r -> n r) -> ProxyFast a' a b' b m r' -> ProxyFast a' a b' b n r' Source # MonadTrans (ProxyFast a' a b' b) Source # Only satisfies laws modulo observe Methodslift :: Monad m => m a -> ProxyFast a' a b' b m a # MFunctor (ProxyFast a' a b' b) Source # Methodshoist :: Monad m => (forall c. m c -> n c) -> ProxyFast a' a b' b m b -> ProxyFast a' a b' b n b Source # Monad m => Monad (ProxyFast a' a b' b m) Source # Methods(>>=) :: ProxyFast a' a b' b m a -> (a -> ProxyFast a' a b' b m b) -> ProxyFast a' a b' b m b #(>>) :: ProxyFast a' a b' b m a -> ProxyFast a' a b' b m b -> ProxyFast a' a b' b m b #return :: a -> ProxyFast a' a b' b m a #fail :: String -> ProxyFast a' a b' b m a # Monad m => Functor (ProxyFast a' a b' b m) Source # Methodsfmap :: (a -> b) -> ProxyFast a' a b' b m a -> ProxyFast a' a b' b m b #(<\$) :: a -> ProxyFast a' a b' b m b -> ProxyFast a' a b' b m a # Monad m => Applicative (ProxyFast a' a b' b m) Source # Methodspure :: a -> ProxyFast a' a b' b m a #(<*>) :: ProxyFast a' a b' b m (a -> b) -> ProxyFast a' a b' b m a -> ProxyFast a' a b' b m b #(*>) :: ProxyFast a' a b' b m a -> ProxyFast a' a b' b m b -> ProxyFast a' a b' b m b #(<*) :: ProxyFast a' a b' b m a -> ProxyFast a' a b' b m b -> ProxyFast a' a b' b m a # MonadIO m => MonadIO (ProxyFast a' a b' b m) Source # MethodsliftIO :: IO a -> ProxyFast a' a b' b m a #

# Run Sessions

The following commands run self-sufficient proxies, converting them back to the base monad.

These are the only functions specific to the ProxyFast type. Everything else programs generically over the Proxy type class.

Use runProxyK if you are running proxies nested within proxies. It provides a Kleisli arrow as its result that you can pass to another runProxy / runProxyK command.

runProxy :: Monad m => (() -> ProxyFast a' () () b m r) -> m r Source #

Run a self-sufficient ProxyFast Kleisli arrow, converting it back to the base monad

runProxyK :: Monad m => (() -> ProxyFast a' () () b m r) -> () -> m r Source #

Run a self-sufficient ProxyFast Kleisli arrow, converting it back to a Kleisli arrow in the base monad

runPipe :: Monad m => ProxyFast a' () () b m r -> m r Source #

Run the Pipe monad transformer, converting it back to the base monad

# Safety

observe :: Monad m => ProxyFast a' a b' b m r -> ProxyFast a' a b' b m r Source #

The monad transformer laws are correct when viewed through the observe function:

observe (lift (return r)) = observe (return r)

observe (lift (m >>= f)) = observe (lift m >>= lift . f)

This correctness comes at a moderate cost to performance, so use this function sparingly or else you would be better off using Control.Proxy.Core.Correct.

You do not need to use this function if you use the safe API exported from Control.Proxy, which does not export any functions or constructors that can violate the monad transformer laws.