++

(++) :: [a] -> [a] -> [a]
base Prelude, base Data.List
Append 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.
(+++) :: ReadP a -> ReadP a -> ReadP a
base Text.ParserCombinators.ReadP
Symmetric choice.
(+++) :: ReadPrec a -> ReadPrec a -> ReadPrec a
base Text.ParserCombinators.ReadPrec
Symmetric choice.
(+++) :: ArrowChoice a => a b c -> a b' c' -> a (Either b b') (Either c c')
base Control.Arrow
(+++) :: (HTML a, HTML b) => a -> b -> Html
html Text.Html
(+++) :: (HTML a, HTML b) => a -> b -> Html
xhtml Text.XHtml.Strict, xhtml Text.XHtml.Frameset, xhtml Text.XHtml.Transitional
Create a piece of HTML which is the concatenation of two things which can be made into HTML.
(<++) :: ReadP a -> ReadP a -> ReadP a
base Text.ParserCombinators.ReadP
Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used.
(<++) :: ReadPrec a -> ReadPrec a -> ReadPrec a
base Text.ParserCombinators.ReadPrec
Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used.