HORIZON HASKELLDocslts/ghc-9.10.x248f8f02026-10-05Search names, modules, packages, or :: a typeCtrl K

GHC 9.10.3 · lts/ghc-9.10.x · 248f8f0 · 2026-10-05

Modulerio-0.1.22.0Haskell2010

RIO.Text

Strict Text. Import as:

import qualified RIO.Text as T

This module does not export any partial functions. For those, see RIO.Text.Partial

  • 1 type
  • 86 values
  • Packagerio-0.1.22.0
  • Exports87
  • LanguageHaskell2010
  • LicenceMIT
  • SourceText.hs

Types

1 declaration
datadata Text
#

A space efficient, packed, unboxed Unicode text type.

Instances16IsList, Eq, Data, Ord, Read, Show, …
  • IsList TextDefined in text-2.1.3 · Data.Text · orphan

    Performs replacement on invalid scalar values:

    Example2 expressions
    :set -XOverloadedLists['\55555'] :: Text"\65533"
  • Eq TextDefined in text-2.1.3 · Data.Text · orphan
  • Data TextDefined in text-2.1.3 · Data.Text · orphan

    This instance preserves data abstraction at the cost of inefficiency. We omit reflection services for the sake of data abstraction.

    This instance was created by copying the updated behavior of Data.Set.Set and Data.Map.Data.Map.Map. If you feel a mistake has been made, please feel free to submit improvements.

    The original discussion is archived here: could we get a Data instance for Data.Text.Text?

    The followup discussion that changed the behavior of Set and Data.Map.Map is archived here: Proposal: Allow gunfold for Data.Map, ...

  • Ord TextDefined in text-2.1.3 · Data.Text · orphan
  • Read TextDefined in text-2.1.3 · Data.Text · orphan
  • Show TextDefined in text-2.1.3 · Data.Text.Show · orphan
  • IsString TextDefined in text-2.1.3 · Data.Text · orphan

    Performs replacement on invalid scalar values:

    Example2 expressions
    :set -XOverloadedStrings"\55555" :: Text"\65533"
  • Semigroup TextDefined in text-2.1.3 · Data.Text · orphan

    Beware: stimes will crash if the given number does not fit into an Int.

  • Monoid TextDefined in text-2.1.3 · Data.Text · orphan
  • PrintfArg TextDefined in text-2.1.3 · Data.Text · orphan
  • NFData TextDefined in text-2.1.3 · Data.Text · orphan
  • Binary TextDefined in text-2.1.3 · Data.Text · orphan
  • Hashable TextDefined in hashable-1.4.7.0 · Data.Hashable.Class
  • Display TextDefined in rio-0.1.22.0 · RIO.Prelude.Display
  • Lift TextDefined in text-2.1.3 · Data.Text · orphan
  • type Item Text = CharDefined in text-2.1.3 · Data.Text · orphan

Creation and elimination

4 declarations
valuepack :: String -> Text
#

O(n) Convert a String into a Text. Performs replacement on invalid scalar values, so unpack . pack is not id:

Example1 expression
Data.Text.unpack (pack "\55555")"\65533"
valuesingleton :: Char -> Text
#

O(1) Convert a character into a Text. Performs replacement on invalid scalar values.

Basic interface

7 declarations
valuecons :: Char -> Text -> Text
#

O(n) Adds a character to the front of a Text. This function is more costly than its List counterpart because it requires copying a new array. Performs replacement on invalid scalar values.

valuesnoc :: Text -> Char -> Text
#

O(n) Adds a character to the end of a Text. This copies the entire array in the process. Performs replacement on invalid scalar values.

valuecompareLength :: Text -> Int -> Ordering
#

O(min(n,c)) Compare the count of characters in a Text to a number.

compareLength t c = compare (length t) c

This function gives the same answer as comparing against the result of length, but can short circuit if the count of characters is greater than the number, and hence be more efficient.

Transformations

5 declarations
valuemap :: (Char -> Char) -> Text -> Text
#

O(n) map f t is the Text obtained by applying f to each element of t.

Example:

Example2 expressions
let message = pack "I am not angry. Not at all."T.map (\c -> if c == '.' then '!' else c) message"I am not angry! Not at all!"

Performs replacement on invalid scalar values.

valueintercalate :: Text -> [Text] -> Text
#

O(n) The intercalate function takes a Text and a list of Texts and concatenates the list after interspersing the first argument between each element of the list.

Example:

Example1 expression
T.intercalate "NI!" ["We", "seek", "the", "Holy", "Grail"]"WeNI!seekNI!theNI!HolyNI!Grail"
valueintersperse :: Char -> Text -> Text
#

O(n) The intersperse function takes a character and places it between the characters of a Text.

Example:

Example1 expression
T.intersperse '.' "SHIELD""S.H.I.E.L.D"

Performs replacement on invalid scalar values.

valuetranspose :: [Text] -> [Text]
#

O(n) The transpose function transposes the rows and columns of its Text argument. Note that this function uses pack, unpack, and the list version of transpose, and is thus not very efficient.

Examples:

Example1 expression
transpose ["green","orange"]["go","rr","ea","en","ng","e"]
Example1 expression
transpose ["blue","red"]["br","le","ud","e"]

Case conversion

valuetoCaseFold :: Text -> Text
#

O(n) Convert a string to folded case.

This function is mainly useful for performing caseless (also known as case insensitive) string comparisons.

A string x is a caseless match for a string y if and only if:

toCaseFold x == toCaseFold y

The result string may be longer than the input string, and may differ from applying toLower to the input string. For instance, the Armenian small ligature "ﬓ" (men now, U+FB13) is case folded to the sequence "մ" (men, U+0574) followed by "ն" (now, U+0576), while the Greek "µ" (micro sign, U+00B5) is case folded to "μ" (small letter mu, U+03BC) instead of itself.

valuetoLower :: Text -> Text
#

O(n) Convert a string to lower case, using simple case conversion.

The result string may be longer than the input string. For instance, "İ" (Latin capital letter I with dot above, U+0130) maps to the sequence "i" (Latin small letter i, U+0069) followed by " ̇" (combining dot above, U+0307).

valuetoUpper :: Text -> Text
#

O(n) Convert a string to upper case, using simple case conversion.

The result string may be longer than the input string. For instance, the German "ß" (eszett, U+00DF) maps to the two-letter sequence "SS".

valuetoTitle :: Text -> Text
#

O(n) Convert a string to title case, using simple case conversion.

The first letter (as determined by isLetter) of the input is converted to title case, as is every subsequent letter that immediately follows a non-letter. Every letter that immediately follows another letter is converted to lower case.

This function is not idempotent. Consider lower-case letter ʼn (U+0149 LATIN SMALL LETTER N PRECEDED BY APOSTROPHE). Then T.toTitle "ʼn" = "ʼN": the first (and the only) letter of the input is converted to title case, becoming two letters. Now ʼ (U+02BC MODIFIER LETTER APOSTROPHE) is a modifier letter and as such is recognised as a letter by isLetter, so T.toTitle "ʼN" = "'n".

The result string may be longer than the input string. For example, the Latin small ligature fl (U+FB02) is converted to the sequence Latin capital letter F (U+0046) followed by Latin small letter l (U+006C).

Note: this function does not take language or culture specific rules into account. For instance, in English, different style guides disagree on whether the book name "The Hill of the Red Fox" is correctly title cased—but this function will capitalize every word.

Justification

valuejustifyLeft :: Int -> Char -> Text -> Text
#

O(n) Left-justify a string to the given length, using the specified fill character on the right. Performs replacement on invalid scalar values.

Examples:

Example1 expression
justifyLeft 7 'x' "foo""fooxxxx"
Example1 expression
justifyLeft 3 'x' "foobar""foobar"
valuejustifyRight :: Int -> Char -> Text -> 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:

Example1 expression
justifyRight 7 'x' "bar""xxxxbar"
Example1 expression
justifyRight 3 'x' "foobar""foobar"
valuecenter :: Int -> Char -> Text -> 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:

Example1 expression
center 8 'x' "HS""xxxHSxxx"

Folds

3 declarations
valuefoldl :: (a -> Char -> a) -> a -> Text -> a
#

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.

valuefoldr :: (Char -> a -> a) -> a -> Text -> a
#

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.

If the binary operator is strict in its second argument, use foldr' instead.

foldr is lazy like foldr for lists: evaluation actually traverses the Text from left to right, only as far as it needs to.

For example, head can be defined with O(1) complexity using foldr:

head :: Text -> Char
head = foldr const (error "head empty")

Searches from left to right with short-circuiting behavior can also be defined using foldr (e.g., any, all, find, elem).

Special folds

Construction

0 declarations

Scans

valuescanl :: (Char -> Char -> Char) -> Char -> Text -> Text
#

O(n) scanl is similar to foldl, but returns a list of successive reduced values from the left. Performs replacement on invalid scalar values.

scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]

Properties

head (scanl f z xs) = z
last (scanl f z xs) = foldl f z xs
valuescanl1 :: (Char -> Char -> Char) -> Text -> Text
#

O(n) scanl1 is a variant of scanl that has no starting value argument. Performs replacement on invalid scalar values.

scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]
valuescanr :: (Char -> Char -> Char) -> Char -> Text -> Text
#

O(n) scanr is the right-to-left dual of scanl. Performs replacement on invalid scalar values.

scanr f v == reverse . scanl (flip f) v . reverse

Accumulating maps

valuemapAccumL :: (a -> Char -> (a, Char)) -> a -> Text -> (a, Text)
#

O(n) Like a combination of map and foldl'. Applies a function to each element of a Text, passing an accumulating parameter from left to right, and returns a final Text. Performs replacement on invalid scalar values.

valuemapAccumR :: (a -> Char -> (a, Char)) -> a -> Text -> (a, Text)
#

The mapAccumR function behaves like a combination of map and a strict foldr; it applies a function to each element of a Text, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new Text. Performs replacement on invalid scalar values.

Generation and unfolding

valueunfoldr :: (a -> Maybe (Char, a)) -> a -> Text
#

O(n), where n is the length of the result. The unfoldr function is analogous to the List unfoldr. unfoldr builds a Text from a seed value. The function takes the element and returns Nothing if it is done producing the Text, otherwise Just (a,b). In this case, a is the next Char in the string, and b is the seed value for further production. Performs replacement on invalid scalar values.

valueunfoldrN :: Int -> (a -> Maybe (Char, a)) -> a -> 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. Performs replacement on invalid scalar values.

Substrings

0 declarations

Breaking strings

valuetake :: Int -> Text -> 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.

valuetakeEnd :: Int -> Text -> Text
#

O(n) takeEnd n t returns the suffix remaining after taking n characters from the end of t.

Examples:

Example1 expression
takeEnd 3 "foobar""bar"
valuedrop :: Int -> Text -> 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.

valuedropEnd :: Int -> Text -> Text
#

O(n) dropEnd n t returns the prefix remaining after dropping n characters from the end of t.

Examples:

Example1 expression
dropEnd 3 "foobar""foo"
valuetakeWhileEnd :: (Char -> Bool) -> Text -> Text
#

O(n) takeWhileEnd, applied to a predicate p and a Text, returns the longest suffix (possibly empty) of elements that satisfy p. Examples:

Example1 expression
takeWhileEnd (=='o') "foo""oo"
valuedropWhileEnd :: (Char -> Bool) -> Text -> Text
#

O(n) dropWhileEnd p t returns the prefix remaining after dropping characters that satisfy the predicate p from the end of t.

Examples:

Example1 expression
dropWhileEnd (=='.') "foo...""foo"
valuedropAround :: (Char -> Bool) -> Text -> Text
#

O(n) dropAround p t returns the substring remaining after dropping characters that satisfy the predicate p from both the beginning and end of t.

valuestrip :: Text -> Text
#

O(n) Remove leading and trailing white space from a string. Equivalent to:

dropAround isSpace
valuestripStart :: Text -> Text
#

O(n) Remove leading white space from a string. Equivalent to:

dropWhile isSpace
valuestripEnd :: Text -> Text
#

O(n) Remove trailing white space from a string. Equivalent to:

dropWhileEnd isSpace
valuesplitAt :: Int -> Text -> (Text, Text)
#

O(n) splitAt n t returns a pair whose first element is a prefix of t of length n, and whose second is the remainder of the string. It is equivalent to (take n t, drop n t).

valuebreak :: (Char -> Bool) -> Text -> (Text, Text)
#

O(n) break is like span, but the prefix returned is over elements that fail the predicate p.

Example1 expression
T.break (=='c') "180cm"("180","cm")
valuespan :: (Char -> Bool) -> Text -> (Text, Text)
#

O(n) span, applied to a predicate p and text t, returns a pair whose first element is the longest prefix (possibly empty) of t of elements that satisfy p, and whose second is the remainder of the text.

Example1 expression
T.span (=='0') "000AB"("000","AB")
valuegroup :: Text -> [Text]
#

O(n) Group characters in a string by equality.

valueinits :: Text -> [Text]
#

O(n) Return all initial segments of the given Text, shortest first.

valuetails :: Text -> [Text]
#

O(n) Return all final segments of the given Text, longest first.

Breaking into many substrings

valuesplit :: (Char -> Bool) -> Text -> [Text]
#

O(n) Splits a Text into components delimited by separators, where the predicate returns True for a separator element. The resulting components do not contain the separators. Two adjacent separators result in an empty component in the output. eg.

Example1 expression
split (=='a') "aabbaca"["","","bb","c",""]
Example1 expression
split (=='a') ""[""]
valuechunksOf :: Int -> Text -> [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:

Example1 expression
chunksOf 3 "foobarbaz"["foo","bar","baz"]
Example1 expression
chunksOf 4 "haskell.org"["hask","ell.","org"]

Breaking into lines and words

valuelines :: Text -> [Text]
#

O(n) Breaks a Text up into a list of Texts at newline characters '\n' (LF, line feed). The resulting strings do not contain newlines.

lines does not treat '\r' (CR, carriage return) as a newline character.

valuelinesCR :: Text -> [Text]
#

linesCR breaks a Text up into a list of Texts at newline Chars. It is very similar to lines, but it also removes any trailing 'r' characters. The resulting Text values do not contain newlines or trailing 'r' characters.

valuewords :: Text -> [Text]
#

O(n) Breaks a Text up into a list of words, delimited by Chars representing white space.

valueunlines :: [Text] -> Text
#

O(n) Joins lines, after appending a terminating newline to each.

valueunwords :: [Text] -> Text
#

O(n) Joins words using single space characters.

Predicates

3 declarations
valueisInfixOf :: Text -> Text -> Bool
#

O(n+m) The isInfixOf function takes two Texts and returns True if and only if the first is contained, wholly and intact, anywhere within the second.

In (unlikely) bad cases, this function's time complexity degrades towards O(n*m).

View patterns

valuestripPrefix :: Text -> Text -> Maybe Text
#

O(n) Return the suffix of the second string if its prefix matches the entire first string.

Examples:

Example1 expression
stripPrefix "foo" "foobar"Just "bar"
Example1 expression
stripPrefix ""    "baz"Just "baz"
Example1 expression
stripPrefix "foo" "quux"Nothing

This is particularly useful with the ViewPatterns extension to GHC, as follows:

{-# LANGUAGE ViewPatterns #-}
import Data.Text as T

fnordLength :: Text -> Int
fnordLength (stripPrefix "fnord" -> Just suf) = T.length suf
fnordLength _                                 = -1
valuestripSuffix :: Text -> Text -> Maybe Text
#

O(n) Return the prefix of the second string if its suffix matches the entire first string.

Examples:

Example1 expression
stripSuffix "bar" "foobar"Just "foo"
Example1 expression
stripSuffix ""    "baz"Just "baz"
Example1 expression
stripSuffix "foo" "quux"Nothing

This is particularly useful with the ViewPatterns extension to GHC, as follows:

{-# LANGUAGE ViewPatterns #-}
import Data.Text as T

quuxLength :: Text -> Int
quuxLength (stripSuffix "quux" -> Just pre) = T.length pre
quuxLength _                                = -1
valuecommonPrefixes :: Text -> Text -> Maybe (Text, Text, Text)
#

O(n) Find the longest non-empty common prefix of two strings and return it, along with the suffixes of each string at which they no longer match.

If the strings do not have a common prefix or either one is empty, this function returns Nothing.

Examples:

Example1 expression
commonPrefixes "foobar" "fooquux"Just ("foo","bar","quux")
Example1 expression
commonPrefixes "veeble" "fetzer"Nothing
Example1 expression
commonPrefixes "" "baz"Nothing

Searching

3 declarations
valuepartition :: (Char -> Bool) -> Text -> (Text, Text)
#

O(n) The partition function takes a predicate and a Text, and returns the pair of Texts with elements which do and do not satisfy the predicate, respectively; i.e.

partition p t == (filter p t, filter (not . p) t)

Indexing

2 declarations

Zipping

2 declarations
valuezip :: Text -> Text -> [(Char, Char)]
#

O(n) zip takes two Texts and returns a list of corresponding pairs of bytes. If one input Text is short, excess elements of the longer Text are discarded. This is equivalent to a pair of unpack operations.

valuezipWith :: (Char -> Char -> Char) -> Text -> Text -> Text
#

O(n) zipWith generalises zip by zipping with the function given as the first argument, instead of a tupling function. Performs replacement on invalid scalar values.

Low level operations

2 declarations
valuecopy :: Text -> Text
#

O(n) Make a distinct copy of the given string, sharing no storage with the original string.

As an example, suppose you read a large string, of which you need only a small portion. If you do not use copy, the entire original array will be kept alive in memory by the smaller string. Making a copy "breaks the link" to the original array, allowing it to be garbage collected if there are no other live references to it.

valueunpackCString# :: Addr# -> Text
#

O(n) Convert a null-terminated modified UTF-8 (but with a standard UTF-8 representation of characters from supplementary planes) string to a Text. Counterpart to unpackCStringUtf8#. No validation is performed, malformed input can lead to memory access violation.

Encoding

4 declarations