concat package:rio

concat :: [ByteString] -> ByteString
rio RIO.ByteString RIO.ByteString.Lazy
O(n) Concatenate a list of ByteStrings.
concat :: Foldable t => t [a] -> [a]
rio RIO.List RIO.Prelude
The concatenation of all the elements of a container of lists.
concat :: [Text] -> Text
rio RIO.Text RIO.Text.Lazy
O(n) Concatenate a list of Texts.
concat :: Vector v a => [v a] -> v a
rio RIO.Vector
O(n) Concatenate all vectors in the list
concat :: [Vector a] -> Vector a
rio RIO.Vector.Boxed
O(n) Concatenate all vectors in the list
concat :: Storable a => [Vector a] -> Vector a
rio RIO.Vector.Storable
O(n) Concatenate all vectors in the list
concat :: Unbox a => [Vector a] -> Vector a
rio RIO.Vector.Unboxed
O(n) Concatenate all vectors in the list
concatMap :: (Word8 -> ByteString) -> ByteString -> ByteString
rio RIO.ByteString RIO.ByteString.Lazy
Map a function over a ByteString and concatenate the results
concatMap :: Foldable t => (a -> [b]) -> t a -> [b]
rio RIO.List RIO.Prelude
Map a function over all the elements of a container and concatenate the resulting lists.
concatMap :: (Char -> Text) -> Text -> Text
rio RIO.Text RIO.Text.Lazy
O(n) Map a function over a Text that results in a Text, and concatenate the results.
concatMap :: (Vector v a, Vector v b) => (a -> v b) -> v a -> v b
rio RIO.Vector
Map a function over a vector and concatenate the results.
concatNE :: Vector v a => NonEmpty (v a) -> v a
rio RIO.Vector
O(n) Concatenate all vectors in the non-empty list
concatMap :: (a -> Vector b) -> Vector a -> Vector b
rio RIO.Vector.Boxed
Map a function over a vector and concatenate the results.
concatMap :: (Storable a, Storable b) => (a -> Vector b) -> Vector a -> Vector b
rio RIO.Vector.Storable
Map a function over a vector and concatenate the results.
concatMap :: (Unbox a, Unbox b) => (a -> Vector b) -> Vector a -> Vector b
rio RIO.Vector.Unboxed
Map a function over a vector and concatenate the results.
biconcat :: Bifoldable t => t [a] [a] -> [a]
rio RIO.Prelude
Reduces a structure of lists to the concatenation of those lists.
biconcatMap :: Bifoldable t => (a -> [c]) -> (b -> [c]) -> t a b -> [c]
rio RIO.Prelude
Given a means of mapping the elements of a structure to lists, computes the concatenation of all such lists in order.
mconcat :: Monoid a => [a] -> a
rio RIO.Prelude
Fold a list using the monoid. For most types, the default definition for mconcat will be used, but the function is included in the class definition so that an optimized version can be provided for specific types. 
>>> mconcat ["Hello", " ", "Haskell", "!"]
"Hello Haskell!"