bifunctors-5.5.3: Bifunctors

Copyright (C) 2008-2016 Edward Kmett BSD-style (see the file LICENSE) Edward Kmett provisional non-portable Safe Haskell98

Data.Bifunctor.Fix

Description

Synopsis

# Documentation

newtype Fix p a Source #

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

Constructors

 In Fieldsout :: p (Fix p a) a
Instances
 Bifunctor p => Functor (Fix p) Source # Instance detailsDefined in Data.Bifunctor.Fix Methodsfmap :: (a -> b) -> Fix p a -> Fix p b #(<\$) :: a -> Fix p b -> Fix p a # Biapplicative p => Applicative (Fix p) Source # Instance detailsDefined in Data.Bifunctor.Fix Methodspure :: a -> Fix p a #(<*>) :: Fix p (a -> b) -> Fix p a -> Fix p b #liftA2 :: (a -> b -> c) -> Fix p a -> Fix p b -> Fix p c #(*>) :: Fix p a -> Fix p b -> Fix p b #(<*) :: Fix p a -> Fix p b -> Fix p a # Bifoldable p => Foldable (Fix p) Source # Instance detailsDefined in Data.Bifunctor.Fix Methodsfold :: Monoid m => Fix p m -> m #foldMap :: Monoid m => (a -> m) -> Fix p a -> m #foldr :: (a -> b -> b) -> b -> Fix p a -> b #foldr' :: (a -> b -> b) -> b -> Fix p a -> b #foldl :: (b -> a -> b) -> b -> Fix p a -> b #foldl' :: (b -> a -> b) -> b -> Fix p a -> b #foldr1 :: (a -> a -> a) -> Fix p a -> a #foldl1 :: (a -> a -> a) -> Fix p a -> a #toList :: Fix p a -> [a] #null :: Fix p a -> Bool #length :: Fix p a -> Int #elem :: Eq a => a -> Fix p a -> Bool #maximum :: Ord a => Fix p a -> a #minimum :: Ord a => Fix p a -> a #sum :: Num a => Fix p a -> a #product :: Num a => Fix p a -> a # Bitraversable p => Traversable (Fix p) Source # Instance detailsDefined in Data.Bifunctor.Fix Methodstraverse :: Applicative f => (a -> f b) -> Fix p a -> f (Fix p b) #sequenceA :: Applicative f => Fix p (f a) -> f (Fix p a) #mapM :: Monad m => (a -> m b) -> Fix p a -> m (Fix p b) #sequence :: Monad m => Fix p (m a) -> m (Fix p a) # Eq (p (Fix p a) a) => Eq (Fix p a) Source # Instance detailsDefined in Data.Bifunctor.Fix Methods(==) :: Fix p a -> Fix p a -> Bool #(/=) :: Fix p a -> Fix p a -> Bool # Ord (p (Fix p a) a) => Ord (Fix p a) Source # Instance detailsDefined in Data.Bifunctor.Fix Methodscompare :: Fix p a -> Fix p a -> Ordering #(<) :: Fix p a -> Fix p a -> Bool #(<=) :: Fix p a -> Fix p a -> Bool #(>) :: Fix p a -> Fix p a -> Bool #(>=) :: Fix p a -> Fix p a -> Bool #max :: Fix p a -> Fix p a -> Fix p a #min :: Fix p a -> Fix p a -> Fix p a # Read (p (Fix p a) a) => Read (Fix p a) Source # Instance detailsDefined in Data.Bifunctor.Fix MethodsreadsPrec :: Int -> ReadS (Fix p a) #readList :: ReadS [Fix p a] #readPrec :: ReadPrec (Fix p a) #readListPrec :: ReadPrec [Fix p a] # Show (p (Fix p a) a) => Show (Fix p a) Source # Instance detailsDefined in Data.Bifunctor.Fix MethodsshowsPrec :: Int -> Fix p a -> ShowS #show :: Fix p a -> String #showList :: [Fix p a] -> ShowS # Generic (Fix p a) Source # Instance detailsDefined in Data.Bifunctor.Fix Associated Typestype Rep (Fix p a) :: * -> * # Methodsfrom :: Fix p a -> Rep (Fix p a) x #to :: Rep (Fix p a) x -> Fix p a # type Rep (Fix p a) Source # Instance detailsDefined in Data.Bifunctor.Fix type Rep (Fix p a) = D1 (MetaData "Fix" "Data.Bifunctor.Fix" "bifunctors-5.5.3-C6ZpRcwIkW2G7uSQuXu3CK" True) (C1 (MetaCons "In" PrefixI True) (S1 (MetaSel (Just "out") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (p (Fix p a) a))))