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 | 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.
Documentation
Make a Functor
over the first argument of a Bifunctor
.
Mnemonic: Clowns to the left (parameter of the Bifunctor), jokers to the right.
Instances
Generic1 (Clown f a :: k1 -> Type) Source # | |
Traversable f => Bitraversable (Clown f :: Type -> Type -> Type) Source # | |
Defined in Data.Bifunctor.Clown Methods bitraverse :: Applicative f0 => (a -> f0 c) -> (b -> f0 d) -> Clown f a b -> f0 (Clown f c d) Source # | |
Foldable f => Bifoldable (Clown f :: Type -> Type -> Type) Source # | |
Defined in Data.Bifunctor.Clown | |
Functor f => Bifunctor (Clown f :: Type -> Type -> Type) Source # | |
Applicative f => Biapplicative (Clown f :: Type -> Type -> Type) Source # | |
Defined in Data.Bifunctor.Clown | |
Functor (Clown f a :: Type -> Type) Source # | |
Foldable (Clown f a :: Type -> Type) Source # | |
Defined in Data.Bifunctor.Clown Methods fold :: Monoid m => Clown f a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Clown f a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Clown f a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Clown f a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Clown f a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Clown f a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 Source # toList :: Clown f a a0 -> [a0] Source # null :: Clown f a a0 -> Bool Source # length :: Clown f a a0 -> Int Source # elem :: Eq a0 => a0 -> Clown f a a0 -> Bool Source # maximum :: Ord a0 => Clown f a a0 -> a0 Source # minimum :: Ord a0 => Clown f a a0 -> a0 Source # | |
Traversable (Clown f a :: Type -> Type) Source # | |
Defined in Data.Bifunctor.Clown Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Clown f a a0 -> f0 (Clown f a b) Source # sequenceA :: Applicative f0 => Clown f a (f0 a0) -> f0 (Clown f a a0) Source # mapM :: Monad m => (a0 -> m b) -> Clown f a a0 -> m (Clown f a b) Source # sequence :: Monad m => Clown f a (m a0) -> m (Clown f a a0) Source # | |
Eq (f a) => Eq (Clown f a b) Source # | |
Ord (f a) => Ord (Clown f a b) Source # | |
Defined in Data.Bifunctor.Clown Methods compare :: Clown f a b -> Clown f a b -> Ordering Source # (<) :: Clown f a b -> Clown f a b -> Bool Source # (<=) :: Clown f a b -> Clown f a b -> Bool Source # (>) :: Clown f a b -> Clown f a b -> Bool Source # (>=) :: Clown f a b -> Clown f a b -> Bool Source # | |
Read (f a) => Read (Clown f a b) Source # | |
Show (f a) => Show (Clown f a b) Source # | |
Generic (Clown f a b) Source # | |
type Rep1 (Clown f a :: k1 -> Type) Source # | |
Defined in Data.Bifunctor.Clown | |
type Rep (Clown f a b) Source # | |
Defined in Data.Bifunctor.Clown |