Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

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

    incipit-base Incipit.Base

    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.

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

    liquid-fixpoint Language.Fixpoint.Types.Refinements

    No documentation available.

  3. (&&&!) :: (a -> b) -> (a -> c) -> a -> (b, c)

    netwire Control.Wire.Core

    Left-strict version of &&& for functions.

  4. (&>) :: forall (m :: Type -> Type) s e a b . Monad m => Wire s e m a (Event b) -> Wire s e m a (Event b) -> Wire s e m a (Event b)

    netwire Control.Wire.Event

    Merge events with the rightmost event taking precedence. Equivalent to using the monoid interface with Last. Infixl 5.

    • Depends: now on both.
    • Inhibits: when any of the two wires inhibit.

  5. (&&) :: Boolean a => a -> a -> a

    Agda Agda.Utils.Boolean

    No documentation available.

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

    Agda Agda.Utils.Lens

    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.

  7. (&&*) :: Boolean b => b -> b -> b

    Boolean Data.Boolean

    No documentation available.

  8. (&&) :: Boolean a => a -> a -> a

    Boolean Data.Boolean.Overload

    No documentation available.

  9. (&?) :: Mass Bool -> Mass Bool -> Mass Bool

    approximate Data.Approximate.Mass

    Calculate the logical and of two booleans with confidence lower bounds.

  10. (&&) :: Boolean b => b -> b -> b

    cond Data.Algebra.Boolean

    Logical conjunction. (infixr 3)

Page 20 of many | Previous | Next