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.Clown

Description

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

Synopsis

Documentation

newtype Clown f a b Source

Make a Functor over the first argument of a Bifunctor.

Constructors

Clown
Fields runClown :: f a

Instances

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