Hoogle Search

Within LTS Haskell 22.19 (ghc-9.6.4)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

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

    base Data.Function

    & 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 $. 

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

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

    amazonka-core Amazonka.Prelude

    & 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 $. 

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

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

    lens Control.Lens.Lens

    & 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 $. 

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

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

    lens Control.Lens.Operators

    & 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 $. 

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

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

    base-compat Data.Function.Compat

    & 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 $. 

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

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

    microlens Lens.Micro

    & 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 $. 

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

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

    ghc 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.

  8. class (p, q) => p & q

    constraints Data.Constraint

    due to the hack for the kind of (,) in the current version of GHC we can't actually make instances for (,) :: Constraint -> Constraint -> Constraint, but we can define an equivalent type, that converts back and forth to (,), and lets you hang instances.

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

    rio RIO.Prelude

    & 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 $. 

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

  10. (&) :: forall n . KnownNat n => R n -> ℝ -> R (n + 1)

    hmatrix Numeric.LinearAlgebra.Static

    No documentation available.

Page 1 of many | Next