Algebra.Functor

Description

Synopsis

• class Functor f where
  • map :: (a -> b) -> f a -> f b
• class Cofunctor f where
  • comap :: (a -> b) -> f b -> f a
• class Bifunctor p where
  • dimap :: (c -> a) -> (b -> d) -> p a b -> p c d
• class Commutative f where
  • commute :: f a b -> f b a
• class Functor t => Contravariant t where
  • collect :: Functor f => f (t a) -> t (f a)
• newtype Strict a = Strict {
  • lazy :: a
  }
• newtype Id a = Id {
  • getId :: a
  }
• newtype Const a b = Const {
  • getConst :: a
  }
• newtype Flip f a b = Flip {
  • unFlip :: f b a
  }
• newtype (f :.: g) a = Compose {
  • getCompose :: f (g a)
  }
• data (f :**: g) a = (f a) :**: (g a)
• newtype (f :++: g) a = Sum {
  • getSum :: f a :+: g a
  }
• newtype Increasing k a = Increasing ((OrdList :.: Assoc k) a)
• emerge :: (Functor f, Unit g) => (f :.: g) a -> (f :.: g) (g a)
• flip :: (Contravariant c, Functor f) => f (c a) -> c (f a)
• project :: (Contravariant c, Functor f) => (a -> c b) -> f a -> c (f b)
• factor :: (Contravariant c, Unit c, Bifunctor f, Functor (f a)) => f (c a) (c b) -> c (f a b)
• (<$>) :: Functor f => (a -> b) -> f a -> f b
• (|||) :: (Choice k, Functor (k a), Functor (k b)) => k a c -> k b d -> k (a :+: b) (c :+: d)
• (<$) :: Functor f => b -> f a -> f b
• (<&>) :: Functor f => f a -> (a -> b) -> f b
• void :: Functor f => f a -> f ()
• left :: (Choice k, Functor (k a), Functor (k c)) => k a b -> k (a :+: c) (b :+: c)
• right :: (Choice k, Functor (k a), Functor (k c)) => k a b -> k (c :+: a) (c :+: b)
• promap :: Cofunctor (Flip f c) => (a -> b) -> f b c -> f a c
• map2 :: (Functor f, Functor f') => (a -> b) -> f (f' a) -> f (f' b)
• map3 :: (Functor f, Functor f', Functor f'') => (a -> b) -> f (f' (f'' a)) -> f (f' (f'' b))

Documentation