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.
-
ghc-internal GHC.Internal.Exts No documentation available.
(
+## ) :: Double# -> Double# -> Double#ghc-internal GHC.Internal.Exts No documentation available.
-
ghc-internal GHC.Internal.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 slowdownExamples
>>> [1, 2, 3] ++ [4, 5, 6] [1,2,3,4,5,6]
>>> [] ++ [1, 2, 3] [1,2,3]
>>> [3, 2, 1] ++ [] [3,2,1]
(
+++ ) :: ReadP a -> ReadP a -> ReadP aghc-internal GHC.Internal.Text.ParserCombinators.ReadP Symmetric choice.
(
+++ ) :: ReadPrec a -> ReadPrec a -> ReadPrec aghc-internal GHC.Internal.Text.ParserCombinators.ReadPrec Symmetric choice.
(
+~ ) :: Num a => Setter s t a a -> a -> s -> tlens-family Lens.Family2 No documentation available.
(
+!= ) :: (MonadState s m, Num a) => Setter' s a -> a -> m ()lens-family Lens.Family2.State.Lazy No documentation available.
(
+= ) :: (MonadState s m, Num a) => Setter' s a -> a -> m ()lens-family Lens.Family2.State.Lazy No documentation available.
(
+!= ) :: (MonadState s m, Num a) => Setter' s a -> a -> m ()lens-family Lens.Family2.State.Strict No documentation available.
(
+= ) :: (MonadState s m, Num a) => Setter' s a -> a -> m ()lens-family Lens.Family2.State.Strict No documentation available.