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

   ghc-lib-parser	GHC.Prelude.Basic

   Right to left function composition.

   (f . g) x = f (g x)
   

   f . id = f = id . f
   

   Examples

   >>> map ((*2) . length) [[], [0, 1, 2], [0]]
   [0,6,2]
   

   >>> foldr (.) id [(+1), (*3), (^3)] 2
   25
   

   >>> let (...) = (.).(.) in ((*2)...(+)) 5 10
   30
   

2. (.) :: forall (b :: k) (c :: k) (a :: k) . Category cat => cat b c -> cat a b -> cat a c

   foundation	Foundation

   morphism composition

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

   prelude-compat	Prelude2010

   Right to left function composition.

   (f . g) x = f (g x)
   

   f . id = f = id . f
   

   Examples

   >>> map ((*2) . length) [[], [0, 1, 2], [0]]
   [0,6,2]
   

   >>> foldr (.) id [(+1), (*3), (^3)] 2
   25
   

   >>> let (...) = (.).(.) in ((*2)...(+)) 5 10
   30
   

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

   base-prelude	BasePrelude.Operators

   Right to left function composition.

   (f . g) x = f (g x)
   

   f . id = f = id . f
   

   Examples

   >>> map ((*2) . length) [[], [0, 1, 2], [0]]
   [0,6,2]
   

   >>> foldr (.) id [(+1), (*3), (^3)] 2
   25
   

   >>> let (...) = (.).(.) in ((*2)...(+)) 5 10
   30
   

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

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   Right to left function composition.

   (f . g) x = f (g x)
   

   f . id = f = id . f
   

   Examples

   >>> map ((*2) . length) [[], [0, 1, 2], [0]]
   [0,6,2]
   

   >>> foldr (.) id [(+1), (*3), (^3)] 2
   25
   

   >>> let (...) = (.).(.) in ((*2)...(+)) 5 10
   30
   

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

   LambdaHack	Game.LambdaHack.Core.Prelude

   Right to left function composition.

   (f . g) x = f (g x)
   

   f . id = f = id . f
   

   Examples

   >>> map ((*2) . length) [[], [0, 1, 2], [0]]
   [0,6,2]
   

   >>> foldr (.) id [(+1), (*3), (^3)] 2
   25
   

   >>> let (...) = (.).(.) in ((*2)...(+)) 5 10
   30
   

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

   cabal-install-solver	Distribution.Solver.Compat.Prelude

   Right to left function composition.

   (f . g) x = f (g x)
   

   f . id = f = id . f
   

   Examples

   >>> map ((*2) . length) [[], [0, 1, 2], [0]]
   [0,6,2]
   

   >>> foldr (.) id [(+1), (*3), (^3)] 2
   25
   

   >>> let (...) = (.).(.) in ((*2)...(+)) 5 10
   30
   

8. (.) :: (b -> c) -> (a -> b) -> a -> c

   ihaskell	IHaskellPrelude

   Right to left function composition.

   (f . g) x = f (g x)
   

   f . id = f = id . f
   

   Examples

   >>> map ((*2) . length) [[], [0, 1, 2], [0]]
   [0,6,2]
   

   >>> foldr (.) id [(+1), (*3), (^3)] 2
   25
   

   >>> let (...) = (.).(.) in ((*2)...(+)) 5 10
   30
   

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

   incipit-base	Incipit.Base

   Right to left function composition.

   (f . g) x = f (g x)
   

   f . id = f = id . f
   

   Examples

   >>> map ((*2) . length) [[], [0, 1, 2], [0]]
   [0,6,2]
   

   >>> foldr (.) id [(+1), (*3), (^3)] 2
   25
   

   >>> let (...) = (.).(.) in ((*2)...(+)) 5 10
   30
   

10. (.) :: (b -> c) -> (a -> b) -> a -> c

    clash-prelude	Clash.HaskellPrelude

    Right to left function composition.

    (f . g) x = f (g x)
    

    f . id = f = id . f
    

    Examples

    >>> map ((*2) . length) [[], [0, 1, 2], [0]]
    [0,6,2]
    

    >>> foldr (.) id [(+1), (*3), (^3)] 2
    25
    

    >>> let (...) = (.).(.) in ((*2)...(+)) 5 10
    30
    

Page 3 of many | Previous | Next