Copyright | (c) Russell O'Connor 2009 |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | R.Paterson@city.ac.uk |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell98 |
Data.Functor.Reverse
Description
Making functors whose elements are notionally in the reverse order from the original functor.
Synopsis
-
newtype
Reverse
f a =
Reverse
{
- getReverse :: f a
Documentation
The same functor, but with
Foldable
and
Traversable
instances
that process the elements in the reverse order.
Constructors
Reverse | |
Fields
|