transformers-0.5.6.2: 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

Instances details
MonadFail m => MonadFail (Reverse m) # 
Instance details

Defined in Data.Functor.Reverse

Methods

fail :: String -> Reverse m a Source #

Foldable f => Foldable (Reverse f) #

Fold from right to left.

Instance details

Defined in Data.Functor.Reverse

Methods

fold :: Monoid m => Reverse f m -> m Source #

foldMap :: Monoid m => (a -> m) -> Reverse f a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Reverse f a -> m Source #

foldr :: (a -> b -> b) -> b -> Reverse f a -> b Source #

foldr' :: (a -> b -> b) -> b -> Reverse f a -> b Source #

foldl :: (b -> a -> b) -> b -> Reverse f a -> b Source #

foldl' :: (b -> a -> b) -> b -> Reverse f a -> b Source #

foldr1 :: (a -> a -> a) -> Reverse f a -> a Source #

foldl1 :: (a -> a -> a) -> Reverse f a -> a Source #

toList :: Reverse f a -> [a] Source #

null :: Reverse f a -> Bool Source #

length :: Reverse f a -> Int Source #

elem :: Eq a => a -> Reverse f a -> Bool Source #

maximum :: Ord a => Reverse f a -> a Source #

minimum :: Ord a => Reverse f a -> a Source #

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

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

Eq1 f => Eq1 (Reverse f) # 
Instance details

Defined in Data.Functor.Reverse

Methods

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

Ord1 f => Ord1 (Reverse f) # 
Instance details

Defined in Data.Functor.Reverse

Methods

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

Read1 f => Read1 (Reverse f) # 
Instance details

Defined in Data.Functor.Reverse

Methods

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

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

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Reverse f a) Source #

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Reverse f a] Source #

Show1 f => Show1 (Reverse f) # 
Instance details

Defined in Data.Functor.Reverse

Methods

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

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

Contravariant f => Contravariant (Reverse f) #

Derived instance.

Instance details

Defined in Data.Functor.Reverse

Methods

contramap :: (a' -> a) -> Reverse f a -> Reverse f a' Source #

(>$) :: b -> Reverse f b -> Reverse f a Source #

Traversable f => Traversable (Reverse f) #

Traverse from right to left.

Instance details

Defined in Data.Functor.Reverse

Methods

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

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

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

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

Alternative f => Alternative (Reverse f) #

Derived instance.

Instance details

Defined in Data.Functor.Reverse

Methods

empty :: Reverse f a Source #

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

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

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

Applicative f => Applicative (Reverse f) #

Derived instance.

Instance details

Defined in Data.Functor.Reverse

Methods

pure :: a -> Reverse f a Source #

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

liftA2 :: (a -> b -> c) -> Reverse f a -> Reverse f b -> Reverse f c Source #

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

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

Functor f => Functor (Reverse f) #

Derived instance.

Instance details

Defined in Data.Functor.Reverse

Methods

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

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

Monad m => Monad (Reverse m) #

Derived instance.

Instance details

Defined in Data.Functor.Reverse

Methods

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

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

return :: a -> Reverse m a Source #

MonadPlus m => MonadPlus (Reverse m) #

Derived instance.

Instance details

Defined in Data.Functor.Reverse

Methods

mzero :: Reverse m a Source #

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

(Read1 f, Read a) => Read (Reverse f a) # 
Instance details

Defined in Data.Functor.Reverse

(Show1 f, Show a) => Show (Reverse f a) # 
Instance details

Defined in Data.Functor.Reverse

Methods

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

show :: Reverse f a -> String Source #

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

(Eq1 f, Eq a) => Eq (Reverse f a) # 
Instance details

Defined in Data.Functor.Reverse

Methods

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

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

(Ord1 f, Ord a) => Ord (Reverse f a) # 
Instance details

Defined in Data.Functor.Reverse

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 #