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