Hoogle Search

Within LTS Haskell 22.43 (ghc-9.6.6)

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

Exact lookup

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. (++) :: [a] -> [a] -> [a]

   amazonka-core	Amazonka.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.

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

   hedgehog	Hedgehog.Internal.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. (++) :: Foldable f => f a -> Infinite a -> Infinite a

   ghc	GHC.Data.List.Infinite

   No documentation available.

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

   ghc	GHC.Prelude.Basic

   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.

10. type (m :: Symbol) ++ (n :: Symbol) = AppendSymbol m n

    constraints	Data.Constraint.Symbol

    An infix synonym for AppendSymbol.

Page 1 of many | Next