pipes-4.2.0: Compositional pipelines

Safe HaskellTrustworthy
LanguageHaskell2010

Pipes.Internal

Contents

Description

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

This module provides a fast implementation 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

You do not need to worry about this if you do not import this module, since the other modules in this library do not export the constructors or export any functions which can violate the monad transformer laws.

Synopsis

Internal

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

A Proxy is a monad transformer that receives and sends information on both an upstream and downstream interface.

The type variables signify:

  • a' and a - The upstream interface, where (a')s go out and (a)s come in
  • b' and b - The downstream interface, where (b)s go out and (b')s come in
  • m - The base monad
  • r - The return value

Constructors

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

Instances

MonadError e m => MonadError e (Proxy a' a b' b m) Source # 

Methods

throwError :: e -> Proxy a' a b' b m a #

catchError :: Proxy a' a b' b m a -> (e -> Proxy a' a b' b m a) -> Proxy a' a b' b m a #

MonadReader r m => MonadReader r (Proxy a' a b' b m) Source # 

Methods

ask :: Proxy a' a b' b m r #

local :: (r -> r) -> Proxy a' a b' b m a -> Proxy a' a b' b m a #

reader :: (r -> a) -> Proxy a' a b' b m a #

MonadState s m => MonadState s (Proxy a' a b' b m) Source # 

Methods

get :: Proxy a' a b' b m s #

put :: s -> Proxy a' a b' b m () #

state :: (s -> (a, s)) -> Proxy a' a b' b m a #

MonadWriter w m => MonadWriter w (Proxy a' a b' b m) Source # 

Methods

writer :: (a, w) -> Proxy a' a b' b m a #

tell :: w -> Proxy a' a b' b m () #

listen :: Proxy a' a b' b m a -> Proxy a' a b' b m (a, w) #

pass :: Proxy a' a b' b m (a, w -> w) -> Proxy a' a b' b m a #

MFunctor (Proxy a' a b' b) Source # 

Methods

hoist :: Monad m => (forall c. m c -> n c) -> Proxy a' a b' b m b -> Proxy a' a b' b n b #

MMonad (Proxy a' a b' b) Source # 

Methods

embed :: Monad n => (forall c. m c -> Proxy a' a b' b n c) -> Proxy a' a b' b m b -> Proxy a' a b' b n b #

MonadTrans (Proxy a' a b' b) Source # 

Methods

lift :: Monad m => m a -> Proxy a' a b' b m a #

Monad m => Monad (Proxy a' a b' b m) Source # 

Methods

(>>=) :: Proxy a' a b' b m a -> (a -> Proxy a' a b' b m b) -> Proxy a' a b' b m b #

(>>) :: Proxy a' a b' b m a -> Proxy a' a b' b m b -> Proxy a' a b' b m b #

return :: a -> Proxy a' a b' b m a #

fail :: String -> Proxy a' a b' b m a #

Monad m => Functor (Proxy a' a b' b m) Source # 

Methods

fmap :: (a -> b) -> Proxy a' a b' b m a -> Proxy a' a b' b m b #

(<$) :: a -> Proxy a' a b' b m b -> Proxy a' a b' b m a #

Monad m => Applicative (Proxy a' a b' b m) Source # 

Methods

pure :: a -> Proxy a' a b' b m a #

(<*>) :: Proxy a' a b' b m (a -> b) -> Proxy a' a b' b m a -> Proxy a' a b' b m b #

(*>) :: Proxy a' a b' b m a -> Proxy a' a b' b m b -> Proxy a' a b' b m b #

(<*) :: Proxy a' a b' b m a -> Proxy a' a b' b m b -> Proxy a' a b' b m a #

MonadIO m => MonadIO (Proxy a' a b' b m) Source # 

Methods

liftIO :: IO a -> Proxy a' a b' b m a #

MonadPlus m => Alternative (Proxy a' a b' b m) Source # 

Methods

empty :: Proxy a' a b' b m a #

(<|>) :: Proxy a' a b' b m a -> Proxy a' a b' b m a -> Proxy a' a b' b m a #

some :: Proxy a' a b' b m a -> Proxy a' a b' b m [a] #

many :: Proxy a' a b' b m a -> Proxy a' a b' b m [a] #

MonadPlus m => MonadPlus (Proxy a' a b' b m) Source # 

Methods

mzero :: Proxy a' a b' b m a #

mplus :: Proxy a' a b' b m a -> Proxy a' a b' b m a -> Proxy a' a b' b m a #

(Monad m, Monoid r) => Monoid (Proxy a' a b' b m r) Source # 

Methods

mempty :: Proxy a' a b' b m r #

mappend :: Proxy a' a b' b m r -> Proxy a' a b' b m r -> Proxy a' a b' b m r #

mconcat :: [Proxy a' a b' b m r] -> Proxy a' a b' b m r #

unsafeHoist :: Monad m => (forall x. m x -> n x) -> Proxy a' a b' b m r -> Proxy a' a b' b n r Source #

unsafeHoist is like hoist, but faster.

This is labeled as unsafe because you will break the monad transformer laws if you do not pass a monad morphism as the first argument. This function is safe if you pass a monad morphism as the first argument.

observe :: Monad m => Proxy a' a b' b m r -> Proxy 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 small cost to performance, so use this function sparingly.

This function is a convenience for low-level pipes implementers. You do not need to use observe if you stick to the safe API.

data X Source #

The empty type, used to close output ends

When Data.Void is merged into base, this will change to:

type X = Void

closed :: X -> a Source #

Use closed to "handle" impossible outputs