Control.Applicative.Backwards

Methods

fmap :: (a -> b) -> Backwards * f a -> Backwards * f b Source

(<$) :: a -> Backwards * f b -> Backwards * f a Source

Methods

pure :: a -> Backwards * f a Source

(<*>) :: Backwards * f (a -> b) -> Backwards * f a -> Backwards * f b Source

(*>) :: Backwards * f a -> Backwards * f b -> Backwards * f b Source

(<*) :: Backwards * f a -> Backwards * f b -> Backwards * f a Source

Methods

fold :: Monoid m => Backwards * f m -> m Source

foldMap :: Monoid m => (a -> m) -> Backwards * f a -> m Source

foldr :: (a -> b -> b) -> b -> Backwards * f a -> b Source

foldr' :: (a -> b -> b) -> b -> Backwards * f a -> b Source

foldl :: (b -> a -> b) -> b -> Backwards * f a -> b Source

foldl' :: (b -> a -> b) -> b -> Backwards * f a -> b Source

foldr1 :: (a -> a -> a) -> Backwards * f a -> a Source

foldl1 :: (a -> a -> a) -> Backwards * f a -> a Source

toList :: Backwards * f a -> [a] Source

null :: Backwards * f a -> Bool Source

length :: Backwards * f a -> Int Source

elem :: Eq a => a -> Backwards * f a -> Bool Source

maximum :: Ord a => Backwards * f a -> a Source

minimum :: Ord a => Backwards * f a -> a Source

sum :: Num a => Backwards * f a -> a Source

product :: Num a => Backwards * f a -> a Source

Methods

traverse :: Applicative f => (a -> f b) -> Backwards * f a -> f (Backwards * f b) Source

sequenceA :: Applicative f => Backwards * f (f a) -> f (Backwards * f a) Source

mapM :: Monad m => (a -> m b) -> Backwards * f a -> m (Backwards * f b) Source

sequence :: Monad m => Backwards * f (m a) -> m (Backwards * f a) Source

Methods

liftEq :: (a -> b -> Bool) -> Backwards * f a -> Backwards * f b -> Bool Source

Methods

liftCompare :: (a -> b -> Ordering) -> Backwards * f a -> Backwards * f b -> Ordering Source

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Backwards * f a) Source

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Backwards * f a] Source

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Backwards * f a -> ShowS Source

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Backwards * f a] -> ShowS Source

Methods

empty :: Backwards * f a Source

(<|>) :: Backwards * f a -> Backwards * f a -> Backwards * f a Source

some :: Backwards * f a -> Backwards * f [a] Source

many :: Backwards * f a -> Backwards * f [a] Source

Methods

(==) :: Backwards * f a -> Backwards * f a -> Bool

(/=) :: Backwards * f a -> Backwards * f a -> Bool

Methods

compare :: Backwards * f a -> Backwards * f a -> Ordering

(<) :: Backwards * f a -> Backwards * f a -> Bool

(<=) :: Backwards * f a -> Backwards * f a -> Bool

(>) :: Backwards * f a -> Backwards * f a -> Bool

(>=) :: Backwards * f a -> Backwards * f a -> Bool

max :: Backwards * f a -> Backwards * f a -> Backwards * f a

min :: Backwards * f a -> Backwards * f a -> Backwards * f a

Methods

readsPrec :: Int -> ReadS (Backwards * f a) Source

readList :: ReadS [Backwards * f a] Source

readPrec :: ReadPrec (Backwards * f a) Source

readListPrec :: ReadPrec [Backwards * f a] Source

Methods

showsPrec :: Int -> Backwards * f a -> ShowS Source

show :: Backwards * f a -> String Source

showList :: [Backwards * f a] -> ShowS Source