Safe Haskell	Safe
Language	Haskell2010

Data.Profunctor.Extra

Synopsis

type (+) = Either
rgt :: (a -> b) -> (a + b) -> b
rgt' :: (Void + b) -> b
lft :: (b -> a) -> (a + b) -> a
lft' :: (a + Void) -> a
swp :: (a1, a2) -> (a2, a1)
eswp :: (a1 + a2) -> a2 + a1
fork :: a -> (a, a)
join :: (a + a) -> a
eval :: (a, a -> b) -> b
apply :: (b -> a, b) -> a
coeval :: b -> ((b -> a) + a) -> a
branch :: (a -> Bool) -> b -> c -> a -> b + c
branch' :: (a -> Bool) -> a -> a + a
assocl :: (a, (b, c)) -> ((a, b), c)
assocr :: ((a, b), c) -> (a, (b, c))
eassocl :: (a + (b + c)) -> (a + b) + c
eassocr :: ((a + b) + c) -> a + (b + c)
fstrong :: Functor f => f a -> b -> f (a, b)
fchoice :: Traversable f => f (a + b) -> f a + b
forget1 :: ((c, a) -> (c, b)) -> a -> b
forget2 :: ((a, c) -> (b, c)) -> a -> b
forgetl :: ((c + a) -> c + b) -> a -> b
forgetr :: ((a + c) -> b + c) -> a -> b
unarr :: Comonad w => Sieve p w => p a b -> a -> b
peval :: Strong p => p a (a -> b) -> p a b
constl :: Profunctor p => b -> p b c -> p a c
constr :: Profunctor p => c -> p a b -> p a c
shiftl :: Profunctor p => p (a + b) c -> p b (c + d)
shiftr :: Profunctor p => p b (c, d) -> p (a, b) c
coercer :: Profunctor p => Contravariant (p a) => p a b -> p a c
coercer' :: Representable p => Contravariant (Rep p) => p a b -> p a c
coercel :: Profunctor p => Bifunctor p => p a b -> p c b
coercel' :: Corepresentable p => Contravariant (Corep p) => p a b -> p c b
strong :: Strong p => ((a, b) -> c) -> p a b -> p a c
costrong :: Costrong p => ((a, b) -> c) -> p c a -> p b a
choice :: Choice p => (c -> a + b) -> p b a -> p c a
cochoice :: Cochoice p => (c -> a + b) -> p a c -> p a b
pull :: Strong p => p a b -> p a (a, b)
pull' :: Strong p => p b c -> p (a, b) b
lift :: Representable p => ((a -> Rep p b) -> s -> Rep p t) -> p a b -> p s t
lower :: Corepresentable p => ((Corep p a -> b) -> Corep p s -> t) -> p a b -> p s t
star :: Applicative f => Star f a a
toStar :: Sieve p f => p d c -> Star f d c
fromStar :: Representable p => Star (Rep p) a b -> p a b
costar :: Foldable f => Monoid b => (a -> b) -> Costar f a b
uncostar :: Applicative f => Costar f a b -> a -> b
toCostar :: Cosieve p f => p a b -> Costar f a b
fromCostar :: Corepresentable p => Costar (Corep p) a b -> p a b
pushr :: Closed p => (forall x. Applicative (p x)) => p (a, b) c -> p a b -> p a c
pushl :: Closed p => (forall x. Applicative (p x)) => p a c -> p b c -> p a (b -> c)
ppure :: Profunctor p => (forall x. Applicative (p x)) => b -> p a b
(@@@) :: Profunctor p => (forall x. Applicative (p x)) => p a1 b1 -> p a2 b2 -> p (a1, a2) (b1, b2)
pappend :: Profunctor p => (forall x. Applicative (p x)) => p a1 b1 -> p a2 b2 -> p (a1, a2) (b1, b2)
pdivide :: Profunctor p => (forall x. Applicative (p x)) => (a -> (a1, a2)) -> p a1 b -> p a2 b -> p a b
pdivided :: Profunctor p => (forall x. Applicative (p x)) => p a1 b -> p a2 b -> p (a1, a2) b
papply :: Profunctor p => (forall x. Applicative (p x)) => p a (b -> c) -> p a b -> p a c
pliftA2 :: Profunctor p => (forall x. Applicative (p x)) => ((b1, b2) -> b) -> p a b1 -> p a b2 -> p a b

Documentation

type (+) = Either infixr 5 Source #

rgt :: (a -> b) -> (a + b) -> b Source #

rgt' :: (Void + b) -> b Source #

lft :: (b -> a) -> (a + b) -> a Source #

lft' :: (a + Void) -> a Source #

swp :: (a1, a2) -> (a2, a1) Source #

eswp :: (a1 + a2) -> a2 + a1 Source #

fork :: a -> (a, a) Source #

join :: (a + a) -> a Source #

eval :: (a, a -> b) -> b Source #

apply :: (b -> a, b) -> a Source #

coeval :: b -> ((b -> a) + a) -> a Source #

branch :: (a -> Bool) -> b -> c -> a -> b + c Source #

branch' :: (a -> Bool) -> a -> a + a Source #

assocl :: (a, (b, c)) -> ((a, b), c) Source #

assocr :: ((a, b), c) -> (a, (b, c)) Source #

eassocl :: (a + (b + c)) -> (a + b) + c Source #

eassocr :: ((a + b) + c) -> a + (b + c) Source #

fstrong :: Functor f => f a -> b -> f (a, b) Source #

fchoice :: Traversable f => f (a + b) -> f a + b Source #

forget1 :: ((c, a) -> (c, b)) -> a -> b Source #

forget2 :: ((a, c) -> (b, c)) -> a -> b Source #

forgetl :: ((c + a) -> c + b) -> a -> b Source #

forgetr :: ((a + c) -> b + c) -> a -> b Source #

unarr :: Comonad w => Sieve p w => p a b -> a -> b Source #

peval :: Strong p => p a (a -> b) -> p a b Source #

constl :: Profunctor p => b -> p b c -> p a c Source #

constr :: Profunctor p => c -> p a b -> p a c Source #

shiftl :: Profunctor p => p (a + b) c -> p b (c + d) Source #

shiftr :: Profunctor p => p b (c, d) -> p (a, b) c Source #

coercer :: Profunctor p => Contravariant (p a) => p a b -> p a c Source #

coercer' :: Representable p => Contravariant (Rep p) => p a b -> p a c Source #

coercel :: Profunctor p => Bifunctor p => p a b -> p c b Source #

coercel' :: Corepresentable p => Contravariant (Corep p) => p a b -> p c b Source #

strong :: Strong p => ((a, b) -> c) -> p a b -> p a c Source #

costrong :: Costrong p => ((a, b) -> c) -> p c a -> p b a Source #

choice :: Choice p => (c -> a + b) -> p b a -> p c a Source #

cochoice :: Cochoice p => (c -> a + b) -> p a c -> p a b Source #

pull :: Strong p => p a b -> p a (a, b) Source #

pull' :: Strong p => p b c -> p (a, b) b Source #

lift :: Representable p => ((a -> Rep p b) -> s -> Rep p t) -> p a b -> p s t Source #

lower :: Corepresentable p => ((Corep p a -> b) -> Corep p s -> t) -> p a b -> p s t Source #

star :: Applicative f => Star f a a Source #

toStar :: Sieve p f => p d c -> Star f d c Source #

fromStar :: Representable p => Star (Rep p) a b -> p a b Source #

costar :: Foldable f => Monoid b => (a -> b) -> Costar f a b Source #

uncostar :: Applicative f => Costar f a b -> a -> b Source #

toCostar :: Cosieve p f => p a b -> Costar f a b Source #

fromCostar :: Corepresentable p => Costar (Corep p) a b -> p a b Source #

pushr :: Closed p => (forall x. Applicative (p x)) => p (a, b) c -> p a b -> p a c Source #

pushl :: Closed p => (forall x. Applicative (p x)) => p a c -> p b c -> p a (b -> c) Source #

ppure :: Profunctor p => (forall x. Applicative (p x)) => b -> p a b Source #

(@@@) :: Profunctor p => (forall x. Applicative (p x)) => p a1 b1 -> p a2 b2 -> p (a1, a2) (b1, b2) infixr 3 Source #

Profunctor version of *** from Arrow.

p * x ≡ dimap fork eval (p @@@ x)

pappend :: Profunctor p => (forall x. Applicative (p x)) => p a1 b1 -> p a2 b2 -> p (a1, a2) (b1, b2) Source #

pdivide :: Profunctor p => (forall x. Applicative (p x)) => (a -> (a1, a2)) -> p a1 b -> p a2 b -> p a b Source #

Profunctor equivalent of divide.

pdivided :: Profunctor p => (forall x. Applicative (p x)) => p a1 b -> p a2 b -> p (a1, a2) b Source #

Profunctor equivalent of divided.

papply :: Profunctor p => (forall x. Applicative (p x)) => p a (b -> c) -> p a b -> p a c Source #

Profunctor equivalent of <*>.

pliftA2 :: Profunctor p => (forall x. Applicative (p x)) => ((b1, b2) -> b) -> p a b1 -> p a b2 -> p a b Source #

Profunctor equivalent of liftA2.