Methods

from1 :: forall (a :: k). Reverse f a -> Rep1 (Reverse f) a

to1 :: forall (a :: k). Rep1 (Reverse f) a -> Reverse f a

Methods

fold1 :: Semigroup m => Reverse f m -> m Source

foldMap1 :: Semigroup m => (a -> m) -> Reverse f a -> m Source

foldMap1' :: Semigroup m => (a -> m) -> Reverse f a -> m Source

toNonEmpty :: Reverse f a -> NonEmpty a Source

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

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

head :: Reverse f a -> a Source

last :: Reverse f a -> a Source

foldrMap1 :: (a -> b) -> (a -> b -> b) -> Reverse f a -> b Source

foldlMap1' :: (a -> b) -> (b -> a -> b) -> Reverse f a -> b Source

foldlMap1 :: (a -> b) -> (b -> a -> b) -> Reverse f a -> b Source

foldrMap1' :: (a -> b) -> (a -> b -> b) -> Reverse f a -> b Source

Methods

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

Methods

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

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

Methods

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

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

Methods

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

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

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]

Methods

pure :: a -> Reverse f a

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

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

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

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

Methods

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

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

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

Methods

mzero :: Reverse m a

mplus :: Reverse m a -> Reverse m a -> Reverse m a

Methods

fail :: String -> Reverse m a

Methods

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

foldMap :: Monoid m => (a -> m) -> Reverse f a -> 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

Methods

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

sequenceA :: Applicative f0 => Reverse f (f0 a) -> f0 (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)

Methods

from :: Reverse f a -> Rep (Reverse f a) x

to :: Rep (Reverse f a) x -> Reverse f a

Methods

readsPrec :: Int -> ReadS (Reverse f a)

readList :: ReadS [Reverse f a]

readPrec :: ReadPrec (Reverse f a)

readListPrec :: ReadPrec [Reverse f a]

Methods

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

show :: Reverse f a -> String

showList :: [Reverse f a] -> ShowS

Methods

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

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

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