Ord a => [a] -> [a] -base -text +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.
group :: ByteString -> [ByteString]
bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
The group function takes a ByteString and returns a list of ByteStrings such that the concatenation of the result is equal to the argument. Moreover, each sublist in the result contains only equal elements. For example, > group "Mississippi" = ["M","i","ss","i","ss","i","pp","i"] It is a special case of groupBy, which allows the programmer to supply their own equality test.
group :: ByteString -> [ByteString]
bytestring Data.ByteString, bytestring Data.ByteString.Char8
The group function takes a ByteString and returns a list of ByteStrings such that the concatenation of the result is equal to the argument. Moreover, each sublist in the result contains only equal elements. For example, > group "Mississippi" = ["M","i","ss","i","ss","i","pp","i"] It is a special case of groupBy, which allows the programmer to supply their own equality test. It is about 40% faster than groupBy (==)
inits :: ByteString -> [ByteString]
bytestring Data.ByteString, bytestring Data.ByteString.Char8, bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
O(n) Return all initial segments of the given ByteString, shortest first.
lines :: ByteString -> [ByteString]
bytestring Data.ByteString.Char8
lines breaks a ByteString up into a list of ByteStrings at newline Chars. The resulting strings do not contain newlines.
lines :: ByteString -> [ByteString]
bytestring Data.ByteString.Lazy.Char8
lines breaks a ByteString up into a list of ByteStrings at newline Chars. The resulting strings do not contain newlines. As of bytestring 0.9.0.3, this function is stricter than its list cousin.
tails :: ByteString -> [ByteString]
bytestring Data.ByteString, bytestring Data.ByteString.Char8, bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
O(n) Return all final segments of the given ByteString, longest first.
toChunks :: ByteString -> [ByteString]
bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
O(c) Convert a lazy ByteString into a list of strict ByteString
words :: ByteString -> [ByteString]
bytestring Data.ByteString.Char8
words breaks a ByteString up into a list of words, which were delimited by Chars representing white space.
words :: ByteString -> [ByteString]
bytestring Data.ByteString.Lazy.Char8
words breaks a ByteString up into a list of words, which were delimited by Chars representing white space. And > tokens isSpace = 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.
groupBy :: (Word8 -> Word8 -> Bool) -> ByteString -> [ByteString]
bytestring Data.ByteString, bytestring Data.ByteString.Lazy
The groupBy function is the non-overloaded version of group.
splitWith :: (Word8 -> Bool) -> ByteString -> [ByteString]
bytestring Data.ByteString, bytestring Data.ByteString.Lazy
O(n) Splits a ByteString into components delimited by separators, The resulting components do not contain the separators. Two adjacent separators result in an empty component in the output. eg. > splitWith (=='a') "aabbaca" == ["","","bb","c",""] > splitWith (=='a') [] == []
groupBy :: (Char -> Char -> Bool) -> ByteString -> [ByteString]
bytestring Data.ByteString.Char8, bytestring Data.ByteString.Lazy.Char8
The groupBy function is the non-overloaded version of group.

Show more results