Hoogle Search

Within LTS Haskell 24.20 (ghc-9.10.3)

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

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

    massiv Data.Massiv.Array.Numeric

    Subtract each element of the array from a scalar. Array is on the right.

  2. (/.) :: (Index ix, NumericFloat r e) => e -> Array r ix e -> Array r ix e

    massiv Data.Massiv.Array.Numeric

    Divide a scalar value by each element of the array. 

    e /. arr == e *. recipA arr

    Example

    >>> let arr = fromIntegral <$> (Ix1 20 ..: 25) :: Array D Ix1 Float

>>> arr
Array D Seq (Sz1 5)
[ 20.0, 21.0, 22.0, 23.0, 24.0 ]

>>> 100 /. arr
Array D Seq (Sz1 5)
[ 5.0, 4.7619047, 4.5454545, 4.347826, 4.1666665 ]

  3. (><.) :: (MonadThrow m, Numeric r e, Manifest r e) => Vector r e -> Matrix r e -> m (Vector r e)

    massiv Data.Massiv.Array.Numeric

    Multiply a row vector by a matrix. Same as ><! but produces monadic computation that allows for handling failure. Throws Exception: SizeMismatchException when inner dimensions of arrays do not match.

  4. (:.) :: Int -> Int -> Ix2

    massiv Data.Massiv.Core.Index

    No documentation available.

  5. data m :+. n

    monoid-extras Data.Semigroup.Coproduct

    m :+. n is the coproduct of semigroups m and n. Values of type m :+. n consist of alternating non-empty lists of m and n values. Composition is list concatenation, with appropriate combining of adjacent elements

  6. newtype ((f :: k2 -> Type) :.: (g :: k1 -> k2)) (p :: k1)

    protolude Protolude

    Composition of functors

  7. (<.>) :: Semiring m => m -> m -> m

    protolude Protolude.Semiring

    No documentation available.

  8. (*.) :: (Integral i, RealFrac r) => DecimalRaw i -> r -> DecimalRaw i

    Decimal Data.Decimal

    Multiply a DecimalRaw by a RealFrac value.

  9. (<*>.+) :: C x => T (v, v) (x -> a) -> (v -> x) -> T (v, v) a

    numeric-prelude Algebra.Additive 

    addPair :: (Additive.C a, Additive.C b) => (a,b) -> (a,b) -> (a,b)
addPair = Elem.run2 $ Elem.with (,) <*>.+  fst <*>.+  snd

  10. (<*>.-) :: C x => T (v, v) (x -> a) -> (v -> x) -> T (v, v) a

    numeric-prelude Algebra.Additive

    No documentation available.

Page 114 of many | Previous | Next