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. (+^) :: (Shape sh, Source r1 c, Source r2 c, Num c) => Array r1 sh c -> Array r2 sh c -> Array D sh c

   repa	Data.Array.Repa.Operators.Mapping

   No documentation available.

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

   speculate	Test.Speculate.Utils

   Merges two lists discarding repeated elements. The argument lists need to be in order.

   > [1,10,100] +++ [9,10,11]
   [1,9,10,11,100]
   

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

   speculate	Test.Speculate.Utils

   xs +- ys superimposes xs over ys.

   • 1,2,3 +- [0,0,0,0,0,0,0] == [1,2,3,0,0,0,0]
   • x,y,z +- [a,b,c,d,e,f,g] == [x,y,z,d,e,f,g] "asdf" +- "this is a test" == "asdf is a test"

4. (+++) :: (HTML a, HTML b) => a -> b -> Html

   xhtml	Text.XHtml.Frameset

   Create a piece of HTML which is the concatenation of two things which can be made into HTML.

5. (+++) :: (HTML a, HTML b) => a -> b -> Html

   xhtml	Text.XHtml.Strict

   Create a piece of HTML which is the concatenation of two things which can be made into HTML.

6. (+++) :: (HTML a, HTML b) => a -> b -> Html

   xhtml	Text.XHtml.Transitional

   Create a piece of HTML which is the concatenation of two things which can be made into HTML.

7. (+-) :: LaTeXC l => l -> l -> l

   HaTeX	Text.LaTeX.Base.Math

   Plus-or-minus operator <math>. Also available as symbol pm.

8. (+-) :: LaTeXC l => l -> l -> l

   HaTeX	Text.LaTeX.Packages.AMSMath

   Plus-or-minus operator <math>. Also available as symbol pm.

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

   LambdaHack	Game.LambdaHack.Core.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]
   

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

    LambdaHack	Game.LambdaHack.Core.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]
    

Page 24 of many | Previous | Next