Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. flip :: (a -> b -> c) -> b -> a -> c

   between	Data.Function.Between.Strict.Internal

   Strict variant of flip. Defined as:

   flip f b a = f $! a $! b
   

   Since version 0.11.0.0.

2. flip :: (a -> b -> c) -> b -> a -> c

   classy-prelude-yesod	ClassyPrelude.Yesod

   flip f takes its (first) two arguments in the reverse order of f.

   flip f x y = f y x
   

   flip . flip = id
   

   Examples

   >>> flip (++) "hello" "world"
   "worldhello"
   

   >>> let (.>) = flip (.) in (+1) .> show $ 5
   "6"
   

3. flip :: (a -> b -> c) -> b -> a -> c

   constrained-categories	Control.Category.Constrained.Prelude

   flip f takes its (first) two arguments in the reverse order of f.

   flip f x y = f y x
   

   flip . flip = id
   

   Examples

   >>> flip (++) "hello" "world"
   "worldhello"
   

   >>> let (.>) = flip (.) in (+1) .> show $ 5
   "6"
   

4. flip :: (a -> b -> c) -> b -> a -> c

   constrained-categories	Control.Category.Hask

   flip f takes its (first) two arguments in the reverse order of f.

   flip f x y = f y x
   

   flip . flip = id
   

   Examples

   >>> flip (++) "hello" "world"
   "worldhello"
   

   >>> let (.>) = flip (.) in (+1) .> show $ 5
   "6"
   

5. flip :: (a -> b -> c) -> b -> a -> c

   copilot-language	Copilot.Language.Prelude

   flip f takes its (first) two arguments in the reverse order of f.

   flip f x y = f y x
   

   flip . flip = id
   

   Examples

   >>> flip (++) "hello" "world"
   "worldhello"
   

   >>> let (.>) = flip (.) in (+1) .> show $ 5
   "6"
   

6. flip :: (a -> b -> c) -> b -> a -> c

   verset	Verset

   flip f takes its (first) two arguments in the reverse order of f.

   flip f x y = f y x
   

   flip . flip = id
   

   Examples

   >>> flip (++) "hello" "world"
   "worldhello"
   

   >>> let (.>) = flip (.) in (+1) .> show $ 5
   "6"
   

7. flip :: (a -> b -> c) -> b -> a -> c

   xmonad-contrib	XMonad.Config.Prime

   flip f takes its (first) two arguments in the reverse order of f.

   flip f x y = f y x
   

   flip . flip = id
   

   Examples

   >>> flip (++) "hello" "world"
   "worldhello"
   

   >>> let (.>) = flip (.) in (+1) .> show $ 5
   "6"
   

8. module Data.Bifunctor.Flip

   No documentation available.

9. newtype Flip (p :: k -> k1 -> Type) (a :: k1) (b :: k)

   bifunctors	Data.Bifunctor.Flip

   Make a Bifunctor flipping the arguments of a Bifunctor.

10. Flip :: p b a -> Flip (p :: k -> k1 -> Type) (a :: k1) (b :: k)

    bifunctors	Data.Bifunctor.Flip

    No documentation available.

Page 5 of many | Previous | Next