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