@@ -6,7 +6,7 @@
6#if __GLASGOW_HASKELL__ >= 708
6#if __GLASGOW_HASKELL__ >= 708
7{-# LANGUAGE TypeFamilies #-}
7{-# LANGUAGE TypeFamilies #-}
9−
9+{-# LANGUAGE ForeignFunctionInterface, JavaScriptFFI, UnliftedFFITypes #-}
11-- Module : Data.Text
11-- Module : Data.Text
12-- Copyright : (c) 2009, 2010, 2011, 2012 Bryan O'Sullivan,
12-- Copyright : (c) 2009, 2010, 2011, 2012 Bryan O'Sullivan,
@@ -15,7 +15,6 @@
16-- License : BSD-style
16-- License : BSD-style
17-- Maintainer : bos@serpentine.com
17-- Maintainer : bos@serpentine.com
18−-- Stability : experimental
19-- Portability : GHC
18-- Portability : GHC
21-- A time and space-efficient implementation of Unicode text.
20-- A time and space-efficient implementation of Unicode text.
@@ -32,8 +31,9 @@
33-- To use an extended and very rich family of functions for working
32-- To use an extended and very rich family of functions for working
34-- with Unicode text (including normalization, regular expressions,
33-- with Unicode text (including normalization, regular expressions,
35−-- non-standard encodings, text breaking, and locales), see
34+-- non-standard encodings, text breaking, and locales), see the
36−-- <http://hackage.haskell.org/package/text-icu the text-icu package >.
35+-- <http://hackage.haskell.org/package/text-icu text-icu package >.
38module Data.Text
38module Data.Text
@@ -43,6 +43,9 @@ module Data.Text
43 -- * Acceptable data
43 -- * Acceptable data
44 -- $replacement
44 -- $replacement
46+ -- * Definition of character
47+ -- $character_definition
46 -- * Fusion
49 -- * Fusion
47 -- $fusion
50 -- $fusion
@@ -60,6 +63,7 @@ module Data.Text
@@ -223,16 +227,17 @@ import qualified Data.Text.Internal.Fusion as S
223import qualified Data.Text.Internal.Fusion.Common as S
227import qualified Data.Text.Internal.Fusion.Common as S
224import Data.Text.Encoding (decodeUtf8', encodeUtf8)
228import Data.Text.Encoding (decodeUtf8', encodeUtf8)
225import Data.Text.Internal.Fusion (stream, reverseStream, unstream)
229import Data.Text.Internal.Fusion (stream, reverseStream, unstream)
226−import Data.Text.Internal.Private (span_)
230+-- import Data.Text.Internal.Private (span_)
227−import Data.Text.Internal (Text(..), empty, firstf, mul, safe, text)
231+import Data.Text.Internal (Text(..), empty, empty_, firstf, mul, safe, text)
228−import Data.Text.Show (singleton, unpack, unpackCString#)
232+-- import Data.Text.Show (singleton, unpack, unpackCString#)
229import qualified Prelude as P
233import qualified Prelude as P
230import Data.Text.Unsafe (Iter(..), iter, iter_, lengthWord16, reverseIter,
234import Data.Text.Unsafe (Iter(..), iter, iter_, lengthWord16, reverseIter,
231− reverseIter_, unsafeHead, unsafeTail)
235+ reverseIter_, unsafeHead, unsafeTail,
236+ unsafeDupablePerformIO)
232import Data.Text.Internal.Unsafe.Char (unsafeChr)
237import Data.Text.Internal.Unsafe.Char (unsafeChr)
233import qualified Data.Text.Internal.Functions as F
238import qualified Data.Text.Internal.Functions as F
234import qualified Data.Text.Internal.Encoding.Utf16 as U16
239import qualified Data.Text.Internal.Encoding.Utf16 as U16
235−import Data.Text.Internal.Search (indices)
240+-- import Data.Text.Internal.Search (indices)
236#if defined(__HADDOCK__)
241#if defined(__HADDOCK__)
237import Data.ByteString (ByteString)
242import Data.ByteString (ByteString)
238import qualified Data.Text.Lazy as L
243import qualified Data.Text.Lazy as L
@@ -246,6 +251,80 @@ import qualified GHC.Exts as Exts
246import Text.Printf (PrintfArg, formatArg, formatString)
251import Text.Printf (PrintfArg, formatArg, formatString)
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
260+import GHC.Base (build)
261+import qualified GHC.CString as GHC
262+import GHC.Exts (Addr#, ByteArray#)
263+#if MIN_VERSION_ghcjs_prim(0,1,1)
264+import GHCJS.Prim (unsafeUnpackJSString#)
267+unpack :: Text -> String
268+unpack = coerce JSS.unpack
269+{-# INLINE [1] unpack #-}
271+singleton :: Char -> Text
272+singleton = coerce JSS.singleton
273+{-# INLINE [1] singleton #-}
276+"JSSTRING singleton -> fused" [~1] forall a.
277+ singleton a = unstream (S.singleton (safe a))
278+"JSSTRING singleton -> unfused" [1] forall a.
279+ unstream (S.singleton (safe a)) = singleton a
282+#if MIN_VERSION_ghcjs_prim(0,1,1)
283+{-# RULES "inlineJSString" forall s.
284+ pack (GHC.Base.build (GHC.unpackFoldrCString# s)) =
285+ Text (JSString (unsafeUnpackJSString# s)) #-}
288+-- | /O(n)/ Convert a literal string into a JSString. Subject to fusion.
289+unpackCString# :: Addr# -> Text
290+unpackCString# addr# = Text $ SJS.unstream (SJS.streamCString# addr#)
291+{-# NOINLINE unpackCString# #-}
293+{-# RULES "TEXT literal" forall a.
294+ unstream (S.map safe (S.streamList (GHC.unpackCString# a)))
295+ = unpackCString# a #-}
297+{-# RULES "TEXT literal UTF8" [1] forall a.
298+ unstream (S.map safe (S.streamList (GHC.unpackCStringUtf8# a)))
299+ = unpackCString# a #-}
301+{-# RULES "TEXT empty literal" [1]
302+ unstream (S.map safe (S.streamList []))
305+{-# RULES "TEXT singleton literal" [1] forall a.
306+ unstream (S.map safe (S.streamList [a]))
309+#if MIN_VERSION_ghcjs_prim(0,1,1)
310+{-# RULES "TEXT literal prim" [0] forall a.
311+ unpackCString# a = Text (JSString (unsafeUnpackJSString# a))
315+---------------------------------------------------------------------
316+-- $character_definition
318+-- This package uses the term /character/ to denote Unicode /code points/.
320+-- Note that this is not the same thing as a grapheme (e.g. a
321+-- composition of code points that form one visual symbol). For
322+-- instance, consider the grapheme \"ä\". This symbol has two
323+-- Unicode representations: a single code-point representation
324+-- @U+00E4@ (the @LATIN SMALL LETTER A WITH DIAERESIS@ code point),
325+-- and a two code point representation @U+0061@ (the \"@A@\" code
326+-- point) and @U+0308@ (the @COMBINING DIAERESIS@ code point).
249-- $strict
328-- $strict
251-- This package provides both strict and lazy 'Text' types. The
330-- This package provides both strict and lazy 'Text' types. The
@@ -321,22 +400,31 @@ import Text.Printf (PrintfArg, formatArg, formatString)
321-- Functions that can be fused by the compiler are documented with the
400-- Functions that can be fused by the compiler are documented with the
322-- phrase \"Subject to fusion\".
401-- phrase \"Subject to fusion\".
403+-- instance Eq Text where
404+-- Text arrA offA lenA == Text arrB offB lenB
405+-- | lenA == lenB = A.equal arrA offA arrB offB lenA
406+-- | otherwise = False
407+-- {-# INLINE (==) #-}
324instance Eq Text where
408instance Eq Text where
325− Text arrA offA lenA == Text arrB offB lenB
409+ Text x == Text y = x == y
326− | lenA == lenB = A.equal arrA offA arrB offB lenA
410+
327− | otherwise = False
411+-- instance Ord Text where
328− {-# INLINE (==) #-}
412+-- compare = compareText
330instance Ord Text where
414instance Ord Text where
331− compare = compareText
415+ compare (Text x) (Text y) = compare x y
333instance Read Text where
417instance Read Text where
334 readsPrec p str = [(pack x,y) | (x,y) <- readsPrec p str]
418 readsPrec p str = [(pack x,y) | (x,y) <- readsPrec p str]
336#if MIN_VERSION_base(4,9,0)
420#if MIN_VERSION_base(4,9,0)
421+-- | Non-orphan 'Semigroup' instance only defined for
337−-- Semigroup orphan instances for older GHCs are provided by
422+-- @base-4.9.0.0@ and later; orphan instances for older GHCs are
424+-- the [semigroups](http://hackage.haskell.org/package/semigroups)
338−-- 'semigroups` package
425+-- package
340instance Semigroup Text where
428instance Semigroup Text where
341 (<>) = append
429 (<>) = append
@@ -354,6 +442,7 @@ instance IsString Text where
354 fromString = pack
442 fromString = pack
356#if __GLASGOW_HASKELL__ >= 708
444#if __GLASGOW_HASKELL__ >= 708
357instance Exts.IsList Text where
446instance Exts.IsList Text where
358 type Item Text = Char
447 type Item Text = Char
359 fromList = pack
448 fromList = pack
@@ -364,6 +453,7 @@ instance Exts.IsList Text where
364instance NFData Text where rnf !_ = ()
453instance NFData Text where rnf !_ = ()
367instance Binary Text where
457instance Binary Text where
368 put t = put (encodeUtf8 t)
458 put t = put (encodeUtf8 t)
@@ -397,8 +487,10 @@ instance Data Text where
398#if MIN_VERSION_base(4,7,0)
488#if MIN_VERSION_base(4,7,0)
399-- | Only defined for @base-4.7.0.0@ and later
489-- | Only defined for @base-4.7.0.0@ and later
400instance PrintfArg Text where
492instance PrintfArg Text where
401− formatArg txt = formatString $ unpack txt
493+ formatArg t = formatString $ unpack t
404packConstr :: Constr
496packConstr :: Constr
@@ -407,19 +499,19 @@ packConstr = mkConstr textDataType "pack" [] Prefix
407textDataType :: DataType
499textDataType :: DataType
408textDataType = mkDataType "Data.Text.Text" [packConstr]
500textDataType = mkDataType "Data.Text.Text" [packConstr]
410−-- | /O(n)/ Compare two 'Text' values lexicographically.
502+-- -- | /O(n)/ Compare two 'Text' values lexicographically.
411−compareText :: Text -> Text -> Ordering
503+-- compareText :: Text -> Text -> Ordering
412−compareText ta@(Text _arrA _offA lenA) tb@(Text _arrB _offB lenB)
504+-- compareText ta@(Text _arrA _offA lenA) tb@(Text _arrB _offB lenB)
413− | lenA == 0 && lenB == 0 = EQ
505+-- | lenA == 0 && lenB == 0 = EQ
414− | otherwise = go 0 0
506+-- | otherwise = go 0 0
416− go !i !j
508+-- go !i !j
417− | i >= lenA || j >= lenB = compare lenA lenB
509+-- | i >= lenA || j >= lenB = compare lenA lenB
418− | a < b = LT
510+-- | a < b = LT
419− | a > b = GT
511+-- | a > b = GT
420− | otherwise = go (i+di) (j+dj)
512+-- | otherwise = go (i+di) (j+dj)
421− where Iter a di = iter ta i
513+-- where Iter a di = iter ta i
422− Iter b dj = iter tb j
514+-- Iter b dj = iter tb j
424-- -----------------------------------------------------------------------------
516-- -----------------------------------------------------------------------------
425-- * Conversion to/from 'Text'
517-- * Conversion to/from 'Text'
@@ -427,7 +519,8 @@ compareText ta@(Text _arrA _offA lenA) tb@(Text _arrB _offB lenB)
427-- | /O(n)/ Convert a 'String' into a 'Text'. Subject to
519-- | /O(n)/ Convert a 'String' into a 'Text'. Subject to
428-- fusion. Performs replacement on invalid scalar values.
520-- fusion. Performs replacement on invalid scalar values.
429pack :: String -> Text
521pack :: String -> Text
522+pack = coerce JSS.pack
430−pack = unstream . S.map safe . S.streamList
523+-- pack = unstream . S.map safe . S.streamList
431{-# INLINE [1] pack #-}
524{-# INLINE [1] pack #-}
433-- -----------------------------------------------------------------------------
526-- -----------------------------------------------------------------------------
@@ -438,7 +531,8 @@ pack = unstream . S.map safe . S.streamList
438-- copying a new array. Subject to fusion. Performs replacement on
531-- copying a new array. Subject to fusion. Performs replacement on
439-- invalid scalar values.
532-- invalid scalar values.
440cons :: Char -> Text -> Text
533cons :: Char -> Text -> Text
534+cons = coerce JSS.cons
441−cons c t = unstream (S.cons (safe c) (stream t))
535+-- cons c t = unstream (S.cons (safe c) (stream t))
442{-# INLINE cons #-}
536{-# INLINE cons #-}
444infixr 5 `cons`
538infixr 5 `cons`
@@ -447,25 +541,27 @@ infixr 5 `cons`
447-- entire array in the process, unless fused. Subject to fusion.
541-- entire array in the process, unless fused. Subject to fusion.
448-- Performs replacement on invalid scalar values.
542-- Performs replacement on invalid scalar values.
449snoc :: Text -> Char -> Text
543snoc :: Text -> Char -> Text
544+snoc = coerce JSS.snoc
450−snoc t c = unstream (S.snoc (stream t) (safe c))
545+-- snoc t c = unstream (S.snoc (stream t) (safe c))
451{-# INLINE snoc #-}
546{-# INLINE snoc #-}
453-- | /O(n)/ Appends one 'Text' to the other by copying both of them
548-- | /O(n)/ Appends one 'Text' to the other by copying both of them
454-- into a new 'Text'. Subject to fusion.
549-- into a new 'Text'. Subject to fusion.
455append :: Text -> Text -> Text
550append :: Text -> Text -> Text
551+append = coerce JSS.append
456−append a@(Text arr1 off1 len1) b@(Text arr2 off2 len2)
552+-- append a@(Text arr1 off1 len1) b@(Text arr2 off2 len2)
457− | len1 == 0 = b
553+-- | len1 == 0 = b
458− | len2 == 0 = a
554+-- | len2 == 0 = a
459− | len > 0 = Text (A.run x) 0 len
555+-- | len > 0 = Text (A.run x) 0 len
460− | otherwise = overflowError "append"
556+-- | otherwise = overflowError "append"
462− len = len1+len2
558+-- len = len1+len2
463− x :: ST s (A.MArray s)
559+-- x :: ST s (A.MArray s)
465− arr <- A.new len
561+-- arr <- A.new len
466− A.copyI arr 0 arr1 off1 len1
562+-- A.copyI arr 0 arr1 off1 len1
467− A.copyI arr len1 arr2 off2 len
563+-- A.copyI arr len1 arr2 off2 len
468− return arr
564+-- return arr
469{-# NOINLINE append #-}
565{-# NOINLINE append #-}
@@ -478,16 +574,18 @@ append a@(Text arr1 off1 len1) b@(Text arr2 off2 len2)
478-- | /O(1)/ Returns the first character of a 'Text', which must be
574-- | /O(1)/ Returns the first character of a 'Text', which must be
479-- non-empty. Subject to fusion.
575-- non-empty. Subject to fusion.
480head :: Text -> Char
576head :: Text -> Char
577+head = coerce JSS.head
481−head t = S.head (stream t)
578+-- head t = S.head (stream t)
482{-# INLINE head #-}
579{-# INLINE head #-}
484-- | /O(1)/ Returns the first character and rest of a 'Text', or
581-- | /O(1)/ Returns the first character and rest of a 'Text', or
485-- 'Nothing' if empty. Subject to fusion.
582-- 'Nothing' if empty. Subject to fusion.
486uncons :: Text -> Maybe (Char, Text)
583uncons :: Text -> Maybe (Char, Text)
584+uncons = coerce JSS.uncons
487−uncons t@(Text arr off len)
585+-- uncons t@(Text arr off len)
488− | len <= 0 = Nothing
586+-- | len <= 0 = Nothing
489− | otherwise = Just $ let !(Iter c d) = iter t 0
587+-- | otherwise = Just $ let !(Iter c d) = iter t 0
490− in (c, text arr (off+d) (len-d))
588+-- in (c, text arr (off+d) (len-d))
491{-# INLINE [1] uncons #-}
589{-# INLINE [1] uncons #-}
493-- | Lifted from Control.Arrow and specialized.
591-- | Lifted from Control.Arrow and specialized.
@@ -497,12 +595,13 @@ second f (a, b) = (a, f b)
497-- | /O(1)/ Returns the last character of a 'Text', which must be
595-- | /O(1)/ Returns the last character of a 'Text', which must be
498-- non-empty. Subject to fusion.
596-- non-empty. Subject to fusion.
499last :: Text -> Char
597last :: Text -> Char
598+last = coerce JSS.last
500−last (Text arr off len)
599+-- last (Text arr off len)
501− | len <= 0 = emptyError "last"
600+-- | len <= 0 = emptyError "last"
502− | n < 0xDC00 || n > 0xDFFF = unsafeChr n
601+-- | n < 0xDC00 || n > 0xDFFF = unsafeChr n
503− | otherwise = U16.chr2 n0 n
602+-- | otherwise = U16.chr2 n0 n
504− where n = A.unsafeIndex arr (off+len-1)
603+-- where n = A.unsafeIndex arr (off+len-1)
505− n0 = A.unsafeIndex arr (off+len-2)
604+-- n0 = A.unsafeIndex arr (off+len-2)
506{-# INLINE [1] last #-}
605{-# INLINE [1] last #-}
@@ -515,10 +614,11 @@ last (Text arr off len)
515-- | /O(1)/ Returns all characters after the head of a 'Text', which
614-- | /O(1)/ Returns all characters after the head of a 'Text', which
516-- must be non-empty. Subject to fusion.
615-- must be non-empty. Subject to fusion.
517tail :: Text -> Text
616tail :: Text -> Text
617+tail = coerce JSS.tail
518−tail t@(Text arr off len)
618+-- tail t@(Text arr off len)
519− | len <= 0 = emptyError "tail"
619+-- | len <= 0 = emptyError "tail"
520− | otherwise = text arr (off+d) (len-d)
620+-- | otherwise = text arr (off+d) (len-d)
521− where d = iter_ t 0
621+-- where d = iter_ t 0
522{-# INLINE [1] tail #-}
622{-# INLINE [1] tail #-}
@@ -531,11 +631,12 @@ tail t@(Text arr off len)
531-- | /O(1)/ Returns all but the last character of a 'Text', which must
631-- | /O(1)/ Returns all but the last character of a 'Text', which must
532-- be non-empty. Subject to fusion.
632-- be non-empty. Subject to fusion.
533init :: Text -> Text
633init :: Text -> Text
634+init = coerce JSS.init
534−init (Text arr off len) | len <= 0 = emptyError "init"
635+-- init (Text arr off len) | len <= 0 = emptyError "init"
535− | n >= 0xDC00 && n <= 0xDFFF = text arr off (len-2)
636+-- | n >= 0xDC00 && n <= 0xDFFF = text arr off (len-2)
536− | otherwise = text arr off (len-1)
637+-- | otherwise = text arr off (len-1)
538− n = A.unsafeIndex arr (off+len-1)
639+-- n = A.unsafeIndex arr (off+len-1)
539{-# INLINE [1] init #-}
640{-# INLINE [1] init #-}
@@ -545,14 +646,29 @@ init (Text arr off len) | len <= 0 = emptyError "init"
545 unstream (S.init (stream t)) = init t
646 unstream (S.init (stream t)) = init t
649+-- | /O(1)/ Returns all but the last character and the last character of a
650+-- 'Text', or 'Nothing' if empty.
653+unsnoc :: Text -> Maybe (Text, Char)
654+unsnoc = coerce JSS.unsnoc
655+-- unsnoc (Text arr off len)
656+-- | len <= 0 = Nothing
657+-- | n < 0xDC00 || n > 0xDFFF = Just (text arr off (len-1), unsafeChr n)
658+-- | otherwise = Just (text arr off (len-2), U16.chr2 n0 n)
659+-- where n = A.unsafeIndex arr (off+len-1)
660+-- n0 = A.unsafeIndex arr (off+len-2)
661+{-# INLINE [1] unsnoc #-}
548-- | /O(1)/ Tests whether a 'Text' is empty or not. Subject to
663-- | /O(1)/ Tests whether a 'Text' is empty or not. Subject to
549-- fusion.
664-- fusion.
550null :: Text -> Bool
665null :: Text -> Bool
666+null = coerce JSS.null
551−null (Text _arr _off len) =
667+-- null (Text _arr _off len) =
552−#if defined(ASSERTS)
668+-- #if defined(ASSERTS)
553− assert (len >= 0) $
669+-- assert (len >= 0) $
555− len <= 0
671+-- len <= 0
556{-# INLINE [1] null #-}
672{-# INLINE [1] null #-}
@@ -564,14 +680,15 @@ null (Text _arr _off len) =
565-- | /O(1)/ Tests whether a 'Text' contains exactly one character.
681-- | /O(1)/ Tests whether a 'Text' contains exactly one character.
566-- Subject to fusion.
682-- Subject to fusion.
567−isSingleton :: Text -> Bool
683+-- isSingleton :: Text -> Bool
568−isSingleton = S.isSingleton . stream
684+-- isSingleton = S.isSingleton . stream
569−{-# INLINE isSingleton #-}
685+-- {-# INLINE isSingleton #-}
571-- | /O(n)/ Returns the number of characters in a 'Text'.
687-- | /O(n)/ Returns the number of characters in a 'Text'.
572-- Subject to fusion.
688-- Subject to fusion.
573length :: Text -> Int
689length :: Text -> Int
690+length = coerce JSS.length
574−length t = S.length (stream t)
691+-- length t = S.length (stream t)
575{-# INLINE [0] length #-}
692{-# INLINE [0] length #-}
576-- length needs to be phased after the compareN/length rules otherwise
693-- length needs to be phased after the compareN/length rules otherwise
577-- it may inline before the rules have an opportunity to fire.
694-- it may inline before the rules have an opportunity to fire.
@@ -624,29 +741,58 @@ compareLength t n = S.compareLengthI (stream t) n
624-- -----------------------------------------------------------------------------
741-- -----------------------------------------------------------------------------
625-- * Transformations
742-- * Transformations
626-- | /O(n)/ 'map' @f@ @t@ is the 'Text' obtained by applying @f@ to
743-- | /O(n)/ 'map' @f@ @t@ is the 'Text' obtained by applying @f@ to
744+-- each element of @t@.
748+-- >>> let message = pack "I am not angry. Not at all."
749+-- >>> T.map (\c -> if c == '.' then '!' else c) message
750+-- "I am not angry! Not at all!"
627−-- each element of @t@. Subject to fusion. Performs replacement on
752+-- Subject to fusion. Performs replacement on invalid scalar values.
628−-- invalid scalar values.
629map :: (Char -> Char) -> Text -> Text
753map :: (Char -> Char) -> Text -> Text
630−map f t = unstream (S.map (safe . f) (stream t))
755+-- map f t = unstream (S.map (safe . f) (stream t))
631{-# INLINE [1] map #-}
756{-# INLINE [1] map #-}
633-- | /O(n)/ The 'intercalate' function takes a 'Text' and a list of
758-- | /O(n)/ The 'intercalate' function takes a 'Text' and a list of
634-- 'Text's and concatenates the list after interspersing the first
759-- 'Text's and concatenates the list after interspersing the first
635-- argument between each element of the list.
760-- argument between each element of the list.
764+-- >>> T.intercalate "NI!" ["We", "seek", "the", "Holy", "Grail"]
765+-- "WeNI!seekNI!theNI!HolyNI!Grail"
636intercalate :: Text -> [Text] -> Text
766intercalate :: Text -> [Text] -> Text
767+intercalate = coerce JSS.intercalate
637−intercalate t = concat . (F.intersperse t)
768+-- intercalate t = concat . (F.intersperse t)
638{-# INLINE intercalate #-}
769{-# INLINE intercalate #-}
640-- | /O(n)/ The 'intersperse' function takes a character and places it
771-- | /O(n)/ The 'intersperse' function takes a character and places it
641−-- between the characters of a 'Text'. Subject to fusion. Performs
772+-- between the characters of a 'Text'.
776+-- >>> T.intersperse '.' "SHIELD"
642−-- replacement on invalid scalar values.
779+-- Subject to fusion. Performs replacement on invalid scalar values.
643intersperse :: Char -> Text -> Text
780intersperse :: Char -> Text -> Text
781+intersperse = coerce JSS.intersperse
644−intersperse c t = unstream (S.intersperse (safe c) (stream t))
782+-- intersperse c t = unstream (S.intersperse (safe c) (stream t))
645{-# INLINE intersperse #-}
783{-# INLINE intersperse #-}
647−-- | /O(n)/ Reverse the characters of a string. Subject to fusion.
785+-- | /O(n)/ Reverse the characters of a string.
789+-- >>> T.reverse "desrever"
792+-- Subject to fusion.
648reverse :: Text -> Text
793reverse :: Text -> Text
794+reverse = coerce JSS.reverse
649−reverse t = S.reverse (stream t)
795+-- reverse t = S.reverse (stream t)
650{-# INLINE reverse #-}
796{-# INLINE reverse #-}
652-- | /O(m+n)/ Replace every non-overlapping occurrence of @needle@ in
798-- | /O(m+n)/ Replace every non-overlapping occurrence of @needle@ in
@@ -663,12 +809,14 @@ reverse t = S.reverse (stream t)
663-- @needle@ occurs in @replacement@, that occurrence will /not/ itself
809-- @needle@ occurs in @replacement@, that occurrence will /not/ itself
664-- be replaced recursively:
810-- be replaced recursively:
666−-- > replace "oo" "foo" "oo" == "foo"
812+-- >>> replace "oo" "foo" "oo"
668-- In cases where several instances of @needle@ overlap, only the
815-- In cases where several instances of @needle@ overlap, only the
669-- first one will be replaced:
816-- first one will be replaced:
671−-- > replace "ofo" "bar" "ofofo" == "barfo"
818+-- >>> replace "ofo" "bar" "ofofo"
673-- In (unlikely) bad cases, this function's time complexity degrades
821-- In (unlikely) bad cases, this function's time complexity degrades
674-- towards /O(n*m)/.
822-- towards /O(n*m)/.
@@ -680,28 +828,29 @@ replace :: Text
681 -- ^ @haystack@ in which to search.
829 -- ^ @haystack@ in which to search.
831+replace = coerce JSS.replace
683−replace needle@(Text _ _ neeLen)
832+-- replace needle@(Text _ _ neeLen)
684− (Text repArr repOff repLen)
833+-- (Text repArr repOff repLen)
685− haystack@(Text hayArr hayOff hayLen)
834+-- haystack@(Text hayArr hayOff hayLen)
686− | neeLen == 0 = emptyError "replace"
835+-- | neeLen == 0 = emptyError "replace"
687− | L.null ixs = haystack
836+-- | L.null ixs = haystack
688− | len > 0 = Text (A.run x) 0 len
837+-- | len > 0 = Text (A.run x) 0 len
689− | otherwise = empty
838+-- | otherwise = empty
691− ixs = indices needle haystack
840+-- ixs = indices needle haystack
692− len = hayLen - (neeLen - repLen) `mul` L.length ixs
841+-- len = hayLen - (neeLen - repLen) `mul` L.length ixs
693− x :: ST s (A.MArray s)
842+-- x :: ST s (A.MArray s)
695− marr <- A.new len
844+-- marr <- A.new len
696− let loop (i:is) o d = do
845+-- let loop (i:is) o d = do
697− let d0 = d + i - o
846+-- let d0 = d + i - o
698− d1 = d0 + repLen
847+-- d1 = d0 + repLen
699− A.copyI marr d hayArr (hayOff+o) d0
848+-- A.copyI marr d hayArr (hayOff+o) d0
700− A.copyI marr d0 repArr repOff d1
849+-- A.copyI marr d0 repArr repOff d1
701− loop is (i + neeLen) d1
850+-- loop is (i + neeLen) d1
702− loop [] o d = A.copyI marr d hayArr (hayOff+o) len
851+-- loop [] o d = A.copyI marr d hayArr (hayOff+o) len
703− loop ixs 0 0
852+-- loop ixs 0 0
704− return marr
853+-- return marr
706-- ----------------------------------------------------------------------------
855-- ----------------------------------------------------------------------------
707-- ** Case conversions (folds)
856-- ** Case conversions (folds)
@@ -740,7 +889,8 @@ replace needle@(Text _ _ neeLen)
740-- U+00B5) is case folded to \"μ\" (small letter mu, U+03BC)
889-- U+00B5) is case folded to \"μ\" (small letter mu, U+03BC)
741-- instead of itself.
890-- instead of itself.
742toCaseFold :: Text -> Text
891toCaseFold :: Text -> Text
743−toCaseFold t = unstream (S.toCaseFold (stream t))
892+-- toCaseFold t = unstream (S.toCaseFold (stream t))
893+toCaseFold = coerce JSS.toCaseFold
744{-# INLINE toCaseFold #-}
894{-# INLINE toCaseFold #-}
746-- | /O(n)/ Convert a string to lower case, using simple case
896-- | /O(n)/ Convert a string to lower case, using simple case
@@ -751,7 +901,8 @@ toCaseFold t = unstream (S.toCaseFold (stream t))
751-- U+0130) maps to the sequence \"i\" (Latin small letter i, U+0069)
901-- U+0130) maps to the sequence \"i\" (Latin small letter i, U+0069)
752-- followed by \" ̇\" (combining dot above, U+0307).
902-- followed by \" ̇\" (combining dot above, U+0307).
753toLower :: Text -> Text
903toLower :: Text -> Text
754−toLower t = unstream (S.toLower (stream t))
904+-- toLower t = unstream (S.toLower (stream t))
905+toLower = coerce JSS.toLower
755{-# INLINE toLower #-}
906{-# INLINE toLower #-}
757-- | /O(n)/ Convert a string to upper case, using simple case
908-- | /O(n)/ Convert a string to upper case, using simple case
@@ -761,7 +912,8 @@ toLower t = unstream (S.toLower (stream t))
761-- instance, the German \"ß\" (eszett, U+00DF) maps to the
912-- instance, the German \"ß\" (eszett, U+00DF) maps to the
762-- two-letter sequence \"SS\".
913-- two-letter sequence \"SS\".
763toUpper :: Text -> Text
914toUpper :: Text -> Text
764−toUpper t = unstream (S.toUpper (stream t))
915+-- toUpper t = unstream (S.toUpper (stream t))
916+toUpper = coerce JSS.toUpper
765{-# INLINE toUpper #-}
917{-# INLINE toUpper #-}
767-- | /O(n)/ Convert a string to title case, using simple case
919-- | /O(n)/ Convert a string to title case, using simple case
@@ -782,8 +934,11 @@ toUpper t = unstream (S.toUpper (stream t))
782-- guides disagree on whether the book name \"The Hill of the Red
934-- guides disagree on whether the book name \"The Hill of the Red
783-- Fox\" is correctly title cased—but this function will
935-- Fox\" is correctly title cased—but this function will
784-- capitalize /every/ word.
936-- capitalize /every/ word.
785toTitle :: Text -> Text
939toTitle :: Text -> Text
940+toTitle = coerce JSS.toTitle
786−toTitle t = unstream (S.toTitle (stream t))
941+-- toTitle t = unstream (S.toTitle (stream t))
787{-# INLINE toTitle #-}
942{-# INLINE toTitle #-}
789-- | /O(n)/ Left-justify a string to the given length, using the
944-- | /O(n)/ Left-justify a string to the given length, using the
@@ -792,13 +947,17 @@ toTitle t = unstream (S.toTitle (stream t))
793-- Examples:
948-- Examples:
795−-- > justifyLeft 7 'x' "foo" == "fooxxxx"
950+-- >>> justifyLeft 7 'x' "foo"
796−-- > justifyLeft 3 'x' "foobar" == "foobar"
953+-- >>> justifyLeft 3 'x' "foobar"
797justifyLeft :: Int -> Char -> Text -> Text
955justifyLeft :: Int -> Char -> Text -> Text
798−justifyLeft k c t
956+justifyLeft = coerce JSS.justifyLeft
799− | len >= k = t
958+-- | len >= k = t
800− | otherwise = t `append` replicateChar (k-len) c
959+-- | otherwise = t `append` replicateChar (k-len) c
801− where len = length t
960+-- where len = length t
802{-# INLINE [1] justifyLeft #-}
961{-# INLINE [1] justifyLeft #-}
@@ -814,13 +973,17 @@ justifyLeft k c t
815-- Examples:
974-- Examples:
817−-- > justifyRight 7 'x' "bar" == "xxxxbar"
976+-- >>> justifyRight 7 'x' "bar"
818−-- > justifyRight 3 'x' "foobar" == "foobar"
979+-- >>> justifyRight 3 'x' "foobar"
819justifyRight :: Int -> Char -> Text -> Text
981justifyRight :: Int -> Char -> Text -> Text
820−justifyRight k c t
982+justifyRight = coerce JSS.justifyRight
983+-- justifyRight k c t
821− | len >= k = t
984+-- | len >= k = t
822− | otherwise = replicateChar (k-len) c `append` t
985+-- | otherwise = replicateChar (k-len) c `append` t
823− where len = length t
986+-- where len = length t
824{-# INLINE justifyRight #-}
987{-# INLINE justifyRight #-}
826-- | /O(n)/ Center a string to the given length, using the specified
989-- | /O(n)/ Center a string to the given length, using the specified
@@ -829,23 +992,34 @@ justifyRight k c t
830-- Examples:
993-- Examples:
832−-- > center 8 'x' "HS" = "xxxHSxxx"
995+-- >>> center 8 'x' "HS"
833center :: Int -> Char -> Text -> Text
997center :: Int -> Char -> Text -> Text
834−center k c t
998+center = coerce JSS.center
835− | len >= k = t
1000+-- | len >= k = t
836− | otherwise = replicateChar l c `append` t `append` replicateChar r c
1001+-- | otherwise = replicateChar l c `append` t `append` replicateChar r c
837− where len = length t
1002+-- where len = length t
838− d = k - len
1003+-- d = k - len
839− r = d `quot` 2
1004+-- r = d `quot` 2
840− l = d - r
1005+-- l = d - r
841{-# INLINE center #-}
1006{-# INLINE center #-}
843-- | /O(n)/ The 'transpose' function transposes the rows and columns
1008-- | /O(n)/ The 'transpose' function transposes the rows and columns
844-- of its 'Text' argument. Note that this function uses 'pack',
1009-- of its 'Text' argument. Note that this function uses 'pack',
845-- 'unpack', and the list version of transpose, and is thus not very
1010-- 'unpack', and the list version of transpose, and is thus not very
846-- efficient.
1011-- efficient.
1015+-- >>> transpose ["green","orange"]
1016+-- ["go","rr","ea","en","ng","e"]
1018+-- >>> transpose ["blue","red"]
1019+-- ["br","le","ud","e"]
847transpose :: [Text] -> [Text]
1020transpose :: [Text] -> [Text]
1021+transpose = coerce JSS.transpose
848−transpose ts = P.map pack (L.transpose (P.map unpack ts))
1022+-- transpose ts = P.map pack (L.transpose (P.map unpack ts))
850-- -----------------------------------------------------------------------------
1024-- -----------------------------------------------------------------------------
851-- * Reducing 'Text's (folds)
1025-- * Reducing 'Text's (folds)
@@ -855,23 +1029,27 @@ transpose ts = P.map pack (L.transpose (P.map unpack ts))
855-- reduces the 'Text' using the binary operator, from left to right.
1029-- reduces the 'Text' using the binary operator, from left to right.
856-- Subject to fusion.
1030-- Subject to fusion.
857foldl :: (a -> Char -> a) -> a -> Text -> a
1031foldl :: (a -> Char -> a) -> a -> Text -> a
1032+foldl f a0 (Text t) = JSS.foldl f a0 t
858−foldl f z t = S.foldl f z (stream t)
1033+-- foldl f z t = S.foldl f z (stream t)
859{-# INLINE foldl #-}
1034{-# INLINE foldl #-}
861-- | /O(n)/ A strict version of 'foldl'. Subject to fusion.
1036-- | /O(n)/ A strict version of 'foldl'. Subject to fusion.
862foldl' :: (a -> Char -> a) -> a -> Text -> a
1037foldl' :: (a -> Char -> a) -> a -> Text -> a
1038+foldl' f a0 (Text t) = JSS.foldl' f a0 t
863−foldl' f z t = S.foldl' f z (stream t)
1039+-- foldl' f z t = S.foldl' f z (stream t)
864{-# INLINE foldl' #-}
1040{-# INLINE foldl' #-}
866-- | /O(n)/ A variant of 'foldl' that has no starting value argument,
1042-- | /O(n)/ A variant of 'foldl' that has no starting value argument,
867-- and thus must be applied to a non-empty 'Text'. Subject to fusion.
1043-- and thus must be applied to a non-empty 'Text'. Subject to fusion.
868foldl1 :: (Char -> Char -> Char) -> Text -> Char
1044foldl1 :: (Char -> Char -> Char) -> Text -> Char
1045+foldl1 = coerce JSS.foldl1
869−foldl1 f t = S.foldl1 f (stream t)
1046+-- foldl1 f t = S.foldl1 f (stream t)
870{-# INLINE foldl1 #-}
1047{-# INLINE foldl1 #-}
872-- | /O(n)/ A strict version of 'foldl1'. Subject to fusion.
1049-- | /O(n)/ A strict version of 'foldl1'. Subject to fusion.
873foldl1' :: (Char -> Char -> Char) -> Text -> Char
1050foldl1' :: (Char -> Char -> Char) -> Text -> Char
1051+foldl1' = coerce JSS.foldl1'
874−foldl1' f t = S.foldl1' f (stream t)
1052+-- foldl1' f t = S.foldl1' f (stream t)
875{-# INLINE foldl1' #-}
1053{-# INLINE foldl1' #-}
877-- | /O(n)/ 'foldr', applied to a binary operator, a starting value
1055-- | /O(n)/ 'foldr', applied to a binary operator, a starting value
@@ -879,14 +1057,16 @@ foldl1' f t = S.foldl1' f (stream t)
879-- reduces the 'Text' using the binary operator, from right to left.
1057-- reduces the 'Text' using the binary operator, from right to left.
880-- Subject to fusion.
1058-- Subject to fusion.
881foldr :: (Char -> a -> a) -> a -> Text -> a
1059foldr :: (Char -> a -> a) -> a -> Text -> a
1060+foldr f a0 (Text t) = JSS.foldr f a0 t
882−foldr f z t = S.foldr f z (stream t)
1061+-- foldr f z t = S.foldr f z (stream t)
883{-# INLINE foldr #-}
1062{-# INLINE foldr #-}
885-- | /O(n)/ A variant of 'foldr' that has no starting value argument,
1064-- | /O(n)/ A variant of 'foldr' that has no starting value argument,
886-- and thus must be applied to a non-empty 'Text'. Subject to
1065-- and thus must be applied to a non-empty 'Text'. Subject to
887-- fusion.
1066-- fusion.
888foldr1 :: (Char -> Char -> Char) -> Text -> Char
1067foldr1 :: (Char -> Char -> Char) -> Text -> Char
1068+foldr1 = coerce JSS.foldr1
889−foldr1 f t = S.foldr1 f (stream t)
1069+-- foldr1 f t = S.foldr1 f (stream t)
890{-# INLINE foldr1 #-}
1070{-# INLINE foldr1 #-}
892-- -----------------------------------------------------------------------------
1072-- -----------------------------------------------------------------------------
@@ -894,48 +1074,54 @@ foldr1 f t = S.foldr1 f (stream t)
895-- | /O(n)/ Concatenate a list of 'Text's.
1075-- | /O(n)/ Concatenate a list of 'Text's.
896concat :: [Text] -> Text
1076concat :: [Text] -> Text
1077+concat = coerce JSS.concat
897−concat ts = case ts' of
1078+-- concat ts = case ts' of
898− [] -> empty
1079+-- [] -> empty
899− [t] -> t
1080+-- [t] -> t
900− _ -> Text (A.run go) 0 len
1081+-- _ -> Text (A.run go) 0 len
902− ts' = L.filter (not . null) ts
1083+-- ts' = L.filter (not . null) ts
903− len = sumP "concat" $ L.map lengthWord16 ts'
1084+-- len = sumP "concat" $ L.map lengthWord16 ts'
904− go :: ST s (A.MArray s)
1085+-- go :: ST s (A.MArray s)
905− go = do
1086+-- go = do
906− arr <- A.new len
1087+-- arr <- A.new len
907− let step i (Text a o l) =
1088+-- let step i (Text a o l) =
908− let !j = i + l in A.copyI arr i a o j >> return j
1089+-- let !j = i + l in A.copyI arr i a o j >> return j
909− foldM step 0 ts' >> return arr
1090+-- foldM step 0 ts' >> return arr
911-- | /O(n)/ Map a function over a 'Text' that results in a 'Text', and
1092-- | /O(n)/ Map a function over a 'Text' that results in a 'Text', and
912-- concatenate the results.
1093-- concatenate the results.
913concatMap :: (Char -> Text) -> Text -> Text
1094concatMap :: (Char -> Text) -> Text -> Text
1095+concatMap = coerce JSS.concatMap
914−concatMap f = concat . foldr ((:) . f) []
1096+-- concatMap f = concat . foldr ((:) . f) []
915{-# INLINE concatMap #-}
1097{-# INLINE concatMap #-}
917-- | /O(n)/ 'any' @p@ @t@ determines whether any character in the
1099-- | /O(n)/ 'any' @p@ @t@ determines whether any character in the
918-- 'Text' @t@ satisfies the predicate @p@. Subject to fusion.
1100-- 'Text' @t@ satisfies the predicate @p@. Subject to fusion.
919any :: (Char -> Bool) -> Text -> Bool
1101any :: (Char -> Bool) -> Text -> Bool
1102+any = coerce JSS.any
920−any p t = S.any p (stream t)
1103+-- any p t = S.any p (stream t)
921{-# INLINE any #-}
1104{-# INLINE any #-}
923-- | /O(n)/ 'all' @p@ @t@ determines whether all characters in the
1106-- | /O(n)/ 'all' @p@ @t@ determines whether all characters in the
924-- 'Text' @t@ satisfy the predicate @p@. Subject to fusion.
1107-- 'Text' @t@ satisfy the predicate @p@. Subject to fusion.
925all :: (Char -> Bool) -> Text -> Bool
1108all :: (Char -> Bool) -> Text -> Bool
1109+all = coerce JSS.all
926−all p t = S.all p (stream t)
1110+-- all p t = S.all p (stream t)
927{-# INLINE all #-}
1111{-# INLINE all #-}
929-- | /O(n)/ 'maximum' returns the maximum value from a 'Text', which
1113-- | /O(n)/ 'maximum' returns the maximum value from a 'Text', which
930-- must be non-empty. Subject to fusion.
1114-- must be non-empty. Subject to fusion.
931maximum :: Text -> Char
1115maximum :: Text -> Char
1116+maximum = coerce JSS.maximum
932−maximum t = S.maximum (stream t)
1117+-- maximum t = S.maximum (stream t)
933{-# INLINE maximum #-}
1118{-# INLINE maximum #-}
935-- | /O(n)/ 'minimum' returns the minimum value from a 'Text', which
1120-- | /O(n)/ 'minimum' returns the minimum value from a 'Text', which
936-- must be non-empty. Subject to fusion.
1121-- must be non-empty. Subject to fusion.
937minimum :: Text -> Char
1122minimum :: Text -> Char
1123+minimum = coerce JSS.minimum
938−minimum t = S.minimum (stream t)
1124+-- minimum t = S.minimum (stream t)
939{-# INLINE minimum #-}
1125{-# INLINE minimum #-}
941-- -----------------------------------------------------------------------------
1127-- -----------------------------------------------------------------------------
@@ -951,8 +1137,9 @@ minimum t = S.minimum (stream t)
952-- > last (scanl f z xs) == foldl f z xs.
1138-- > last (scanl f z xs) == foldl f z xs.
953scanl :: (Char -> Char -> Char) -> Char -> Text -> Text
1139scanl :: (Char -> Char -> Char) -> Char -> Text -> Text
1140+scanl = coerce JSS.scanl
954−scanl f z t = unstream (S.scanl g z (stream t))
1141+-- scanl f z t = unstream (S.scanl g z (stream t))
955− where g a b = safe (f a b)
1142+-- where g a b = safe (f a b)
956{-# INLINE scanl #-}
1143{-# INLINE scanl #-}
958-- | /O(n)/ 'scanl1' is a variant of 'scanl' that has no starting
1145-- | /O(n)/ 'scanl1' is a variant of 'scanl' that has no starting
@@ -961,8 +1148,9 @@ scanl f z t = unstream (S.scanl g z (stream t))
962-- > scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]
1149-- > scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]
963scanl1 :: (Char -> Char -> Char) -> Text -> Text
1150scanl1 :: (Char -> Char -> Char) -> Text -> Text
1151+scanl1 = coerce JSS.scanl1
964−scanl1 f t | null t = empty
1152+-- scanl1 f t | null t = empty
965− | otherwise = scanl f (unsafeHead t) (unsafeTail t)
1153+-- | otherwise = scanl f (unsafeHead t) (unsafeTail t)
966{-# INLINE scanl1 #-}
1154{-# INLINE scanl1 #-}
968-- | /O(n)/ 'scanr' is the right-to-left dual of 'scanl'. Performs
1156-- | /O(n)/ 'scanr' is the right-to-left dual of 'scanl'. Performs
@@ -970,16 +1158,18 @@ scanl1 f t | null t = empty
971-- > scanr f v == reverse . scanl (flip f) v . reverse
1159-- > scanr f v == reverse . scanl (flip f) v . reverse
972scanr :: (Char -> Char -> Char) -> Char -> Text -> Text
1160scanr :: (Char -> Char -> Char) -> Char -> Text -> Text
1161+scanr = coerce JSS.scanr
973−scanr f z = S.reverse . S.reverseScanr g z . reverseStream
1162+-- scanr f z = S.reverse . S.reverseScanr g z . reverseStream
974− where g a b = safe (f a b)
1163+-- where g a b = safe (f a b)
975{-# INLINE scanr #-}
1164{-# INLINE scanr #-}
977-- | /O(n)/ 'scanr1' is a variant of 'scanr' that has no starting
1166-- | /O(n)/ 'scanr1' is a variant of 'scanr' that has no starting
978-- value argument. Subject to fusion. Performs replacement on
1167-- value argument. Subject to fusion. Performs replacement on
979-- invalid scalar values.
1168-- invalid scalar values.
980scanr1 :: (Char -> Char -> Char) -> Text -> Text
1169scanr1 :: (Char -> Char -> Char) -> Text -> Text
1170+scanr1 = coerce JSS.scanr1
981−scanr1 f t | null t = empty
1171+-- scanr1 f t | null t = empty
982− | otherwise = scanr f (last t) (init t)
1172+-- | otherwise = scanr f (last t) (init t)
983{-# INLINE scanr1 #-}
1173{-# INLINE scanr1 #-}
985-- | /O(n)/ Like a combination of 'map' and 'foldl''. Applies a
1175-- | /O(n)/ Like a combination of 'map' and 'foldl''. Applies a
@@ -987,8 +1177,11 @@ scanr1 f t | null t = empty
987-- parameter from left to right, and returns a final 'Text'. Performs
1177-- parameter from left to right, and returns a final 'Text'. Performs
988-- replacement on invalid scalar values.
1178-- replacement on invalid scalar values.
989mapAccumL :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
1179mapAccumL :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
1180+mapAccumL f z0 (Text a) =
1181+ let (a', t) = JSS.mapAccumL f z0 a
990−mapAccumL f z0 = S.mapAccumL g z0 . stream
1183+-- mapAccumL f z0 = S.mapAccumL g z0 . stream
991− where g a b = second safe (f a b)
1184+-- where g a b = second safe (f a b)
992{-# INLINE mapAccumL #-}
1185{-# INLINE mapAccumL #-}
994-- | The 'mapAccumR' function behaves like a combination of 'map' and
1187-- | The 'mapAccumR' function behaves like a combination of 'map' and
@@ -998,8 +1191,11 @@ mapAccumL f z0 = S.mapAccumL g z0 . stream
998-- 'Text'.
1191-- 'Text'.
999-- Performs replacement on invalid scalar values.
1192-- Performs replacement on invalid scalar values.
1000mapAccumR :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
1193mapAccumR :: (a -> Char -> (a,Char)) -> a -> Text -> (a, Text)
1194+mapAccumR f z0 (Text a) =
1195+ let (a', t) = JSS.mapAccumR f z0 a
1001−mapAccumR f z0 = second reverse . S.mapAccumL g z0 . reverseStream
1197+-- mapAccumR f z0 = second reverse . S.mapAccumL g z0 . reverseStream
1002− where g a b = second safe (f a b)
1198+-- where g a b = second safe (f a b)
1003{-# INLINE mapAccumR #-}
1199{-# INLINE mapAccumR #-}
1005-- -----------------------------------------------------------------------------
1201-- -----------------------------------------------------------------------------
@@ -1008,20 +1204,21 @@ mapAccumR f z0 = second reverse . S.mapAccumL g z0 . reverseStream
1008-- | /O(n*m)/ 'replicate' @n@ @t@ is a 'Text' consisting of the input
1204-- | /O(n*m)/ 'replicate' @n@ @t@ is a 'Text' consisting of the input
1009-- @t@ repeated @n@ times.
1205-- @t@ repeated @n@ times.
1010replicate :: Int -> Text -> Text
1206replicate :: Int -> Text -> Text
1207+replicate = coerce JSS.replicate
1011−replicate n t@(Text a o l)
1208+-- replicate n t@(Text a o l)
1012− | n <= 0 || l <= 0 = empty
1209+-- | n <= 0 || l <= 0 = empty
1013− | n == 1 = t
1210+-- | n == 1 = t
1014− | isSingleton t = replicateChar n (unsafeHead t)
1211+-- | isSingleton t = replicateChar n (unsafeHead t)
1015− | otherwise = Text (A.run x) 0 len
1212+-- | otherwise = Text (A.run x) 0 len
1017− len = l `mul` n
1214+-- len = l `mul` n
1018− x :: ST s (A.MArray s)
1215+-- x :: ST s (A.MArray s)
1019− x = do
1216+-- x = do
1020− arr <- A.new len
1217+-- arr <- A.new len
1021− let loop !d !i | i >= n = return arr
1218+-- let loop !d !i | i >= n = return arr
1022− | otherwise = let m = d + l
1219+-- | otherwise = let m = d + l
1023− in A.copyI arr d a o m >> loop m (i+1)
1220+-- in A.copyI arr d a o m >> loop m (i+1)
1024− loop 0 0
1221+-- loop 0 0
1025{-# INLINE [1] replicate #-}
1222{-# INLINE [1] replicate #-}
1027{-# RULES
1224{-# RULES
@@ -1032,8 +1229,19 @@ replicate n t@(Text a o l)
1032-- | /O(n)/ 'replicateChar' @n@ @c@ is a 'Text' of length @n@ with @c@ the
1229-- | /O(n)/ 'replicateChar' @n@ @c@ is a 'Text' of length @n@ with @c@ the
1033-- value of every element. Subject to fusion.
1230-- value of every element. Subject to fusion.
1034replicateChar :: Int -> Char -> Text
1231replicateChar :: Int -> Char -> Text
1035replicateChar n c = unstream (S.replicateCharI n (safe c))
1233replicateChar n c = unstream (S.replicateCharI n (safe c))
1036{-# INLINE replicateChar #-}
1234{-# INLINE replicateChar #-}
1236+replicateChar n c = Text $ js_replicateChar n c
1237+{-# INLINE [1] replicateChar #-}
1239+"JSSTRING replicateChar -> fused" [~1] forall n c.
1240+ replicateChar n c = unstream (S.replicateCharI n (safe c))
1241+"JSSTRING replicateChar -> unfused" [1] forall n c.
1242+ unstream (S.replicateCharI n (safe c)) = replicateChar n c
1038-- | /O(n)/, where @n@ is the length of the result. The 'unfoldr'
1246-- | /O(n)/, where @n@ is the length of the result. The 'unfoldr'
1039-- function is analogous to the List 'L.unfoldr'. 'unfoldr' builds a
1247-- function is analogous to the List 'L.unfoldr'. 'unfoldr' builds a
@@ -1043,7 +1251,8 @@ replicateChar n c = unstream (S.replicateCharI n (safe c))
1043-- string, and @b@ is the seed value for further production. Subject
1251-- string, and @b@ is the seed value for further production. Subject
1044-- to fusion. Performs replacement on invalid scalar values.
1252-- to fusion. Performs replacement on invalid scalar values.
1045unfoldr :: (a -> Maybe (Char,a)) -> a -> Text
1253unfoldr :: (a -> Maybe (Char,a)) -> a -> Text
1254+unfoldr f a = Text $ JSS.unfoldr f a
1046−unfoldr f s = unstream (S.unfoldr (firstf safe . f) s)
1255+-- unfoldr f s = unstream (S.unfoldr (firstf safe . f) s)
1047{-# INLINE unfoldr #-}
1256{-# INLINE unfoldr #-}
1049-- | /O(n)/ Like 'unfoldr', 'unfoldrN' builds a 'Text' from a seed
1258-- | /O(n)/ Like 'unfoldr', 'unfoldrN' builds a 'Text' from a seed
@@ -1053,7 +1262,8 @@ unfoldr f s = unstream (S.unfoldr (firstf safe . f) s)
1053-- correct, otherwise its performance is similar to 'unfoldr'. Subject
1262-- correct, otherwise its performance is similar to 'unfoldr'. Subject
1054-- to fusion. Performs replacement on invalid scalar values.
1263-- to fusion. Performs replacement on invalid scalar values.
1055unfoldrN :: Int -> (a -> Maybe (Char,a)) -> a -> Text
1264unfoldrN :: Int -> (a -> Maybe (Char,a)) -> a -> Text
1265+unfoldrN n f a0 = Text $ JSS.unfoldrN n f a0
1056−unfoldrN n f s = unstream (S.unfoldrN n (firstf safe . f) s)
1266+-- unfoldrN n f s = unstream (S.unfoldrN n (firstf safe . f) s)
1057{-# INLINE unfoldrN #-}
1267{-# INLINE unfoldrN #-}
1059-- -----------------------------------------------------------------------------
1269-- -----------------------------------------------------------------------------
@@ -1063,18 +1273,19 @@ unfoldrN n f s = unstream (S.unfoldrN n (firstf safe . f) s)
1063-- 'Text' of length @n@, or the 'Text' itself if @n@ is greater than
1273-- 'Text' of length @n@, or the 'Text' itself if @n@ is greater than
1064-- the length of the Text. Subject to fusion.
1274-- the length of the Text. Subject to fusion.
1065take :: Int -> Text -> Text
1275take :: Int -> Text -> Text
1276+take = coerce JSS.take
1066−take n t@(Text arr off len)
1277+-- take n t@(Text arr off len)
1067− | n <= 0 = empty
1278+-- | n <= 0 = empty
1068− | n >= len = t
1279+-- | n >= len = t
1069− | otherwise = text arr off (iterN n t)
1280+-- | otherwise = text arr off (iterN n t)
1070{-# INLINE [1] take #-}
1281{-# INLINE [1] take #-}
1072−iterN :: Int -> Text -> Int
1283+-- iterN :: Int -> Text -> Int
1073−iterN n t@(Text _arr _off len) = loop 0 0
1284+-- iterN n t@(Text _arr _off len) = loop 0 0
1074− where loop !i !cnt
1285+-- where loop !i !cnt
1075− | i >= len || cnt >= n = i
1286+-- | i >= len || cnt >= n = i
1076− | otherwise = loop (i+d) (cnt+1)
1287+-- | otherwise = loop (i+d) (cnt+1)
1077− where d = iter_ t i
1288+-- where d = iter_ t i
1079{-# RULES
1290{-# RULES
1080"TEXT take -> fused" [~1] forall n t.
1291"TEXT take -> fused" [~1] forall n t.
@@ -1088,31 +1299,36 @@ iterN n t@(Text _arr _off len) = loop 0 0
1089-- Examples:
1300-- Examples:
1091−-- > takeEnd 3 "foobar" == "bar"
1302+-- >>> takeEnd 3 "foobar"
1092takeEnd :: Int -> Text -> Text
1306takeEnd :: Int -> Text -> Text
1307+takeEnd = coerce JSS.takeEnd
1093−takeEnd n t@(Text arr off len)
1308+-- takeEnd n t@(Text arr off len)
1094− | n <= 0 = empty
1309+-- | n <= 0 = empty
1095− | n >= len = t
1310+-- | n >= len = t
1096− | otherwise = text arr (off+i) (len-i)
1311+-- | otherwise = text arr (off+i) (len-i)
1097− where i = iterNEnd n t
1312+-- where i = iterNEnd n t
1099−iterNEnd :: Int -> Text -> Int
1314+-- iterNEnd :: Int -> Text -> Int
1100−iterNEnd n t@(Text _arr _off len) = loop (len-1) n
1315+-- iterNEnd n t@(Text _arr _off len) = loop (len-1) n
1101− where loop i !m
1316+-- where loop i !m
1102− | i <= 0 = 0
1317+-- | i <= 0 = 0
1103− | m <= 1 = i
1318+-- | m <= 1 = i
1104− | otherwise = loop (i+d) (m-1)
1319+-- | otherwise = loop (i+d) (m-1)
1105− where d = reverseIter_ t i
1320+-- where d = reverseIter_ t i
1107-- | /O(n)/ 'drop' @n@, applied to a 'Text', returns the suffix of the
1322-- | /O(n)/ 'drop' @n@, applied to a 'Text', returns the suffix of the
1108-- 'Text' after the first @n@ characters, or the empty 'Text' if @n@
1323-- 'Text' after the first @n@ characters, or the empty 'Text' if @n@
1109-- is greater than the length of the 'Text'. Subject to fusion.
1324-- is greater than the length of the 'Text'. Subject to fusion.
1110drop :: Int -> Text -> Text
1325drop :: Int -> Text -> Text
1326+drop = coerce JSS.drop
1111−drop n t@(Text arr off len)
1327+-- drop n t@(Text arr off len)
1112− | n <= 0 = t
1328+-- | n <= 0 = t
1113− | n >= len = empty
1329+-- | n >= len = empty
1114− | otherwise = text arr (off+i) (len-i)
1330+-- | otherwise = text arr (off+i) (len-i)
1115− where i = iterN n t
1331+-- where i = iterN n t
1116{-# INLINE [1] drop #-}
1332{-# INLINE [1] drop #-}
1118{-# RULES
1334{-# RULES
@@ -1127,22 +1343,27 @@ drop n t@(Text arr off len)
1128-- Examples:
1344-- Examples:
1130−-- > dropEnd 3 "foobar" == "foo"
1346+-- >>> dropEnd 3 "foobar"
1131dropEnd :: Int -> Text -> Text
1350dropEnd :: Int -> Text -> Text
1351+dropEnd = coerce JSS.dropEnd
1132−dropEnd n t@(Text arr off len)
1352+-- dropEnd n t@(Text arr off len)
1133− | n <= 0 = t
1353+-- | n <= 0 = t
1134− | n >= len = empty
1354+-- | n >= len = empty
1135− | otherwise = text arr off (iterNEnd n t)
1355+-- | otherwise = text arr off (iterNEnd n t)
1137-- | /O(n)/ 'takeWhile', applied to a predicate @p@ and a 'Text',
1357-- | /O(n)/ 'takeWhile', applied to a predicate @p@ and a 'Text',
1138-- returns the longest prefix (possibly empty) of elements that
1358-- returns the longest prefix (possibly empty) of elements that
1139-- satisfy @p@. Subject to fusion.
1359-- satisfy @p@. Subject to fusion.
1140takeWhile :: (Char -> Bool) -> Text -> Text
1360takeWhile :: (Char -> Bool) -> Text -> Text
1361+takeWhile = coerce JSS.takeWhile
1141−takeWhile p t@(Text arr off len) = loop 0
1362+-- takeWhile p t@(Text arr off len) = loop 0
1142− where loop !i | i >= len = t
1363+-- where loop !i | i >= len = t
1143− | p c = loop (i+d)
1364+-- | p c = loop (i+d)
1144− | otherwise = text arr off i
1365+-- | otherwise = text arr off i
1145− where Iter c d = iter t i
1366+-- where Iter c d = iter t i
1146{-# INLINE [1] takeWhile #-}
1367{-# INLINE [1] takeWhile #-}
1148{-# RULES
1369{-# RULES
@@ -1157,13 +1378,25 @@ takeWhile p t@(Text arr off len) = loop 0
1157-- satisfy @p@. Subject to fusion.
1378-- satisfy @p@. Subject to fusion.
1158-- Examples:
1379-- Examples:
1160−-- > takeWhileEnd (=='o') "foo" == "oo"
1381+-- >>> takeWhileEnd (=='o') "foo"
1161takeWhileEnd :: (Char -> Bool) -> Text -> Text
1385takeWhileEnd :: (Char -> Bool) -> Text -> Text
1162takeWhileEnd p t@(Text arr off len) = loop (len-1) len
1387takeWhileEnd p t@(Text arr off len) = loop (len-1) len
1163 where loop !i !l | l <= 0 = t
1388 where loop !i !l | l <= 0 = t
1164 | p c = loop (i+d) (l+d)
1389 | p c = loop (i+d) (l+d)
1165 | otherwise = text arr (off+l) (len-l)
1390 | otherwise = text arr (off+l) (len-l)
1166 where (c,d) = reverseIter t i
1391 where (c,d) = reverseIter t i
1393+takeWhileEnd p t@(Text jst) = loop (len-1) len
1394+ where loop !i !l | l <= 0 = t
1395+ | p c = loop (i+d) (l+d)
1396+ | otherwise = Text $ js_substr1 l jst
1397+ where (c,d) = reverseIter t i
1398+ len = js_length jst
1167{-# INLINE [1] takeWhileEnd #-}
1400{-# INLINE [1] takeWhileEnd #-}
1169{-# RULES
1402{-# RULES
@@ -1176,11 +1409,12 @@ takeWhileEnd p t@(Text arr off len) = loop (len-1) len
1176-- | /O(n)/ 'dropWhile' @p@ @t@ returns the suffix remaining after
1409-- | /O(n)/ 'dropWhile' @p@ @t@ returns the suffix remaining after
1177-- 'takeWhile' @p@ @t@. Subject to fusion.
1410-- 'takeWhile' @p@ @t@. Subject to fusion.
1178dropWhile :: (Char -> Bool) -> Text -> Text
1411dropWhile :: (Char -> Bool) -> Text -> Text
1412+dropWhile = coerce JSS.dropWhile
1179−dropWhile p t@(Text arr off len) = loop 0 0
1413+-- dropWhile p t@(Text arr off len) = loop 0 0
1180− where loop !i !l | l >= len = empty
1414+-- where loop !i !l | l >= len = empty
1181− | p c = loop (i+d) (l+d)
1415+-- | p c = loop (i+d) (l+d)
1182− | otherwise = Text arr (off+i) (len-l)
1416+-- | otherwise = Text arr (off+i) (len-l)
1183− where Iter c d = iter t i
1417+
1184{-# INLINE [1] dropWhile #-}
1418{-# INLINE [1] dropWhile #-}
1186{-# RULES
1420{-# RULES
@@ -1196,13 +1430,15 @@ dropWhile p t@(Text arr off len) = loop 0 0
1197-- Examples:
1431-- Examples:
1199−-- > dropWhileEnd (=='.') "foo..." == "foo"
1433+-- >>> dropWhileEnd (=='.') "foo..."
1200dropWhileEnd :: (Char -> Bool) -> Text -> Text
1435dropWhileEnd :: (Char -> Bool) -> Text -> Text
1436+dropWhileEnd = coerce JSS.dropWhileEnd
1201−dropWhileEnd p t@(Text arr off len) = loop (len-1) len
1437+-- dropWhileEnd p t@(Text arr off len) = loop (len-1) len
1202− where loop !i !l | l <= 0 = empty
1438+-- where loop !i !l | l <= 0 = empty
1203− | p c = loop (i+d) (l+d)
1439+-- | p c = loop (i+d) (l+d)
1204− | otherwise = Text arr off l
1440+-- | otherwise = Text arr off l
1205− where (c,d) = reverseIter t i
1441+-- where (c,d) = reverseIter t i
1206{-# INLINE [1] dropWhileEnd #-}
1442{-# INLINE [1] dropWhileEnd #-}
1208{-# RULES
1444{-# RULES
@@ -1245,45 +1481,49 @@ strip = dropAround isSpace
1245-- prefix of @t@ of length @n@, and whose second is the remainder of
1481-- prefix of @t@ of length @n@, and whose second is the remainder of
1246-- the string. It is equivalent to @('take' n t, 'drop' n t)@.
1482-- the string. It is equivalent to @('take' n t, 'drop' n t)@.
1247splitAt :: Int -> Text -> (Text, Text)
1483splitAt :: Int -> Text -> (Text, Text)
1484+splitAt = coerce JSS.splitAt
1248−splitAt n t@(Text arr off len)
1485+-- splitAt n t@(Text arr off len)
1249− | n <= 0 = (empty, t)
1486+-- | n <= 0 = (empty, t)
1250− | n >= len = (t, empty)
1487+-- | n >= len = (t, empty)
1251− | otherwise = let k = iterN n t
1488+-- | otherwise = let k = iterN n t
1252− in (text arr off k, text arr (off+k) (len-k))
1489+-- in (text arr off k, text arr (off+k) (len-k))
1254-- | /O(n)/ 'span', applied to a predicate @p@ and text @t@, returns
1491-- | /O(n)/ 'span', applied to a predicate @p@ and text @t@, returns
1255-- a pair whose first element is the longest prefix (possibly empty)
1492-- a pair whose first element is the longest prefix (possibly empty)
1256-- of @t@ of elements that satisfy @p@, and whose second is the
1493-- of @t@ of elements that satisfy @p@, and whose second is the
1257-- remainder of the list.
1494-- remainder of the list.
1258span :: (Char -> Bool) -> Text -> (Text, Text)
1495span :: (Char -> Bool) -> Text -> (Text, Text)
1496+span = coerce JSS.span
1259−span p t = case span_ p t of
1497+-- span p t = case span_ p t of
1260− (# hd,tl #) -> (hd,tl)
1498+-- (# hd,tl #) -> (hd,tl)
1261{-# INLINE span #-}
1499{-# INLINE span #-}
1263-- | /O(n)/ 'break' is like 'span', but the prefix returned is
1501-- | /O(n)/ 'break' is like 'span', but the prefix returned is
1264-- over elements that fail the predicate @p@.
1502-- over elements that fail the predicate @p@.
1265break :: (Char -> Bool) -> Text -> (Text, Text)
1503break :: (Char -> Bool) -> Text -> (Text, Text)
1504+break = coerce JSS.break
1266−break p = span (not . p)
1505+-- break p = span (not . p)
1267{-# INLINE break #-}
1506{-# INLINE break #-}
1269-- | /O(n)/ Group characters in a string according to a predicate.
1508-- | /O(n)/ Group characters in a string according to a predicate.
1270groupBy :: (Char -> Char -> Bool) -> Text -> [Text]
1509groupBy :: (Char -> Char -> Bool) -> Text -> [Text]
1510+groupBy = coerce JSS.groupBy
1271−groupBy p = loop
1511+-- groupBy p = loop
1273− loop t@(Text arr off len)
1513+-- loop t@(Text arr off len)
1274− | null t = []
1514+-- | null t = []
1275− | otherwise = text arr off n : loop (text arr (off+n) (len-n))
1515+-- | otherwise = text arr off n : loop (text arr (off+n) (len-n))
1276− where Iter c d = iter t 0
1516+-- where Iter c d = iter t 0
1277− n = d + findAIndexOrEnd (not . p c) (Text arr (off+d) (len-d))
1517+-- n = d + findAIndexOrEnd (not . p c) (Text arr (off+d) (len-d))
1279-- | Returns the /array/ index (in units of 'Word16') at which a
1519-- | Returns the /array/ index (in units of 'Word16') at which a
1280-- character may be found. This is /not/ the same as the logical
1520-- character may be found. This is /not/ the same as the logical
1281-- index returned by e.g. 'findIndex'.
1521-- index returned by e.g. 'findIndex'.
1282−findAIndexOrEnd :: (Char -> Bool) -> Text -> Int
1522+-- findAIndexOrEnd :: (Char -> Bool) -> Text -> Int
1283−findAIndexOrEnd q t@(Text _arr _off len) = go 0
1523+-- findAIndexOrEnd q t@(Text _arr _off len) = go 0
1284− where go !i | i >= len || q c = i
1524+-- where go !i | i >= len || q c = i
1285− | otherwise = go (i+d)
1525+-- | otherwise = go (i+d)
1286− where Iter c d = iter t i
1526+-- where Iter c d = iter t i
1288-- | /O(n)/ Group characters in a string by equality.
1528-- | /O(n)/ Group characters in a string by equality.
1289group :: Text -> [Text]
1529group :: Text -> [Text]
@@ -1292,15 +1532,17 @@ group = groupBy (==)
1292-- | /O(n)/ Return all initial segments of the given 'Text', shortest
1532-- | /O(n)/ Return all initial segments of the given 'Text', shortest
1293-- first.
1533-- first.
1294inits :: Text -> [Text]
1534inits :: Text -> [Text]
1535+inits = coerce JSS.inits
1295−inits t@(Text arr off len) = loop 0
1536+-- inits t@(Text arr off len) = loop 0
1296− where loop i | i >= len = [t]
1537+-- where loop i | i >= len = [t]
1297− | otherwise = Text arr off i : loop (i + iter_ t i)
1538+-- | otherwise = Text arr off i : loop (i + iter_ t i)
1299-- | /O(n)/ Return all final segments of the given 'Text', longest
1540-- | /O(n)/ Return all final segments of the given 'Text', longest
1300-- first.
1541-- first.
1301tails :: Text -> [Text]
1542tails :: Text -> [Text]
1543+tails = coerce JSS.tails
1302−tails t | null t = [empty]
1544+-- tails t | null t = [empty]
1303− | otherwise = t : tails (unsafeTail t)
1545+-- | otherwise = t : tails (unsafeTail t)
1305-- $split
1547-- $split
@@ -1314,9 +1556,14 @@ tails t | null t = [empty]
1315-- Examples:
1557-- Examples:
1317−-- > splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
1559+-- >>> splitOn "\r\n" "a\r\nb\r\nd\r\ne"
1560+-- ["a","b","d","e"]
1318−-- > splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
1562+-- >>> splitOn "aaa" "aaaXaaaXaaaXaaa"
1563+-- ["","X","X","X",""]
1319−-- > splitOn "x" "x" == ["",""]
1565+-- >>> splitOn "x" "x"
@@ -1333,13 +1580,14 @@ splitOn :: Text
1334 -- ^ Input text.
1581 -- ^ Input text.
1335 -> [Text]
1582 -> [Text]
1583+splitOn = coerce JSS.splitOn
1336−splitOn pat@(Text _ _ l) src@(Text arr off len)
1584+-- splitOn pat@(Text _ _ l) src@(Text arr off len)
1337− | l <= 0 = emptyError "splitOn"
1585+-- | l <= 0 = emptyError "splitOn"
1338− | isSingleton pat = split (== unsafeHead pat) src
1586+-- | isSingleton pat = split (== unsafeHead pat) src
1339− | otherwise = go 0 (indices pat src)
1587+-- | otherwise = go 0 (indices pat src)
1341− go !s (x:xs) = text arr (s+off) (x-s) : go (x+l) xs
1589+-- go !s (x:xs) = text arr (s+off) (x-s) : go (x+l) xs
1342− go s _ = [text arr (s+off) (len-s)]
1590+-- go s _ = [text arr (s+off) (len-s)]
1343{-# INLINE [1] splitOn #-}
1591{-# INLINE [1] splitOn #-}
1345{-# RULES
1593{-# RULES
@@ -1352,28 +1600,36 @@ splitOn pat@(Text _ _ l) src@(Text arr off len)
1352-- resulting components do not contain the separators. Two adjacent
1600-- resulting components do not contain the separators. Two adjacent
1353-- separators result in an empty component in the output. eg.
1601-- separators result in an empty component in the output. eg.
1355−-- > split (=='a') "aabbaca" == ["","","bb","c",""]
1603+-- >>> split (=='a') "aabbaca"
1604+-- ["","","bb","c",""]
1356−-- > split (=='a') "" == [""]
1606+-- >>> split (=='a') ""
1357split :: (Char -> Bool) -> Text -> [Text]
1608split :: (Char -> Bool) -> Text -> [Text]
1609+split = coerce JSS.split
1358−split _ t@(Text _off _arr 0) = [t]
1610+-- split _ t@(Text _off _arr 0) = [t]
1359−split p t = loop t
1611+-- split p t = loop t
1360− where loop s | null s' = [l]
1612+-- where loop s | null s' = [l]
1361− | otherwise = l : loop (unsafeTail s')
1613+-- | otherwise = l : loop (unsafeTail s')
1362− where (# l, s' #) = span_ (not . p) s
1614+-- where (# l, s' #) = span_ (not . p) s
1363{-# INLINE split #-}
1615{-# INLINE split #-}
1365-- | /O(n)/ Splits a 'Text' into components of length @k@. The last
1617-- | /O(n)/ Splits a 'Text' into components of length @k@. The last
1366-- element may be shorter than the other chunks, depending on the
1618-- element may be shorter than the other chunks, depending on the
1367-- length of the input. Examples:
1619-- length of the input. Examples:
1369−-- > chunksOf 3 "foobarbaz" == ["foo","bar","baz"]
1621+-- >>> chunksOf 3 "foobarbaz"
1622+-- ["foo","bar","baz"]
1370−-- > chunksOf 4 "haskell.org" == ["hask","ell.","org"]
1624+-- >>> chunksOf 4 "haskell.org"
1625+-- ["hask","ell.","org"]
1371chunksOf :: Int -> Text -> [Text]
1626chunksOf :: Int -> Text -> [Text]
1372−chunksOf k = go
1627+chunksOf = coerce JSS.chunksOf
1374− go t = case splitAt k t of
1630+-- go t = case splitAt k t of
1375− (a,b) | null a -> []
1631+-- (a,b) | null a -> []
1376− | otherwise -> a : go b
1632+-- | otherwise -> a : go b
1377{-# INLINE chunksOf #-}
1633{-# INLINE chunksOf #-}
1379-- ----------------------------------------------------------------------------
1635-- ----------------------------------------------------------------------------
@@ -1386,7 +1642,8 @@ chunksOf k = go
1386-- returns the first element matching the predicate, or 'Nothing' if
1642-- returns the first element matching the predicate, or 'Nothing' if
1387-- there is no such element.
1643-- there is no such element.
1388find :: (Char -> Bool) -> Text -> Maybe Char
1644find :: (Char -> Bool) -> Text -> Maybe Char
1645+find = coerce JSS.find
1389−find p t = S.findBy p (stream t)
1646+-- find p t = S.findBy p (stream t)
1390{-# INLINE find #-}
1647{-# INLINE find #-}
1392-- | /O(n)/ The 'partition' function takes a predicate and a 'Text',
1649-- | /O(n)/ The 'partition' function takes a predicate and a 'Text',
@@ -1395,14 +1652,16 @@ find p t = S.findBy p (stream t)
1396-- > partition p t == (filter p t, filter (not . p) t)
1653-- > partition p t == (filter p t, filter (not . p) t)
1397partition :: (Char -> Bool) -> Text -> (Text, Text)
1654partition :: (Char -> Bool) -> Text -> (Text, Text)
1655+partition = coerce JSS.partition
1398−partition p t = (filter p t, filter (not . p) t)
1656+-- partition p t = (filter p t, filter (not . p) t)
1399{-# INLINE partition #-}
1657{-# INLINE partition #-}
1401-- | /O(n)/ 'filter', applied to a predicate and a 'Text',
1659-- | /O(n)/ 'filter', applied to a predicate and a 'Text',
1402-- returns a 'Text' containing those characters that satisfy the
1660-- returns a 'Text' containing those characters that satisfy the
1403-- predicate.
1661-- predicate.
1404filter :: (Char -> Bool) -> Text -> Text
1662filter :: (Char -> Bool) -> Text -> Text
1663+filter = coerce JSS.filter
1405−filter p t = unstream (S.filter p (stream t))
1664+-- filter p t = unstream (S.filter p (stream t))
1406{-# INLINE filter #-}
1665{-# INLINE filter #-}
1408-- | /O(n+m)/ Find the first instance of @needle@ (which must be
1667-- | /O(n+m)/ Find the first instance of @needle@ (which must be
@@ -1412,8 +1671,11 @@ filter p t = unstream (S.filter p (stream t))
1413-- Examples:
1672-- Examples:
1415−-- > breakOn "::" "a::b::c" ==> ("a", "::b::c")
1674+-- >>> breakOn "::" "a::b::c"
1416−-- > breakOn "/" "foobar" ==> ("foobar", "")
1677+-- >>> breakOn "/" "foobar"
@@ -1427,11 +1689,12 @@ filter p t = unstream (S.filter p (stream t))
1427-- In (unlikely) bad cases, this function's time complexity degrades
1689-- In (unlikely) bad cases, this function's time complexity degrades
1428-- towards /O(n*m)/.
1690-- towards /O(n*m)/.
1429breakOn :: Text -> Text -> (Text, Text)
1691breakOn :: Text -> Text -> (Text, Text)
1692+breakOn = coerce JSS.breakOn
1430−breakOn pat src@(Text arr off len)
1693+-- breakOn pat src@(Text arr off len)
1431− | null pat = emptyError "breakOn"
1694+-- | null pat = emptyError "breakOn"
1432− | otherwise = case indices pat src of
1695+-- | otherwise = case indices pat src of
1433− [] -> (src, empty)
1696+-- [] -> (src, empty)
1434− (x:_) -> (text arr off x, text arr (off+x) (len-x))
1697+-- (x:_) -> (text arr off x, text arr (off+x) (len-x))
1435{-# INLINE breakOn #-}
1698{-# INLINE breakOn #-}
1437-- | /O(n+m)/ Similar to 'breakOn', but searches from the end of the
1700-- | /O(n+m)/ Similar to 'breakOn', but searches from the end of the
@@ -1441,10 +1704,12 @@ breakOn pat src@(Text arr off len)
1441-- up to and including the last match of @needle@. The second is the
1704-- up to and including the last match of @needle@. The second is the
1442-- remainder of @haystack@, following the match.
1705-- remainder of @haystack@, following the match.
1444−-- > breakOnEnd "::" "a::b::c" ==> ("a::b::", "c")
1707+-- >>> breakOnEnd "::" "a::b::c"
1445breakOnEnd :: Text -> Text -> (Text, Text)
1709breakOnEnd :: Text -> Text -> (Text, Text)
1710+breakOnEnd = coerce JSS.breakOnEnd
1446−breakOnEnd pat src = (reverse b, reverse a)
1711+-- breakOnEnd pat src = (reverse b, reverse a)
1447− where (a,b) = breakOn (reverse pat) (reverse src)
1712+-- where (a,b) = breakOn (reverse pat) (reverse src)
1448{-# INLINE breakOnEnd #-}
1713{-# INLINE breakOnEnd #-}
1450-- | /O(n+m)/ Find all non-overlapping instances of @needle@ in
1715-- | /O(n+m)/ Find all non-overlapping instances of @needle@ in
@@ -1456,10 +1721,11 @@ breakOnEnd pat src = (reverse b, reverse a)
1457-- Examples:
1722-- Examples:
1459−-- > breakOnAll "::" ""
1724+-- >>> breakOnAll "::" ""
1460−-- > ==> []
1725+-- []
1461−-- > breakOnAll "/" "a/b/c/"
1727+-- >>> breakOnAll "/" "a/b/c/"
1462−-- > ==> [("a", "/b/c/"), ("a/b", "/c/"), ("a/b/c", "/")]
1728+-- [("a","/b/c/"),("a/b","/c/"),("a/b/c","/")]
1464-- In (unlikely) bad cases, this function's time complexity degrades
1730-- In (unlikely) bad cases, this function's time complexity degrades
1465-- towards /O(n*m)/.
1731-- towards /O(n*m)/.
@@ -1468,12 +1734,13 @@ breakOnEnd pat src = (reverse b, reverse a)
1468breakOnAll :: Text -- ^ @needle@ to search for
1734breakOnAll :: Text -- ^ @needle@ to search for
1469 -> Text -- ^ @haystack@ in which to search
1735 -> Text -- ^ @haystack@ in which to search
1470 -> [(Text, Text)]
1736 -> [(Text, Text)]
1737+breakOnAll = coerce JSS.breakOnAll
1471−breakOnAll pat src@(Text arr off slen)
1738+-- breakOnAll pat src@(Text arr off slen)
1472− | null pat = emptyError "breakOnAll"
1739+-- | null pat = emptyError "breakOnAll"
1473− | otherwise = L.map step (indices pat src)
1740+-- | otherwise = L.map step (indices pat src)
1475− step x = (chunk 0 x, chunk x (slen-x))
1742+-- step x = (chunk 0 x, chunk x (slen-x))
1476− chunk !n !l = text arr (n+off) l
1743+-- chunk !n !l = text arr (n+off) l
1477{-# INLINE breakOnAll #-}
1744{-# INLINE breakOnAll #-}
1479-------------------------------------------------------------------------------
1746-------------------------------------------------------------------------------
@@ -1497,14 +1764,16 @@ breakOnAll pat src@(Text arr off slen)
1498-- | /O(n)/ 'Text' index (subscript) operator, starting from 0.
1765-- | /O(n)/ 'Text' index (subscript) operator, starting from 0.
1499index :: Text -> Int -> Char
1766index :: Text -> Int -> Char
1767+index = coerce JSS.index
1500−index t n = S.index (stream t) n
1768+-- index t n = S.index (stream t) n
1501{-# INLINE index #-}
1769{-# INLINE index #-}
1503-- | /O(n)/ The 'findIndex' function takes a predicate and a 'Text'
1771-- | /O(n)/ The 'findIndex' function takes a predicate and a 'Text'
1504-- and returns the index of the first element in the 'Text' satisfying
1772-- and returns the index of the first element in the 'Text' satisfying
1505-- the predicate. Subject to fusion.
1773-- the predicate. Subject to fusion.
1506findIndex :: (Char -> Bool) -> Text -> Maybe Int
1774findIndex :: (Char -> Bool) -> Text -> Maybe Int
1775+findIndex = coerce JSS.findIndex
1507−findIndex p t = S.findIndex p (stream t)
1776+-- findIndex p t = S.findIndex p (stream t)
1508{-# INLINE findIndex #-}
1777{-# INLINE findIndex #-}
1510-- | /O(n+m)/ The 'count' function returns the number of times the
1779-- | /O(n+m)/ The 'count' function returns the number of times the
@@ -1514,10 +1783,11 @@ findIndex p t = S.findIndex p (stream t)
1514-- In (unlikely) bad cases, this function's time complexity degrades
1783-- In (unlikely) bad cases, this function's time complexity degrades
1515-- towards /O(n*m)/.
1784-- towards /O(n*m)/.
1516count :: Text -> Text -> Int
1785count :: Text -> Text -> Int
1786+count = coerce JSS.count
1517−count pat src
1787+-- count pat src
1518− | null pat = emptyError "count"
1788+-- | null pat = emptyError "count"
1519− | isSingleton pat = countChar (unsafeHead pat) src
1789+-- | isSingleton pat = countChar (unsafeHead pat) src
1520− | otherwise = L.length (indices pat src)
1790+-- | otherwise = L.length (indices pat src)
1521{-# INLINE [1] count #-}
1791{-# INLINE [1] count #-}
1523{-# RULES
1793{-# RULES
@@ -1539,42 +1809,46 @@ countChar c t = S.countChar c (stream t)
1539-- excess elements of the longer 'Text' are discarded. This is
1809-- excess elements of the longer 'Text' are discarded. This is
1540-- equivalent to a pair of 'unpack' operations.
1810-- equivalent to a pair of 'unpack' operations.
1541zip :: Text -> Text -> [(Char,Char)]
1811zip :: Text -> Text -> [(Char,Char)]
1812+zip = coerce JSS.zip
1542−zip a b = S.unstreamList $ S.zipWith (,) (stream a) (stream b)
1813+-- zip a b = S.unstreamList $ S.zipWith (,) (stream a) (stream b)
1543{-# INLINE zip #-}
1814{-# INLINE zip #-}
1545-- | /O(n)/ 'zipWith' generalises 'zip' by zipping with the function
1816-- | /O(n)/ 'zipWith' generalises 'zip' by zipping with the function
1546-- given as the first argument, instead of a tupling function.
1817-- given as the first argument, instead of a tupling function.
1547-- Performs replacement on invalid scalar values.
1818-- Performs replacement on invalid scalar values.
1548zipWith :: (Char -> Char -> Char) -> Text -> Text -> Text
1819zipWith :: (Char -> Char -> Char) -> Text -> Text -> Text
1820+zipWith = coerce JSS.zipWith
1549−zipWith f t1 t2 = unstream (S.zipWith g (stream t1) (stream t2))
1821+-- zipWith f t1 t2 = unstream (S.zipWith g (stream t1) (stream t2))
1550− where g a b = safe (f a b)
1822+-- where g a b = safe (f a b)
1551{-# INLINE zipWith #-}
1823{-# INLINE zipWith #-}
1553-- | /O(n)/ Breaks a 'Text' up into a list of words, delimited by 'Char's
1825-- | /O(n)/ Breaks a 'Text' up into a list of words, delimited by 'Char's
1554-- representing white space.
1826-- representing white space.
1555words :: Text -> [Text]
1827words :: Text -> [Text]
1828+words = coerce JSS.words
1556−words t@(Text arr off len) = loop 0 0
1829+-- words t@(Text arr off len) = loop 0 0
1558− loop !start !n
1831+-- loop !start !n
1559− | n >= len = if start == n
1832+-- | n >= len = if start == n
1560− then []
1833+-- then []
1561− else [Text arr (start+off) (n-start)]
1834+-- else [Text arr (start+off) (n-start)]
1562− | isSpace c =
1835+-- | isSpace c =
1563− if start == n
1836+-- if start == n
1564− then loop (start+1) (start+1)
1837+-- then loop (start+1) (start+1)
1565− else Text arr (start+off) (n-start) : loop (n+d) (n+d)
1838+-- else Text arr (start+off) (n-start) : loop (n+d) (n+d)
1566− | otherwise = loop start (n+d)
1839+-- | otherwise = loop start (n+d)
1567− where Iter c d = iter t n
1840+-- where Iter c d = iter t n
1568{-# INLINE words #-}
1841{-# INLINE words #-}
1570-- | /O(n)/ Breaks a 'Text' up into a list of 'Text's at
1843-- | /O(n)/ Breaks a 'Text' up into a list of 'Text's at
1571-- newline 'Char's. The resulting strings do not contain newlines.
1844-- newline 'Char's. The resulting strings do not contain newlines.
1572lines :: Text -> [Text]
1845lines :: Text -> [Text]
1846+lines = coerce JSS.lines
1573−lines ps | null ps = []
1847+-- lines ps | null ps = []
1574− | otherwise = h : if null t
1848+-- | otherwise = h : if null t
1575− then []
1849+-- then []
1576− else lines (unsafeTail t)
1850+-- else lines (unsafeTail t)
1577− where (# h,t #) = span_ (/= '\n') ps
1851+-- where (# h,t #) = span_ (/= '\n') ps
1578{-# INLINE lines #-}
1852{-# INLINE lines #-}
@@ -1602,34 +1876,40 @@ lines' ps | null ps = []
1602-- | /O(n)/ Joins lines, after appending a terminating newline to
1876-- | /O(n)/ Joins lines, after appending a terminating newline to
1604unlines :: [Text] -> Text
1878unlines :: [Text] -> Text
1879+unlines = coerce JSS.unlines
1605−unlines = concat . L.map (`snoc` '\n')
1880+-- unlines = concat . L.map (`snoc` '\n')
1606{-# INLINE unlines #-}
1881{-# INLINE unlines #-}
1608-- | /O(n)/ Joins words using single space characters.
1883-- | /O(n)/ Joins words using single space characters.
1609unwords :: [Text] -> Text
1884unwords :: [Text] -> Text
1885+unwords = coerce JSS.unwords
1610−unwords = intercalate (singleton ' ')
1886+-- unwords = intercalate (singleton ' ')
1611{-# INLINE unwords #-}
1887{-# INLINE unwords #-}
1613-- | /O(n)/ The 'isPrefixOf' function takes two 'Text's and returns
1889-- | /O(n)/ The 'isPrefixOf' function takes two 'Text's and returns
1614-- 'True' iff the first is a prefix of the second. Subject to fusion.
1890-- 'True' iff the first is a prefix of the second. Subject to fusion.
1615isPrefixOf :: Text -> Text -> Bool
1891isPrefixOf :: Text -> Text -> Bool
1892+isPrefixOf = coerce JSS.isPrefixOf
1616−isPrefixOf a@(Text _ _ alen) b@(Text _ _ blen) =
1893+-- isPrefixOf a@(Text _ _ alen) b@(Text _ _ blen) =
1617− alen <= blen && S.isPrefixOf (stream a) (stream b)
1894+-- alen <= blen && S.isPrefixOf (stream a) (stream b)
1618{-# INLINE [1] isPrefixOf #-}
1895{-# INLINE [1] isPrefixOf #-}
1620{-# RULES
1897{-# RULES
1621"TEXT isPrefixOf -> fused" [~1] forall s t.
1898"TEXT isPrefixOf -> fused" [~1] forall s t.
1622 isPrefixOf s t = S.isPrefixOf (stream s) (stream t)
1899 isPrefixOf s t = S.isPrefixOf (stream s) (stream t)
1900+"JSSTRING isPrefixOf -> unfused" [1] forall x y.
1901+ S.isPrefixOf (stream x) (stream y) = isPrefixOf x y
1625-- | /O(n)/ The 'isSuffixOf' function takes two 'Text's and returns
1904-- | /O(n)/ The 'isSuffixOf' function takes two 'Text's and returns
1626-- 'True' iff the first is a suffix of the second.
1905-- 'True' iff the first is a suffix of the second.
1627isSuffixOf :: Text -> Text -> Bool
1906isSuffixOf :: Text -> Text -> Bool
1907+isSuffixOf = coerce JSS.isSuffixOf
1628−isSuffixOf a@(Text _aarr _aoff alen) b@(Text barr boff blen) =
1908+-- isSuffixOf a@(Text _aarr _aoff alen) b@(Text barr boff blen) =
1629− d >= 0 && a == b'
1909+-- d >= 0 && a == b'
1630− where d = blen - alen
1910+-- where d = blen - alen
1631− b' | d == 0 = b
1911+-- b' | d == 0 = b
1632− | otherwise = Text barr (boff+d) alen
1912+-- | otherwise = Text barr (boff+d) alen
1633{-# INLINE isSuffixOf #-}
1913{-# INLINE isSuffixOf #-}
1635-- | /O(n+m)/ The 'isInfixOf' function takes two 'Text's and returns
1915-- | /O(n+m)/ The 'isInfixOf' function takes two 'Text's and returns
@@ -1639,10 +1919,11 @@ isSuffixOf a@(Text _aarr _aoff alen) b@(Text barr boff blen) =
1639-- In (unlikely) bad cases, this function's time complexity degrades
1919-- In (unlikely) bad cases, this function's time complexity degrades
1640-- towards /O(n*m)/.
1920-- towards /O(n*m)/.
1641isInfixOf :: Text -> Text -> Bool
1921isInfixOf :: Text -> Text -> Bool
1922+isInfixOf = coerce JSS.isInfixOf
1642−isInfixOf needle haystack
1923+-- isInfixOf needle haystack
1643− | null needle = True
1924+-- | null needle = True
1644− | isSingleton needle = S.elem (unsafeHead needle) . S.stream $ haystack
1925+-- | isSingleton needle = S.elem (unsafeHead needle) . S.stream $ haystack
1645− | otherwise = not . L.null . indices needle $ haystack
1926+-- | otherwise = not . L.null . indices needle $ haystack
1646{-# INLINE [1] isInfixOf #-}
1927{-# INLINE [1] isInfixOf #-}
1648{-# RULES
1929{-# RULES
@@ -1658,9 +1939,14 @@ isInfixOf needle haystack
1659-- Examples:
1940-- Examples:
1661−-- > stripPrefix "foo" "foobar" == Just "bar"
1942+-- >>> stripPrefix "foo" "foobar"
1662−-- > stripPrefix "" "baz" == Just "baz"
1945+-- >>> stripPrefix "" "baz"
1663−-- > stripPrefix "foo" "quux" == Nothing
1948+-- >>> stripPrefix "foo" "quux"
1665-- This is particularly useful with the @ViewPatterns@ extension to
1951-- This is particularly useful with the @ViewPatterns@ extension to
1666-- GHC, as follows:
1952-- GHC, as follows:
@@ -1672,9 +1958,10 @@ isInfixOf needle haystack
1672-- > fnordLength (stripPrefix "fnord" -> Just suf) = T.length suf
1958-- > fnordLength (stripPrefix "fnord" -> Just suf) = T.length suf
1673-- > fnordLength _ = -1
1959-- > fnordLength _ = -1
1674stripPrefix :: Text -> Text -> Maybe Text
1960stripPrefix :: Text -> Text -> Maybe Text
1961+stripPrefix = coerce JSS.stripPrefix
1675−stripPrefix p@(Text _arr _off plen) t@(Text arr off len)
1962+-- stripPrefix p@(Text _arr _off plen) t@(Text arr off len)
1676− | p `isPrefixOf` t = Just $! text arr (off+plen) (len-plen)
1963+-- | p `isPrefixOf` t = Just $! text arr (off+plen) (len-plen)
1677− | otherwise = Nothing
1964+-- | otherwise = Nothing
1679-- | /O(n)/ Find the longest non-empty common prefix of two strings
1966-- | /O(n)/ Find the longest non-empty common prefix of two strings
1680-- and return it, along with the suffixes of each string at which they
1967-- and return it, along with the suffixes of each string at which they
@@ -1685,28 +1972,39 @@ stripPrefix p@(Text _arr _off plen) t@(Text arr off len)
1686-- Examples:
1973-- Examples:
1688−-- > commonPrefixes "foobar" "fooquux" == Just ("foo","bar","quux")
1975+-- >>> commonPrefixes "foobar" "fooquux"
1976+-- Just ("foo","bar","quux")
1689−-- > commonPrefixes "veeble" "fetzer" == Nothing
1978+-- >>> commonPrefixes "veeble" "fetzer"
1690−-- > commonPrefixes "" "baz" == Nothing
1981+-- >>> commonPrefixes "" "baz"
1691commonPrefixes :: Text -> Text -> Maybe (Text,Text,Text)
1983commonPrefixes :: Text -> Text -> Maybe (Text,Text,Text)
1984+commonPrefixes = coerce JSS.commonPrefixes
1692−commonPrefixes t0@(Text arr0 off0 len0) t1@(Text arr1 off1 len1) = go 0 0
1985+-- commonPrefixes t0@(Text arr0 off0 len0) t1@(Text arr1 off1 len1) = go 0 0
1694− go !i !j | i < len0 && j < len1 && a == b = go (i+d0) (j+d1)
1987+-- go !i !j | i < len0 && j < len1 && a == b = go (i+d0) (j+d1)
1695− | i > 0 = Just (Text arr0 off0 i,
1988+-- | i > 0 = Just (Text arr0 off0 i,
1696− text arr0 (off0+i) (len0-i),
1989+-- text arr0 (off0+i) (len0-i),
1697− text arr1 (off1+j) (len1-j))
1990+-- text arr1 (off1+j) (len1-j))
1698− | otherwise = Nothing
1991+-- | otherwise = Nothing
1699− where Iter a d0 = iter t0 i
1992+-- where Iter a d0 = iter t0 i
1700− Iter b d1 = iter t1 j
1993+-- Iter b d1 = iter t1 j
1702-- | /O(n)/ Return the prefix of the second string if its suffix
1995-- | /O(n)/ Return the prefix of the second string if its suffix
1703-- matches the entire first string.
1996-- matches the entire first string.
1705-- Examples:
1998-- Examples:
1707−-- > stripSuffix "bar" "foobar" == Just "foo"
2000+-- >>> stripSuffix "bar" "foobar"
1708−-- > stripSuffix "" "baz" == Just "baz"
2003+-- >>> stripSuffix "" "baz"
1709−-- > stripSuffix "foo" "quux" == Nothing
2006+-- >>> stripSuffix "foo" "quux"
1711-- This is particularly useful with the @ViewPatterns@ extension to
2009-- This is particularly useful with the @ViewPatterns@ extension to
1712-- GHC, as follows:
2010-- GHC, as follows:
@@ -1718,21 +2016,22 @@ commonPrefixes t0@(Text arr0 off0 len0) t1@(Text arr1 off1 len1) = go 0 0
1718-- > quuxLength (stripSuffix "quux" -> Just pre) = T.length pre
2016-- > quuxLength (stripSuffix "quux" -> Just pre) = T.length pre
1719-- > quuxLength _ = -1
2017-- > quuxLength _ = -1
1720stripSuffix :: Text -> Text -> Maybe Text
2018stripSuffix :: Text -> Text -> Maybe Text
2019+stripSuffix = coerce JSS.stripSuffix
1721−stripSuffix p@(Text _arr _off plen) t@(Text arr off len)
2020+-- stripSuffix p@(Text _arr _off plen) t@(Text arr off len)
1722− | p `isSuffixOf` t = Just $! text arr off (len-plen)
2021+-- | p `isSuffixOf` t = Just $! text arr off (len-plen)
1723− | otherwise = Nothing
2022+-- | otherwise = Nothing
1725−-- | Add a list of non-negative numbers. Errors out on overflow.
2024+-- -- | Add a list of non-negative numbers. Errors out on overflow.
1726−sumP :: String -> [Int] -> Int
2025+-- sumP :: String -> [Int] -> Int
1727−sumP fun = go 0
2026+-- sumP fun = go 0
1728− where go !a (x:xs)
2027+-- where go !a (x:xs)
1729− | ax >= 0 = go ax xs
2028+-- | ax >= 0 = go ax xs
1730− | otherwise = overflowError fun
2029+-- | otherwise = overflowError fun
1731− where ax = a + x
2030+-- where ax = a + x
1732− go a _ = a
2031+-- go a _ = a
1734−emptyError :: String -> a
2033+-- emptyError :: String -> a
1735−emptyError fun = P.error $ "Data.Text." ++ fun ++ ": empty input"
2034+-- emptyError fun = P.error $ "Data.Text." ++ fun ++ ": empty input"
1737overflowError :: String -> a
2036overflowError :: String -> a
1738overflowError fun = P.error $ "Data.Text." ++ fun ++ ": size overflow"
2037overflowError fun = P.error $ "Data.Text." ++ fun ++ ": size overflow"
@@ -1746,10 +2045,24 @@ overflowError fun = P.error $ "Data.Text." ++ fun ++ ": size overflow"
1746-- copy \"breaks the link\" to the original array, allowing it to be
2045-- copy \"breaks the link\" to the original array, allowing it to be
1747-- garbage collected if there are no other live references to it.
2046-- garbage collected if there are no other live references to it.
1748copy :: Text -> Text
2047copy :: Text -> Text
1749−copy (Text arr off len) = Text (A.run go) 0 len
2049+-- copy (Text arr off len) = Text (A.run go) 0 len
1751− go :: ST s (A.MArray s)
2051+-- go :: ST s (A.MArray s)
1752− go = do
2052+-- go = do
1753− marr <- A.new len
2053+-- marr <- A.new len
1754− A.copyI marr 0 arr off len
2054+
1755− return marr
2055+foreign import javascript unsafe
2056+ "h$jsstringReplicateChar" js_replicateChar :: Int -> Char -> JSString
2057+foreign import javascript unsafe
2058+ "$2.substr($1)" js_substr1 :: Int -> JSString -> JSString
2059+foreign import javascript unsafe
2060+ "$1.length" js_length :: JSString -> Int
2062+-------------------------------------------------
2063+-- NOTE: the named chunk below used by doctest;
2064+-- verify the doctests via `doctest -fobject-code Data/Text.hs`
2067+-- >>> :set -XOverloadedStrings
2068+-- >>> import qualified Data.Text as T