@@ -3,6 +3,9 @@
33#if __GLASGOW_HASKELL__ >= 702
44{-# LANGUAGE Trustworthy #-}
55#endif
6+#if __GLASGOW_HASKELL__ >= 708
7+{-# LANGUAGE TypeFamilies #-}
8+#endif
69
710-- |
811-- Module : Data.Text
@@ -29,8 +32,8 @@
2932--
3033-- To use an extended and very rich family of functions for working
3134-- with Unicode text (including normalization, regular expressions,
32−-- non-standard encodings, text breaking, and locales), see the
33−-- @text-icu@ package: <http://hackage.haskell.org/package/text-icu>
35+-- non-standard encodings, text breaking, and locales), see
36+-- <http://hackage.haskell.org/package/text-icu the text-icu package >.
3437
3538module Data.Text
3639 (
@@ -126,6 +129,7 @@ module Data.Text
126129 , drop
127130 , dropEnd
128131 , takeWhile
132+ , takeWhileEnd
129133 , dropWhile
130134 , dropWhileEnd
131135 , dropAround
@@ -188,15 +192,16 @@ module Data.Text
188192
189193 -- * Low level operations
190194 , copy
195+ , unpackCString#
191196 ) where
192197
193198import Prelude (Char, Bool(..), Int, Maybe(..), String,
194199 Eq(..), Ord(..), Ordering(..), (++),
195− Read(..), Show(..),
196− (&&), (||), (+), (-), (.), ($), ($!), (>>), (*),
197− maxBound, not, return, otherwise, quot)
200+ Read(..),
201+ (&&), (||), (+), (-), (.), ($), ($!), (>>),
202+ not, return, otherwise, quot)
198203#if defined(HAVE_DEEPSEQ)
199−import Control.DeepSeq (NFData)
204+import Control.DeepSeq (NFData(rnf))
200205#endif
201206#if defined(ASSERTS)
202207import Control.Exception (assert)
@@ -205,15 +210,22 @@ import Data.Char (isSpace)
205210import Data.Data (Data(gfoldl, toConstr, gunfold, dataTypeOf), constrIndex,
206211 Constr, mkConstr, DataType, mkDataType, Fixity(Prefix))
207212import Control.Monad (foldM)
213+import Control.Monad.ST (ST)
208214import qualified Data.Text.Array as A
209215import qualified Data.List as L
216+import Data.Binary (Binary(get, put))
210217import Data.Monoid (Monoid(..))
218+#if MIN_VERSION_base(4,9,0)
219+import Data.Semigroup (Semigroup(..))
220+#endif
211221import Data.String (IsString(..))
212222import qualified Data.Text.Internal.Fusion as S
213223import qualified Data.Text.Internal.Fusion.Common as S
224+import Data.Text.Encoding (decodeUtf8', encodeUtf8)
214225import Data.Text.Internal.Fusion (stream, reverseStream, unstream)
215226import Data.Text.Internal.Private (span_)
216−import Data.Text.Internal (Text(..), empty, firstf, safe, text)
227+import Data.Text.Internal (Text(..), empty, firstf, mul, safe, text)
228+import Data.Text.Show (singleton, unpack, unpackCString#)
217229import qualified Prelude as P
218230import Data.Text.Unsafe (Iter(..), iter, iter_, lengthWord16, reverseIter,
219231 reverseIter_, unsafeHead, unsafeTail)
@@ -226,12 +238,13 @@ import Data.ByteString (ByteString)
226238import qualified Data.Text.Lazy as L
227239import Data.Int (Int64)
228240#endif
229−#if __GLASGOW_HASKELL__ >= 702
230−import qualified GHC.CString as GHC
231−#else
232−import qualified GHC.Base as GHC
241+import GHC.Base (eqInt, neInt, gtInt, geInt, ltInt, leInt)
242+#if __GLASGOW_HASKELL__ >= 708
243+import qualified GHC.Exts as Exts
244+#endif
245+#if MIN_VERSION_base(4,7,0)
246+import Text.Printf (PrintfArg, formatArg, formatString)
233247#endif
234−import GHC.Prim (Addr#)
235248
236249-- $strict
237250--
@@ -241,29 +254,32 @@ import GHC.Prim (Addr#)
241254-- lazy @Text@ type consists of a list of strict chunks.
242255--
243256-- The strict 'Text' type requires that an entire string fit into
244−-- memory at once. The lazy @Text@ type is capable of streaming
245−-- strings that are larger than memory using a small memory footprint.
246−-- In many cases, the overhead of chunked streaming makes the lazy
247−-- @Text@ type slower than its strict counterpart, but this is not
248−-- always the case. Sometimes, the time complexity of a function in
249−-- one module may be different from the other, due to their differing
250−-- internal structures.
257+-- memory at once. The lazy 'Data.Text.Lazy.Text' type is capable of
258+-- streaming strings that are larger than memory using a small memory
259+-- footprint. In many cases, the overhead of chunked streaming makes
260+-- the lazy 'Data.Text.Lazy.Text' type slower than its strict
261+-- counterpart, but this is not always the case. Sometimes, the time
262+-- complexity of a function in one module may be different from the
263+-- other, due to their differing internal structures.
251264--
252265-- Each module provides an almost identical API, with the main
253266-- difference being that the strict module uses 'Int' values for
254−-- lengths and counts, while the lazy module uses 'Int64' lengths.
267+-- lengths and counts, while the lazy module uses 'Data.Int.Int64'
268+-- lengths.
255269
256270-- $replacement
257271--
258272-- A 'Text' value is a sequence of Unicode scalar values, as defined
259−-- in §3.9, definition D76 of the Unicode 5.2 standard:
260−-- <http://www.unicode.org/versions/Unicode5.2.0/ch03.pdf#page=35>. As
261−-- such, a 'Text' cannot contain values in the range U+D800 to U+DFFF
262−-- inclusive. Haskell implementations admit all Unicode code points
263−-- (§3.4, definition D10) as 'Char' values, including code points
264−-- from this invalid range. This means that there are some 'Char'
265−-- values that are not valid Unicode scalar values, and the functions
266−-- in this module must handle those cases.
273+-- in
274+-- <http://www.unicode.org/versions/Unicode5.2.0/ch03.pdf#page=35 §3.9, definition D76 of the Unicode 5.2 standard >.
275+-- As such, a 'Text' cannot contain values in the range U+D800 to
276+-- U+DFFF inclusive. Haskell implementations admit all Unicode code
277+-- points
278+-- (<http://www.unicode.org/versions/Unicode5.2.0/ch03.pdf#page=13 §3.4, definition D10 >)
279+-- as 'Char' values, including code points from this invalid range.
280+-- This means that there are some 'Char' values that are not valid
281+-- Unicode scalar values, and the functions in this module must handle
282+-- those cases.
267283--
268284-- Within this module, many functions construct a 'Text' from one or
269285-- more 'Char' values. Those functions will substitute 'Char' values
@@ -277,8 +293,8 @@ import GHC.Prim (Addr#)
277293-- range U+D800 through U+DFFF are used by UTF-16 to denote surrogate
278294-- code points, and so cannot be represented. The functions replace
279295-- invalid scalar values, instead of dropping them, as a security
280−-- measure. For details, see Unicode Technical Report 36, §3.5:
281−-- <http://unicode.org/reports/tr36/#Deletion_of_Noncharacters>)
296+-- measure. For details, see
297+-- <http://unicode.org/reports/tr36/#Deletion_of_Noncharacters Unicode Technical Report 36, §3.5 >.)
282298
283299-- $fusion
284300--
@@ -296,11 +312,11 @@ import GHC.Prim (Addr#)
296312-- > countChars = T.length . T.toUpper . E.decodeUtf8
297313--
298314-- From the type signatures involved, this looks like it should
299−-- allocate one 'ByteString' value, and two 'Text' values. However,
300−-- when a module is compiled with optimisation enabled under GHC, the
301−-- two intermediate 'Text' values will be optimised away, and the
302−-- function will be compiled down to a single loop over the source
303−-- 'ByteString'.
315+-- allocate one 'Data.ByteString.ByteString' value, and two 'Text'
316+-- values. However, when a module is compiled with optimisation
317+-- enabled under GHC, the two intermediate 'Text' values will be
318+-- optimised away, and the function will be compiled down to a single
319+-- loop over the source 'Data.ByteString.ByteString'.
304320--
305321-- Functions that can be fused by the compiler are documented with the
306322-- phrase \"Subject to fusion\".
@@ -314,38 +330,62 @@ instance Eq Text where
314330instance Ord Text where
315331 compare = compareText
316332
317−instance Show Text where
318− showsPrec p ps r = showsPrec p (unpack ps) r
319−
320333instance Read Text where
321334 readsPrec p str = [(pack x,y) | (x,y) <- readsPrec p str]
322335
336+#if MIN_VERSION_base(4,9,0)
337+-- Semigroup orphan instances for older GHCs are provided by
338+-- 'semigroups` package
339+
340+instance Semigroup Text where
341+ (<>) = append
342+#endif
343+
323344instance Monoid Text where
324345 mempty = empty
346+#if MIN_VERSION_base(4,9,0)
347+ mappend = (<>) -- future-proof definition
348+#else
325349 mappend = append
350+#endif
326351 mconcat = concat
327352
328353instance IsString Text where
329354 fromString = pack
330355
356+#if __GLASGOW_HASKELL__ >= 708
357+instance Exts.IsList Text where
358+ type Item Text = Char
359+ fromList = pack
360+ toList = unpack
361+#endif
362+
331363#if defined(HAVE_DEEPSEQ)
332−instance NFData Text
364+instance NFData Text where rnf !_ = ()
333365#endif
334366
367+instance Binary Text where
368+ put t = put (encodeUtf8 t)
369+ get = do
370+ bs <- get
371+ case decodeUtf8' bs of
372+ P.Left exn -> P.fail (P.show exn)
373+ P.Right a -> P.return a
374+
335375-- | This instance preserves data abstraction at the cost of inefficiency.
336376-- We omit reflection services for the sake of data abstraction.
337377--
338−-- This instance was created by copying the updated behavior of @Data.Set@ and
339−-- @Data.Map@. If you feel a mistake has been made, please feel free to
340−-- submit improvements.
341−--
342−-- Original discussion is archived here:
343−--
344−-- <http://groups.google.com/group/haskell-cafe/browse_thread/thread/b5bbb1b28a7e525d/0639d46852575b93 could we get a Data instance for Data.Text.Text?>
378+-- This instance was created by copying the updated behavior of
379+-- @"Data.Set".@'Data.Set.Set' and @"Data.Map".@'Data.Map.Map'. If you
380+-- feel a mistake has been made, please feel free to submit
381+-- improvements.
345382--
346−-- The followup discussion that changed the behavior of @Data.Set@ and @Data.Map@ is archived here
383+-- The original discussion is archived here:
384+-- <http://groups.google.com/group/haskell-cafe/browse_thread/thread/b5bbb1b28a7e525d/0639d46852575b93 could we get a Data instance for Data.Text.Text? >
347385--
348−-- <http://markmail.org/message/trovdc6zkphyi3cr#query:+page:1+mid:a46der3iacwjcf6n+state:results Proposal: Allow gunfold for Data.Map, ...>
386+-- The followup discussion that changed the behavior of 'Data.Set.Set'
387+-- and 'Data.Map.Map' is archived here:
388+-- <http://markmail.org/message/trovdc6zkphyi3cr#query:+page:1+mid:a46der3iacwjcf6n+state:results Proposal: Allow gunfold for Data.Map, ... >
349389
350390instance Data Text where
351391 gfoldl f z txt = z pack `f` (unpack txt)
@@ -355,6 +395,12 @@ instance Data Text where
355395 _ -> P.error "gunfold"
356396 dataTypeOf _ = textDataType
357397
398+#if MIN_VERSION_base(4,7,0)
399+-- | Only defined for @base-4.7.0.0@ and later
400+instance PrintfArg Text where
401+ formatArg txt = formatString $ unpack txt
402+#endif
403+
358404packConstr :: Constr
359405packConstr = mkConstr textDataType "pack" [] Prefix
360406
@@ -384,30 +430,6 @@ pack :: String -> Text
384430pack = unstream . S.map safe . S.streamList
385431{-# INLINE [1] pack #-}
386432
387−-- | /O(n)/ Convert a 'Text' into a 'String'. Subject to fusion.
388−unpack :: Text -> String
389−unpack = S.unstreamList . stream
390−{-# INLINE [1] unpack #-}
391−
392−-- | /O(n)/ Convert a literal string into a Text. Subject to fusion.
393−unpackCString# :: Addr# -> Text
394−unpackCString# addr# = unstream (S.streamCString# addr#)
395−{-# NOINLINE unpackCString# #-}
396−
397−{-# RULES "TEXT literal" forall a.
398− unstream (S.map safe (S.streamList (GHC.unpackCString# a)))
399− = unpackCString# a #-}
400−
401−{-# RULES "TEXT literal UTF8" forall a.
402− unstream (S.map safe (S.streamList (GHC.unpackCStringUtf8# a)))
403− = unpackCString# a #-}
404−
405−-- | /O(1)/ Convert a character into a Text. Subject to fusion.
406−-- Performs replacement on invalid scalar values.
407−singleton :: Char -> Text
408−singleton = unstream . S.singleton . safe
409−{-# INLINE [1] singleton #-}
410−
411433-- -----------------------------------------------------------------------------
412434-- * Basic functions
413435
@@ -438,6 +460,7 @@ append a@(Text arr1 off1 len1) b@(Text arr2 off2 len2)
438460 | otherwise = overflowError "append"
439461 where
440462 len = len1+len2
463+ x :: ST s (A.MArray s)
441464 x = do
442465 arr <- A.new len
443466 A.copyI arr 0 arr1 off1 len1
@@ -463,8 +486,8 @@ head t = S.head (stream t)
463486uncons :: Text -> Maybe (Char, Text)
464487uncons t@(Text arr off len)
465488 | len <= 0 = Nothing
466− | otherwise = Just (c, text arr (off+d) (len-d))
467− where Iter c d = iter t 0
489+ | otherwise = Just $ let !(Iter c d) = iter t 0
490+ in (c, text arr (off+d) (len-d))
468491{-# INLINE [1] uncons #-}
469492
470493-- | Lifted from Control.Arrow and specialized.
@@ -549,7 +572,9 @@ isSingleton = S.isSingleton . stream
549572-- Subject to fusion.
550573length :: Text -> Int
551574length t = S.length (stream t)
552−{-# INLINE length #-}
575+{-# INLINE [0] length #-}
576+-- length needs to be phased after the compareN/length rules otherwise
577+-- it may inline before the rules have an opportunity to fire.
553578
554579-- | /O(n)/ Compare the count of characters in a 'Text' to a number.
555580-- Subject to fusion.
@@ -568,32 +593,32 @@ compareLength t n = S.compareLengthI (stream t) n
568593
569594{-# RULES
570595"TEXT ==N/length -> compareLength/==EQ" [~1] forall t n.
571− (==) (length t) n = compareLength t n == EQ
596+ eqInt (length t) n = compareLength t n == EQ
572597 #-}
573598
574599{-# RULES
575600"TEXT /=N/length -> compareLength//=EQ" [~1] forall t n.
576− (/=) (length t) n = compareLength t n /= EQ
601+ neInt (length t) n = compareLength t n /= EQ
577602 #-}
578603
579604{-# RULES
580605"TEXT <N/length -> compareLength/==LT" [~1] forall t n.
581− (<) (length t) n = compareLength t n == LT
606+ ltInt (length t) n = compareLength t n == LT
582607 #-}
583608
584609{-# RULES
585610"TEXT <=N/length -> compareLength//=GT" [~1] forall t n.
586− (<=) (length t) n = compareLength t n /= GT
611+ leInt (length t) n = compareLength t n /= GT
587612 #-}
588613
589614{-# RULES
590615"TEXT >N/length -> compareLength/==GT" [~1] forall t n.
591− (>) (length t) n = compareLength t n == GT
616+ gtInt (length t) n = compareLength t n == GT
592617 #-}
593618
594619{-# RULES
595620"TEXT >=N/length -> compareLength//=LT" [~1] forall t n.
596− (>=) (length t) n = compareLength t n /= LT
621+ geInt (length t) n = compareLength t n /= LT
597622 #-}
598623
599624-- -----------------------------------------------------------------------------
@@ -624,22 +649,48 @@ reverse :: Text -> Text
624649reverse t = S.reverse (stream t)
625650{-# INLINE reverse #-}
626651
627−-- | /O(m+n)/ Replace every occurrence of one substring with another.
652+-- | /O(m+n)/ Replace every non-overlapping occurrence of @needle@ in
653+-- @haystack@ with @replacement@.
654+--
655+-- This function behaves as though it was defined as follows:
656+--
657+-- @
658+-- replace needle replacement haystack =
659+-- 'intercalate' replacement ('splitOn' needle haystack)
660+-- @
661+--
662+-- As this suggests, each occurrence is replaced exactly once. So if
663+-- @needle@ occurs in @replacement@, that occurrence will /not/ itself
664+-- be replaced recursively:
665+--
666+-- > replace "oo" "foo" "oo" == "foo"
667+--
668+-- In cases where several instances of @needle@ overlap, only the
669+-- first one will be replaced:
670+--
671+-- > replace "ofo" "bar" "ofofo" == "barfo"
628672--
629673-- In (unlikely) bad cases, this function's time complexity degrades
630674-- towards /O(n*m)/.
631−replace :: Text -> Text -> Text -> Text
675+replace :: Text
676+ -- ^ @needle@ to search for. If this string is empty, an
677+ -- error will occur.
678+ -> Text
679+ -- ^ @replacement@ to replace @needle@ with.
680+ -> Text
681+ -- ^ @haystack@ in which to search.
682+ -> Text
632683replace needle@(Text _ _ neeLen)
633684 (Text repArr repOff repLen)
634685 haystack@(Text hayArr hayOff hayLen)
635686 | neeLen == 0 = emptyError "replace"
636687 | L.null ixs = haystack
637688 | len > 0 = Text (A.run x) 0 len
638− | len < 0 = overflowError "replace"
639689 | otherwise = empty
640690 where
641691 ixs = indices needle haystack
642− len = hayLen - (neeLen - repLen) * L.length ixs
692+ len = hayLen - (neeLen - repLen) `mul` L.length ixs
693+ x :: ST s (A.MArray s)
643694 x = do
644695 marr <- A.new len
645696 let loop (i:is) o d = do
@@ -669,9 +720,8 @@ replace needle@(Text _ _ neeLen)
669720-- /Note/: In some languages, case conversion is a locale- and
670721-- context-dependent operation. The case conversion functions in this
671722-- module are /not/ locale sensitive. Programs that require locale
672−-- sensitivity should use appropriate versions of the case mapping
673−-- functions from the @text-icu@ package:
674−-- <http://hackage.haskell.org/package/text-icu>
723+-- sensitivity should use appropriate versions of the
724+-- <http://hackage.haskell.org/package/text-icu-0.6.3.7/docs/Data-Text-ICU.html#g:4 case mapping functions from the text-icu package >.
675725
676726-- | /O(n)/ Convert a string to folded case. Subject to fusion.
677727--
@@ -691,7 +741,7 @@ replace needle@(Text _ _ neeLen)
691741-- instead of itself.
692742toCaseFold :: Text -> Text
693743toCaseFold t = unstream (S.toCaseFold (stream t))
694−{-# INLINE [0] toCaseFold #-}
744+{-# INLINE toCaseFold #-}
695745
696746-- | /O(n)/ Convert a string to lower case, using simple case
697747-- conversion. Subject to fusion.
@@ -851,6 +901,7 @@ concat ts = case ts' of
851901 where
852902 ts' = L.filter (not . null) ts
853903 len = sumP "concat" $ L.map lengthWord16 ts'
904+ go :: ST s (A.MArray s)
854905 go = do
855906 arr <- A.new len
856907 let step i (Text a o l) =
@@ -864,13 +915,13 @@ concatMap f = concat . foldr ((:) . f) []
864915{-# INLINE concatMap #-}
865916
866917-- | /O(n)/ 'any' @p@ @t@ determines whether any character in the
867−-- 'Text' @t@ satisifes the predicate @p@. Subject to fusion.
918+-- 'Text' @t@ satisfies the predicate @p@. Subject to fusion.
868919any :: (Char -> Bool) -> Text -> Bool
869920any p t = S.any p (stream t)
870921{-# INLINE any #-}
871922
872923-- | /O(n)/ 'all' @p@ @t@ determines whether all characters in the
873−-- 'Text' @t@ satisify the predicate @p@. Subject to fusion.
924+-- 'Text' @t@ satisfy the predicate @p@. Subject to fusion.
874925all :: (Char -> Bool) -> Text -> Bool
875926all p t = S.all p (stream t)
876927{-# INLINE all #-}
@@ -961,10 +1012,10 @@ replicate n t@(Text a o l)
9611012 | n <= 0 || l <= 0 = empty
9621013 | n == 1 = t
9631014 | isSingleton t = replicateChar n (unsafeHead t)
964− | n <= maxBound `quot` l = Text (A.run x) 0 len
965− | otherwise = overflowError "replicate"
1015+ | otherwise = Text (A.run x) 0 len
9661016 where
967− len = l * n
1017+ len = l `mul` n
1018+ x :: ST s (A.MArray s)
9681019 x = do
9691020 arr <- A.new len
9701021 let loop !d !i | i >= n = return arr
@@ -1101,6 +1152,27 @@ takeWhile p t@(Text arr off len) = loop 0
11011152 unstream (S.takeWhile p (stream t)) = takeWhile p t
11021153 #-}
11031154
1155+-- | /O(n)/ 'takeWhileEnd', applied to a predicate @p@ and a 'Text',
1156+-- returns the longest suffix (possibly empty) of elements that
1157+-- satisfy @p@. Subject to fusion.
1158+-- Examples:
1159+--
1160+-- > takeWhileEnd (=='o') "foo" == "oo"
1161+takeWhileEnd :: (Char -> Bool) -> Text -> Text
1162+takeWhileEnd p t@(Text arr off len) = loop (len-1) len
1163+ where loop !i !l | l <= 0 = t
1164+ | p c = loop (i+d) (l+d)
1165+ | otherwise = text arr (off+l) (len-l)
1166+ where (c,d) = reverseIter t i
1167+{-# INLINE [1] takeWhileEnd #-}
1168+
1169+{-# RULES
1170+"TEXT takeWhileEnd -> fused" [~1] forall p t.
1171+ takeWhileEnd p t = S.reverse (S.takeWhile p (S.reverseStream t))
1172+"TEXT takeWhileEnd -> unfused" [1] forall p t.
1173+ S.reverse (S.takeWhile p (S.reverseStream t)) = takeWhileEnd p t
1174+ #-}
1175+
11041176-- | /O(n)/ 'dropWhile' @p@ @t@ returns the suffix remaining after
11051177-- 'takeWhile' @p@ @t@. Subject to fusion.
11061178dropWhile :: (Char -> Bool) -> Text -> Text
@@ -1119,8 +1191,9 @@ dropWhile p t@(Text arr off len) = loop 0 0
11191191 #-}
11201192
11211193-- | /O(n)/ 'dropWhileEnd' @p@ @t@ returns the prefix remaining after
1122−-- dropping characters that fail the predicate @p@ from the end of
1194+-- dropping characters that satisfy the predicate @p@ from the end of
11231195-- @t@. Subject to fusion.
1196+--
11241197-- Examples:
11251198--
11261199-- > dropWhileEnd (=='.') "foo..." == "foo"
@@ -1140,7 +1213,7 @@ dropWhileEnd p t@(Text arr off len) = loop (len-1) len
11401213 #-}
11411214
11421215-- | /O(n)/ 'dropAround' @p@ @t@ returns the substring remaining after
1143−-- dropping characters that fail the predicate @p@ from both the
1216+-- dropping characters that satisfy the predicate @p@ from both the
11441217-- beginning and end of @t@. Subject to fusion.
11451218dropAround :: (Char -> Bool) -> Text -> Text
11461219dropAround p = dropWhile p . dropWhileEnd p
@@ -1235,9 +1308,9 @@ tails t | null t = [empty]
12351308-- copies to create substrings; they just construct new 'Text's that
12361309-- are slices of the original.
12371310
1238−-- | /O(m+n)/ Break a 'Text' into pieces separated by the first
1239−-- 'Text' argument, consuming the delimiter. An empty delimiter is
1240−-- invalid, and will cause an error to be raised.
1311+-- | /O(m+n)/ Break a 'Text' into pieces separated by the first 'Text'
1312+-- argument (which cannot be empty), consuming the delimiter. An empty
1313+-- delimiter is invalid, and will cause an error to be raised.
12411314--
12421315-- Examples:
12431316--
@@ -1250,9 +1323,16 @@ tails t | null t = [empty]
12501323-- > intercalate s . splitOn s == id
12511324-- > splitOn (singleton c) == split (==c)
12521325--
1326+-- (Note: the string @s@ to split on above cannot be empty.)
1327+--
12531328-- In (unlikely) bad cases, this function's time complexity degrades
12541329-- towards /O(n*m)/.
1255−splitOn :: Text -> Text -> [Text]
1330+splitOn :: Text
1331+ -- ^ String to split on. If this string is empty, an error
1332+ -- will occur.
1333+ -> Text
1334+ -- ^ Input text.
1335+ -> [Text]
12561336splitOn pat@(Text _ _ l) src@(Text arr off len)
12571337 | l <= 0 = emptyError "splitOn"
12581338 | isSingleton pat = split (== unsafeHead pat) src
@@ -1460,7 +1540,7 @@ countChar c t = S.countChar c (stream t)
14601540-- equivalent to a pair of 'unpack' operations.
14611541zip :: Text -> Text -> [(Char,Char)]
14621542zip a b = S.unstreamList $ S.zipWith (,) (stream a) (stream b)
1463−{-# INLINE [0] zip #-}
1543+{-# INLINE zip #-}
14641544
14651545-- | /O(n)/ 'zipWith' generalises 'zip' by zipping with the function
14661546-- given as the first argument, instead of a tupling function.
@@ -1468,7 +1548,7 @@ zip a b = S.unstreamList $ S.zipWith (,) (stream a) (stream b)
14681548zipWith :: (Char -> Char -> Char) -> Text -> Text -> Text
14691549zipWith f t1 t2 = unstream (S.zipWith g (stream t1) (stream t2))
14701550 where g a b = safe (f a b)
1471−{-# INLINE [0] zipWith #-}
1551+{-# INLINE zipWith #-}
14721552
14731553-- | /O(n)/ Breaks a 'Text' up into a list of words, delimited by 'Char's
14741554-- representing white space.
@@ -1668,6 +1748,7 @@ overflowError fun = P.error $ "Data.Text." ++ fun ++ ": size overflow"
16681748copy :: Text -> Text
16691749copy (Text arr off len) = Text (A.run go) 0 len
16701750 where
1751+ go :: ST s (A.MArray s)
16711752 go = do
16721753 marr <- A.new len
16731754 A.copyI marr 0 arr off len