hs-functors-0.1.4.0: Functors from products of Haskell and its dual to Haskell (Index)

hs-functors-0.1.4.0: Functors from products of Haskell and its dual to Haskell

Index

&&&	Data.Profunctor
***	Data.Profunctor
+++	Data.Profunctor
<<=	Control.Comonad
<<^	Data.Profunctor
=<=	Control.Comonad
=>=	Control.Comonad
=>>	Control.Comonad
>$	Data.Functor.Contravariant
>$<	Data.Functor.Contravariant
>>^	Data.Profunctor
ana	Data.Fix
anaM	Data.Fix
anaW	Data.Fix
bicollect	Data.Bicotraversable
bicosequence	Data.Bicotraversable
Bicotraversable	Data.Bicotraversable
bicotraverse	Data.Bicotraversable
Biff
1 (Type/Class)	Data.Bifunctor.Biff
2 (Data Constructor)	Data.Bifunctor.Biff
braid	Data.Bifunctor.Braided
Braided	Data.Bifunctor.Braided
cata	Data.Fix
cataM	Data.Fix
cataW	Data.Fix
Closed	Data.Profunctor
closed	Data.Profunctor
Codensity
1 (Type/Class)	Control.Monad.Codensity
2 (Data Constructor)	Control.Monad.Codensity
codensity	Control.Monad.Codensity
Cofree
1 (Type/Class)	Control.Comonad.Cofree
2 (Data Constructor)	Control.Comonad.Cofree
coiter	Control.Comonad.Cofree
coiterW	Control.Comonad.Cofree
Cokleisli
1 (Type/Class)	Control.Comonad
2 (Data Constructor)	Control.Comonad
colift	Control.Comonad.Trans.Class
collect	Data.Cotraversable
Comonad	Control.Comonad
ComonadTrans	Control.Comonad.Trans.Class
ComposeT
1 (Type/Class)	Control.Monad.Trans.Compose
2 (Data Constructor)	Control.Monad.Trans.Compose
copure	Control.Comonad
cosequence	Data.Cotraversable
Costrong	Data.Profunctor
costrongL	Data.Profunctor
costrongR	Data.Profunctor
Cotraversable	Data.Cotraversable
cotraverse	Data.Cotraversable
cut	Control.Comonad
Density
1 (Type/Class)	Control.Comonad.Density
2 (Data Constructor)	Control.Comonad.Density
dimap	Data.Profunctor
Fix
1 (Type/Class)	Data.Fix
2 (Data Constructor)	Data.Fix
fold	Control.Monad.Free
Free
1 (Type/Class)	Control.Monad.Free
2 (Data Constructor)	Control.Monad.Free
Functor	Data.Functor.Contravariant
getComposeT	Control.Monad.Trans.Compose
gmap	Data.Functor.Contravariant
head	Control.Comonad.Cofree
iter	Control.Monad.Free
iterA	Control.Monad.Free
Join
1 (Type/Class)	Data.Functor.Join
2 (Data Constructor)	Data.Functor.Join
lift
1 (Function)	Control.Comonad.Density
2 (Function)	Control.Monad.Free
lmap	Data.Profunctor
lower	Control.Comonad.Cofree
map
1 (Function)	Control.Monad.Free
2 (Function)	Control.Comonad.Cofree
mapFix	Data.Fix
mbind	Control.Monad.Morph
MFunctor	Control.Monad.Morph
mjoin	Control.Monad.Morph
mmap	Control.Monad.Morph
MMonad	Control.Monad.Morph
Op1
1 (Type/Class)	Data.Functor.Contravariant
2 (Data Constructor)	Data.Functor.Contravariant
op1	Data.Functor.Contravariant
Op2
1 (Type/Class)	Data.Functor.Contravariant
2 (Data Constructor)	Data.Functor.Contravariant
op2	Data.Functor.Contravariant
Profunctor	Data.Profunctor
Pure	Control.Monad.Free
raise	Control.Comonad.Cofree
rmap	Data.Profunctor
runCokleisli	Control.Comonad
Strong	Data.Profunctor
strong	Data.Profunctor
tail	Control.Comonad.Cofree
Tannen
1 (Type/Class)	Data.Bifunctor.Tannen
2 (Data Constructor)	Data.Bifunctor.Tannen
unBiff	Data.Bifunctor.Biff
unFix	Data.Fix
unfold
1 (Function)	Control.Monad.Free
2 (Function)	Control.Comonad.Cofree
unfoldM
1 (Function)	Control.Monad.Free
2 (Function)	Control.Comonad.Cofree
unfoldW
1 (Function)	Control.Monad.Free
2 (Function)	Control.Comonad.Cofree
unJoin	Data.Functor.Join
unlift	Control.Monad.Codensity
unTannen	Data.Bifunctor.Tannen
wfix	Control.Comonad
^<<	Data.Profunctor
^>>	Data.Profunctor
\|\|\|	Data.Profunctor