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
Functor f => Functor (Reverse f) | Derived instance. |
(Functor (Reverse f), Applicative f) => Applicative (Reverse f) | Derived instance. |
Foldable f => Foldable (Reverse f) | Fold from right to left. |
(Functor (Reverse f), Foldable (Reverse f), Traversable f) => Traversable (Reverse f) | Traverse from right to left. |
(Applicative (Reverse f), Alternative f) => Alternative (Reverse f) | Derived instance. |