transformers-0.4.3.0: Concrete functor and monad transformers

Copyright(c) Russell O'Connor 2009
LicenseBSD-style (see the file LICENSE)
MaintainerR.Paterson@city.ac.uk
Stabilityexperimental
Portabilityportable
Safe HaskellSafe
LanguageHaskell98

Data.Functor.Reverse

Description

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

Synopsis

Documentation

newtype Reverse f a Source

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) Source

Derived instance.

Applicative f => Applicative (Reverse f) Source

Derived instance.

Foldable f => Foldable (Reverse f) Source

Fold from right to left.

Traversable f => Traversable (Reverse f) Source

Traverse from right to left.

Alternative f => Alternative (Reverse f) Source

Derived instance.

Show1 f => Show1 (Reverse f) Source 
Read1 f => Read1 (Reverse f) Source 
Ord1 f => Ord1 (Reverse f) Source 
Eq1 f => Eq1 (Reverse f) Source 
(Eq1 f, Eq a) => Eq (Reverse f a) Source 
(Ord1 f, Ord a) => Ord (Reverse f a) Source 
(Read1 f, Read a) => Read (Reverse f a) Source 
(Show1 f, Show a) => Show (Reverse f a) Source