Hoogle Search

Within LTS Haskell 22.13 (ghc-9.6.4)

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

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

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

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

    base Data.List

    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.

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

    base GHC.Base

    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.

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

    base GHC.List

    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.

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

    base GHC.OldList

    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.

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

    vector Data.Vector

    O(m+n) Concatenate two vectors.

  7. (++) :: Bundle v a -> Bundle v a -> Bundle v a

    vector Data.Vector.Fusion.Bundle

    Concatenate two Bundles

  8. (++) :: Monad m => Bundle m v a -> Bundle m v a -> Bundle m v a

    vector Data.Vector.Fusion.Bundle.Monadic

    Concatenate two Bundles

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

    vector Data.Vector.Generic

    O(m+n) Concatenate two vectors.

  10. (++) :: Prim a => Vector a -> Vector a -> Vector a

    vector Data.Vector.Primitive

    O(m+n) Concatenate two vectors.

Page 1 of many | Next