@@ -1,29 +1,48 @@
1−{-# LANGUAGE BangPatterns #-}
1+{-# LANGUAGE BangPatterns, CPP, MagicHash, Rank2Types, UnboxedTuples #-}
22{-# OPTIONS_GHC -fno-warn-orphans #-}
3+#if __GLASGOW_HASKELL__ >= 702
4+{-# LANGUAGE Trustworthy #-}
5+#endif
6+#if __GLASGOW_HASKELL__ >= 708
7+{-# LANGUAGE TypeFamilies #-}
8+#endif
39
410-- |
511-- Module : Data.Text
6−-- Copyright : (c) Tom Harper 2008-2009,
7−-- (c) Bryan O'Sullivan 2009,
8−-- (c) Duncan Coutts 2009
12+-- Copyright : (c) 2009, 2010, 2011, 2012 Bryan O'Sullivan,
13+-- (c) 2009 Duncan Coutts,
14+-- (c) 2008, 2009 Tom Harper
915--
1016-- License : BSD-style
11−-- Maintainer : bos@serpentine.com, rtharper@aftereternity.co.uk,
12−-- duncan@haskell.org
17+-- Maintainer : bos@serpentine.com
1318-- Stability : experimental
1419-- Portability : GHC
1520--
16−-- A time and space-efficient implementation of Unicode text using
17−-- packed Word16 arrays. Suitable for performance critical use, both
18−-- in terms of large data quantities and high speed.
21+-- A time and space-efficient implementation of Unicode text.
22+-- Suitable for performance critical use, both in terms of large data
23+-- quantities and high speed.
24+--
25+-- /Note/: Read below the synopsis for important notes on the use of
26+-- this module.
1927--
2028-- This module is intended to be imported @qualified@, to avoid name
2129-- clashes with "Prelude" functions, e.g.
2230--
2331-- > import qualified Data.Text as T
32+--
33+-- To use an extended and very rich family of functions for working
34+-- with Unicode text (including normalization, regular expressions,
35+-- non-standard encodings, text breaking, and locales), see
36+-- <http://hackage.haskell.org/package/text-icu the text-icu package >.
2437
2538module Data.Text
2639 (
40+ -- * Strict vs lazy types
41+ -- $strict
42+
43+ -- * Acceptable data
44+ -- $replacement
45+
2746 -- * Fusion
2847 -- $fusion
2948
@@ -47,6 +66,7 @@ module Data.Text
4766 , init
4867 , null
4968 , length
69+ , compareLength
5070
5171 -- * Transformations
5272 , map
@@ -61,6 +81,7 @@ module Data.Text
6181 , toCaseFold
6282 , toLower
6383 , toUpper
84+ , toTitle
6485
6586 -- ** Justification
6687 , justifyLeft
@@ -97,7 +118,6 @@ module Data.Text
97118
98119 -- ** Generation and unfolding
99120 , replicate
100− , replicateChar
101121 , unfoldr
102122 , unfoldrN
103123
@@ -105,8 +125,11 @@ module Data.Text
105125
106126 -- ** Breaking strings
107127 , take
128+ , takeEnd
108129 , drop
130+ , dropEnd
109131 , takeWhile
132+ , takeWhileEnd
110133 , dropWhile
111134 , dropWhileEnd
112135 , dropAround
@@ -114,8 +137,10 @@ module Data.Text
114137 , stripStart
115138 , stripEnd
116139 , splitAt
117− , span
140+ , breakOn
141+ , breakOnEnd
118142 , break
143+ , span
119144 , group
120145 , groupBy
121146 , inits
@@ -123,10 +148,8 @@ module Data.Text
123148
124149 -- ** Breaking into many substrings
125150 -- $split
151+ , splitOn
126152 , split
127− , splitTimes
128− , splitTimesEnd
129− , splitWith
130153 , chunksOf
131154
132155 -- ** Breaking into lines and words
@@ -141,132 +164,309 @@ module Data.Text
141164 , isSuffixOf
142165 , isInfixOf
143166
167+ -- ** View patterns
168+ , stripPrefix
169+ , stripSuffix
170+ , commonPrefixes
171+
144172 -- * Searching
145− , elem
146173 , filter
174+ , breakOnAll
147175 , find
148− , findBy
149176 , partition
150177
151178 -- , findSubstring
152−
179+
153180 -- * Indexing
154181 -- $index
155182 , index
156183 , findIndex
157184 , count
158185
159− -- * Zipping and unzipping
186+ -- * Zipping
160187 , zip
161188 , zipWith
162189
163190 -- -* Ordered text
164191 -- , sort
192+
193+ -- * Low level operations
194+ , copy
195+ , unpackCString#
165196 ) where
166197
167−import Prelude (Char, Bool(..), Functor(..), Int, Maybe(..), String,
168− Eq(..), Ord(..), (++),
169− Read(..), Show(..),
170− (&&), (||), (+), (-), (.), ($),
171− fromIntegral, div, not, return, otherwise)
198+import Prelude (Char, Bool(..), Int, Maybe(..), String,
199+ Eq(..), Ord(..), Ordering(..), (++),
200+ Read(..),
201+ (&&), (||), (+), (-), (.), ($), ($!), (>>),
202+ not, return, otherwise, quot)
203+#if defined(HAVE_DEEPSEQ)
204+import Control.DeepSeq (NFData(rnf))
205+#endif
206+#if defined(ASSERTS)
172207import Control.Exception (assert)
208+#endif
173209import Data.Char (isSpace)
210+import Data.Data (Data(gfoldl, toConstr, gunfold, dataTypeOf), constrIndex,
211+ Constr, mkConstr, DataType, mkDataType, Fixity(Prefix))
212+import Control.Monad (foldM)
174213import Control.Monad.ST (ST)
175214import qualified Data.Text.Array as A
176215import qualified Data.List as L
216+import Data.Binary (Binary(get, put))
177217import Data.Monoid (Monoid(..))
178−import Data.Word (Word16)
218+#if MIN_VERSION_base(4,9,0)
219+import Data.Semigroup (Semigroup(..))
220+#endif
179221import Data.String (IsString(..))
180−import qualified Data.Text.Fusion as S
181−import qualified Data.Text.Fusion.Common as S
182−import Data.Text.Fusion (stream, reverseStream, unstream)
183−import Data.Text.Internal (Text(..), empty, text, textP)
222+import qualified Data.Text.Internal.Fusion as S
223+import qualified Data.Text.Internal.Fusion.Common as S
224+import Data.Text.Encoding (decodeUtf8', encodeUtf8)
225+import Data.Text.Internal.Fusion (stream, reverseStream, unstream)
226+import Data.Text.Internal.Private (span_)
227+import Data.Text.Internal (Text(..), empty, firstf, mul, safe, text)
228+import Data.Text.Show (singleton, unpack, unpackCString#)
184229import qualified Prelude as P
185−import Data.Text.Unsafe (iter, iter_, reverseIter, unsafeHead, unsafeTail)
186−import Data.Text.UnsafeChar (unsafeChr)
187−import qualified Data.Text.Encoding.Utf16 as U16
188−import Data.Text.Search (indices)
230+import Data.Text.Unsafe (Iter(..), iter, iter_, lengthWord16, reverseIter,
231+ reverseIter_, unsafeHead, unsafeTail)
232+import Data.Text.Internal.Unsafe.Char (unsafeChr)
233+import qualified Data.Text.Internal.Functions as F
234+import qualified Data.Text.Internal.Encoding.Utf16 as U16
235+import Data.Text.Internal.Search (indices)
236+#if defined(__HADDOCK__)
237+import Data.ByteString (ByteString)
238+import qualified Data.Text.Lazy as L
239+import Data.Int (Int64)
240+#endif
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)
247+#endif
248+
249+-- $strict
250+--
251+-- This package provides both strict and lazy 'Text' types. The
252+-- strict type is provided by the "Data.Text" module, while the lazy
253+-- type is provided by the "Data.Text.Lazy" module. Internally, the
254+-- lazy @Text@ type consists of a list of strict chunks.
255+--
256+-- The strict 'Text' type requires that an entire string fit into
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.
264+--
265+-- Each module provides an almost identical API, with the main
266+-- difference being that the strict module uses 'Int' values for
267+-- lengths and counts, while the lazy module uses 'Data.Int.Int64'
268+-- lengths.
269+
270+-- $replacement
271+--
272+-- A 'Text' value is a sequence of Unicode scalar values, as defined
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.
283+--
284+-- Within this module, many functions construct a 'Text' from one or
285+-- more 'Char' values. Those functions will substitute 'Char' values
286+-- that are not valid Unicode scalar values with the replacement
287+-- character \"�\" (U+FFFD). Functions that perform this
288+-- inspection and replacement are documented with the phrase
289+-- \"Performs replacement on invalid scalar values\".
290+--
291+-- (One reason for this policy of replacement is that internally, a
292+-- 'Text' value is represented as packed UTF-16 data. Values in the
293+-- range U+D800 through U+DFFF are used by UTF-16 to denote surrogate
294+-- code points, and so cannot be represented. The functions replace
295+-- invalid scalar values, instead of dropping them, as a security
296+-- measure. For details, see
297+-- <http://unicode.org/reports/tr36/#Deletion_of_Noncharacters Unicode Technical Report 36, §3.5 >.)
189298
190299-- $fusion
191300--
192301-- Most of the functions in this module are subject to /fusion/,
193302-- meaning that a pipeline of such functions will usually allocate at
194303-- most one 'Text' value.
304+--
305+-- As an example, consider the following pipeline:
306+--
307+-- > import Data.Text as T
308+-- > import Data.Text.Encoding as E
309+-- > import Data.ByteString (ByteString)
310+-- >
311+-- > countChars :: ByteString -> Int
312+-- > countChars = T.length . T.toUpper . E.decodeUtf8
313+--
314+-- From the type signatures involved, this looks like it should
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'.
320+--
321+-- Functions that can be fused by the compiler are documented with the
322+-- phrase \"Subject to fusion\".
195323
196324instance Eq Text where
197− t1 == t2 = stream t1 == stream t2
325+ Text arrA offA lenA == Text arrB offB lenB
326+ | lenA == lenB = A.equal arrA offA arrB offB lenA
327+ | otherwise = False
198328 {-# INLINE (==) #-}
199329
200330instance Ord Text where
201− compare t1 t2 = compare (stream t1) (stream t2)
202− {-# INLINE compare #-}
203−
204−instance Show Text where
205− showsPrec p ps r = showsPrec p (unpack ps) r
331+ compare = compareText
206332
207333instance Read Text where
208334 readsPrec p str = [(pack x,y) | (x,y) <- readsPrec p str]
209335
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+
210344instance Monoid Text where
211345 mempty = empty
346+#if MIN_VERSION_base(4,9,0)
347+ mappend = (<>) -- future-proof definition
348+#else
212349 mappend = append
350+#endif
213351 mconcat = concat
214352
215353instance IsString Text where
216354 fromString = pack
217355
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+
363+#if defined(HAVE_DEEPSEQ)
364+instance NFData Text where rnf !_ = ()
365+#endif
366+
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+
375+-- | This instance preserves data abstraction at the cost of inefficiency.
376+-- We omit reflection services for the sake of data abstraction.
377+--
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.
382+--
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? >
385+--
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, ... >
389+
390+instance Data Text where
391+ gfoldl f z txt = z pack `f` (unpack txt)
392+ toConstr _ = packConstr
393+ gunfold k z c = case constrIndex c of
394+ 1 -> k (z pack)
395+ _ -> P.error "gunfold"
396+ dataTypeOf _ = textDataType
397+
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+
404+packConstr :: Constr
405+packConstr = mkConstr textDataType "pack" [] Prefix
406+
407+textDataType :: DataType
408+textDataType = mkDataType "Data.Text.Text" [packConstr]
409+
410+-- | /O(n)/ Compare two 'Text' values lexicographically.
411+compareText :: Text -> Text -> Ordering
412+compareText ta@(Text _arrA _offA lenA) tb@(Text _arrB _offB lenB)
413+ | lenA == 0 && lenB == 0 = EQ
414+ | otherwise = go 0 0
415+ where
416+ go !i !j
417+ | i >= lenA || j >= lenB = compare lenA lenB
418+ | a < b = LT
419+ | a > b = GT
420+ | otherwise = go (i+di) (j+dj)
421+ where Iter a di = iter ta i
422+ Iter b dj = iter tb j
423+
218424-- -----------------------------------------------------------------------------
219425-- * Conversion to/from 'Text'
220426
221−-- | /O(n)/ Convert a 'String' into a 'Text'. Subject to fusion.
427+-- | /O(n)/ Convert a 'String' into a 'Text'. Subject to
428+-- fusion. Performs replacement on invalid scalar values.
222429pack :: String -> Text
223−pack = unstream . S.streamList
430+pack = unstream . S.map safe . S.streamList
224431{-# INLINE [1] pack #-}
225432
226−-- | /O(n)/ Convert a Text into a String. Subject to fusion.
227−unpack :: Text -> String
228−unpack = S.unstreamList . stream
229−{-# INLINE [1] unpack #-}
230−
231−-- | /O(1)/ Convert a character into a Text.
232−-- Subject to fusion.
233−singleton :: Char -> Text
234−singleton = unstream . S.singleton
235−{-# INLINE [1] singleton #-}
236−
237433-- -----------------------------------------------------------------------------
238434-- * Basic functions
239435
240436-- | /O(n)/ Adds a character to the front of a 'Text'. This function
241437-- is more costly than its 'List' counterpart because it requires
242−-- copying a new array. Subject to fusion.
438+-- copying a new array. Subject to fusion. Performs replacement on
439+-- invalid scalar values.
243440cons :: Char -> Text -> Text
244−cons c t = unstream (S.cons c (stream t))
441+cons c t = unstream (S.cons (safe c) (stream t))
245442{-# INLINE cons #-}
246443
444+infixr 5 `cons`
445+
247446-- | /O(n)/ Adds a character to the end of a 'Text'. This copies the
248447-- entire array in the process, unless fused. Subject to fusion.
448+-- Performs replacement on invalid scalar values.
249449snoc :: Text -> Char -> Text
250−snoc t c = unstream (S.snoc (stream t) c)
450+snoc t c = unstream (S.snoc (stream t) (safe c))
251451{-# INLINE snoc #-}
252452
253453-- | /O(n)/ Appends one 'Text' to the other by copying both of them
254454-- into a new 'Text'. Subject to fusion.
255455append :: Text -> Text -> Text
256−append (Text arr1 off1 len1) (Text arr2 off2 len2) = Text (A.run x) 0 len
456+append a@(Text arr1 off1 len1) b@(Text arr2 off2 len2)
457+ | len1 == 0 = b
458+ | len2 == 0 = a
459+ | len > 0 = Text (A.run x) 0 len
460+ | otherwise = overflowError "append"
257461 where
258462 len = len1+len2
463+ x :: ST s (A.MArray s)
259464 x = do
260− arr <- A.unsafeNew len :: ST s (A.MArray s Word16)
261− copy arr1 off1 (len1+off1) arr 0
262− copy arr2 off2 (len2+off2) arr len1
465+ arr <- A.new len
466+ A.copyI arr 0 arr1 off1 len1
467+ A.copyI arr len1 arr2 off2 len
263468 return arr
264− where
265− copy arr i top arr' j
266− | i >= top = return ()
267− | otherwise = do A.unsafeWrite arr' j (arr `A.unsafeIndex` i)
268− copy arr (i+1) top arr' (j+1)
269−{-# INLINE append #-}
469+{-# NOINLINE append #-}
270470
271471{-# RULES
272472"TEXT append -> fused" [~1] forall t1 t2.
@@ -286,21 +486,14 @@ head t = S.head (stream t)
286486uncons :: Text -> Maybe (Char, Text)
287487uncons t@(Text arr off len)
288488 | len <= 0 = Nothing
289− | otherwise = Just (c, textP arr (off+d) (len-d))
290− where (c,d) = iter t 0
489+ | otherwise = Just $ let !(Iter c d) = iter t 0
490+ in (c, text arr (off+d) (len-d))
291491{-# INLINE [1] uncons #-}
292492
293493-- | Lifted from Control.Arrow and specialized.
294494second :: (b -> c) -> (a,b) -> (a,c)
295495second f (a, b) = (a, f b)
296496
297−{-# RULES
298−"TEXT uncons -> fused" [~1] forall t.
299− uncons t = fmap (second unstream) (S.uncons (stream t))
300−"TEXT uncons -> unfused" [1] forall t.
301− fmap (second unstream) (S.uncons (stream t)) = uncons t
302− #-}
303−
304497-- | /O(1)/ Returns the last character of a 'Text', which must be
305498-- non-empty. Subject to fusion.
306499last :: Text -> Char
@@ -324,7 +517,7 @@ last (Text arr off len)
324517tail :: Text -> Text
325518tail t@(Text arr off len)
326519 | len <= 0 = emptyError "tail"
327− | otherwise = textP arr (off+d) (len-d)
520+ | otherwise = text arr (off+d) (len-d)
328521 where d = iter_ t 0
329522{-# INLINE [1] tail #-}
330523
@@ -339,8 +532,8 @@ tail t@(Text arr off len)
339532-- be non-empty. Subject to fusion.
340533init :: Text -> Text
341534init (Text arr off len) | len <= 0 = emptyError "init"
342− | n >= 0xDC00 && n <= 0xDFFF = textP arr off (len-2)
343− | otherwise = textP arr off (len-1)
535+ | n >= 0xDC00 && n <= 0xDFFF = text arr off (len-2)
536+ | otherwise = text arr off (len-1)
344537 where
345538 n = A.unsafeIndex arr (off+len-1)
346539{-# INLINE [1] init #-}
@@ -355,7 +548,11 @@ init (Text arr off len) | len <= 0 = emptyError "init"
355548-- | /O(1)/ Tests whether a 'Text' is empty or not. Subject to
356549-- fusion.
357550null :: Text -> Bool
358−null (Text _arr _off len) = assert (len >= 0) $ len <= 0
551+null (Text _arr _off len) =
552+#if defined(ASSERTS)
553+ assert (len >= 0) $
554+#endif
555+ len <= 0
359556{-# INLINE [1] null #-}
360557
361558{-# RULES
@@ -375,27 +572,76 @@ isSingleton = S.isSingleton . stream
375572-- Subject to fusion.
376573length :: Text -> Int
377574length t = S.length (stream t)
378−{-# 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.
578+
579+-- | /O(n)/ Compare the count of characters in a 'Text' to a number.
580+-- Subject to fusion.
581+--
582+-- This function gives the same answer as comparing against the result
583+-- of 'length', but can short circuit if the count of characters is
584+-- greater than the number, and hence be more efficient.
585+compareLength :: Text -> Int -> Ordering
586+compareLength t n = S.compareLengthI (stream t) n
587+{-# INLINE [1] compareLength #-}
588+
589+{-# RULES
590+"TEXT compareN/length -> compareLength" [~1] forall t n.
591+ compare (length t) n = compareLength t n
592+ #-}
593+
594+{-# RULES
595+"TEXT ==N/length -> compareLength/==EQ" [~1] forall t n.
596+ eqInt (length t) n = compareLength t n == EQ
597+ #-}
598+
599+{-# RULES
600+"TEXT /=N/length -> compareLength//=EQ" [~1] forall t n.
601+ neInt (length t) n = compareLength t n /= EQ
602+ #-}
603+
604+{-# RULES
605+"TEXT <N/length -> compareLength/==LT" [~1] forall t n.
606+ ltInt (length t) n = compareLength t n == LT
607+ #-}
608+
609+{-# RULES
610+"TEXT <=N/length -> compareLength//=GT" [~1] forall t n.
611+ leInt (length t) n = compareLength t n /= GT
612+ #-}
613+
614+{-# RULES
615+"TEXT >N/length -> compareLength/==GT" [~1] forall t n.
616+ gtInt (length t) n = compareLength t n == GT
617+ #-}
618+
619+{-# RULES
620+"TEXT >=N/length -> compareLength//=LT" [~1] forall t n.
621+ geInt (length t) n = compareLength t n /= LT
622+ #-}
379623
380624-- -----------------------------------------------------------------------------
381625-- * Transformations
382626-- | /O(n)/ 'map' @f@ @t@ is the 'Text' obtained by applying @f@ to
383−-- each element of @t@. Subject to fusion.
627+-- each element of @t@. Subject to fusion. Performs replacement on
628+-- invalid scalar values.
384629map :: (Char -> Char) -> Text -> Text
385−map f t = unstream (S.map f (stream t))
630+map f t = unstream (S.map (safe . f) (stream t))
386631{-# INLINE [1] map #-}
387632
388633-- | /O(n)/ The 'intercalate' function takes a 'Text' and a list of
389634-- 'Text's and concatenates the list after interspersing the first
390635-- argument between each element of the list.
391636intercalate :: Text -> [Text] -> Text
392−intercalate t ts = unstream (S.intercalate (stream t) (L.map stream ts))
637+intercalate t = concat . (F.intersperse t)
393638{-# INLINE intercalate #-}
394639
395640-- | /O(n)/ The 'intersperse' function takes a character and places it
396−-- between the characters of a 'Text'. Subject to fusion.
641+-- between the characters of a 'Text'. Subject to fusion. Performs
642+-- replacement on invalid scalar values.
397643intersperse :: Char -> Text -> Text
398−intersperse c t = unstream (S.intersperse c (stream t))
644+intersperse c t = unstream (S.intersperse (safe c) (stream t))
399645{-# INLINE intersperse #-}
400646
401647-- | /O(n)/ Reverse the characters of a string. Subject to fusion.
@@ -403,13 +649,59 @@ reverse :: Text -> Text
403649reverse t = S.reverse (stream t)
404650{-# INLINE reverse #-}
405651
406−-- | /O(m*n)/ Replace every occurrence of one substring with another.
407−replace :: Text -- ^ Text to search for
408− -> Text -- ^ Replacement text
409− -> Text -- ^ Input text
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"
672+--
673+-- In (unlikely) bad cases, this function's time complexity degrades
674+-- towards /O(n*m)/.
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.
410680 -> Text
411−replace s d = intercalate d . split s
412−{-# INLINE replace #-}
681+ -- ^ @haystack@ in which to search.
682+ -> Text
683+replace needle@(Text _ _ neeLen)
684+ (Text repArr repOff repLen)
685+ haystack@(Text hayArr hayOff hayLen)
686+ | neeLen == 0 = emptyError "replace"
687+ | L.null ixs = haystack
688+ | len > 0 = Text (A.run x) 0 len
689+ | otherwise = empty
690+ where
691+ ixs = indices needle haystack
692+ len = hayLen - (neeLen - repLen) `mul` L.length ixs
693+ x :: ST s (A.MArray s)
694+ x = do
695+ marr <- A.new len
696+ let loop (i:is) o d = do
697+ let d0 = d + i - o
698+ d1 = d0 + repLen
699+ A.copyI marr d hayArr (hayOff+o) d0
700+ A.copyI marr d0 repArr repOff d1
701+ loop is (i + neeLen) d1
702+ loop [] o d = A.copyI marr d hayArr (hayOff+o) len
703+ loop ixs 0 0
704+ return marr
413705
414706-- ----------------------------------------------------------------------------
415707-- ** Case conversions (folds)
@@ -424,10 +716,17 @@ replace s d = intercalate d . split s
424716-- case conversion rules. As a result, these functions may map one
425717-- input character to two or three output characters. For examples,
426718-- see the documentation of each function.
719+--
720+-- /Note/: In some languages, case conversion is a locale- and
721+-- context-dependent operation. The case conversion functions in this
722+-- module are /not/ locale sensitive. Programs that require locale
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 >.
427725
428−-- | /O(n)/ Convert a string to folded case. This function is mainly
429−-- useful for performing caseless (also known as case insensitive)
430−-- string comparisons.
726+-- | /O(n)/ Convert a string to folded case. Subject to fusion.
727+--
728+-- This function is mainly useful for performing caseless (also known
729+-- as case insensitive) string comparisons.
431730--
432731-- A string @x@ is a caseless match for a string @y@ if and only if:
433732--
@@ -442,27 +741,56 @@ replace s d = intercalate d . split s
442741-- instead of itself.
443742toCaseFold :: Text -> Text
444743toCaseFold t = unstream (S.toCaseFold (stream t))
445−{-# INLINE [0] toCaseFold #-}
744+{-# INLINE toCaseFold #-}
446745
447746-- | /O(n)/ Convert a string to lower case, using simple case
448−-- conversion. The result string may be longer than the input string.
449−-- For instance, \"İ\" (Latin capital letter I with dot above,
450−-- U+0130) maps to the sequence \"i\" (Latin small letter i, U+0069) followed
451−-- by \" ̇\" (combining dot above, U+0307).
747+-- conversion. Subject to fusion.
748+--
749+-- The result string may be longer than the input string. For
750+-- instance, \"İ\" (Latin capital letter I with dot above,
751+-- U+0130) maps to the sequence \"i\" (Latin small letter i, U+0069)
752+-- followed by \" ̇\" (combining dot above, U+0307).
452753toLower :: Text -> Text
453754toLower t = unstream (S.toLower (stream t))
454755{-# INLINE toLower #-}
455756
456757-- | /O(n)/ Convert a string to upper case, using simple case
457−-- conversion. The result string may be longer than the input string.
458−-- For instance, the German \"ß\" (eszett, U+00DF) maps to the
758+-- conversion. Subject to fusion.
759+--
760+-- The result string may be longer than the input string. For
761+-- instance, the German \"ß\" (eszett, U+00DF) maps to the
459762-- two-letter sequence \"SS\".
460763toUpper :: Text -> Text
461764toUpper t = unstream (S.toUpper (stream t))
462765{-# INLINE toUpper #-}
463766
767+-- | /O(n)/ Convert a string to title case, using simple case
768+-- conversion. Subject to fusion.
769+--
770+-- The first letter of the input is converted to title case, as is
771+-- every subsequent letter that immediately follows a non-letter.
772+-- Every letter that immediately follows another letter is converted
773+-- to lower case.
774+--
775+-- The result string may be longer than the input string. For example,
776+-- the Latin small ligature fl (U+FB02) is converted to the
777+-- sequence Latin capital letter F (U+0046) followed by Latin small
778+-- letter l (U+006C).
779+--
780+-- /Note/: this function does not take language or culture specific
781+-- rules into account. For instance, in English, different style
782+-- guides disagree on whether the book name \"The Hill of the Red
783+-- Fox\" is correctly title cased—but this function will
784+-- capitalize /every/ word.
785+toTitle :: Text -> Text
786+toTitle t = unstream (S.toTitle (stream t))
787+{-# INLINE toTitle #-}
788+
464789-- | /O(n)/ Left-justify a string to the given length, using the
465−-- specified fill character on the right. Subject to fusion. Examples:
790+-- specified fill character on the right. Subject to fusion.
791+-- Performs replacement on invalid scalar values.
792+--
793+-- Examples:
466794--
467795-- > justifyLeft 7 'x' "foo" == "fooxxxx"
468796-- > justifyLeft 3 'x' "foobar" == "foobar"
@@ -481,7 +809,10 @@ justifyLeft k c t
481809 #-}
482810
483811-- | /O(n)/ Right-justify a string to the given length, using the
484−-- specified fill character on the left. Examples:
812+-- specified fill character on the left. Performs replacement on
813+-- invalid scalar values.
814+--
815+-- Examples:
485816--
486817-- > justifyRight 7 'x' "bar" == "xxxxbar"
487818-- > justifyRight 3 'x' "foobar" == "foobar"
@@ -492,8 +823,11 @@ justifyRight k c t
492823 where len = length t
493824{-# INLINE justifyRight #-}
494825
495−-- | /O(n)/ Center a string to the given length, using the
496−-- specified fill character on either side. Examples:
826+-- | /O(n)/ Center a string to the given length, using the specified
827+-- fill character on either side. Performs replacement on invalid
828+-- scalar values.
829+--
830+-- Examples:
497831--
498832-- > center 8 'x' "HS" = "xxxHSxxx"
499833center :: Int -> Char -> Text -> Text
@@ -502,7 +836,7 @@ center k c t
502836 | otherwise = replicateChar l c `append` t `append` replicateChar r c
503837 where len = length t
504838 d = k - len
505− r = d `div` 2
839+ r = d `quot` 2
506840 l = d - r
507841{-# INLINE center #-}
508842
@@ -520,12 +854,12 @@ transpose ts = P.map pack (L.transpose (P.map unpack ts))
520854-- (typically the left-identity of the operator), and a 'Text',
521855-- reduces the 'Text' using the binary operator, from left to right.
522856-- Subject to fusion.
523−foldl :: (b -> Char -> b) -> b -> Text -> b
857+foldl :: (a -> Char -> a) -> a -> Text -> a
524858foldl f z t = S.foldl f z (stream t)
525859{-# INLINE foldl #-}
526860
527861-- | /O(n)/ A strict version of 'foldl'. Subject to fusion.
528−foldl' :: (b -> Char -> b) -> b -> Text -> b
862+foldl' :: (a -> Char -> a) -> a -> Text -> a
529863foldl' f z t = S.foldl' f z (stream t)
530864{-# INLINE foldl' #-}
531865
@@ -544,12 +878,12 @@ foldl1' f t = S.foldl1' f (stream t)
544878-- (typically the right-identity of the operator), and a 'Text',
545879-- reduces the 'Text' using the binary operator, from right to left.
546880-- Subject to fusion.
547−foldr :: (Char -> b -> b) -> b -> Text -> b
881+foldr :: (Char -> a -> a) -> a -> Text -> a
548882foldr f z t = S.foldr f z (stream t)
549883{-# INLINE foldr #-}
550884
551885-- | /O(n)/ A variant of 'foldr' that has no starting value argument,
552−-- and thust must be applied to a non-empty 'Text'. Subject to
886+-- and thus must be applied to a non-empty 'Text'. Subject to
553887-- fusion.
554888foldr1 :: (Char -> Char -> Char) -> Text -> Char
555889foldr1 f t = S.foldr1 f (stream t)
@@ -558,28 +892,36 @@ foldr1 f t = S.foldr1 f (stream t)
558892-- -----------------------------------------------------------------------------
559893-- ** Special folds
560894
561−-- | /O(n)/ Concatenate a list of 'Text's. Subject to fusion.
895+-- | /O(n)/ Concatenate a list of 'Text's.
562896concat :: [Text] -> Text
563−concat ts = unstream (S.concat (L.map stream ts))
564−{-# INLINE concat #-}
897+concat ts = case ts' of
898+ [] -> empty
899+ [t] -> t
900+ _ -> Text (A.run go) 0 len
901+ where
902+ ts' = L.filter (not . null) ts
903+ len = sumP "concat" $ L.map lengthWord16 ts'
904+ go :: ST s (A.MArray s)
905+ go = do
906+ arr <- A.new len
907+ let step i (Text a o l) =
908+ let !j = i + l in A.copyI arr i a o j >> return j
909+ foldM step 0 ts' >> return arr
565910
566911-- | /O(n)/ Map a function over a 'Text' that results in a 'Text', and
567−-- concatenate the results. Subject to fusion.
568−--
569−-- Note: if in 'concatMap' @f@ @t@, @f@ is defined in terms of fusible
570−-- functions, it will also be fusible.
912+-- concatenate the results.
571913concatMap :: (Char -> Text) -> Text -> Text
572−concatMap f t = unstream (S.concatMap (stream . f) (stream t))
914+concatMap f = concat . foldr ((:) . f) []
573915{-# INLINE concatMap #-}
574916
575917-- | /O(n)/ 'any' @p@ @t@ determines whether any character in the
576−-- 'Text' @t@ satisifes the predicate @p@. Subject to fusion.
918+-- 'Text' @t@ satisfies the predicate @p@. Subject to fusion.
577919any :: (Char -> Bool) -> Text -> Bool
578920any p t = S.any p (stream t)
579921{-# INLINE any #-}
580922
581923-- | /O(n)/ 'all' @p@ @t@ determines whether all characters in the
582−-- 'Text' @t@ satisify the predicate @p@. Subject to fusion.
924+-- 'Text' @t@ satisfy the predicate @p@. Subject to fusion.
583925all :: (Char -> Bool) -> Text -> Bool
584926all p t = S.all p (stream t)
585927{-# INLINE all #-}
@@ -601,6 +943,7 @@ minimum t = S.minimum (stream t)
601943
602944-- | /O(n)/ 'scanl' is similar to 'foldl', but returns a list of
603945-- successive reduced values from the left. Subject to fusion.
946+-- Performs replacement on invalid scalar values.
604947--
605948-- > scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]
606949--
@@ -608,11 +951,13 @@ minimum t = S.minimum (stream t)
608951--
609952-- > last (scanl f z xs) == foldl f z xs.
610953scanl :: (Char -> Char -> Char) -> Char -> Text -> Text
611−scanl f z t = unstream (S.scanl f z (stream t))
954+scanl f z t = unstream (S.scanl g z (stream t))
955+ where g a b = safe (f a b)
612956{-# INLINE scanl #-}
613957
614958-- | /O(n)/ 'scanl1' is a variant of 'scanl' that has no starting
615−-- value argument. Subject to fusion.
959+-- value argument. Subject to fusion. Performs replacement on
960+-- invalid scalar values.
616961--
617962-- > scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]
618963scanl1 :: (Char -> Char -> Char) -> Text -> Text
@@ -620,48 +965,63 @@ scanl1 f t | null t = empty
620965 | otherwise = scanl f (unsafeHead t) (unsafeTail t)
621966{-# INLINE scanl1 #-}
622967
623−-- | /O(n)/ 'scanr' is the right-to-left dual of 'scanl'.
968+-- | /O(n)/ 'scanr' is the right-to-left dual of 'scanl'. Performs
969+-- replacement on invalid scalar values.
624970--
625971-- > scanr f v == reverse . scanl (flip f) v . reverse
626972scanr :: (Char -> Char -> Char) -> Char -> Text -> Text
627−scanr f z = S.reverse . S.reverseScanr f z . reverseStream
973+scanr f z = S.reverse . S.reverseScanr g z . reverseStream
974+ where g a b = safe (f a b)
628975{-# INLINE scanr #-}
629976
630977-- | /O(n)/ 'scanr1' is a variant of 'scanr' that has no starting
631−-- value argument. Subject to fusion.
978+-- value argument. Subject to fusion. Performs replacement on
979+-- invalid scalar values.
632980scanr1 :: (Char -> Char -> Char) -> Text -> Text
633981scanr1 f t | null t = empty
634982 | otherwise = scanr f (last t) (init t)
635983{-# INLINE scanr1 #-}
636984
637−-- | /O(n)/ Like a combination of 'map' and 'foldl'. Applies a
985+-- | /O(n)/ Like a combination of 'map' and 'foldl''. Applies a
638986-- function to each element of a 'Text', passing an accumulating
639−-- parameter from left to right, and returns a final 'Text'.
987+-- parameter from left to right, and returns a final 'Text'. Performs
988+-- replacement on invalid scalar values.
640989mapAccumL :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
641−mapAccumL f s t = case uncons t of
642− Nothing -> (s, empty)
643− Just (x, xs) -> (s'', cons y ys)
644− where (s', y ) = f s x
645− (s'',ys) = mapAccumL f s' xs
990+mapAccumL f z0 = S.mapAccumL g z0 . stream
991+ where g a b = second safe (f a b)
992+{-# INLINE mapAccumL #-}
646993
647994-- | The 'mapAccumR' function behaves like a combination of 'map' and
648−-- 'foldr'; it applies a function to each element of a 'Text', passing
649−-- an accumulating parameter from right to left, and returning a final
650−-- value of this accumulator together with the new 'Text'.
995+-- a strict 'foldr'; it applies a function to each element of a
996+-- 'Text', passing an accumulating parameter from right to left, and
997+-- returning a final value of this accumulator together with the new
998+-- 'Text'.
999+-- Performs replacement on invalid scalar values.
6511000mapAccumR :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
652−mapAccumR f s t = case uncons t of
653− Nothing -> (s, empty)
654− Just (x, xs) -> (s'', cons y ys)
655− where (s'',y ) = f s' x
656− (s', ys) = mapAccumR f s xs
1001+mapAccumR f z0 = second reverse . S.mapAccumL g z0 . reverseStream
1002+ where g a b = second safe (f a b)
1003+{-# INLINE mapAccumR #-}
6571004
6581005-- -----------------------------------------------------------------------------
6591006-- ** Generating and unfolding 'Text's
6601007
6611008-- | /O(n*m)/ 'replicate' @n@ @t@ is a 'Text' consisting of the input
662−-- @t@ repeated @n@ times. Subject to fusion.
1009+-- @t@ repeated @n@ times.
6631010replicate :: Int -> Text -> Text
664−replicate n t = unstream (S.replicateI (fromIntegral n) (S.stream t))
1011+replicate n t@(Text a o l)
1012+ | n <= 0 || l <= 0 = empty
1013+ | n == 1 = t
1014+ | isSingleton t = replicateChar n (unsafeHead t)
1015+ | otherwise = Text (A.run x) 0 len
1016+ where
1017+ len = l `mul` n
1018+ x :: ST s (A.MArray s)
1019+ x = do
1020+ arr <- A.new len
1021+ let loop !d !i | i >= n = return arr
1022+ | otherwise = let m = d + l
1023+ in A.copyI arr d a o m >> loop m (i+1)
1024+ loop 0 0
6651025{-# INLINE [1] replicate #-}
6661026
6671027{-# RULES
@@ -672,7 +1032,8 @@ replicate n t = unstream (S.replicateI (fromIntegral n) (S.stream t))
6721032-- | /O(n)/ 'replicateChar' @n@ @c@ is a 'Text' of length @n@ with @c@ the
6731033-- value of every element. Subject to fusion.
6741034replicateChar :: Int -> Char -> Text
675−replicateChar n c = unstream (S.replicateCharI n c)
1035+replicateChar n c = unstream (S.replicateCharI n (safe c))
1036+{-# INLINE replicateChar #-}
6761037
6771038-- | /O(n)/, where @n@ is the length of the result. The 'unfoldr'
6781039-- function is analogous to the List 'L.unfoldr'. 'unfoldr' builds a
@@ -680,9 +1041,9 @@ replicateChar n c = unstream (S.replicateCharI n c)
6801041-- returns 'Nothing' if it is done producing the 'Text', otherwise
6811042-- 'Just' @(a,b)@. In this case, @a@ is the next 'Char' in the
6821043-- string, and @b@ is the seed value for further production. Subject
683−-- to fusion.
1044+-- to fusion. Performs replacement on invalid scalar values.
6841045unfoldr :: (a -> Maybe (Char,a)) -> a -> Text
685−unfoldr f s = unstream (S.unfoldr f s)
1046+unfoldr f s = unstream (S.unfoldr (firstf safe . f) s)
6861047{-# INLINE unfoldr #-}
6871048
6881049-- | /O(n)/ Like 'unfoldr', 'unfoldrN' builds a 'Text' from a seed
@@ -690,9 +1051,9 @@ unfoldr f s = unstream (S.unfoldr f s)
6901051-- first argument to 'unfoldrN'. This function is more efficient than
6911052-- 'unfoldr' when the maximum length of the result is known and
6921053-- correct, otherwise its performance is similar to 'unfoldr'. Subject
693−-- to fusion.
1054+-- to fusion. Performs replacement on invalid scalar values.
6941055unfoldrN :: Int -> (a -> Maybe (Char,a)) -> a -> Text
695−unfoldrN n f s = unstream (S.unfoldrN n f s)
1056+unfoldrN n f s = unstream (S.unfoldrN n (firstf safe . f) s)
6961057{-# INLINE unfoldrN #-}
6971058
6981059-- -----------------------------------------------------------------------------
@@ -705,14 +1066,16 @@ take :: Int -> Text -> Text
7051066take n t@(Text arr off len)
7061067 | n <= 0 = empty
7071068 | n >= len = t
708− | otherwise = Text arr off (loop 0 0)
709− where
710− loop !i !cnt
711− | i >= len || cnt >= n = i
712− | otherwise = loop (i+d) (cnt+1)
713− where d = iter_ t i
1069+ | otherwise = text arr off (iterN n t)
7141070{-# INLINE [1] take #-}
7151071
1072+iterN :: Int -> Text -> Int
1073+iterN n t@(Text _arr _off len) = loop 0 0
1074+ where loop !i !cnt
1075+ | i >= len || cnt >= n = i
1076+ | otherwise = loop (i+d) (cnt+1)
1077+ where d = iter_ t i
1078+
7161079{-# RULES
7171080"TEXT take -> fused" [~1] forall n t.
7181081 take n t = unstream (S.take n (stream t))
@@ -720,18 +1083,36 @@ take n t@(Text arr off len)
7201083 unstream (S.take n (stream t)) = take n t
7211084 #-}
7221085
1086+-- | /O(n)/ 'takeEnd' @n@ @t@ returns the suffix remaining after
1087+-- taking @n@ characters from the end of @t@.
1088+--
1089+-- Examples:
1090+--
1091+-- > takeEnd 3 "foobar" == "bar"
1092+takeEnd :: Int -> Text -> Text
1093+takeEnd n t@(Text arr off len)
1094+ | n <= 0 = empty
1095+ | n >= len = t
1096+ | otherwise = text arr (off+i) (len-i)
1097+ where i = iterNEnd n t
1098+
1099+iterNEnd :: Int -> Text -> Int
1100+iterNEnd n t@(Text _arr _off len) = loop (len-1) n
1101+ where loop i !m
1102+ | i <= 0 = 0
1103+ | m <= 1 = i
1104+ | otherwise = loop (i+d) (m-1)
1105+ where d = reverseIter_ t i
1106+
7231107-- | /O(n)/ 'drop' @n@, applied to a 'Text', returns the suffix of the
724−-- 'Text' of length @n@, or the empty 'Text' if @n@ is greater than the
725−-- length of the 'Text'. Subject to fusion.
1108+-- 'Text' after the first @n@ characters, or the empty 'Text' if @n@
1109+-- is greater than the length of the 'Text'. Subject to fusion.
7261110drop :: Int -> Text -> Text
7271111drop n t@(Text arr off len)
7281112 | n <= 0 = t
7291113 | n >= len = empty
730− | otherwise = loop 0 0
731− where loop !i !cnt
732− | i >= len || cnt >= n = Text arr (off+i) (len-i)
733− | otherwise = loop (i+d) (cnt+1)
734− where d = iter_ t i
1114+ | otherwise = text arr (off+i) (len-i)
1115+ where i = iterN n t
7351116{-# INLINE [1] drop #-}
7361117
7371118{-# RULES
@@ -741,6 +1122,18 @@ drop n t@(Text arr off len)
7411122 unstream (S.drop n (stream t)) = drop n t
7421123 #-}
7431124
1125+-- | /O(n)/ 'dropEnd' @n@ @t@ returns the prefix remaining after
1126+-- dropping @n@ characters from the end of @t@.
1127+--
1128+-- Examples:
1129+--
1130+-- > dropEnd 3 "foobar" == "foo"
1131+dropEnd :: Int -> Text -> Text
1132+dropEnd n t@(Text arr off len)
1133+ | n <= 0 = t
1134+ | n >= len = empty
1135+ | otherwise = text arr off (iterNEnd n t)
1136+
7441137-- | /O(n)/ 'takeWhile', applied to a predicate @p@ and a 'Text',
7451138-- returns the longest prefix (possibly empty) of elements that
7461139-- satisfy @p@. Subject to fusion.
@@ -748,8 +1141,8 @@ takeWhile :: (Char -> Bool) -> Text -> Text
7481141takeWhile p t@(Text arr off len) = loop 0
7491142 where loop !i | i >= len = t
7501143 | p c = loop (i+d)
751− | otherwise = textP arr off i
752− where (c,d) = iter t i
1144+ | otherwise = text arr off i
1145+ where Iter c d = iter t i
7531146{-# INLINE [1] takeWhile #-}
7541147
7551148{-# RULES
@@ -759,6 +1152,27 @@ takeWhile p t@(Text arr off len) = loop 0
7591152 unstream (S.takeWhile p (stream t)) = takeWhile p t
7601153 #-}
7611154
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+
7621176-- | /O(n)/ 'dropWhile' @p@ @t@ returns the suffix remaining after
7631177-- 'takeWhile' @p@ @t@. Subject to fusion.
7641178dropWhile :: (Char -> Bool) -> Text -> Text
@@ -766,7 +1180,7 @@ dropWhile p t@(Text arr off len) = loop 0 0
7661180 where loop !i !l | l >= len = empty
7671181 | p c = loop (i+d) (l+d)
7681182 | otherwise = Text arr (off+i) (len-l)
769− where (c,d) = iter t i
1183+ where Iter c d = iter t i
7701184{-# INLINE [1] dropWhile #-}
7711185
7721186{-# RULES
@@ -777,8 +1191,9 @@ dropWhile p t@(Text arr off len) = loop 0 0
7771191 #-}
7781192
7791193-- | /O(n)/ 'dropWhileEnd' @p@ @t@ returns the prefix remaining after
780−-- dropping characters that fail the predicate @p@ from the end of
1194+-- dropping characters that satisfy the predicate @p@ from the end of
7811195-- @t@. Subject to fusion.
1196+--
7821197-- Examples:
7831198--
7841199-- > dropWhileEnd (=='.') "foo..." == "foo"
@@ -798,7 +1213,7 @@ dropWhileEnd p t@(Text arr off len) = loop (len-1) len
7981213 #-}
7991214
8001215-- | /O(n)/ 'dropAround' @p@ @t@ returns the substring remaining after
801−-- dropping characters that fail the predicate @p@ from both the
1216+-- dropping characters that satisfy the predicate @p@ from both the
8021217-- beginning and end of @t@. Subject to fusion.
8031218dropAround :: (Char -> Bool) -> Text -> Text
8041219dropAround p = dropWhile p . dropWhileEnd p
@@ -833,28 +1248,20 @@ splitAt :: Int -> Text -> (Text, Text)
8331248splitAt n t@(Text arr off len)
8341249 | n <= 0 = (empty, t)
8351250 | n >= len = (t, empty)
836− | otherwise = (Text arr off k, Text arr (off+k) (len-k))
837− where k = loop 0 0
838− loop !i !cnt
839− | i >= len || cnt >= n = i
840− | otherwise = loop (i+d) (cnt+1)
841− where d = iter_ t i
842−{-# INLINE splitAt #-}
1251+ | otherwise = let k = iterN n t
1252+ in (text arr off k, text arr (off+k) (len-k))
8431253
844−-- | /O(n)/ 'span', applied to a predicate @p@ and text @t@, returns a
845−-- pair whose first element is the longest prefix (possibly empty) of
846−-- @t@ of elements that satisfy @p@, and whose second is the remainder
847−-- of the list.
1254+-- | /O(n)/ 'span', applied to a predicate @p@ and text @t@, returns
1255+-- a pair whose first element is the longest prefix (possibly empty)
1256+-- of @t@ of elements that satisfy @p@, and whose second is the
1257+-- remainder of the list.
8481258span :: (Char -> Bool) -> Text -> (Text, Text)
849−span p t@(Text arr off len) = (textP arr off k, textP arr (off+k) (len-k))
850− where k = loop 0
851− loop !i | i >= len || not (p c) = i
852− | otherwise = loop (i+d)
853− where (c,d) = iter t i
1259+span p t = case span_ p t of
1260+ (# hd,tl #) -> (hd,tl)
8541261{-# INLINE span #-}
8551262
856−-- | /O(n)/ 'break' is like 'span', but the prefix returned is over
857−-- elements that fail the predicate @p@.
1263+-- | /O(n)/ 'break' is like 'span', but the prefix returned is
1264+-- over elements that fail the predicate @p@.
8581265break :: (Char -> Bool) -> Text -> (Text, Text)
8591266break p = span (not . p)
8601267{-# INLINE break #-}
@@ -866,7 +1273,7 @@ groupBy p = loop
8661273 loop t@(Text arr off len)
8671274 | null t = []
8681275 | otherwise = text arr off n : loop (text arr (off+n) (len-n))
869− where (c,d) = iter t 0
1276+ where Iter c d = iter t 0
8701277 n = d + findAIndexOrEnd (not . p c) (Text arr (off+d) (len-d))
8711278
8721279-- | Returns the /array/ index (in units of 'Word16') at which a
@@ -876,8 +1283,8 @@ findAIndexOrEnd :: (Char -> Bool) -> Text -> Int
8761283findAIndexOrEnd q t@(Text _arr _off len) = go 0
8771284 where go !i | i >= len || q c = i
8781285 | otherwise = go (i+d)
879− where (c,d) = iter t i
880−
1286+ where Iter c d = iter t i
1287+
8811288-- | /O(n)/ Group characters in a string by equality.
8821289group :: Text -> [Text]
8831290group = groupBy (==)
@@ -901,104 +1308,59 @@ tails t | null t = [empty]
9011308-- copies to create substrings; they just construct new 'Text's that
9021309-- are slices of the original.
9031310
904−-- | /O(m+n)/ Break a 'Text' into pieces separated by the first
905−-- 'Text' argument, consuming the delimiter. An empty delimiter is
906−-- 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.
9071314--
9081315-- Examples:
9091316--
910−-- > split "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
911−-- > split "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
912−-- > split "x" "x" == ["",""]
913−--
1317+-- > splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
1318+-- > splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
1319+-- > splitOn "x" "x" == ["",""]
1320+--
9141321-- and
9151322--
916−-- > intercalate s . split s == id
917−-- > split (singleton c) == splitWith (==c)
1323+-- > intercalate s . splitOn s == id
1324+-- > splitOn (singleton c) == split (==c)
1325+--
1326+-- (Note: the string @s@ to split on above cannot be empty.)
9181327--
919−-- In (unlikely) bad cases, this function's time complexity
920−-- degenerates towards /O(n*m)/.
921−split :: Text -> Text -> [Text]
922−split pat@(Text _ _ l) src@(Text arr off len)
923− | l <= 0 = emptyError "split"
924− | isSingleton pat = splitWith (== unsafeHead pat) src
1328+-- In (unlikely) bad cases, this function's time complexity degrades
1329+-- towards /O(n*m)/.
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]
1336+splitOn pat@(Text _ _ l) src@(Text arr off len)
1337+ | l <= 0 = emptyError "splitOn"
1338+ | isSingleton pat = split (== unsafeHead pat) src
9251339 | otherwise = go 0 (indices pat src)
9261340 where
927− go !s (x:xs) = textP arr (s+off) (x-s) : go (x+l) xs
928− go s _ = [textP arr (s+off) (len-s)]
929−{-# INLINE [1] split #-}
1341+ go !s (x:xs) = text arr (s+off) (x-s) : go (x+l) xs
1342+ go s _ = [text arr (s+off) (len-s)]
1343+{-# INLINE [1] splitOn #-}
9301344
9311345{-# RULES
932−"TEXT split/singleton -> splitWith/==" [~1] forall c t.
933− split (singleton c) t = splitWith (==c) t
1346+"TEXT splitOn/singleton -> split/==" [~1] forall c t.
1347+ splitOn (singleton c) t = split (==c) t
9341348 #-}
9351349
936−-- | /O(m+n)/ Break a 'Text' into pieces at most @k@ times,
937−-- treating the first 'Text' argument as the delimiter to break on,
938−-- and consuming the delimiter. The last element of the list contains
939−-- the remaining text after the number of times to split has been
940−-- reached. A value of zero or less for @k@ causes no splitting to
941−-- occur. An empty delimiter is invalid, and will cause an error to be
942−-- raised.
943−--
944−-- Examples:
945−--
946−-- > splitTimes 0 "//" "a//b//c" == ["a//b//c"]
947−-- > splitTimes 2 ":" "a:b:c:d:e" == ["a","b","c:d:e"]
948−-- > splitTimes 100 "???" "a????b" == ["a","?b"]
949−--
950−-- and
951−--
952−-- > intercalate s . splitTimes k s == id
953−--
954−-- In (unlikely) bad cases, this function's time complexity
955−-- degenerates towards /O(n*m)/.
956−splitTimes :: Int -- ^ Maximum number of times to split
957− -> Text -- ^ Text to split on
958− -> Text -- ^ Input text
959− -> [Text]
960−splitTimes k pat@(Text _ _ l) src@(Text arr off len)
961− | l <= 0 = emptyError "splitTimes"
962− | otherwise = go 0 0 (indices pat src)
963− where
964− go !s !i _ | i >= k = [textP arr (s+off) (len-s)]
965− go !s _ [] = [textP arr (s+off) (len-s)]
966− go !s !i (x:xs) = textP arr (s+off) (x-s) : go (x+l) (i+1) xs
967−{-# INLINE splitTimes #-}
968−
969−-- | /O(m+n)/ Break a 'Text' into pieces at most @k@ times, like
970−-- 'splitTimes', but start from the end of the input and work towards
971−-- the start.
972−--
973−-- Examples:
974−--
975−-- > splitTimes 2 "::" "a::b::c::d::e" == ["a","b","c::d::e"]
976−-- > splitTimesEnd 2 "::" "a::b::c::d::e" == ["a::b::c","d","e"]
977−--
978−-- In (unlikely) bad cases, this function's time complexity
979−-- degenerates towards /O(n*m)/.
980−splitTimesEnd :: Int -- ^ Maximum number of times to split
981− -> Text -- ^ Text to split on
982− -> Text -- ^ Input text
983− -> [Text]
984−splitTimesEnd k pat src =
985− L.reverse . L.map reverse $ splitTimes k (reverse pat) (reverse src)
986−{-# INLINE splitTimesEnd #-}
987−
9881350-- | /O(n)/ Splits a 'Text' into components delimited by separators,
9891351-- where the predicate returns True for a separator element. The
9901352-- resulting components do not contain the separators. Two adjacent
9911353-- separators result in an empty component in the output. eg.
9921354--
993−-- > splitWith (=='a') "aabbaca" == ["","","bb","c",""]
994−-- > splitWith (=='a') "" == [""]
995−splitWith :: (Char -> Bool) -> Text -> [Text]
996−splitWith _ t@(Text _off _arr 0) = [t]
997−splitWith p t = loop t
1355+-- > split (=='a') "aabbaca" == ["","","bb","c",""]
1356+-- > split (=='a') "" == [""]
1357+split :: (Char -> Bool) -> Text -> [Text]
1358+split _ t@(Text _off _arr 0) = [t]
1359+split p t = loop t
9981360 where loop s | null s' = [l]
9991361 | otherwise = l : loop (unsafeTail s')
1000− where (l, s') = break p s
1001−{-# INLINE splitWith #-}
1362+ where (# l, s' #) = span_ (not . p) s
1363+{-# INLINE split #-}
10021364
10031365-- | /O(n)/ Splits a 'Text' into components of length @k@. The last
10041366-- element may be shorter than the other chunks, depending on the
@@ -1017,23 +1379,15 @@ chunksOf k = go
10171379-- ----------------------------------------------------------------------------
10181380-- * Searching
10191381
1020−-------------------------------------------------------------------------------
1021−-- ** Searching by equality
1022−
1023−-- | /O(n)/ 'elem' is the 'Text' membership predicate.
1024−elem :: Char -> Text -> Bool
1025−elem c t = S.elem c (stream t)
1026−{-# INLINE elem #-}
1027−
10281382-------------------------------------------------------------------------------
10291383-- ** Searching with a predicate
10301384
1031−-- | /O(n)/ The 'findBy' function takes a predicate and a 'Text', and
1032−-- returns the first element in matching the predicate, or 'Nothing'
1033−-- if there is no such element.
1034−findBy :: (Char -> Bool) -> Text -> Maybe Char
1035−findBy p t = S.findBy p (stream t)
1036−{-# INLINE findBy #-}
1385+-- | /O(n)/ The 'find' function takes a predicate and a 'Text', and
1386+-- returns the first element matching the predicate, or 'Nothing' if
1387+-- there is no such element.
1388+find :: (Char -> Bool) -> Text -> Maybe Char
1389+find p t = S.findBy p (stream t)
1390+{-# INLINE find #-}
10371391
10381392-- | /O(n)/ The 'partition' function takes a predicate and a 'Text',
10391393-- and returns the pair of 'Text's with elements which do and do not
@@ -1051,36 +1405,76 @@ filter :: (Char -> Bool) -> Text -> Text
10511405filter p t = unstream (S.filter p (stream t))
10521406{-# INLINE filter #-}
10531407
1054−-- /O(n+m)/ Find all non-overlapping instances of @needle@ in
1055−-- @haystack@. The first element of the returned tuple is the prefix
1056−-- of @haystack@ before any matches of @needle@. The second element
1057−-- of the tuple is a list of non-overlapping substrings from
1058−-- @haystack@. Each begins with @needle@ and ends just before the
1059−-- following match. If @needle@ is not present in @haystack@, the
1060−-- list will be empty and the prefix will contain @haystack@.
1408+-- | /O(n+m)/ Find the first instance of @needle@ (which must be
1409+-- non-'null') in @haystack@. The first element of the returned tuple
1410+-- is the prefix of @haystack@ before @needle@ is matched. The second
1411+-- is the remainder of @haystack@, starting with the match.
10611412--
10621413-- Examples:
10631414--
1064−-- > find "::" "a::b::c" ==> ("a", ["::b", "::c"])
1065−-- > find "/" "foobar" ==> ("foobar", [])
1415+-- > breakOn "::" "a::b::c" ==> ("a", "::b::c")
1416+-- > breakOn "/" "foobar" ==> ("foobar", "")
10661417--
10671418-- Laws:
10681419--
1069−-- > concat (prefix : matches) == haystack
1070−-- > where (prefix, matches) = find needle haystack
1420+-- > append prefix match == haystack
1421+-- > where (prefix, match) = breakOn needle haystack
1422+--
1423+-- If you need to break a string by a substring repeatedly (e.g. you
1424+-- want to break on every instance of a substring), use 'breakOnAll'
1425+-- instead, as it has lower startup overhead.
10711426--
1072−-- In (unlikely) bad cases, this function's time complexity
1073−-- degenerates towards /O(n*m)/.
1074−find :: Text -> Text -> (Text, [Text])
1075−find pat src@(Text arr off len)
1076− | null pat = emptyError "find"
1427+-- In (unlikely) bad cases, this function's time complexity degrades
1428+-- towards /O(n*m)/.
1429+breakOn :: Text -> Text -> (Text, Text)
1430+breakOn pat src@(Text arr off len)
1431+ | null pat = emptyError "breakOn"
10771432 | otherwise = case indices pat src of
1078− [] -> (src, [])
1079− (x:xs) -> (textP arr off x, go x xs)
1433+ [] -> (src, empty)
1434+ (x:_) -> (text arr off x, text arr (off+x) (len-x))
1435+{-# INLINE breakOn #-}
1436+
1437+-- | /O(n+m)/ Similar to 'breakOn', but searches from the end of the
1438+-- string.
1439+--
1440+-- The first element of the returned tuple is the prefix of @haystack@
1441+-- up to and including the last match of @needle@. The second is the
1442+-- remainder of @haystack@, following the match.
1443+--
1444+-- > breakOnEnd "::" "a::b::c" ==> ("a::b::", "c")
1445+breakOnEnd :: Text -> Text -> (Text, Text)
1446+breakOnEnd pat src = (reverse b, reverse a)
1447+ where (a,b) = breakOn (reverse pat) (reverse src)
1448+{-# INLINE breakOnEnd #-}
1449+
1450+-- | /O(n+m)/ Find all non-overlapping instances of @needle@ in
1451+-- @haystack@. Each element of the returned list consists of a pair:
1452+--
1453+-- * The entire string prior to the /k/th match (i.e. the prefix)
1454+--
1455+-- * The /k/th match, followed by the remainder of the string
1456+--
1457+-- Examples:
1458+--
1459+-- > breakOnAll "::" ""
1460+-- > ==> []
1461+-- > breakOnAll "/" "a/b/c/"
1462+-- > ==> [("a", "/b/c/"), ("a/b", "/c/"), ("a/b/c", "/")]
1463+--
1464+-- In (unlikely) bad cases, this function's time complexity degrades
1465+-- towards /O(n*m)/.
1466+--
1467+-- The @needle@ parameter may not be empty.
1468+breakOnAll :: Text -- ^ @needle@ to search for
1469+ -> Text -- ^ @haystack@ in which to search
1470+ -> [(Text, Text)]
1471+breakOnAll pat src@(Text arr off slen)
1472+ | null pat = emptyError "breakOnAll"
1473+ | otherwise = L.map step (indices pat src)
10801474 where
1081− go !s (x:xs) = textP arr (s+off) (x-s) : go x xs
1082− go s _ = [textP arr (s+off) (len-s)]
1083−{-# INLINE find #-}
1475+ step x = (chunk 0 x, chunk x (slen-x))
1476+ chunk !n !l = text arr (n+off) l
1477+{-# INLINE breakOnAll #-}
10841478
10851479-------------------------------------------------------------------------------
10861480-- ** Indexing 'Text's
@@ -1099,8 +1493,7 @@ find pat src@(Text arr off len)
10991493-- For example, suppose you have a string that you want to split on
11001494-- the substring @\"::\"@, such as @\"foo::bar::quux\"@. Instead of
11011495-- searching for the index of @\"::\"@ and taking the substrings
1102−-- before and after that index, you would instead use @splitTimes 1
1103−-- "::"@.
1496+-- before and after that index, you would instead use @breakOnAll \"::\"@.
11041497
11051498-- | /O(n)/ 'Text' index (subscript) operator, starting from 0.
11061499index :: Text -> Int -> Char
@@ -1118,8 +1511,8 @@ findIndex p t = S.findIndex p (stream t)
11181511-- query string appears in the given 'Text'. An empty query string is
11191512-- invalid, and will cause an error to be raised.
11201513--
1121−-- In (unlikely) bad cases, this function's time complexity
1122−-- degenerates towards /O(n*m)/.
1514+-- In (unlikely) bad cases, this function's time complexity degrades
1515+-- towards /O(n*m)/.
11231516count :: Text -> Text -> Int
11241517count pat src
11251518 | null pat = emptyError "count"
@@ -1147,13 +1540,15 @@ countChar c t = S.countChar c (stream t)
11471540-- equivalent to a pair of 'unpack' operations.
11481541zip :: Text -> Text -> [(Char,Char)]
11491542zip a b = S.unstreamList $ S.zipWith (,) (stream a) (stream b)
1150−{-# INLINE [0] zip #-}
1543+{-# INLINE zip #-}
11511544
11521545-- | /O(n)/ 'zipWith' generalises 'zip' by zipping with the function
11531546-- given as the first argument, instead of a tupling function.
1547+-- Performs replacement on invalid scalar values.
11541548zipWith :: (Char -> Char -> Char) -> Text -> Text -> Text
1155−zipWith f t1 t2 = unstream (S.zipWith f (stream t1) (stream t2))
1156−{-# INLINE [0] zipWith #-}
1549+zipWith f t1 t2 = unstream (S.zipWith g (stream t1) (stream t2))
1550+ where g a b = safe (f a b)
1551+{-# INLINE zipWith #-}
11571552
11581553-- | /O(n)/ Breaks a 'Text' up into a list of words, delimited by 'Char's
11591554-- representing white space.
@@ -1169,7 +1564,7 @@ words t@(Text arr off len) = loop 0 0
11691564 then loop (start+1) (start+1)
11701565 else Text arr (start+off) (n-start) : loop (n+d) (n+d)
11711566 | otherwise = loop start (n+d)
1172− where (c,d) = iter t n
1567+ where Iter c d = iter t n
11731568{-# INLINE words #-}
11741569
11751570-- | /O(n)/ Breaks a 'Text' up into a list of 'Text's at
@@ -1179,9 +1574,10 @@ lines ps | null ps = []
11791574 | otherwise = h : if null t
11801575 then []
11811576 else lines (unsafeTail t)
1182− where (h,t) = span (/= '\n') ps
1577+ where (# h,t #) = span_ (/= '\n') ps
11831578{-# INLINE lines #-}
11841579
1580+{-
11851581-- | /O(n)/ Portably breaks a 'Text' up into a list of 'Text's at line
11861582-- boundaries.
11871583--
@@ -1189,7 +1585,6 @@ lines ps | null ps = []
11891585-- return immediately followed by a line feed, or a carriage return.
11901586-- This accounts for both Unix and Windows line ending conventions,
11911587-- and for the old convention used on Mac OS 9 and earlier.
1192−{-
11931588lines' :: Text -> [Text]
11941589lines' ps | null ps = []
11951590 | otherwise = h : case uncons t of
@@ -1216,8 +1611,7 @@ unwords = intercalate (singleton ' ')
12161611{-# INLINE unwords #-}
12171612
12181613-- | /O(n)/ The 'isPrefixOf' function takes two 'Text's and returns
1219−-- 'True' iff the first is a prefix of the second. This function is
1220−-- subject to fusion.
1614+-- 'True' iff the first is a prefix of the second. Subject to fusion.
12211615isPrefixOf :: Text -> Text -> Bool
12221616isPrefixOf a@(Text _ _ alen) b@(Text _ _ blen) =
12231617 alen <= blen && S.isPrefixOf (stream a) (stream b)
@@ -1226,8 +1620,6 @@ isPrefixOf a@(Text _ _ alen) b@(Text _ _ blen) =
12261620{-# RULES
12271621"TEXT isPrefixOf -> fused" [~1] forall s t.
12281622 isPrefixOf s t = S.isPrefixOf (stream s) (stream t)
1229−"TEXT isPrefixOf -> unfused" [1] forall s t.
1230− S.isPrefixOf (stream s) (stream t) = isPrefixOf s t
12311623 #-}
12321624
12331625-- | /O(n)/ The 'isSuffixOf' function takes two 'Text's and returns
@@ -1244,11 +1636,120 @@ isSuffixOf a@(Text _aarr _aoff alen) b@(Text barr boff blen) =
12441636-- 'True' iff the first is contained, wholly and intact, anywhere
12451637-- within the second.
12461638--
1247−-- In (unlikely) bad cases, this function's time complexity
1248−-- degenerates towards /O(n*m)/.
1639+-- In (unlikely) bad cases, this function's time complexity degrades
1640+-- towards /O(n*m)/.
12491641isInfixOf :: Text -> Text -> Bool
1250−isInfixOf pat src = null pat || (not . L.null $ indices pat src)
1251−{-# INLINE isInfixOf #-}
1642+isInfixOf needle haystack
1643+ | null needle = True
1644+ | isSingleton needle = S.elem (unsafeHead needle) . S.stream $ haystack
1645+ | otherwise = not . L.null . indices needle $ haystack
1646+{-# INLINE [1] isInfixOf #-}
1647+
1648+{-# RULES
1649+"TEXT isInfixOf/singleton -> S.elem/S.stream" [~1] forall n h.
1650+ isInfixOf (singleton n) h = S.elem n (S.stream h)
1651+ #-}
1652+
1653+-------------------------------------------------------------------------------
1654+-- * View patterns
1655+
1656+-- | /O(n)/ Return the suffix of the second string if its prefix
1657+-- matches the entire first string.
1658+--
1659+-- Examples:
1660+--
1661+-- > stripPrefix "foo" "foobar" == Just "bar"
1662+-- > stripPrefix "" "baz" == Just "baz"
1663+-- > stripPrefix "foo" "quux" == Nothing
1664+--
1665+-- This is particularly useful with the @ViewPatterns@ extension to
1666+-- GHC, as follows:
1667+--
1668+-- > {-# LANGUAGE ViewPatterns #-}
1669+-- > import Data.Text as T
1670+-- >
1671+-- > fnordLength :: Text -> Int
1672+-- > fnordLength (stripPrefix "fnord" -> Just suf) = T.length suf
1673+-- > fnordLength _ = -1
1674+stripPrefix :: Text -> Text -> Maybe Text
1675+stripPrefix p@(Text _arr _off plen) t@(Text arr off len)
1676+ | p `isPrefixOf` t = Just $! text arr (off+plen) (len-plen)
1677+ | otherwise = Nothing
1678+
1679+-- | /O(n)/ Find the longest non-empty common prefix of two strings
1680+-- and return it, along with the suffixes of each string at which they
1681+-- no longer match.
1682+--
1683+-- If the strings do not have a common prefix or either one is empty,
1684+-- this function returns 'Nothing'.
1685+--
1686+-- Examples:
1687+--
1688+-- > commonPrefixes "foobar" "fooquux" == Just ("foo","bar","quux")
1689+-- > commonPrefixes "veeble" "fetzer" == Nothing
1690+-- > commonPrefixes "" "baz" == Nothing
1691+commonPrefixes :: Text -> Text -> Maybe (Text,Text,Text)
1692+commonPrefixes t0@(Text arr0 off0 len0) t1@(Text arr1 off1 len1) = go 0 0
1693+ where
1694+ go !i !j | i < len0 && j < len1 && a == b = go (i+d0) (j+d1)
1695+ | i > 0 = Just (Text arr0 off0 i,
1696+ text arr0 (off0+i) (len0-i),
1697+ text arr1 (off1+j) (len1-j))
1698+ | otherwise = Nothing
1699+ where Iter a d0 = iter t0 i
1700+ Iter b d1 = iter t1 j
1701+
1702+-- | /O(n)/ Return the prefix of the second string if its suffix
1703+-- matches the entire first string.
1704+--
1705+-- Examples:
1706+--
1707+-- > stripSuffix "bar" "foobar" == Just "foo"
1708+-- > stripSuffix "" "baz" == Just "baz"
1709+-- > stripSuffix "foo" "quux" == Nothing
1710+--
1711+-- This is particularly useful with the @ViewPatterns@ extension to
1712+-- GHC, as follows:
1713+--
1714+-- > {-# LANGUAGE ViewPatterns #-}
1715+-- > import Data.Text as T
1716+-- >
1717+-- > quuxLength :: Text -> Int
1718+-- > quuxLength (stripSuffix "quux" -> Just pre) = T.length pre
1719+-- > quuxLength _ = -1
1720+stripSuffix :: Text -> Text -> Maybe Text
1721+stripSuffix p@(Text _arr _off plen) t@(Text arr off len)
1722+ | p `isSuffixOf` t = Just $! text arr off (len-plen)
1723+ | otherwise = Nothing
1724+
1725+-- | Add a list of non-negative numbers. Errors out on overflow.
1726+sumP :: String -> [Int] -> Int
1727+sumP fun = go 0
1728+ where go !a (x:xs)
1729+ | ax >= 0 = go ax xs
1730+ | otherwise = overflowError fun
1731+ where ax = a + x
1732+ go a _ = a
12521733
12531734emptyError :: String -> a
1254−emptyError fun = P.error ("Data.Text." ++ fun ++ ": empty input")
1735+emptyError fun = P.error $ "Data.Text." ++ fun ++ ": empty input"
1736+
1737+overflowError :: String -> a
1738+overflowError fun = P.error $ "Data.Text." ++ fun ++ ": size overflow"
1739+
1740+-- | /O(n)/ Make a distinct copy of the given string, sharing no
1741+-- storage with the original string.
1742+--
1743+-- As an example, suppose you read a large string, of which you need
1744+-- only a small portion. If you do not use 'copy', the entire original
1745+-- array will be kept alive in memory by the smaller string. Making a
1746+-- copy \"breaks the link\" to the original array, allowing it to be
1747+-- garbage collected if there are no other live references to it.
1748+copy :: Text -> Text
1749+copy (Text arr off len) = Text (A.run go) 0 len
1750+ where
1751+ go :: ST s (A.MArray s)
1752+ go = do
1753+ marr <- A.new len
1754+ A.copyI marr 0 arr off len
1755+ return marr