
Data.Traversable  Portability  portable  Stability  experimental  Maintainer  libraries@haskell.org 



Description 
Class of data structures that can be traversed from left to right,
performing an action on each element.
See also
Note that the functions mapM and sequence generalize Prelude
functions of the same names from lists to any Traversable functor.
To avoid ambiguity, either import the Prelude hiding these names
or qualify uses of these function names with an alias for this module.


Synopsis 



Documentation 


Functors representing data structures that can be traversed from
left to right.
Minimal complete definition: traverse or sequenceA.
Instances are similar to Functor, e.g. given a data type
data Tree a = Empty  Leaf a  Node (Tree a) a (Tree a)
a suitable instance would be
instance Traversable Tree
traverse f Empty = pure Empty
traverse f (Leaf x) = Leaf <$> f x
traverse f (Node l k r) = Node <$> traverse f l <*> f k <*> traverse f r
This is suitable even for abstract types, as the laws for <*>
imply a form of associativity.
The superclass instances should satisfy the following:
 In the Functor instance, fmap should be equivalent to traversal
with the identity applicative functor (fmapDefault).
 In the Foldable instance, Data.Foldable.foldMap should be
equivalent to traversal with a constant applicative functor
(foldMapDefault).
  Methods   Map each element of a structure to an action, evaluate
these actions from left to right, and collect the results.
   Evaluate each action in the structure from left to right,
and collect the results.
   Map each element of a structure to a monadic action, evaluate
these actions from left to right, and collect the results.
   Evaluate each monadic action in the structure from left to right,
and collect the results.

  Instances  



for is traverse with its arguments flipped.



forM is mapM with its arguments flipped.



The mapAccumL function behaves like a combination of fmap
and foldl; it applies a function to each element of a structure,
passing an accumulating parameter from left to right, and returning
a final value of this accumulator together with the new structure.



The mapAccumR function behaves like a combination of fmap
and foldr; it applies a function to each element of a structure,
passing an accumulating parameter from right to left, and returning
a final value of this accumulator together with the new structure.



This function may be used as a value for fmap in a Functor instance.



This function may be used as a value for Data.Foldable.foldMap
in a Foldable instance.


Produced by Haddock version 2.3.0 