Data.Comp.Multi.HTraversable

This module defines higher-order traversable functors.

Documentation

class HFoldable t => HTraversable t where

Minimal complete definition

hmapM, htraverse

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)

Methods

hmapM :: Monad m => NatM m a b -> NatM m (Cxt h f a) (Cxt h f b)

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

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

Methods

hmapM :: Monad m => NatM m a b -> NatM m ((* :&: f) a a) ((* :&: f) a b)

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

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

Methods

hmapM :: Monad m => NatM m a b -> NatM m ((* :+: f) g a) ((* :+: f) g b)

htraverse :: Applicative f => NatM f a b -> NatM f ((* :+: f) g a) ((* :+: f) g b)