Copyright	(c) Andrey Mulik 2020
License	BSD-style
Maintainer	work.a.mulik@gmail.com
Portability	non-portable (GHC extensions)
Safe Haskell	Safe
Language	Haskell2010

SDP.Text.Lazy

Contents

Exports
Lazy text
Orphan instances

Description

SDP.Text.Lazy provides sdp instances for lazy Text.

Synopsis

module System.IO.Classes
module SDP.IndexedM
type LText = Text
data Text
toCaseFold :: Text -> Text
toLower :: Text -> Text
toUpper :: Text -> Text
toTitle :: Text -> Text
fromChunks :: [Text] -> Text
toChunks :: Text -> [Text]
toStrict :: Text -> Text
fromStrict :: Text -> Text
foldrChunks :: (Text -> a -> a) -> a -> Text -> a
foldlChunks :: (a -> Text -> a) -> a -> Text -> a

Exports

module System.IO.Classes

module SDP.IndexedM

Lazy text

type LText = Text Source #

Text alias, may reduce ambiguity.

data Text #

Instances

Instances details

Nullable Text Source #
Instance details Defined in SDP.Text.Lazy Methods lzero :: Text # isNull :: Text -> Bool #
Estimate Text Source #
Instance details Defined in SDP.Text.Lazy Methods (<.=>) :: Text -> Int -> Ordering # (<==>) :: Compare Text # (.==) :: Text -> Int -> Bool # (./=) :: Text -> Int -> Bool # (.<=) :: Text -> Int -> Bool # (.>=) :: Text -> Int -> Bool # (.<) :: Text -> Int -> Bool # (.>) :: Text -> Int -> Bool # (.<.) :: Text -> Text -> Bool # (.>.) :: Text -> Text -> Bool # (.<=.) :: Text -> Text -> Bool # (.>=.) :: Text -> Text -> Bool # (.==.) :: Text -> Text -> Bool # (./=.) :: Text -> Text -> Bool #
IsFile Text Source #
Instance details Defined in SDP.Text.Lazy Methods hGetContents :: MonadIO io => Handle -> io Text # hPutContents :: MonadIO io => Handle -> Text -> io () #
IsTextFile Text Source #
Instance details Defined in SDP.Text.Lazy Methods hGetLine :: MonadIO io => Handle -> io Text # hPutStr :: MonadIO io => Handle -> Text -> io () # hPutStrLn :: MonadIO io => Handle -> Text -> io () #
Bordered Text Int Source #
Instance details Defined in SDP.Text.Lazy Methods bounds :: Text -> (Int, Int) # lower :: Text -> Int # upper :: Text -> Int # sizeOf :: Text -> Int # sizesOf :: Text -> [Int] # indexIn :: Text -> Int -> Bool # indices :: Text -> [Int] # indexOf :: Text -> Int -> Int # offsetOf :: Text -> Int -> Int #
Linear Text Char Source #
Instance details Defined in SDP.Text.Lazy Methods uncons :: Text -> (Char, Text) # uncons' :: Text -> Maybe (Char, Text) # toHead :: Char -> Text -> Text # head :: Text -> Char # tail :: Text -> Text # unsnoc :: Text -> (Text, Char) # unsnoc' :: Text -> Maybe (Text, Char) # toLast :: Text -> Char -> Text # init :: Text -> Text # last :: Text -> Char # single :: Char -> Text # (++) :: Text -> Text -> Text # replicate :: Int -> Char -> Text # fromList :: [Char] -> Text # fromListN :: Int -> [Char] -> Text # listR :: Text -> [Char] # listL :: Text -> [Char] # fromFoldable :: Foldable f => f Char -> Text # (!^) :: Text -> Int -> Char # write :: Text -> Int -> Char -> Text # concat :: Foldable f => f Text -> Text # concatMap :: Foldable f => (a -> Text) -> f a -> Text # intersperse :: Char -> Text -> Text # filter :: (Char -> Bool) -> Text -> Text # except :: (Char -> Bool) -> Text -> Text # partition :: (Char -> Bool) -> Text -> (Text, Text) # partitions :: Foldable f => f (Char -> Bool) -> Text -> [Text] # select :: (Char -> Maybe a) -> Text -> [a] # select' :: (t Char ~ Text, Linear1 t a) => (Char -> Maybe a) -> Text -> t a # extract :: (Char -> Maybe a) -> Text -> ([a], Text) # extract' :: (t Char ~ Text, Linear1 t a) => (Char -> Maybe a) -> Text -> (t a, Text) # selects :: Foldable f => f (Char -> Maybe a) -> Text -> ([[a]], Text) # selects' :: (Foldable f, t Char ~ Text, Linear1 t a) => f (Char -> Maybe a) -> Text -> ([t a], Text) # isSubseqOf :: Text -> Text -> Bool # reverse :: Text -> Text # force :: Text -> Text # subsequences :: Text -> [Text] # iterate :: Int -> (Char -> Char) -> Char -> Text # nub :: Text -> Text # nubBy :: Equal Char -> Text -> Text # ofoldr :: (Int -> Char -> b -> b) -> b -> Text -> b # ofoldl :: (Int -> b -> Char -> b) -> b -> Text -> b # ofoldr' :: (Int -> Char -> b -> b) -> b -> Text -> b # ofoldl' :: (Int -> b -> Char -> b) -> b -> Text -> b # o_foldr :: (Char -> b -> b) -> b -> Text -> b # o_foldl :: (b -> Char -> b) -> b -> Text -> b # o_foldr' :: (Char -> b -> b) -> b -> Text -> b # o_foldl' :: (b -> Char -> b) -> b -> Text -> b #
Split Text Char Source #
Instance details Defined in SDP.Text.Lazy Methods take :: Int -> Text -> Text # drop :: Int -> Text -> Text # keep :: Int -> Text -> Text # sans :: Int -> Text -> Text # save :: Int -> Text -> Text # skip :: Int -> Text -> Text # split :: Int -> Text -> (Text, Text) # divide :: Int -> Text -> (Text, Text) # splits :: Foldable f => f Int -> Text -> [Text] # divides :: Foldable f => f Int -> Text -> [Text] # parts :: Foldable f => f Int -> Text -> [Text] # chunks :: Int -> Text -> [Text] # splitBy :: (Char -> Bool) -> Text -> (Text, Text) # divideBy :: (Char -> Bool) -> Text -> (Text, Text) # splitsBy :: (Char -> Bool) -> Text -> [Text] # splitsOn :: Text -> Text -> [Text] # replaceBy :: Text -> Text -> Text -> Text # removeAll :: Text -> Text -> Text # combo :: Equal Char -> Text -> Int # justifyL :: Int -> Char -> Text -> Text # justifyR :: Int -> Char -> Text -> Text # each :: Int -> Text -> Text # eachFrom :: Int -> Int -> Text -> Text # isPrefixOf :: Text -> Text -> Bool # isSuffixOf :: Text -> Text -> Bool # isInfixOf :: Text -> Text -> Bool # prefix :: (Char -> Bool) -> Text -> Int # suffix :: (Char -> Bool) -> Text -> Int # infixes :: Text -> Text -> [Int] # dropSide :: (Char -> Bool) -> Text -> Text # takeWhile :: (Char -> Bool) -> Text -> Text # dropWhile :: (Char -> Bool) -> Text -> Text # takeEnd :: (Char -> Bool) -> Text -> Text # dropEnd :: (Char -> Bool) -> Text -> Text # spanl :: (Char -> Bool) -> Text -> (Text, Text) # breakl :: (Char -> Bool) -> Text -> (Text, Text) # spanr :: (Char -> Bool) -> Text -> (Text, Text) # breakr :: (Char -> Bool) -> Text -> (Text, Text) # selectWhile :: (Char -> Maybe a) -> Text -> [a] # selectEnd :: (Char -> Maybe a) -> Text -> [a] # extractWhile :: (Char -> Maybe a) -> Text -> ([a], Text) # extractEnd :: (Char -> Maybe a) -> Text -> (Text, [a]) # selectWhile' :: (t Char ~ l, Split1 t a) => (Char -> Maybe a) -> Text -> t a # selectEnd' :: (t Char ~ l, Split1 t a) => (Char -> Maybe a) -> Text -> t a # extractWhile' :: (t Char ~ l, Split1 t a) => (Char -> Maybe a) -> Text -> (t a, Text) # extractEnd' :: (t Char ~ l, Split1 t a) => (Char -> Maybe a) -> Text -> (Text, t a) #
Indexed Text Int Char Source #
Instance details Defined in SDP.Text.Lazy Methods assoc :: (Int, Int) -> [(Int, Char)] -> Text # assoc' :: (Int, Int) -> Char -> [(Int, Char)] -> Text # fromIndexed :: Indexed m j Char => m -> Text # write' :: Text -> Int -> Char -> Text # accum :: (Char -> e' -> Char) -> Text -> [(Int, e')] -> Text # imap :: Map m j Char => (Int, Int) -> m -> (Int -> j) -> Text # update' :: Text -> (Char -> Char) -> Int -> Text # updates' :: Text -> (Int -> Char -> Char) -> Text #
Map Text Int Char Source #
Instance details Defined in SDP.Text.Lazy Methods assocs :: Text -> [(Int, Char)] # toMap :: [(Int, Char)] -> Text # toMap' :: Char -> [(Int, Char)] -> Text # insert' :: Int -> Char -> Text -> Text # delete' :: Int -> Text -> Text # member' :: Int -> Text -> Bool # (//) :: Text -> [(Int, Char)] -> Text # (.!) :: Text -> Int -> Char # (!) :: Text -> Int -> Char # (!?) :: Text -> Int -> Maybe Char # filter' :: (Int -> Char -> Bool) -> Text -> Text # union' :: (Char -> Char -> Char) -> Text -> Text -> Text # difference' :: (Char -> Char -> Maybe Char) -> Text -> Text -> Text # intersection' :: (Char -> Char -> Char) -> Text -> Text -> Text # update :: Text -> (Int -> Char -> Char) -> Text # lookupLT' :: Int -> Text -> Maybe (Int, Char) # lookupGT' :: Int -> Text -> Maybe (Int, Char) # lookupLE' :: Int -> Text -> Maybe (Int, Char) # lookupGE' :: Int -> Text -> Maybe (Int, Char) # keys :: Text -> [Int] # (.$) :: (Char -> Bool) -> Text -> Maybe Int # (*$) :: (Char -> Bool) -> Text -> [Int] # kfoldr :: (Int -> Char -> b -> b) -> b -> Text -> b # kfoldl :: (Int -> b -> Char -> b) -> b -> Text -> b # kfoldr' :: (Int -> Char -> b -> b) -> b -> Text -> b # kfoldl' :: (Int -> b -> Char -> b) -> b -> Text -> b #
MonadIO io => Thaw io Text (MIOUblist io Char) Source #
Instance details Defined in SDP.Text.Lazy Methods thaw :: Text -> io (MIOUblist io Char) # unsafeThaw :: Text -> io (MIOUblist io Char) #
MonadIO io => Freeze io (MIOUblist io Char) Text Source #
Instance details Defined in SDP.Text.Lazy Methods freeze :: MIOUblist io Char -> io Text # unsafeFreeze :: MIOUblist io Char -> io Text #
Thaw (ST s) Text (STUblist s Char) Source #
Instance details Defined in SDP.Text.Lazy Methods thaw :: Text -> ST s (STUblist s Char) # unsafeThaw :: Text -> ST s (STUblist s Char) #
Freeze (ST s) (STUblist s Char) Text Source #
Instance details Defined in SDP.Text.Lazy Methods freeze :: STUblist s Char -> ST s Text # unsafeFreeze :: STUblist s Char -> ST s Text #
type Item Text
Instance details Defined in Data.Text.Lazy type Item Text = Char

toCaseFold :: Text -> Text #

O(n) Convert a string to folded case. Subject to fusion.

This function is mainly useful for performing caseless (or 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 bigram men now (U+0574 U+0576), while the micro sign (U+00B5) is case folded to the Greek small letter letter mu (U+03BC) instead of itself.

toLower :: Text -> Text #

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

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

toUpper :: Text -> Text #

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

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

toTitle :: Text -> Text #

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

The first letter 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.

The result string may be longer than the input string. For example, the Latin small ligature ﬂ (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.

Since: text-1.0.0.0

fromChunks :: [Text] -> Text #

O(c) Convert a list of strict Texts into a lazy Text.

toChunks :: Text -> [Text] #

O(n) Convert a lazy Text into a list of strict Texts.

toStrict :: Text -> Text #

O(n) Convert a lazy Text into a strict Text.

fromStrict :: Text -> Text #

O(c) Convert a strict Text into a lazy Text.

foldrChunks :: (Text -> a -> a) -> a -> Text -> a #

Consume the chunks of a lazy Text with a natural right fold.

foldlChunks :: (a -> Text -> a) -> a -> Text -> a #

Consume the chunks of a lazy Text with a strict, tail-recursive, accumulating left fold.

Orphan instances

Nullable Text Source #
Instance details Methods lzero :: Text # isNull :: Text -> Bool #
Estimate Text Source #
Instance details Methods (<.=>) :: Text -> Int -> Ordering # (<==>) :: Compare Text # (.==) :: Text -> Int -> Bool # (./=) :: Text -> Int -> Bool # (.<=) :: Text -> Int -> Bool # (.>=) :: Text -> Int -> Bool # (.<) :: Text -> Int -> Bool # (.>) :: Text -> Int -> Bool # (.<.) :: Text -> Text -> Bool # (.>.) :: Text -> Text -> Bool # (.<=.) :: Text -> Text -> Bool # (.>=.) :: Text -> Text -> Bool # (.==.) :: Text -> Text -> Bool # (./=.) :: Text -> Text -> Bool #
IsFile Text Source #
Instance details Methods hGetContents :: MonadIO io => Handle -> io Text # hPutContents :: MonadIO io => Handle -> Text -> io () #
IsTextFile Text Source #
Instance details Methods hGetLine :: MonadIO io => Handle -> io Text # hPutStr :: MonadIO io => Handle -> Text -> io () # hPutStrLn :: MonadIO io => Handle -> Text -> io () #
Bordered Text Int Source #
Instance details Methods bounds :: Text -> (Int, Int) # lower :: Text -> Int # upper :: Text -> Int # sizeOf :: Text -> Int # sizesOf :: Text -> [Int] # indexIn :: Text -> Int -> Bool # indices :: Text -> [Int] # indexOf :: Text -> Int -> Int # offsetOf :: Text -> Int -> Int #
Linear Text Char Source #
Instance details Methods uncons :: Text -> (Char, Text) # uncons' :: Text -> Maybe (Char, Text) # toHead :: Char -> Text -> Text # head :: Text -> Char # tail :: Text -> Text # unsnoc :: Text -> (Text, Char) # unsnoc' :: Text -> Maybe (Text, Char) # toLast :: Text -> Char -> Text # init :: Text -> Text # last :: Text -> Char # single :: Char -> Text # (++) :: Text -> Text -> Text # replicate :: Int -> Char -> Text # fromList :: [Char] -> Text # fromListN :: Int -> [Char] -> Text # listR :: Text -> [Char] # listL :: Text -> [Char] # fromFoldable :: Foldable f => f Char -> Text # (!^) :: Text -> Int -> Char # write :: Text -> Int -> Char -> Text # concat :: Foldable f => f Text -> Text # concatMap :: Foldable f => (a -> Text) -> f a -> Text # intersperse :: Char -> Text -> Text # filter :: (Char -> Bool) -> Text -> Text # except :: (Char -> Bool) -> Text -> Text # partition :: (Char -> Bool) -> Text -> (Text, Text) # partitions :: Foldable f => f (Char -> Bool) -> Text -> [Text] # select :: (Char -> Maybe a) -> Text -> [a] # select' :: (t Char ~ Text, Linear1 t a) => (Char -> Maybe a) -> Text -> t a # extract :: (Char -> Maybe a) -> Text -> ([a], Text) # extract' :: (t Char ~ Text, Linear1 t a) => (Char -> Maybe a) -> Text -> (t a, Text) # selects :: Foldable f => f (Char -> Maybe a) -> Text -> ([[a]], Text) # selects' :: (Foldable f, t Char ~ Text, Linear1 t a) => f (Char -> Maybe a) -> Text -> ([t a], Text) # isSubseqOf :: Text -> Text -> Bool # reverse :: Text -> Text # force :: Text -> Text # subsequences :: Text -> [Text] # iterate :: Int -> (Char -> Char) -> Char -> Text # nub :: Text -> Text # nubBy :: Equal Char -> Text -> Text # ofoldr :: (Int -> Char -> b -> b) -> b -> Text -> b # ofoldl :: (Int -> b -> Char -> b) -> b -> Text -> b # ofoldr' :: (Int -> Char -> b -> b) -> b -> Text -> b # ofoldl' :: (Int -> b -> Char -> b) -> b -> Text -> b # o_foldr :: (Char -> b -> b) -> b -> Text -> b # o_foldl :: (b -> Char -> b) -> b -> Text -> b # o_foldr' :: (Char -> b -> b) -> b -> Text -> b # o_foldl' :: (b -> Char -> b) -> b -> Text -> b #
Split Text Char Source #
Instance details Methods take :: Int -> Text -> Text # drop :: Int -> Text -> Text # keep :: Int -> Text -> Text # sans :: Int -> Text -> Text # save :: Int -> Text -> Text # skip :: Int -> Text -> Text # split :: Int -> Text -> (Text, Text) # divide :: Int -> Text -> (Text, Text) # splits :: Foldable f => f Int -> Text -> [Text] # divides :: Foldable f => f Int -> Text -> [Text] # parts :: Foldable f => f Int -> Text -> [Text] # chunks :: Int -> Text -> [Text] # splitBy :: (Char -> Bool) -> Text -> (Text, Text) # divideBy :: (Char -> Bool) -> Text -> (Text, Text) # splitsBy :: (Char -> Bool) -> Text -> [Text] # splitsOn :: Text -> Text -> [Text] # replaceBy :: Text -> Text -> Text -> Text # removeAll :: Text -> Text -> Text # combo :: Equal Char -> Text -> Int # justifyL :: Int -> Char -> Text -> Text # justifyR :: Int -> Char -> Text -> Text # each :: Int -> Text -> Text # eachFrom :: Int -> Int -> Text -> Text # isPrefixOf :: Text -> Text -> Bool # isSuffixOf :: Text -> Text -> Bool # isInfixOf :: Text -> Text -> Bool # prefix :: (Char -> Bool) -> Text -> Int # suffix :: (Char -> Bool) -> Text -> Int # infixes :: Text -> Text -> [Int] # dropSide :: (Char -> Bool) -> Text -> Text # takeWhile :: (Char -> Bool) -> Text -> Text # dropWhile :: (Char -> Bool) -> Text -> Text # takeEnd :: (Char -> Bool) -> Text -> Text # dropEnd :: (Char -> Bool) -> Text -> Text # spanl :: (Char -> Bool) -> Text -> (Text, Text) # breakl :: (Char -> Bool) -> Text -> (Text, Text) # spanr :: (Char -> Bool) -> Text -> (Text, Text) # breakr :: (Char -> Bool) -> Text -> (Text, Text) # selectWhile :: (Char -> Maybe a) -> Text -> [a] # selectEnd :: (Char -> Maybe a) -> Text -> [a] # extractWhile :: (Char -> Maybe a) -> Text -> ([a], Text) # extractEnd :: (Char -> Maybe a) -> Text -> (Text, [a]) # selectWhile' :: (t Char ~ l, Split1 t a) => (Char -> Maybe a) -> Text -> t a # selectEnd' :: (t Char ~ l, Split1 t a) => (Char -> Maybe a) -> Text -> t a # extractWhile' :: (t Char ~ l, Split1 t a) => (Char -> Maybe a) -> Text -> (t a, Text) # extractEnd' :: (t Char ~ l, Split1 t a) => (Char -> Maybe a) -> Text -> (Text, t a) #
Indexed Text Int Char Source #
Instance details Methods assoc :: (Int, Int) -> [(Int, Char)] -> Text # assoc' :: (Int, Int) -> Char -> [(Int, Char)] -> Text # fromIndexed :: Indexed m j Char => m -> Text # write' :: Text -> Int -> Char -> Text # accum :: (Char -> e' -> Char) -> Text -> [(Int, e')] -> Text # imap :: Map m j Char => (Int, Int) -> m -> (Int -> j) -> Text # update' :: Text -> (Char -> Char) -> Int -> Text # updates' :: Text -> (Int -> Char -> Char) -> Text #
Map Text Int Char Source #
Instance details Methods assocs :: Text -> [(Int, Char)] # toMap :: [(Int, Char)] -> Text # toMap' :: Char -> [(Int, Char)] -> Text # insert' :: Int -> Char -> Text -> Text # delete' :: Int -> Text -> Text # member' :: Int -> Text -> Bool # (//) :: Text -> [(Int, Char)] -> Text # (.!) :: Text -> Int -> Char # (!) :: Text -> Int -> Char # (!?) :: Text -> Int -> Maybe Char # filter' :: (Int -> Char -> Bool) -> Text -> Text # union' :: (Char -> Char -> Char) -> Text -> Text -> Text # difference' :: (Char -> Char -> Maybe Char) -> Text -> Text -> Text # intersection' :: (Char -> Char -> Char) -> Text -> Text -> Text # update :: Text -> (Int -> Char -> Char) -> Text # lookupLT' :: Int -> Text -> Maybe (Int, Char) # lookupGT' :: Int -> Text -> Maybe (Int, Char) # lookupLE' :: Int -> Text -> Maybe (Int, Char) # lookupGE' :: Int -> Text -> Maybe (Int, Char) # keys :: Text -> [Int] # (.$) :: (Char -> Bool) -> Text -> Maybe Int # (*$) :: (Char -> Bool) -> Text -> [Int] # kfoldr :: (Int -> Char -> b -> b) -> b -> Text -> b # kfoldl :: (Int -> b -> Char -> b) -> b -> Text -> b # kfoldr' :: (Int -> Char -> b -> b) -> b -> Text -> b # kfoldl' :: (Int -> b -> Char -> b) -> b -> Text -> b #
MonadIO io => Thaw io Text (MIOUblist io Char) Source #
Instance details Methods thaw :: Text -> io (MIOUblist io Char) # unsafeThaw :: Text -> io (MIOUblist io Char) #
MonadIO io => Freeze io (MIOUblist io Char) Text Source #
Instance details Methods freeze :: MIOUblist io Char -> io Text # unsafeFreeze :: MIOUblist io Char -> io Text #
Thaw (ST s) Text (STUblist s Char) Source #
Instance details Methods thaw :: Text -> ST s (STUblist s Char) # unsafeThaw :: Text -> ST s (STUblist s Char) #
Freeze (ST s) (STUblist s Char) Text Source #
Instance details Methods freeze :: STUblist s Char -> ST s Text # unsafeFreeze :: STUblist s Char -> ST s Text #