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.

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

    ghc-lib-parser GHC.Prelude.Basic

    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"
    

  2. flip :: (Enum a, Bits w) => a -> T w a -> T w a

    enumset Data.EnumBitSet

    No documentation available.

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

    foundation Foundation

    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

    prelude-compat Prelude2010

    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

    rebase Rebase.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

    base-prelude BasePrelude

    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

    mixed-types-num Numeric.MixedTypes.PreludeHiding

    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. flip :: (a -> b -> c) -> b -> a -> c

    LambdaHack Game.LambdaHack.Core.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"
    

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

    cabal-install-solver Distribution.Solver.Compat.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"
    

  10. flip :: Fake Text

    fakedata Faker.Coin

    No documentation available.

Page 3 of many | Previous | Next