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

Data.Bifunctor.Fix

Description

Synopsis

newtype Fix p a = In {
- out :: p ( Fix p a) a
}

Documentation

newtype Fix p a Source #

Greatest fixpoint of a Bifunctor (a Functor over the first argument with zipping).

Constructors

In
Fields out :: p ( Fix p a) a

Instances

Instances details

Bifunctor p => Functor ( Fix p) Source #
Instance details Defined in Data.Bifunctor.Fix Methods fmap :: (a -> b) -> Fix p a -> Fix p b Source # (<$) :: a -> Fix p b -> Fix p a Source #
Biapplicative p => Applicative ( Fix p) Source #
Instance details Defined in Data.Bifunctor.Fix Methods pure :: a -> Fix p a Source # (<>) :: Fix p (a -> b) -> Fix p a -> Fix p b Source # liftA2 :: (a -> b -> c) -> Fix p a -> Fix p b -> Fix p c Source # (>) :: Fix p a -> Fix p b -> Fix p b Source # (<*) :: Fix p a -> Fix p b -> Fix p a Source #
Bifoldable p => Foldable ( Fix p) Source #
Instance details Defined in Data.Bifunctor.Fix Methods fold :: Monoid m => Fix p m -> m Source # foldMap :: Monoid m => (a -> m) -> Fix p a -> m Source # foldMap' :: Monoid m => (a -> m) -> Fix p a -> m Source # foldr :: (a -> b -> b) -> b -> Fix p a -> b Source # foldr' :: (a -> b -> b) -> b -> Fix p a -> b Source # foldl :: (b -> a -> b) -> b -> Fix p a -> b Source # foldl' :: (b -> a -> b) -> b -> Fix p a -> b Source # foldr1 :: (a -> a -> a) -> Fix p a -> a Source # foldl1 :: (a -> a -> a) -> Fix p a -> a Source # toList :: Fix p a -> [a] Source # null :: Fix p a -> Bool Source # length :: Fix p a -> Int Source # elem :: Eq a => a -> Fix p a -> Bool Source # maximum :: Ord a => Fix p a -> a Source # minimum :: Ord a => Fix p a -> a Source # sum :: Num a => Fix p a -> a Source # product :: Num a => Fix p a -> a Source #
Bitraversable p => Traversable ( Fix p) Source #
Instance details Defined in Data.Bifunctor.Fix Methods traverse :: Applicative f => (a -> f b) -> Fix p a -> f ( Fix p b) Source # sequenceA :: Applicative f => Fix p (f a) -> f ( Fix p a) Source # mapM :: Monad m => (a -> m b) -> Fix p a -> m ( Fix p b) Source # sequence :: Monad m => Fix p (m a) -> m ( Fix p a) Source #
Eq2 p => Eq1 ( Fix p) Source #
Instance details Defined in Data.Bifunctor.Fix Methods liftEq :: (a -> b -> Bool ) -> Fix p a -> Fix p b -> Bool Source #
Ord2 p => Ord1 ( Fix p) Source #
Instance details Defined in Data.Bifunctor.Fix Methods liftCompare :: (a -> b -> Ordering ) -> Fix p a -> Fix p b -> Ordering Source #
Read2 p => Read1 ( Fix p) Source #
Instance details Defined in Data.Bifunctor.Fix Methods liftReadsPrec :: ( Int -> ReadS a) -> ReadS [a] -> Int -> ReadS ( Fix p a) Source # liftReadList :: ( Int -> ReadS a) -> ReadS [a] -> ReadS [ Fix p a] Source # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec ( Fix p a) Source # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [ Fix p a] Source #
Show2 p => Show1 ( Fix p) Source #
Instance details Defined in Data.Bifunctor.Fix Methods liftShowsPrec :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> Int -> Fix p a -> ShowS Source # liftShowList :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> [ Fix p a] -> ShowS Source #
Eq (p ( Fix p a) a) => Eq ( Fix p a) Source #
Instance details Defined in Data.Bifunctor.Fix Methods (==) :: Fix p a -> Fix p a -> Bool Source # (/=) :: Fix p a -> Fix p a -> Bool Source #
Ord (p ( Fix p a) a) => Ord ( Fix p a) Source #
Instance details Defined in Data.Bifunctor.Fix Methods compare :: Fix p a -> Fix p a -> Ordering Source # (<) :: Fix p a -> Fix p a -> Bool Source # (<=) :: Fix p a -> Fix p a -> Bool Source # (>) :: Fix p a -> Fix p a -> Bool Source # (>=) :: Fix p a -> Fix p a -> Bool Source # max :: Fix p a -> Fix p a -> Fix p a Source # min :: Fix p a -> Fix p a -> Fix p a Source #
Read (p ( Fix p a) a) => Read ( Fix p a) Source #
Instance details Defined in Data.Bifunctor.Fix Methods readsPrec :: Int -> ReadS ( Fix p a) Source # readList :: ReadS [ Fix p a] Source # readPrec :: ReadPrec ( Fix p a) Source # readListPrec :: ReadPrec [ Fix p a] Source #
Show (p ( Fix p a) a) => Show ( Fix p a) Source #
Instance details Defined in Data.Bifunctor.Fix Methods showsPrec :: Int -> Fix p a -> ShowS Source # show :: Fix p a -> String Source # showList :: [ Fix p a] -> ShowS Source #
Generic ( Fix p a) Source #
Instance details Defined in Data.Bifunctor.Fix Associated Types type Rep ( Fix p a) :: Type -> Type Source # Methods from :: Fix p a -> Rep ( Fix p a) x Source # to :: Rep ( Fix p a) x -> Fix p a Source #
type Rep ( Fix p a) Source #
Instance details Defined in Data.Bifunctor.Fix type Rep ( Fix p a) = D1 (' MetaData "Fix" "Data.Bifunctor.Fix" "bifunctors-5.5.14-4o2vxpA6iYN8K0rfLgtyzm" ' True ) ( C1 (' MetaCons "In" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "out") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) ( Rec0 (p ( Fix p a) a))))