|
| Data.Derive.Internal.Traversal |
|
|
| Description |
| Derives Functor and similair classes, as discussed on the Haskell-prime mailing list:
http://www.mail-archive.com/haskell-prime@haskell.org/msg02116.html.
|
|
| Synopsis |
|
|
|
| Documentation |
|
|
| What kind of traversal are we deriving?
| | Constructors | | TraveralType | | | traversalArg :: Int | On what position are we traversing?
| | traversalCo :: Bool | covariant?
| | traversalName :: QName | name of the traversal function
| | traversalId :: Trav | Identity traversal
| | traversalDirect :: Trav | Traversal of a
| | traversalFunc :: QName -> Trav -> Trav | Apply the sub-traversal function
| | traversalPlus :: Trav -> Trav -> Trav | Apply two non-identity traversals in sequence
| | traverseArrow :: Maybe (Trav -> Trav -> Trav) | Traverse a function type
| | traverseTuple :: [Exp] -> Exp | Construct a tuple from applied traversals
| | traverseCtor :: String -> [Exp] -> Exp | Construct a data type from applied traversals
| | traverseFunc :: Pat -> Exp -> Match | Construct a clause of the traversal function
|
|
|
|
|
| defaultTraversalType |
|
|
| Derivation for a Traversable like class with just 1 method
|
|
|
| Instance for a Traversable like class
|
|
|
| Instance for a Traversable like class with just 1 method
|
|
|
| Derive a traverse like function
|
|
| Produced by Haddock version 2.4.2 |