Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

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

    diagrams-lib Diagrams.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 $. 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. (&) :: a -> (a -> b) -> b

    Cabal-syntax Distribution.Compat.Lens

    & is a reverse application operator

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

    relude Relude.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 $. 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

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

    fgl 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. data ((c :: a) & (d :: a -> Exp b)) (e :: b)

    first-class-families Fcf.Data.Function

    Reverse function application, argument first.

    Example

    >>> :kind! Eval ('(True, Nothing) & Fst)
Eval ('(True, Nothing) & Fst) :: Bool
= True

  6. type family (a1 :: a) & (a2 :: a ~> b) :: b

    singletons-base Data.Function.Singletons

    No documentation available.

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

    protolude Protolude

    & 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. (&) :: forall (r :: RuntimeRep) a (b :: TYPE r) . a -> (a -> b) -> b

    ghc-internal GHC.Internal.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 $. 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

  9. (&) :: Ord n => Context n -> DotGraph n -> DotGraph n

    graphviz Data.GraphViz.Types.Graph

    Merge the Context into the graph. Assumes that the specified node is not in the graph but that all endpoints in the successors and predecessors (with the exception of loops) are. If the cluster is not present in the graph, then it will be added with no attributes with a parent of the root graph. Note that & and decompose are not quite inverses, as this function will add in the cluster if it does not yet exist in the graph, but decompose will not delete it.

  10. (&) :: s -> (s -> t) -> t

    lens-family Lens.Family2

    A flipped version of ($).

Page 2 of many | Previous | Next