expressions-0.1.1: Expressions and Formulas a la carte

Copyright (C) 2017-18 Jakub Daniel BSD-style (see the file LICENSE) Jakub Daniel experimental None Haskell2010

Data.Expression.Utils.Indexed.Traversable

Description

Synopsis

# Documentation

class ITraversable t where Source #

Type constructors (usually functors) that can be traversed

Minimal complete definition

itraverse

Methods

itraverse :: forall a b f. Applicative f => (forall i'. a i' -> f (b i')) -> forall i'. t a i' -> f (t b i') Source #

Instances

 Source # Methodsitraverse :: Applicative f => (forall i'. a i' -> f (b i')) -> forall i'. t a i' -> f (t b i') Source # Source # Methodsitraverse :: Applicative f => (forall i'. a i' -> f (b i')) -> forall i'. t a i' -> f (t b i') Source # Source # Methodsitraverse :: Applicative f => (forall i'. a i' -> f (b i')) -> forall i'. t a i' -> f (t b i') Source # Source # Methodsitraverse :: Applicative f => (forall i'. a i' -> f (b i')) -> forall i'. t a i' -> f (t b i') Source # Source # Methodsitraverse :: Applicative f => (forall i'. a i' -> f (b i')) -> forall i'. t a i' -> f (t b i') Source # Source # Methodsitraverse :: Applicative f => (forall i'. a i' -> f (b i')) -> forall i'. t a i' -> f (t b i') Source # Source # Methodsitraverse :: Applicative f => (forall i'. a i' -> f (b i')) -> forall i'. t a i' -> f (t b i') Source # Source # Methodsitraverse :: Applicative f => (forall i'. a i' -> f (b i')) -> forall i'. t a i' -> f (t b i') Source # Source # Methodsitraverse :: Applicative f => (forall i'. a i' -> f (b i')) -> forall i'. t a i' -> f (t b i') Source # (ITraversable i f, ITraversable i g) => ITraversable i ((:+:) i (i -> *) f g) Source # Methodsitraverse :: Applicative f => (forall i'. a i' -> f (b i')) -> forall i'. t a i' -> f (t b i') Source #

imapM :: (ITraversable f, Monad m) => (forall i'. IFix f i' -> m (IFix f i')) -> forall i'. IFix f i' -> m (IFix f i') Source #

Maps a monadic action over a traversable functor.