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. (.|.) :: Bits a => a -> a -> a

    ghc-internal GHC.Internal.Bits

    Bitwise "or"

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

    ghc-internal GHC.Internal.Data.Bits

    Bitwise "and"

  3. (.<<.) :: Bits a => a -> Int -> a

    ghc-internal GHC.Internal.Data.Bits

    Infix version of shiftL.

  4. (.>>.) :: Bits a => a -> Int -> a

    ghc-internal GHC.Internal.Data.Bits

    Infix version of shiftR.

  5. (.^.) :: Bits a => a -> a -> a

    ghc-internal GHC.Internal.Data.Bits

    Infix version of xor.

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

    ghc-internal GHC.Internal.Data.Bits

    Bitwise "or"

  7. (...) :: Index ix => ix -> ix -> Array D ix ix

    massiv Data.Massiv.Array

    Handy synonym for rangeInclusive Seq. Similar to .. for list. 

    >>> Ix1 4 ... 10
Array D Seq (Sz1 7)
[ 4, 5, 6, 7, 8, 9, 10 ]

  8. (..:) :: Index ix => ix -> ix -> Array D ix ix

    massiv Data.Massiv.Array

    Handy synonym for range Seq 

    >>> Ix1 4 ..: 10
Array D Seq (Sz1 6)
[ 4, 5, 6, 7, 8, 9 ]

  9. (.*) :: (Index ix, Numeric r e) => Array r ix e -> e -> Array r ix e

    massiv Data.Massiv.Array.Numeric

    Multiply each element of the array by a scalar value. Scalar is on the right.

    Example

    >>> let arr = Ix1 20 ..: 25

>>> arr
Array D Seq (Sz1 5)
[ 20, 21, 22, 23, 24 ]

>>> arr .* 10
Array D Seq (Sz1 5)
[ 200, 210, 220, 230, 240 ]

  10. (.**) :: (Index ix, Source r1 e, Source r2 e, Floating e) => Array r1 ix e -> Array r2 ix e -> Array D ix e

    massiv Data.Massiv.Array.Numeric

    Apply power to each element of the array where the power value is in the same cell in the second array. 

    arr1 .** arr2 == zipWith (**) arr1 arr2
    • Partial Throws an error when arrays do not have matching sizes

Page 22 of many | Previous | Next