transformers-0.5.6.2: Concrete functor and monad transformers
Copyright (c) Ross Paterson 2010
License BSD-style (see the file LICENSE)
Maintainer R.Paterson@city.ac.uk
Stability experimental
Portability portable
Safe Haskell Safe
Language Haskell98

Data.Functor.Constant

Description

The constant functor.

Synopsis

Documentation

newtype Constant a b Source #

Constant functor.

Constructors

Constant

Fields

Instances

Instances details
Bitraversable ( Constant :: Type -> Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Methods

bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Constant a b -> f ( Constant c d) Source #

Bifoldable ( Constant :: Type -> Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Methods

bifold :: Monoid m => Constant m m -> m Source #

bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Constant a b -> m Source #

bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Constant a b -> c Source #

bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Constant a b -> c Source #

Bifunctor ( Constant :: Type -> Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Methods

bimap :: (a -> b) -> (c -> d) -> Constant a c -> Constant b d Source #

first :: (a -> b) -> Constant a c -> Constant b c Source #

second :: (b -> c) -> Constant a b -> Constant a c Source #

Eq2 ( Constant :: Type -> Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Methods

liftEq2 :: (a -> b -> Bool ) -> (c -> d -> Bool ) -> Constant a c -> Constant b d -> Bool Source #

Ord2 ( Constant :: Type -> Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Methods

liftCompare2 :: (a -> b -> Ordering ) -> (c -> d -> Ordering ) -> Constant a c -> Constant b d -> Ordering Source #

Read2 ( Constant :: Type -> Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Show2 ( Constant :: Type -> Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Methods

liftShowsPrec2 :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> ( Int -> b -> ShowS ) -> ([b] -> ShowS ) -> Int -> Constant a b -> ShowS Source #

liftShowList2 :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> ( Int -> b -> ShowS ) -> ([b] -> ShowS ) -> [ Constant a b] -> ShowS Source #

Functor ( Constant a :: Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Monoid a => Applicative ( Constant a :: Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Foldable ( Constant a :: Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Traversable ( Constant a :: Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Contravariant ( Constant a :: Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Eq a => Eq1 ( Constant a :: Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Methods

liftEq :: (a0 -> b -> Bool ) -> Constant a a0 -> Constant a b -> Bool Source #

Ord a => Ord1 ( Constant a :: Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Read a => Read1 ( Constant a :: Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Show a => Show1 ( Constant a :: Type -> Type ) Source #
Instance details

Defined in Data.Functor.Constant

Eq a => Eq ( Constant a b) Source #
Instance details

Defined in Data.Functor.Constant

Ord a => Ord ( Constant a b) Source #
Instance details

Defined in Data.Functor.Constant

Read a => Read ( Constant a b) Source #
Instance details

Defined in Data.Functor.Constant

Show a => Show ( Constant a b) Source #
Instance details

Defined in Data.Functor.Constant

Semigroup a => Semigroup ( Constant a b) Source #
Instance details

Defined in Data.Functor.Constant

Monoid a => Monoid ( Constant a b) Source #
Instance details

Defined in Data.Functor.Constant