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.
(
+-+ ) :: String -> String -> StringBNFC BNFC.Utils Concatenate strings by an underscore.
(
+.+ ) :: String -> String -> StringBNFC BNFC.Utils Concatenate strings by a dot.
(
+++ ) :: RealVectorSpace ds => ds -> ds -> dsLPFP LPFP No documentation available.
(
+++ ) :: RealVectorSpace ds => ds -> ds -> dsLPFP LPFP.Mechanics1D No documentation available.
-
beam-postgres Database.Beam.Postgres Postgres || operator. Concatenates two vectors and returns their result.
(
+++ ) :: ReadP r a -> ReadP r a -> ReadP r acabal-install Distribution.Deprecated.ReadP Symmetric choice.
-
calligraphy Calligraphy.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 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]
(
+++ ) :: Ord a => [a] -> [a] -> [a]code-conjure Conjure.Utils No documentation available.
(
+++ ) :: (C shx, C shy, Storable a) => Vector shx a -> Vector shy a -> Vector (shx ::+ shy) acomfort-blas Numeric.BLAS.Vector Precedence and associativity (right) of (List.++). This also matches (::+).
forVector number_ $ \xs -> forVector number_ $ \ys -> forVector number_ $ \zs -> Vector.toList ((xs +++ ys) +++ zs) == Vector.toList (xs +++ (ys +++ zs))
(
+^ ) :: Compensable a => a -> Compensated a -> Compensated acompensated Numeric.Compensated Calculate a scalar + compensated sum with Kahan summation.