Hoogle Search

Within LTS Haskell 24.22 (ghc-9.10.3)

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

  1. type family (a6989586621679541705 :: f a) <&>@#@$$$ (a6989586621679541706 :: a ~> b) :: f b

    singletons-base Data.Functor.Singletons

    No documentation available.

  2. (%&&) :: forall (a :: Bool) (b :: Bool) . Sing a -> Sing b -> Sing (a && b)

    singletons-base Data.Singletons.Base.TH

    Conjunction of singletons

  3. (%&&) :: forall (a :: Bool) (b :: Bool) . Sing a -> Sing b -> Sing (a && b)

    singletons-base Prelude.Singletons

    Conjunction of singletons

  4. (|>&) :: (Integral a, FiniteBits a) => Buffer % 1 -> a -> Buffer

    text-builder-linear Data.Text.Builder.Linear.Buffer

    Append the lower-case hexadecimal representation of a bounded integral number. Negative numbers are interpreted as their corresponding unsigned number: 

    >>> :set -XOverloadedStrings -XLinearTypes

>>> import Data.Int (Int8, Int16)

>>> runBuffer (\b -> b |>& (-1 :: Int8)) == "ff"
True

>>> runBuffer (\b -> b |>& (-1 :: Int16)) == "ffff"
True

  5. (.&.) :: BitOps bits => bits -> bits -> bits

    basement Basement.Bits

    No documentation available.

  6. (.&.) :: Bits a => a -> a -> a

    ghc-internal GHC.Internal.Bits

    Bitwise "and"

  7. (.&.) :: Bits a => a -> a -> a

    ghc-internal GHC.Internal.Data.Bits

    Bitwise "and"

  8. (<&>) :: Functor f => f a -> (a -> b) -> f b

    ghc-internal GHC.Internal.Data.Functor

    Flipped version of <$>. 

    (<&>) = flip fmap

    Examples

    Apply (+1) to a list, a Just and a Right: 
    >>> Just 2 <&> (+1)
Just 3

    >>> [1,2,3] <&> (+1)
[2,3,4]

    >>> Right 3 <&> (+1)
Right 4

  9. (.&.) :: Bits a => a -> a -> a

    protolude Protolude

    Bitwise "and"

  10. (<&&>) :: Applicative a => a Bool -> a Bool -> a Bool

    protolude Protolude.Bool

    && lifted to an Applicative. Unlike &&^ the operator is not short-circuiting.

Page 31 of many | Previous | Next