Data.Comp.Param.Ditraversable

Description

This module defines traversable difunctors.

Synopsis

Documentation

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

Methods

dimapM :: Monad m => (b -> m c) -> f a b -> m (f a c) Source #

disequence :: Monad m => f a (m b) -> m (f a b) Source #

Instances

Ditraversable f => Ditraversable (f :&: p) Source #
Instance details Defined in Data.Comp.Param.Ops Methods dimapM :: Monad m => (b -> m c) -> (f :&: p) a b -> m ((f :&: p) a c) Source # disequence :: Monad m => (f :&: p) a (m b) -> m ((f :&: p) a b) Source #
(Ditraversable f, Ditraversable g) => Ditraversable (f :+: g) Source #
Instance details Defined in Data.Comp.Param.Ops Methods dimapM :: Monad m => (b -> m c) -> (f :+: g) a b -> m ((f :+: g) a c) Source # disequence :: Monad m => (f :+: g) a (m b) -> m ((f :+: g) a b) Source #