
Data.Function  Portability  portable  Stability  experimental  Maintainer  libraries@haskell.org 





Description 
Simple combinators working solely on and with functions.


Synopsis 

id :: a > a   const :: a > b > a   (.) :: (b > c) > (a > b) > a > c   flip :: (a > b > c) > b > a > c   ($) :: (a > b) > a > b   fix :: (a > a) > a   on :: (b > b > c) > (a > b) > a > a > c 



Prelude reexports



Identity function.



Constant function.


(.) :: (b > c) > (a > b) > a > c  Source 

Function composition.


flip :: (a > b > c) > b > a > c  Source 

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


($) :: (a > b) > a > b  Source 

Application operator. This operator is redundant, since ordinary
application (f x) means the same as (f $ x). However, $ has
low, rightassociative binding precedence, so it sometimes allows
parentheses to be omitted; for example:
f $ g $ h x = f (g (h x))
It is also useful in higherorder situations, such as map ($ 0) xs,
or zipWith ($) fs xs.


Other combinators



fix f is the least fixed point of the function f,
i.e. the least defined x such that f x = x.


on :: (b > b > c) > (a > b) > a > a > c  Source 

(*) `on` f = \x y > f x * f y.
Typical usage: sortBy (compare `on` fst).
Algebraic properties:


Produced by Haddock version 0.8 