{-# LANGUAGE ExplicitForAll #-}
{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE Trustworthy #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# OPTIONS_HADDOCK print-explicit-runtime-reps #-}
module GHC.Internal.Data.Function
(
id, const, (.), flip, ($)
, (&)
, fix
, on
, applyWhen
) where
import GHC.Internal.Base ( TYPE, ($), (.), id, const, flip )
import GHC.Internal.Data.Bool ( Bool(..) )
infixl 0 `on`
infixl 1 &
fix :: (a -> a) -> a
fix :: forall a. (a -> a) -> a
fix a -> a
f = let x :: a
x = a -> a
f a
x in a
x
on :: (b -> b -> c) -> (a -> b) -> a -> a -> c
b -> b -> c
(.*.) on :: forall b c a. (b -> b -> c) -> (a -> b) -> a -> a -> c
`on` a -> b
f = \a
x a
y -> a -> b
f a
x b -> b -> c
.*. a -> b
f a
y
(&) :: forall r a (b :: TYPE r). a -> (a -> b) -> b
a
x & :: forall a b. a -> (a -> b) -> b
& a -> b
f = a -> b
f a
x
applyWhen :: Bool -> (a -> a) -> a -> a
applyWhen :: forall a. Bool -> (a -> a) -> a -> a
applyWhen Bool
True a -> a
f a
x = a -> a
f a
x
applyWhen Bool
False a -> a
_ a
x = a
x
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4