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 |
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.
Reverse | |
|
Instances
Monad m => Monad (Reverse m) Source # | Derived instance. |
Functor f => Functor (Reverse f) Source # | Derived instance. |
MonadFail m => MonadFail (Reverse m) Source # | |
Defined in Data.Functor.Reverse | |
Applicative f => Applicative (Reverse f) Source # | Derived instance. |
Foldable f => Foldable (Reverse f) Source # | Fold from right to left. |
Defined in Data.Functor.Reverse fold :: Monoid m => Reverse f m -> m # foldMap :: Monoid m => (a -> m) -> Reverse f a -> m # foldr :: (a -> b -> b) -> b -> Reverse f a -> b # foldr' :: (a -> b -> b) -> b -> Reverse f a -> b # foldl :: (b -> a -> b) -> b -> Reverse f a -> b # foldl' :: (b -> a -> b) -> b -> Reverse f a -> b # foldr1 :: (a -> a -> a) -> Reverse f a -> a # foldl1 :: (a -> a -> a) -> Reverse f a -> a # toList :: Reverse f a -> [a] # length :: Reverse f a -> Int # elem :: Eq a => a -> Reverse f a -> Bool # maximum :: Ord a => Reverse f a -> a # minimum :: Ord a => Reverse f a -> a # | |
Traversable f => Traversable (Reverse f) Source # | Traverse from right to left. |
Defined in Data.Functor.Reverse | |
Contravariant f => Contravariant (Reverse f) Source # | Derived instance. |
Eq1 f => Eq1 (Reverse f) Source # | |
Ord1 f => Ord1 (Reverse f) Source # | |
Defined in Data.Functor.Reverse | |
Read1 f => Read1 (Reverse f) Source # | |
Defined in Data.Functor.Reverse | |
Show1 f => Show1 (Reverse f) Source # | |
Alternative f => Alternative (Reverse f) Source # | Derived instance. |
MonadPlus m => MonadPlus (Reverse m) Source # | Derived instance. |
(Eq1 f, Eq a) => Eq (Reverse f a) Source # | |
(Ord1 f, Ord a) => Ord (Reverse f a) Source # | |
Defined in Data.Functor.Reverse | |
(Read1 f, Read a) => Read (Reverse f a) Source # | |
(Show1 f, Show a) => Show (Reverse f a) Source # | |