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.

Exact lookup

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

   xmonad-contrib	XMonad.Config.Prime

   (++) 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]
   

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

   xmonad-contrib	XMonad.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] -> Stream a -> Stream a

   xmonad-contrib	XMonad.Prelude

   Absorb a list into an infinite stream.

4. (<+>) :: ArrowPlus a => a b c -> a b c -> a b c

   base	Control.Arrow

   An associative operation with identity zeroArrow.

5. (:+) :: a -> a -> Complex a

   base	Data.Complex

   forms a complex number from its real and imaginary rectangular components.

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

   base	Text.ParserCombinators.ReadP

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

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

   base	Text.ParserCombinators.ReadPrec

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

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

   base	GHC.Generics

   Sums: encode choice between constructors

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

   template-haskell	Language.Haskell.TH.PprLib

   No documentation available.

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

    template-haskell	Language.Haskell.TH.PprLib

    No documentation available.

Page 37 of many | Previous | Next