Data.Comp.MultiParam.HDitraversable

This module defines traversable higher-order difunctors.

Documentation

class (HDifunctor f, Monad m) => HDitraversable f m a where

HDifunctors representing data structures that can be traversed from left to right.

Methods

hdimapM :: NatM m b c -> NatM m (f a b) (f a c)

Instances

(HDifunctor f, Monad m, HTraversable (f a)) => HDitraversable f m a

If a higher-order difunctor is HTraversable for a given contravariant argument a, then it is HDitraversable for all Monads m with the same a.

HDitraversable f m a => HDitraversable (:&: f p) m a

(HDitraversable f m a, HDitraversable g m a) => HDitraversable (:+: f g) m a

class HFoldable t => HTraversable t where

Methods

hmapM :: Monad m => NatM m a b -> NatM m (t a) (t b)

Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results.

Alternative type in terms of natural transformations using functor composition :.::

hmapM :: Monad m => (a :-> m :.: b) -> t a :-> m :.: (t b)

htraverse :: Applicative f => NatM f a b -> NatM f (t a) (t b)

Instances

HTraversable f => HTraversable (Cxt h f)

HTraversable f => HTraversable (:&: f a)

(HTraversable f, HTraversable g) => HTraversable (:+: f g)