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. (.) :: forall (a :: κ) (b :: κ) (c :: κ) . (Category k, Object k a, Object k b, Object k c) => k b c -> k a b -> k a c

   constrained-categories	Control.Category.Constrained.Prelude

   No documentation available.

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

   copilot-language	Copilot.Language.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
   

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

   free-categories	Control.Category.Free

   morphism composition

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

   quaalude	Essentials

   morphism composition

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

   verset	Verset

   morphism composition

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

   xmonad-contrib	XMonad.Config.Prime

   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. (.&.) :: Bits a => a -> a -> a

   base	Data.Bits

   Bitwise "and"

8. (.<<.) :: Bits a => a -> Int -> a

   base	Data.Bits

   Infix version of shiftL.

9. (.>>.) :: Bits a => a -> Int -> a

   base	Data.Bits

   Infix version of shiftR.

10. (.^.) :: Bits a => a -> a -> a

    base	Data.Bits

    Infix version of xor.

Page 5 of many | Previous | Next