| Portability | portable |
|---|---|
| Stability | experimental |
| Maintainer | libraries@haskell.org |
| Safe Haskell | Safe-Inferred |
Data.Functor.Reverse
Description
Making functors whose elements are notionally in the reverse order from the original functor.
- newtype Reverse f a = Reverse {
- getReverse :: f a
Documentation
newtype Reverse f a
The same functor, but with Foldable and Traversable instances
that process the elements in the reverse order.
Constructors
| Reverse | |
Fields
| |
Instances