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

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

newtype Clown f a b = Clown {
- runClown :: f a
}

Documentation

newtype Clown f a b #

Make a Functor over the first argument of a Bifunctor.

Mnemonic: Clowns to the left (parameter of the Bifunctor), jokers to the right.

Constructors

Clown
Fields runClown :: f a

Instances

Instances details

Generic1 (Clown f a :: k1 -> Type) #
Instance details Defined in Data.Bifunctor.Clown Associated Types type Rep1 (Clown f a) :: k -> Type # Methods from1 :: forall (a0 :: k). Clown f a a0 -> Rep1 (Clown f a) a0 # to1 :: forall (a0 :: k). Rep1 (Clown f a) a0 -> Clown f a a0 #
Traversable f => Bitraversable (Clown f :: Type -> Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods bitraverse :: Applicative f0 => (a -> f0 c) -> (b -> f0 d) -> Clown f a b -> f0 (Clown f c d) #
Foldable f => Bifoldable (Clown f :: Type -> Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods bifold :: Monoid m => Clown f m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Clown f a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Clown f a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Clown f a b -> c #
Functor f => Bifunctor (Clown f :: Type -> Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown 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 #
Eq1 f => Eq2 (Clown f :: Type -> Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Clown f a c -> Clown f b d -> Bool #
Ord1 f => Ord2 (Clown f :: Type -> Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Clown f a c -> Clown f b d -> Ordering #
Read1 f => Read2 (Clown f :: Type -> Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Clown f a b) # liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Clown f a b] # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Clown f a b) # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Clown f a b] #
Show1 f => Show2 (Clown f :: Type -> Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Clown f a b -> ShowS # liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Clown f a b] -> ShowS #
Applicative f => Biapplicative (Clown f :: Type -> Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods bipure :: a -> b -> Clown f a b # (<<>>) :: Clown f (a -> b) (c -> d) -> Clown f a c -> Clown f b d # biliftA2 :: (a -> b -> c) -> (d -> e -> f0) -> Clown f a d -> Clown f b e -> Clown f c f0 # (>>) :: Clown f a b -> Clown f c d -> Clown f c d # (<<*) :: Clown f a b -> Clown f c d -> Clown f a b #
Functor (Clown f a :: Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods fmap :: (a0 -> b) -> Clown f a a0 -> Clown f a b # (<$) :: a0 -> Clown f a b -> Clown f a a0 #
Foldable (Clown f a :: Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods fold :: Monoid m => Clown f a m -> m # foldMap :: Monoid m => (a0 -> m) -> Clown f a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Clown f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Clown f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Clown f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Clown f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Clown f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 # toList :: Clown f a a0 -> [a0] # null :: Clown f a a0 -> Bool # length :: Clown f a a0 -> Int # elem :: Eq a0 => a0 -> Clown f a a0 -> Bool # maximum :: Ord a0 => Clown f a a0 -> a0 # minimum :: Ord a0 => Clown f a a0 -> a0 # sum :: Num a0 => Clown f a a0 -> a0 # product :: Num a0 => Clown f a a0 -> a0 #
Traversable (Clown f a :: Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Clown f a a0 -> f0 (Clown f a b) # sequenceA :: Applicative f0 => Clown f a (f0 a0) -> f0 (Clown f a a0) # mapM :: Monad m => (a0 -> m b) -> Clown f a a0 -> m (Clown f a b) # sequence :: Monad m => Clown f a (m a0) -> m (Clown f a a0) #
(Eq1 f, Eq a) => Eq1 (Clown f a :: Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods liftEq :: (a0 -> b -> Bool) -> Clown f a a0 -> Clown f a b -> Bool #
(Ord1 f, Ord a) => Ord1 (Clown f a :: Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods liftCompare :: (a0 -> b -> Ordering) -> Clown f a a0 -> Clown f a b -> Ordering #
(Read1 f, Read a) => Read1 (Clown f a :: Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Clown f a a0) # liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Clown f a a0] # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Clown f a a0) # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Clown f a a0] #
(Show1 f, Show a) => Show1 (Clown f a :: Type -> Type) #
Instance details Defined in Data.Bifunctor.Clown Methods liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Clown f a a0 -> ShowS # liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Clown f a a0] -> ShowS #
Eq (f a) => Eq (Clown f a b) #
Instance details Defined in Data.Bifunctor.Clown 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) #
Instance details Defined in Data.Bifunctor.Clown 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) #
Instance details Defined in Data.Bifunctor.Clown 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) #
Instance details Defined in Data.Bifunctor.Clown Methods showsPrec :: Int -> Clown f a b -> ShowS # show :: Clown f a b -> String # showList :: [Clown f a b] -> ShowS #
Generic (Clown f a b) #
Instance details Defined in Data.Bifunctor.Clown Associated Types type Rep (Clown f a b) :: Type -> Type # Methods from :: Clown f a b -> Rep (Clown f a b) x # to :: Rep (Clown f a b) x -> Clown f a b #
type Rep1 (Clown f a :: k1 -> Type) #
Instance details Defined in Data.Bifunctor.Clown type Rep1 (Clown f a :: k1 -> Type) = D1 ('MetaData "Clown" "Data.Bifunctor.Clown" "bifunctors-5.5.11" 'True) (C1 ('MetaCons "Clown" 'PrefixI 'True) (S1 ('MetaSel ('Just "runClown") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f a))))
type Rep (Clown f a b) #
Instance details Defined in Data.Bifunctor.Clown type Rep (Clown f a b) = D1 ('MetaData "Clown" "Data.Bifunctor.Clown" "bifunctors-5.5.11" 'True) (C1 ('MetaCons "Clown" 'PrefixI 'True) (S1 ('MetaSel ('Just "runClown") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f a))))