Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

  1. (<++) :: ReadP a -> ReadP a -> ReadP a

    ghc-internal GHC.Internal.Text.ParserCombinators.ReadP

    Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used.

  2. (<++) :: ReadPrec a -> ReadPrec a -> ReadPrec a

    ghc-internal GHC.Internal.Text.ParserCombinators.ReadPrec

    Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used.

  3. (!+!) :: (HasCallStack, Index ix, Numeric r e) => Array r ix e -> Array r ix e -> Array r ix e

    massiv Data.Massiv.Array.Numeric

    Add two arrays together pointwise. Prefer to use monadic version of this function .+. whenever possible, because it is better to avoid partial functions.

    • Partial Mismatched array sizes will result in an impure exception being thrown.

    Example

    >>> let a1 = Ix1 0 ... 10

>>> let a2 = Ix1 20 ... 30

>>> a1 !+! a2
Array D Seq (Sz1 11)
[ 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40 ]

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

    massiv Data.Massiv.Array.Numeric

    Add a scalar to each element of the array. Array is on the left.

  5. (.+.) :: (Index ix, Numeric r e, MonadThrow m) => Array r ix e -> Array r ix e -> m (Array r ix e)

    massiv Data.Massiv.Array.Numeric

    Add two arrays together pointwise. Same as !+! but produces monadic computation that allows for handling failure. Throws Exception: SizeMismatchException when array sizes do not match.

  6. data m :+: n

    monoid-extras Data.Monoid.Coproduct

    m :+: n is the coproduct of monoids m and n. Values of type m :+: n consist of alternating lists of m and n values. The empty list is the identity, and composition is list concatenation, with appropriate combining of adjacent elements and removing identities when possible.

  7. 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

  8. (<+>) :: Value -> Value -> Value

    openapi3 Data.OpenApi.Internal.Utils

    No documentation available.

  9. data ((f :: k -> Type) :+: (g :: k -> Type)) (p :: k)

    protolude Protolude

    Sums: encode choice between constructors

  10. ($+$) :: Doc -> Doc -> Doc

    HTF Test.Framework.Pretty

    Above, with no overlapping. $+$ is associative, with identity empty.

Page 48 of many | Previous | Next