[[a]] -> [a] -base +bytestring

transpose :: [ByteString] -> [ByteString]
bytestring Data.ByteString, bytestring Data.ByteString.Char8, bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
The transpose function transposes the rows and columns of its ByteString argument.
concat :: [ByteString] -> ByteString
bytestring Data.ByteString, bytestring Data.ByteString.Char8, bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
O(n) Concatenate a list of ByteStrings.
fromChunks :: [ByteString] -> ByteString
bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
O(c) Convert a list of strict ByteString into a lazy ByteString
unlines :: [ByteString] -> ByteString
bytestring Data.ByteString.Char8, bytestring Data.ByteString.Lazy.Char8
unlines is an inverse operation to lines. It joins lines, after appending a terminating newline to each.
unwords :: [ByteString] -> ByteString
bytestring Data.ByteString.Char8, bytestring Data.ByteString.Lazy.Char8
The unwords function is analogous to the unlines function, on words.
primMapListFixed :: FixedPrim a -> ([a] -> Builder)
bytestring Data.ByteString.Builder.Prim
Encode a list of values from left-to-right with a FixedPrim.
primMapListBounded :: BoundedPrim a -> [a] -> Builder
bytestring Data.ByteString.Builder.Prim
Create a Builder that encodes a list of values consecutively using a BoundedPrim for each element. This function is more efficient than the canonical > filter p = > B.toLazyByteString . > E.encodeLazyByteStringWithF (E.ifF p E.word8) E.emptyF) > mconcat . map (primBounded w) or > foldMap (primBounded w) because it moves several variables out of the inner loop.
intercalate :: ByteString -> [ByteString] -> ByteString
bytestring Data.ByteString, bytestring Data.ByteString.Char8, bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
O(n) The intercalate function takes a ByteString and a list of ByteStrings and concatenates the list after interspersing the first argument between each element of the list.
(>$<) :: Contravariant f => (b -> a) -> f a -> f b
bytestring Data.ByteString.Builder.Prim
A fmap-like operator for builder primitives, both bounded and fixed size. Builder primitives are contravariant so it's like the normal fmap, but backwards (look at the type). (If it helps to remember, the operator symbol is like ($) but backwards.) We can use it for example to prepend and/or append fixed values to an primitive. > showEncoding ((\x -> ('\'', (x, '\''))) >$< fixed3) 'x' = "'x'" > > fixed3 = char7 >*< char7 >*< char7 Note that the rather verbose syntax for composition stems from the requirement to be able to compute the size / size bound at compile time.