@@ -6,7 +6,7 @@
66#if __GLASGOW_HASKELL__ >= 708
77{-# LANGUAGE TypeFamilies #-}
88#endif
9−
9+{-# LANGUAGE ForeignFunctionInterface, JavaScriptFFI, UnliftedFFITypes #-}
1010-- |
1111-- Module : Data.Text
1212-- Copyright : (c) 2009, 2010, 2011, 2012 Bryan O'Sullivan,
@@ -15,7 +15,6 @@
1515--
1616-- License : BSD-style
1717-- Maintainer : bos@serpentine.com
18−-- Stability : experimental
1918-- Portability : GHC
2019--
2120-- A time and space-efficient implementation of Unicode text.
@@ -32,8 +31,9 @@
3231--
3332-- To use an extended and very rich family of functions for working
3433-- with Unicode text (including normalization, regular expressions,
35−-- non-standard encodings, text breaking, and locales), see
36−-- <http://hackage.haskell.org/package/text-icu the text-icu package >.
34+-- non-standard encodings, text breaking, and locales), see the
35+-- <http://hackage.haskell.org/package/text-icu text-icu package >.
36+--
3737
3838module Data.Text
3939 (
@@ -43,6 +43,9 @@ module Data.Text
4343 -- * Acceptable data
4444 -- $replacement
4545
46+ -- * Definition of character
47+ -- $character_definition
48+
4649 -- * Fusion
4750 -- $fusion
4851
@@ -60,6 +63,7 @@ module Data.Text
6063 , snoc
6164 , append
6265 , uncons
66+ , unsnoc
6367 , head
6468 , last
6569 , tail
@@ -223,16 +227,17 @@ import qualified Data.Text.Internal.Fusion as S
223227import qualified Data.Text.Internal.Fusion.Common as S
224228import Data.Text.Encoding (decodeUtf8', encodeUtf8)
225229import Data.Text.Internal.Fusion (stream, reverseStream, unstream)
226−import Data.Text.Internal.Private (span_)
227−import Data.Text.Internal (Text(..), empty, firstf, mul, safe, text)
228−import Data.Text.Show (singleton, unpack, unpackCString#)
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#)
229233import qualified Prelude as P
230234import Data.Text.Unsafe (Iter(..), iter, iter_, lengthWord16, reverseIter,
231− reverseIter_, unsafeHead, unsafeTail)
235+ reverseIter_, unsafeHead, unsafeTail,
236+ unsafeDupablePerformIO)
232237import Data.Text.Internal.Unsafe.Char (unsafeChr)
233238import qualified Data.Text.Internal.Functions as F
234239import qualified Data.Text.Internal.Encoding.Utf16 as U16
235−import Data.Text.Internal.Search (indices)
240+-- import Data.Text.Internal.Search (indices)
236241#if defined(__HADDOCK__)
237242import Data.ByteString (ByteString)
238243import qualified Data.Text.Lazy as L
@@ -246,6 +251,68 @@ import qualified GHC.Exts as Exts
246251import Text.Printf (PrintfArg, formatArg, formatString)
247252#endif
248253
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+
249316-- $strict
250317--
251318-- This package provides both strict and lazy 'Text' types. The
@@ -321,22 +388,31 @@ import Text.Printf (PrintfArg, formatArg, formatString)
321388-- Functions that can be fused by the compiler are documented with the
322389-- phrase \"Subject to fusion\".
323390
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 (==) #-}
324396instance Eq Text where
325− Text arrA offA lenA == Text arrB offB lenB
326− | lenA == lenB = A.equal arrA offA arrB offB lenA
327− | otherwise = False
328− {-# INLINE (==) #-}
397+ Text x == Text y = x == y
398+
399+-- instance Ord Text where
400+-- compare = compareText
329401
330402instance Ord Text where
331− compare = compareText
403+ compare (Text x) (Text y) = compare x y
332404
333405instance Read Text where
334406 readsPrec p str = [(pack x,y) | (x,y) <- readsPrec p str]
335407
336408#if MIN_VERSION_base(4,9,0)
337−-- Semigroup orphan instances for older GHCs are provided by
338−-- 'semigroups` package
339−
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
340416instance Semigroup Text where
341417 (<>) = append
342418#endif
@@ -354,6 +430,7 @@ instance IsString Text where
354430 fromString = pack
355431
356432#if __GLASGOW_HASKELL__ >= 708
433+-- | @since 1.2.0.0
357434instance Exts.IsList Text where
358435 type Item Text = Char
359436 fromList = pack
@@ -364,6 +441,7 @@ instance Exts.IsList Text where
364441instance NFData Text where rnf !_ = ()
365442#endif
366443
444+-- | @since 1.2.1.0
367445instance Binary Text where
368446 put t = put (encodeUtf8 t)
369447 get = do
@@ -397,8 +475,10 @@ instance Data Text where
397475
398476#if MIN_VERSION_base(4,7,0)
399477-- | Only defined for @base-4.7.0.0@ and later
478+--
479+-- @since 1.2.2.0
400480instance PrintfArg Text where
401− formatArg txt = formatString $ unpack txt
481+ formatArg t = formatString $ unpack t
402482#endif
403483
404484packConstr :: Constr
@@ -407,19 +487,19 @@ packConstr = mkConstr textDataType "pack" [] Prefix
407487textDataType :: DataType
408488textDataType = mkDataType "Data.Text.Text" [packConstr]
409489
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
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
423503
424504-- -----------------------------------------------------------------------------
425505-- * Conversion to/from 'Text'
@@ -427,7 +507,8 @@ compareText ta@(Text _arrA _offA lenA) tb@(Text _arrB _offB lenB)
427507-- | /O(n)/ Convert a 'String' into a 'Text'. Subject to
428508-- fusion. Performs replacement on invalid scalar values.
429509pack :: String -> Text
430−pack = unstream . S.map safe . S.streamList
510+pack = coerce JSS.pack
511+-- pack = unstream . S.map safe . S.streamList
431512{-# INLINE [1] pack #-}
432513
433514-- -----------------------------------------------------------------------------
@@ -438,7 +519,8 @@ pack = unstream . S.map safe . S.streamList
438519-- copying a new array. Subject to fusion. Performs replacement on
439520-- invalid scalar values.
440521cons :: Char -> Text -> Text
441−cons c t = unstream (S.cons (safe c) (stream t))
522+cons = coerce JSS.cons
523+-- cons c t = unstream (S.cons (safe c) (stream t))
442524{-# INLINE cons #-}
443525
444526infixr 5 `cons`
@@ -447,25 +529,27 @@ infixr 5 `cons`
447529-- entire array in the process, unless fused. Subject to fusion.
448530-- Performs replacement on invalid scalar values.
449531snoc :: Text -> Char -> Text
450−snoc t c = unstream (S.snoc (stream t) (safe c))
532+snoc = coerce JSS.snoc
533+-- snoc t c = unstream (S.snoc (stream t) (safe c))
451534{-# INLINE snoc #-}
452535
453536-- | /O(n)/ Appends one 'Text' to the other by copying both of them
454537-- into a new 'Text'. Subject to fusion.
455538append :: Text -> Text -> Text
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
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
469553{-# NOINLINE append #-}
470554
471555{-# RULES
@@ -478,16 +562,18 @@ append a@(Text arr1 off1 len1) b@(Text arr2 off2 len2)
478562-- | /O(1)/ Returns the first character of a 'Text', which must be
479563-- non-empty. Subject to fusion.
480564head :: Text -> Char
481−head t = S.head (stream t)
565+head = coerce JSS.head
566+-- head t = S.head (stream t)
482567{-# INLINE head #-}
483568
484569-- | /O(1)/ Returns the first character and rest of a 'Text', or
485570-- 'Nothing' if empty. Subject to fusion.
486571uncons :: Text -> Maybe (Char, Text)
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))
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))
491577{-# INLINE [1] uncons #-}
492578
493579-- | Lifted from Control.Arrow and specialized.
@@ -497,12 +583,13 @@ second f (a, b) = (a, f b)
497583-- | /O(1)/ Returns the last character of a 'Text', which must be
498584-- non-empty. Subject to fusion.
499585last :: Text -> Char
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)
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)
506593{-# INLINE [1] last #-}
507594
508595{-# RULES
@@ -515,10 +602,11 @@ last (Text arr off len)
515602-- | /O(1)/ Returns all characters after the head of a 'Text', which
516603-- must be non-empty. Subject to fusion.
517604tail :: Text -> Text
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
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
522610{-# INLINE [1] tail #-}
523611
524612{-# RULES
@@ -531,11 +619,12 @@ tail t@(Text arr off len)
531619-- | /O(1)/ Returns all but the last character of a 'Text', which must
532620-- be non-empty. Subject to fusion.
533621init :: Text -> Text
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)
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)
539628{-# INLINE [1] init #-}
540629
541630{-# RULES
@@ -545,14 +634,28 @@ init (Text arr off len) | len <= 0 = emptyError "init"
545634 unstream (S.init (stream t)) = init t
546635 #-}
547636
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 (Text arr off len)
643+ | len <= 0 = Nothing
644+ | n < 0xDC00 || n > 0xDFFF = Just (text arr off (len-1), unsafeChr n)
645+ | otherwise = Just (text arr off (len-2), U16.chr2 n0 n)
646+ where n = A.unsafeIndex arr (off+len-1)
647+ n0 = A.unsafeIndex arr (off+len-2)
648+{-# INLINE [1] unsnoc #-}
649+
548650-- | /O(1)/ Tests whether a 'Text' is empty or not. Subject to
549651-- fusion.
550652null :: Text -> Bool
551−null (Text _arr _off len) =
552−#if defined(ASSERTS)
553− assert (len >= 0) $
554−#endif
555− len <= 0
653+null = coerce JSS.null
654+-- null (Text _arr _off len) =
655+-- #if defined(ASSERTS)
656+-- assert (len >= 0) $
657+-- #endif
658+-- len <= 0
556659{-# INLINE [1] null #-}
557660
558661{-# RULES
@@ -564,14 +667,15 @@ null (Text _arr _off len) =
564667
565668-- | /O(1)/ Tests whether a 'Text' contains exactly one character.
566669-- Subject to fusion.
567−isSingleton :: Text -> Bool
568−isSingleton = S.isSingleton . stream
569−{-# INLINE isSingleton #-}
670+-- isSingleton :: Text -> Bool
671+-- isSingleton = S.isSingleton . stream
672+-- {-# INLINE isSingleton #-}
570673
571674-- | /O(n)/ Returns the number of characters in a 'Text'.
572675-- Subject to fusion.
573676length :: Text -> Int
574−length t = S.length (stream t)
677+length = coerce JSS.length
678+-- length t = S.length (stream t)
575679{-# INLINE [0] length #-}
576680-- length needs to be phased after the compareN/length rules otherwise
577681-- it may inline before the rules have an opportunity to fire.
@@ -624,29 +728,58 @@ compareLength t n = S.compareLengthI (stream t) n
624728-- -----------------------------------------------------------------------------
625729-- * Transformations
626730-- | /O(n)/ 'map' @f@ @t@ is the 'Text' obtained by applying @f@ to
627−-- each element of @t@. Subject to fusion. Performs replacement on
628−-- invalid scalar values.
731+-- each element of @t@.
732+--
733+-- Example:
734+--
735+-- >>> let message = pack "I am not angry. Not at all."
736+-- >>> T.map (\c -> if c == '.' then '!' else c) message
737+-- "I am not angry! Not at all!"
738+--
739+-- Subject to fusion. Performs replacement on invalid scalar values.
629740map :: (Char -> Char) -> Text -> Text
630−map f t = unstream (S.map (safe . f) (stream t))
741+map = coerce JSS.map
742+-- map f t = unstream (S.map (safe . f) (stream t))
631743{-# INLINE [1] map #-}
632744
633745-- | /O(n)/ The 'intercalate' function takes a 'Text' and a list of
634746-- 'Text's and concatenates the list after interspersing the first
635747-- argument between each element of the list.
748+--
749+-- Example:
750+--
751+-- >>> T.intercalate "NI!" ["We", "seek", "the", "Holy", "Grail"]
752+-- "WeNI!seekNI!theNI!HolyNI!Grail"
636753intercalate :: Text -> [Text] -> Text
637−intercalate t = concat . (F.intersperse t)
754+intercalate = coerce JSS.intercalate
755+-- intercalate t = concat . (F.intersperse t)
638756{-# INLINE intercalate #-}
639757
640758-- | /O(n)/ The 'intersperse' function takes a character and places it
641−-- between the characters of a 'Text'. Subject to fusion. Performs
642−-- replacement on invalid scalar values.
759+-- between the characters of a 'Text'.
760+--
761+-- Example:
762+--
763+-- >>> T.intersperse '.' "SHIELD"
764+-- "S.H.I.E.L.D"
765+--
766+-- Subject to fusion. Performs replacement on invalid scalar values.
643767intersperse :: Char -> Text -> Text
644−intersperse c t = unstream (S.intersperse (safe c) (stream t))
768+intersperse = coerce JSS.intersperse
769+-- intersperse c t = unstream (S.intersperse (safe c) (stream t))
645770{-# INLINE intersperse #-}
646771
647−-- | /O(n)/ Reverse the characters of a string. Subject to fusion.
772+-- | /O(n)/ Reverse the characters of a string.
773+--
774+-- Example:
775+--
776+-- >>> T.reverse "desrever"
777+-- "reversed"
778+--
779+-- Subject to fusion.
648780reverse :: Text -> Text
649−reverse t = S.reverse (stream t)
781+reverse = coerce JSS.reverse
782+-- reverse t = S.reverse (stream t)
650783{-# INLINE reverse #-}
651784
652785-- | /O(m+n)/ Replace every non-overlapping occurrence of @needle@ in
@@ -663,12 +796,14 @@ reverse t = S.reverse (stream t)
663796-- @needle@ occurs in @replacement@, that occurrence will /not/ itself
664797-- be replaced recursively:
665798--
666−-- > replace "oo" "foo" "oo" == "foo"
799+-- >>> replace "oo" "foo" "oo"
800+-- "foo"
667801--
668802-- In cases where several instances of @needle@ overlap, only the
669803-- first one will be replaced:
670804--
671−-- > replace "ofo" "bar" "ofofo" == "barfo"
805+-- >>> replace "ofo" "bar" "ofofo"
806+-- "barfo"
672807--
673808-- In (unlikely) bad cases, this function's time complexity degrades
674809-- towards /O(n*m)/.
@@ -680,28 +815,29 @@ replace :: Text
680815 -> Text
681816 -- ^ @haystack@ in which to search.
682817 -> Text
683−replace needle@(Text _ _ neeLen)
684− (Text repArr repOff repLen)
685− haystack@(Text hayArr hayOff hayLen)
686− | neeLen == 0 = emptyError "replace"
687− | L.null ixs = haystack
688− | len > 0 = Text (A.run x) 0 len
689− | otherwise = empty
690− where
691− ixs = indices needle haystack
692− len = hayLen - (neeLen - repLen) `mul` L.length ixs
693− x :: ST s (A.MArray s)
694− x = do
695− marr <- A.new len
696− let loop (i:is) o d = do
697− let d0 = d + i - o
698− d1 = d0 + repLen
699− A.copyI marr d hayArr (hayOff+o) d0
700− A.copyI marr d0 repArr repOff d1
701− loop is (i + neeLen) d1
702− loop [] o d = A.copyI marr d hayArr (hayOff+o) len
703− loop ixs 0 0
704− return marr
818+replace = coerce JSS.replace
819+-- replace needle@(Text _ _ neeLen)
820+-- (Text repArr repOff repLen)
821+-- haystack@(Text hayArr hayOff hayLen)
822+-- | neeLen == 0 = emptyError "replace"
823+-- | L.null ixs = haystack
824+-- | len > 0 = Text (A.run x) 0 len
825+-- | otherwise = empty
826+-- where
827+-- ixs = indices needle haystack
828+-- len = hayLen - (neeLen - repLen) `mul` L.length ixs
829+-- x :: ST s (A.MArray s)
830+-- x = do
831+-- marr <- A.new len
832+-- let loop (i:is) o d = do
833+-- let d0 = d + i - o
834+-- d1 = d0 + repLen
835+-- A.copyI marr d hayArr (hayOff+o) d0
836+-- A.copyI marr d0 repArr repOff d1
837+-- loop is (i + neeLen) d1
838+-- loop [] o d = A.copyI marr d hayArr (hayOff+o) len
839+-- loop ixs 0 0
840+-- return marr
705841
706842-- ----------------------------------------------------------------------------
707843-- ** Case conversions (folds)
@@ -740,7 +876,8 @@ replace needle@(Text _ _ neeLen)
740876-- U+00B5) is case folded to \"μ\" (small letter mu, U+03BC)
741877-- instead of itself.
742878toCaseFold :: Text -> Text
743−toCaseFold t = unstream (S.toCaseFold (stream t))
879+-- toCaseFold t = unstream (S.toCaseFold (stream t))
880+toCaseFold = coerce JSS.toCaseFold
744881{-# INLINE toCaseFold #-}
745882
746883-- | /O(n)/ Convert a string to lower case, using simple case
@@ -751,7 +888,8 @@ toCaseFold t = unstream (S.toCaseFold (stream t))
751888-- U+0130) maps to the sequence \"i\" (Latin small letter i, U+0069)
752889-- followed by \" ̇\" (combining dot above, U+0307).
753890toLower :: Text -> Text
754−toLower t = unstream (S.toLower (stream t))
891+-- toLower t = unstream (S.toLower (stream t))
892+toLower = coerce JSS.toLower
755893{-# INLINE toLower #-}
756894
757895-- | /O(n)/ Convert a string to upper case, using simple case
@@ -761,7 +899,8 @@ toLower t = unstream (S.toLower (stream t))
761899-- instance, the German \"ß\" (eszett, U+00DF) maps to the
762900-- two-letter sequence \"SS\".
763901toUpper :: Text -> Text
764−toUpper t = unstream (S.toUpper (stream t))
902+-- toUpper t = unstream (S.toUpper (stream t))
903+toUpper = coerce JSS.toUpper
765904{-# INLINE toUpper #-}
766905
767906-- | /O(n)/ Convert a string to title case, using simple case
@@ -782,8 +921,11 @@ toUpper t = unstream (S.toUpper (stream t))
782921-- guides disagree on whether the book name \"The Hill of the Red
783922-- Fox\" is correctly title cased—but this function will
784923-- capitalize /every/ word.
924+--
925+-- @since 1.0.0.0
785926toTitle :: Text -> Text
786−toTitle t = unstream (S.toTitle (stream t))
927+toTitle = coerce JSS.toTitle
928+-- toTitle t = unstream (S.toTitle (stream t))
787929{-# INLINE toTitle #-}
788930
789931-- | /O(n)/ Left-justify a string to the given length, using the
@@ -792,13 +934,17 @@ toTitle t = unstream (S.toTitle (stream t))
792934--
793935-- Examples:
794936--
795−-- > justifyLeft 7 'x' "foo" == "fooxxxx"
796−-- > justifyLeft 3 'x' "foobar" == "foobar"
937+-- >>> justifyLeft 7 'x' "foo"
938+-- "fooxxxx"
939+--
940+-- >>> justifyLeft 3 'x' "foobar"
941+-- "foobar"
797942justifyLeft :: Int -> Char -> Text -> Text
798−justifyLeft k c t
799− | len >= k = t
800− | otherwise = t `append` replicateChar (k-len) c
801− where len = length t
943+justifyLeft = coerce JSS.justifyLeft
944+-- justifyLeft k c t
945+-- | len >= k = t
946+-- | otherwise = t `append` replicateChar (k-len) c
947+-- where len = length t
802948{-# INLINE [1] justifyLeft #-}
803949
804950{-# RULES
@@ -814,13 +960,17 @@ justifyLeft k c t
814960--
815961-- Examples:
816962--
817−-- > justifyRight 7 'x' "bar" == "xxxxbar"
818−-- > justifyRight 3 'x' "foobar" == "foobar"
963+-- >>> justifyRight 7 'x' "bar"
964+-- "xxxxbar"
965+--
966+-- >>> justifyRight 3 'x' "foobar"
967+-- "foobar"
819968justifyRight :: Int -> Char -> Text -> Text
820−justifyRight k c t
821− | len >= k = t
822− | otherwise = replicateChar (k-len) c `append` t
823− where len = length t
969+justifyRight = coerce JSS.justifyRight
970+-- justifyRight k c t
971+-- | len >= k = t
972+-- | otherwise = replicateChar (k-len) c `append` t
973+-- where len = length t
824974{-# INLINE justifyRight #-}
825975
826976-- | /O(n)/ Center a string to the given length, using the specified
@@ -829,23 +979,34 @@ justifyRight k c t
829979--
830980-- Examples:
831981--
832−-- > center 8 'x' "HS" = "xxxHSxxx"
982+-- >>> center 8 'x' "HS"
983+-- "xxxHSxxx"
833984center :: Int -> Char -> Text -> Text
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
985+center = coerce JSS.center
986+-- center k c t
987+-- | len >= k = t
988+-- | otherwise = replicateChar l c `append` t `append` replicateChar r c
989+-- where len = length t
990+-- d = k - len
991+-- r = d `quot` 2
992+-- l = d - r
841993{-# INLINE center #-}
842994
843995-- | /O(n)/ The 'transpose' function transposes the rows and columns
844996-- of its 'Text' argument. Note that this function uses 'pack',
845997-- 'unpack', and the list version of transpose, and is thus not very
846998-- efficient.
999+--
1000+-- Examples:
1001+--
1002+-- >>> transpose ["green","orange"]
1003+-- ["go","rr","ea","en","ng","e"]
1004+--
1005+-- >>> transpose ["blue","red"]
1006+-- ["br","le","ud","e"]
8471007transpose :: [Text] -> [Text]
848−transpose ts = P.map pack (L.transpose (P.map unpack ts))
1008+transpose = coerce JSS.transpose
1009+-- transpose ts = P.map pack (L.transpose (P.map unpack ts))
8491010
8501011-- -----------------------------------------------------------------------------
8511012-- * Reducing 'Text's (folds)
@@ -855,23 +1016,27 @@ transpose ts = P.map pack (L.transpose (P.map unpack ts))
8551016-- reduces the 'Text' using the binary operator, from left to right.
8561017-- Subject to fusion.
8571018foldl :: (a -> Char -> a) -> a -> Text -> a
858−foldl f z t = S.foldl f z (stream t)
1019+foldl f a0 (Text t) = JSS.foldl f a0 t
1020+-- foldl f z t = S.foldl f z (stream t)
8591021{-# INLINE foldl #-}
8601022
8611023-- | /O(n)/ A strict version of 'foldl'. Subject to fusion.
8621024foldl' :: (a -> Char -> a) -> a -> Text -> a
863−foldl' f z t = S.foldl' f z (stream t)
1025+foldl' f a0 (Text t) = JSS.foldl' f a0 t
1026+-- foldl' f z t = S.foldl' f z (stream t)
8641027{-# INLINE foldl' #-}
8651028
8661029-- | /O(n)/ A variant of 'foldl' that has no starting value argument,
8671030-- and thus must be applied to a non-empty 'Text'. Subject to fusion.
8681031foldl1 :: (Char -> Char -> Char) -> Text -> Char
869−foldl1 f t = S.foldl1 f (stream t)
1032+foldl1 = coerce JSS.foldl1
1033+-- foldl1 f t = S.foldl1 f (stream t)
8701034{-# INLINE foldl1 #-}
8711035
8721036-- | /O(n)/ A strict version of 'foldl1'. Subject to fusion.
8731037foldl1' :: (Char -> Char -> Char) -> Text -> Char
874−foldl1' f t = S.foldl1' f (stream t)
1038+foldl1' = coerce JSS.foldl1'
1039+-- foldl1' f t = S.foldl1' f (stream t)
8751040{-# INLINE foldl1' #-}
8761041
8771042-- | /O(n)/ 'foldr', applied to a binary operator, a starting value
@@ -879,14 +1044,16 @@ foldl1' f t = S.foldl1' f (stream t)
8791044-- reduces the 'Text' using the binary operator, from right to left.
8801045-- Subject to fusion.
8811046foldr :: (Char -> a -> a) -> a -> Text -> a
882−foldr f z t = S.foldr f z (stream t)
1047+foldr f a0 (Text t) = JSS.foldr f a0 t
1048+-- foldr f z t = S.foldr f z (stream t)
8831049{-# INLINE foldr #-}
8841050
8851051-- | /O(n)/ A variant of 'foldr' that has no starting value argument,
8861052-- and thus must be applied to a non-empty 'Text'. Subject to
8871053-- fusion.
8881054foldr1 :: (Char -> Char -> Char) -> Text -> Char
889−foldr1 f t = S.foldr1 f (stream t)
1055+foldr1 = coerce JSS.foldr1
1056+-- foldr1 f t = S.foldr1 f (stream t)
8901057{-# INLINE foldr1 #-}
8911058
8921059-- -----------------------------------------------------------------------------
@@ -894,48 +1061,54 @@ foldr1 f t = S.foldr1 f (stream t)
8941061
8951062-- | /O(n)/ Concatenate a list of 'Text's.
8961063concat :: [Text] -> Text
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
1064+concat = coerce JSS.concat
1065+-- concat ts = case ts' of
1066+-- [] -> empty
1067+-- [t] -> t
1068+-- _ -> Text (A.run go) 0 len
1069+-- where
1070+-- ts' = L.filter (not . null) ts
1071+-- len = sumP "concat" $ L.map lengthWord16 ts'
1072+-- go :: ST s (A.MArray s)
1073+-- go = do
1074+-- arr <- A.new len
1075+-- let step i (Text a o l) =
1076+-- let !j = i + l in A.copyI arr i a o j >> return j
1077+-- foldM step 0 ts' >> return arr
9101078
9111079-- | /O(n)/ Map a function over a 'Text' that results in a 'Text', and
9121080-- concatenate the results.
9131081concatMap :: (Char -> Text) -> Text -> Text
914−concatMap f = concat . foldr ((:) . f) []
1082+concatMap = coerce JSS.concatMap
1083+-- concatMap f = concat . foldr ((:) . f) []
9151084{-# INLINE concatMap #-}
9161085
9171086-- | /O(n)/ 'any' @p@ @t@ determines whether any character in the
9181087-- 'Text' @t@ satisfies the predicate @p@. Subject to fusion.
9191088any :: (Char -> Bool) -> Text -> Bool
920−any p t = S.any p (stream t)
1089+any = coerce JSS.any
1090+-- any p t = S.any p (stream t)
9211091{-# INLINE any #-}
9221092
9231093-- | /O(n)/ 'all' @p@ @t@ determines whether all characters in the
9241094-- 'Text' @t@ satisfy the predicate @p@. Subject to fusion.
9251095all :: (Char -> Bool) -> Text -> Bool
926−all p t = S.all p (stream t)
1096+all = coerce JSS.all
1097+-- all p t = S.all p (stream t)
9271098{-# INLINE all #-}
9281099
9291100-- | /O(n)/ 'maximum' returns the maximum value from a 'Text', which
9301101-- must be non-empty. Subject to fusion.
9311102maximum :: Text -> Char
932−maximum t = S.maximum (stream t)
1103+maximum = coerce JSS.maximum
1104+-- maximum t = S.maximum (stream t)
9331105{-# INLINE maximum #-}
9341106
9351107-- | /O(n)/ 'minimum' returns the minimum value from a 'Text', which
9361108-- must be non-empty. Subject to fusion.
9371109minimum :: Text -> Char
938−minimum t = S.minimum (stream t)
1110+minimum = coerce JSS.minimum
1111+-- minimum t = S.minimum (stream t)
9391112{-# INLINE minimum #-}
9401113
9411114-- -----------------------------------------------------------------------------
@@ -951,8 +1124,9 @@ minimum t = S.minimum (stream t)
9511124--
9521125-- > last (scanl f z xs) == foldl f z xs.
9531126scanl :: (Char -> Char -> Char) -> Char -> Text -> Text
954−scanl f z t = unstream (S.scanl g z (stream t))
955− where g a b = safe (f a b)
1127+scanl = coerce JSS.scanl
1128+-- scanl f z t = unstream (S.scanl g z (stream t))
1129+-- where g a b = safe (f a b)
9561130{-# INLINE scanl #-}
9571131
9581132-- | /O(n)/ 'scanl1' is a variant of 'scanl' that has no starting
@@ -961,8 +1135,9 @@ scanl f z t = unstream (S.scanl g z (stream t))
9611135--
9621136-- > scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]
9631137scanl1 :: (Char -> Char -> Char) -> Text -> Text
964−scanl1 f t | null t = empty
965− | otherwise = scanl f (unsafeHead t) (unsafeTail t)
1138+scanl1 = coerce JSS.scanl1
1139+-- scanl1 f t | null t = empty
1140+-- | otherwise = scanl f (unsafeHead t) (unsafeTail t)
9661141{-# INLINE scanl1 #-}
9671142
9681143-- | /O(n)/ 'scanr' is the right-to-left dual of 'scanl'. Performs
@@ -970,16 +1145,18 @@ scanl1 f t | null t = empty
9701145--
9711146-- > scanr f v == reverse . scanl (flip f) v . reverse
9721147scanr :: (Char -> Char -> Char) -> Char -> Text -> Text
973−scanr f z = S.reverse . S.reverseScanr g z . reverseStream
974− where g a b = safe (f a b)
1148+scanr = coerce JSS.scanr
1149+-- scanr f z = S.reverse . S.reverseScanr g z . reverseStream
1150+-- where g a b = safe (f a b)
9751151{-# INLINE scanr #-}
9761152
9771153-- | /O(n)/ 'scanr1' is a variant of 'scanr' that has no starting
9781154-- value argument. Subject to fusion. Performs replacement on
9791155-- invalid scalar values.
9801156scanr1 :: (Char -> Char -> Char) -> Text -> Text
981−scanr1 f t | null t = empty
982− | otherwise = scanr f (last t) (init t)
1157+scanr1 = coerce JSS.scanr1
1158+-- scanr1 f t | null t = empty
1159+-- | otherwise = scanr f (last t) (init t)
9831160{-# INLINE scanr1 #-}
9841161
9851162-- | /O(n)/ Like a combination of 'map' and 'foldl''. Applies a
@@ -987,8 +1164,11 @@ scanr1 f t | null t = empty
9871164-- parameter from left to right, and returns a final 'Text'. Performs
9881165-- replacement on invalid scalar values.
9891166mapAccumL :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
990−mapAccumL f z0 = S.mapAccumL g z0 . stream
991− where g a b = second safe (f a b)
1167+mapAccumL f z0 (Text a) =
1168+ let (a', t) = JSS.mapAccumL f z0 a
1169+ in (a', Text t)
1170+-- mapAccumL f z0 = S.mapAccumL g z0 . stream
1171+-- where g a b = second safe (f a b)
9921172{-# INLINE mapAccumL #-}
9931173
9941174-- | The 'mapAccumR' function behaves like a combination of 'map' and
@@ -998,8 +1178,11 @@ mapAccumL f z0 = S.mapAccumL g z0 . stream
9981178-- 'Text'.
9991179-- Performs replacement on invalid scalar values.
10001180mapAccumR :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
1001−mapAccumR f z0 = second reverse . S.mapAccumL g z0 . reverseStream
1002− where g a b = second safe (f a b)
1181+mapAccumR f z0 (Text a) =
1182+ let (a', t) = JSS.mapAccumR f z0 a
1183+ in (a', Text t)
1184+-- mapAccumR f z0 = second reverse . S.mapAccumL g z0 . reverseStream
1185+-- where g a b = second safe (f a b)
10031186{-# INLINE mapAccumR #-}
10041187
10051188-- -----------------------------------------------------------------------------
@@ -1008,20 +1191,21 @@ mapAccumR f z0 = second reverse . S.mapAccumL g z0 . reverseStream
10081191-- | /O(n*m)/ 'replicate' @n@ @t@ is a 'Text' consisting of the input
10091192-- @t@ repeated @n@ times.
10101193replicate :: Int -> Text -> Text
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
1194+replicate = coerce JSS.replicate
1195+-- replicate n t@(Text a o l)
1196+-- | n <= 0 || l <= 0 = empty
1197+-- | n == 1 = t
1198+-- | isSingleton t = replicateChar n (unsafeHead t)
1199+-- | otherwise = Text (A.run x) 0 len
1200+-- where
1201+-- len = l `mul` n
1202+-- x :: ST s (A.MArray s)
1203+-- x = do
1204+-- arr <- A.new len
1205+-- let loop !d !i | i >= n = return arr
1206+-- | otherwise = let m = d + l
1207+-- in A.copyI arr d a o m >> loop m (i+1)
1208+-- loop 0 0
10251209{-# INLINE [1] replicate #-}
10261210
10271211{-# RULES
@@ -1032,8 +1216,19 @@ replicate n t@(Text a o l)
10321216-- | /O(n)/ 'replicateChar' @n@ @c@ is a 'Text' of length @n@ with @c@ the
10331217-- value of every element. Subject to fusion.
10341218replicateChar :: Int -> Char -> Text
1219+#ifndef __GHCJS__
10351220replicateChar n c = unstream (S.replicateCharI n (safe c))
10361221{-# INLINE replicateChar #-}
1222+#else
1223+replicateChar n c = Text $ js_replicateChar n c
1224+{-# INLINE [1] replicateChar #-}
1225+{-# RULES
1226+"JSSTRING replicateChar -> fused" [~1] forall n c.
1227+ replicateChar n c = unstream (S.replicateCharI n (safe c))
1228+"JSSTRING replicateChar -> unfused" [1] forall n c.
1229+ unstream (S.replicateCharI n (safe c)) = replicateChar n c
1230+ #-}
1231+#endif
10371232
10381233-- | /O(n)/, where @n@ is the length of the result. The 'unfoldr'
10391234-- function is analogous to the List 'L.unfoldr'. 'unfoldr' builds a
@@ -1043,7 +1238,8 @@ replicateChar n c = unstream (S.replicateCharI n (safe c))
10431238-- string, and @b@ is the seed value for further production. Subject
10441239-- to fusion. Performs replacement on invalid scalar values.
10451240unfoldr :: (a -> Maybe (Char,a)) -> a -> Text
1046−unfoldr f s = unstream (S.unfoldr (firstf safe . f) s)
1241+unfoldr f a = Text $ JSS.unfoldr f a
1242+-- unfoldr f s = unstream (S.unfoldr (firstf safe . f) s)
10471243{-# INLINE unfoldr #-}
10481244
10491245-- | /O(n)/ Like 'unfoldr', 'unfoldrN' builds a 'Text' from a seed
@@ -1053,7 +1249,8 @@ unfoldr f s = unstream (S.unfoldr (firstf safe . f) s)
10531249-- correct, otherwise its performance is similar to 'unfoldr'. Subject
10541250-- to fusion. Performs replacement on invalid scalar values.
10551251unfoldrN :: Int -> (a -> Maybe (Char,a)) -> a -> Text
1056−unfoldrN n f s = unstream (S.unfoldrN n (firstf safe . f) s)
1252+unfoldrN n f a0 = Text $ JSS.unfoldrN n f a0
1253+-- unfoldrN n f s = unstream (S.unfoldrN n (firstf safe . f) s)
10571254{-# INLINE unfoldrN #-}
10581255
10591256-- -----------------------------------------------------------------------------
@@ -1063,18 +1260,19 @@ unfoldrN n f s = unstream (S.unfoldrN n (firstf safe . f) s)
10631260-- 'Text' of length @n@, or the 'Text' itself if @n@ is greater than
10641261-- the length of the Text. Subject to fusion.
10651262take :: Int -> Text -> Text
1066−take n t@(Text arr off len)
1067− | n <= 0 = empty
1068− | n >= len = t
1069− | otherwise = text arr off (iterN n t)
1263+take = coerce JSS.take
1264+-- take n t@(Text arr off len)
1265+-- | n <= 0 = empty
1266+-- | n >= len = t
1267+-- | otherwise = text arr off (iterN n t)
10701268{-# INLINE [1] take #-}
10711269
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
1270+-- iterN :: Int -> Text -> Int
1271+-- iterN n t@(Text _arr _off len) = loop 0 0
1272+-- where loop !i !cnt
1273+-- | i >= len || cnt >= n = i
1274+-- | otherwise = loop (i+d) (cnt+1)
1275+-- where d = iter_ t i
10781276
10791277{-# RULES
10801278"TEXT take -> fused" [~1] forall n t.
@@ -1088,31 +1286,36 @@ iterN n t@(Text _arr _off len) = loop 0 0
10881286--
10891287-- Examples:
10901288--
1091−-- > takeEnd 3 "foobar" == "bar"
1289+-- >>> takeEnd 3 "foobar"
1290+-- "bar"
1291+--
1292+-- @since 1.1.1.0
10921293takeEnd :: Int -> Text -> Text
1093−takeEnd n t@(Text arr off len)
1094− | n <= 0 = empty
1095− | n >= len = t
1096− | otherwise = text arr (off+i) (len-i)
1097− where i = iterNEnd n t
1098−
1099−iterNEnd :: Int -> Text -> Int
1100−iterNEnd n t@(Text _arr _off len) = loop (len-1) n
1101− where loop i !m
1102− | i <= 0 = 0
1103− | m <= 1 = i
1104− | otherwise = loop (i+d) (m-1)
1105− where d = reverseIter_ t i
1294+takeEnd = coerce JSS.takeEnd
1295+-- takeEnd n t@(Text arr off len)
1296+-- | n <= 0 = empty
1297+-- | n >= len = t
1298+-- | otherwise = text arr (off+i) (len-i)
1299+-- where i = iterNEnd n t
1300+
1301+-- iterNEnd :: Int -> Text -> Int
1302+-- iterNEnd n t@(Text _arr _off len) = loop (len-1) n
1303+-- where loop i !m
1304+-- | i <= 0 = 0
1305+-- | m <= 1 = i
1306+-- | otherwise = loop (i+d) (m-1)
1307+-- where d = reverseIter_ t i
11061308
11071309-- | /O(n)/ 'drop' @n@, applied to a 'Text', returns the suffix of the
11081310-- 'Text' after the first @n@ characters, or the empty 'Text' if @n@
11091311-- is greater than the length of the 'Text'. Subject to fusion.
11101312drop :: Int -> Text -> Text
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
1313+drop = coerce JSS.drop
1314+-- drop n t@(Text arr off len)
1315+-- | n <= 0 = t
1316+-- | n >= len = empty
1317+-- | otherwise = text arr (off+i) (len-i)
1318+-- where i = iterN n t
11161319{-# INLINE [1] drop #-}
11171320
11181321{-# RULES
@@ -1127,22 +1330,27 @@ drop n t@(Text arr off len)
11271330--
11281331-- Examples:
11291332--
1130−-- > dropEnd 3 "foobar" == "foo"
1333+-- >>> dropEnd 3 "foobar"
1334+-- "foo"
1335+--
1336+-- @since 1.1.1.0
11311337dropEnd :: Int -> Text -> Text
1132−dropEnd n t@(Text arr off len)
1133− | n <= 0 = t
1134− | n >= len = empty
1135− | otherwise = text arr off (iterNEnd n t)
1338+dropEnd = coerce JSS.dropEnd
1339+-- dropEnd n t@(Text arr off len)
1340+-- | n <= 0 = t
1341+-- | n >= len = empty
1342+-- | otherwise = text arr off (iterNEnd n t)
11361343
11371344-- | /O(n)/ 'takeWhile', applied to a predicate @p@ and a 'Text',
11381345-- returns the longest prefix (possibly empty) of elements that
11391346-- satisfy @p@. Subject to fusion.
11401347takeWhile :: (Char -> Bool) -> Text -> Text
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
1348+takeWhile = coerce JSS.takeWhile
1349+-- takeWhile p t@(Text arr off len) = loop 0
1350+-- where loop !i | i >= len = t
1351+-- | p c = loop (i+d)
1352+-- | otherwise = text arr off i
1353+-- where Iter c d = iter t i
11461354{-# INLINE [1] takeWhile #-}
11471355
11481356{-# RULES
@@ -1157,13 +1365,25 @@ takeWhile p t@(Text arr off len) = loop 0
11571365-- satisfy @p@. Subject to fusion.
11581366-- Examples:
11591367--
1160−-- > takeWhileEnd (=='o') "foo" == "oo"
1368+-- >>> takeWhileEnd (=='o') "foo"
1369+-- "oo"
1370+--
1371+-- @since 1.2.2.0
11611372takeWhileEnd :: (Char -> Bool) -> Text -> Text
1373+#ifndef __GHCJS__
11621374takeWhileEnd p t@(Text arr off len) = loop (len-1) len
11631375 where loop !i !l | l <= 0 = t
11641376 | p c = loop (i+d) (l+d)
11651377 | otherwise = text arr (off+l) (len-l)
11661378 where (c,d) = reverseIter t i
1379+#else
1380+takeWhileEnd p t@(Text jst) = loop (len-1) len
1381+ where loop !i !l | l <= 0 = t
1382+ | p c = loop (i+d) (l+d)
1383+ | otherwise = Text $ js_substr1 l jst
1384+ where (c,d) = reverseIter t i
1385+ len = length t
1386+#endif
11671387{-# INLINE [1] takeWhileEnd #-}
11681388
11691389{-# RULES
@@ -1176,11 +1396,12 @@ takeWhileEnd p t@(Text arr off len) = loop (len-1) len
11761396-- | /O(n)/ 'dropWhile' @p@ @t@ returns the suffix remaining after
11771397-- 'takeWhile' @p@ @t@. Subject to fusion.
11781398dropWhile :: (Char -> Bool) -> Text -> Text
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
1399+dropWhile = coerce JSS.dropWhile
1400+-- dropWhile p t@(Text arr off len) = loop 0 0
1401+-- where loop !i !l | l >= len = empty
1402+-- | p c = loop (i+d) (l+d)
1403+-- | otherwise = Text arr (off+i) (len-l)
1404+
11841405{-# INLINE [1] dropWhile #-}
11851406
11861407{-# RULES
@@ -1196,13 +1417,15 @@ dropWhile p t@(Text arr off len) = loop 0 0
11961417--
11971418-- Examples:
11981419--
1199−-- > dropWhileEnd (=='.') "foo..." == "foo"
1420+-- >>> dropWhileEnd (=='.') "foo..."
1421+-- "foo"
12001422dropWhileEnd :: (Char -> Bool) -> Text -> Text
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
1423+dropWhileEnd = coerce JSS.dropWhileEnd
1424+-- dropWhileEnd p t@(Text arr off len) = loop (len-1) len
1425+-- where loop !i !l | l <= 0 = empty
1426+-- | p c = loop (i+d) (l+d)
1427+-- | otherwise = Text arr off l
1428+-- where (c,d) = reverseIter t i
12061429{-# INLINE [1] dropWhileEnd #-}
12071430
12081431{-# RULES
@@ -1245,45 +1468,49 @@ strip = dropAround isSpace
12451468-- prefix of @t@ of length @n@, and whose second is the remainder of
12461469-- the string. It is equivalent to @('take' n t, 'drop' n t)@.
12471470splitAt :: Int -> Text -> (Text, Text)
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))
1471+splitAt = coerce JSS.splitAt
1472+-- splitAt n t@(Text arr off len)
1473+-- | n <= 0 = (empty, t)
1474+-- | n >= len = (t, empty)
1475+-- | otherwise = let k = iterN n t
1476+-- in (text arr off k, text arr (off+k) (len-k))
12531477
12541478-- | /O(n)/ 'span', applied to a predicate @p@ and text @t@, returns
12551479-- a pair whose first element is the longest prefix (possibly empty)
12561480-- of @t@ of elements that satisfy @p@, and whose second is the
12571481-- remainder of the list.
12581482span :: (Char -> Bool) -> Text -> (Text, Text)
1259−span p t = case span_ p t of
1260− (# hd,tl #) -> (hd,tl)
1483+span = coerce JSS.span
1484+-- span p t = case span_ p t of
1485+-- (# hd,tl #) -> (hd,tl)
12611486{-# INLINE span #-}
12621487
12631488-- | /O(n)/ 'break' is like 'span', but the prefix returned is
12641489-- over elements that fail the predicate @p@.
12651490break :: (Char -> Bool) -> Text -> (Text, Text)
1266−break p = span (not . p)
1491+break = coerce JSS.break
1492+-- break p = span (not . p)
12671493{-# INLINE break #-}
12681494
12691495-- | /O(n)/ Group characters in a string according to a predicate.
12701496groupBy :: (Char -> Char -> Bool) -> Text -> [Text]
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))
1497+groupBy = coerce JSS.groupBy
1498+-- groupBy p = loop
1499+-- where
1500+-- loop t@(Text arr off len)
1501+-- | null t = []
1502+-- | otherwise = text arr off n : loop (text arr (off+n) (len-n))
1503+-- where Iter c d = iter t 0
1504+-- n = d + findAIndexOrEnd (not . p c) (Text arr (off+d) (len-d))
12781505
12791506-- | Returns the /array/ index (in units of 'Word16') at which a
12801507-- character may be found. This is /not/ the same as the logical
12811508-- index returned by e.g. 'findIndex'.
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
1509+-- findAIndexOrEnd :: (Char -> Bool) -> Text -> Int
1510+-- findAIndexOrEnd q t@(Text _arr _off len) = go 0
1511+-- where go !i | i >= len || q c = i
1512+-- | otherwise = go (i+d)
1513+-- where Iter c d = iter t i
12871514
12881515-- | /O(n)/ Group characters in a string by equality.
12891516group :: Text -> [Text]
@@ -1292,15 +1519,17 @@ group = groupBy (==)
12921519-- | /O(n)/ Return all initial segments of the given 'Text', shortest
12931520-- first.
12941521inits :: Text -> [Text]
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)
1522+inits = coerce JSS.inits
1523+-- inits t@(Text arr off len) = loop 0
1524+-- where loop i | i >= len = [t]
1525+-- | otherwise = Text arr off i : loop (i + iter_ t i)
12981526
12991527-- | /O(n)/ Return all final segments of the given 'Text', longest
13001528-- first.
13011529tails :: Text -> [Text]
1302−tails t | null t = [empty]
1303− | otherwise = t : tails (unsafeTail t)
1530+tails = coerce JSS.tails
1531+-- tails t | null t = [empty]
1532+-- | otherwise = t : tails (unsafeTail t)
13041533
13051534-- $split
13061535--
@@ -1314,9 +1543,14 @@ tails t | null t = [empty]
13141543--
13151544-- Examples:
13161545--
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" == ["",""]
1546+-- >>> splitOn "\r\n" "a\r\nb\r\nd\r\ne"
1547+-- ["a","b","d","e"]
1548+--
1549+-- >>> splitOn "aaa" "aaaXaaaXaaaXaaa"
1550+-- ["","X","X","X",""]
1551+--
1552+-- >>> splitOn "x" "x"
1553+-- ["",""]
13201554--
13211555-- and
13221556--
@@ -1333,13 +1567,14 @@ splitOn :: Text
13331567 -> Text
13341568 -- ^ Input text.
13351569 -> [Text]
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)]
1570+splitOn = coerce JSS.splitOn
1571+-- splitOn pat@(Text _ _ l) src@(Text arr off len)
1572+-- | l <= 0 = emptyError "splitOn"
1573+-- | isSingleton pat = split (== unsafeHead pat) src
1574+-- | otherwise = go 0 (indices pat src)
1575+-- where
1576+-- go !s (x:xs) = text arr (s+off) (x-s) : go (x+l) xs
1577+-- go s _ = [text arr (s+off) (len-s)]
13431578{-# INLINE [1] splitOn #-}
13441579
13451580{-# RULES
@@ -1352,28 +1587,36 @@ splitOn pat@(Text _ _ l) src@(Text arr off len)
13521587-- resulting components do not contain the separators. Two adjacent
13531588-- separators result in an empty component in the output. eg.
13541589--
1355−-- > split (=='a') "aabbaca" == ["","","bb","c",""]
1356−-- > split (=='a') "" == [""]
1590+-- >>> split (=='a') "aabbaca"
1591+-- ["","","bb","c",""]
1592+--
1593+-- >>> split (=='a') ""
1594+-- [""]
13571595split :: (Char -> Bool) -> Text -> [Text]
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
1596+split = coerce JSS.split
1597+-- split _ t@(Text _off _arr 0) = [t]
1598+-- split p t = loop t
1599+-- where loop s | null s' = [l]
1600+-- | otherwise = l : loop (unsafeTail s')
1601+-- where (# l, s' #) = span_ (not . p) s
13631602{-# INLINE split #-}
13641603
13651604-- | /O(n)/ Splits a 'Text' into components of length @k@. The last
13661605-- element may be shorter than the other chunks, depending on the
13671606-- length of the input. Examples:
13681607--
1369−-- > chunksOf 3 "foobarbaz" == ["foo","bar","baz"]
1370−-- > chunksOf 4 "haskell.org" == ["hask","ell.","org"]
1608+-- >>> chunksOf 3 "foobarbaz"
1609+-- ["foo","bar","baz"]
1610+--
1611+-- >>> chunksOf 4 "haskell.org"
1612+-- ["hask","ell.","org"]
13711613chunksOf :: Int -> Text -> [Text]
1372−chunksOf k = go
1373− where
1374− go t = case splitAt k t of
1375− (a,b) | null a -> []
1376− | otherwise -> a : go b
1614+chunksOf = coerce JSS.chunksOf
1615+-- chunksOf k = go
1616+-- where
1617+-- go t = case splitAt k t of
1618+-- (a,b) | null a -> []
1619+-- | otherwise -> a : go b
13771620{-# INLINE chunksOf #-}
13781621
13791622-- ----------------------------------------------------------------------------
@@ -1386,7 +1629,8 @@ chunksOf k = go
13861629-- returns the first element matching the predicate, or 'Nothing' if
13871630-- there is no such element.
13881631find :: (Char -> Bool) -> Text -> Maybe Char
1389−find p t = S.findBy p (stream t)
1632+find = coerce JSS.find
1633+-- find p t = S.findBy p (stream t)
13901634{-# INLINE find #-}
13911635
13921636-- | /O(n)/ The 'partition' function takes a predicate and a 'Text',
@@ -1395,14 +1639,16 @@ find p t = S.findBy p (stream t)
13951639--
13961640-- > partition p t == (filter p t, filter (not . p) t)
13971641partition :: (Char -> Bool) -> Text -> (Text, Text)
1398−partition p t = (filter p t, filter (not . p) t)
1642+partition = coerce JSS.partition
1643+-- partition p t = (filter p t, filter (not . p) t)
13991644{-# INLINE partition #-}
14001645
14011646-- | /O(n)/ 'filter', applied to a predicate and a 'Text',
14021647-- returns a 'Text' containing those characters that satisfy the
14031648-- predicate.
14041649filter :: (Char -> Bool) -> Text -> Text
1405−filter p t = unstream (S.filter p (stream t))
1650+filter = coerce JSS.filter
1651+-- filter p t = unstream (S.filter p (stream t))
14061652{-# INLINE filter #-}
14071653
14081654-- | /O(n+m)/ Find the first instance of @needle@ (which must be
@@ -1412,8 +1658,11 @@ filter p t = unstream (S.filter p (stream t))
14121658--
14131659-- Examples:
14141660--
1415−-- > breakOn "::" "a::b::c" ==> ("a", "::b::c")
1416−-- > breakOn "/" "foobar" ==> ("foobar", "")
1661+-- >>> breakOn "::" "a::b::c"
1662+-- ("a","::b::c")
1663+--
1664+-- >>> breakOn "/" "foobar"
1665+-- ("foobar","")
14171666--
14181667-- Laws:
14191668--
@@ -1427,11 +1676,12 @@ filter p t = unstream (S.filter p (stream t))
14271676-- In (unlikely) bad cases, this function's time complexity degrades
14281677-- towards /O(n*m)/.
14291678breakOn :: Text -> Text -> (Text, Text)
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))
1679+breakOn = coerce JSS.breakOn
1680+-- breakOn pat src@(Text arr off len)
1681+-- | null pat = emptyError "breakOn"
1682+-- | otherwise = case indices pat src of
1683+-- [] -> (src, empty)
1684+-- (x:_) -> (text arr off x, text arr (off+x) (len-x))
14351685{-# INLINE breakOn #-}
14361686
14371687-- | /O(n+m)/ Similar to 'breakOn', but searches from the end of the
@@ -1441,10 +1691,12 @@ breakOn pat src@(Text arr off len)
14411691-- up to and including the last match of @needle@. The second is the
14421692-- remainder of @haystack@, following the match.
14431693--
1444−-- > breakOnEnd "::" "a::b::c" ==> ("a::b::", "c")
1694+-- >>> breakOnEnd "::" "a::b::c"
1695+-- ("a::b::","c")
14451696breakOnEnd :: Text -> Text -> (Text, Text)
1446−breakOnEnd pat src = (reverse b, reverse a)
1447− where (a,b) = breakOn (reverse pat) (reverse src)
1697+breakOnEnd = coerce JSS.breakOnEnd
1698+-- breakOnEnd pat src = (reverse b, reverse a)
1699+-- where (a,b) = breakOn (reverse pat) (reverse src)
14481700{-# INLINE breakOnEnd #-}
14491701
14501702-- | /O(n+m)/ Find all non-overlapping instances of @needle@ in
@@ -1456,10 +1708,11 @@ breakOnEnd pat src = (reverse b, reverse a)
14561708--
14571709-- Examples:
14581710--
1459−-- > breakOnAll "::" ""
1460−-- > ==> []
1461−-- > breakOnAll "/" "a/b/c/"
1462−-- > ==> [("a", "/b/c/"), ("a/b", "/c/"), ("a/b/c", "/")]
1711+-- >>> breakOnAll "::" ""
1712+-- []
1713+--
1714+-- >>> breakOnAll "/" "a/b/c/"
1715+-- [("a","/b/c/"),("a/b","/c/"),("a/b/c","/")]
14631716--
14641717-- In (unlikely) bad cases, this function's time complexity degrades
14651718-- towards /O(n*m)/.
@@ -1468,12 +1721,13 @@ breakOnEnd pat src = (reverse b, reverse a)
14681721breakOnAll :: Text -- ^ @needle@ to search for
14691722 -> Text -- ^ @haystack@ in which to search
14701723 -> [(Text, Text)]
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
1724+breakOnAll = coerce JSS.breakOnAll
1725+-- breakOnAll pat src@(Text arr off slen)
1726+-- | null pat = emptyError "breakOnAll"
1727+-- | otherwise = L.map step (indices pat src)
1728+-- where
1729+-- step x = (chunk 0 x, chunk x (slen-x))
1730+-- chunk !n !l = text arr (n+off) l
14771731{-# INLINE breakOnAll #-}
14781732
14791733-------------------------------------------------------------------------------
@@ -1497,14 +1751,16 @@ breakOnAll pat src@(Text arr off slen)
14971751
14981752-- | /O(n)/ 'Text' index (subscript) operator, starting from 0.
14991753index :: Text -> Int -> Char
1500−index t n = S.index (stream t) n
1754+index = coerce JSS.index
1755+-- index t n = S.index (stream t) n
15011756{-# INLINE index #-}
15021757
15031758-- | /O(n)/ The 'findIndex' function takes a predicate and a 'Text'
15041759-- and returns the index of the first element in the 'Text' satisfying
15051760-- the predicate. Subject to fusion.
15061761findIndex :: (Char -> Bool) -> Text -> Maybe Int
1507−findIndex p t = S.findIndex p (stream t)
1762+findIndex = coerce JSS.findIndex
1763+-- findIndex p t = S.findIndex p (stream t)
15081764{-# INLINE findIndex #-}
15091765
15101766-- | /O(n+m)/ The 'count' function returns the number of times the
@@ -1514,10 +1770,11 @@ findIndex p t = S.findIndex p (stream t)
15141770-- In (unlikely) bad cases, this function's time complexity degrades
15151771-- towards /O(n*m)/.
15161772count :: Text -> Text -> Int
1517−count pat src
1518− | null pat = emptyError "count"
1519− | isSingleton pat = countChar (unsafeHead pat) src
1520− | otherwise = L.length (indices pat src)
1773+count = coerce JSS.count
1774+-- count pat src
1775+-- | null pat = emptyError "count"
1776+-- | isSingleton pat = countChar (unsafeHead pat) src
1777+-- | otherwise = L.length (indices pat src)
15211778{-# INLINE [1] count #-}
15221779
15231780{-# RULES
@@ -1539,42 +1796,46 @@ countChar c t = S.countChar c (stream t)
15391796-- excess elements of the longer 'Text' are discarded. This is
15401797-- equivalent to a pair of 'unpack' operations.
15411798zip :: Text -> Text -> [(Char,Char)]
1542−zip a b = S.unstreamList $ S.zipWith (,) (stream a) (stream b)
1799+zip = coerce JSS.zip
1800+-- zip a b = S.unstreamList $ S.zipWith (,) (stream a) (stream b)
15431801{-# INLINE zip #-}
15441802
15451803-- | /O(n)/ 'zipWith' generalises 'zip' by zipping with the function
15461804-- given as the first argument, instead of a tupling function.
15471805-- Performs replacement on invalid scalar values.
15481806zipWith :: (Char -> Char -> Char) -> Text -> Text -> Text
1549−zipWith f t1 t2 = unstream (S.zipWith g (stream t1) (stream t2))
1550− where g a b = safe (f a b)
1807+zipWith = coerce JSS.zipWith
1808+-- zipWith f t1 t2 = unstream (S.zipWith g (stream t1) (stream t2))
1809+-- where g a b = safe (f a b)
15511810{-# INLINE zipWith #-}
15521811
15531812-- | /O(n)/ Breaks a 'Text' up into a list of words, delimited by 'Char's
15541813-- representing white space.
15551814words :: Text -> [Text]
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
1815+words = coerce JSS.words
1816+-- words t@(Text arr off len) = loop 0 0
1817+-- where
1818+-- loop !start !n
1819+-- | n >= len = if start == n
1820+-- then []
1821+-- else [Text arr (start+off) (n-start)]
1822+-- | isSpace c =
1823+-- if start == n
1824+-- then loop (start+1) (start+1)
1825+-- else Text arr (start+off) (n-start) : loop (n+d) (n+d)
1826+-- | otherwise = loop start (n+d)
1827+-- where Iter c d = iter t n
15681828{-# INLINE words #-}
15691829
15701830-- | /O(n)/ Breaks a 'Text' up into a list of 'Text's at
15711831-- newline 'Char's. The resulting strings do not contain newlines.
15721832lines :: Text -> [Text]
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
1833+lines = coerce JSS.lines
1834+-- lines ps | null ps = []
1835+-- | otherwise = h : if null t
1836+-- then []
1837+-- else lines (unsafeTail t)
1838+-- where (# h,t #) = span_ (/= '\n') ps
15781839{-# INLINE lines #-}
15791840
15801841{-
@@ -1602,34 +1863,40 @@ lines' ps | null ps = []
16021863-- | /O(n)/ Joins lines, after appending a terminating newline to
16031864-- each.
16041865unlines :: [Text] -> Text
1605−unlines = concat . L.map (`snoc` '\n')
1866+unlines = coerce JSS.unlines
1867+-- unlines = concat . L.map (`snoc` '\n')
16061868{-# INLINE unlines #-}
16071869
16081870-- | /O(n)/ Joins words using single space characters.
16091871unwords :: [Text] -> Text
1610−unwords = intercalate (singleton ' ')
1872+unwords = coerce JSS.unwords
1873+-- unwords = intercalate (singleton ' ')
16111874{-# INLINE unwords #-}
16121875
16131876-- | /O(n)/ The 'isPrefixOf' function takes two 'Text's and returns
16141877-- 'True' iff the first is a prefix of the second. Subject to fusion.
16151878isPrefixOf :: Text -> Text -> Bool
1616−isPrefixOf a@(Text _ _ alen) b@(Text _ _ blen) =
1617− alen <= blen && S.isPrefixOf (stream a) (stream b)
1879+isPrefixOf = coerce JSS.isPrefixOf
1880+-- isPrefixOf a@(Text _ _ alen) b@(Text _ _ blen) =
1881+-- alen <= blen && S.isPrefixOf (stream a) (stream b)
16181882{-# INLINE [1] isPrefixOf #-}
16191883
16201884{-# RULES
16211885"TEXT isPrefixOf -> fused" [~1] forall s t.
16221886 isPrefixOf s t = S.isPrefixOf (stream s) (stream t)
1887+"JSSTRING isPrefixOf -> unfused" [1] forall x y.
1888+ S.isPrefixOf (stream x) (stream y) = isPrefixOf x y
16231889 #-}
16241890
16251891-- | /O(n)/ The 'isSuffixOf' function takes two 'Text's and returns
16261892-- 'True' iff the first is a suffix of the second.
16271893isSuffixOf :: Text -> Text -> Bool
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
1894+isSuffixOf = coerce JSS.isSuffixOf
1895+-- isSuffixOf a@(Text _aarr _aoff alen) b@(Text barr boff blen) =
1896+-- d >= 0 && a == b'
1897+-- where d = blen - alen
1898+-- b' | d == 0 = b
1899+-- | otherwise = Text barr (boff+d) alen
16331900{-# INLINE isSuffixOf #-}
16341901
16351902-- | /O(n+m)/ The 'isInfixOf' function takes two 'Text's and returns
@@ -1639,10 +1906,11 @@ isSuffixOf a@(Text _aarr _aoff alen) b@(Text barr boff blen) =
16391906-- In (unlikely) bad cases, this function's time complexity degrades
16401907-- towards /O(n*m)/.
16411908isInfixOf :: Text -> Text -> Bool
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
1909+isInfixOf = coerce JSS.isInfixOf
1910+-- isInfixOf needle haystack
1911+-- | null needle = True
1912+-- | isSingleton needle = S.elem (unsafeHead needle) . S.stream $ haystack
1913+-- | otherwise = not . L.null . indices needle $ haystack
16461914{-# INLINE [1] isInfixOf #-}
16471915
16481916{-# RULES
@@ -1658,9 +1926,14 @@ isInfixOf needle haystack
16581926--
16591927-- Examples:
16601928--
1661−-- > stripPrefix "foo" "foobar" == Just "bar"
1662−-- > stripPrefix "" "baz" == Just "baz"
1663−-- > stripPrefix "foo" "quux" == Nothing
1929+-- >>> stripPrefix "foo" "foobar"
1930+-- Just "bar"
1931+--
1932+-- >>> stripPrefix "" "baz"
1933+-- Just "baz"
1934+--
1935+-- >>> stripPrefix "foo" "quux"
1936+-- Nothing
16641937--
16651938-- This is particularly useful with the @ViewPatterns@ extension to
16661939-- GHC, as follows:
@@ -1672,9 +1945,10 @@ isInfixOf needle haystack
16721945-- > fnordLength (stripPrefix "fnord" -> Just suf) = T.length suf
16731946-- > fnordLength _ = -1
16741947stripPrefix :: Text -> Text -> Maybe Text
1675−stripPrefix p@(Text _arr _off plen) t@(Text arr off len)
1676− | p `isPrefixOf` t = Just $! text arr (off+plen) (len-plen)
1677− | otherwise = Nothing
1948+stripPrefix = coerce JSS.stripPrefix
1949+-- stripPrefix p@(Text _arr _off plen) t@(Text arr off len)
1950+-- | p `isPrefixOf` t = Just $! text arr (off+plen) (len-plen)
1951+-- | otherwise = Nothing
16781952
16791953-- | /O(n)/ Find the longest non-empty common prefix of two strings
16801954-- and return it, along with the suffixes of each string at which they
@@ -1685,28 +1959,39 @@ stripPrefix p@(Text _arr _off plen) t@(Text arr off len)
16851959--
16861960-- Examples:
16871961--
1688−-- > commonPrefixes "foobar" "fooquux" == Just ("foo","bar","quux")
1689−-- > commonPrefixes "veeble" "fetzer" == Nothing
1690−-- > commonPrefixes "" "baz" == Nothing
1962+-- >>> commonPrefixes "foobar" "fooquux"
1963+-- Just ("foo","bar","quux")
1964+--
1965+-- >>> commonPrefixes "veeble" "fetzer"
1966+-- Nothing
1967+--
1968+-- >>> commonPrefixes "" "baz"
1969+-- Nothing
16911970commonPrefixes :: Text -> Text -> Maybe (Text,Text,Text)
1692−commonPrefixes t0@(Text arr0 off0 len0) t1@(Text arr1 off1 len1) = go 0 0
1693− where
1694− go !i !j | i < len0 && j < len1 && a == b = go (i+d0) (j+d1)
1695− | i > 0 = Just (Text arr0 off0 i,
1696− text arr0 (off0+i) (len0-i),
1697− text arr1 (off1+j) (len1-j))
1698− | otherwise = Nothing
1699− where Iter a d0 = iter t0 i
1700− Iter b d1 = iter t1 j
1971+commonPrefixes = coerce JSS.commonPrefixes
1972+-- commonPrefixes t0@(Text arr0 off0 len0) t1@(Text arr1 off1 len1) = go 0 0
1973+-- where
1974+-- go !i !j | i < len0 && j < len1 && a == b = go (i+d0) (j+d1)
1975+-- | i > 0 = Just (Text arr0 off0 i,
1976+-- text arr0 (off0+i) (len0-i),
1977+-- text arr1 (off1+j) (len1-j))
1978+-- | otherwise = Nothing
1979+-- where Iter a d0 = iter t0 i
1980+-- Iter b d1 = iter t1 j
17011981
17021982-- | /O(n)/ Return the prefix of the second string if its suffix
17031983-- matches the entire first string.
17041984--
17051985-- Examples:
17061986--
1707−-- > stripSuffix "bar" "foobar" == Just "foo"
1708−-- > stripSuffix "" "baz" == Just "baz"
1709−-- > stripSuffix "foo" "quux" == Nothing
1987+-- >>> stripSuffix "bar" "foobar"
1988+-- Just "foo"
1989+--
1990+-- >>> stripSuffix "" "baz"
1991+-- Just "baz"
1992+--
1993+-- >>> stripSuffix "foo" "quux"
1994+-- Nothing
17101995--
17111996-- This is particularly useful with the @ViewPatterns@ extension to
17121997-- GHC, as follows:
@@ -1718,21 +2003,22 @@ commonPrefixes t0@(Text arr0 off0 len0) t1@(Text arr1 off1 len1) = go 0 0
17182003-- > quuxLength (stripSuffix "quux" -> Just pre) = T.length pre
17192004-- > quuxLength _ = -1
17202005stripSuffix :: Text -> Text -> Maybe Text
1721−stripSuffix p@(Text _arr _off plen) t@(Text arr off len)
1722− | p `isSuffixOf` t = Just $! text arr off (len-plen)
1723− | otherwise = Nothing
1724−
1725−-- | Add a list of non-negative numbers. Errors out on overflow.
1726−sumP :: String -> [Int] -> Int
1727−sumP fun = go 0
1728− where go !a (x:xs)
1729− | ax >= 0 = go ax xs
1730− | otherwise = overflowError fun
1731− where ax = a + x
1732− go a _ = a
1733−
1734−emptyError :: String -> a
1735−emptyError fun = P.error $ "Data.Text." ++ fun ++ ": empty input"
2006+stripSuffix = coerce JSS.stripSuffix
2007+-- stripSuffix p@(Text _arr _off plen) t@(Text arr off len)
2008+-- | p `isSuffixOf` t = Just $! text arr off (len-plen)
2009+-- | otherwise = Nothing
2010+
2011+-- -- | Add a list of non-negative numbers. Errors out on overflow.
2012+-- sumP :: String -> [Int] -> Int
2013+-- sumP fun = go 0
2014+-- where go !a (x:xs)
2015+-- | ax >= 0 = go ax xs
2016+-- | otherwise = overflowError fun
2017+-- where ax = a + x
2018+-- go a _ = a
2019+
2020+-- emptyError :: String -> a
2021+-- emptyError fun = P.error $ "Data.Text." ++ fun ++ ": empty input"
17362022
17372023overflowError :: String -> a
17382024overflowError fun = P.error $ "Data.Text." ++ fun ++ ": size overflow"
@@ -1746,10 +2032,22 @@ overflowError fun = P.error $ "Data.Text." ++ fun ++ ": size overflow"
17462032-- copy \"breaks the link\" to the original array, allowing it to be
17472033-- garbage collected if there are no other live references to it.
17482034copy :: Text -> Text
1749−copy (Text arr off len) = Text (A.run go) 0 len
1750− where
1751− go :: ST s (A.MArray s)
1752− go = do
1753− marr <- A.new len
1754− A.copyI marr 0 arr off len
1755− return marr
2035+copy = P.id -- TODO
2036+-- copy (Text arr off len) = Text (A.run go) 0 len
2037+-- where
2038+-- go :: ST s (A.MArray s)
2039+-- go = do
2040+-- marr <- A.new len
2041+
2042+foreign import javascript unsafe
2043+ "h$jsstringReplicateChar" js_replicateChar :: Int -> Char -> JSString
2044+foreign import javascript unsafe
2045+ "$2.substr($1)" js_substr1 :: Int -> JSString -> JSString
2046+
2047+-------------------------------------------------
2048+-- NOTE: the named chunk below used by doctest;
2049+-- verify the doctests via `doctest -fobject-code Data/Text.hs`
2050+
2051+-- $setup
2052+-- >>> :set -XOverloadedStrings
2053+-- >>> import qualified Data.Text as T