transformers-0.5.5.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

Instances

Monad m => Monad (Reverse * m) Source #

Derived instance.

Methods

(>>=) :: Reverse * m a -> (a -> Reverse * m b) -> Reverse * m b #

(>>) :: Reverse * m a -> Reverse * m b -> Reverse * m b #

return :: a -> Reverse * m a #

fail :: String -> Reverse * m a #

Functor f => Functor (Reverse * f) Source #

Derived instance.

Methods

fmap :: (a -> b) -> Reverse * f a -> Reverse * f b #

(<$) :: a -> Reverse * f b -> Reverse * f a #

MonadFail m => MonadFail (Reverse * m) Source # 

Methods

fail :: String -> Reverse * m a #

Applicative f => Applicative (Reverse * f) Source #

Derived instance.

Methods

pure :: a -> Reverse * f a #

(<*>) :: Reverse * f (a -> b) -> Reverse * f a -> Reverse * f b #

(*>) :: Reverse * f a -> Reverse * f b -> Reverse * f b #

(<*) :: Reverse * f a -> Reverse * f b -> Reverse * f a #

Foldable f => Foldable (Reverse * f) Source #

Fold from right to left.

Methods

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] #

null :: Reverse * f a -> Bool #

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 #

sum :: Num a => Reverse * f a -> a #

product :: Num a => Reverse * f a -> a #

Traversable f => Traversable (Reverse * f) Source #

Traverse from right to left.

Methods

traverse :: Applicative f => (a -> f b) -> Reverse * f a -> f (Reverse * f b) #

sequenceA :: Applicative f => Reverse * f (f a) -> f (Reverse * f a) #

mapM :: Monad m => (a -> m b) -> Reverse * f a -> m (Reverse * f b) #

sequence :: Monad m => Reverse * f (m a) -> m (Reverse * f a) #

Eq1 f => Eq1 (Reverse * f) Source # 

Methods

liftEq :: (a -> b -> Bool) -> Reverse * f a -> Reverse * f b -> Bool #

Ord1 f => Ord1 (Reverse * f) Source # 

Methods

liftCompare :: (a -> b -> Ordering) -> Reverse * f a -> Reverse * f b -> Ordering #

Read1 f => Read1 (Reverse * f) Source # 

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Reverse * f a) #

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Reverse * f a] #

Show1 f => Show1 (Reverse * f) Source # 

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Reverse * f a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Reverse * f a] -> ShowS #

Alternative f => Alternative (Reverse * f) Source #

Derived instance.

Methods

empty :: Reverse * f a #

(<|>) :: Reverse * f a -> Reverse * f a -> Reverse * f a #

some :: Reverse * f a -> Reverse * f [a] #

many :: Reverse * f a -> Reverse * f [a] #

MonadPlus m => MonadPlus (Reverse * m) Source #

Derived instance.

Methods

mzero :: Reverse * m a #

mplus :: Reverse * m a -> Reverse * m a -> Reverse * m a #

(Eq1 f, Eq a) => Eq (Reverse * f a) Source # 

Methods

(==) :: Reverse * f a -> Reverse * f a -> Bool #

(/=) :: Reverse * f a -> Reverse * f a -> Bool #

(Ord1 f, Ord a) => Ord (Reverse * f a) Source # 

Methods

compare :: Reverse * f a -> Reverse * f a -> Ordering #

(<) :: Reverse * f a -> Reverse * f a -> Bool #

(<=) :: Reverse * f a -> Reverse * f a -> Bool #

(>) :: Reverse * f a -> Reverse * f a -> Bool #

(>=) :: Reverse * f a -> Reverse * f a -> Bool #

max :: Reverse * f a -> Reverse * f a -> Reverse * f a #

min :: Reverse * f a -> Reverse * f a -> Reverse * f a #

(Read1 f, Read a) => Read (Reverse * f a) Source # 
(Show1 f, Show a) => Show (Reverse * f a) Source # 

Methods

showsPrec :: Int -> Reverse * f a -> ShowS #

show :: Reverse * f a -> String #

showList :: [Reverse * f a] -> ShowS #