Int -> a -> [a] +text

chunksOf :: Int -> Text -> [Text]
text Data.Text
O(n) Splits a Text into components of length k. The last element may be shorter than the other chunks, depending on the length of the input. Examples: > chunksOf 3 "foobarbaz" == ["foo","bar","baz"] > chunksOf 4 "haskell.org" == ["hask","ell.","org"]
drop :: Int -> Text -> Text
text Data.Text
O(n) drop n, applied to a Text, returns the suffix of the Text after the first n characters, or the empty Text if n is greater than the length of the Text. Subject to fusion.
dropWord16 :: Int -> Text -> Text
text Data.Text.Unsafe
O(1) Unchecked drop of k Word16s from the front of a Text.
replicate :: Int -> Text -> Text
text Data.Text
O(n*m) replicate n t is a Text consisting of the input t repeated n times.
take :: Int -> Text -> Text
text Data.Text
O(n) take n, applied to a Text, returns the prefix of the Text of length n, or the Text itself if n is greater than the length of the Text. Subject to fusion.
takeWord16 :: Int -> Text -> Text
text Data.Text.Unsafe
O(1) Unchecked take of k Word16s from the front of a Text.
unfoldrN :: Int -> (a -> Maybe (Char, a)) -> a -> Text
text Data.Text
O(n) Like unfoldr, unfoldrN builds a Text from a seed value. However, the length of the result should be limited by the first argument to unfoldrN. This function is more efficient than unfoldr when the maximum length of the result is known and correct, otherwise its performance is similar to unfoldr. Subject to fusion. Performs replacement on invalid scalar values.
center :: Int -> Char -> Text -> Text
text Data.Text
O(n) Center a string to the given length, using the specified fill character on either side. Performs replacement on invalid scalar values. Examples: > center 8 'x' "HS" = "xxxHSxxx"
justifyLeft :: Int -> Char -> Text -> Text
text Data.Text
O(n) Left-justify a string to the given length, using the specified fill character on the right. Subject to fusion. Performs replacement on invalid scalar values. Examples: > justifyLeft 7 'x' "foo" == "fooxxxx" > justifyLeft 3 'x' "foobar" == "foobar"
justifyRight :: Int -> Char -> Text -> Text
text Data.Text
O(n) Right-justify a string to the given length, using the specified fill character on the left. Performs replacement on invalid scalar values. Examples: > justifyRight 7 'x' "bar" == "xxxxbar" > justifyRight 3 'x' "foobar" == "foobar"
foldlChunks :: (a -> Text -> a) -> a -> Text -> a
text Data.Text.Lazy.Internal, text Data.Text.Lazy
Consume the chunks of a lazy Text with a strict, tail-recursive, accumulating left fold.
foldl :: (a -> Char -> a) -> a -> Text -> a
text Data.Text, text Data.Text.Lazy
O(n) foldl, applied to a binary operator, a starting value (typically the left-identity of the operator), and a Text, reduces the Text using the binary operator, from left to right. Subject to fusion.
foldl' :: (a -> Char -> a) -> a -> Text -> a
text Data.Text, text Data.Text.Lazy
O(n) A strict version of foldl. Subject to fusion.
foldrChunks :: (Text -> a -> a) -> a -> Text -> a
text Data.Text.Lazy.Internal, text Data.Text.Lazy
Consume the chunks of a lazy Text with a natural right fold.
foldr :: (Char -> a -> a) -> a -> Text -> a
text Data.Text, text Data.Text.Lazy
O(n) foldr, applied to a binary operator, a starting value (typically the right-identity of the operator), and a Text, reduces the Text using the binary operator, from right to left. Subject to fusion.
formatRealFloat :: RealFloat a => FPFormat -> Maybe Int -> a -> Builder
text Data.Text.Lazy.Builder.RealFloat