git.iko.soy/text
on master help sign in
Tweak docs a little.
b69c074Bryan O'Sullivan
Data/Text.hs+8−8
compare with master
unifiedsplit
@@ -915,8 +915,8 @@ tails t | null t = [empty]
915-- > intercalate s . split s == id
915-- > intercalate s . split s == id
916-- > split (singleton c) == splitBy (==c)
916-- > split (singleton c) == splitBy (==c)
917--
917--
918−-- In (unlikely) bad cases, this function's time complexity
918+-- In (unlikely) bad cases, this function's time complexity degrades
919−-- degenerates towards /O(n*m)/.
919+-- towards /O(n*m)/.
920split :: Text -> Text -> [Text]
920split :: Text -> Text -> [Text]
921split pat@(Text _ _ l) src@(Text arr off len)
921split pat@(Text _ _ l) src@(Text arr off len)
922 | l <= 0 = emptyError "split"
922 | l <= 0 = emptyError "split"
@@ -1017,8 +1017,8 @@ filter p t = unstream (S.filter p (stream t))
1017-- want to break on every instance of a substring), use 'find'
1017-- want to break on every instance of a substring), use 'find'
1018-- instead, as it has lower startup overhead.
1018-- instead, as it has lower startup overhead.
1019--
1019--
1020−-- In (unlikely) bad cases, this function's time complexity
1020+-- In (unlikely) bad cases, this function's time complexity degrades
1021−-- degenerates towards /O(n*m)/.
1021+-- towards /O(n*m)/.
1022break :: Text -> Text -> (Text, Text)
1022break :: Text -> Text -> (Text, Text)
1023break pat src@(Text arr off len)
1023break pat src@(Text arr off len)
1024 | null pat = emptyError "break"
1024 | null pat = emptyError "break"
@@ -1091,8 +1091,8 @@ findIndex p t = S.findIndex p (stream t)
1091-- query string appears in the given 'Text'. An empty query string is
1091-- query string appears in the given 'Text'. An empty query string is
1092-- invalid, and will cause an error to be raised.
1092-- invalid, and will cause an error to be raised.
1093--
1093--
1094−-- In (unlikely) bad cases, this function's time complexity
1094+-- In (unlikely) bad cases, this function's time complexity degrades
1095−-- degenerates towards /O(n*m)/.
1095+-- towards /O(n*m)/.
1096count :: Text -> Text -> Int
1096count :: Text -> Text -> Int
1097count pat src
1097count pat src
1098 | null pat = emptyError "count"
1098 | null pat = emptyError "count"
@@ -1217,8 +1217,8 @@ isSuffixOf a@(Text _aarr _aoff alen) b@(Text barr boff blen) =
1217-- 'True' iff the first is contained, wholly and intact, anywhere
1217-- 'True' iff the first is contained, wholly and intact, anywhere
1218-- within the second.
1218-- within the second.
1219--
1219--
1220−-- In (unlikely) bad cases, this function's time complexity
1220+-- In (unlikely) bad cases, this function's time complexity degrades
1221−-- degenerates towards /O(n*m)/.
1221+-- towards /O(n*m)/.
1222isInfixOf :: Text -> Text -> Bool
1222isInfixOf :: Text -> Text -> Bool
1223isInfixOf pat src = null pat || (not . L.null $ indices pat src)
1223isInfixOf pat src = null pat || (not . L.null $ indices pat src)
1224{-# INLINE isInfixOf #-}
1224{-# INLINE isInfixOf #-}
Data/Text/Search.hs+4−2
@@ -39,8 +39,10 @@ import Data.Bits ((.|.), (.&.))
39import Data.Text.UnsafeShift (shiftL)
39import Data.Text.UnsafeShift (shiftL)
40
40
41-- | /O(n+m)/ Find the offsets of all non-overlapping indices of
41-- | /O(n+m)/ Find the offsets of all non-overlapping indices of
42−-- @needle@ within @haystack@. In (unlikely) bad cases, this
42+-- @needle@ within @haystack@.
43+--
43−-- algorithm's complexity degenerates towards /O(n*m)/.
44+-- In (unlikely) bad cases, this algorithm's complexity degrades
45+-- towards /O(n*m)/.
44indices :: Text -- ^ Substring to search for (@needle@)
46indices :: Text -- ^ Substring to search for (@needle@)
45 -> Text -- ^ Text to search in (@haystack@)
47 -> Text -- ^ Text to search in (@haystack@)
46 -> [Int]
48 -> [Int]