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. (+##) :: Double# -> Double# -> Double#

   base	GHC.Base

   No documentation available.

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

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

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

   base	GHC.Exts

   No documentation available.

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

   base	GHC.Exts

   No documentation available.

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

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

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

   ghc-prim	GHC.Prim

   No documentation available.

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

   ghc-prim	GHC.Prim

   No documentation available.

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

   ghc-prim	GHC.PrimopWrappers

   No documentation available.

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

   ghc-prim	GHC.PrimopWrappers

   No documentation available.

10. (+=) :: (MonadState s m, Num a) => ASetter' s a -> a -> m ()

    lens	Control.Lens.Operators

    Modify the target(s) of a Lens', Iso, Setter or Traversal by adding a value. Example:

    fresh :: MonadState Int m => m Int
    fresh = do
    id += 1
    use id
    

    >>> execState (do _1 += c; _2 += d) (a,b)
    (a + c,b + d)
    

    >>> execState (do _1.at 1.non 0 += 10) (Map.fromList [(2,100)],"hello")
    (fromList [(1,10),(2,100)],"hello")
    

    (+=) :: (MonadState s m, Num a) => Setter' s a    -> a -> m ()
    (+=) :: (MonadState s m, Num a) => Iso' s a       -> a -> m ()
    (+=) :: (MonadState s m, Num a) => Lens' s a      -> a -> m ()
    (+=) :: (MonadState s m, Num a) => Traversal' s a -> a -> m ()
    

Page 9 of many | Previous | Next