Copyright	(C) 2008-2015 Edward Kmett
License	BSD-style (see the file LICENSE)
Maintainer	Edward Kmett <ekmett@gmail.com>
Stability	provisional
Portability	portable
Safe Haskell	Safe
Language	Haskell98

Data.Bifunctor.Joker

Description

From the Functional Pearl "Clowns to the Left of me, Jokers to the Right: Dissecting Data Structures" by Conor McBride.

Synopsis

Documentation

newtype Joker g a b Source

Make a Functor over the second argument of a Bifunctor.

Constructors

Joker
Fields runJoker :: g b

Instances

Functor g => Bifunctor (Joker g) Source
Methods bimap :: (a -> b) -> (c -> d) -> Joker g a c -> Joker g b d first :: (a -> b) -> Joker g a c -> Joker g b c second :: (b -> c) -> Joker g a b -> Joker g a c
Foldable g => Bifoldable (Joker g) Source
Methods bifold :: Monoid m => Joker g m m -> m Source bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Joker g a b -> m Source bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Joker g a b -> c Source bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Joker g a b -> c Source
Traversable g => Bitraversable (Joker g) Source
Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Joker g a b -> f (Joker g c d) Source bisequenceA :: Applicative f => Joker g (f a) (f b) -> f (Joker g a b) Source bimapM :: Monad m => (a -> m c) -> (b -> m d) -> Joker g a b -> m (Joker g c d) Source bisequence :: Monad m => Joker g (m a) (m b) -> m (Joker g a b) Source
Applicative g => Biapplicative (Joker g) Source
Methods bipure :: a -> b -> Joker g a b Source (<<>>) :: Joker g (a -> b) (c -> d) -> Joker g a c -> Joker g b d Source (>>) :: Joker g a b -> Joker g c d -> Joker g c d Source (<<*) :: Joker g a b -> Joker g c d -> Joker g a b Source
Functor g => Functor (Joker g a) Source
Methods fmap :: (b -> c) -> Joker g a b -> Joker g a c (<$) :: b -> Joker g a c -> Joker g a b
Foldable g => Foldable (Joker g a) Source
Methods fold :: Monoid m => Joker g a m -> m foldMap :: Monoid m => (b -> m) -> Joker g a b -> m foldr :: (b -> c -> c) -> c -> Joker g a b -> c foldr' :: (b -> c -> c) -> c -> Joker g a b -> c foldl :: (b -> c -> b) -> b -> Joker g a c -> b foldl' :: (b -> c -> b) -> b -> Joker g a c -> b foldr1 :: (b -> b -> b) -> Joker g a b -> b foldl1 :: (b -> b -> b) -> Joker g a b -> b toList :: Joker g a b -> [b] null :: Joker g a b -> Bool length :: Joker g a b -> Int elem :: Eq b => b -> Joker g a b -> Bool maximum :: Ord b => Joker g a b -> b minimum :: Ord b => Joker g a b -> b sum :: Num b => Joker g a b -> b product :: Num b => Joker g a b -> b
Traversable g => Traversable (Joker g a) Source
Methods traverse :: Applicative f => (b -> f c) -> Joker g a b -> f (Joker g a c) sequenceA :: Applicative f => Joker g a (f b) -> f (Joker g a b) mapM :: Monad m => (b -> m c) -> Joker g a b -> m (Joker g a c) sequence :: Monad m => Joker g a (m b) -> m (Joker g a b)
Eq (g b) => Eq (Joker g a b) Source
Methods (==) :: Joker g a b -> Joker g a b -> Bool (/=) :: Joker g a b -> Joker g a b -> Bool
Ord (g b) => Ord (Joker g a b) Source
Methods compare :: Joker g a b -> Joker g a b -> Ordering (<) :: Joker g a b -> Joker g a b -> Bool (<=) :: Joker g a b -> Joker g a b -> Bool (>) :: Joker g a b -> Joker g a b -> Bool (>=) :: Joker g a b -> Joker g a b -> Bool max :: Joker g a b -> Joker g a b -> Joker g a b min :: Joker g a b -> Joker g a b -> Joker g a b
Read (g b) => Read (Joker g a b) Source
Methods readsPrec :: Int -> ReadS (Joker g a b) readList :: ReadS [Joker g a b] readPrec :: ReadPrec (Joker g a b) readListPrec :: ReadPrec [Joker g a b]
Show (g b) => Show (Joker g a b) Source
Methods showsPrec :: Int -> Joker g a b -> ShowS show :: Joker g a b -> String showList :: [Joker g a b] -> ShowS