transformers-0.3.0.0: Concrete functor and monad transformers

Portabilityportable
Stabilityexperimental
Maintainerlibraries@haskell.org
Safe HaskellSafe-Inferred

Data.Functor.Reverse

Description

Making functors whose elements are notionally in the reverse order from the original functor.

Synopsis

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

getReverse :: f a
 

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.