Hoogle Search

Within LTS Haskell 22.19 (ghc-9.6.4)

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

  1. (++) :: Vector v a => v a -> v a -> v a

    rio RIO.Vector

    O(m+n) Concatenate two vectors.

  2. (++) :: Vector a -> Vector a -> Vector a

    rio RIO.Vector.Boxed

    O(m+n) Concatenate two vectors.

  3. (++) :: Storable a => Vector a -> Vector a -> Vector a

    rio RIO.Vector.Storable

    O(m+n) Concatenate two vectors.

  4. (++) :: Unbox a => Vector a -> Vector a -> Vector a

    rio RIO.Vector.Unboxed

    O(m+n) Concatenate two vectors.

  5. type family (++) (xs :: [k]) (ys :: [k]) :: [k]

    relude Relude.Extra.Type

    Concatenates type-level lists. 

    >>> :kind! '[ 'Just 5, 'Nothing] ++ '[ 'Just 3, 'Nothing, 'Just 1]
'[ 'Just 5, 'Nothing] ++ '[ 'Just 3, 'Nothing, 'Just 1] :: [Maybe
Natural]
= '[ 'Just 5, 'Nothing, 'Just 3, 'Nothing, 'Just 1]

    >>> :kind! '[] ++ '[ 'Just 3, 'Nothing, 'Just 1]
'[] ++ '[ 'Just 3, 'Nothing, 'Just 1] :: [Maybe Natural]
= '[ 'Just 3, 'Nothing, 'Just 1]
    # 91 "srcReludeExtra/Type.hs"

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

    relude Relude.List.Reexport

    Append 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. WARNING: This function takes linear time in the number of elements of the first list.

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

    Cabal-syntax Distribution.Compat.Prelude

    Append 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. WARNING: This function takes linear time in the number of elements of the first list.

  8. data (++)

    first-class-families Fcf

    List catenation.

    Example

    >>> data Example where Ex :: a -> Example  -- Hide the type of examples to avoid brittleness in different GHC versions

>>> :kind! Ex (Eval ([1, 2] ++ [3, 4]) :: [Natural])
Ex (Eval ([1, 2] ++ [3, 4]) :: [Natural]) :: Example
= Ex [1, 2, 3, 4]

  9. data (++)

    first-class-families Fcf.Data.List

    List catenation.

    Example

    >>> data Example where Ex :: a -> Example  -- Hide the type of examples to avoid brittleness in different GHC versions

>>> :kind! Ex (Eval ([1, 2] ++ [3, 4]) :: [Natural])
Ex (Eval ([1, 2] ++ [3, 4]) :: [Natural]) :: Example
= Ex [1, 2, 3, 4]

  10. (++) :: Foldable f => f a -> Infinite a -> Infinite a

    ghc-lib-parser GHC.Data.List.Infinite

    No documentation available.

Page 3 of many | Previous | Next