@@ -6,7 +6,7 @@
66#if __GLASGOW_HASKELL__ >= 708
77{-# LANGUAGE TypeFamilies #-}
88#endif
9−{-# LANGUAGE ForeignFunctionInterface, JavaScriptFFI, UnliftedFFITypes #-}
9+
1010-- |
1111-- Module : Data.Text
1212-- Copyright : (c) 2009, 2010, 2011, 2012 Bryan O'Sullivan,
@@ -15,6 +15,7 @@
1515--
1616-- License : BSD-style
1717-- Maintainer : bos@serpentine.com
18+-- Stability : experimental
1819-- Portability : GHC
1920--
2021-- A time and space-efficient implementation of Unicode text.
@@ -31,9 +32,8 @@
3132--
3233-- To use an extended and very rich family of functions for working
3334-- with Unicode text (including normalization, regular expressions,
34−-- non-standard encodings, text breaking, and locales), see the
35−-- <http://hackage.haskell.org/package/text-icu text-icu package >.
36−--
35+-- non-standard encodings, text breaking, and locales), see
36+-- <http://hackage.haskell.org/package/text-icu the text-icu package >.
3737
3838module Data.Text
3939 (
@@ -43,9 +43,6 @@ module Data.Text
4343 -- * Acceptable data
4444 -- $replacement
4545
46− -- * Definition of character
47− -- $character_definition
48−
4946 -- * Fusion
5047 -- $fusion
5148
@@ -63,7 +60,6 @@ module Data.Text
6360 , snoc
6461 , append
6562 , uncons
66− , unsnoc
6763 , head
6864 , last
6965 , tail
@@ -227,17 +223,16 @@ import qualified Data.Text.Internal.Fusion as S
227223import qualified Data.Text.Internal.Fusion.Common as S
228224import Data.Text.Encoding (decodeUtf8', encodeUtf8)
229225import Data.Text.Internal.Fusion (stream, reverseStream, unstream)
230−-- import Data.Text.Internal.Private (span_)
231−import Data.Text.Internal (Text(..), empty, empty_, firstf, mul, safe, text)
232−-- import Data.Text.Show (singleton, unpack, unpackCString#)
226+import Data.Text.Internal.Private (span_)
227+import Data.Text.Internal (Text(..), empty, firstf, mul, safe, text)
228+import Data.Text.Show (singleton, unpack, unpackCString#)
233229import qualified Prelude as P
234230import Data.Text.Unsafe (Iter(..), iter, iter_, lengthWord16, reverseIter,
235− reverseIter_, unsafeHead, unsafeTail,
236− unsafeDupablePerformIO)
231+ reverseIter_, unsafeHead, unsafeTail)
237232import Data.Text.Internal.Unsafe.Char (unsafeChr)
238233import qualified Data.Text.Internal.Functions as F
239234import qualified Data.Text.Internal.Encoding.Utf16 as U16
240−-- import Data.Text.Internal.Search (indices)
235+import Data.Text.Internal.Search (indices)
241236#if defined(__HADDOCK__)
242237import Data.ByteString (ByteString)
243238import qualified Data.Text.Lazy as L
@@ -251,68 +246,6 @@ import qualified GHC.Exts as Exts
251246import Text.Printf (PrintfArg, formatArg, formatString)
252247#endif
253248
254−-- GHCJS ------------------------------------------------------------
255−import Data.JSString.Internal.Type (JSString (..))
256−import qualified Data.JSString as JSS
257−import qualified Data.JSString.Internal.Fusion as SJS
258−import qualified Data.JSString.Internal.Fusion.Common as SJS
259−import Data.Coerce
260−import GHC.Base (build)
261−import qualified GHC.CString as GHC
262−import GHC.Exts (Addr#, ByteArray#)
263−import GHCJS.Prim (JSVal (..), unpackJSString#)
264−
265−unpack :: Text -> String
266−unpack = coerce JSS.unpack
267−{-# INLINE [1] unpack #-}
268−
269−singleton :: Char -> Text
270−singleton = coerce JSS.singleton
271−{-# INLINE [1] singleton #-}
272−
273−{-# RULES
274−"JSSTRING singleton -> fused" [~1] forall a.
275− singleton a = unstream (S.singleton (safe a))
276−"JSSTRING singleton -> unfused" [1] forall a.
277− unstream (S.singleton (safe a)) = singleton a
278− #-}
279−
280−{-# RULES "inlineJSString" forall s. pack (GHC.Base.build (GHC.unpackFoldrCString# s)) = Text (JSString (unsafeDupablePerformIO (unpackJSString# s))) #-}
281−
282−-- | /O(n)/ Convert a literal string into a JSString. Subject to fusion.
283−unpackCString# :: Addr# -> Text
284−unpackCString# addr# = Text $ SJS.unstream (SJS.streamCString# addr#)
285−{-# NOINLINE unpackCString# #-}
286−
287−{-# RULES "TEXT literal" forall a.
288− unstream (S.map safe (S.streamList (GHC.unpackCString# a)))
289− = unpackCString# a #-}
290−
291−{-# RULES "TEXT literal UTF8" [1] forall a.
292− unstream (S.map safe (S.streamList (GHC.unpackCStringUtf8# a)))
293− = unpackCString# a #-}
294−
295−{-# RULES "TEXT empty literal" [1]
296− unstream (S.map safe (S.streamList []))
297− = empty_ #-}
298−
299−{-# RULES "TEXT singleton literal" [1] forall a.
300− unstream (S.map safe (S.streamList [a]))
301− = singleton a #-}
302−
303−---------------------------------------------------------------------
304−-- $character_definition
305−--
306−-- This package uses the term /character/ to denote Unicode /code points/.
307−--
308−-- Note that this is not the same thing as a grapheme (e.g. a
309−-- composition of code points that form one visual symbol). For
310−-- instance, consider the grapheme \"ä\". This symbol has two
311−-- Unicode representations: a single code-point representation
312−-- @U+00E4@ (the @LATIN SMALL LETTER A WITH DIAERESIS@ code point),
313−-- and a two code point representation @U+0061@ (the \"@A@\" code
314−-- point) and @U+0308@ (the @COMBINING DIAERESIS@ code point).
315−
316249-- $strict
317250--
318251-- This package provides both strict and lazy 'Text' types. The
@@ -388,31 +321,22 @@ unpackCString# addr# = Text $ SJS.unstream (SJS.streamCString# addr#)
388321-- Functions that can be fused by the compiler are documented with the
389322-- phrase \"Subject to fusion\".
390323
391−-- instance Eq Text where
392−-- Text arrA offA lenA == Text arrB offB lenB
393−-- | lenA == lenB = A.equal arrA offA arrB offB lenA
394−-- | otherwise = False
395−-- {-# INLINE (==) #-}
396324instance Eq Text where
397− Text x == Text y = x == y
398−
399−-- instance Ord Text where
400−-- compare = compareText
325+ Text arrA offA lenA == Text arrB offB lenB
326+ | lenA == lenB = A.equal arrA offA arrB offB lenA
327+ | otherwise = False
328+ {-# INLINE (==) #-}
401329
402330instance Ord Text where
403− compare (Text x) (Text y) = compare x y
331+ compare = compareText
404332
405333instance Read Text where
406334 readsPrec p str = [(pack x,y) | (x,y) <- readsPrec p str]
407335
408336#if MIN_VERSION_base(4,9,0)
409−-- | Non-orphan 'Semigroup' instance only defined for
410−-- @base-4.9.0.0@ and later; orphan instances for older GHCs are
411−-- provided by
412−-- the [semigroups](http://hackage.haskell.org/package/semigroups)
413−-- package
414−--
415−-- @since 1.2.2.0
337+-- Semigroup orphan instances for older GHCs are provided by
338+-- 'semigroups` package
339+
416340instance Semigroup Text where
417341 (<>) = append
418342#endif
@@ -430,7 +354,6 @@ instance IsString Text where
430354 fromString = pack
431355
432356#if __GLASGOW_HASKELL__ >= 708
433−-- | @since 1.2.0.0
434357instance Exts.IsList Text where
435358 type Item Text = Char
436359 fromList = pack
@@ -441,7 +364,6 @@ instance Exts.IsList Text where
441364instance NFData Text where rnf !_ = ()
442365#endif
443366
444−-- | @since 1.2.1.0
445367instance Binary Text where
446368 put t = put (encodeUtf8 t)
447369 get = do
@@ -475,10 +397,8 @@ instance Data Text where
475397
476398#if MIN_VERSION_base(4,7,0)
477399-- | Only defined for @base-4.7.0.0@ and later
478−--
479−-- @since 1.2.2.0
480400instance PrintfArg Text where
481− formatArg t = formatString $ unpack t
401+ formatArg txt = formatString $ unpack txt
482402#endif
483403
484404packConstr :: Constr
@@ -487,19 +407,19 @@ packConstr = mkConstr textDataType "pack" [] Prefix
487407textDataType :: DataType
488408textDataType = mkDataType "Data.Text.Text" [packConstr]
489409
490−-- -- | /O(n)/ Compare two 'Text' values lexicographically.
491−-- compareText :: Text -> Text -> Ordering
492−-- compareText ta@(Text _arrA _offA lenA) tb@(Text _arrB _offB lenB)
493−-- | lenA == 0 && lenB == 0 = EQ
494−-- | otherwise = go 0 0
495−-- where
496−-- go !i !j
497−-- | i >= lenA || j >= lenB = compare lenA lenB
498−-- | a < b = LT
499−-- | a > b = GT
500−-- | otherwise = go (i+di) (j+dj)
501−-- where Iter a di = iter ta i
502−-- Iter b dj = iter tb j
410+-- | /O(n)/ Compare two 'Text' values lexicographically.
411+compareText :: Text -> Text -> Ordering
412+compareText ta@(Text _arrA _offA lenA) tb@(Text _arrB _offB lenB)
413+ | lenA == 0 && lenB == 0 = EQ
414+ | otherwise = go 0 0
415+ where
416+ go !i !j
417+ | i >= lenA || j >= lenB = compare lenA lenB
418+ | a < b = LT
419+ | a > b = GT
420+ | otherwise = go (i+di) (j+dj)
421+ where Iter a di = iter ta i
422+ Iter b dj = iter tb j
503423
504424-- -----------------------------------------------------------------------------
505425-- * Conversion to/from 'Text'
@@ -507,8 +427,7 @@ textDataType = mkDataType "Data.Text.Text" [packConstr]
507427-- | /O(n)/ Convert a 'String' into a 'Text'. Subject to
508428-- fusion. Performs replacement on invalid scalar values.
509429pack :: String -> Text
510−pack = coerce JSS.pack
511−-- pack = unstream . S.map safe . S.streamList
430+pack = unstream . S.map safe . S.streamList
512431{-# INLINE [1] pack #-}
513432
514433-- -----------------------------------------------------------------------------
@@ -519,8 +438,7 @@ pack = coerce JSS.pack
519438-- copying a new array. Subject to fusion. Performs replacement on
520439-- invalid scalar values.
521440cons :: Char -> Text -> Text
522−cons = coerce JSS.cons
523−-- cons c t = unstream (S.cons (safe c) (stream t))
441+cons c t = unstream (S.cons (safe c) (stream t))
524442{-# INLINE cons #-}
525443
526444infixr 5 `cons`
@@ -529,27 +447,25 @@ infixr 5 `cons`
529447-- entire array in the process, unless fused. Subject to fusion.
530448-- Performs replacement on invalid scalar values.
531449snoc :: Text -> Char -> Text
532−snoc = coerce JSS.snoc
533−-- snoc t c = unstream (S.snoc (stream t) (safe c))
450+snoc t c = unstream (S.snoc (stream t) (safe c))
534451{-# INLINE snoc #-}
535452
536453-- | /O(n)/ Appends one 'Text' to the other by copying both of them
537454-- into a new 'Text'. Subject to fusion.
538455append :: Text -> Text -> Text
539−append = coerce JSS.append
540−-- append a@(Text arr1 off1 len1) b@(Text arr2 off2 len2)
541−-- | len1 == 0 = b
542−-- | len2 == 0 = a
543−-- | len > 0 = Text (A.run x) 0 len
544−-- | otherwise = overflowError "append"
545−-- where
546−-- len = len1+len2
547−-- x :: ST s (A.MArray s)
548−-- x = do
549−-- arr <- A.new len
550−-- A.copyI arr 0 arr1 off1 len1
551−-- A.copyI arr len1 arr2 off2 len
552−-- return arr
456+append a@(Text arr1 off1 len1) b@(Text arr2 off2 len2)
457+ | len1 == 0 = b
458+ | len2 == 0 = a
459+ | len > 0 = Text (A.run x) 0 len
460+ | otherwise = overflowError "append"
461+ where
462+ len = len1+len2
463+ x :: ST s (A.MArray s)
464+ x = do
465+ arr <- A.new len
466+ A.copyI arr 0 arr1 off1 len1
467+ A.copyI arr len1 arr2 off2 len
468+ return arr
553469{-# NOINLINE append #-}
554470
555471{-# RULES
@@ -562,18 +478,16 @@ append = coerce JSS.append
562478-- | /O(1)/ Returns the first character of a 'Text', which must be
563479-- non-empty. Subject to fusion.
564480head :: Text -> Char
565−head = coerce JSS.head
566−-- head t = S.head (stream t)
481+head t = S.head (stream t)
567482{-# INLINE head #-}
568483
569484-- | /O(1)/ Returns the first character and rest of a 'Text', or
570485-- 'Nothing' if empty. Subject to fusion.
571486uncons :: Text -> Maybe (Char, Text)
572−uncons = coerce JSS.uncons
573−-- uncons t@(Text arr off len)
574−-- | len <= 0 = Nothing
575−-- | otherwise = Just $ let !(Iter c d) = iter t 0
576−-- in (c, text arr (off+d) (len-d))
487+uncons t@(Text arr off len)
488+ | len <= 0 = Nothing
489+ | otherwise = Just $ let !(Iter c d) = iter t 0
490+ in (c, text arr (off+d) (len-d))
577491{-# INLINE [1] uncons #-}
578492
579493-- | Lifted from Control.Arrow and specialized.
@@ -583,13 +497,12 @@ second f (a, b) = (a, f b)
583497-- | /O(1)/ Returns the last character of a 'Text', which must be
584498-- non-empty. Subject to fusion.
585499last :: Text -> Char
586−last = coerce JSS.last
587−-- last (Text arr off len)
588−-- | len <= 0 = emptyError "last"
589−-- | n < 0xDC00 || n > 0xDFFF = unsafeChr n
590−-- | otherwise = U16.chr2 n0 n
591−-- where n = A.unsafeIndex arr (off+len-1)
592−-- n0 = A.unsafeIndex arr (off+len-2)
500+last (Text arr off len)
501+ | len <= 0 = emptyError "last"
502+ | n < 0xDC00 || n > 0xDFFF = unsafeChr n
503+ | otherwise = U16.chr2 n0 n
504+ where n = A.unsafeIndex arr (off+len-1)
505+ n0 = A.unsafeIndex arr (off+len-2)
593506{-# INLINE [1] last #-}
594507
595508{-# RULES
@@ -602,11 +515,10 @@ last = coerce JSS.last
602515-- | /O(1)/ Returns all characters after the head of a 'Text', which
603516-- must be non-empty. Subject to fusion.
604517tail :: Text -> Text
605−tail = coerce JSS.tail
606−-- tail t@(Text arr off len)
607−-- | len <= 0 = emptyError "tail"
608−-- | otherwise = text arr (off+d) (len-d)
609−-- where d = iter_ t 0
518+tail t@(Text arr off len)
519+ | len <= 0 = emptyError "tail"
520+ | otherwise = text arr (off+d) (len-d)
521+ where d = iter_ t 0
610522{-# INLINE [1] tail #-}
611523
612524{-# RULES
@@ -619,12 +531,11 @@ tail = coerce JSS.tail
619531-- | /O(1)/ Returns all but the last character of a 'Text', which must
620532-- be non-empty. Subject to fusion.
621533init :: Text -> Text
622−init = coerce JSS.init
623−-- init (Text arr off len) | len <= 0 = emptyError "init"
624−-- | n >= 0xDC00 && n <= 0xDFFF = text arr off (len-2)
625−-- | otherwise = text arr off (len-1)
626−-- where
627−-- n = A.unsafeIndex arr (off+len-1)
534+init (Text arr off len) | len <= 0 = emptyError "init"
535+ | n >= 0xDC00 && n <= 0xDFFF = text arr off (len-2)
536+ | otherwise = text arr off (len-1)
537+ where
538+ n = A.unsafeIndex arr (off+len-1)
628539{-# INLINE [1] init #-}
629540
630541{-# RULES
@@ -634,29 +545,14 @@ init = coerce JSS.init
634545 unstream (S.init (stream t)) = init t
635546 #-}
636547
637−-- | /O(1)/ Returns all but the last character and the last character of a
638−-- 'Text', or 'Nothing' if empty.
639−--
640−-- @since 1.2.3.0
641−unsnoc :: Text -> Maybe (Text, Char)
642−unsnoc = coerce JSS.unsnoc
643−-- unsnoc (Text arr off len)
644−-- | len <= 0 = Nothing
645−-- | n < 0xDC00 || n > 0xDFFF = Just (text arr off (len-1), unsafeChr n)
646−-- | otherwise = Just (text arr off (len-2), U16.chr2 n0 n)
647−-- where n = A.unsafeIndex arr (off+len-1)
648−-- n0 = A.unsafeIndex arr (off+len-2)
649−{-# INLINE [1] unsnoc #-}
650−
651548-- | /O(1)/ Tests whether a 'Text' is empty or not. Subject to
652549-- fusion.
653550null :: Text -> Bool
654−null = coerce JSS.null
655−-- null (Text _arr _off len) =
656−-- #if defined(ASSERTS)
657−-- assert (len >= 0) $
658−-- #endif
659−-- len <= 0
551+null (Text _arr _off len) =
552+#if defined(ASSERTS)
553+ assert (len >= 0) $
554+#endif
555+ len <= 0
660556{-# INLINE [1] null #-}
661557
662558{-# RULES
@@ -668,15 +564,14 @@ null = coerce JSS.null
668564
669565-- | /O(1)/ Tests whether a 'Text' contains exactly one character.
670566-- Subject to fusion.
671−-- isSingleton :: Text -> Bool
672−-- isSingleton = S.isSingleton . stream
673−-- {-# INLINE isSingleton #-}
567+isSingleton :: Text -> Bool
568+isSingleton = S.isSingleton . stream
569+{-# INLINE isSingleton #-}
674570
675571-- | /O(n)/ Returns the number of characters in a 'Text'.
676572-- Subject to fusion.
677573length :: Text -> Int
678−length = coerce JSS.length
679−-- length t = S.length (stream t)
574+length t = S.length (stream t)
680575{-# INLINE [0] length #-}
681576-- length needs to be phased after the compareN/length rules otherwise
682577-- it may inline before the rules have an opportunity to fire.
@@ -729,58 +624,29 @@ compareLength t n = S.compareLengthI (stream t) n
729624-- -----------------------------------------------------------------------------
730625-- * Transformations
731626-- | /O(n)/ 'map' @f@ @t@ is the 'Text' obtained by applying @f@ to
732−-- each element of @t@.
733−--
734−-- Example:
735−--
736−-- >>> let message = pack "I am not angry. Not at all."
737−-- >>> T.map (\c -> if c == '.' then '!' else c) message
738−-- "I am not angry! Not at all!"
739−--
740−-- Subject to fusion. Performs replacement on invalid scalar values.
627+-- each element of @t@. Subject to fusion. Performs replacement on
628+-- invalid scalar values.
741629map :: (Char -> Char) -> Text -> Text
742−map = coerce JSS.map
743−-- map f t = unstream (S.map (safe . f) (stream t))
630+map f t = unstream (S.map (safe . f) (stream t))
744631{-# INLINE [1] map #-}
745632
746633-- | /O(n)/ The 'intercalate' function takes a 'Text' and a list of
747634-- 'Text's and concatenates the list after interspersing the first
748635-- argument between each element of the list.
749−--
750−-- Example:
751−--
752−-- >>> T.intercalate "NI!" ["We", "seek", "the", "Holy", "Grail"]
753−-- "WeNI!seekNI!theNI!HolyNI!Grail"
754636intercalate :: Text -> [Text] -> Text
755−intercalate = coerce JSS.intercalate
756−-- intercalate t = concat . (F.intersperse t)
637+intercalate t = concat . (F.intersperse t)
757638{-# INLINE intercalate #-}
758639
759640-- | /O(n)/ The 'intersperse' function takes a character and places it
760−-- between the characters of a 'Text'.
761−--
762−-- Example:
763−--
764−-- >>> T.intersperse '.' "SHIELD"
765−-- "S.H.I.E.L.D"
766−--
767−-- Subject to fusion. Performs replacement on invalid scalar values.
641+-- between the characters of a 'Text'. Subject to fusion. Performs
642+-- replacement on invalid scalar values.
768643intersperse :: Char -> Text -> Text
769−intersperse = coerce JSS.intersperse
770−-- intersperse c t = unstream (S.intersperse (safe c) (stream t))
644+intersperse c t = unstream (S.intersperse (safe c) (stream t))
771645{-# INLINE intersperse #-}
772646
773−-- | /O(n)/ Reverse the characters of a string.
774−--
775−-- Example:
776−--
777−-- >>> T.reverse "desrever"
778−-- "reversed"
779−--
780−-- Subject to fusion.
647+-- | /O(n)/ Reverse the characters of a string. Subject to fusion.
781648reverse :: Text -> Text
782−reverse = coerce JSS.reverse
783−-- reverse t = S.reverse (stream t)
649+reverse t = S.reverse (stream t)
784650{-# INLINE reverse #-}
785651
786652-- | /O(m+n)/ Replace every non-overlapping occurrence of @needle@ in
@@ -797,14 +663,12 @@ reverse = coerce JSS.reverse
797663-- @needle@ occurs in @replacement@, that occurrence will /not/ itself
798664-- be replaced recursively:
799665--
800−-- >>> replace "oo" "foo" "oo"
801−-- "foo"
666+-- > replace "oo" "foo" "oo" == "foo"
802667--
803668-- In cases where several instances of @needle@ overlap, only the
804669-- first one will be replaced:
805670--
806−-- >>> replace "ofo" "bar" "ofofo"
807−-- "barfo"
671+-- > replace "ofo" "bar" "ofofo" == "barfo"
808672--
809673-- In (unlikely) bad cases, this function's time complexity degrades
810674-- towards /O(n*m)/.
@@ -816,29 +680,28 @@ replace :: Text
816680 -> Text
817681 -- ^ @haystack@ in which to search.
818682 -> Text
819−replace = coerce JSS.replace
820−-- replace needle@(Text _ _ neeLen)
821−-- (Text repArr repOff repLen)
822−-- haystack@(Text hayArr hayOff hayLen)
823−-- | neeLen == 0 = emptyError "replace"
824−-- | L.null ixs = haystack
825−-- | len > 0 = Text (A.run x) 0 len
826−-- | otherwise = empty
827−-- where
828−-- ixs = indices needle haystack
829−-- len = hayLen - (neeLen - repLen) `mul` L.length ixs
830−-- x :: ST s (A.MArray s)
831−-- x = do
832−-- marr <- A.new len
833−-- let loop (i:is) o d = do
834−-- let d0 = d + i - o
835−-- d1 = d0 + repLen
836−-- A.copyI marr d hayArr (hayOff+o) d0
837−-- A.copyI marr d0 repArr repOff d1
838−-- loop is (i + neeLen) d1
839−-- loop [] o d = A.copyI marr d hayArr (hayOff+o) len
840−-- loop ixs 0 0
841−-- return marr
683+replace needle@(Text _ _ neeLen)
684+ (Text repArr repOff repLen)
685+ haystack@(Text hayArr hayOff hayLen)
686+ | neeLen == 0 = emptyError "replace"
687+ | L.null ixs = haystack
688+ | len > 0 = Text (A.run x) 0 len
689+ | otherwise = empty
690+ where
691+ ixs = indices needle haystack
692+ len = hayLen - (neeLen - repLen) `mul` L.length ixs
693+ x :: ST s (A.MArray s)
694+ x = do
695+ marr <- A.new len
696+ let loop (i:is) o d = do
697+ let d0 = d + i - o
698+ d1 = d0 + repLen
699+ A.copyI marr d hayArr (hayOff+o) d0
700+ A.copyI marr d0 repArr repOff d1
701+ loop is (i + neeLen) d1
702+ loop [] o d = A.copyI marr d hayArr (hayOff+o) len
703+ loop ixs 0 0
704+ return marr
842705
843706-- ----------------------------------------------------------------------------
844707-- ** Case conversions (folds)
@@ -877,8 +740,7 @@ replace = coerce JSS.replace
877740-- U+00B5) is case folded to \"μ\" (small letter mu, U+03BC)
878741-- instead of itself.
879742toCaseFold :: Text -> Text
880−-- toCaseFold t = unstream (S.toCaseFold (stream t))
881−toCaseFold = coerce JSS.toCaseFold
743+toCaseFold t = unstream (S.toCaseFold (stream t))
882744{-# INLINE toCaseFold #-}
883745
884746-- | /O(n)/ Convert a string to lower case, using simple case
@@ -889,8 +751,7 @@ toCaseFold = coerce JSS.toCaseFold
889751-- U+0130) maps to the sequence \"i\" (Latin small letter i, U+0069)
890752-- followed by \" ̇\" (combining dot above, U+0307).
891753toLower :: Text -> Text
892−-- toLower t = unstream (S.toLower (stream t))
893−toLower = coerce JSS.toLower
754+toLower t = unstream (S.toLower (stream t))
894755{-# INLINE toLower #-}
895756
896757-- | /O(n)/ Convert a string to upper case, using simple case
@@ -900,8 +761,7 @@ toLower = coerce JSS.toLower
900761-- instance, the German \"ß\" (eszett, U+00DF) maps to the
901762-- two-letter sequence \"SS\".
902763toUpper :: Text -> Text
903−-- toUpper t = unstream (S.toUpper (stream t))
904−toUpper = coerce JSS.toUpper
764+toUpper t = unstream (S.toUpper (stream t))
905765{-# INLINE toUpper #-}
906766
907767-- | /O(n)/ Convert a string to title case, using simple case
@@ -922,11 +782,8 @@ toUpper = coerce JSS.toUpper
922782-- guides disagree on whether the book name \"The Hill of the Red
923783-- Fox\" is correctly title cased—but this function will
924784-- capitalize /every/ word.
925−--
926−-- @since 1.0.0.0
927785toTitle :: Text -> Text
928−toTitle = coerce JSS.toTitle
929−-- toTitle t = unstream (S.toTitle (stream t))
786+toTitle t = unstream (S.toTitle (stream t))
930787{-# INLINE toTitle #-}
931788
932789-- | /O(n)/ Left-justify a string to the given length, using the
@@ -935,17 +792,13 @@ toTitle = coerce JSS.toTitle
935792--
936793-- Examples:
937794--
938−-- >>> justifyLeft 7 'x' "foo"
939−-- "fooxxxx"
940−--
941−-- >>> justifyLeft 3 'x' "foobar"
942−-- "foobar"
795+-- > justifyLeft 7 'x' "foo" == "fooxxxx"
796+-- > justifyLeft 3 'x' "foobar" == "foobar"
943797justifyLeft :: Int -> Char -> Text -> Text
944−justifyLeft = coerce JSS.justifyLeft
945−-- justifyLeft k c t
946−-- | len >= k = t
947−-- | otherwise = t `append` replicateChar (k-len) c
948−-- where len = length t
798+justifyLeft k c t
799+ | len >= k = t
800+ | otherwise = t `append` replicateChar (k-len) c
801+ where len = length t
949802{-# INLINE [1] justifyLeft #-}
950803
951804{-# RULES
@@ -961,17 +814,13 @@ justifyLeft = coerce JSS.justifyLeft
961814--
962815-- Examples:
963816--
964−-- >>> justifyRight 7 'x' "bar"
965−-- "xxxxbar"
966−--
967−-- >>> justifyRight 3 'x' "foobar"
968−-- "foobar"
817+-- > justifyRight 7 'x' "bar" == "xxxxbar"
818+-- > justifyRight 3 'x' "foobar" == "foobar"
969819justifyRight :: Int -> Char -> Text -> Text
970−justifyRight = coerce JSS.justifyRight
971−-- justifyRight k c t
972−-- | len >= k = t
973−-- | otherwise = replicateChar (k-len) c `append` t
974−-- where len = length t
820+justifyRight k c t
821+ | len >= k = t
822+ | otherwise = replicateChar (k-len) c `append` t
823+ where len = length t
975824{-# INLINE justifyRight #-}
976825
977826-- | /O(n)/ Center a string to the given length, using the specified
@@ -980,34 +829,23 @@ justifyRight = coerce JSS.justifyRight
980829--
981830-- Examples:
982831--
983−-- >>> center 8 'x' "HS"
984−-- "xxxHSxxx"
832+-- > center 8 'x' "HS" = "xxxHSxxx"
985833center :: Int -> Char -> Text -> Text
986−center = coerce JSS.center
987−-- center k c t
988−-- | len >= k = t
989−-- | otherwise = replicateChar l c `append` t `append` replicateChar r c
990−-- where len = length t
991−-- d = k - len
992−-- r = d `quot` 2
993−-- l = d - r
834+center k c t
835+ | len >= k = t
836+ | otherwise = replicateChar l c `append` t `append` replicateChar r c
837+ where len = length t
838+ d = k - len
839+ r = d `quot` 2
840+ l = d - r
994841{-# INLINE center #-}
995842
996843-- | /O(n)/ The 'transpose' function transposes the rows and columns
997844-- of its 'Text' argument. Note that this function uses 'pack',
998845-- 'unpack', and the list version of transpose, and is thus not very
999846-- efficient.
1000−--
1001−-- Examples:
1002−--
1003−-- >>> transpose ["green","orange"]
1004−-- ["go","rr","ea","en","ng","e"]
1005−--
1006−-- >>> transpose ["blue","red"]
1007−-- ["br","le","ud","e"]
1008847transpose :: [Text] -> [Text]
1009−transpose = coerce JSS.transpose
1010−-- transpose ts = P.map pack (L.transpose (P.map unpack ts))
848+transpose ts = P.map pack (L.transpose (P.map unpack ts))
1011849
1012850-- -----------------------------------------------------------------------------
1013851-- * Reducing 'Text's (folds)
@@ -1017,27 +855,23 @@ transpose = coerce JSS.transpose
1017855-- reduces the 'Text' using the binary operator, from left to right.
1018856-- Subject to fusion.
1019857foldl :: (a -> Char -> a) -> a -> Text -> a
1020−foldl f a0 (Text t) = JSS.foldl f a0 t
1021−-- foldl f z t = S.foldl f z (stream t)
858+foldl f z t = S.foldl f z (stream t)
1022859{-# INLINE foldl #-}
1023860
1024861-- | /O(n)/ A strict version of 'foldl'. Subject to fusion.
1025862foldl' :: (a -> Char -> a) -> a -> Text -> a
1026−foldl' f a0 (Text t) = JSS.foldl' f a0 t
1027−-- foldl' f z t = S.foldl' f z (stream t)
863+foldl' f z t = S.foldl' f z (stream t)
1028864{-# INLINE foldl' #-}
1029865
1030866-- | /O(n)/ A variant of 'foldl' that has no starting value argument,
1031867-- and thus must be applied to a non-empty 'Text'. Subject to fusion.
1032868foldl1 :: (Char -> Char -> Char) -> Text -> Char
1033−foldl1 = coerce JSS.foldl1
1034−-- foldl1 f t = S.foldl1 f (stream t)
869+foldl1 f t = S.foldl1 f (stream t)
1035870{-# INLINE foldl1 #-}
1036871
1037872-- | /O(n)/ A strict version of 'foldl1'. Subject to fusion.
1038873foldl1' :: (Char -> Char -> Char) -> Text -> Char
1039−foldl1' = coerce JSS.foldl1'
1040−-- foldl1' f t = S.foldl1' f (stream t)
874+foldl1' f t = S.foldl1' f (stream t)
1041875{-# INLINE foldl1' #-}
1042876
1043877-- | /O(n)/ 'foldr', applied to a binary operator, a starting value
@@ -1045,16 +879,14 @@ foldl1' = coerce JSS.foldl1'
1045879-- reduces the 'Text' using the binary operator, from right to left.
1046880-- Subject to fusion.
1047881foldr :: (Char -> a -> a) -> a -> Text -> a
1048−foldr f a0 (Text t) = JSS.foldr f a0 t
1049−-- foldr f z t = S.foldr f z (stream t)
882+foldr f z t = S.foldr f z (stream t)
1050883{-# INLINE foldr #-}
1051884
1052885-- | /O(n)/ A variant of 'foldr' that has no starting value argument,
1053886-- and thus must be applied to a non-empty 'Text'. Subject to
1054887-- fusion.
1055888foldr1 :: (Char -> Char -> Char) -> Text -> Char
1056−foldr1 = coerce JSS.foldr1
1057−-- foldr1 f t = S.foldr1 f (stream t)
889+foldr1 f t = S.foldr1 f (stream t)
1058890{-# INLINE foldr1 #-}
1059891
1060892-- -----------------------------------------------------------------------------
@@ -1062,54 +894,48 @@ foldr1 = coerce JSS.foldr1
1062894
1063895-- | /O(n)/ Concatenate a list of 'Text's.
1064896concat :: [Text] -> Text
1065−concat = coerce JSS.concat
1066−-- concat ts = case ts' of
1067−-- [] -> empty
1068−-- [t] -> t
1069−-- _ -> Text (A.run go) 0 len
1070−-- where
1071−-- ts' = L.filter (not . null) ts
1072−-- len = sumP "concat" $ L.map lengthWord16 ts'
1073−-- go :: ST s (A.MArray s)
1074−-- go = do
1075−-- arr <- A.new len
1076−-- let step i (Text a o l) =
1077−-- let !j = i + l in A.copyI arr i a o j >> return j
1078−-- foldM step 0 ts' >> return arr
897+concat ts = case ts' of
898+ [] -> empty
899+ [t] -> t
900+ _ -> Text (A.run go) 0 len
901+ where
902+ ts' = L.filter (not . null) ts
903+ len = sumP "concat" $ L.map lengthWord16 ts'
904+ go :: ST s (A.MArray s)
905+ go = do
906+ arr <- A.new len
907+ let step i (Text a o l) =
908+ let !j = i + l in A.copyI arr i a o j >> return j
909+ foldM step 0 ts' >> return arr
1079910
1080911-- | /O(n)/ Map a function over a 'Text' that results in a 'Text', and
1081912-- concatenate the results.
1082913concatMap :: (Char -> Text) -> Text -> Text
1083−concatMap = coerce JSS.concatMap
1084−-- concatMap f = concat . foldr ((:) . f) []
914+concatMap f = concat . foldr ((:) . f) []
1085915{-# INLINE concatMap #-}
1086916
1087917-- | /O(n)/ 'any' @p@ @t@ determines whether any character in the
1088918-- 'Text' @t@ satisfies the predicate @p@. Subject to fusion.
1089919any :: (Char -> Bool) -> Text -> Bool
1090−any = coerce JSS.any
1091−-- any p t = S.any p (stream t)
920+any p t = S.any p (stream t)
1092921{-# INLINE any #-}
1093922
1094923-- | /O(n)/ 'all' @p@ @t@ determines whether all characters in the
1095924-- 'Text' @t@ satisfy the predicate @p@. Subject to fusion.
1096925all :: (Char -> Bool) -> Text -> Bool
1097−all = coerce JSS.all
1098−-- all p t = S.all p (stream t)
926+all p t = S.all p (stream t)
1099927{-# INLINE all #-}
1100928
1101929-- | /O(n)/ 'maximum' returns the maximum value from a 'Text', which
1102930-- must be non-empty. Subject to fusion.
1103931maximum :: Text -> Char
1104−maximum = coerce JSS.maximum
1105−-- maximum t = S.maximum (stream t)
932+maximum t = S.maximum (stream t)
1106933{-# INLINE maximum #-}
1107934
1108935-- | /O(n)/ 'minimum' returns the minimum value from a 'Text', which
1109936-- must be non-empty. Subject to fusion.
1110937minimum :: Text -> Char
1111−minimum = coerce JSS.minimum
1112−-- minimum t = S.minimum (stream t)
938+minimum t = S.minimum (stream t)
1113939{-# INLINE minimum #-}
1114940
1115941-- -----------------------------------------------------------------------------
@@ -1125,9 +951,8 @@ minimum = coerce JSS.minimum
1125951--
1126952-- > last (scanl f z xs) == foldl f z xs.
1127953scanl :: (Char -> Char -> Char) -> Char -> Text -> Text
1128−scanl = coerce JSS.scanl
1129−-- scanl f z t = unstream (S.scanl g z (stream t))
1130−-- where g a b = safe (f a b)
954+scanl f z t = unstream (S.scanl g z (stream t))
955+ where g a b = safe (f a b)
1131956{-# INLINE scanl #-}
1132957
1133958-- | /O(n)/ 'scanl1' is a variant of 'scanl' that has no starting
@@ -1136,9 +961,8 @@ scanl = coerce JSS.scanl
1136961--
1137962-- > scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]
1138963scanl1 :: (Char -> Char -> Char) -> Text -> Text
1139−scanl1 = coerce JSS.scanl1
1140−-- scanl1 f t | null t = empty
1141−-- | otherwise = scanl f (unsafeHead t) (unsafeTail t)
964+scanl1 f t | null t = empty
965+ | otherwise = scanl f (unsafeHead t) (unsafeTail t)
1142966{-# INLINE scanl1 #-}
1143967
1144968-- | /O(n)/ 'scanr' is the right-to-left dual of 'scanl'. Performs
@@ -1146,18 +970,16 @@ scanl1 = coerce JSS.scanl1
1146970--
1147971-- > scanr f v == reverse . scanl (flip f) v . reverse
1148972scanr :: (Char -> Char -> Char) -> Char -> Text -> Text
1149−scanr = coerce JSS.scanr
1150−-- scanr f z = S.reverse . S.reverseScanr g z . reverseStream
1151−-- where g a b = safe (f a b)
973+scanr f z = S.reverse . S.reverseScanr g z . reverseStream
974+ where g a b = safe (f a b)
1152975{-# INLINE scanr #-}
1153976
1154977-- | /O(n)/ 'scanr1' is a variant of 'scanr' that has no starting
1155978-- value argument. Subject to fusion. Performs replacement on
1156979-- invalid scalar values.
1157980scanr1 :: (Char -> Char -> Char) -> Text -> Text
1158−scanr1 = coerce JSS.scanr1
1159−-- scanr1 f t | null t = empty
1160−-- | otherwise = scanr f (last t) (init t)
981+scanr1 f t | null t = empty
982+ | otherwise = scanr f (last t) (init t)
1161983{-# INLINE scanr1 #-}
1162984
1163985-- | /O(n)/ Like a combination of 'map' and 'foldl''. Applies a
@@ -1165,11 +987,8 @@ scanr1 = coerce JSS.scanr1
1165987-- parameter from left to right, and returns a final 'Text'. Performs
1166988-- replacement on invalid scalar values.
1167989mapAccumL :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
1168−mapAccumL f z0 (Text a) =
1169− let (a', t) = JSS.mapAccumL f z0 a
1170− in (a', Text t)
1171−-- mapAccumL f z0 = S.mapAccumL g z0 . stream
1172−-- where g a b = second safe (f a b)
990+mapAccumL f z0 = S.mapAccumL g z0 . stream
991+ where g a b = second safe (f a b)
1173992{-# INLINE mapAccumL #-}
1174993
1175994-- | The 'mapAccumR' function behaves like a combination of 'map' and
@@ -1179,11 +998,8 @@ mapAccumL f z0 (Text a) =
1179998-- 'Text'.
1180999-- Performs replacement on invalid scalar values.
11811000mapAccumR :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
1182−mapAccumR f z0 (Text a) =
1183− let (a', t) = JSS.mapAccumR f z0 a
1184− in (a', Text t)
1185−-- mapAccumR f z0 = second reverse . S.mapAccumL g z0 . reverseStream
1186−-- where g a b = second safe (f a b)
1001+mapAccumR f z0 = second reverse . S.mapAccumL g z0 . reverseStream
1002+ where g a b = second safe (f a b)
11871003{-# INLINE mapAccumR #-}
11881004
11891005-- -----------------------------------------------------------------------------
@@ -1192,21 +1008,20 @@ mapAccumR f z0 (Text a) =
11921008-- | /O(n*m)/ 'replicate' @n@ @t@ is a 'Text' consisting of the input
11931009-- @t@ repeated @n@ times.
11941010replicate :: Int -> Text -> Text
1195−replicate = coerce JSS.replicate
1196−-- replicate n t@(Text a o l)
1197−-- | n <= 0 || l <= 0 = empty
1198−-- | n == 1 = t
1199−-- | isSingleton t = replicateChar n (unsafeHead t)
1200−-- | otherwise = Text (A.run x) 0 len
1201−-- where
1202−-- len = l `mul` n
1203−-- x :: ST s (A.MArray s)
1204−-- x = do
1205−-- arr <- A.new len
1206−-- let loop !d !i | i >= n = return arr
1207−-- | otherwise = let m = d + l
1208−-- in A.copyI arr d a o m >> loop m (i+1)
1209−-- loop 0 0
1011+replicate n t@(Text a o l)
1012+ | n <= 0 || l <= 0 = empty
1013+ | n == 1 = t
1014+ | isSingleton t = replicateChar n (unsafeHead t)
1015+ | otherwise = Text (A.run x) 0 len
1016+ where
1017+ len = l `mul` n
1018+ x :: ST s (A.MArray s)
1019+ x = do
1020+ arr <- A.new len
1021+ let loop !d !i | i >= n = return arr
1022+ | otherwise = let m = d + l
1023+ in A.copyI arr d a o m >> loop m (i+1)
1024+ loop 0 0
12101025{-# INLINE [1] replicate #-}
12111026
12121027{-# RULES
@@ -1217,19 +1032,8 @@ replicate = coerce JSS.replicate
12171032-- | /O(n)/ 'replicateChar' @n@ @c@ is a 'Text' of length @n@ with @c@ the
12181033-- value of every element. Subject to fusion.
12191034replicateChar :: Int -> Char -> Text
1220−#ifndef __GHCJS__
12211035replicateChar n c = unstream (S.replicateCharI n (safe c))
12221036{-# INLINE replicateChar #-}
1223−#else
1224−replicateChar n c = Text $ js_replicateChar n c
1225−{-# INLINE [1] replicateChar #-}
1226−{-# RULES
1227−"JSSTRING replicateChar -> fused" [~1] forall n c.
1228− replicateChar n c = unstream (S.replicateCharI n (safe c))
1229−"JSSTRING replicateChar -> unfused" [1] forall n c.
1230− unstream (S.replicateCharI n (safe c)) = replicateChar n c
1231− #-}
1232−#endif
12331037
12341038-- | /O(n)/, where @n@ is the length of the result. The 'unfoldr'
12351039-- function is analogous to the List 'L.unfoldr'. 'unfoldr' builds a
@@ -1239,8 +1043,7 @@ replicateChar n c = Text $ js_replicateChar n c
12391043-- string, and @b@ is the seed value for further production. Subject
12401044-- to fusion. Performs replacement on invalid scalar values.
12411045unfoldr :: (a -> Maybe (Char,a)) -> a -> Text
1242−unfoldr f a = Text $ JSS.unfoldr f a
1243−-- unfoldr f s = unstream (S.unfoldr (firstf safe . f) s)
1046+unfoldr f s = unstream (S.unfoldr (firstf safe . f) s)
12441047{-# INLINE unfoldr #-}
12451048
12461049-- | /O(n)/ Like 'unfoldr', 'unfoldrN' builds a 'Text' from a seed
@@ -1250,8 +1053,7 @@ unfoldr f a = Text $ JSS.unfoldr f a
12501053-- correct, otherwise its performance is similar to 'unfoldr'. Subject
12511054-- to fusion. Performs replacement on invalid scalar values.
12521055unfoldrN :: Int -> (a -> Maybe (Char,a)) -> a -> Text
1253−unfoldrN n f a0 = Text $ JSS.unfoldrN n f a0
1254−-- 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)
12551057{-# INLINE unfoldrN #-}
12561058
12571059-- -----------------------------------------------------------------------------
@@ -1261,19 +1063,18 @@ unfoldrN n f a0 = Text $ JSS.unfoldrN n f a0
12611063-- 'Text' of length @n@, or the 'Text' itself if @n@ is greater than
12621064-- the length of the Text. Subject to fusion.
12631065take :: Int -> Text -> Text
1264−take = coerce JSS.take
1265−-- take n t@(Text arr off len)
1266−-- | n <= 0 = empty
1267−-- | n >= len = t
1268−-- | otherwise = text arr off (iterN n t)
1066+take n t@(Text arr off len)
1067+ | n <= 0 = empty
1068+ | n >= len = t
1069+ | otherwise = text arr off (iterN n t)
12691070{-# INLINE [1] take #-}
12701071
1271−-- iterN :: Int -> Text -> Int
1272−-- iterN n t@(Text _arr _off len) = loop 0 0
1273−-- where loop !i !cnt
1274−-- | i >= len || cnt >= n = i
1275−-- | otherwise = loop (i+d) (cnt+1)
1276−-- where d = iter_ t i
1072+iterN :: Int -> Text -> Int
1073+iterN n t@(Text _arr _off len) = loop 0 0
1074+ where loop !i !cnt
1075+ | i >= len || cnt >= n = i
1076+ | otherwise = loop (i+d) (cnt+1)
1077+ where d = iter_ t i
12771078
12781079{-# RULES
12791080"TEXT take -> fused" [~1] forall n t.
@@ -1287,36 +1088,31 @@ take = coerce JSS.take
12871088--
12881089-- Examples:
12891090--
1290−-- >>> takeEnd 3 "foobar"
1291−-- "bar"
1292−--
1293−-- @since 1.1.1.0
1091+-- > takeEnd 3 "foobar" == "bar"
12941092takeEnd :: Int -> Text -> Text
1295−takeEnd = coerce JSS.takeEnd
1296−-- takeEnd n t@(Text arr off len)
1297−-- | n <= 0 = empty
1298−-- | n >= len = t
1299−-- | otherwise = text arr (off+i) (len-i)
1300−-- where i = iterNEnd n t
1301−
1302−-- iterNEnd :: Int -> Text -> Int
1303−-- iterNEnd n t@(Text _arr _off len) = loop (len-1) n
1304−-- where loop i !m
1305−-- | i <= 0 = 0
1306−-- | m <= 1 = i
1307−-- | otherwise = loop (i+d) (m-1)
1308−-- where d = reverseIter_ t i
1093+takeEnd n t@(Text arr off len)
1094+ | n <= 0 = empty
1095+ | n >= len = t
1096+ | otherwise = text arr (off+i) (len-i)
1097+ where i = iterNEnd n t
1098+
1099+iterNEnd :: Int -> Text -> Int
1100+iterNEnd n t@(Text _arr _off len) = loop (len-1) n
1101+ where loop i !m
1102+ | i <= 0 = 0
1103+ | m <= 1 = i
1104+ | otherwise = loop (i+d) (m-1)
1105+ where d = reverseIter_ t i
13091106
13101107-- | /O(n)/ 'drop' @n@, applied to a 'Text', returns the suffix of the
13111108-- 'Text' after the first @n@ characters, or the empty 'Text' if @n@
13121109-- is greater than the length of the 'Text'. Subject to fusion.
13131110drop :: Int -> Text -> Text
1314−drop = coerce JSS.drop
1315−-- drop n t@(Text arr off len)
1316−-- | n <= 0 = t
1317−-- | n >= len = empty
1318−-- | otherwise = text arr (off+i) (len-i)
1319−-- where i = iterN n t
1111+drop n t@(Text arr off len)
1112+ | n <= 0 = t
1113+ | n >= len = empty
1114+ | otherwise = text arr (off+i) (len-i)
1115+ where i = iterN n t
13201116{-# INLINE [1] drop #-}
13211117
13221118{-# RULES
@@ -1331,27 +1127,22 @@ drop = coerce JSS.drop
13311127--
13321128-- Examples:
13331129--
1334−-- >>> dropEnd 3 "foobar"
1335−-- "foo"
1336−--
1337−-- @since 1.1.1.0
1130+-- > dropEnd 3 "foobar" == "foo"
13381131dropEnd :: Int -> Text -> Text
1339−dropEnd = coerce JSS.dropEnd
1340−-- dropEnd n t@(Text arr off len)
1341−-- | n <= 0 = t
1342−-- | n >= len = empty
1343−-- | otherwise = text arr off (iterNEnd n t)
1132+dropEnd n t@(Text arr off len)
1133+ | n <= 0 = t
1134+ | n >= len = empty
1135+ | otherwise = text arr off (iterNEnd n t)
13441136
13451137-- | /O(n)/ 'takeWhile', applied to a predicate @p@ and a 'Text',
13461138-- returns the longest prefix (possibly empty) of elements that
13471139-- satisfy @p@. Subject to fusion.
13481140takeWhile :: (Char -> Bool) -> Text -> Text
1349−takeWhile = coerce JSS.takeWhile
1350−-- takeWhile p t@(Text arr off len) = loop 0
1351−-- where loop !i | i >= len = t
1352−-- | p c = loop (i+d)
1353−-- | otherwise = text arr off i
1354−-- where Iter c d = iter t i
1141+takeWhile p t@(Text arr off len) = loop 0
1142+ where loop !i | i >= len = t
1143+ | p c = loop (i+d)
1144+ | otherwise = text arr off i
1145+ where Iter c d = iter t i
13551146{-# INLINE [1] takeWhile #-}
13561147
13571148{-# RULES
@@ -1366,25 +1157,13 @@ takeWhile = coerce JSS.takeWhile
13661157-- satisfy @p@. Subject to fusion.
13671158-- Examples:
13681159--
1369−-- >>> takeWhileEnd (=='o') "foo"
1370−-- "oo"
1371−--
1372−-- @since 1.2.2.0
1160+-- > takeWhileEnd (=='o') "foo" == "oo"
13731161takeWhileEnd :: (Char -> Bool) -> Text -> Text
1374−#ifndef __GHCJS__
13751162takeWhileEnd p t@(Text arr off len) = loop (len-1) len
13761163 where loop !i !l | l <= 0 = t
13771164 | p c = loop (i+d) (l+d)
13781165 | otherwise = text arr (off+l) (len-l)
13791166 where (c,d) = reverseIter t i
1380−#else
1381−takeWhileEnd p t@(Text jst) = loop (len-1) len
1382− where loop !i !l | l <= 0 = t
1383− | p c = loop (i+d) (l+d)
1384− | otherwise = Text $ js_substr1 l jst
1385− where (c,d) = reverseIter t i
1386− len = length t
1387−#endif
13881167{-# INLINE [1] takeWhileEnd #-}
13891168
13901169{-# RULES
@@ -1397,12 +1176,11 @@ takeWhileEnd p t@(Text jst) = loop (len-1) len
13971176-- | /O(n)/ 'dropWhile' @p@ @t@ returns the suffix remaining after
13981177-- 'takeWhile' @p@ @t@. Subject to fusion.
13991178dropWhile :: (Char -> Bool) -> Text -> Text
1400−dropWhile = coerce JSS.dropWhile
1401−-- dropWhile p t@(Text arr off len) = loop 0 0
1402−-- where loop !i !l | l >= len = empty
1403−-- | p c = loop (i+d) (l+d)
1404−-- | otherwise = Text arr (off+i) (len-l)
1405−
1179+dropWhile p t@(Text arr off len) = loop 0 0
1180+ where loop !i !l | l >= len = empty
1181+ | p c = loop (i+d) (l+d)
1182+ | otherwise = Text arr (off+i) (len-l)
1183+ where Iter c d = iter t i
14061184{-# INLINE [1] dropWhile #-}
14071185
14081186{-# RULES
@@ -1418,15 +1196,13 @@ dropWhile = coerce JSS.dropWhile
14181196--
14191197-- Examples:
14201198--
1421−-- >>> dropWhileEnd (=='.') "foo..."
1422−-- "foo"
1199+-- > dropWhileEnd (=='.') "foo..." == "foo"
14231200dropWhileEnd :: (Char -> Bool) -> Text -> Text
1424−dropWhileEnd = coerce JSS.dropWhileEnd
1425−-- dropWhileEnd p t@(Text arr off len) = loop (len-1) len
1426−-- where loop !i !l | l <= 0 = empty
1427−-- | p c = loop (i+d) (l+d)
1428−-- | otherwise = Text arr off l
1429−-- where (c,d) = reverseIter t i
1201+dropWhileEnd p t@(Text arr off len) = loop (len-1) len
1202+ where loop !i !l | l <= 0 = empty
1203+ | p c = loop (i+d) (l+d)
1204+ | otherwise = Text arr off l
1205+ where (c,d) = reverseIter t i
14301206{-# INLINE [1] dropWhileEnd #-}
14311207
14321208{-# RULES
@@ -1469,49 +1245,45 @@ strip = dropAround isSpace
14691245-- prefix of @t@ of length @n@, and whose second is the remainder of
14701246-- the string. It is equivalent to @('take' n t, 'drop' n t)@.
14711247splitAt :: Int -> Text -> (Text, Text)
1472−splitAt = coerce JSS.splitAt
1473−-- splitAt n t@(Text arr off len)
1474−-- | n <= 0 = (empty, t)
1475−-- | n >= len = (t, empty)
1476−-- | otherwise = let k = iterN n t
1477−-- in (text arr off k, text arr (off+k) (len-k))
1248+splitAt n t@(Text arr off len)
1249+ | n <= 0 = (empty, t)
1250+ | n >= len = (t, empty)
1251+ | otherwise = let k = iterN n t
1252+ in (text arr off k, text arr (off+k) (len-k))
14781253
14791254-- | /O(n)/ 'span', applied to a predicate @p@ and text @t@, returns
14801255-- a pair whose first element is the longest prefix (possibly empty)
14811256-- of @t@ of elements that satisfy @p@, and whose second is the
14821257-- remainder of the list.
14831258span :: (Char -> Bool) -> Text -> (Text, Text)
1484−span = coerce JSS.span
1485−-- span p t = case span_ p t of
1486−-- (# hd,tl #) -> (hd,tl)
1259+span p t = case span_ p t of
1260+ (# hd,tl #) -> (hd,tl)
14871261{-# INLINE span #-}
14881262
14891263-- | /O(n)/ 'break' is like 'span', but the prefix returned is
14901264-- over elements that fail the predicate @p@.
14911265break :: (Char -> Bool) -> Text -> (Text, Text)
1492−break = coerce JSS.break
1493−-- break p = span (not . p)
1266+break p = span (not . p)
14941267{-# INLINE break #-}
14951268
14961269-- | /O(n)/ Group characters in a string according to a predicate.
14971270groupBy :: (Char -> Char -> Bool) -> Text -> [Text]
1498−groupBy = coerce JSS.groupBy
1499−-- groupBy p = loop
1500−-- where
1501−-- loop t@(Text arr off len)
1502−-- | null t = []
1503−-- | otherwise = text arr off n : loop (text arr (off+n) (len-n))
1504−-- where Iter c d = iter t 0
1505−-- n = d + findAIndexOrEnd (not . p c) (Text arr (off+d) (len-d))
1271+groupBy p = loop
1272+ where
1273+ loop t@(Text arr off len)
1274+ | null t = []
1275+ | otherwise = text arr off n : loop (text arr (off+n) (len-n))
1276+ where Iter c d = iter t 0
1277+ n = d + findAIndexOrEnd (not . p c) (Text arr (off+d) (len-d))
15061278
15071279-- | Returns the /array/ index (in units of 'Word16') at which a
15081280-- character may be found. This is /not/ the same as the logical
15091281-- index returned by e.g. 'findIndex'.
1510−-- findAIndexOrEnd :: (Char -> Bool) -> Text -> Int
1511−-- findAIndexOrEnd q t@(Text _arr _off len) = go 0
1512−-- where go !i | i >= len || q c = i
1513−-- | otherwise = go (i+d)
1514−-- where Iter c d = iter t i
1282+findAIndexOrEnd :: (Char -> Bool) -> Text -> Int
1283+findAIndexOrEnd q t@(Text _arr _off len) = go 0
1284+ where go !i | i >= len || q c = i
1285+ | otherwise = go (i+d)
1286+ where Iter c d = iter t i
15151287
15161288-- | /O(n)/ Group characters in a string by equality.
15171289group :: Text -> [Text]
@@ -1520,17 +1292,15 @@ group = groupBy (==)
15201292-- | /O(n)/ Return all initial segments of the given 'Text', shortest
15211293-- first.
15221294inits :: Text -> [Text]
1523−inits = coerce JSS.inits
1524−-- inits t@(Text arr off len) = loop 0
1525−-- where loop i | i >= len = [t]
1526−-- | otherwise = Text arr off i : loop (i + iter_ t i)
1295+inits t@(Text arr off len) = loop 0
1296+ where loop i | i >= len = [t]
1297+ | otherwise = Text arr off i : loop (i + iter_ t i)
15271298
15281299-- | /O(n)/ Return all final segments of the given 'Text', longest
15291300-- first.
15301301tails :: Text -> [Text]
1531−tails = coerce JSS.tails
1532−-- tails t | null t = [empty]
1533−-- | otherwise = t : tails (unsafeTail t)
1302+tails t | null t = [empty]
1303+ | otherwise = t : tails (unsafeTail t)
15341304
15351305-- $split
15361306--
@@ -1544,14 +1314,9 @@ tails = coerce JSS.tails
15441314--
15451315-- Examples:
15461316--
1547−-- >>> splitOn "\r\n" "a\r\nb\r\nd\r\ne"
1548−-- ["a","b","d","e"]
1549−--
1550−-- >>> splitOn "aaa" "aaaXaaaXaaaXaaa"
1551−-- ["","X","X","X",""]
1552−--
1553−-- >>> splitOn "x" "x"
1554−-- ["",""]
1317+-- > splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
1318+-- > splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
1319+-- > splitOn "x" "x" == ["",""]
15551320--
15561321-- and
15571322--
@@ -1568,14 +1333,13 @@ splitOn :: Text
15681333 -> Text
15691334 -- ^ Input text.
15701335 -> [Text]
1571−splitOn = coerce JSS.splitOn
1572−-- splitOn pat@(Text _ _ l) src@(Text arr off len)
1573−-- | l <= 0 = emptyError "splitOn"
1574−-- | isSingleton pat = split (== unsafeHead pat) src
1575−-- | otherwise = go 0 (indices pat src)
1576−-- where
1577−-- go !s (x:xs) = text arr (s+off) (x-s) : go (x+l) xs
1578−-- go s _ = [text arr (s+off) (len-s)]
1336+splitOn pat@(Text _ _ l) src@(Text arr off len)
1337+ | l <= 0 = emptyError "splitOn"
1338+ | isSingleton pat = split (== unsafeHead pat) src
1339+ | otherwise = go 0 (indices pat src)
1340+ where
1341+ go !s (x:xs) = text arr (s+off) (x-s) : go (x+l) xs
1342+ go s _ = [text arr (s+off) (len-s)]
15791343{-# INLINE [1] splitOn #-}
15801344
15811345{-# RULES
@@ -1588,36 +1352,28 @@ splitOn = coerce JSS.splitOn
15881352-- resulting components do not contain the separators. Two adjacent
15891353-- separators result in an empty component in the output. eg.
15901354--
1591−-- >>> split (=='a') "aabbaca"
1592−-- ["","","bb","c",""]
1593−--
1594−-- >>> split (=='a') ""
1595−-- [""]
1355+-- > split (=='a') "aabbaca" == ["","","bb","c",""]
1356+-- > split (=='a') "" == [""]
15961357split :: (Char -> Bool) -> Text -> [Text]
1597−split = coerce JSS.split
1598−-- split _ t@(Text _off _arr 0) = [t]
1599−-- split p t = loop t
1600−-- where loop s | null s' = [l]
1601−-- | otherwise = l : loop (unsafeTail s')
1602−-- where (# l, s' #) = span_ (not . p) s
1358+split _ t@(Text _off _arr 0) = [t]
1359+split p t = loop t
1360+ where loop s | null s' = [l]
1361+ | otherwise = l : loop (unsafeTail s')
1362+ where (# l, s' #) = span_ (not . p) s
16031363{-# INLINE split #-}
16041364
16051365-- | /O(n)/ Splits a 'Text' into components of length @k@. The last
16061366-- element may be shorter than the other chunks, depending on the
16071367-- length of the input. Examples:
16081368--
1609−-- >>> chunksOf 3 "foobarbaz"
1610−-- ["foo","bar","baz"]
1611−--
1612−-- >>> chunksOf 4 "haskell.org"
1613−-- ["hask","ell.","org"]
1369+-- > chunksOf 3 "foobarbaz" == ["foo","bar","baz"]
1370+-- > chunksOf 4 "haskell.org" == ["hask","ell.","org"]
16141371chunksOf :: Int -> Text -> [Text]
1615−chunksOf = coerce JSS.chunksOf
1616−-- chunksOf k = go
1617−-- where
1618−-- go t = case splitAt k t of
1619−-- (a,b) | null a -> []
1620−-- | otherwise -> a : go b
1372+chunksOf k = go
1373+ where
1374+ go t = case splitAt k t of
1375+ (a,b) | null a -> []
1376+ | otherwise -> a : go b
16211377{-# INLINE chunksOf #-}
16221378
16231379-- ----------------------------------------------------------------------------
@@ -1630,8 +1386,7 @@ chunksOf = coerce JSS.chunksOf
16301386-- returns the first element matching the predicate, or 'Nothing' if
16311387-- there is no such element.
16321388find :: (Char -> Bool) -> Text -> Maybe Char
1633−find = coerce JSS.find
1634−-- find p t = S.findBy p (stream t)
1389+find p t = S.findBy p (stream t)
16351390{-# INLINE find #-}
16361391
16371392-- | /O(n)/ The 'partition' function takes a predicate and a 'Text',
@@ -1640,16 +1395,14 @@ find = coerce JSS.find
16401395--
16411396-- > partition p t == (filter p t, filter (not . p) t)
16421397partition :: (Char -> Bool) -> Text -> (Text, Text)
1643−partition = coerce JSS.partition
1644−-- partition p t = (filter p t, filter (not . p) t)
1398+partition p t = (filter p t, filter (not . p) t)
16451399{-# INLINE partition #-}
16461400
16471401-- | /O(n)/ 'filter', applied to a predicate and a 'Text',
16481402-- returns a 'Text' containing those characters that satisfy the
16491403-- predicate.
16501404filter :: (Char -> Bool) -> Text -> Text
1651−filter = coerce JSS.filter
1652−-- filter p t = unstream (S.filter p (stream t))
1405+filter p t = unstream (S.filter p (stream t))
16531406{-# INLINE filter #-}
16541407
16551408-- | /O(n+m)/ Find the first instance of @needle@ (which must be
@@ -1659,11 +1412,8 @@ filter = coerce JSS.filter
16591412--
16601413-- Examples:
16611414--
1662−-- >>> breakOn "::" "a::b::c"
1663−-- ("a","::b::c")
1664−--
1665−-- >>> breakOn "/" "foobar"
1666−-- ("foobar","")
1415+-- > breakOn "::" "a::b::c" ==> ("a", "::b::c")
1416+-- > breakOn "/" "foobar" ==> ("foobar", "")
16671417--
16681418-- Laws:
16691419--
@@ -1677,12 +1427,11 @@ filter = coerce JSS.filter
16771427-- In (unlikely) bad cases, this function's time complexity degrades
16781428-- towards /O(n*m)/.
16791429breakOn :: Text -> Text -> (Text, Text)
1680−breakOn = coerce JSS.breakOn
1681−-- breakOn pat src@(Text arr off len)
1682−-- | null pat = emptyError "breakOn"
1683−-- | otherwise = case indices pat src of
1684−-- [] -> (src, empty)
1685−-- (x:_) -> (text arr off x, text arr (off+x) (len-x))
1430+breakOn pat src@(Text arr off len)
1431+ | null pat = emptyError "breakOn"
1432+ | otherwise = case indices pat src of
1433+ [] -> (src, empty)
1434+ (x:_) -> (text arr off x, text arr (off+x) (len-x))
16861435{-# INLINE breakOn #-}
16871436
16881437-- | /O(n+m)/ Similar to 'breakOn', but searches from the end of the
@@ -1692,12 +1441,10 @@ breakOn = coerce JSS.breakOn
16921441-- up to and including the last match of @needle@. The second is the
16931442-- remainder of @haystack@, following the match.
16941443--
1695−-- >>> breakOnEnd "::" "a::b::c"
1696−-- ("a::b::","c")
1444+-- > breakOnEnd "::" "a::b::c" ==> ("a::b::", "c")
16971445breakOnEnd :: Text -> Text -> (Text, Text)
1698−breakOnEnd = coerce JSS.breakOnEnd
1699−-- breakOnEnd pat src = (reverse b, reverse a)
1700−-- where (a,b) = breakOn (reverse pat) (reverse src)
1446+breakOnEnd pat src = (reverse b, reverse a)
1447+ where (a,b) = breakOn (reverse pat) (reverse src)
17011448{-# INLINE breakOnEnd #-}
17021449
17031450-- | /O(n+m)/ Find all non-overlapping instances of @needle@ in
@@ -1709,11 +1456,10 @@ breakOnEnd = coerce JSS.breakOnEnd
17091456--
17101457-- Examples:
17111458--
1712−-- >>> breakOnAll "::" ""
1713−-- []
1714−--
1715−-- >>> breakOnAll "/" "a/b/c/"
1716−-- [("a","/b/c/"),("a/b","/c/"),("a/b/c","/")]
1459+-- > breakOnAll "::" ""
1460+-- > ==> []
1461+-- > breakOnAll "/" "a/b/c/"
1462+-- > ==> [("a", "/b/c/"), ("a/b", "/c/"), ("a/b/c", "/")]
17171463--
17181464-- In (unlikely) bad cases, this function's time complexity degrades
17191465-- towards /O(n*m)/.
@@ -1722,13 +1468,12 @@ breakOnEnd = coerce JSS.breakOnEnd
17221468breakOnAll :: Text -- ^ @needle@ to search for
17231469 -> Text -- ^ @haystack@ in which to search
17241470 -> [(Text, Text)]
1725−breakOnAll = coerce JSS.breakOnAll
1726−-- breakOnAll pat src@(Text arr off slen)
1727−-- | null pat = emptyError "breakOnAll"
1728−-- | otherwise = L.map step (indices pat src)
1729−-- where
1730−-- step x = (chunk 0 x, chunk x (slen-x))
1731−-- chunk !n !l = text arr (n+off) l
1471+breakOnAll pat src@(Text arr off slen)
1472+ | null pat = emptyError "breakOnAll"
1473+ | otherwise = L.map step (indices pat src)
1474+ where
1475+ step x = (chunk 0 x, chunk x (slen-x))
1476+ chunk !n !l = text arr (n+off) l
17321477{-# INLINE breakOnAll #-}
17331478
17341479-------------------------------------------------------------------------------
@@ -1752,16 +1497,14 @@ breakOnAll = coerce JSS.breakOnAll
17521497
17531498-- | /O(n)/ 'Text' index (subscript) operator, starting from 0.
17541499index :: Text -> Int -> Char
1755−index = coerce JSS.index
1756−-- index t n = S.index (stream t) n
1500+index t n = S.index (stream t) n
17571501{-# INLINE index #-}
17581502
17591503-- | /O(n)/ The 'findIndex' function takes a predicate and a 'Text'
17601504-- and returns the index of the first element in the 'Text' satisfying
17611505-- the predicate. Subject to fusion.
17621506findIndex :: (Char -> Bool) -> Text -> Maybe Int
1763−findIndex = coerce JSS.findIndex
1764−-- findIndex p t = S.findIndex p (stream t)
1507+findIndex p t = S.findIndex p (stream t)
17651508{-# INLINE findIndex #-}
17661509
17671510-- | /O(n+m)/ The 'count' function returns the number of times the
@@ -1771,11 +1514,10 @@ findIndex = coerce JSS.findIndex
17711514-- In (unlikely) bad cases, this function's time complexity degrades
17721515-- towards /O(n*m)/.
17731516count :: Text -> Text -> Int
1774−count = coerce JSS.count
1775−-- count pat src
1776−-- | null pat = emptyError "count"
1777−-- | isSingleton pat = countChar (unsafeHead pat) src
1778−-- | otherwise = L.length (indices pat src)
1517+count pat src
1518+ | null pat = emptyError "count"
1519+ | isSingleton pat = countChar (unsafeHead pat) src
1520+ | otherwise = L.length (indices pat src)
17791521{-# INLINE [1] count #-}
17801522
17811523{-# RULES
@@ -1797,46 +1539,42 @@ countChar c t = S.countChar c (stream t)
17971539-- excess elements of the longer 'Text' are discarded. This is
17981540-- equivalent to a pair of 'unpack' operations.
17991541zip :: Text -> Text -> [(Char,Char)]
1800−zip = coerce JSS.zip
1801−-- zip a b = S.unstreamList $ S.zipWith (,) (stream a) (stream b)
1542+zip a b = S.unstreamList $ S.zipWith (,) (stream a) (stream b)
18021543{-# INLINE zip #-}
18031544
18041545-- | /O(n)/ 'zipWith' generalises 'zip' by zipping with the function
18051546-- given as the first argument, instead of a tupling function.
18061547-- Performs replacement on invalid scalar values.
18071548zipWith :: (Char -> Char -> Char) -> Text -> Text -> Text
1808−zipWith = coerce JSS.zipWith
1809−-- zipWith f t1 t2 = unstream (S.zipWith g (stream t1) (stream t2))
1810−-- where g a b = safe (f a b)
1549+zipWith f t1 t2 = unstream (S.zipWith g (stream t1) (stream t2))
1550+ where g a b = safe (f a b)
18111551{-# INLINE zipWith #-}
18121552
18131553-- | /O(n)/ Breaks a 'Text' up into a list of words, delimited by 'Char's
18141554-- representing white space.
18151555words :: Text -> [Text]
1816−words = coerce JSS.words
1817−-- words t@(Text arr off len) = loop 0 0
1818−-- where
1819−-- loop !start !n
1820−-- | n >= len = if start == n
1821−-- then []
1822−-- else [Text arr (start+off) (n-start)]
1823−-- | isSpace c =
1824−-- if start == n
1825−-- then loop (start+1) (start+1)
1826−-- else Text arr (start+off) (n-start) : loop (n+d) (n+d)
1827−-- | otherwise = loop start (n+d)
1828−-- where Iter c d = iter t n
1556+words t@(Text arr off len) = loop 0 0
1557+ where
1558+ loop !start !n
1559+ | n >= len = if start == n
1560+ then []
1561+ else [Text arr (start+off) (n-start)]
1562+ | isSpace c =
1563+ if start == n
1564+ then loop (start+1) (start+1)
1565+ else Text arr (start+off) (n-start) : loop (n+d) (n+d)
1566+ | otherwise = loop start (n+d)
1567+ where Iter c d = iter t n
18291568{-# INLINE words #-}
18301569
18311570-- | /O(n)/ Breaks a 'Text' up into a list of 'Text's at
18321571-- newline 'Char's. The resulting strings do not contain newlines.
18331572lines :: Text -> [Text]
1834−lines = coerce JSS.lines
1835−-- lines ps | null ps = []
1836−-- | otherwise = h : if null t
1837−-- then []
1838−-- else lines (unsafeTail t)
1839−-- where (# h,t #) = span_ (/= '\n') ps
1573+lines ps | null ps = []
1574+ | otherwise = h : if null t
1575+ then []
1576+ else lines (unsafeTail t)
1577+ where (# h,t #) = span_ (/= '\n') ps
18401578{-# INLINE lines #-}
18411579
18421580{-
@@ -1864,40 +1602,34 @@ lines' ps | null ps = []
18641602-- | /O(n)/ Joins lines, after appending a terminating newline to
18651603-- each.
18661604unlines :: [Text] -> Text
1867−unlines = coerce JSS.unlines
1868−-- unlines = concat . L.map (`snoc` '\n')
1605+unlines = concat . L.map (`snoc` '\n')
18691606{-# INLINE unlines #-}
18701607
18711608-- | /O(n)/ Joins words using single space characters.
18721609unwords :: [Text] -> Text
1873−unwords = coerce JSS.unwords
1874−-- unwords = intercalate (singleton ' ')
1610+unwords = intercalate (singleton ' ')
18751611{-# INLINE unwords #-}
18761612
18771613-- | /O(n)/ The 'isPrefixOf' function takes two 'Text's and returns
18781614-- 'True' iff the first is a prefix of the second. Subject to fusion.
18791615isPrefixOf :: Text -> Text -> Bool
1880−isPrefixOf = coerce JSS.isPrefixOf
1881−-- isPrefixOf a@(Text _ _ alen) b@(Text _ _ blen) =
1882−-- alen <= blen && S.isPrefixOf (stream a) (stream b)
1616+isPrefixOf a@(Text _ _ alen) b@(Text _ _ blen) =
1617+ alen <= blen && S.isPrefixOf (stream a) (stream b)
18831618{-# INLINE [1] isPrefixOf #-}
18841619
18851620{-# RULES
18861621"TEXT isPrefixOf -> fused" [~1] forall s t.
18871622 isPrefixOf s t = S.isPrefixOf (stream s) (stream t)
1888−"JSSTRING isPrefixOf -> unfused" [1] forall x y.
1889− S.isPrefixOf (stream x) (stream y) = isPrefixOf x y
18901623 #-}
18911624
18921625-- | /O(n)/ The 'isSuffixOf' function takes two 'Text's and returns
18931626-- 'True' iff the first is a suffix of the second.
18941627isSuffixOf :: Text -> Text -> Bool
1895−isSuffixOf = coerce JSS.isSuffixOf
1896−-- isSuffixOf a@(Text _aarr _aoff alen) b@(Text barr boff blen) =
1897−-- d >= 0 && a == b'
1898−-- where d = blen - alen
1899−-- b' | d == 0 = b
1900−-- | otherwise = Text barr (boff+d) alen
1628+isSuffixOf a@(Text _aarr _aoff alen) b@(Text barr boff blen) =
1629+ d >= 0 && a == b'
1630+ where d = blen - alen
1631+ b' | d == 0 = b
1632+ | otherwise = Text barr (boff+d) alen
19011633{-# INLINE isSuffixOf #-}
19021634
19031635-- | /O(n+m)/ The 'isInfixOf' function takes two 'Text's and returns
@@ -1907,11 +1639,10 @@ isSuffixOf = coerce JSS.isSuffixOf
19071639-- In (unlikely) bad cases, this function's time complexity degrades
19081640-- towards /O(n*m)/.
19091641isInfixOf :: Text -> Text -> Bool
1910−isInfixOf = coerce JSS.isInfixOf
1911−-- isInfixOf needle haystack
1912−-- | null needle = True
1913−-- | isSingleton needle = S.elem (unsafeHead needle) . S.stream $ haystack
1914−-- | otherwise = not . L.null . indices needle $ haystack
1642+isInfixOf needle haystack
1643+ | null needle = True
1644+ | isSingleton needle = S.elem (unsafeHead needle) . S.stream $ haystack
1645+ | otherwise = not . L.null . indices needle $ haystack
19151646{-# INLINE [1] isInfixOf #-}
19161647
19171648{-# RULES
@@ -1927,14 +1658,9 @@ isInfixOf = coerce JSS.isInfixOf
19271658--
19281659-- Examples:
19291660--
1930−-- >>> stripPrefix "foo" "foobar"
1931−-- Just "bar"
1932−--
1933−-- >>> stripPrefix "" "baz"
1934−-- Just "baz"
1935−--
1936−-- >>> stripPrefix "foo" "quux"
1937−-- Nothing
1661+-- > stripPrefix "foo" "foobar" == Just "bar"
1662+-- > stripPrefix "" "baz" == Just "baz"
1663+-- > stripPrefix "foo" "quux" == Nothing
19381664--
19391665-- This is particularly useful with the @ViewPatterns@ extension to
19401666-- GHC, as follows:
@@ -1946,10 +1672,9 @@ isInfixOf = coerce JSS.isInfixOf
19461672-- > fnordLength (stripPrefix "fnord" -> Just suf) = T.length suf
19471673-- > fnordLength _ = -1
19481674stripPrefix :: Text -> Text -> Maybe Text
1949−stripPrefix = coerce JSS.stripPrefix
1950−-- stripPrefix p@(Text _arr _off plen) t@(Text arr off len)
1951−-- | p `isPrefixOf` t = Just $! text arr (off+plen) (len-plen)
1952−-- | otherwise = Nothing
1675+stripPrefix p@(Text _arr _off plen) t@(Text arr off len)
1676+ | p `isPrefixOf` t = Just $! text arr (off+plen) (len-plen)
1677+ | otherwise = Nothing
19531678
19541679-- | /O(n)/ Find the longest non-empty common prefix of two strings
19551680-- and return it, along with the suffixes of each string at which they
@@ -1960,39 +1685,28 @@ stripPrefix = coerce JSS.stripPrefix
19601685--
19611686-- Examples:
19621687--
1963−-- >>> commonPrefixes "foobar" "fooquux"
1964−-- Just ("foo","bar","quux")
1965−--
1966−-- >>> commonPrefixes "veeble" "fetzer"
1967−-- Nothing
1968−--
1969−-- >>> commonPrefixes "" "baz"
1970−-- Nothing
1688+-- > commonPrefixes "foobar" "fooquux" == Just ("foo","bar","quux")
1689+-- > commonPrefixes "veeble" "fetzer" == Nothing
1690+-- > commonPrefixes "" "baz" == Nothing
19711691commonPrefixes :: Text -> Text -> Maybe (Text,Text,Text)
1972−commonPrefixes = coerce JSS.commonPrefixes
1973−-- commonPrefixes t0@(Text arr0 off0 len0) t1@(Text arr1 off1 len1) = go 0 0
1974−-- where
1975−-- go !i !j | i < len0 && j < len1 && a == b = go (i+d0) (j+d1)
1976−-- | i > 0 = Just (Text arr0 off0 i,
1977−-- text arr0 (off0+i) (len0-i),
1978−-- text arr1 (off1+j) (len1-j))
1979−-- | otherwise = Nothing
1980−-- where Iter a d0 = iter t0 i
1981−-- Iter b d1 = iter t1 j
1692+commonPrefixes t0@(Text arr0 off0 len0) t1@(Text arr1 off1 len1) = go 0 0
1693+ where
1694+ go !i !j | i < len0 && j < len1 && a == b = go (i+d0) (j+d1)
1695+ | i > 0 = Just (Text arr0 off0 i,
1696+ text arr0 (off0+i) (len0-i),
1697+ text arr1 (off1+j) (len1-j))
1698+ | otherwise = Nothing
1699+ where Iter a d0 = iter t0 i
1700+ Iter b d1 = iter t1 j
19821701
19831702-- | /O(n)/ Return the prefix of the second string if its suffix
19841703-- matches the entire first string.
19851704--
19861705-- Examples:
19871706--
1988−-- >>> stripSuffix "bar" "foobar"
1989−-- Just "foo"
1990−--
1991−-- >>> stripSuffix "" "baz"
1992−-- Just "baz"
1993−--
1994−-- >>> stripSuffix "foo" "quux"
1995−-- Nothing
1707+-- > stripSuffix "bar" "foobar" == Just "foo"
1708+-- > stripSuffix "" "baz" == Just "baz"
1709+-- > stripSuffix "foo" "quux" == Nothing
19961710--
19971711-- This is particularly useful with the @ViewPatterns@ extension to
19981712-- GHC, as follows:
@@ -2004,22 +1718,21 @@ commonPrefixes = coerce JSS.commonPrefixes
20041718-- > quuxLength (stripSuffix "quux" -> Just pre) = T.length pre
20051719-- > quuxLength _ = -1
20061720stripSuffix :: Text -> Text -> Maybe Text
2007−stripSuffix = coerce JSS.stripSuffix
2008−-- stripSuffix p@(Text _arr _off plen) t@(Text arr off len)
2009−-- | p `isSuffixOf` t = Just $! text arr off (len-plen)
2010−-- | otherwise = Nothing
2011−
2012−-- -- | Add a list of non-negative numbers. Errors out on overflow.
2013−-- sumP :: String -> [Int] -> Int
2014−-- sumP fun = go 0
2015−-- where go !a (x:xs)
2016−-- | ax >= 0 = go ax xs
2017−-- | otherwise = overflowError fun
2018−-- where ax = a + x
2019−-- go a _ = a
2020−
2021−-- emptyError :: String -> a
2022−-- emptyError fun = P.error $ "Data.Text." ++ fun ++ ": empty input"
1721+stripSuffix p@(Text _arr _off plen) t@(Text arr off len)
1722+ | p `isSuffixOf` t = Just $! text arr off (len-plen)
1723+ | otherwise = Nothing
1724+
1725+-- | Add a list of non-negative numbers. Errors out on overflow.
1726+sumP :: String -> [Int] -> Int
1727+sumP fun = go 0
1728+ where go !a (x:xs)
1729+ | ax >= 0 = go ax xs
1730+ | otherwise = overflowError fun
1731+ where ax = a + x
1732+ go a _ = a
1733+
1734+emptyError :: String -> a
1735+emptyError fun = P.error $ "Data.Text." ++ fun ++ ": empty input"
20231736
20241737overflowError :: String -> a
20251738overflowError fun = P.error $ "Data.Text." ++ fun ++ ": size overflow"
@@ -2033,22 +1746,10 @@ overflowError fun = P.error $ "Data.Text." ++ fun ++ ": size overflow"
20331746-- copy \"breaks the link\" to the original array, allowing it to be
20341747-- garbage collected if there are no other live references to it.
20351748copy :: Text -> Text
2036−copy = P.id -- TODO
2037−-- copy (Text arr off len) = Text (A.run go) 0 len
2038−-- where
2039−-- go :: ST s (A.MArray s)
2040−-- go = do
2041−-- marr <- A.new len
2042−
2043−foreign import javascript unsafe
2044− "h$jsstringReplicateChar" js_replicateChar :: Int -> Char -> JSString
2045−foreign import javascript unsafe
2046− "$2.substr($1)" js_substr1 :: Int -> JSString -> JSString
2047−
2048−-------------------------------------------------
2049−-- NOTE: the named chunk below used by doctest;
2050−-- verify the doctests via `doctest -fobject-code Data/Text.hs`
2051−
2052−-- $setup
2053−-- >>> :set -XOverloadedStrings
2054−-- >>> import qualified Data.Text as T
1749+copy (Text arr off len) = Text (A.run go) 0 len
1750+ where
1751+ go :: ST s (A.MArray s)
1752+ go = do
1753+ marr <- A.new len
1754+ A.copyI marr 0 arr off len
1755+ return marr