Documentation

Methods

bifmap :: (Flip k1 k :-> k) p q -> (k :-> k) (t p) (t q) Source #

Methods

bimap :: (a -> b) -> (c -> d) -> Flip * * p a c -> Flip * * p b d #

first :: (a -> b) -> Flip * * p a c -> Flip * * p b c #

second :: (b -> c) -> Flip * * p a b -> Flip * * p a c #

Methods

bifold :: Monoid m => Flip * * p m m -> m Source #

bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Flip * * p a b -> m Source #

bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Flip * * p a b -> c Source #

bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Flip * * p a b -> c Source #

Methods

bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Flip * * p a b -> f (Flip * * p c d) Source #

Methods

bipure :: a -> b -> Flip * * p a b Source #

(<<*>>) :: Flip * * p (a -> b) (c -> d) -> Flip * * p a c -> Flip * * p b d Source #

(*>>) :: Flip * * p a b -> Flip * * p c d -> Flip * * p c d Source #

(<<*) :: Flip * * p a b -> Flip * * p c d -> Flip * * p a b Source #

Methods

fmap :: (a -> b) -> Flip * * p a a -> Flip * * p a b #

(<$) :: a -> Flip * * p a b -> Flip * * p a a #

Methods

fold :: Monoid m => Flip * * p a m -> m #

foldMap :: Monoid m => (a -> m) -> Flip * * p a a -> m #

foldr :: (a -> b -> b) -> b -> Flip * * p a a -> b #

foldr' :: (a -> b -> b) -> b -> Flip * * p a a -> b #

foldl :: (b -> a -> b) -> b -> Flip * * p a a -> b #

foldl' :: (b -> a -> b) -> b -> Flip * * p a a -> b #

foldr1 :: (a -> a -> a) -> Flip * * p a a -> a #

foldl1 :: (a -> a -> a) -> Flip * * p a a -> a #

toList :: Flip * * p a a -> [a] #

null :: Flip * * p a a -> Bool #

length :: Flip * * p a a -> Int #

elem :: Eq a => a -> Flip * * p a a -> Bool #

maximum :: Ord a => Flip * * p a a -> a #

minimum :: Ord a => Flip * * p a a -> a #

sum :: Num a => Flip * * p a a -> a #

product :: Num a => Flip * * p a a -> a #

Methods

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

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

mapM :: Monad m => (a -> m b) -> Flip * * p a a -> m (Flip * * p a b) #

sequence :: Monad m => Flip * * p a (m a) -> m (Flip * * p a a) #

Methods

(==) :: Flip k k1 p a b -> Flip k k1 p a b -> Bool #

(/=) :: Flip k k1 p a b -> Flip k k1 p a b -> Bool #

Methods

compare :: Flip k k1 p a b -> Flip k k1 p a b -> Ordering #

(<) :: Flip k k1 p a b -> Flip k k1 p a b -> Bool #

(<=) :: Flip k k1 p a b -> Flip k k1 p a b -> Bool #

(>) :: Flip k k1 p a b -> Flip k k1 p a b -> Bool #

(>=) :: Flip k k1 p a b -> Flip k k1 p a b -> Bool #

max :: Flip k k1 p a b -> Flip k k1 p a b -> Flip k k1 p a b #

min :: Flip k k1 p a b -> Flip k k1 p a b -> Flip k k1 p a b #

Methods

readsPrec :: Int -> ReadS (Flip k k1 p a b) #

readList :: ReadS [Flip k k1 p a b] #

readPrec :: ReadPrec (Flip k k1 p a b) #

readListPrec :: ReadPrec [Flip k k1 p a b] #

Methods

showsPrec :: Int -> Flip k k1 p a b -> ShowS #

show :: Flip k k1 p a b -> String #

showList :: [Flip k k1 p a b] -> ShowS #

Methods

from :: Flip k k1 p a b -> Rep (Flip k k1 p a b) x #

to :: Rep (Flip k k1 p a b) x -> Flip k k1 p a b #