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. (+~) :: SemiNum absolute relative => absolute -> relative -> absolute

   yi-language	Yi.Lexer.Alex

   No documentation available.

2. (+~) :: SemiNum absolute relative => absolute -> relative -> absolute

   yi-language	Yi.Utils

   No documentation available.

3. (+*+) :: [a] -> [b] -> [(a, b)]

   universe-base	Data.Universe.Helpers

   cartesianProduct (,)
   

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

   universe-base	Data.Universe.Helpers

   Fair 2-way interleaving.

5. (+#) :: Int# -> Int# -> Int#

   ghc-internal	GHC.Internal.Base

   No documentation available.

6. (+##) :: Double# -> Double# -> Double#

   ghc-internal	GHC.Internal.Base

   No documentation available.

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

   ghc-internal	GHC.Internal.Base

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

8. (+++) :: ArrowChoice a => a b c -> a b' c' -> a (Either b b') (Either c c')

   ghc-internal	GHC.Internal.Control.Arrow

   Split the input between the two argument arrows, retagging and merging their outputs. Note that this is in general not a functor. The default definition may be overridden with a more efficient version if desired.

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

   ghc-internal	GHC.Internal.Data.List

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

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

    ghc-internal	GHC.Internal.Data.OldList

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

Page 15 of many | Previous | Next