@@ -6,7 +6,7 @@
6#if __GLASGOW_HASKELL__ >= 708
6#if __GLASGOW_HASKELL__ >= 708
7{-# LANGUAGE TypeFamilies #-}
7{-# LANGUAGE TypeFamilies #-}
9−{-# LANGUAGE ForeignFunctionInterface, JavaScriptFFI #-}
9+
11-- Module : Data.Text
11-- Module : Data.Text
12-- Copyright : (c) 2009, 2010, 2011, 2012 Bryan O'Sullivan,
12-- Copyright : (c) 2009, 2010, 2011, 2012 Bryan O'Sullivan,
@@ -223,16 +223,16 @@ import qualified Data.Text.Internal.Fusion as S
223import qualified Data.Text.Internal.Fusion.Common as S
223import qualified Data.Text.Internal.Fusion.Common as S
224import Data.Text.Encoding (decodeUtf8', encodeUtf8)
224import Data.Text.Encoding (decodeUtf8', encodeUtf8)
225import Data.Text.Internal.Fusion (stream, reverseStream, unstream)
225import Data.Text.Internal.Fusion (stream, reverseStream, unstream)
226−-- import Data.Text.Internal.Private (span_)
226+import Data.Text.Internal.Private (span_)
227import Data.Text.Internal (Text(..), empty, firstf, mul, safe, text)
227import Data.Text.Internal (Text(..), empty, firstf, mul, safe, text)
228−-- import Data.Text.Show (singleton, unpack, unpackCString#)
228+import Data.Text.Show (singleton, unpack, unpackCString#)
229import qualified Prelude as P
229import qualified Prelude as P
230import Data.Text.Unsafe (Iter(..), iter, iter_, lengthWord16, reverseIter,
230import Data.Text.Unsafe (Iter(..), iter, iter_, lengthWord16, reverseIter,
231 reverseIter_, unsafeHead, unsafeTail)
231 reverseIter_, unsafeHead, unsafeTail)
232import Data.Text.Internal.Unsafe.Char (unsafeChr)
232import Data.Text.Internal.Unsafe.Char (unsafeChr)
233import qualified Data.Text.Internal.Functions as F
233import qualified Data.Text.Internal.Functions as F
234import qualified Data.Text.Internal.Encoding.Utf16 as U16
234import qualified Data.Text.Internal.Encoding.Utf16 as U16
235−-- import Data.Text.Internal.Search (indices)
235+import Data.Text.Internal.Search (indices)
236#if defined(__HADDOCK__)
236#if defined(__HADDOCK__)
237import Data.ByteString (ByteString)
237import Data.ByteString (ByteString)
238import qualified Data.Text.Lazy as L
238import qualified Data.Text.Lazy as L
@@ -246,28 +246,6 @@ import qualified GHC.Exts as Exts
246import Text.Printf (PrintfArg, formatArg, formatString)
246import Text.Printf (PrintfArg, formatArg, formatString)
249−-- GHCJS ------------------------------------------------------------
250−import Data.JSString (JSString)
251−import qualified Data.JSString as JSS
252−import qualified Data.JSString.Internal.Fusion as SJS
253−import qualified Data.JSString.Internal.Fusion.Common as SJS
255−import GHC.Exts (Addr#)
257−unpack :: Text -> String
258−unpack = coerce JSS.unpack
260−singleton :: Char -> Text
261−singleton = coerce JSS.singleton
262−{-# INLINE [1] singleton #-}
265−-- | /O(n)/ Convert a literal string into a JSString. Subject to fusion.
266−unpackCString# :: Addr# -> Text
267−unpackCString# addr# = Text $ SJS.unstream (SJS.streamCString# addr#)
268−{-# NOINLINE unpackCString# #-}
269−---------------------------------------------------------------------
271-- $strict
249-- $strict
273-- This package provides both strict and lazy 'Text' types. The
251-- This package provides both strict and lazy 'Text' types. The
@@ -343,17 +321,17 @@ unpackCString# addr# = Text $ SJS.unstream (SJS.streamCString# addr#)
343-- Functions that can be fused by the compiler are documented with the
321-- Functions that can be fused by the compiler are documented with the
344-- phrase \"Subject to fusion\".
322-- phrase \"Subject to fusion\".
346−-- instance Eq Text where
324+instance Eq Text where
347−-- Text arrA offA lenA == Text arrB offB lenB
325+ Text arrA offA lenA == Text arrB offB lenB
348−-- | lenA == lenB = A.equal arrA offA arrB offB lenA
326+ | lenA == lenB = A.equal arrA offA arrB offB lenA
349−-- | otherwise = False
327+ | otherwise = False
350−-- {-# INLINE (==) #-}
328+ {-# INLINE (==) #-}
352−-- instance Ord Text where
330+instance Ord Text where
353−-- compare = compareText
331+ compare = compareText
355−-- instance Read Text where
333+instance Read Text where
356−-- readsPrec p str = [(pack x,y) | (x,y) <- readsPrec p str]
334+ readsPrec p str = [(pack x,y) | (x,y) <- readsPrec p str]
358#if MIN_VERSION_base(4,9,0)
336#if MIN_VERSION_base(4,9,0)
359-- Semigroup orphan instances for older GHCs are provided by
337-- Semigroup orphan instances for older GHCs are provided by
@@ -363,17 +341,17 @@ instance Semigroup Text where
363 (<>) = append
341 (<>) = append
366−-- instance Monoid Text where
344+instance Monoid Text where
367−-- mempty = empty
345+ mempty = empty
368−-- #if MIN_VERSION_base(4,9,0)
346+#if MIN_VERSION_base(4,9,0)
369−-- mappend = (<>) -- future-proof definition
347+ mappend = (<>) -- future-proof definition
371−-- mappend = append
349+ mappend = append
373−-- mconcat = concat
351+ mconcat = concat
375−-- instance IsString Text where
353+instance IsString Text where
376−-- fromString = pack
354+ fromString = pack
378#if __GLASGOW_HASKELL__ >= 708
356#if __GLASGOW_HASKELL__ >= 708
379instance Exts.IsList Text where
357instance Exts.IsList Text where
@@ -409,18 +387,18 @@ instance Binary Text where
409-- and 'Data.Map.Map' is archived here:
387-- and 'Data.Map.Map' is archived here:
410-- <http://markmail.org/message/trovdc6zkphyi3cr#query:+page:1+mid:a46der3iacwjcf6n+state:results Proposal: Allow gunfold for Data.Map, ... >
388-- <http://markmail.org/message/trovdc6zkphyi3cr#query:+page:1+mid:a46der3iacwjcf6n+state:results Proposal: Allow gunfold for Data.Map, ... >
412−-- instance Data Text where
390+instance Data Text where
413−-- gfoldl f z txt = z pack `f` (unpack txt)
391+ gfoldl f z txt = z pack `f` (unpack txt)
414−-- toConstr _ = packConstr
392+ toConstr _ = packConstr
415−-- gunfold k z c = case constrIndex c of
393+ gunfold k z c = case constrIndex c of
416−-- 1 -> k (z pack)
394+ 1 -> k (z pack)
417−-- _ -> P.error "gunfold"
395+ _ -> P.error "gunfold"
418−-- dataTypeOf _ = textDataType
396+ dataTypeOf _ = textDataType
420#if MIN_VERSION_base(4,7,0)
398#if MIN_VERSION_base(4,7,0)
421-- | Only defined for @base-4.7.0.0@ and later
399-- | Only defined for @base-4.7.0.0@ and later
422instance PrintfArg Text where
400instance PrintfArg Text where
423− formatArg t = formatString $ unpack t
401+ formatArg txt = formatString $ unpack txt
426packConstr :: Constr
404packConstr :: Constr
@@ -429,19 +407,19 @@ packConstr = mkConstr textDataType "pack" [] Prefix
429textDataType :: DataType
407textDataType :: DataType
430textDataType = mkDataType "Data.Text.Text" [packConstr]
408textDataType = mkDataType "Data.Text.Text" [packConstr]
432−-- -- | /O(n)/ Compare two 'Text' values lexicographically.
410+-- | /O(n)/ Compare two 'Text' values lexicographically.
433−-- compareText :: Text -> Text -> Ordering
411+compareText :: Text -> Text -> Ordering
434−-- compareText ta@(Text _arrA _offA lenA) tb@(Text _arrB _offB lenB)
412+compareText ta@(Text _arrA _offA lenA) tb@(Text _arrB _offB lenB)
435−-- | lenA == 0 && lenB == 0 = EQ
413+ | lenA == 0 && lenB == 0 = EQ
436−-- | otherwise = go 0 0
414+ | otherwise = go 0 0
438−-- go !i !j
416+ go !i !j
439−-- | i >= lenA || j >= lenB = compare lenA lenB
417+ | i >= lenA || j >= lenB = compare lenA lenB
440−-- | a < b = LT
418+ | a < b = LT
441−-- | a > b = GT
419+ | a > b = GT
442−-- | otherwise = go (i+di) (j+dj)
420+ | otherwise = go (i+di) (j+dj)
443−-- where Iter a di = iter ta i
421+ where Iter a di = iter ta i
444−-- Iter b dj = iter tb j
422+ Iter b dj = iter tb j
446-- -----------------------------------------------------------------------------
424-- -----------------------------------------------------------------------------
447-- * Conversion to/from 'Text'
425-- * Conversion to/from 'Text'
@@ -449,8 +427,7 @@ textDataType = mkDataType "Data.Text.Text" [packConstr]
449-- | /O(n)/ Convert a 'String' into a 'Text'. Subject to
427-- | /O(n)/ Convert a 'String' into a 'Text'. Subject to
450-- fusion. Performs replacement on invalid scalar values.
428-- fusion. Performs replacement on invalid scalar values.
451pack :: String -> Text
429pack :: String -> Text
452−pack = coerce JSS.pack
453−-- pack = unstream . S.map safe . S.streamList
430+pack = unstream . S.map safe . S.streamList
454{-# INLINE [1] pack #-}
431{-# INLINE [1] pack #-}
456-- -----------------------------------------------------------------------------
433-- -----------------------------------------------------------------------------
@@ -461,8 +438,7 @@ pack = coerce JSS.pack
461-- copying a new array. Subject to fusion. Performs replacement on
438-- copying a new array. Subject to fusion. Performs replacement on
462-- invalid scalar values.
439-- invalid scalar values.
463cons :: Char -> Text -> Text
440cons :: Char -> Text -> Text
464−cons = coerce JSS.cons
465−-- cons c t = unstream (S.cons (safe c) (stream t))
441+cons c t = unstream (S.cons (safe c) (stream t))
466{-# INLINE cons #-}
442{-# INLINE cons #-}
468infixr 5 `cons`
444infixr 5 `cons`
@@ -471,51 +447,47 @@ infixr 5 `cons`
471-- entire array in the process, unless fused. Subject to fusion.
447-- entire array in the process, unless fused. Subject to fusion.
472-- Performs replacement on invalid scalar values.
448-- Performs replacement on invalid scalar values.
473snoc :: Text -> Char -> Text
449snoc :: Text -> Char -> Text
474−snoc = coerce JSS.snoc
475−-- snoc t c = unstream (S.snoc (stream t) (safe c))
450+snoc t c = unstream (S.snoc (stream t) (safe c))
476{-# INLINE snoc #-}
451{-# INLINE snoc #-}
478-- | /O(n)/ Appends one 'Text' to the other by copying both of them
453-- | /O(n)/ Appends one 'Text' to the other by copying both of them
479-- into a new 'Text'. Subject to fusion.
454-- into a new 'Text'. Subject to fusion.
480append :: Text -> Text -> Text
455append :: Text -> Text -> Text
481−append = coerce JSS.append
482−-- append a@(Text arr1 off1 len1) b@(Text arr2 off2 len2)
456+append a@(Text arr1 off1 len1) b@(Text arr2 off2 len2)
483−-- | len1 == 0 = b
457+ | len1 == 0 = b
484−-- | len2 == 0 = a
458+ | len2 == 0 = a
485−-- | len > 0 = Text (A.run x) 0 len
459+ | len > 0 = Text (A.run x) 0 len
486−-- | otherwise = overflowError "append"
460+ | otherwise = overflowError "append"
488−-- len = len1+len2
462+ len = len1+len2
489−-- x :: ST s (A.MArray s)
463+ x :: ST s (A.MArray s)
491−-- arr <- A.new len
465+ arr <- A.new len
492−-- A.copyI arr 0 arr1 off1 len1
466+ A.copyI arr 0 arr1 off1 len1
493−-- A.copyI arr len1 arr2 off2 len
467+ A.copyI arr len1 arr2 off2 len
494−-- return arr
468+ return arr
495{-# NOINLINE append #-}
469{-# NOINLINE append #-}
497−-- {-# RULES
471+{-# RULES
498−-- "TEXT append -> fused" [~1] forall t1 t2.
472+"TEXT append -> fused" [~1] forall t1 t2.
499−-- append t1 t2 = unstream (S.append (stream t1) (stream t2))
473+ append t1 t2 = unstream (S.append (stream t1) (stream t2))
500−-- "TEXT append -> unfused" [1] forall t1 t2.
474+"TEXT append -> unfused" [1] forall t1 t2.
501−-- unstream (S.append (stream t1) (stream t2)) = append t1 t2
475+ unstream (S.append (stream t1) (stream t2)) = append t1 t2
504-- | /O(1)/ Returns the first character of a 'Text', which must be
478-- | /O(1)/ Returns the first character of a 'Text', which must be
505-- non-empty. Subject to fusion.
479-- non-empty. Subject to fusion.
506head :: Text -> Char
480head :: Text -> Char
507−head = coerce JSS.head
508−-- head t = S.head (stream t)
481+head t = S.head (stream t)
509{-# INLINE head #-}
482{-# INLINE head #-}
511-- | /O(1)/ Returns the first character and rest of a 'Text', or
484-- | /O(1)/ Returns the first character and rest of a 'Text', or
512-- 'Nothing' if empty. Subject to fusion.
485-- 'Nothing' if empty. Subject to fusion.
513uncons :: Text -> Maybe (Char, Text)
486uncons :: Text -> Maybe (Char, Text)
514−uncons = coerce JSS.uncons
515−-- uncons t@(Text arr off len)
487+uncons t@(Text arr off len)
516−-- | len <= 0 = Nothing
488+ | len <= 0 = Nothing
517−-- | otherwise = Just $ let !(Iter c d) = iter t 0
489+ | otherwise = Just $ let !(Iter c d) = iter t 0
518−-- in (c, text arr (off+d) (len-d))
490+ in (c, text arr (off+d) (len-d))
519{-# INLINE [1] uncons #-}
491{-# INLINE [1] uncons #-}
521-- | Lifted from Control.Arrow and specialized.
493-- | Lifted from Control.Arrow and specialized.
@@ -525,86 +497,81 @@ second f (a, b) = (a, f b)
525-- | /O(1)/ Returns the last character of a 'Text', which must be
497-- | /O(1)/ Returns the last character of a 'Text', which must be
526-- non-empty. Subject to fusion.
498-- non-empty. Subject to fusion.
527last :: Text -> Char
499last :: Text -> Char
528−last = coerce JSS.last
529−-- last (Text arr off len)
500+last (Text arr off len)
530−-- | len <= 0 = emptyError "last"
501+ | len <= 0 = emptyError "last"
531−-- | n < 0xDC00 || n > 0xDFFF = unsafeChr n
502+ | n < 0xDC00 || n > 0xDFFF = unsafeChr n
532−-- | otherwise = U16.chr2 n0 n
503+ | otherwise = U16.chr2 n0 n
533−-- where n = A.unsafeIndex arr (off+len-1)
504+ where n = A.unsafeIndex arr (off+len-1)
534−-- n0 = A.unsafeIndex arr (off+len-2)
505+ n0 = A.unsafeIndex arr (off+len-2)
535{-# INLINE [1] last #-}
506{-# INLINE [1] last #-}
537−-- {-# RULES
508+{-# RULES
538−-- "TEXT last -> fused" [~1] forall t.
509+"TEXT last -> fused" [~1] forall t.
539−-- last t = S.last (stream t)
510+ last t = S.last (stream t)
540−-- "TEXT last -> unfused" [1] forall t.
511+"TEXT last -> unfused" [1] forall t.
541−-- S.last (stream t) = last t
512+ S.last (stream t) = last t
544-- | /O(1)/ Returns all characters after the head of a 'Text', which
515-- | /O(1)/ Returns all characters after the head of a 'Text', which
545-- must be non-empty. Subject to fusion.
516-- must be non-empty. Subject to fusion.
546tail :: Text -> Text
517tail :: Text -> Text
547−tail = coerce JSS.tail
548−-- tail t@(Text arr off len)
518+tail t@(Text arr off len)
549−-- | len <= 0 = emptyError "tail"
519+ | len <= 0 = emptyError "tail"
550−-- | otherwise = text arr (off+d) (len-d)
520+ | otherwise = text arr (off+d) (len-d)
551−-- where d = iter_ t 0
521+ where d = iter_ t 0
552{-# INLINE [1] tail #-}
522{-# INLINE [1] tail #-}
554−-- {-# RULES
524+{-# RULES
555−-- "TEXT tail -> fused" [~1] forall t.
525+"TEXT tail -> fused" [~1] forall t.
556−-- tail t = unstream (S.tail (stream t))
526+ tail t = unstream (S.tail (stream t))
557−-- "TEXT tail -> unfused" [1] forall t.
527+"TEXT tail -> unfused" [1] forall t.
558−-- unstream (S.tail (stream t)) = tail t
528+ unstream (S.tail (stream t)) = tail t
561-- | /O(1)/ Returns all but the last character of a 'Text', which must
531-- | /O(1)/ Returns all but the last character of a 'Text', which must
562-- be non-empty. Subject to fusion.
532-- be non-empty. Subject to fusion.
563init :: Text -> Text
533init :: Text -> Text
564−init = coerce JSS.init
565−-- init (Text arr off len) | len <= 0 = emptyError "init"
534+init (Text arr off len) | len <= 0 = emptyError "init"
566−-- | n >= 0xDC00 && n <= 0xDFFF = text arr off (len-2)
535+ | n >= 0xDC00 && n <= 0xDFFF = text arr off (len-2)
567−-- | otherwise = text arr off (len-1)
536+ | otherwise = text arr off (len-1)
569−-- n = A.unsafeIndex arr (off+len-1)
538+ n = A.unsafeIndex arr (off+len-1)
570{-# INLINE [1] init #-}
539{-# INLINE [1] init #-}
572−-- {-# RULES
541+{-# RULES
573−-- "TEXT init -> fused" [~1] forall t.
542+"TEXT init -> fused" [~1] forall t.
574−-- init t = unstream (S.init (stream t))
543+ init t = unstream (S.init (stream t))
575−-- "TEXT init -> unfused" [1] forall t.
544+"TEXT init -> unfused" [1] forall t.
576−-- unstream (S.init (stream t)) = init t
545+ unstream (S.init (stream t)) = init t
579-- | /O(1)/ Tests whether a 'Text' is empty or not. Subject to
548-- | /O(1)/ Tests whether a 'Text' is empty or not. Subject to
580-- fusion.
549-- fusion.
581null :: Text -> Bool
550null :: Text -> Bool
582−null = coerce JSS.null
583−-- null (Text _arr _off len) =
551+null (Text _arr _off len) =
584−-- #if defined(ASSERTS)
552+#if defined(ASSERTS)
585−-- assert (len >= 0) $
553+ assert (len >= 0) $
587−-- len <= 0
555+ len <= 0
588{-# INLINE [1] null #-}
556{-# INLINE [1] null #-}
590−-- {-# RULES
558+{-# RULES
591−-- "TEXT null -> fused" [~1] forall t.
559+"TEXT null -> fused" [~1] forall t.
592−-- null t = S.null (stream t)
560+ null t = S.null (stream t)
593−-- "TEXT null -> unfused" [1] forall t.
561+"TEXT null -> unfused" [1] forall t.
594−-- S.null (stream t) = null t
562+ S.null (stream t) = null t
597-- | /O(1)/ Tests whether a 'Text' contains exactly one character.
565-- | /O(1)/ Tests whether a 'Text' contains exactly one character.
598-- Subject to fusion.
566-- Subject to fusion.
599−-- isSingleton :: Text -> Bool
567+isSingleton :: Text -> Bool
600−-- isSingleton = S.isSingleton . stream
568+isSingleton = S.isSingleton . stream
601−-- {-# INLINE isSingleton #-}
569+{-# INLINE isSingleton #-}
603-- | /O(n)/ Returns the number of characters in a 'Text'.
571-- | /O(n)/ Returns the number of characters in a 'Text'.
604-- Subject to fusion.
572-- Subject to fusion.
605length :: Text -> Int
573length :: Text -> Int
606−length = coerce JSS.length
607−-- length t = S.length (stream t)
574+length t = S.length (stream t)
608{-# INLINE [0] length #-}
575{-# INLINE [0] length #-}
609-- length needs to be phased after the compareN/length rules otherwise
576-- length needs to be phased after the compareN/length rules otherwise
610-- it may inline before the rules have an opportunity to fire.
577-- it may inline before the rules have an opportunity to fire.
@@ -616,44 +583,43 @@ length = coerce JSS.length
616-- of 'length', but can short circuit if the count of characters is
583-- of 'length', but can short circuit if the count of characters is
617-- greater than the number, and hence be more efficient.
584-- greater than the number, and hence be more efficient.
618compareLength :: Text -> Int -> Ordering
585compareLength :: Text -> Int -> Ordering
619−compareLength t n = compare (length t) n
620−-- compareLength t n = S.compareLengthI (stream t) n
586+compareLength t n = S.compareLengthI (stream t) n
621−-- {-# INLINE [1] compareLength #-}
587+{-# INLINE [1] compareLength #-}
623−-- {-# RULES
589+{-# RULES
624−-- "TEXT compareN/length -> compareLength" [~1] forall t n.
590+"TEXT compareN/length -> compareLength" [~1] forall t n.
625−-- compare (length t) n = compareLength t n
591+ compare (length t) n = compareLength t n
628−-- {-# RULES
594+{-# RULES
629−-- "TEXT ==N/length -> compareLength/==EQ" [~1] forall t n.
595+"TEXT ==N/length -> compareLength/==EQ" [~1] forall t n.
630−-- eqInt (length t) n = compareLength t n == EQ
596+ eqInt (length t) n = compareLength t n == EQ
633−-- {-# RULES
599+{-# RULES
634−-- "TEXT /=N/length -> compareLength//=EQ" [~1] forall t n.
600+"TEXT /=N/length -> compareLength//=EQ" [~1] forall t n.
635−-- neInt (length t) n = compareLength t n /= EQ
601+ neInt (length t) n = compareLength t n /= EQ
638−-- {-# RULES
604+{-# RULES
639−-- "TEXT <N/length -> compareLength/==LT" [~1] forall t n.
605+"TEXT <N/length -> compareLength/==LT" [~1] forall t n.
640−-- ltInt (length t) n = compareLength t n == LT
606+ ltInt (length t) n = compareLength t n == LT
643−-- {-# RULES
609+{-# RULES
644−-- "TEXT <=N/length -> compareLength//=GT" [~1] forall t n.
610+"TEXT <=N/length -> compareLength//=GT" [~1] forall t n.
645−-- leInt (length t) n = compareLength t n /= GT
611+ leInt (length t) n = compareLength t n /= GT
648−-- {-# RULES
614+{-# RULES
649−-- "TEXT >N/length -> compareLength/==GT" [~1] forall t n.
615+"TEXT >N/length -> compareLength/==GT" [~1] forall t n.
650−-- gtInt (length t) n = compareLength t n == GT
616+ gtInt (length t) n = compareLength t n == GT
653−-- {-# RULES
619+{-# RULES
654−-- "TEXT >=N/length -> compareLength//=LT" [~1] forall t n.
620+"TEXT >=N/length -> compareLength//=LT" [~1] forall t n.
655−-- geInt (length t) n = compareLength t n /= LT
621+ geInt (length t) n = compareLength t n /= LT
658-- -----------------------------------------------------------------------------
624-- -----------------------------------------------------------------------------
659-- * Transformations
625-- * Transformations
@@ -661,30 +627,26 @@ compareLength t n = compare (length t) n
661-- each element of @t@. Subject to fusion. Performs replacement on
627-- each element of @t@. Subject to fusion. Performs replacement on
662-- invalid scalar values.
628-- invalid scalar values.
663map :: (Char -> Char) -> Text -> Text
629map :: (Char -> Char) -> Text -> Text
665−-- map f t = unstream (S.map (safe . f) (stream t))
630+map f t = unstream (S.map (safe . f) (stream t))
666{-# INLINE [1] map #-}
631{-# INLINE [1] map #-}
668-- | /O(n)/ The 'intercalate' function takes a 'Text' and a list of
633-- | /O(n)/ The 'intercalate' function takes a 'Text' and a list of
669-- 'Text's and concatenates the list after interspersing the first
634-- 'Text's and concatenates the list after interspersing the first
670-- argument between each element of the list.
635-- argument between each element of the list.
671intercalate :: Text -> [Text] -> Text
636intercalate :: Text -> [Text] -> Text
672−intercalate = coerce JSS.intercalate
673−-- intercalate t = concat . (F.intersperse t)
637+intercalate t = concat . (F.intersperse t)
674{-# INLINE intercalate #-}
638{-# INLINE intercalate #-}
676-- | /O(n)/ The 'intersperse' function takes a character and places it
640-- | /O(n)/ The 'intersperse' function takes a character and places it
677-- between the characters of a 'Text'. Subject to fusion. Performs
641-- between the characters of a 'Text'. Subject to fusion. Performs
678-- replacement on invalid scalar values.
642-- replacement on invalid scalar values.
679intersperse :: Char -> Text -> Text
643intersperse :: Char -> Text -> Text
680−intersperse = coerce JSS.intersperse
681−-- intersperse c t = unstream (S.intersperse (safe c) (stream t))
644+intersperse c t = unstream (S.intersperse (safe c) (stream t))
682{-# INLINE intersperse #-}
645{-# INLINE intersperse #-}
684-- | /O(n)/ Reverse the characters of a string. Subject to fusion.
647-- | /O(n)/ Reverse the characters of a string. Subject to fusion.
685reverse :: Text -> Text
648reverse :: Text -> Text
686−reverse = coerce JSS.reverse
687−-- reverse t = S.reverse (stream t)
649+reverse t = S.reverse (stream t)
688{-# INLINE reverse #-}
650{-# INLINE reverse #-}
690-- | /O(m+n)/ Replace every non-overlapping occurrence of @needle@ in
652-- | /O(m+n)/ Replace every non-overlapping occurrence of @needle@ in
@@ -718,29 +680,28 @@ replace :: Text
719 -- ^ @haystack@ in which to search.
681 -- ^ @haystack@ in which to search.
721−replace = coerce JSS.replace
722−-- replace needle@(Text _ _ neeLen)
683+replace needle@(Text _ _ neeLen)
723−-- (Text repArr repOff repLen)
684+ (Text repArr repOff repLen)
724−-- haystack@(Text hayArr hayOff hayLen)
685+ haystack@(Text hayArr hayOff hayLen)
725−-- | neeLen == 0 = emptyError "replace"
686+ | neeLen == 0 = emptyError "replace"
726−-- | L.null ixs = haystack
687+ | L.null ixs = haystack
727−-- | len > 0 = Text (A.run x) 0 len
688+ | len > 0 = Text (A.run x) 0 len
728−-- | otherwise = empty
689+ | otherwise = empty
730−-- ixs = indices needle haystack
691+ ixs = indices needle haystack
731−-- len = hayLen - (neeLen - repLen) `mul` L.length ixs
692+ len = hayLen - (neeLen - repLen) `mul` L.length ixs
732−-- x :: ST s (A.MArray s)
693+ x :: ST s (A.MArray s)
734−-- marr <- A.new len
695+ marr <- A.new len
735−-- let loop (i:is) o d = do
696+ let loop (i:is) o d = do
736−-- let d0 = d + i - o
697+ let d0 = d + i - o
737−-- d1 = d0 + repLen
698+ d1 = d0 + repLen
738−-- A.copyI marr d hayArr (hayOff+o) d0
699+ A.copyI marr d hayArr (hayOff+o) d0
739−-- A.copyI marr d0 repArr repOff d1
700+ A.copyI marr d0 repArr repOff d1
740−-- loop is (i + neeLen) d1
701+ loop is (i + neeLen) d1
741−-- loop [] o d = A.copyI marr d hayArr (hayOff+o) len
702+ loop [] o d = A.copyI marr d hayArr (hayOff+o) len
742−-- loop ixs 0 0
703+ loop ixs 0 0
743−-- return marr
704+ return marr
745-- ----------------------------------------------------------------------------
706-- ----------------------------------------------------------------------------
746-- ** Case conversions (folds)
707-- ** Case conversions (folds)
@@ -779,8 +740,7 @@ replace = coerce JSS.replace
779-- U+00B5) is case folded to \"μ\" (small letter mu, U+03BC)
740-- U+00B5) is case folded to \"μ\" (small letter mu, U+03BC)
780-- instead of itself.
741-- instead of itself.
781toCaseFold :: Text -> Text
742toCaseFold :: Text -> Text
782−-- toCaseFold t = unstream (S.toCaseFold (stream t))
743+toCaseFold t = unstream (S.toCaseFold (stream t))
783−toCaseFold = coerce JSS.toCaseFold
784{-# INLINE toCaseFold #-}
744{-# INLINE toCaseFold #-}
786-- | /O(n)/ Convert a string to lower case, using simple case
746-- | /O(n)/ Convert a string to lower case, using simple case
@@ -791,8 +751,7 @@ toCaseFold = coerce JSS.toCaseFold
791-- U+0130) maps to the sequence \"i\" (Latin small letter i, U+0069)
751-- U+0130) maps to the sequence \"i\" (Latin small letter i, U+0069)
792-- followed by \" ̇\" (combining dot above, U+0307).
752-- followed by \" ̇\" (combining dot above, U+0307).
793toLower :: Text -> Text
753toLower :: Text -> Text
794−-- toLower t = unstream (S.toLower (stream t))
754+toLower t = unstream (S.toLower (stream t))
795−toLower = coerce JSS.toLower
796{-# INLINE toLower #-}
755{-# INLINE toLower #-}
798-- | /O(n)/ Convert a string to upper case, using simple case
757-- | /O(n)/ Convert a string to upper case, using simple case
@@ -802,8 +761,7 @@ toLower = coerce JSS.toLower
802-- instance, the German \"ß\" (eszett, U+00DF) maps to the
761-- instance, the German \"ß\" (eszett, U+00DF) maps to the
803-- two-letter sequence \"SS\".
762-- two-letter sequence \"SS\".
804toUpper :: Text -> Text
763toUpper :: Text -> Text
805−-- toUpper t = unstream (S.toUpper (stream t))
764+toUpper t = unstream (S.toUpper (stream t))
806−toUpper = coerce JSS.toUpper
807{-# INLINE toUpper #-}
765{-# INLINE toUpper #-}
809-- | /O(n)/ Convert a string to title case, using simple case
767-- | /O(n)/ Convert a string to title case, using simple case
@@ -825,8 +783,7 @@ toUpper = coerce JSS.toUpper
825-- Fox\" is correctly title cased—but this function will
783-- Fox\" is correctly title cased—but this function will
826-- capitalize /every/ word.
784-- capitalize /every/ word.
827toTitle :: Text -> Text
785toTitle :: Text -> Text
828−toTitle = coerce JSS.toTitle
829−-- toTitle t = unstream (S.toTitle (stream t))
786+toTitle t = unstream (S.toTitle (stream t))
830{-# INLINE toTitle #-}
787{-# INLINE toTitle #-}
832-- | /O(n)/ Left-justify a string to the given length, using the
789-- | /O(n)/ Left-justify a string to the given length, using the
@@ -838,19 +795,18 @@ toTitle = coerce JSS.toTitle
838-- > justifyLeft 7 'x' "foo" == "fooxxxx"
795-- > justifyLeft 7 'x' "foo" == "fooxxxx"
839-- > justifyLeft 3 'x' "foobar" == "foobar"
796-- > justifyLeft 3 'x' "foobar" == "foobar"
840justifyLeft :: Int -> Char -> Text -> Text
797justifyLeft :: Int -> Char -> Text -> Text
841−justifyLeft = coerce JSS.justifyLeft
798+justifyLeft k c t
843−-- | len >= k = t
799+ | len >= k = t
844−-- | otherwise = t `append` replicateChar (k-len) c
800+ | otherwise = t `append` replicateChar (k-len) c
845−-- where len = length t
801+ where len = length t
846{-# INLINE [1] justifyLeft #-}
802{-# INLINE [1] justifyLeft #-}
848−-- {-# RULES
804+{-# RULES
849−-- "TEXT justifyLeft -> fused" [~1] forall k c t.
805+"TEXT justifyLeft -> fused" [~1] forall k c t.
850−-- justifyLeft k c t = unstream (S.justifyLeftI k c (stream t))
806+ justifyLeft k c t = unstream (S.justifyLeftI k c (stream t))
851−-- "TEXT justifyLeft -> unfused" [1] forall k c t.
807+"TEXT justifyLeft -> unfused" [1] forall k c t.
852−-- unstream (S.justifyLeftI k c (stream t)) = justifyLeft k c t
808+ unstream (S.justifyLeftI k c (stream t)) = justifyLeft k c t
855-- | /O(n)/ Right-justify a string to the given length, using the
811-- | /O(n)/ Right-justify a string to the given length, using the
856-- specified fill character on the left. Performs replacement on
812-- specified fill character on the left. Performs replacement on
@@ -861,11 +817,10 @@ justifyLeft = coerce JSS.justifyLeft
861-- > justifyRight 7 'x' "bar" == "xxxxbar"
817-- > justifyRight 7 'x' "bar" == "xxxxbar"
862-- > justifyRight 3 'x' "foobar" == "foobar"
818-- > justifyRight 3 'x' "foobar" == "foobar"
863justifyRight :: Int -> Char -> Text -> Text
819justifyRight :: Int -> Char -> Text -> Text
864−justifyRight = coerce JSS.justifyRight
820+justifyRight k c t
865−-- justifyRight k c t
866−-- | len >= k = t
821+ | len >= k = t
867−-- | otherwise = replicateChar (k-len) c `append` t
822+ | otherwise = replicateChar (k-len) c `append` t
868−-- where len = length t
823+ where len = length t
869{-# INLINE justifyRight #-}
824{-# INLINE justifyRight #-}
871-- | /O(n)/ Center a string to the given length, using the specified
826-- | /O(n)/ Center a string to the given length, using the specified
@@ -876,14 +831,13 @@ justifyRight = coerce JSS.justifyRight
877-- > center 8 'x' "HS" = "xxxHSxxx"
832-- > center 8 'x' "HS" = "xxxHSxxx"
878center :: Int -> Char -> Text -> Text
833center :: Int -> Char -> Text -> Text
879−center = coerce JSS.center
834+center k c t
881−-- | len >= k = t
835+ | len >= k = t
882−-- | otherwise = replicateChar l c `append` t `append` replicateChar r c
836+ | otherwise = replicateChar l c `append` t `append` replicateChar r c
883−-- where len = length t
837+ where len = length t
884−-- d = k - len
838+ d = k - len
885−-- r = d `quot` 2
839+ r = d `quot` 2
886−-- l = d - r
840+ l = d - r
887{-# INLINE center #-}
841{-# INLINE center #-}
889-- | /O(n)/ The 'transpose' function transposes the rows and columns
843-- | /O(n)/ The 'transpose' function transposes the rows and columns
@@ -891,8 +845,7 @@ center = coerce JSS.center
891-- 'unpack', and the list version of transpose, and is thus not very
845-- 'unpack', and the list version of transpose, and is thus not very
892-- efficient.
846-- efficient.
893transpose :: [Text] -> [Text]
847transpose :: [Text] -> [Text]
894−transpose = coerce JSS.transpose
895−-- transpose ts = P.map pack (L.transpose (P.map unpack ts))
848+transpose ts = P.map pack (L.transpose (P.map unpack ts))
897-- -----------------------------------------------------------------------------
850-- -----------------------------------------------------------------------------
898-- * Reducing 'Text's (folds)
851-- * Reducing 'Text's (folds)
@@ -902,27 +855,23 @@ transpose = coerce JSS.transpose
902-- reduces the 'Text' using the binary operator, from left to right.
855-- reduces the 'Text' using the binary operator, from left to right.
903-- Subject to fusion.
856-- Subject to fusion.
904foldl :: (a -> Char -> a) -> a -> Text -> a
857foldl :: (a -> Char -> a) -> a -> Text -> a
905−foldl f a0 (Text t) = JSS.foldl f a0 t
906−-- foldl f z t = S.foldl f z (stream t)
858+foldl f z t = S.foldl f z (stream t)
907{-# INLINE foldl #-}
859{-# INLINE foldl #-}
909-- | /O(n)/ A strict version of 'foldl'. Subject to fusion.
861-- | /O(n)/ A strict version of 'foldl'. Subject to fusion.
910foldl' :: (a -> Char -> a) -> a -> Text -> a
862foldl' :: (a -> Char -> a) -> a -> Text -> a
911−foldl' f a0 (Text t) = JSS.foldl' f a0 t
912−-- foldl' f z t = S.foldl' f z (stream t)
863+foldl' f z t = S.foldl' f z (stream t)
913{-# INLINE foldl' #-}
864{-# INLINE foldl' #-}
915-- | /O(n)/ A variant of 'foldl' that has no starting value argument,
866-- | /O(n)/ A variant of 'foldl' that has no starting value argument,
916-- and thus must be applied to a non-empty 'Text'. Subject to fusion.
867-- and thus must be applied to a non-empty 'Text'. Subject to fusion.
917foldl1 :: (Char -> Char -> Char) -> Text -> Char
868foldl1 :: (Char -> Char -> Char) -> Text -> Char
918−foldl1 = coerce JSS.foldl1
919−-- foldl1 f t = S.foldl1 f (stream t)
869+foldl1 f t = S.foldl1 f (stream t)
920{-# INLINE foldl1 #-}
870{-# INLINE foldl1 #-}
922-- | /O(n)/ A strict version of 'foldl1'. Subject to fusion.
872-- | /O(n)/ A strict version of 'foldl1'. Subject to fusion.
923foldl1' :: (Char -> Char -> Char) -> Text -> Char
873foldl1' :: (Char -> Char -> Char) -> Text -> Char
924−foldl1' = coerce JSS.foldl1'
925−-- foldl1' f t = S.foldl1' f (stream t)
874+foldl1' f t = S.foldl1' f (stream t)
926{-# INLINE foldl1' #-}
875{-# INLINE foldl1' #-}
928-- | /O(n)/ 'foldr', applied to a binary operator, a starting value
877-- | /O(n)/ 'foldr', applied to a binary operator, a starting value
@@ -930,16 +879,14 @@ foldl1' = coerce JSS.foldl1'
930-- reduces the 'Text' using the binary operator, from right to left.
879-- reduces the 'Text' using the binary operator, from right to left.
931-- Subject to fusion.
880-- Subject to fusion.
932foldr :: (Char -> a -> a) -> a -> Text -> a
881foldr :: (Char -> a -> a) -> a -> Text -> a
933−foldr f a0 (Text t) = JSS.foldr f a0 t
934−-- foldr f z t = S.foldr f z (stream t)
882+foldr f z t = S.foldr f z (stream t)
935{-# INLINE foldr #-}
883{-# INLINE foldr #-}
937-- | /O(n)/ A variant of 'foldr' that has no starting value argument,
885-- | /O(n)/ A variant of 'foldr' that has no starting value argument,
938-- and thus must be applied to a non-empty 'Text'. Subject to
886-- and thus must be applied to a non-empty 'Text'. Subject to
939-- fusion.
887-- fusion.
940foldr1 :: (Char -> Char -> Char) -> Text -> Char
888foldr1 :: (Char -> Char -> Char) -> Text -> Char
941−foldr1 = coerce JSS.foldr1
942−-- foldr1 f t = S.foldr1 f (stream t)
889+foldr1 f t = S.foldr1 f (stream t)
943{-# INLINE foldr1 #-}
890{-# INLINE foldr1 #-}
945-- -----------------------------------------------------------------------------
892-- -----------------------------------------------------------------------------
@@ -947,54 +894,48 @@ foldr1 = coerce JSS.foldr1
948-- | /O(n)/ Concatenate a list of 'Text's.
895-- | /O(n)/ Concatenate a list of 'Text's.
949concat :: [Text] -> Text
896concat :: [Text] -> Text
950−concat = coerce JSS.concat
951−-- concat ts = case ts' of
897+concat ts = case ts' of
952−-- [] -> empty
898+ [] -> empty
953−-- [t] -> t
899+ [t] -> t
954−-- _ -> Text (A.run go) 0 len
900+ _ -> Text (A.run go) 0 len
956−-- ts' = L.filter (not . null) ts
902+ ts' = L.filter (not . null) ts
957−-- len = sumP "concat" $ L.map lengthWord16 ts'
903+ len = sumP "concat" $ L.map lengthWord16 ts'
958−-- go :: ST s (A.MArray s)
904+ go :: ST s (A.MArray s)
959−-- go = do
905+ go = do
960−-- arr <- A.new len
906+ arr <- A.new len
961−-- let step i (Text a o l) =
907+ let step i (Text a o l) =
962−-- let !j = i + l in A.copyI arr i a o j >> return j
908+ let !j = i + l in A.copyI arr i a o j >> return j
963−-- foldM step 0 ts' >> return arr
909+ foldM step 0 ts' >> return arr
965-- | /O(n)/ Map a function over a 'Text' that results in a 'Text', and
911-- | /O(n)/ Map a function over a 'Text' that results in a 'Text', and
966-- concatenate the results.
912-- concatenate the results.
967concatMap :: (Char -> Text) -> Text -> Text
913concatMap :: (Char -> Text) -> Text -> Text
968−concatMap = coerce JSS.concatMap
969−-- concatMap f = concat . foldr ((:) . f) []
914+concatMap f = concat . foldr ((:) . f) []
970{-# INLINE concatMap #-}
915{-# INLINE concatMap #-}
972-- | /O(n)/ 'any' @p@ @t@ determines whether any character in the
917-- | /O(n)/ 'any' @p@ @t@ determines whether any character in the
973-- 'Text' @t@ satisfies the predicate @p@. Subject to fusion.
918-- 'Text' @t@ satisfies the predicate @p@. Subject to fusion.
974any :: (Char -> Bool) -> Text -> Bool
919any :: (Char -> Bool) -> Text -> Bool
976−-- any p t = S.any p (stream t)
920+any p t = S.any p (stream t)
977{-# INLINE any #-}
921{-# INLINE any #-}
979-- | /O(n)/ 'all' @p@ @t@ determines whether all characters in the
923-- | /O(n)/ 'all' @p@ @t@ determines whether all characters in the
980-- 'Text' @t@ satisfy the predicate @p@. Subject to fusion.
924-- 'Text' @t@ satisfy the predicate @p@. Subject to fusion.
981all :: (Char -> Bool) -> Text -> Bool
925all :: (Char -> Bool) -> Text -> Bool
983−-- all p t = S.all p (stream t)
926+all p t = S.all p (stream t)
984{-# INLINE all #-}
927{-# INLINE all #-}
986-- | /O(n)/ 'maximum' returns the maximum value from a 'Text', which
929-- | /O(n)/ 'maximum' returns the maximum value from a 'Text', which
987-- must be non-empty. Subject to fusion.
930-- must be non-empty. Subject to fusion.
988maximum :: Text -> Char
931maximum :: Text -> Char
989−maximum = coerce JSS.maximum
990−-- maximum t = S.maximum (stream t)
932+maximum t = S.maximum (stream t)
991{-# INLINE maximum #-}
933{-# INLINE maximum #-}
993-- | /O(n)/ 'minimum' returns the minimum value from a 'Text', which
935-- | /O(n)/ 'minimum' returns the minimum value from a 'Text', which
994-- must be non-empty. Subject to fusion.
936-- must be non-empty. Subject to fusion.
995minimum :: Text -> Char
937minimum :: Text -> Char
996−minimum = coerce JSS.minimum
997−-- minimum t = S.minimum (stream t)
938+minimum t = S.minimum (stream t)
998{-# INLINE minimum #-}
939{-# INLINE minimum #-}
1000-- -----------------------------------------------------------------------------
941-- -----------------------------------------------------------------------------
@@ -1010,9 +951,8 @@ minimum = coerce JSS.minimum
1011-- > last (scanl f z xs) == foldl f z xs.
952-- > last (scanl f z xs) == foldl f z xs.
1012scanl :: (Char -> Char -> Char) -> Char -> Text -> Text
953scanl :: (Char -> Char -> Char) -> Char -> Text -> Text
1013−scanl = coerce JSS.scanl
1014−-- scanl f z t = unstream (S.scanl g z (stream t))
954+scanl f z t = unstream (S.scanl g z (stream t))
1015−-- where g a b = safe (f a b)
955+ where g a b = safe (f a b)
1016{-# INLINE scanl #-}
956{-# INLINE scanl #-}
1018-- | /O(n)/ 'scanl1' is a variant of 'scanl' that has no starting
958-- | /O(n)/ 'scanl1' is a variant of 'scanl' that has no starting
@@ -1021,9 +961,8 @@ scanl = coerce JSS.scanl
1022-- > scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]
962-- > scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]
1023scanl1 :: (Char -> Char -> Char) -> Text -> Text
963scanl1 :: (Char -> Char -> Char) -> Text -> Text
1024−scanl1 = coerce JSS.scanl1
1025−-- scanl1 f t | null t = empty
964+scanl1 f t | null t = empty
1026−-- | otherwise = scanl f (unsafeHead t) (unsafeTail t)
965+ | otherwise = scanl f (unsafeHead t) (unsafeTail t)
1027{-# INLINE scanl1 #-}
966{-# INLINE scanl1 #-}
1029-- | /O(n)/ 'scanr' is the right-to-left dual of 'scanl'. Performs
968-- | /O(n)/ 'scanr' is the right-to-left dual of 'scanl'. Performs
@@ -1031,18 +970,16 @@ scanl1 = coerce JSS.scanl1
1032-- > scanr f v == reverse . scanl (flip f) v . reverse
971-- > scanr f v == reverse . scanl (flip f) v . reverse
1033scanr :: (Char -> Char -> Char) -> Char -> Text -> Text
972scanr :: (Char -> Char -> Char) -> Char -> Text -> Text
1034−scanr = coerce JSS.scanr
1035−-- scanr f z = S.reverse . S.reverseScanr g z . reverseStream
973+scanr f z = S.reverse . S.reverseScanr g z . reverseStream
1036−-- where g a b = safe (f a b)
974+ where g a b = safe (f a b)
1037{-# INLINE scanr #-}
975{-# INLINE scanr #-}
1039-- | /O(n)/ 'scanr1' is a variant of 'scanr' that has no starting
977-- | /O(n)/ 'scanr1' is a variant of 'scanr' that has no starting
1040-- value argument. Subject to fusion. Performs replacement on
978-- value argument. Subject to fusion. Performs replacement on
1041-- invalid scalar values.
979-- invalid scalar values.
1042scanr1 :: (Char -> Char -> Char) -> Text -> Text
980scanr1 :: (Char -> Char -> Char) -> Text -> Text
1043−scanr1 = coerce JSS.scanr1
1044−-- scanr1 f t | null t = empty
981+scanr1 f t | null t = empty
1045−-- | otherwise = scanr f (last t) (init t)
982+ | otherwise = scanr f (last t) (init t)
1046{-# INLINE scanr1 #-}
983{-# INLINE scanr1 #-}
1048-- | /O(n)/ Like a combination of 'map' and 'foldl''. Applies a
985-- | /O(n)/ Like a combination of 'map' and 'foldl''. Applies a
@@ -1050,11 +987,8 @@ scanr1 = coerce JSS.scanr1
1050-- parameter from left to right, and returns a final 'Text'. Performs
987-- parameter from left to right, and returns a final 'Text'. Performs
1051-- replacement on invalid scalar values.
988-- replacement on invalid scalar values.
1052mapAccumL :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
989mapAccumL :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
1053−mapAccumL f z0 (Text a) =
1054− let (a', t) = JSS.mapAccumL f z0 a
1056−-- mapAccumL f z0 = S.mapAccumL g z0 . stream
990+mapAccumL f z0 = S.mapAccumL g z0 . stream
1057−-- where g a b = second safe (f a b)
991+ where g a b = second safe (f a b)
1058{-# INLINE mapAccumL #-}
992{-# INLINE mapAccumL #-}
1060-- | The 'mapAccumR' function behaves like a combination of 'map' and
994-- | The 'mapAccumR' function behaves like a combination of 'map' and
@@ -1064,11 +998,8 @@ mapAccumL f z0 (Text a) =
1064-- 'Text'.
998-- 'Text'.
1065-- Performs replacement on invalid scalar values.
999-- Performs replacement on invalid scalar values.
1066mapAccumR :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
1000mapAccumR :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
1067−mapAccumR f z0 (Text a) =
1068− let (a', t) = JSS.mapAccumR f z0 a
1070−-- mapAccumR f z0 = second reverse . S.mapAccumL g z0 . reverseStream
1001+mapAccumR f z0 = second reverse . S.mapAccumL g z0 . reverseStream
1071−-- where g a b = second safe (f a b)
1002+ where g a b = second safe (f a b)
1072{-# INLINE mapAccumR #-}
1003{-# INLINE mapAccumR #-}
1074-- -----------------------------------------------------------------------------
1005-- -----------------------------------------------------------------------------
@@ -1077,33 +1008,32 @@ mapAccumR f z0 (Text a) =
1077-- | /O(n*m)/ 'replicate' @n@ @t@ is a 'Text' consisting of the input
1008-- | /O(n*m)/ 'replicate' @n@ @t@ is a 'Text' consisting of the input
1078-- @t@ repeated @n@ times.
1009-- @t@ repeated @n@ times.
1079replicate :: Int -> Text -> Text
1010replicate :: Int -> Text -> Text
1080−replicate = coerce JSS.replicate
1081−-- replicate n t@(Text a o l)
1011+replicate n t@(Text a o l)
1082−-- | n <= 0 || l <= 0 = empty
1012+ | n <= 0 || l <= 0 = empty
1083−-- | n == 1 = t
1013+ | n == 1 = t
1084−-- | isSingleton t = replicateChar n (unsafeHead t)
1014+ | isSingleton t = replicateChar n (unsafeHead t)
1085−-- | otherwise = Text (A.run x) 0 len
1015+ | otherwise = Text (A.run x) 0 len
1087−-- len = l `mul` n
1017+ len = l `mul` n
1088−-- x :: ST s (A.MArray s)
1018+ x :: ST s (A.MArray s)
1089−-- x = do
1019+ x = do
1090−-- arr <- A.new len
1020+ arr <- A.new len
1091−-- let loop !d !i | i >= n = return arr
1021+ let loop !d !i | i >= n = return arr
1092−-- | otherwise = let m = d + l
1022+ | otherwise = let m = d + l
1093−-- in A.copyI arr d a o m >> loop m (i+1)
1023+ in A.copyI arr d a o m >> loop m (i+1)
1094−-- loop 0 0
1024+ loop 0 0
1095{-# INLINE [1] replicate #-}
1025{-# INLINE [1] replicate #-}
1097−-- {-# RULES
1027+{-# RULES
1098−-- "TEXT replicate/singleton -> replicateChar" [~1] forall n c.
1028+"TEXT replicate/singleton -> replicateChar" [~1] forall n c.
1099−-- replicate n (singleton c) = replicateChar n c
1029+ replicate n (singleton c) = replicateChar n c
1102-- | /O(n)/ 'replicateChar' @n@ @c@ is a 'Text' of length @n@ with @c@ the
1032-- | /O(n)/ 'replicateChar' @n@ @c@ is a 'Text' of length @n@ with @c@ the
1103-- value of every element. Subject to fusion.
1033-- value of every element. Subject to fusion.
1104−-- replicateChar :: Int -> Char -> Text
1034+replicateChar :: Int -> Char -> Text
1105−-- replicateChar n c = unstream (S.replicateCharI n (safe c))
1035+replicateChar n c = unstream (S.replicateCharI n (safe c))
1106−-- {-# INLINE replicateChar #-}
1036+{-# INLINE replicateChar #-}
1108-- | /O(n)/, where @n@ is the length of the result. The 'unfoldr'
1038-- | /O(n)/, where @n@ is the length of the result. The 'unfoldr'
1109-- function is analogous to the List 'L.unfoldr'. 'unfoldr' builds a
1039-- function is analogous to the List 'L.unfoldr'. 'unfoldr' builds a
@@ -1113,8 +1043,7 @@ replicate = coerce JSS.replicate
1113-- string, and @b@ is the seed value for further production. Subject
1043-- string, and @b@ is the seed value for further production. Subject
1114-- to fusion. Performs replacement on invalid scalar values.
1044-- to fusion. Performs replacement on invalid scalar values.
1115unfoldr :: (a -> Maybe (Char,a)) -> a -> Text
1045unfoldr :: (a -> Maybe (Char,a)) -> a -> Text
1116−unfoldr f a = Text $ JSS.unfoldr f a
1117−-- unfoldr f s = unstream (S.unfoldr (firstf safe . f) s)
1046+unfoldr f s = unstream (S.unfoldr (firstf safe . f) s)
1118{-# INLINE unfoldr #-}
1047{-# INLINE unfoldr #-}
1120-- | /O(n)/ Like 'unfoldr', 'unfoldrN' builds a 'Text' from a seed
1049-- | /O(n)/ Like 'unfoldr', 'unfoldrN' builds a 'Text' from a seed
@@ -1124,8 +1053,7 @@ unfoldr f a = Text $ JSS.unfoldr f a
1124-- correct, otherwise its performance is similar to 'unfoldr'. Subject
1053-- correct, otherwise its performance is similar to 'unfoldr'. Subject
1125-- to fusion. Performs replacement on invalid scalar values.
1054-- to fusion. Performs replacement on invalid scalar values.
1126unfoldrN :: Int -> (a -> Maybe (Char,a)) -> a -> Text
1055unfoldrN :: Int -> (a -> Maybe (Char,a)) -> a -> Text
1127−unfoldrN n f a0 = Text $ JSS.unfoldrN n f a0
1128−-- unfoldrN n f s = unstream (S.unfoldrN n (firstf safe . f) s)
1056+unfoldrN n f s = unstream (S.unfoldrN n (firstf safe . f) s)
1129{-# INLINE unfoldrN #-}
1057{-# INLINE unfoldrN #-}
1131-- -----------------------------------------------------------------------------
1059-- -----------------------------------------------------------------------------
@@ -1135,26 +1063,25 @@ unfoldrN n f a0 = Text $ JSS.unfoldrN n f a0
1135-- 'Text' of length @n@, or the 'Text' itself if @n@ is greater than
1063-- 'Text' of length @n@, or the 'Text' itself if @n@ is greater than
1136-- the length of the Text. Subject to fusion.
1064-- the length of the Text. Subject to fusion.
1137take :: Int -> Text -> Text
1065take :: Int -> Text -> Text
1138−take = coerce JSS.take
1139−-- take n t@(Text arr off len)
1066+take n t@(Text arr off len)
1140−-- | n <= 0 = empty
1067+ | n <= 0 = empty
1141−-- | n >= len = t
1068+ | n >= len = t
1142−-- | otherwise = text arr off (iterN n t)
1069+ | otherwise = text arr off (iterN n t)
1143{-# INLINE [1] take #-}
1070{-# INLINE [1] take #-}
1145−-- iterN :: Int -> Text -> Int
1072+iterN :: Int -> Text -> Int
1146−-- iterN n t@(Text _arr _off len) = loop 0 0
1073+iterN n t@(Text _arr _off len) = loop 0 0
1147−-- where loop !i !cnt
1074+ where loop !i !cnt
1148−-- | i >= len || cnt >= n = i
1075+ | i >= len || cnt >= n = i
1149−-- | otherwise = loop (i+d) (cnt+1)
1076+ | otherwise = loop (i+d) (cnt+1)
1150−-- where d = iter_ t i
1077+ where d = iter_ t i
1152−-- {-# RULES
1079+{-# RULES
1153−-- "TEXT take -> fused" [~1] forall n t.
1080+"TEXT take -> fused" [~1] forall n t.
1154−-- take n t = unstream (S.take n (stream t))
1081+ take n t = unstream (S.take n (stream t))
1155−-- "TEXT take -> unfused" [1] forall n t.
1082+"TEXT take -> unfused" [1] forall n t.
1156−-- unstream (S.take n (stream t)) = take n t
1083+ unstream (S.take n (stream t)) = take n t
1159-- | /O(n)/ 'takeEnd' @n@ @t@ returns the suffix remaining after
1086-- | /O(n)/ 'takeEnd' @n@ @t@ returns the suffix remaining after
1160-- taking @n@ characters from the end of @t@.
1087-- taking @n@ characters from the end of @t@.
@@ -1163,39 +1090,37 @@ take = coerce JSS.take
1164-- > takeEnd 3 "foobar" == "bar"
1091-- > takeEnd 3 "foobar" == "bar"
1165takeEnd :: Int -> Text -> Text
1092takeEnd :: Int -> Text -> Text
1166−takeEnd = coerce JSS.takeEnd
1167−-- takeEnd n t@(Text arr off len)
1093+takeEnd n t@(Text arr off len)
1168−-- | n <= 0 = empty
1094+ | n <= 0 = empty
1169−-- | n >= len = t
1095+ | n >= len = t
1170−-- | otherwise = text arr (off+i) (len-i)
1096+ | otherwise = text arr (off+i) (len-i)
1171−-- where i = iterNEnd n t
1097+ where i = iterNEnd n t
1173−-- iterNEnd :: Int -> Text -> Int
1099+iterNEnd :: Int -> Text -> Int
1174−-- iterNEnd n t@(Text _arr _off len) = loop (len-1) n
1100+iterNEnd n t@(Text _arr _off len) = loop (len-1) n
1175−-- where loop i !m
1101+ where loop i !m
1176−-- | i <= 0 = 0
1102+ | i <= 0 = 0
1177−-- | m <= 1 = i
1103+ | m <= 1 = i
1178−-- | otherwise = loop (i+d) (m-1)
1104+ | otherwise = loop (i+d) (m-1)
1179−-- where d = reverseIter_ t i
1105+ where d = reverseIter_ t i
1181-- | /O(n)/ 'drop' @n@, applied to a 'Text', returns the suffix of the
1107-- | /O(n)/ 'drop' @n@, applied to a 'Text', returns the suffix of the
1182-- 'Text' after the first @n@ characters, or the empty 'Text' if @n@
1108-- 'Text' after the first @n@ characters, or the empty 'Text' if @n@
1183-- is greater than the length of the 'Text'. Subject to fusion.
1109-- is greater than the length of the 'Text'. Subject to fusion.
1184drop :: Int -> Text -> Text
1110drop :: Int -> Text -> Text
1185−drop = coerce JSS.drop
1186−-- drop n t@(Text arr off len)
1111+drop n t@(Text arr off len)
1187−-- | n <= 0 = t
1112+ | n <= 0 = t
1188−-- | n >= len = empty
1113+ | n >= len = empty
1189−-- | otherwise = text arr (off+i) (len-i)
1114+ | otherwise = text arr (off+i) (len-i)
1190−-- where i = iterN n t
1115+ where i = iterN n t
1191{-# INLINE [1] drop #-}
1116{-# INLINE [1] drop #-}
1193−-- {-# RULES
1118+{-# RULES
1194−-- "TEXT drop -> fused" [~1] forall n t.
1119+"TEXT drop -> fused" [~1] forall n t.
1195−-- drop n t = unstream (S.drop n (stream t))
1120+ drop n t = unstream (S.drop n (stream t))
1196−-- "TEXT drop -> unfused" [1] forall n t.
1121+"TEXT drop -> unfused" [1] forall n t.
1197−-- unstream (S.drop n (stream t)) = drop n t
1122+ unstream (S.drop n (stream t)) = drop n t
1200-- | /O(n)/ 'dropEnd' @n@ @t@ returns the prefix remaining after
1125-- | /O(n)/ 'dropEnd' @n@ @t@ returns the prefix remaining after
1201-- dropping @n@ characters from the end of @t@.
1126-- dropping @n@ characters from the end of @t@.
@@ -1204,30 +1129,28 @@ drop = coerce JSS.drop
1205-- > dropEnd 3 "foobar" == "foo"
1130-- > dropEnd 3 "foobar" == "foo"
1206dropEnd :: Int -> Text -> Text
1131dropEnd :: Int -> Text -> Text
1207−dropEnd = coerce JSS.dropEnd
1208−-- dropEnd n t@(Text arr off len)
1132+dropEnd n t@(Text arr off len)
1209−-- | n <= 0 = t
1133+ | n <= 0 = t
1210−-- | n >= len = empty
1134+ | n >= len = empty
1211−-- | otherwise = text arr off (iterNEnd n t)
1135+ | otherwise = text arr off (iterNEnd n t)
1213-- | /O(n)/ 'takeWhile', applied to a predicate @p@ and a 'Text',
1137-- | /O(n)/ 'takeWhile', applied to a predicate @p@ and a 'Text',
1214-- returns the longest prefix (possibly empty) of elements that
1138-- returns the longest prefix (possibly empty) of elements that
1215-- satisfy @p@. Subject to fusion.
1139-- satisfy @p@. Subject to fusion.
1216takeWhile :: (Char -> Bool) -> Text -> Text
1140takeWhile :: (Char -> Bool) -> Text -> Text
1217−takeWhile = coerce JSS.takeWhile
1218−-- takeWhile p t@(Text arr off len) = loop 0
1141+takeWhile p t@(Text arr off len) = loop 0
1219−-- where loop !i | i >= len = t
1142+ where loop !i | i >= len = t
1220−-- | p c = loop (i+d)
1143+ | p c = loop (i+d)
1221−-- | otherwise = text arr off i
1144+ | otherwise = text arr off i
1222−-- where Iter c d = iter t i
1145+ where Iter c d = iter t i
1223{-# INLINE [1] takeWhile #-}
1146{-# INLINE [1] takeWhile #-}
1225−-- {-# RULES
1148+{-# RULES
1226−-- "TEXT takeWhile -> fused" [~1] forall p t.
1149+"TEXT takeWhile -> fused" [~1] forall p t.
1227−-- takeWhile p t = unstream (S.takeWhile p (stream t))
1150+ takeWhile p t = unstream (S.takeWhile p (stream t))
1228−-- "TEXT takeWhile -> unfused" [1] forall p t.
1151+"TEXT takeWhile -> unfused" [1] forall p t.
1229−-- unstream (S.takeWhile p (stream t)) = takeWhile p t
1152+ unstream (S.takeWhile p (stream t)) = takeWhile p t
1232-- | /O(n)/ 'takeWhileEnd', applied to a predicate @p@ and a 'Text',
1155-- | /O(n)/ 'takeWhileEnd', applied to a predicate @p@ and a 'Text',
1233-- returns the longest suffix (possibly empty) of elements that
1156-- returns the longest suffix (possibly empty) of elements that
@@ -1236,39 +1159,36 @@ takeWhile = coerce JSS.takeWhile
1237-- > takeWhileEnd (=='o') "foo" == "oo"
1160-- > takeWhileEnd (=='o') "foo" == "oo"
1238takeWhileEnd :: (Char -> Bool) -> Text -> Text
1161takeWhileEnd :: (Char -> Bool) -> Text -> Text
1239−takeWhileEnd = P.undefined -- TODO
1240−-- takeWhileEnd :: (Char -> Bool) -> Text -> Text
1241−-- takeWhileEnd p t@(Text arr off len) = loop (len-1) len
1162+takeWhileEnd p t@(Text arr off len) = loop (len-1) len
1242−-- where loop !i !l | l <= 0 = t
1163+ where loop !i !l | l <= 0 = t
1243−-- | p c = loop (i+d) (l+d)
1164+ | p c = loop (i+d) (l+d)
1244−-- | otherwise = text arr (off+l) (len-l)
1165+ | otherwise = text arr (off+l) (len-l)
1245−-- where (c,d) = reverseIter t i
1166+ where (c,d) = reverseIter t i
1246{-# INLINE [1] takeWhileEnd #-}
1167{-# INLINE [1] takeWhileEnd #-}
1248−-- {-# RULES
1169+{-# RULES
1249−-- "TEXT takeWhileEnd -> fused" [~1] forall p t.
1170+"TEXT takeWhileEnd -> fused" [~1] forall p t.
1250−-- takeWhileEnd p t = S.reverse (S.takeWhile p (S.reverseStream t))
1171+ takeWhileEnd p t = S.reverse (S.takeWhile p (S.reverseStream t))
1251−-- "TEXT takeWhileEnd -> unfused" [1] forall p t.
1172+"TEXT takeWhileEnd -> unfused" [1] forall p t.
1252−-- S.reverse (S.takeWhile p (S.reverseStream t)) = takeWhileEnd p t
1173+ S.reverse (S.takeWhile p (S.reverseStream t)) = takeWhileEnd p t
1255-- | /O(n)/ 'dropWhile' @p@ @t@ returns the suffix remaining after
1176-- | /O(n)/ 'dropWhile' @p@ @t@ returns the suffix remaining after
1256-- 'takeWhile' @p@ @t@. Subject to fusion.
1177-- 'takeWhile' @p@ @t@. Subject to fusion.
1257dropWhile :: (Char -> Bool) -> Text -> Text
1178dropWhile :: (Char -> Bool) -> Text -> Text
1258−dropWhile = coerce JSS.dropWhile
1259−-- dropWhile p t@(Text arr off len) = loop 0 0
1179+dropWhile p t@(Text arr off len) = loop 0 0
1260−-- where loop !i !l | l >= len = empty
1180+ where loop !i !l | l >= len = empty
1261−-- | p c = loop (i+d) (l+d)
1181+ | p c = loop (i+d) (l+d)
1262−-- | otherwise = Text arr (off+i) (len-l)
1182+ | otherwise = Text arr (off+i) (len-l)
1263−
1183+ where Iter c d = iter t i
1264{-# INLINE [1] dropWhile #-}
1184{-# INLINE [1] dropWhile #-}
1266−-- {-# RULES
1186+{-# RULES
1267−-- "TEXT dropWhile -> fused" [~1] forall p t.
1187+"TEXT dropWhile -> fused" [~1] forall p t.
1268−-- dropWhile p t = unstream (S.dropWhile p (stream t))
1188+ dropWhile p t = unstream (S.dropWhile p (stream t))
1269−-- "TEXT dropWhile -> unfused" [1] forall p t.
1189+"TEXT dropWhile -> unfused" [1] forall p t.
1270−-- unstream (S.dropWhile p (stream t)) = dropWhile p t
1190+ unstream (S.dropWhile p (stream t)) = dropWhile p t
1273-- | /O(n)/ 'dropWhileEnd' @p@ @t@ returns the prefix remaining after
1193-- | /O(n)/ 'dropWhileEnd' @p@ @t@ returns the prefix remaining after
1274-- dropping characters that satisfy the predicate @p@ from the end of
1194-- dropping characters that satisfy the predicate @p@ from the end of
@@ -1278,20 +1198,19 @@ dropWhile = coerce JSS.dropWhile
1279-- > dropWhileEnd (=='.') "foo..." == "foo"
1199-- > dropWhileEnd (=='.') "foo..." == "foo"
1280dropWhileEnd :: (Char -> Bool) -> Text -> Text
1200dropWhileEnd :: (Char -> Bool) -> Text -> Text
1281−dropWhileEnd = coerce JSS.dropWhileEnd
1282−-- dropWhileEnd p t@(Text arr off len) = loop (len-1) len
1201+dropWhileEnd p t@(Text arr off len) = loop (len-1) len
1283−-- where loop !i !l | l <= 0 = empty
1202+ where loop !i !l | l <= 0 = empty
1284−-- | p c = loop (i+d) (l+d)
1203+ | p c = loop (i+d) (l+d)
1285−-- | otherwise = Text arr off l
1204+ | otherwise = Text arr off l
1286−-- where (c,d) = reverseIter t i
1205+ where (c,d) = reverseIter t i
1287{-# INLINE [1] dropWhileEnd #-}
1206{-# INLINE [1] dropWhileEnd #-}
1289−-- {-# RULES
1208+{-# RULES
1290−-- "TEXT dropWhileEnd -> fused" [~1] forall p t.
1209+"TEXT dropWhileEnd -> fused" [~1] forall p t.
1291−-- dropWhileEnd p t = S.reverse (S.dropWhile p (S.reverseStream t))
1210+ dropWhileEnd p t = S.reverse (S.dropWhile p (S.reverseStream t))
1292−-- "TEXT dropWhileEnd -> unfused" [1] forall p t.
1211+"TEXT dropWhileEnd -> unfused" [1] forall p t.
1293−-- S.reverse (S.dropWhile p (S.reverseStream t)) = dropWhileEnd p t
1212+ S.reverse (S.dropWhile p (S.reverseStream t)) = dropWhileEnd p t
1296-- | /O(n)/ 'dropAround' @p@ @t@ returns the substring remaining after
1215-- | /O(n)/ 'dropAround' @p@ @t@ returns the substring remaining after
1297-- dropping characters that satisfy the predicate @p@ from both the
1216-- dropping characters that satisfy the predicate @p@ from both the
@@ -1326,49 +1245,45 @@ strip = dropAround isSpace
1326-- prefix of @t@ of length @n@, and whose second is the remainder of
1245-- prefix of @t@ of length @n@, and whose second is the remainder of
1327-- the string. It is equivalent to @('take' n t, 'drop' n t)@.
1246-- the string. It is equivalent to @('take' n t, 'drop' n t)@.
1328splitAt :: Int -> Text -> (Text, Text)
1247splitAt :: Int -> Text -> (Text, Text)
1329−splitAt = coerce JSS.splitAt
1330−-- splitAt n t@(Text arr off len)
1248+splitAt n t@(Text arr off len)
1331−-- | n <= 0 = (empty, t)
1249+ | n <= 0 = (empty, t)
1332−-- | n >= len = (t, empty)
1250+ | n >= len = (t, empty)
1333−-- | otherwise = let k = iterN n t
1251+ | otherwise = let k = iterN n t
1334−-- in (text arr off k, text arr (off+k) (len-k))
1252+ in (text arr off k, text arr (off+k) (len-k))
1336-- | /O(n)/ 'span', applied to a predicate @p@ and text @t@, returns
1254-- | /O(n)/ 'span', applied to a predicate @p@ and text @t@, returns
1337-- a pair whose first element is the longest prefix (possibly empty)
1255-- a pair whose first element is the longest prefix (possibly empty)
1338-- of @t@ of elements that satisfy @p@, and whose second is the
1256-- of @t@ of elements that satisfy @p@, and whose second is the
1339-- remainder of the list.
1257-- remainder of the list.
1340span :: (Char -> Bool) -> Text -> (Text, Text)
1258span :: (Char -> Bool) -> Text -> (Text, Text)
1341−span = coerce JSS.span
1342−-- span p t = case span_ p t of
1259+span p t = case span_ p t of
1343−-- (# hd,tl #) -> (hd,tl)
1260+ (# hd,tl #) -> (hd,tl)
1344{-# INLINE span #-}
1261{-# INLINE span #-}
1346-- | /O(n)/ 'break' is like 'span', but the prefix returned is
1263-- | /O(n)/ 'break' is like 'span', but the prefix returned is
1347-- over elements that fail the predicate @p@.
1264-- over elements that fail the predicate @p@.
1348break :: (Char -> Bool) -> Text -> (Text, Text)
1265break :: (Char -> Bool) -> Text -> (Text, Text)
1349−break = coerce JSS.break
1350−-- break p = span (not . p)
1266+break p = span (not . p)
1351{-# INLINE break #-}
1267{-# INLINE break #-}
1353-- | /O(n)/ Group characters in a string according to a predicate.
1269-- | /O(n)/ Group characters in a string according to a predicate.
1354groupBy :: (Char -> Char -> Bool) -> Text -> [Text]
1270groupBy :: (Char -> Char -> Bool) -> Text -> [Text]
1355−groupBy = coerce JSS.groupBy
1356−-- groupBy p = loop
1271+groupBy p = loop
1358−-- loop t@(Text arr off len)
1273+ loop t@(Text arr off len)
1359−-- | null t = []
1274+ | null t = []
1360−-- | otherwise = text arr off n : loop (text arr (off+n) (len-n))
1275+ | otherwise = text arr off n : loop (text arr (off+n) (len-n))
1361−-- where Iter c d = iter t 0
1276+ where Iter c d = iter t 0
1362−-- n = d + findAIndexOrEnd (not . p c) (Text arr (off+d) (len-d))
1277+ n = d + findAIndexOrEnd (not . p c) (Text arr (off+d) (len-d))
1364-- | Returns the /array/ index (in units of 'Word16') at which a
1279-- | Returns the /array/ index (in units of 'Word16') at which a
1365-- character may be found. This is /not/ the same as the logical
1280-- character may be found. This is /not/ the same as the logical
1366-- index returned by e.g. 'findIndex'.
1281-- index returned by e.g. 'findIndex'.
1367−-- findAIndexOrEnd :: (Char -> Bool) -> Text -> Int
1282+findAIndexOrEnd :: (Char -> Bool) -> Text -> Int
1368−-- findAIndexOrEnd q t@(Text _arr _off len) = go 0
1283+findAIndexOrEnd q t@(Text _arr _off len) = go 0
1369−-- where go !i | i >= len || q c = i
1284+ where go !i | i >= len || q c = i
1370−-- | otherwise = go (i+d)
1285+ | otherwise = go (i+d)
1371−-- where Iter c d = iter t i
1286+ where Iter c d = iter t i
1373-- | /O(n)/ Group characters in a string by equality.
1288-- | /O(n)/ Group characters in a string by equality.
1374group :: Text -> [Text]
1289group :: Text -> [Text]
@@ -1377,17 +1292,15 @@ group = groupBy (==)
1377-- | /O(n)/ Return all initial segments of the given 'Text', shortest
1292-- | /O(n)/ Return all initial segments of the given 'Text', shortest
1378-- first.
1293-- first.
1379inits :: Text -> [Text]
1294inits :: Text -> [Text]
1380−inits = coerce JSS.inits
1381−-- inits t@(Text arr off len) = loop 0
1295+inits t@(Text arr off len) = loop 0
1382−-- where loop i | i >= len = [t]
1296+ where loop i | i >= len = [t]
1383−-- | otherwise = Text arr off i : loop (i + iter_ t i)
1297+ | otherwise = Text arr off i : loop (i + iter_ t i)
1385-- | /O(n)/ Return all final segments of the given 'Text', longest
1299-- | /O(n)/ Return all final segments of the given 'Text', longest
1386-- first.
1300-- first.
1387tails :: Text -> [Text]
1301tails :: Text -> [Text]
1388−tails = coerce JSS.tails
1389−-- tails t | null t = [empty]
1302+tails t | null t = [empty]
1390−-- | otherwise = t : tails (unsafeTail t)
1303+ | otherwise = t : tails (unsafeTail t)
1392-- $split
1305-- $split
@@ -1420,20 +1333,19 @@ splitOn :: Text
1421 -- ^ Input text.
1334 -- ^ Input text.
1422 -> [Text]
1335 -> [Text]
1423−splitOn = coerce JSS.splitOn
1424−-- splitOn pat@(Text _ _ l) src@(Text arr off len)
1336+splitOn pat@(Text _ _ l) src@(Text arr off len)
1425−-- | l <= 0 = emptyError "splitOn"
1337+ | l <= 0 = emptyError "splitOn"
1426−-- | isSingleton pat = split (== unsafeHead pat) src
1338+ | isSingleton pat = split (== unsafeHead pat) src
1427−-- | otherwise = go 0 (indices pat src)
1339+ | otherwise = go 0 (indices pat src)
1429−-- go !s (x:xs) = text arr (s+off) (x-s) : go (x+l) xs
1341+ go !s (x:xs) = text arr (s+off) (x-s) : go (x+l) xs
1430−-- go s _ = [text arr (s+off) (len-s)]
1342+ go s _ = [text arr (s+off) (len-s)]
1431{-# INLINE [1] splitOn #-}
1343{-# INLINE [1] splitOn #-}
1433−-- {-# RULES
1345+{-# RULES
1434−-- "TEXT splitOn/singleton -> split/==" [~1] forall c t.
1346+"TEXT splitOn/singleton -> split/==" [~1] forall c t.
1435−-- splitOn (singleton c) t = split (==c) t
1347+ splitOn (singleton c) t = split (==c) t
1438-- | /O(n)/ Splits a 'Text' into components delimited by separators,
1350-- | /O(n)/ Splits a 'Text' into components delimited by separators,
1439-- where the predicate returns True for a separator element. The
1351-- where the predicate returns True for a separator element. The
@@ -1443,12 +1355,11 @@ splitOn = coerce JSS.splitOn
1443-- > split (=='a') "aabbaca" == ["","","bb","c",""]
1355-- > split (=='a') "aabbaca" == ["","","bb","c",""]
1444-- > split (=='a') "" == [""]
1356-- > split (=='a') "" == [""]
1445split :: (Char -> Bool) -> Text -> [Text]
1357split :: (Char -> Bool) -> Text -> [Text]
1446−split = coerce JSS.split
1447−-- split _ t@(Text _off _arr 0) = [t]
1358+split _ t@(Text _off _arr 0) = [t]
1448−-- split p t = loop t
1359+split p t = loop t
1449−-- where loop s | null s' = [l]
1360+ where loop s | null s' = [l]
1450−-- | otherwise = l : loop (unsafeTail s')
1361+ | otherwise = l : loop (unsafeTail s')
1451−-- where (# l, s' #) = span_ (not . p) s
1362+ where (# l, s' #) = span_ (not . p) s
1452{-# INLINE split #-}
1363{-# INLINE split #-}
1454-- | /O(n)/ Splits a 'Text' into components of length @k@. The last
1365-- | /O(n)/ Splits a 'Text' into components of length @k@. The last
@@ -1458,12 +1369,11 @@ split = coerce JSS.split
1458-- > chunksOf 3 "foobarbaz" == ["foo","bar","baz"]
1369-- > chunksOf 3 "foobarbaz" == ["foo","bar","baz"]
1459-- > chunksOf 4 "haskell.org" == ["hask","ell.","org"]
1370-- > chunksOf 4 "haskell.org" == ["hask","ell.","org"]
1460chunksOf :: Int -> Text -> [Text]
1371chunksOf :: Int -> Text -> [Text]
1461−chunksOf = coerce JSS.chunksOf
1372+chunksOf k = go
1464−-- go t = case splitAt k t of
1374+ go t = case splitAt k t of
1465−-- (a,b) | null a -> []
1375+ (a,b) | null a -> []
1466−-- | otherwise -> a : go b
1376+ | otherwise -> a : go b
1467{-# INLINE chunksOf #-}
1377{-# INLINE chunksOf #-}
1469-- ----------------------------------------------------------------------------
1379-- ----------------------------------------------------------------------------
@@ -1476,8 +1386,7 @@ chunksOf = coerce JSS.chunksOf
1476-- returns the first element matching the predicate, or 'Nothing' if
1386-- returns the first element matching the predicate, or 'Nothing' if
1477-- there is no such element.
1387-- there is no such element.
1478find :: (Char -> Bool) -> Text -> Maybe Char
1388find :: (Char -> Bool) -> Text -> Maybe Char
1479−find = coerce JSS.find
1480−-- find p t = S.findBy p (stream t)
1389+find p t = S.findBy p (stream t)
1481{-# INLINE find #-}
1390{-# INLINE find #-}
1483-- | /O(n)/ The 'partition' function takes a predicate and a 'Text',
1392-- | /O(n)/ The 'partition' function takes a predicate and a 'Text',
@@ -1486,16 +1395,14 @@ find = coerce JSS.find
1487-- > partition p t == (filter p t, filter (not . p) t)
1396-- > partition p t == (filter p t, filter (not . p) t)
1488partition :: (Char -> Bool) -> Text -> (Text, Text)
1397partition :: (Char -> Bool) -> Text -> (Text, Text)
1489−partition = coerce JSS.partition
1490−-- partition p t = (filter p t, filter (not . p) t)
1398+partition p t = (filter p t, filter (not . p) t)
1491{-# INLINE partition #-}
1399{-# INLINE partition #-}
1493-- | /O(n)/ 'filter', applied to a predicate and a 'Text',
1401-- | /O(n)/ 'filter', applied to a predicate and a 'Text',
1494-- returns a 'Text' containing those characters that satisfy the
1402-- returns a 'Text' containing those characters that satisfy the
1495-- predicate.
1403-- predicate.
1496filter :: (Char -> Bool) -> Text -> Text
1404filter :: (Char -> Bool) -> Text -> Text
1497−filter = coerce JSS.filter
1498−-- filter p t = unstream (S.filter p (stream t))
1405+filter p t = unstream (S.filter p (stream t))
1499{-# INLINE filter #-}
1406{-# INLINE filter #-}
1501-- | /O(n+m)/ Find the first instance of @needle@ (which must be
1408-- | /O(n+m)/ Find the first instance of @needle@ (which must be
@@ -1520,12 +1427,11 @@ filter = coerce JSS.filter
1520-- In (unlikely) bad cases, this function's time complexity degrades
1427-- In (unlikely) bad cases, this function's time complexity degrades
1521-- towards /O(n*m)/.
1428-- towards /O(n*m)/.
1522breakOn :: Text -> Text -> (Text, Text)
1429breakOn :: Text -> Text -> (Text, Text)
1523−breakOn = coerce JSS.breakOn
1524−-- breakOn pat src@(Text arr off len)
1430+breakOn pat src@(Text arr off len)
1525−-- | null pat = emptyError "breakOn"
1431+ | null pat = emptyError "breakOn"
1526−-- | otherwise = case indices pat src of
1432+ | otherwise = case indices pat src of
1527−-- [] -> (src, empty)
1433+ [] -> (src, empty)
1528−-- (x:_) -> (text arr off x, text arr (off+x) (len-x))
1434+ (x:_) -> (text arr off x, text arr (off+x) (len-x))
1529{-# INLINE breakOn #-}
1435{-# INLINE breakOn #-}
1531-- | /O(n+m)/ Similar to 'breakOn', but searches from the end of the
1437-- | /O(n+m)/ Similar to 'breakOn', but searches from the end of the
@@ -1537,9 +1443,8 @@ breakOn = coerce JSS.breakOn
1538-- > breakOnEnd "::" "a::b::c" ==> ("a::b::", "c")
1444-- > breakOnEnd "::" "a::b::c" ==> ("a::b::", "c")
1539breakOnEnd :: Text -> Text -> (Text, Text)
1445breakOnEnd :: Text -> Text -> (Text, Text)
1540−breakOnEnd = coerce JSS.breakOnEnd
1541−-- breakOnEnd pat src = (reverse b, reverse a)
1446+breakOnEnd pat src = (reverse b, reverse a)
1542−-- where (a,b) = breakOn (reverse pat) (reverse src)
1447+ where (a,b) = breakOn (reverse pat) (reverse src)
1543{-# INLINE breakOnEnd #-}
1448{-# INLINE breakOnEnd #-}
1545-- | /O(n+m)/ Find all non-overlapping instances of @needle@ in
1450-- | /O(n+m)/ Find all non-overlapping instances of @needle@ in
@@ -1563,13 +1468,12 @@ breakOnEnd = coerce JSS.breakOnEnd
1563breakOnAll :: Text -- ^ @needle@ to search for
1468breakOnAll :: Text -- ^ @needle@ to search for
1564 -> Text -- ^ @haystack@ in which to search
1469 -> Text -- ^ @haystack@ in which to search
1565 -> [(Text, Text)]
1470 -> [(Text, Text)]
1566−breakOnAll = coerce JSS.breakOnAll
1567−-- breakOnAll pat src@(Text arr off slen)
1471+breakOnAll pat src@(Text arr off slen)
1568−-- | null pat = emptyError "breakOnAll"
1472+ | null pat = emptyError "breakOnAll"
1569−-- | otherwise = L.map step (indices pat src)
1473+ | otherwise = L.map step (indices pat src)
1571−-- step x = (chunk 0 x, chunk x (slen-x))
1475+ step x = (chunk 0 x, chunk x (slen-x))
1572−-- chunk !n !l = text arr (n+off) l
1476+ chunk !n !l = text arr (n+off) l
1573{-# INLINE breakOnAll #-}
1477{-# INLINE breakOnAll #-}
1575-------------------------------------------------------------------------------
1479-------------------------------------------------------------------------------
@@ -1593,16 +1497,14 @@ breakOnAll = coerce JSS.breakOnAll
1594-- | /O(n)/ 'Text' index (subscript) operator, starting from 0.
1498-- | /O(n)/ 'Text' index (subscript) operator, starting from 0.
1595index :: Text -> Int -> Char
1499index :: Text -> Int -> Char
1596−index = coerce JSS.index
1597−-- index t n = S.index (stream t) n
1500+index t n = S.index (stream t) n
1598{-# INLINE index #-}
1501{-# INLINE index #-}
1600-- | /O(n)/ The 'findIndex' function takes a predicate and a 'Text'
1503-- | /O(n)/ The 'findIndex' function takes a predicate and a 'Text'
1601-- and returns the index of the first element in the 'Text' satisfying
1504-- and returns the index of the first element in the 'Text' satisfying
1602-- the predicate. Subject to fusion.
1505-- the predicate. Subject to fusion.
1603findIndex :: (Char -> Bool) -> Text -> Maybe Int
1506findIndex :: (Char -> Bool) -> Text -> Maybe Int
1604−findIndex = coerce JSS.findIndex
1605−-- findIndex p t = S.findIndex p (stream t)
1507+findIndex p t = S.findIndex p (stream t)
1606{-# INLINE findIndex #-}
1508{-# INLINE findIndex #-}
1608-- | /O(n+m)/ The 'count' function returns the number of times the
1510-- | /O(n+m)/ The 'count' function returns the number of times the
@@ -1612,23 +1514,22 @@ findIndex = coerce JSS.findIndex
1612-- In (unlikely) bad cases, this function's time complexity degrades
1514-- In (unlikely) bad cases, this function's time complexity degrades
1613-- towards /O(n*m)/.
1515-- towards /O(n*m)/.
1614count :: Text -> Text -> Int
1516count :: Text -> Text -> Int
1615−count = coerce JSS.count
1616−-- count pat src
1517+count pat src
1617−-- | null pat = emptyError "count"
1518+ | null pat = emptyError "count"
1618−-- | isSingleton pat = countChar (unsafeHead pat) src
1519+ | isSingleton pat = countChar (unsafeHead pat) src
1619−-- | otherwise = L.length (indices pat src)
1520+ | otherwise = L.length (indices pat src)
1620{-# INLINE [1] count #-}
1521{-# INLINE [1] count #-}
1622−-- {-# RULES
1523+{-# RULES
1623−-- "TEXT count/singleton -> countChar" [~1] forall c t.
1524+"TEXT count/singleton -> countChar" [~1] forall c t.
1624−-- count (singleton c) t = countChar c t
1525+ count (singleton c) t = countChar c t
1627-- | /O(n)/ The 'countChar' function returns the number of times the
1528-- | /O(n)/ The 'countChar' function returns the number of times the
1628-- query element appears in the given 'Text'. Subject to fusion.
1529-- query element appears in the given 'Text'. Subject to fusion.
1629−-- countChar :: Char -> Text -> Int
1530+countChar :: Char -> Text -> Int
1630−-- countChar c t = S.countChar c (stream t)
1531+countChar c t = S.countChar c (stream t)
1631−-- {-# INLINE countChar #-}
1532+{-# INLINE countChar #-}
1633-------------------------------------------------------------------------------
1534-------------------------------------------------------------------------------
1634-- * Zipping
1535-- * Zipping
@@ -1638,46 +1539,42 @@ count = coerce JSS.count
1638-- excess elements of the longer 'Text' are discarded. This is
1539-- excess elements of the longer 'Text' are discarded. This is
1639-- equivalent to a pair of 'unpack' operations.
1540-- equivalent to a pair of 'unpack' operations.
1640zip :: Text -> Text -> [(Char,Char)]
1541zip :: Text -> Text -> [(Char,Char)]
1641−zip = coerce JSS.zip
1642−-- zip a b = S.unstreamList $ S.zipWith (,) (stream a) (stream b)
1542+zip a b = S.unstreamList $ S.zipWith (,) (stream a) (stream b)
1643{-# INLINE zip #-}
1543{-# INLINE zip #-}
1645-- | /O(n)/ 'zipWith' generalises 'zip' by zipping with the function
1545-- | /O(n)/ 'zipWith' generalises 'zip' by zipping with the function
1646-- given as the first argument, instead of a tupling function.
1546-- given as the first argument, instead of a tupling function.
1647-- Performs replacement on invalid scalar values.
1547-- Performs replacement on invalid scalar values.
1648zipWith :: (Char -> Char -> Char) -> Text -> Text -> Text
1548zipWith :: (Char -> Char -> Char) -> Text -> Text -> Text
1649−zipWith = coerce JSS.zipWith
1650−-- zipWith f t1 t2 = unstream (S.zipWith g (stream t1) (stream t2))
1549+zipWith f t1 t2 = unstream (S.zipWith g (stream t1) (stream t2))
1651−-- where g a b = safe (f a b)
1550+ where g a b = safe (f a b)
1652{-# INLINE zipWith #-}
1551{-# INLINE zipWith #-}
1654-- | /O(n)/ Breaks a 'Text' up into a list of words, delimited by 'Char's
1553-- | /O(n)/ Breaks a 'Text' up into a list of words, delimited by 'Char's
1655-- representing white space.
1554-- representing white space.
1656words :: Text -> [Text]
1555words :: Text -> [Text]
1657−words = coerce JSS.words
1658−-- words t@(Text arr off len) = loop 0 0
1556+words t@(Text arr off len) = loop 0 0
1660−-- loop !start !n
1558+ loop !start !n
1661−-- | n >= len = if start == n
1559+ | n >= len = if start == n
1662−-- then []
1560+ then []
1663−-- else [Text arr (start+off) (n-start)]
1561+ else [Text arr (start+off) (n-start)]
1664−-- | isSpace c =
1562+ | isSpace c =
1665−-- if start == n
1563+ if start == n
1666−-- then loop (start+1) (start+1)
1564+ then loop (start+1) (start+1)
1667−-- else Text arr (start+off) (n-start) : loop (n+d) (n+d)
1565+ else Text arr (start+off) (n-start) : loop (n+d) (n+d)
1668−-- | otherwise = loop start (n+d)
1566+ | otherwise = loop start (n+d)
1669−-- where Iter c d = iter t n
1567+ where Iter c d = iter t n
1670{-# INLINE words #-}
1568{-# INLINE words #-}
1672-- | /O(n)/ Breaks a 'Text' up into a list of 'Text's at
1570-- | /O(n)/ Breaks a 'Text' up into a list of 'Text's at
1673-- newline 'Char's. The resulting strings do not contain newlines.
1571-- newline 'Char's. The resulting strings do not contain newlines.
1674lines :: Text -> [Text]
1572lines :: Text -> [Text]
1675−lines = coerce JSS.lines
1676−-- lines ps | null ps = []
1573+lines ps | null ps = []
1677−-- | otherwise = h : if null t
1574+ | otherwise = h : if null t
1678−-- then []
1575+ then []
1679−-- else lines (unsafeTail t)
1576+ else lines (unsafeTail t)
1680−-- where (# h,t #) = span_ (/= '\n') ps
1577+ where (# h,t #) = span_ (/= '\n') ps
1681{-# INLINE lines #-}
1578{-# INLINE lines #-}
@@ -1705,38 +1602,34 @@ lines' ps | null ps = []
1705-- | /O(n)/ Joins lines, after appending a terminating newline to
1602-- | /O(n)/ Joins lines, after appending a terminating newline to
1707unlines :: [Text] -> Text
1604unlines :: [Text] -> Text
1708−unlines = coerce JSS.unlines
1709−-- unlines = concat . L.map (`snoc` '\n')
1605+unlines = concat . L.map (`snoc` '\n')
1710{-# INLINE unlines #-}
1606{-# INLINE unlines #-}
1712-- | /O(n)/ Joins words using single space characters.
1608-- | /O(n)/ Joins words using single space characters.
1713unwords :: [Text] -> Text
1609unwords :: [Text] -> Text
1714−unwords = coerce JSS.unwords
1715−-- unwords = intercalate (singleton ' ')
1610+unwords = intercalate (singleton ' ')
1716{-# INLINE unwords #-}
1611{-# INLINE unwords #-}
1718-- | /O(n)/ The 'isPrefixOf' function takes two 'Text's and returns
1613-- | /O(n)/ The 'isPrefixOf' function takes two 'Text's and returns
1719-- 'True' iff the first is a prefix of the second. Subject to fusion.
1614-- 'True' iff the first is a prefix of the second. Subject to fusion.
1720isPrefixOf :: Text -> Text -> Bool
1615isPrefixOf :: Text -> Text -> Bool
1721−isPrefixOf = coerce JSS.isPrefixOf
1722−-- isPrefixOf a@(Text _ _ alen) b@(Text _ _ blen) =
1616+isPrefixOf a@(Text _ _ alen) b@(Text _ _ blen) =
1723−-- alen <= blen && S.isPrefixOf (stream a) (stream b)
1617+ alen <= blen && S.isPrefixOf (stream a) (stream b)
1724{-# INLINE [1] isPrefixOf #-}
1618{-# INLINE [1] isPrefixOf #-}
1726−-- {-# RULES
1620+{-# RULES
1727−-- "TEXT isPrefixOf -> fused" [~1] forall s t.
1621+"TEXT isPrefixOf -> fused" [~1] forall s t.
1728−-- isPrefixOf s t = S.isPrefixOf (stream s) (stream t)
1622+ isPrefixOf s t = S.isPrefixOf (stream s) (stream t)
1731-- | /O(n)/ The 'isSuffixOf' function takes two 'Text's and returns
1625-- | /O(n)/ The 'isSuffixOf' function takes two 'Text's and returns
1732-- 'True' iff the first is a suffix of the second.
1626-- 'True' iff the first is a suffix of the second.
1733isSuffixOf :: Text -> Text -> Bool
1627isSuffixOf :: Text -> Text -> Bool
1734−isSuffixOf = coerce JSS.isSuffixOf
1735−-- isSuffixOf a@(Text _aarr _aoff alen) b@(Text barr boff blen) =
1628+isSuffixOf a@(Text _aarr _aoff alen) b@(Text barr boff blen) =
1736−-- d >= 0 && a == b'
1629+ d >= 0 && a == b'
1737−-- where d = blen - alen
1630+ where d = blen - alen
1738−-- b' | d == 0 = b
1631+ b' | d == 0 = b
1739−-- | otherwise = Text barr (boff+d) alen
1632+ | otherwise = Text barr (boff+d) alen
1740{-# INLINE isSuffixOf #-}
1633{-# INLINE isSuffixOf #-}
1742-- | /O(n+m)/ The 'isInfixOf' function takes two 'Text's and returns
1635-- | /O(n+m)/ The 'isInfixOf' function takes two 'Text's and returns
@@ -1746,17 +1639,16 @@ isSuffixOf = coerce JSS.isSuffixOf
1746-- In (unlikely) bad cases, this function's time complexity degrades
1639-- In (unlikely) bad cases, this function's time complexity degrades
1747-- towards /O(n*m)/.
1640-- towards /O(n*m)/.
1748isInfixOf :: Text -> Text -> Bool
1641isInfixOf :: Text -> Text -> Bool
1749−isInfixOf = coerce JSS.isInfixOf
1750−-- isInfixOf needle haystack
1642+isInfixOf needle haystack
1751−-- | null needle = True
1643+ | null needle = True
1752−-- | isSingleton needle = S.elem (unsafeHead needle) . S.stream $ haystack
1644+ | isSingleton needle = S.elem (unsafeHead needle) . S.stream $ haystack
1753−-- | otherwise = not . L.null . indices needle $ haystack
1645+ | otherwise = not . L.null . indices needle $ haystack
1754{-# INLINE [1] isInfixOf #-}
1646{-# INLINE [1] isInfixOf #-}
1756−-- {-# RULES
1648+{-# RULES
1757−-- "TEXT isInfixOf/singleton -> S.elem/S.stream" [~1] forall n h.
1649+"TEXT isInfixOf/singleton -> S.elem/S.stream" [~1] forall n h.
1758−-- isInfixOf (singleton n) h = S.elem n (S.stream h)
1650+ isInfixOf (singleton n) h = S.elem n (S.stream h)
1761-------------------------------------------------------------------------------
1653-------------------------------------------------------------------------------
1762-- * View patterns
1654-- * View patterns
@@ -1780,10 +1672,9 @@ isInfixOf = coerce JSS.isInfixOf
1780-- > fnordLength (stripPrefix "fnord" -> Just suf) = T.length suf
1672-- > fnordLength (stripPrefix "fnord" -> Just suf) = T.length suf
1781-- > fnordLength _ = -1
1673-- > fnordLength _ = -1
1782stripPrefix :: Text -> Text -> Maybe Text
1674stripPrefix :: Text -> Text -> Maybe Text
1783−stripPrefix = coerce JSS.stripPrefix
1784−-- stripPrefix p@(Text _arr _off plen) t@(Text arr off len)
1675+stripPrefix p@(Text _arr _off plen) t@(Text arr off len)
1785−-- | p `isPrefixOf` t = Just $! text arr (off+plen) (len-plen)
1676+ | p `isPrefixOf` t = Just $! text arr (off+plen) (len-plen)
1786−-- | otherwise = Nothing
1677+ | otherwise = Nothing
1788-- | /O(n)/ Find the longest non-empty common prefix of two strings
1679-- | /O(n)/ Find the longest non-empty common prefix of two strings
1789-- and return it, along with the suffixes of each string at which they
1680-- and return it, along with the suffixes of each string at which they
@@ -1798,16 +1689,15 @@ stripPrefix = coerce JSS.stripPrefix
1798-- > commonPrefixes "veeble" "fetzer" == Nothing
1689-- > commonPrefixes "veeble" "fetzer" == Nothing
1799-- > commonPrefixes "" "baz" == Nothing
1690-- > commonPrefixes "" "baz" == Nothing
1800commonPrefixes :: Text -> Text -> Maybe (Text,Text,Text)
1691commonPrefixes :: Text -> Text -> Maybe (Text,Text,Text)
1801−commonPrefixes = coerce JSS.commonPrefixes
1802−-- commonPrefixes t0@(Text arr0 off0 len0) t1@(Text arr1 off1 len1) = go 0 0
1692+commonPrefixes t0@(Text arr0 off0 len0) t1@(Text arr1 off1 len1) = go 0 0
1804−-- go !i !j | i < len0 && j < len1 && a == b = go (i+d0) (j+d1)
1694+ go !i !j | i < len0 && j < len1 && a == b = go (i+d0) (j+d1)
1805−-- | i > 0 = Just (Text arr0 off0 i,
1695+ | i > 0 = Just (Text arr0 off0 i,
1806−-- text arr0 (off0+i) (len0-i),
1696+ text arr0 (off0+i) (len0-i),
1807−-- text arr1 (off1+j) (len1-j))
1697+ text arr1 (off1+j) (len1-j))
1808−-- | otherwise = Nothing
1698+ | otherwise = Nothing
1809−-- where Iter a d0 = iter t0 i
1699+ where Iter a d0 = iter t0 i
1810−-- Iter b d1 = iter t1 j
1700+ Iter b d1 = iter t1 j
1812-- | /O(n)/ Return the prefix of the second string if its suffix
1702-- | /O(n)/ Return the prefix of the second string if its suffix
1813-- matches the entire first string.
1703-- matches the entire first string.
@@ -1828,22 +1718,21 @@ commonPrefixes = coerce JSS.commonPrefixes
1828-- > quuxLength (stripSuffix "quux" -> Just pre) = T.length pre
1718-- > quuxLength (stripSuffix "quux" -> Just pre) = T.length pre
1829-- > quuxLength _ = -1
1719-- > quuxLength _ = -1
1830stripSuffix :: Text -> Text -> Maybe Text
1720stripSuffix :: Text -> Text -> Maybe Text
1831−stripSuffix = coerce JSS.stripSuffix
1832−-- stripSuffix p@(Text _arr _off plen) t@(Text arr off len)
1721+stripSuffix p@(Text _arr _off plen) t@(Text arr off len)
1833−-- | p `isSuffixOf` t = Just $! text arr off (len-plen)
1722+ | p `isSuffixOf` t = Just $! text arr off (len-plen)
1834−-- | otherwise = Nothing
1723+ | otherwise = Nothing
1836−-- -- | Add a list of non-negative numbers. Errors out on overflow.
1725+-- | Add a list of non-negative numbers. Errors out on overflow.
1837−-- sumP :: String -> [Int] -> Int
1726+sumP :: String -> [Int] -> Int
1838−-- sumP fun = go 0
1727+sumP fun = go 0
1839−-- where go !a (x:xs)
1728+ where go !a (x:xs)
1840−-- | ax >= 0 = go ax xs
1729+ | ax >= 0 = go ax xs
1841−-- | otherwise = overflowError fun
1730+ | otherwise = overflowError fun
1842−-- where ax = a + x
1731+ where ax = a + x
1843−-- go a _ = a
1732+ go a _ = a
1845−-- emptyError :: String -> a
1734+emptyError :: String -> a
1846−-- emptyError fun = P.error $ "Data.Text." ++ fun ++ ": empty input"
1735+emptyError fun = P.error $ "Data.Text." ++ fun ++ ": empty input"
1848overflowError :: String -> a
1737overflowError :: String -> a
1849overflowError fun = P.error $ "Data.Text." ++ fun ++ ": size overflow"
1738overflowError fun = P.error $ "Data.Text." ++ fun ++ ": size overflow"
@@ -1857,10 +1746,10 @@ overflowError fun = P.error $ "Data.Text." ++ fun ++ ": size overflow"
1857-- copy \"breaks the link\" to the original array, allowing it to be
1746-- copy \"breaks the link\" to the original array, allowing it to be
1858-- garbage collected if there are no other live references to it.
1747-- garbage collected if there are no other live references to it.
1859copy :: Text -> Text
1748copy :: Text -> Text
1861−-- copy (Text arr off len) = Text (A.run go) 0 len
1749+copy (Text arr off len) = Text (A.run go) 0 len
1863−-- go :: ST s (A.MArray s)
1751+ go :: ST s (A.MArray s)
1864−-- go = do
1752+ go = do
1865−-- marr <- A.new len
1753+ marr <- A.new len
1866−
1754+ A.copyI marr 0 arr off len