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. (+++) :: (MorphChoice a, ObjectSum a b b', ObjectSum a c c') => a b c -> a b' c' -> a (b + b') (c + c')

    constrained-categories Control.Arrow.Constrained

    No documentation available.

  2. (++) :: [a] -> [a] -> [a]

    constrained-categories Control.Category.Constrained.Prelude

    (++) appends two lists, i.e., 

    [x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
[x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
    If the first list is not finite, the result is the first list.

    Performance considerations

    This function takes linear time in the number of elements of the first list. Thus it is better to associate repeated applications of (++) to the right (which is the default behaviour): xs ++ (ys ++ zs) or simply xs ++ ys ++ zs, but not (xs ++ ys) ++ zs. For the same reason concat = foldr (++) [] has linear performance, while foldl (++) [] is prone to quadratic slowdown

    Examples

    >>> [1, 2, 3] ++ [4, 5, 6]
[1,2,3,4,5,6]

    >>> [] ++ [1, 2, 3]
[1,2,3]

    >>> [3, 2, 1] ++ []
[3,2,1]

  3. (++) :: [a] -> [a] -> [a]

    constrained-categories Control.Category.Hask

    (++) appends two lists, i.e., 

    [x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
[x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
    If the first list is not finite, the result is the first list.

    Performance considerations

    This function takes linear time in the number of elements of the first list. Thus it is better to associate repeated applications of (++) to the right (which is the default behaviour): xs ++ (ys ++ zs) or simply xs ++ ys ++ zs, but not (xs ++ ys) ++ zs. For the same reason concat = foldr (++) [] has linear performance, while foldl (++) [] is prone to quadratic slowdown

    Examples

    >>> [1, 2, 3] ++ [4, 5, 6]
[1,2,3,4,5,6]

    >>> [] ++ [1, 2, 3]
[1,2,3]

    >>> [3, 2, 1] ++ []
[3,2,1]

  4. (++) :: Typed a => [a] -> Stream a -> Stream a

    copilot-language Copilot.Language.Operators.Temporal

    Prepend a fixed number of samples to a stream. The elements to be appended at the beginning of the stream must be limited, that is, the list must have finite length. Prepending elements to a stream may increase the memory requirements of the generated programs (which now must hold the same number of elements in memory for future processing).

  5. type family (as :: [k]) ++ (bs :: [k]) :: [k]

    generic-data-functions Generic.Data.Function.Common.Generic.Meta

    Append for type-level lists.

  6. (++) :: forall (u :: Type -> Type) a (v :: Type -> Type) b . (Vector u a, Vector v b) => Vector u v (a, b) -> Vector u v (a, b) -> Vector u v (a, b)

    hybrid-vectors Data.Vector.Hybrid

    O(m+n) Concatenate two vectors

  7. type (a1 :: [a]) ++ (b :: [a]) = Append a1 b

    incipit-core IncipitCore

    Convenience type alias for concatenating two effect rows.

  8. (++) :: [a] -> [a] -> [a]

    listsafe Data.List.Safe

    (++) appends two lists, i.e., 

    [x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
[x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
    If the first list is not finite, the result is the first list.

    Performance considerations

    This function takes linear time in the number of elements of the first list. Thus it is better to associate repeated applications of (++) to the right (which is the default behaviour): xs ++ (ys ++ zs) or simply xs ++ ys ++ zs, but not (xs ++ ys) ++ zs. For the same reason concat = foldr (++) [] has linear performance, while foldl (++) [] is prone to quadratic slowdown

    Examples

    >>> [1, 2, 3] ++ [4, 5, 6]
[1,2,3,4,5,6]

    >>> [] ++ [1, 2, 3]
[1,2,3]

    >>> [3, 2, 1] ++ []
[3,2,1]

  9. (+=) :: forall k s m a (is :: IxList) . (Is k A_Setter, MonadState s m, Num a) => Optic' k is s a -> a -> m ()

    optics-operators Data.Optics.Operators

    Modify the target of the optic by adding a value. 

    data Person = Person { age :: Int } deriving (Generic)

f :: MonadState Person m => m ()
f = #age += 1

  10. (+/-) :: Num a => a -> a -> Uncert a

    uncertain Numeric.Uncertain

    Create an Uncert around a central value and a given "range" of uncertainty. The range is interpreted as the standard deviation of the underlying random variable. Might be preferrable over :+/- because it is more general (doesn't require a Floating constraint) and looks a bit nicer. See uStd for more details.

Page 36 of many | Previous | Next