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

    composition-prelude Control.Composition

    & is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $. This is a version of flip id, where id is specialized from a -> a to (a -> b) -> (a -> b) which by the associativity of (->) is (a -> b) -> a -> b. flipping this yields a -> (a -> b) -> b which is the type signature of &

    Examples

    >>> 5 & (+1) & show
"6"

    >>> sqrt $ [1 / n^2 | n <- [1..1000]] & sum & (*6)
3.1406380562059946

  2. (&) :: Formula -> Formula -> Formula

    djinn-lib Djinn.LJTFormula

    No documentation available.

  3. (&) :: HasConcat a => a -> a -> a

    funcmp FMP.Picture

    No documentation available.

  4. (&) :: DynGraph gr => Context a b -> gr a b -> gr a b

    ghc-lib GHC.Data.Graph.Inductive.Graph

    Merge the Context into the DynGraph. Context adjacencies should only refer to either a Node already in a graph or the node in the Context itself (for loops). Behaviour is undefined if the specified Node already exists in the graph.

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

    indexed-transformers Control.Monad.Trans.Indexed

    & is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $. This is a version of flip id, where id is specialized from a -> a to (a -> b) -> (a -> b) which by the associativity of (->) is (a -> b) -> a -> b. flipping this yields a -> (a -> b) -> b which is the type signature of &

    Examples

    >>> 5 & (+1) & show
"6"

    >>> sqrt $ [1 / n^2 | n <- [1..1000]] & sum & (*6)
3.1406380562059946

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

    quaalude Essentials

    & is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $. This is a version of flip id, where id is specialized from a -> a to (a -> b) -> (a -> b) which by the associativity of (->) is (a -> b) -> a -> b. flipping this yields a -> (a -> b) -> b which is the type signature of &

    Examples

    >>> 5 & (+1) & show
"6"

    >>> sqrt $ [1 / n^2 | n <- [1..1000]] & sum & (*6)
3.1406380562059946

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

    verset Verset

    & is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $. This is a version of flip id, where id is specialized from a -> a to (a -> b) -> (a -> b) which by the associativity of (->) is (a -> b) -> a -> b. flipping this yields a -> (a -> b) -> b which is the type signature of &

    Examples

    >>> 5 & (+1) & show
"6"

    >>> sqrt $ [1 / n^2 | n <- [1..1000]] & sum & (*6)
3.1406380562059946

  8. (&&) :: Bool -> Bool -> Bool

    base Prelude

    Boolean "and", lazy in the second argument

  9. (&&&) :: Arrow a => a b c -> a b c' -> a b (c, c')

    base Control.Arrow

    Fanout: send the input to both argument arrows and combine their output. The default definition may be overridden with a more efficient version if desired.

  10. (&&) :: Bool -> Bool -> Bool

    base Data.Bool

    Boolean "and", lazy in the second argument

Page 5 of many | Previous | Next