nonempty-wrapper-text (empty) → 0.1.0.0

raw patch · 5 files changed

+2657/−0 lines, 5 filesdep +basedep +bytestringdep +nonempty-wrapper

Dependencies added: base, bytestring, nonempty-wrapper, text

Files

• LICENSE +15/−0
• nonempty-wrapper-text.cabal +52/−0
• src/Data/Text/Encoding/NonEmpty.hs +224/−0
• src/Data/Text/Lazy/NonEmpty.hs +1200/−0
• src/Data/Text/NonEmpty.hs +1166/−0

@@ -0,0 +1,15 @@+ISC License++Copyright (c) 2022 Gautier DI FOLCO++Permission to use, copy, modify, and/or distribute this software for any+purpose with or without fee is hereby granted, provided that the above+copyright notice and this permission notice appear in all copies.++THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR+PERFORMANCE OF THIS SOFTWARE.

@@ -0,0 +1,52 @@+cabal-version:       3.0+name:                nonempty-wrapper-text+version:             0.1.0.0+author:              Gautier DI FOLCO+maintainer:          gautier.difolco@gmail.com+category:            Data+build-type:          Simple+license:             ISC+license-file:        LICENSE+synopsis:            'NonEmpty' wrappers for text+description:         'NonEmpty' wrappers for text.+Homepage:            http://github.com/blackheaven/nonempty-wrapper/nonempty-wrapper-text+tested-with:         GHC==9.2.2, GHC==9.0.2, GHC==8.10.7++library+  default-language:   Haskell2010+  build-depends:+        base == 4.*+      , text >=1 && < 3+      , bytestring >= 0.10 && < 0.13+      , nonempty-wrapper >= 0.1.0.0 && < 1+  hs-source-dirs: src+  exposed-modules:+      Data.Text.NonEmpty+      Data.Text.Encoding.NonEmpty+      Data.Text.Lazy.NonEmpty+  other-modules:+      Paths_nonempty_wrapper_text+  autogen-modules:+      Paths_nonempty_wrapper_text+  default-extensions:+      DataKinds+      DefaultSignatures+      DeriveAnyClass+      DeriveGeneric+      DerivingStrategies+      DerivingVia+      DuplicateRecordFields+      FlexibleContexts+      GADTs+      GeneralizedNewtypeDeriving+      KindSignatures+      LambdaCase+      OverloadedLists+      OverloadedStrings+      RankNTypes+      RecordWildCards+      ScopedTypeVariables+      TypeApplications+      TypeFamilies+      TypeOperators+  ghc-options: -Wall -Wcompat -Widentities -Wincomplete-record-updates -Wincomplete-uni-patterns -Wpartial-fields -Wredundant-constraints

@@ -0,0 +1,224 @@+-- |+-- Module        : Data.Text.Encoding.NonEmpty+-- Copyright     : Gautier DI FOLCO+-- License       : BSD2+--+-- Maintainer    : Gautier DI FOLCO <gautier.difolco@gmail.com>+-- Stability     : Unstable+-- Portability   : GHC+--+-- 'NonEmpty' wrappers around `Data.Text.Encoding`+module Data.Text.Encoding.NonEmpty+  ( -- * Decoding ByteStrings to Text+    -- $strict+    decodeLatin1,+    decodeUtf8,+    decodeUtf16LE,+    decodeUtf16BE,+    decodeUtf32LE,+    decodeUtf32BE,++    -- ** Catchable failure+    decodeUtf8',++    -- ** Controllable error handling+    decodeUtf8With,+    decodeUtf16LEWith,+    decodeUtf16BEWith,+    decodeUtf32LEWith,+    decodeUtf32BEWith,++    -- ** Stream oriented decoding+    -- $stream+    streamDecodeUtf8,+    streamDecodeUtf8With,+    E.Decoding (..),++    -- * Encoding Text to ByteStrings+    encodeUtf8,+    encodeUtf16LE,+    encodeUtf16BE,+    encodeUtf32LE,+    encodeUtf32BE,++    -- * Encoding Text using ByteString Builders+    encodeUtf8Builder,+    encodeUtf8BuilderEscaped,+  )+where++import Data.ByteString (ByteString)+import qualified Data.ByteString.Builder as B+import qualified Data.ByteString.Builder.Prim as BP+import Data.NonEmpty+import qualified Data.Text.Encoding as E+import Data.Text.Encoding.Error (OnDecodeError, UnicodeException)+import Data.Text.NonEmpty+import Data.Word (Word8)+import GHC.Stack++-- $strict+--+-- All of the single-parameter functions for decoding bytestrings+-- encoded in one of the Unicode Transformation Formats (UTF) operate+-- in a /strict/ mode: each will throw an exception if given invalid+-- input.+--+-- Each function has a variant, whose name is suffixed with -'With',+-- that gives greater control over the handling of decoding errors.+-- For instance, 'decodeUtf8' will throw an exception, but+-- 'decodeUtf8With' allows the programmer to determine what to do on a+-- decoding error.++-- | Decode a 'ByteString' containing Latin-1 (aka ISO-8859-1) encoded text.+--+-- 'decodeLatin1' is semantically equivalent to+--  @Data.Text.pack . Data.ByteString.Char8.unpack@+--+-- This is a total function. However, bear in mind that decoding Latin-1 (non-ASCII)+-- characters to UTf-8 requires actual work and is not just buffer copying.+decodeLatin1 :: HasCallStack => NonEmpty ByteString -> NonEmptyStrictText+decodeLatin1 = overNonEmpty E.decodeLatin1+{-# INLINE decodeLatin1 #-}++-- | Decode a 'ByteString' containing UTF-8 encoded text.+--+-- Surrogate code points in replacement character returned by 'OnDecodeError'+-- will be automatically remapped to the replacement char @U+FFFD@.+decodeUtf8With :: HasCallStack => OnDecodeError -> NonEmpty ByteString -> NonEmptyStrictText+decodeUtf8With onError = overNonEmpty $ E.decodeUtf8With onError+{-# INLINE decodeUtf8With #-}++-- | Decode, in a stream oriented way, a 'ByteString' containing UTF-8+-- encoded text that is known to be valid.+--+-- If the input contains any invalid UTF-8 data, an exception will be+-- thrown (either by this function or a continuation) that cannot be+-- caught in pure code.  For more control over the handling of invalid+-- data, use 'streamDecodeUtf8With'.+streamDecodeUtf8 :: HasCallStack => NonEmpty ByteString -> NonEmpty E.Decoding+streamDecodeUtf8 = overNonEmpty E.streamDecodeUtf8+{-# INLINE streamDecodeUtf8 #-}++-- | Decode, in a stream oriented way, a lazy 'ByteString' containing UTF-8+-- encoded text.+streamDecodeUtf8With :: HasCallStack => OnDecodeError -> NonEmpty ByteString -> NonEmpty E.Decoding+streamDecodeUtf8With onError = overNonEmpty $ E.streamDecodeUtf8With onError+{-# INLINE streamDecodeUtf8With #-}++-- | Decode a 'ByteString' containing UTF-8 encoded text that is known+-- to be valid.+--+-- If the input contains any invalid UTF-8 data, an exception will be+-- thrown that cannot be caught in pure code.  For more control over+-- the handling of invalid data, use 'decodeUtf8'' or+-- 'decodeUtf8With'.+--+-- This is a partial function: it checks that input is a well-formed+-- UTF-8 sequence and copies buffer or throws an error otherwise.+decodeUtf8 :: NonEmpty ByteString -> NonEmptyStrictText+decodeUtf8 = overNonEmpty E.decodeUtf8+{-# INLINE decodeUtf8 #-}++-- | Decode a 'ByteString' containing UTF-8 encoded text.+--+-- If the input contains any invalid UTF-8 data, the relevant+-- exception will be returned, otherwise the decoded text.+decodeUtf8' :: HasCallStack => NonEmpty ByteString -> Either UnicodeException NonEmptyStrictText+decodeUtf8' = fmap trustedNonEmpty . E.decodeUtf8' . getNonEmpty+{-# INLINE decodeUtf8' #-}++-- | Encode text to a ByteString 'B.Builder' using UTF-8 encoding.+encodeUtf8Builder :: NonEmptyStrictText -> NonEmpty B.Builder+encodeUtf8Builder = overNonEmpty E.encodeUtf8Builder+{-# INLINE encodeUtf8Builder #-}++-- | Encode text using UTF-8 encoding and escape the ASCII characters using+-- a 'BP.BoundedPrim'.+--+-- Use this function is to implement efficient encoders for text-based formats+-- like JSON or HTML.+encodeUtf8BuilderEscaped :: BP.BoundedPrim Word8 -> NonEmptyStrictText -> NonEmpty B.Builder+encodeUtf8BuilderEscaped be = overNonEmpty $ E.encodeUtf8BuilderEscaped be+{-# INLINE encodeUtf8BuilderEscaped #-}++-- | Encode text using UTF-8 encoding.+encodeUtf8 :: NonEmptyStrictText -> NonEmpty ByteString+encodeUtf8 = overNonEmpty E.encodeUtf8+{-# INLINE encodeUtf8 #-}++-- | Decode text from little endian UTF-16 encoding.+decodeUtf16LEWith :: OnDecodeError -> NonEmpty ByteString -> NonEmptyStrictText+decodeUtf16LEWith onError = overNonEmpty $ E.decodeUtf16LEWith onError+{-# INLINE decodeUtf16LEWith #-}++-- | Decode text from little endian UTF-16 encoding.+--+-- If the input contains any invalid little endian UTF-16 data, an+-- exception will be thrown.  For more control over the handling of+-- invalid data, use 'decodeUtf16LEWith'.+decodeUtf16LE :: NonEmpty ByteString -> NonEmptyStrictText+decodeUtf16LE = overNonEmpty E.decodeUtf16LE+{-# INLINE decodeUtf16LE #-}++-- | Decode text from big endian UTF-16 encoding.+decodeUtf16BEWith :: OnDecodeError -> NonEmpty ByteString -> NonEmptyStrictText+decodeUtf16BEWith onError = overNonEmpty $ E.decodeUtf16BEWith onError+{-# INLINE decodeUtf16BEWith #-}++-- | Decode text from big endian UTF-16 encoding.+--+-- If the input contains any invalid big endian UTF-16 data, an+-- exception will be thrown.  For more control over the handling of+-- invalid data, use 'decodeUtf16BEWith'.+decodeUtf16BE :: NonEmpty ByteString -> NonEmptyStrictText+decodeUtf16BE = overNonEmpty E.decodeUtf16BE+{-# INLINE decodeUtf16BE #-}++-- | Encode text using little endian UTF-16 encoding.+encodeUtf16LE :: NonEmptyStrictText -> NonEmpty ByteString+encodeUtf16LE = overNonEmpty E.encodeUtf16LE+{-# INLINE encodeUtf16LE #-}++-- | Encode text using big endian UTF-16 encoding.+encodeUtf16BE :: NonEmptyStrictText -> NonEmpty ByteString+encodeUtf16BE = overNonEmpty E.encodeUtf16BE+{-# INLINE encodeUtf16BE #-}++-- | Decode text from little endian UTF-32 encoding.+decodeUtf32LEWith :: OnDecodeError -> NonEmpty ByteString -> NonEmptyStrictText+decodeUtf32LEWith onError = overNonEmpty $ E.decodeUtf32LEWith onError+{-# INLINE decodeUtf32LEWith #-}++-- | Decode text from little endian UTF-32 encoding.+--+-- If the input contains any invalid little endian UTF-32 data, an+-- exception will be thrown.  For more control over the handling of+-- invalid data, use 'decodeUtf32LEWith'.+decodeUtf32LE :: NonEmpty ByteString -> NonEmptyStrictText+decodeUtf32LE = overNonEmpty E.decodeUtf32LE+{-# INLINE decodeUtf32LE #-}++-- | Decode text from big endian UTF-32 encoding.+decodeUtf32BEWith :: OnDecodeError -> NonEmpty ByteString -> NonEmptyStrictText+decodeUtf32BEWith onError = overNonEmpty $ E.decodeUtf32BEWith onError+{-# INLINE decodeUtf32BEWith #-}++-- | Decode text from big endian UTF-32 encoding.+--+-- If the input contains any invalid big endian UTF-32 data, an+-- exception will be thrown.  For more control over the handling of+-- invalid data, use 'decodeUtf32BEWith'.+decodeUtf32BE :: NonEmpty ByteString -> NonEmptyStrictText+decodeUtf32BE = overNonEmpty E.decodeUtf32BE+{-# INLINE decodeUtf32BE #-}++-- | Encode text using little endian UTF-32 encoding.+encodeUtf32LE :: NonEmptyStrictText -> NonEmpty ByteString+encodeUtf32LE = overNonEmpty E.encodeUtf32LE+{-# INLINE encodeUtf32LE #-}++-- | Encode text using big endian UTF-32 encoding.+encodeUtf32BE :: NonEmptyStrictText -> NonEmpty ByteString+encodeUtf32BE = overNonEmpty E.encodeUtf32BE+{-# INLINE encodeUtf32BE #-}

@@ -0,0 +1,1200 @@+{-# LANGUAGE CPP #-}+{-# OPTIONS_GHC -Wno-redundant-constraints #-}+{-# OPTIONS_GHC -fno-warn-orphans #-}++-- |+-- Module        : Data.Text.Lazy.NonEmpty+-- Copyright     : Gautier DI FOLCO+-- License       : BSD2+--+-- Maintainer    : Gautier DI FOLCO <gautier.difolco@gmail.com>+-- Stability     : Unstable+-- Portability   : GHC+--+-- 'NonEmpty' wrappers around `Data.Text.Lazy`+--+-- This module is intended to be imported @qualified@, to avoid name+-- clashes with "Prelude" functions.  eg.+--+-- > import qualified Data.Text.Lazy.NonEmpty as NEL+module Data.Text.Lazy.NonEmpty+  ( -- * Types+    NonEmptyText,+    NonEmptyLazyText,++    -- * Creation and elimination+    pack,+    unpack,+    singleton,+    fromChunks,+    toChunks,+    toStrict,+    fromStrict,++    -- * Basic interface+    cons,+    snoc,+    uncons,+    unsnoc,+    head,+    last,+    tail,+    init,+    length,+    compareLength,++    -- * Transformations+    map,+    intercalate,+    intersperse,+    transpose,+    reverse,+    replace,++    -- ** Case conversion+    -- $case+    toCaseFold,+    toLower,+    toUpper,+    toTitle,++    -- ** Justification+    justifyLeft,+    justifyRight,+    center,++    -- * Folds+    foldl,+    foldl',+    foldl1,+    foldl1',+    foldr,+    foldr1,++    -- ** Special folds+    concat,+    concatMap,+    any,+    all,+    maximum,+    minimum,++    -- * Construction++    -- ** Scans+    scanl,+    scanl1,+    scanr,+    scanr1,++    -- ** Accumulating maps+    mapAccumL,+    mapAccumR,++    -- ** Generation and unfolding+    replicate,+    cycle,+    iterate,++    -- * Substrings++    -- ** Breaking strings+    take,+    takeEnd,+    drop,+    dropEnd,+    takeWhile,+    takeWhileEnd,+    dropWhile,+    dropWhileEnd,+    dropAround,+    strip,+    stripStart,+    stripEnd,+    splitAt,+    breakOn,+    breakOnEnd,+    break,+    span,+    group,+    groupBy,+    inits,+    tails,++    -- ** Breaking into many substrings+    -- $split+    splitOn,+    split,+    chunksOf,++    -- ** Breaking into lines and words+    lines,+    words,+    unlines,+    unwords,++    -- * Predicates+    isPrefixOf,+    isSuffixOf,+    isInfixOf,++    -- ** View patterns+    stripPrefix,+    stripSuffix,+    commonPrefixes,++    -- * Searching+    filter,+    breakOnAll,+    find,+#if MIN_VERSION_text(1,2,5)+    elem,+#endif+    partition,++    -- * Indexing+    index,+    count,++    -- * Zipping+    zip,+    zipWith,+  )+where++import Data.Function (on)+import Data.Int (Int64)+import Data.NonEmpty+import qualified Data.Text.Lazy as T+import Data.Text.NonEmpty (NonEmptyStrictText)+import GHC.Stack+import Prelude (Bool (..), Char, Maybe (..), Ord (..), Ordering, String, error, fmap, fst, not, snd, uncurry, ($), (.))++type NonEmptyLazyText = NonEmpty T.Text++type NonEmptyText = NonEmptyLazyText++instance NonEmptySingleton T.Text where+  type NonEmptySingletonElement T.Text = Char+  nonEmptySingleton _ = T.singleton++instance NonEmptyFromContainer T.Text where+  isNonEmpty = not . T.null++-- -----------------------------------------------------------------------------++-- * Conversion to/from 'NonEmptyLazyText'++-- | /O(n)/ Convert a 'NonEmpty String' into a 'NonEmptyLazyText'.+-- Performs replacement on invalid scalar values.+pack :: NonEmpty String -> NonEmptyLazyText+pack = overNonEmpty T.pack+{-# INLINE pack #-}++-- | /O(n)/ Convert a 'NonEmptyStrictText' into a 'NonEmpty String'.+unpack :: HasCallStack => NonEmptyLazyText -> NonEmpty String+unpack = overNonEmpty T.unpack+{-# INLINE unpack #-}++-- | /O(c)/ Convert a list of strict 'NonEmptyStrictText's into a lazy 'NonEmptyLazyText'.+fromChunks :: NonEmpty [NonEmptyStrictText] -> NonEmptyLazyText+fromChunks = overNonEmpty $ T.fromChunks . fmap getNonEmpty+{-# INLINE fromChunks #-}++-- | /O(n)/ Convert a lazy 'NonEmptyLazyText' into a list of strict 'NonEmptyStrictText's.+toChunks :: NonEmptyLazyText -> NonEmpty [NonEmptyStrictText]+toChunks = overNonEmpty $ fmap trustedNonEmpty . T.toChunks+{-# INLINE toChunks #-}++-- | /O(n)/ Convert a lazy 'NonEmptyLazyText' into a strict 'NonEmptyStrictText'.+toStrict :: NonEmptyLazyText -> NonEmptyStrictText+toStrict = overNonEmpty T.toStrict+{-# INLINE toStrict #-}++-- | /O(c)/ Convert a strict 'NonEmptyStrictText' into a lazy 'NonEmptyLazyText'.+fromStrict :: NonEmptyStrictText -> NonEmptyLazyText+fromStrict = overNonEmpty T.fromStrict+{-# INLINE fromStrict #-}++-- -----------------------------------------------------------------------------++-- * Basic functions++-- | /O(n)/ Adds a character to the front of a 'NonEmptyLazyText'.  This function+-- is more costly than its 'List' counterpart because it requires+-- copying a new array.  Performs replacement on+-- invalid scalar values.+cons :: Char -> NonEmptyLazyText -> NonEmptyLazyText+cons c = overNonEmpty $ T.cons c+{-# INLINE cons #-}++infixr 5 `cons`++-- | /O(n)/ Adds a character to the end of a 'NonEmptyLazyText'.  This copies the+-- entire array in the process.+-- Performs replacement on invalid scalar values.+snoc :: NonEmptyLazyText -> Char -> NonEmptyLazyText+snoc t c = overNonEmpty (`T.snoc` c) t+{-# INLINE snoc #-}++-- | /O(1)/ Returns the first character of a 'NonEmptyLazyText'.+head :: NonEmptyLazyText -> Char+head = fst . uncons+{-# INLINE head #-}++-- | /O(1)/ Returns the first character and rest of a 'NonEmptyLazyText'.+uncons :: NonEmptyLazyText -> (Char, T.Text)+uncons = withNonEmpty T.uncons+{-# INLINE uncons #-}++-- | /O(1)/ Returns the last character of a 'NonEmptyLazyText'.+last :: NonEmptyLazyText -> Char+last = snd . unsnoc+{-# INLINE last #-}++-- | /O(1)/ Returns all characters after the head of a 'NonEmptyLazyText'.+tail :: NonEmptyLazyText -> T.Text+tail = snd . uncons+{-# INLINE tail #-}++-- | /O(1)/ Returns all but the last character of a 'NonEmptyLazyText'.+init :: NonEmptyLazyText -> T.Text+init = fst . unsnoc+{-# INLINE init #-}++-- | /O(1)/ Returns all but the last character and the last character of a+-- 'NonEmptyLazyText'.+unsnoc :: NonEmptyLazyText -> (T.Text, Char)+unsnoc = withNonEmpty T.unsnoc+{-# INLINE unsnoc #-}++-- | /O(n)/ Returns the number of characters in a 'NonEmptyLazyText'.+length :: NonEmptyLazyText -> Int64+length = T.length . getNonEmpty+{-# INLINE length #-}++-- length needs to be phased after the compareN/length rules otherwise+-- it may inline before the rules have an opportunity to fire.++-- | /O(min(n,c))/ Compare the count of characters in a 'NonEmptyLazyText' to a number.+--+-- @+-- 'compareLength' t c = 'P.compare' ('length' t) c+-- @+--+-- This function gives the same answer as comparing against the result+-- of 'length', but can short circuit if the count of characters is+-- greater than the number, and hence be more efficient.+compareLength :: NonEmptyLazyText -> Int64 -> Ordering+compareLength x = T.compareLength (getNonEmpty x)+{-# INLINE compareLength #-}++-- -----------------------------------------------------------------------------++-- * Transformations++-- | /O(n)/ 'map' @f@ @t@ is the 'NonEmptyLazyText' obtained by applying @f@ to+-- each element of @t@.+--+-- Example:+--+-- >>> let message = pack "I am not angry. Not at all."+-- >>> T.map (\c -> if c == '.' then '!' else c) message+-- "I am not angry! Not at all!"+--+-- Performs replacement on invalid scalar values.+map :: (Char -> Char) -> NonEmptyLazyText -> NonEmptyLazyText+map f = overNonEmpty $ T.map f+{-# INLINE map #-}++-- | /O(n)/ The 'intercalate' function takes a 'NonEmptyLazyText' and a list of+-- 'NonEmptyLazyText's and concatenates the list after interspersing the first+-- argument between each element of the list.+--+-- Example:+--+-- >>> T.intercalate "NI!" ["We", "seek", "the", "Holy", "Grail"]+-- "WeNI!seekNI!theNI!HolyNI!Grail"+intercalate :: T.Text -> NonEmpty [NonEmptyLazyText] -> NonEmptyLazyText+intercalate e = trustedNonEmpty . T.intercalate e . fmap getNonEmpty . getNonEmpty+{-# INLINE intercalate #-}++-- | /O(n)/ The 'intersperse' function takes a character and places it+-- between the characters of a 'NonEmptyLazyText'.+--+-- Example:+--+-- >>> T.intersperse '.' "SHIELD"+-- "S.H.I.E.L.D"+--+-- Performs replacement on invalid scalar values.+intersperse :: Char -> NonEmptyLazyText -> NonEmptyLazyText+intersperse c = overNonEmpty $ T.intersperse c+{-# INLINE intersperse #-}++-- | /O(n)/ Reverse the characters of a string.+--+-- Example:+--+-- >>> T.reverse "desrever"+-- "reversed"+reverse :: HasCallStack => NonEmptyLazyText -> NonEmptyLazyText+reverse = overNonEmpty T.reverse+{-# INLINE reverse #-}++-- | /O(m+n)/ Replace every non-overlapping occurrence of @needle@ in+-- @haystack@ with @replacement@.+--+-- This function behaves as though it was defined as follows:+--+-- @+-- replace needle replacement haystack =+--   'intercalate' replacement ('splitOn' needle haystack)+-- @+--+-- As this suggests, each occurrence is replaced exactly once.  So if+-- @needle@ occurs in @replacement@, that occurrence will /not/ itself+-- be replaced recursively:+--+-- >>> replace "oo" "foo" "oo"+-- "foo"+--+-- In cases where several instances of @needle@ overlap, only the+-- first one will be replaced:+--+-- >>> replace "ofo" "bar" "ofofo"+-- "barfo"+--+-- In (unlikely) bad cases, this function's time complexity degrades+-- towards /O(n*m)/.+replace ::+  -- | @needle@ to search for.  If this string is empty, an+  -- error will occur.+  NonEmptyLazyText ->+  -- | @replacement@ to replace @needle@ with.+  NonEmptyLazyText ->+  -- | @haystack@ in which to search.+  NonEmptyLazyText ->+  NonEmptyLazyText+replace = overNonEmpty3 T.replace++-- ----------------------------------------------------------------------------++-- ** Case conversions (folds)++-- $case+--+-- When case converting 'NonEmptyLazyText' values, do not use combinators like+-- @map toUpper@ to case convert each character of a string+-- individually, as this gives incorrect results according to the+-- rules of some writing systems.  The whole-string case conversion+-- functions from this module, such as @toUpper@, obey the correct+-- case conversion rules.  As a result, these functions may map one+-- input character to two or three output characters. For examples,+-- see the documentation of each function.+--+-- /Note/: In some languages, case conversion is a locale- and+-- context-dependent operation. The case conversion functions in this+-- module are /not/ locale sensitive. Programs that require locale+-- sensitivity should use appropriate versions of the+-- <http://hackage.haskell.org/package/text-icu-0.6.3.7/docs/Data-Text-ICU.html#g:4 case mapping functions from the text-icu package >.++-- | /O(n)/ Convert a string to folded case.+--+-- This function is mainly useful for performing caseless (also known+-- as case insensitive) string comparisons.+--+-- A string @x@ is a caseless match for a string @y@ if and only if:+--+-- @toCaseFold x == toCaseFold y@+--+-- The result string may be longer than the input string, and may+-- differ from applying 'toLower' to the input string.  For instance,+-- the Armenian small ligature \"&#xfb13;\" (men now, U+FB13) is case+-- folded to the sequence \"&#x574;\" (men, U+0574) followed by+-- \"&#x576;\" (now, U+0576), while the Greek \"&#xb5;\" (micro sign,+-- U+00B5) is case folded to \"&#x3bc;\" (small letter mu, U+03BC)+-- instead of itself.+toCaseFold :: NonEmptyLazyText -> NonEmptyLazyText+toCaseFold = overNonEmpty T.toCaseFold+{-# INLINE toCaseFold #-}++-- | /O(n)/ Convert a string to lower case, using simple case+-- conversion.+--+-- The result string may be longer than the input string.  For+-- instance, \"&#x130;\" (Latin capital letter I with dot above,+-- U+0130) maps to the sequence \"i\" (Latin small letter i, U+0069)+-- followed by \" &#x307;\" (combining dot above, U+0307).+toLower :: NonEmptyLazyText -> NonEmptyLazyText+toLower = overNonEmpty T.toLower+{-# INLINE toLower #-}++-- | /O(n)/ Convert a string to upper case, using simple case+-- conversion.+--+-- The result string may be longer than the input string.  For+-- instance, the German \"&#xdf;\" (eszett, U+00DF) maps to the+-- two-letter sequence \"SS\".+toUpper :: NonEmptyLazyText -> NonEmptyLazyText+toUpper = overNonEmpty T.toUpper+{-# INLINE toUpper #-}++-- | /O(n)/ Convert a string to title case, using simple case+-- conversion.+--+-- The first letter of the input is converted to title case, as is+-- every subsequent letter that immediately follows a non-letter.+-- Every letter that immediately follows another letter is converted+-- to lower case.+--+-- The result string may be longer than the input string. For example,+-- the Latin small ligature &#xfb02; (U+FB02) is converted to the+-- sequence Latin capital letter F (U+0046) followed by Latin small+-- letter l (U+006C).+--+-- /Note/: this function does not take language or culture specific+-- rules into account. For instance, in English, different style+-- guides disagree on whether the book name \"The Hill of the Red+-- Fox\" is correctly title cased&#x2014;but this function will+-- capitalize /every/ word.+toTitle :: NonEmptyLazyText -> NonEmptyLazyText+toTitle = overNonEmpty T.toTitle+{-# INLINE toTitle #-}++-- | /O(n)/ Left-justify a string to the given length, using the+-- specified fill character on the right.+-- Performs replacement on invalid scalar values.+--+-- Examples:+--+-- >>> justifyLeft 7 'x' "foo"+-- "fooxxxx"+--+-- >>> justifyLeft 3 'x' "foobar"+-- "foobar"+justifyLeft :: Int64 -> Char -> NonEmptyLazyText -> NonEmptyLazyText+justifyLeft p c = overNonEmpty $ T.justifyLeft p c+{-# INLINE justifyLeft #-}++-- | /O(n)/ Right-justify a string to the given length, using the+-- specified fill character on the left.  Performs replacement on+-- invalid scalar values.+--+-- Examples:+--+-- >>> justifyRight 7 'x' "bar"+-- "xxxxbar"+--+-- >>> justifyRight 3 'x' "foobar"+-- "foobar"+justifyRight :: Int64 -> Char -> NonEmptyLazyText -> NonEmptyLazyText+justifyRight p c = overNonEmpty $ T.justifyRight p c+{-# INLINE justifyRight #-}++-- | /O(n)/ Center a string to the given length, using the specified+-- fill character on either side.  Performs replacement on invalid+-- scalar values.+--+-- Examples:+--+-- >>> center 8 'x' "HS"+-- "xxxHSxxx"+center :: Int64 -> Char -> NonEmptyLazyText -> NonEmptyLazyText+center p c = overNonEmpty $ T.center p c+{-# INLINE center #-}++-- | /O(n)/ The 'transpose' function transposes the rows and columns+-- of its 'NonEmptyLazyText' argument.  Note that this function uses 'pack',+-- 'unpack', and the list version of transpose, and is thus not very+-- efficient.+--+-- Examples:+--+-- >>> transpose ["green","orange"]+-- ["go","rr","ea","en","ng","e"]+--+-- >>> transpose ["blue","red"]+-- ["br","le","ud","e"]+transpose :: NonEmpty [NonEmptyLazyText] -> NonEmpty [NonEmptyLazyText]+transpose = overNonEmpty $ fmap trustedNonEmpty . T.transpose . fmap getNonEmpty++-- -----------------------------------------------------------------------------++-- * Reducing 'NonEmptyLazyText's (folds)++-- | /O(n)/ 'foldl', applied to a binary operator, a starting value+-- (typically the left-identity of the operator), and a 'NonEmptyLazyText',+-- reduces the 'NonEmptyLazyText' using the binary operator, from left to right.+foldl :: (a -> Char -> a) -> a -> NonEmptyLazyText -> a+foldl f a = T.foldl f a . getNonEmpty+{-# INLINE foldl #-}++-- | /O(n)/ A strict version of 'foldl'.+foldl' :: (a -> Char -> a) -> a -> NonEmptyLazyText -> a+foldl' f a = T.foldl' f a . getNonEmpty+{-# INLINE foldl' #-}++-- | /O(n)/ A variant of 'foldl' that has no starting value argument.+foldl1 :: (Char -> Char -> Char) -> NonEmptyLazyText -> Char+foldl1 f = uncurry (T.foldl f) . uncons+{-# INLINE foldl1 #-}++-- | /O(n)/ A strict version of 'foldl1'.+foldl1' :: (Char -> Char -> Char) -> NonEmptyLazyText -> Char+foldl1' f = uncurry (T.foldl' f) . uncons+{-# INLINE foldl1' #-}++-- | /O(n)/ 'foldr', applied to a binary operator, a starting value+-- (typically the right-identity of the operator), and a 'NonEmptyLazyText',+-- reduces the 'NonEmptyLazyText' using the binary operator, from right to left.+--+-- If the binary operator is strict in its second argument, use 'foldr''+-- instead.+--+-- 'foldr' is lazy like 'Data.List.foldr' for lists: evaluation actually+-- traverses the 'NonEmptyLazyText' from left to right, only as far as it needs to.+-- @+--+-- Searches from left to right with short-circuiting behavior can+-- also be defined using 'foldr' (/e.g./, 'any', 'all', 'find', 'elem').+foldr :: (Char -> a -> a) -> a -> NonEmptyLazyText -> a+foldr f a = T.foldr f a . getNonEmpty+{-# INLINE foldr #-}++-- | /O(n)/ A variant of 'foldr' that has no starting value argument.+foldr1 :: (Char -> Char -> Char) -> NonEmptyLazyText -> Char+foldr1 f = uncurry (T.foldr f) . uncons+{-# INLINE foldr1 #-}++-- -----------------------------------------------------------------------------++-- ** Special folds++-- | /O(n)/ Concatenate a list of 'NonEmptyLazyText's.+concat :: NonEmpty [NonEmptyLazyText] -> NonEmptyLazyText+concat = overNonEmpty $ T.concat . fmap getNonEmpty++-- | /O(n)/ Map a function over a 'NonEmptyLazyText' that results in a 'NonEmptyLazyText', and+-- concatenate the results.+concatMap :: (Char -> NonEmptyLazyText) -> NonEmptyLazyText -> NonEmptyLazyText+concatMap f = overNonEmpty $ T.concatMap $ getNonEmpty . f+{-# INLINE concatMap #-}++-- | /O(n)/ 'any' @p@ @t@ determines whether any character in the+-- 'NonEmptyLazyText' @t@ satisfies the predicate @p@.+any :: (Char -> Bool) -> NonEmptyLazyText -> Bool+any p = T.any p . getNonEmpty+{-# INLINE any #-}++-- | /O(n)/ 'all' @p@ @t@ determines whether all characters in the+-- 'NonEmptyLazyText' @t@ satisfy the predicate @p@.+all :: (Char -> Bool) -> NonEmptyLazyText -> Bool+all p = T.all p . getNonEmpty+{-# INLINE all #-}++-- | /O(n)/ 'maximum' returns the maximum value from a 'NonEmptyLazyText'.+maximum :: NonEmptyLazyText -> Char+maximum = T.maximum . getNonEmpty+{-# INLINE maximum #-}++-- | /O(n)/ 'minimum' returns the minimum value from a 'NonEmptyLazyText'.+minimum :: NonEmptyLazyText -> Char+minimum = T.minimum . getNonEmpty+{-# INLINE minimum #-}++-- -----------------------------------------------------------------------------++-- * Building 'NonEmptyLazyText's++-- | /O(n)/ 'scanl' is similar to 'foldl', but returns a list of+-- successive reduced values from the left.+-- Performs replacement on invalid scalar values.+--+-- > scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]+--+-- __Properties__+--+-- @'head' ('scanl' f z xs) = z@+--+-- @'last' ('scanl' f z xs) = 'foldl' f z xs@+scanl :: (Char -> Char -> Char) -> Char -> NonEmptyLazyText -> NonEmptyLazyText+scanl f s = overNonEmpty $ T.scanl f s+{-# INLINE scanl #-}++-- | /O(n)/ 'scanl1' is a variant of 'scanl' that has no starting+-- value argument. Performs replacement on invalid scalar values.+--+-- > scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]+scanl1 :: (Char -> Char -> Char) -> NonEmptyLazyText -> NonEmptyLazyText+scanl1 f = overNonEmpty $ T.scanl1 f+{-# INLINE scanl1 #-}++-- | /O(n)/ 'scanr' is the right-to-left dual of 'scanl'.  Performs+-- replacement on invalid scalar values.+--+-- > scanr f v == reverse . scanl (flip f) v . reverse+scanr :: (Char -> Char -> Char) -> Char -> NonEmptyLazyText -> NonEmptyLazyText+scanr f s = overNonEmpty $ T.scanr f s+{-# INLINE scanr #-}++-- | /O(n)/ 'scanr1' is a variant of 'scanr' that has no starting+-- value argument. Performs replacement on invalid scalar values.+scanr1 :: (Char -> Char -> Char) -> NonEmptyLazyText -> NonEmptyLazyText+scanr1 f = overNonEmpty $ T.scanr1 f+{-# INLINE scanr1 #-}++-- | /O(n)/ Like a combination of 'map' and 'foldl''. Applies a+-- function to each element of a 'NonEmptyLazyText', passing an accumulating+-- parameter from left to right, and returns a final 'NonEmptyLazyText'.  Performs+-- replacement on invalid scalar values.+mapAccumL :: forall a. (a -> Char -> (a, Char)) -> a -> NonEmptyLazyText -> (a, NonEmptyLazyText)+mapAccumL f s = fmap trustedNonEmpty . T.mapAccumL f s . getNonEmpty+{-# INLINE mapAccumL #-}++-- | The 'mapAccumR' function behaves like a combination of 'map' and+-- a strict 'foldr'; it applies a function to each element of a+-- 'NonEmptyLazyText', passing an accumulating parameter from right to left, and+-- returning a final value of this accumulator together with the new+-- 'NonEmptyLazyText'.+-- Performs replacement on invalid scalar values.+mapAccumR :: forall a. (a -> Char -> (a, Char)) -> a -> NonEmptyLazyText -> (a, NonEmptyLazyText)+mapAccumR f s = fmap trustedNonEmpty . T.mapAccumR f s . getNonEmpty+{-# INLINE mapAccumR #-}++-- -----------------------------------------------------------------------------++-- ** Generating and unfolding 'NonEmptyLazyText's++-- | /O(n*m)/ 'replicate' @n@ @t@ is a 'NonEmptyLazyText' consisting of the input+-- @t@ repeated @n@ times, @n@ should be strictly positive.+replicate :: Int64 -> NonEmptyLazyText -> NonEmptyLazyText+replicate n x =+  if n > 0+    then overNonEmpty (T.replicate n) x+    else error "replicate.n should be strictly positive"+{-# INLINE replicate #-}++-- | 'cycle' ties a finite, 'NonEmptyLazyText' into a circular one, or+-- equivalently, the infinite repetition of the original 'NonEmptyLazyText'.+cycle :: NonEmptyLazyText -> NonEmptyLazyText+cycle = overNonEmpty T.cycle+{-# INLINE cycle #-}++-- | @'iterate' f x@ returns an infinite 'NonEmptyLazyText' of repeated applications+-- of @f@ to @x@:+--+-- > iterate f x == [x, f x, f (f x), ...]+iterate :: (Char -> Char) -> Char -> NonEmptyLazyText+iterate f = trustedNonEmpty . T.iterate f+{-# INLINE iterate #-}++-- -----------------------------------------------------------------------------++-- * Substrings++-- | /O(n)/ 'take' @n@, applied to a 'NonEmptyLazyText', returns the prefix of the+-- 'Text' of length @n@, or the 'Text' itself if @n@ is greater than+-- the length of the NonEmptyLazyText.+take :: Int64 -> NonEmptyLazyText -> T.Text+take n = T.take n . getNonEmpty+{-# INLINE take #-}++-- | /O(n)/ 'takeEnd' @n@ @t@ returns the suffix remaining after+-- taking @n@ characters from the end of @t@.+--+-- Examples:+--+-- >>> takeEnd 3 "foobar"+-- "bar"+takeEnd :: Int64 -> NonEmptyLazyText -> T.Text+takeEnd n = T.takeEnd n . getNonEmpty+{-# INLINE takeEnd #-}++-- | /O(n)/ 'drop' @n@, applied to a 'NonEmptyLazyText', returns the suffix of the+-- 'Text' after the first @n@ characters, or the empty 'Text' if @n@+-- is greater than the length of the 'NonEmptyLazyText'.+drop :: Int64 -> NonEmptyLazyText -> T.Text+drop n = T.drop n . getNonEmpty+{-# INLINE drop #-}++-- | /O(n)/ 'dropEnd' @n@ @t@ returns the prefix remaining after+-- dropping @n@ characters from the end of @t@.+--+-- Examples:+--+-- >>> dropEnd 3 "foobar"+-- "foo"+dropEnd :: Int64 -> NonEmptyLazyText -> T.Text+dropEnd n = T.dropEnd n . getNonEmpty+{-# INLINE dropEnd #-}++-- | /O(n)/ 'takeWhile', applied to a predicate @p@ and a 'NonEmptyLazyText',+-- returns the longest prefix (possibly empty) of elements that+-- satisfy @p@.+takeWhile :: (Char -> Bool) -> NonEmptyLazyText -> T.Text+takeWhile p = T.takeWhile p . getNonEmpty+{-# INLINE takeWhile #-}++-- | /O(n)/ 'takeWhileEnd', applied to a predicate @p@ and a 'NonEmptyLazyText',+-- returns the longest suffix (possibly empty) of elements that+-- satisfy @p@.+-- Examples:+--+-- >>> takeWhileEnd (=='o') "foo"+-- "oo"+takeWhileEnd :: (Char -> Bool) -> NonEmptyLazyText -> T.Text+takeWhileEnd p = T.takeWhileEnd p . getNonEmpty+{-# INLINE takeWhileEnd #-}++-- | /O(n)/ 'dropWhile' @p@ @t@ returns the suffix remaining after+-- 'takeWhile' @p@ @t@.+dropWhile :: (Char -> Bool) -> NonEmptyLazyText -> T.Text+dropWhile p = T.dropWhile p . getNonEmpty+{-# INLINE dropWhile #-}++-- | /O(n)/ 'dropWhileEnd' @p@ @t@ returns the prefix remaining after+-- dropping characters that satisfy the predicate @p@ from the end of+-- @t@.+--+-- Examples:+--+-- >>> dropWhileEnd (=='.') "foo..."+-- "foo"+dropWhileEnd :: (Char -> Bool) -> NonEmptyLazyText -> T.Text+dropWhileEnd p = T.dropWhileEnd p . getNonEmpty+{-# INLINE dropWhileEnd #-}++-- | /O(n)/ 'dropAround' @p@ @t@ returns the substring remaining after+-- dropping characters that satisfy the predicate @p@ from both the+-- beginning and end of @t@.+dropAround :: (Char -> Bool) -> NonEmptyLazyText -> T.Text+dropAround p = T.dropAround p . getNonEmpty+{-# INLINE dropAround #-}++-- | /O(n)/ Remove leading white space from a string.  Equivalent to:+--+-- > dropWhile isSpace+stripStart :: NonEmptyLazyText -> T.Text+stripStart = T.stripStart . getNonEmpty+{-# INLINE stripStart #-}++-- | /O(n)/ Remove trailing white space from a string.  Equivalent to:+--+-- > dropWhileEnd isSpace+stripEnd :: NonEmptyLazyText -> T.Text+stripEnd = T.stripEnd . getNonEmpty+{-# INLINE stripEnd #-}++-- | /O(n)/ Remove leading and trailing white space from a string.+-- Equivalent to:+--+-- > dropAround isSpace+strip :: NonEmptyLazyText -> T.Text+strip = T.strip . getNonEmpty+{-# INLINE strip #-}++-- | /O(n)/ 'splitAt' @n t@ returns a pair whose first element is a+-- prefix of @t@ of length @n@, and whose second is the remainder of+-- the string. It is equivalent to @('take' n t, 'drop' n t)@.+splitAt :: Int64 -> NonEmptyLazyText -> (T.Text, T.Text)+splitAt n = T.splitAt n . getNonEmpty+{-# INLINE splitAt #-}++-- | /O(n)/ 'span', applied to a predicate @p@ and text @t@, returns+-- a pair whose first element is the longest prefix (possibly empty)+-- of @t@ of elements that satisfy @p@, and whose second is the+-- remainder of the text.+--+-- >>> T.span (=='0') "000AB"+-- ("000","AB")+span :: (Char -> Bool) -> NonEmptyLazyText -> (T.Text, T.Text)+span p = T.span p . getNonEmpty+{-# INLINE span #-}++-- | /O(n)/ 'break' is like 'span', but the prefix returned is+-- over elements that fail the predicate @p@.+--+-- >>> T.break (=='c') "180cm"+-- ("180","cm")+break :: (Char -> Bool) -> NonEmptyLazyText -> (T.Text, T.Text)+break p = T.break p . getNonEmpty+{-# INLINE break #-}++-- | /O(n)/ Group characters in a string according to a predicate.+groupBy :: (Char -> Char -> Bool) -> NonEmptyLazyText -> NonEmpty [T.Text]+groupBy p = overNonEmpty $ T.groupBy p+{-# INLINE groupBy #-}++-- | /O(n)/ Group characters in a string by equality.+group :: NonEmptyLazyText -> NonEmpty [NonEmptyLazyText]+group = overNonEmpty $ fmap trustedNonEmpty . T.group+{-# INLINE group #-}++-- | /O(n)/ Return all initial segments of the given 'NonEmptyLazyText', shortest+-- first.+inits :: NonEmptyLazyText -> NonEmpty [T.Text]+inits = overNonEmpty T.inits+{-# INLINE inits #-}++-- | /O(n)/ Return all final segments of the given 'NonEmptyLazyText', longest+-- first.+tails :: NonEmptyLazyText -> NonEmpty [T.Text]+tails = overNonEmpty T.tails+{-# INLINE tails #-}++-- $split+--+-- Splitting functions in this library do not perform character-wise+-- copies to create substrings; they just construct new 'Text's that+-- are slices of the original.++-- | /O(m+n)/ Break a 'NonEmptyLazyText' into pieces separated by the first 'Text'+-- argument (which cannot be empty), consuming the delimiter. An empty+-- delimiter is invalid, and will cause an error to be raised.+--+-- Examples:+--+-- >>> splitOn "\r\n" "a\r\nb\r\nd\r\ne"+-- ["a","b","d","e"]+--+-- >>> splitOn "aaa"  "aaaXaaaXaaaXaaa"+-- ["","X","X","X",""]+--+-- >>> splitOn "x"    "x"+-- ["",""]+--+-- and+--+-- > intercalate s . splitOn s         == id+-- > splitOn (singleton c)             == split (==c)+--+-- (Note: the string @s@ to split on above cannot be empty.)+--+-- In (unlikely) bad cases, this function's time complexity degrades+-- towards /O(n*m)/.+splitOn ::+  -- | String to split on. If this string is empty, an error+  -- will occur.+  NonEmptyLazyText ->+  -- | Input text.+  NonEmptyLazyText ->+  NonEmpty [T.Text]+splitOn = overNonEmpty2 T.splitOn+{-# INLINE splitOn #-}++-- | /O(n)/ Splits a 'NonEmptyLazyText' into components delimited by separators,+-- where the predicate returns True for a separator element.  The+-- resulting components do not contain the separators.  Two adjacent+-- separators result in an empty component in the output.  eg.+--+-- >>> split (=='a') "aabbaca"+-- ["","","bb","c",""]+--+-- >>> split (=='a') ""+-- [""]+split :: (Char -> Bool) -> NonEmptyLazyText -> NonEmpty [T.Text]+split p = overNonEmpty $ T.split p+{-# INLINE split #-}++-- | /O(n)/ Splits a 'NonEmptyLazyText' into components of length @k@.  The last+-- element may be shorter than the other chunks, depending on the+-- length of the input. Examples:+--+-- >>> chunksOf 3 "foobarbaz"+-- ["foo","bar","baz"]+--+-- >>> chunksOf 4 "haskell.org"+-- ["hask","ell.","org"]+chunksOf :: Int64 -> NonEmptyLazyText -> [T.Text]+chunksOf p = T.chunksOf p . getNonEmpty+{-# INLINE chunksOf #-}++-- ----------------------------------------------------------------------------++-- * Searching++-------------------------------------------------------------------------------++-- ** Searching with a predicate++-- | /O(n)/ The 'elem' function takes a character and a 'NonEmptyLazyText', and+-- returns 'True' if the element is found in the given 'NonEmptyLazyText', or+-- 'False' otherwise.+#if MIN_VERSION_text(1,2,5)+elem :: Char -> NonEmptyLazyText -> Bool+elem p = T.elem p . getNonEmpty+{-# INLINE elem #-}+#endif++-- | /O(n)/ The 'find' function takes a predicate and a 'NonEmptyLazyText', and+-- returns the first element matching the predicate, or 'Nothing' if+-- there is no such element.+find :: (Char -> Bool) -> NonEmptyLazyText -> Maybe Char+find p = T.find p . getNonEmpty+{-# INLINE find #-}++-- | /O(n)/ The 'partition' function takes a predicate and a 'NonEmptyLazyText',+-- and returns the pair of 'Text's with elements which do and do not+-- satisfy the predicate, respectively; i.e.+--+-- > partition p t == (filter p t, filter (not . p) t)+partition :: (Char -> Bool) -> NonEmptyLazyText -> (T.Text, T.Text)+partition p = T.partition p . getNonEmpty+{-# INLINE partition #-}++-- | /O(n)/ 'filter', applied to a predicate and a 'NonEmptyLazyText',+-- returns a 'Text' containing those characters that satisfy the+-- predicate.+filter :: (Char -> Bool) -> NonEmptyLazyText -> T.Text+filter p = T.filter p . getNonEmpty+{-# INLINE filter #-}++-- | /O(n+m)/ Find the first instance of @needle@ (which must be+-- non-'null') in @haystack@.  The first element of the returned tuple+-- is the prefix of @haystack@ before @needle@ is matched.  The second+-- is the remainder of @haystack@, starting with the match.+--+-- Examples:+--+-- >>> breakOn "::" "a::b::c"+-- ("a","::b::c")+--+-- >>> breakOn "/" "foobar"+-- ("foobar","")+--+-- Laws:+--+-- > append prefix match == haystack+-- >   where (prefix, match) = breakOn needle haystack+--+-- If you need to break a string by a substring repeatedly (e.g. you+-- want to break on every instance of a substring), use 'breakOnAll'+-- instead, as it has lower startup overhead.+--+-- In (unlikely) bad cases, this function's time complexity degrades+-- towards /O(n*m)/.+breakOn :: NonEmptyLazyText -> NonEmptyLazyText -> (T.Text, T.Text)+breakOn t = T.breakOn (getNonEmpty t) . getNonEmpty+{-# INLINE breakOn #-}++-- | /O(n+m)/ Similar to 'breakOn', but searches from the end of the+-- string.+--+-- The first element of the returned tuple is the prefix of @haystack@+-- up to and including the last match of @needle@.  The second is the+-- remainder of @haystack@, following the match.+--+-- >>> breakOnEnd "::" "a::b::c"+-- ("a::b::","c")+breakOnEnd :: NonEmptyLazyText -> NonEmptyLazyText -> (T.Text, T.Text)+breakOnEnd t = T.breakOnEnd (getNonEmpty t) . getNonEmpty+{-# INLINE breakOnEnd #-}++-- | /O(n+m)/ Find all non-overlapping instances of @needle@ in+-- @haystack@.  Each element of the returned list consists of a pair:+--+-- * The entire string prior to the /k/th match (i.e. the prefix)+--+-- * The /k/th match, followed by the remainder of the string+--+-- Examples:+--+-- >>> breakOnAll "::" ""+-- []+--+-- >>> breakOnAll "/" "a/b/c/"+-- [("a","/b/c/"),("a/b","/c/"),("a/b/c","/")]+--+-- In (unlikely) bad cases, this function's time complexity degrades+-- towards /O(n*m)/.+--+-- The @needle@ parameter may not be empty.+breakOnAll ::+  -- | @needle@ to search for+  NonEmptyLazyText ->+  -- | @haystack@ in which to search+  NonEmptyLazyText ->+  [(T.Text, T.Text)]+breakOnAll = T.breakOnAll `on` getNonEmpty+{-# INLINE breakOnAll #-}++-------------------------------------------------------------------------------++-- ** Indexing 'NonEmptyLazyText's++-- $index+--+-- If you think of a 'NonEmptyLazyText' value as an array of 'Char' values (which+-- it is not), you run the risk of writing inefficient code.+--+-- An idiom that is common in some languages is to find the numeric+-- offset of a character or substring, then use that number to split+-- or trim the searched string.  With a 'NonEmptyLazyText' value, this approach+-- would require two /O(n)/ operations: one to perform the search, and+-- one to operate from wherever the search ended.+--+-- For example, suppose you have a string that you want to split on+-- the substring @\"::\"@, such as @\"foo::bar::quux\"@. Instead of+-- searching for the index of @\"::\"@ and taking the substrings+-- before and after that index, you would instead use @breakOnAll \"::\"@.++-- | /O(n)/ 'NonEmptyLazyText' index (subscript) operator, starting from 0.+index :: HasCallStack => NonEmptyLazyText -> Int64 -> Char+index x = T.index (getNonEmpty x)+{-# INLINE index #-}++-- | /O(n+m)/ The 'count' function returns the number of times the+-- query string appears in the given 'NonEmptyLazyText'. An empty query string is+-- invalid, and will cause an error to be raised.+--+-- In (unlikely) bad cases, this function's time complexity degrades+-- towards /O(n*m)/.+count :: NonEmptyLazyText -> NonEmptyLazyText -> Int64+count = T.count `on` getNonEmpty+{-# INLINE count #-}++-------------------------------------------------------------------------------++-- * Zipping++-- | /O(n)/ 'zip' takes two 'NonEmptyLazyText's and returns a list of+-- corresponding pairs of bytes. If one input 'NonEmptyLazyText' is short,+-- excess elements of the longer 'NonEmptyLazyText' are discarded. This is+-- equivalent to a pair of 'unpack' operations.+zip :: NonEmptyLazyText -> NonEmptyLazyText -> NonEmpty [(Char, Char)]+zip = overNonEmpty2 T.zip+{-# INLINE zip #-}++-- | /O(n)/ 'zipWith' generalises 'zip' by zipping with the function+-- given as the first argument, instead of a tupling function.+-- Performs replacement on invalid scalar values.+zipWith :: (Char -> Char -> Char) -> NonEmptyLazyText -> NonEmptyLazyText -> NonEmptyLazyText+zipWith p = overNonEmpty2 $ T.zipWith p+{-# INLINE zipWith #-}++-- | /O(n)/ Breaks a 'NonEmptyLazyText' up into a list of words, delimited by 'Char's+-- representing white space.+words :: NonEmptyLazyText -> NonEmpty [NonEmptyLazyText]+words = overNonEmpty $ fmap trustedNonEmpty . T.words+{-# INLINE words #-}++-- | /O(n)/ Breaks a 'NonEmptyLazyText' up into a list of 'NonEmptyLazyText's at newline characters+-- @'\\n'@ (LF, line feed). The resulting strings do not contain newlines.+--+-- 'lines' __does not__ treat @'\\r'@ (CR, carriage return) as a newline character.+lines :: NonEmptyLazyText -> NonEmpty [NonEmptyLazyText]+lines = overNonEmpty $ fmap trustedNonEmpty . T.lines+{-# INLINE lines #-}++-- | /O(n)/ Joins lines, after appending a terminating newline to+-- each.+unlines :: NonEmpty [NonEmptyLazyText] -> NonEmptyLazyText+unlines = overNonEmpty $ T.unlines . fmap getNonEmpty+{-# INLINE unlines #-}++-- | /O(n)/ Joins words using single space characters.+unwords :: NonEmpty [NonEmptyLazyText] -> NonEmptyLazyText+unwords = overNonEmpty $ T.unwords . fmap getNonEmpty+{-# INLINE unwords #-}++-- | /O(n)/ The 'isPrefixOf' function takes two 'NonEmptyLazyText's and returns+-- 'True' if and only if the first is a prefix of the second.+isPrefixOf :: NonEmptyLazyText -> NonEmptyLazyText -> Bool+isPrefixOf = T.isPrefixOf `on` getNonEmpty+{-# INLINE isPrefixOf #-}++-- | /O(n)/ The 'isSuffixOf' function takes two 'NonEmptyLazyText's and returns+-- 'True' if and only if the first is a suffix of the second.+isSuffixOf :: NonEmptyLazyText -> NonEmptyLazyText -> Bool+isSuffixOf = T.isSuffixOf `on` getNonEmpty+{-# INLINE isSuffixOf #-}++-- | /O(n+m)/ The 'isInfixOf' function takes two 'NonEmptyLazyText's and returns+-- 'True' if and only if the first is contained, wholly and intact, anywhere+-- within the second.+--+-- In (unlikely) bad cases, this function's time complexity degrades+-- towards /O(n*m)/.+isInfixOf :: HasCallStack => NonEmptyLazyText -> NonEmptyLazyText -> Bool+isInfixOf = T.isInfixOf `on` getNonEmpty+{-# INLINE isInfixOf #-}++-------------------------------------------------------------------------------++-- * View patterns++-- | /O(n)/ Return the suffix of the second string if its prefix+-- matches the entire first string.+--+-- Examples:+--+-- >>> stripPrefix "foo" "foobar"+-- Just "bar"+--+-- >>> stripPrefix ""    "baz"+-- Just "baz"+--+-- >>> stripPrefix "foo" "quux"+-- Nothing+--+-- This is particularly useful with the @ViewPatterns@ extension to+-- GHC, as follows:+--+-- > {-# LANGUAGE ViewPatterns #-}+-- > import Data.Text.NonEmpty as T+-- >+-- > fnordLength :: NonEmptyLazyText -> Int+-- > fnordLength (stripPrefix "fnord" -> Just suf) = T.length suf+-- > fnordLength _                                 = -1+stripPrefix :: NonEmptyLazyText -> NonEmptyLazyText -> Maybe T.Text+stripPrefix = T.stripPrefix `on` getNonEmpty+{-# INLINE stripPrefix #-}++-- | /O(n)/ Find the longest non-empty common prefix of two strings+-- and return it, along with the suffixes of each string at which they+-- no longer match.+--+-- If the strings do not have a common prefix or either one is empty,+-- this function returns 'Nothing'.+--+-- Examples:+--+-- >>> commonPrefixes "foobar" "fooquux"+-- Just ("foo","bar","quux")+--+-- >>> commonPrefixes "veeble" "fetzer"+-- Nothing+--+-- >>> commonPrefixes "" "baz"+-- Nothing+commonPrefixes :: NonEmptyLazyText -> NonEmptyLazyText -> Maybe (T.Text, T.Text, T.Text)+commonPrefixes = T.commonPrefixes `on` getNonEmpty+{-# INLINE commonPrefixes #-}++-- | /O(n)/ Return the prefix of the second string if its suffix+-- matches the entire first string.+--+-- Examples:+--+-- >>> stripSuffix "bar" "foobar"+-- Just "foo"+--+-- >>> stripSuffix ""    "baz"+-- Just "baz"+--+-- >>> stripSuffix "foo" "quux"+-- Nothing+--+-- This is particularly useful with the @ViewPatterns@ extension to+-- GHC, as follows:+--+-- > {-# LANGUAGE ViewPatterns #-}+-- > import Data.Text.NonEmpty as T+-- >+-- > quuxLength :: NonEmptyLazyText -> Int+-- > quuxLength (stripSuffix "quux" -> Just pre) = T.length pre+-- > quuxLength _                                = -1+stripSuffix :: NonEmptyLazyText -> NonEmptyLazyText -> Maybe T.Text+stripSuffix = T.stripSuffix `on` getNonEmpty+{-# INLINE stripSuffix #-}

@@ -0,0 +1,1166 @@+{-# LANGUAGE CPP #-}+{-# OPTIONS_GHC -Wno-redundant-constraints #-}+{-# OPTIONS_GHC -fno-warn-orphans #-}++-- |+-- Module        : Data.Text.NonEmpty+-- Copyright     : Gautier DI FOLCO+-- License       : BSD2+--+-- Maintainer    : Gautier DI FOLCO <gautier.difolco@gmail.com>+-- Stability     : Unstable+-- Portability   : GHC+--+-- 'NonEmpty' wrappers around `Data.Text`+--+-- This module is intended to be imported @qualified@, to avoid name+-- clashes with "Prelude" functions.  eg.+--+-- > import qualified Data.Text.NonEmpty as NET+module Data.Text.NonEmpty+  ( -- * Types+    NonEmptyText,+    NonEmptyStrictText,++    -- * Creation and elimination+    pack,+    unpack,+    singleton,++    -- * Basic interface+    cons,+    snoc,+    uncons,+    unsnoc,+    head,+    last,+    tail,+    init,+    length,+    compareLength,++    -- * Transformations+    map,+    intercalate,+    intersperse,+    transpose,+    reverse,+    replace,++    -- ** Case conversion+    -- $case+    toCaseFold,+    toLower,+    toUpper,+    toTitle,++    -- ** Justification+    justifyLeft,+    justifyRight,+    center,++    -- * Folds+    foldl,+    foldl',+    foldl1,+    foldl1',+    foldr,+    foldr1,++    -- ** Special folds+    concat,+    concatMap,+    any,+    all,+    maximum,+    minimum,++    -- * Construction++    -- ** Scans+    scanl,+    scanl1,+    scanr,+    scanr1,++    -- ** Accumulating maps+    mapAccumL,+    mapAccumR,++    -- ** Generation and unfolding+    replicate,++    -- * Substrings++    -- ** Breaking strings+    take,+    takeEnd,+    drop,+    dropEnd,+    takeWhile,+    takeWhileEnd,+    dropWhile,+    dropWhileEnd,+    dropAround,+    strip,+    stripStart,+    stripEnd,+    splitAt,+    breakOn,+    breakOnEnd,+    break,+    span,+    group,+    groupBy,+    inits,+    tails,++    -- ** Breaking into many substrings+    -- $split+    splitOn,+    split,+    chunksOf,++    -- ** Breaking into lines and words+    lines,+    words,+    unlines,+    unwords,++    -- * Predicates+    isPrefixOf,+    isSuffixOf,+    isInfixOf,++    -- ** View patterns+    stripPrefix,+    stripSuffix,+    commonPrefixes,++    -- * Searching+    filter,+    breakOnAll,+    find,+#if MIN_VERSION_text(1,2,5)+    elem,+#endif+    partition,++    -- * Indexing+    index,+    findIndex,+    count,++    -- * Zipping+    zip,+    zipWith,+  )+where++import Data.Function (on)+import Data.NonEmpty+import qualified Data.Text as T+import GHC.Stack+import Prelude (Bool (..), Char, Int, Maybe (..), Ord (..), Ordering, String, error, fmap, fst, not, snd, uncurry, ($), (.))++type NonEmptyStrictText = NonEmpty T.Text++type NonEmptyText = NonEmptyStrictText++instance NonEmptySingleton T.Text where+  type NonEmptySingletonElement T.Text = Char+  nonEmptySingleton _ = T.singleton++instance NonEmptyFromContainer T.Text where+  isNonEmpty = not . T.null++-- -----------------------------------------------------------------------------++-- * Conversion to/from 'NonEmptyStrictText'++-- | /O(n)/ Convert a 'NonEmpty String' into a 'NonEmptyStrictText'.+-- Performs replacement on invalid scalar values.+pack :: NonEmpty String -> NonEmptyStrictText+pack = overNonEmpty T.pack+{-# INLINE pack #-}++-- | /O(n)/ Convert a 'NonEmptyStrictText' into a 'NonEmpty String'.+unpack :: HasCallStack => NonEmptyStrictText -> NonEmpty String+unpack = overNonEmpty T.unpack+{-# INLINE unpack #-}++-- -----------------------------------------------------------------------------++-- * Basic functions++-- | /O(n)/ Adds a character to the front of a 'NonEmptyStrictText'.  This function+-- is more costly than its 'List' counterpart because it requires+-- copying a new array.  Performs replacement on+-- invalid scalar values.+cons :: Char -> NonEmptyStrictText -> NonEmptyStrictText+cons c = overNonEmpty $ T.cons c+{-# INLINE cons #-}++infixr 5 `cons`++-- | /O(n)/ Adds a character to the end of a 'NonEmptyStrictText'.  This copies the+-- entire array in the process.+-- Performs replacement on invalid scalar values.+snoc :: NonEmptyStrictText -> Char -> NonEmptyStrictText+snoc t c = overNonEmpty (`T.snoc` c) t+{-# INLINE snoc #-}++-- | /O(1)/ Returns the first character of a 'NonEmptyStrictText'.+head :: NonEmptyStrictText -> Char+head = fst . uncons+{-# INLINE head #-}++-- | /O(1)/ Returns the first character and rest of a 'NonEmptyStrictText'.+uncons :: NonEmptyStrictText -> (Char, T.Text)+uncons = withNonEmpty T.uncons+{-# INLINE uncons #-}++-- | /O(1)/ Returns the last character of a 'NonEmptyStrictText'.+last :: NonEmptyStrictText -> Char+last = snd . unsnoc+{-# INLINE last #-}++-- | /O(1)/ Returns all characters after the head of a 'NonEmptyStrictText'.+tail :: NonEmptyStrictText -> T.Text+tail = snd . uncons+{-# INLINE tail #-}++-- | /O(1)/ Returns all but the last character of a 'NonEmptyStrictText'.+init :: NonEmptyStrictText -> T.Text+init = fst . unsnoc+{-# INLINE init #-}++-- | /O(1)/ Returns all but the last character and the last character of a+-- 'NonEmptyStrictText'.+unsnoc :: NonEmptyStrictText -> (T.Text, Char)+unsnoc = withNonEmpty T.unsnoc+{-# INLINE unsnoc #-}++-- | /O(n)/ Returns the number of characters in a 'NonEmptyStrictText'.+length :: NonEmptyStrictText -> Int+length = T.length . getNonEmpty+{-# INLINE length #-}++-- length needs to be phased after the compareN/length rules otherwise+-- it may inline before the rules have an opportunity to fire.++-- | /O(min(n,c))/ Compare the count of characters in a 'NonEmptyStrictText' to a number.+--+-- @+-- 'compareLength' t c = 'P.compare' ('length' t) c+-- @+--+-- This function gives the same answer as comparing against the result+-- of 'length', but can short circuit if the count of characters is+-- greater than the number, and hence be more efficient.+compareLength :: NonEmptyStrictText -> Int -> Ordering+compareLength x = T.compareLength (getNonEmpty x)+{-# INLINE compareLength #-}++-- -----------------------------------------------------------------------------++-- * Transformations++-- | /O(n)/ 'map' @f@ @t@ is the 'NonEmptyStrictText' obtained by applying @f@ to+-- each element of @t@.+--+-- Example:+--+-- >>> let message = pack "I am not angry. Not at all."+-- >>> T.map (\c -> if c == '.' then '!' else c) message+-- "I am not angry! Not at all!"+--+-- Performs replacement on invalid scalar values.+map :: (Char -> Char) -> NonEmptyStrictText -> NonEmptyStrictText+map f = overNonEmpty $ T.map f+{-# INLINE map #-}++-- | /O(n)/ The 'intercalate' function takes a 'NonEmptyStrictText' and a list of+-- 'NonEmptyStrictText's and concatenates the list after interspersing the first+-- argument between each element of the list.+--+-- Example:+--+-- >>> T.intercalate "NI!" ["We", "seek", "the", "Holy", "Grail"]+-- "WeNI!seekNI!theNI!HolyNI!Grail"+intercalate :: T.Text -> NonEmpty [NonEmptyStrictText] -> NonEmptyStrictText+intercalate e = trustedNonEmpty . T.intercalate e . fmap getNonEmpty . getNonEmpty+{-# INLINE intercalate #-}++-- | /O(n)/ The 'intersperse' function takes a character and places it+-- between the characters of a 'NonEmptyStrictText'.+--+-- Example:+--+-- >>> T.intersperse '.' "SHIELD"+-- "S.H.I.E.L.D"+--+-- Performs replacement on invalid scalar values.+intersperse :: Char -> NonEmptyStrictText -> NonEmptyStrictText+intersperse c = overNonEmpty $ T.intersperse c+{-# INLINE intersperse #-}++-- | /O(n)/ Reverse the characters of a string.+--+-- Example:+--+-- >>> T.reverse "desrever"+-- "reversed"+reverse :: HasCallStack => NonEmptyStrictText -> NonEmptyStrictText+reverse = overNonEmpty T.reverse+{-# INLINE reverse #-}++-- | /O(m+n)/ Replace every non-overlapping occurrence of @needle@ in+-- @haystack@ with @replacement@.+--+-- This function behaves as though it was defined as follows:+--+-- @+-- replace needle replacement haystack =+--   'intercalate' replacement ('splitOn' needle haystack)+-- @+--+-- As this suggests, each occurrence is replaced exactly once.  So if+-- @needle@ occurs in @replacement@, that occurrence will /not/ itself+-- be replaced recursively:+--+-- >>> replace "oo" "foo" "oo"+-- "foo"+--+-- In cases where several instances of @needle@ overlap, only the+-- first one will be replaced:+--+-- >>> replace "ofo" "bar" "ofofo"+-- "barfo"+--+-- In (unlikely) bad cases, this function's time complexity degrades+-- towards /O(n*m)/.+replace ::+  -- | @needle@ to search for.  If this string is empty, an+  -- error will occur.+  NonEmptyStrictText ->+  -- | @replacement@ to replace @needle@ with.+  NonEmptyStrictText ->+  -- | @haystack@ in which to search.+  NonEmptyStrictText ->+  NonEmptyStrictText+replace = overNonEmpty3 T.replace++-- ----------------------------------------------------------------------------++-- ** Case conversions (folds)++-- $case+--+-- When case converting 'NonEmptyStrictText' values, do not use combinators like+-- @map toUpper@ to case convert each character of a string+-- individually, as this gives incorrect results according to the+-- rules of some writing systems.  The whole-string case conversion+-- functions from this module, such as @toUpper@, obey the correct+-- case conversion rules.  As a result, these functions may map one+-- input character to two or three output characters. For examples,+-- see the documentation of each function.+--+-- /Note/: In some languages, case conversion is a locale- and+-- context-dependent operation. The case conversion functions in this+-- module are /not/ locale sensitive. Programs that require locale+-- sensitivity should use appropriate versions of the+-- <http://hackage.haskell.org/package/text-icu-0.6.3.7/docs/Data-Text-ICU.html#g:4 case mapping functions from the text-icu package >.++-- | /O(n)/ Convert a string to folded case.+--+-- This function is mainly useful for performing caseless (also known+-- as case insensitive) string comparisons.+--+-- A string @x@ is a caseless match for a string @y@ if and only if:+--+-- @toCaseFold x == toCaseFold y@+--+-- The result string may be longer than the input string, and may+-- differ from applying 'toLower' to the input string.  For instance,+-- the Armenian small ligature \"&#xfb13;\" (men now, U+FB13) is case+-- folded to the sequence \"&#x574;\" (men, U+0574) followed by+-- \"&#x576;\" (now, U+0576), while the Greek \"&#xb5;\" (micro sign,+-- U+00B5) is case folded to \"&#x3bc;\" (small letter mu, U+03BC)+-- instead of itself.+toCaseFold :: NonEmptyStrictText -> NonEmptyStrictText+toCaseFold = overNonEmpty T.toCaseFold+{-# INLINE toCaseFold #-}++-- | /O(n)/ Convert a string to lower case, using simple case+-- conversion.+--+-- The result string may be longer than the input string.  For+-- instance, \"&#x130;\" (Latin capital letter I with dot above,+-- U+0130) maps to the sequence \"i\" (Latin small letter i, U+0069)+-- followed by \" &#x307;\" (combining dot above, U+0307).+toLower :: NonEmptyStrictText -> NonEmptyStrictText+toLower = overNonEmpty T.toLower+{-# INLINE toLower #-}++-- | /O(n)/ Convert a string to upper case, using simple case+-- conversion.+--+-- The result string may be longer than the input string.  For+-- instance, the German \"&#xdf;\" (eszett, U+00DF) maps to the+-- two-letter sequence \"SS\".+toUpper :: NonEmptyStrictText -> NonEmptyStrictText+toUpper = overNonEmpty T.toUpper+{-# INLINE toUpper #-}++-- | /O(n)/ Convert a string to title case, using simple case+-- conversion.+--+-- The first letter of the input is converted to title case, as is+-- every subsequent letter that immediately follows a non-letter.+-- Every letter that immediately follows another letter is converted+-- to lower case.+--+-- The result string may be longer than the input string. For example,+-- the Latin small ligature &#xfb02; (U+FB02) is converted to the+-- sequence Latin capital letter F (U+0046) followed by Latin small+-- letter l (U+006C).+--+-- /Note/: this function does not take language or culture specific+-- rules into account. For instance, in English, different style+-- guides disagree on whether the book name \"The Hill of the Red+-- Fox\" is correctly title cased&#x2014;but this function will+-- capitalize /every/ word.+toTitle :: NonEmptyStrictText -> NonEmptyStrictText+toTitle = overNonEmpty T.toTitle+{-# INLINE toTitle #-}++-- | /O(n)/ Left-justify a string to the given length, using the+-- specified fill character on the right.+-- Performs replacement on invalid scalar values.+--+-- Examples:+--+-- >>> justifyLeft 7 'x' "foo"+-- "fooxxxx"+--+-- >>> justifyLeft 3 'x' "foobar"+-- "foobar"+justifyLeft :: Int -> Char -> NonEmptyStrictText -> NonEmptyStrictText+justifyLeft p c = overNonEmpty $ T.justifyLeft p c+{-# INLINE justifyLeft #-}++-- | /O(n)/ Right-justify a string to the given length, using the+-- specified fill character on the left.  Performs replacement on+-- invalid scalar values.+--+-- Examples:+--+-- >>> justifyRight 7 'x' "bar"+-- "xxxxbar"+--+-- >>> justifyRight 3 'x' "foobar"+-- "foobar"+justifyRight :: Int -> Char -> NonEmptyStrictText -> NonEmptyStrictText+justifyRight p c = overNonEmpty $ T.justifyRight p c+{-# INLINE justifyRight #-}++-- | /O(n)/ Center a string to the given length, using the specified+-- fill character on either side.  Performs replacement on invalid+-- scalar values.+--+-- Examples:+--+-- >>> center 8 'x' "HS"+-- "xxxHSxxx"+center :: Int -> Char -> NonEmptyStrictText -> NonEmptyStrictText+center p c = overNonEmpty $ T.center p c+{-# INLINE center #-}++-- | /O(n)/ The 'transpose' function transposes the rows and columns+-- of its 'NonEmptyStrictText' argument.  Note that this function uses 'pack',+-- 'unpack', and the list version of transpose, and is thus not very+-- efficient.+--+-- Examples:+--+-- >>> transpose ["green","orange"]+-- ["go","rr","ea","en","ng","e"]+--+-- >>> transpose ["blue","red"]+-- ["br","le","ud","e"]+transpose :: NonEmpty [NonEmptyStrictText] -> NonEmpty [NonEmptyStrictText]+transpose = overNonEmpty $ fmap trustedNonEmpty . T.transpose . fmap getNonEmpty++-- -----------------------------------------------------------------------------++-- * Reducing 'NonEmptyStrictText's (folds)++-- | /O(n)/ 'foldl', applied to a binary operator, a starting value+-- (typically the left-identity of the operator), and a 'NonEmptyStrictText',+-- reduces the 'NonEmptyStrictText' using the binary operator, from left to right.+foldl :: (a -> Char -> a) -> a -> NonEmptyStrictText -> a+foldl f a = T.foldl f a . getNonEmpty+{-# INLINE foldl #-}++-- | /O(n)/ A strict version of 'foldl'.+foldl' :: (a -> Char -> a) -> a -> NonEmptyStrictText -> a+foldl' f a = T.foldl' f a . getNonEmpty+{-# INLINE foldl' #-}++-- | /O(n)/ A variant of 'foldl' that has no starting value argument.+foldl1 :: (Char -> Char -> Char) -> NonEmptyStrictText -> Char+foldl1 f = uncurry (T.foldl f) . uncons+{-# INLINE foldl1 #-}++-- | /O(n)/ A strict version of 'foldl1'.+foldl1' :: (Char -> Char -> Char) -> NonEmptyStrictText -> Char+foldl1' f = uncurry (T.foldl' f) . uncons+{-# INLINE foldl1' #-}++-- | /O(n)/ 'foldr', applied to a binary operator, a starting value+-- (typically the right-identity of the operator), and a 'NonEmptyStrictText',+-- reduces the 'NonEmptyStrictText' using the binary operator, from right to left.+--+-- If the binary operator is strict in its second argument, use 'foldr''+-- instead.+--+-- 'foldr' is lazy like 'Data.List.foldr' for lists: evaluation actually+-- traverses the 'NonEmptyStrictText' from left to right, only as far as it needs to.+-- @+--+-- Searches from left to right with short-circuiting behavior can+-- also be defined using 'foldr' (/e.g./, 'any', 'all', 'find', 'elem').+foldr :: (Char -> a -> a) -> a -> NonEmptyStrictText -> a+foldr f a = T.foldr f a . getNonEmpty+{-# INLINE foldr #-}++-- | /O(n)/ A variant of 'foldr' that has no starting value argument.+foldr1 :: (Char -> Char -> Char) -> NonEmptyStrictText -> Char+foldr1 f = uncurry (T.foldr f) . uncons+{-# INLINE foldr1 #-}++-- -----------------------------------------------------------------------------++-- ** Special folds++-- | /O(n)/ Concatenate a list of 'NonEmptyStrictText's.+concat :: NonEmpty [NonEmptyStrictText] -> NonEmptyStrictText+concat = overNonEmpty $ T.concat . fmap getNonEmpty++-- | /O(n)/ Map a function over a 'NonEmptyStrictText' that results in a 'NonEmptyStrictText', and+-- concatenate the results.+concatMap :: (Char -> NonEmptyStrictText) -> NonEmptyStrictText -> NonEmptyStrictText+concatMap f = overNonEmpty $ T.concatMap $ getNonEmpty . f+{-# INLINE concatMap #-}++-- | /O(n)/ 'any' @p@ @t@ determines whether any character in the+-- 'NonEmptyStrictText' @t@ satisfies the predicate @p@.+any :: (Char -> Bool) -> NonEmptyStrictText -> Bool+any p = T.any p . getNonEmpty+{-# INLINE any #-}++-- | /O(n)/ 'all' @p@ @t@ determines whether all characters in the+-- 'NonEmptyStrictText' @t@ satisfy the predicate @p@.+all :: (Char -> Bool) -> NonEmptyStrictText -> Bool+all p = T.all p . getNonEmpty+{-# INLINE all #-}++-- | /O(n)/ 'maximum' returns the maximum value from a 'NonEmptyStrictText'.+maximum :: NonEmptyStrictText -> Char+maximum = T.maximum . getNonEmpty+{-# INLINE maximum #-}++-- | /O(n)/ 'minimum' returns the minimum value from a 'NonEmptyStrictText'.+minimum :: NonEmptyStrictText -> Char+minimum = T.minimum . getNonEmpty+{-# INLINE minimum #-}++-- -----------------------------------------------------------------------------++-- * Building 'NonEmptyStrictText's++-- | /O(n)/ 'scanl' is similar to 'foldl', but returns a list of+-- successive reduced values from the left.+-- Performs replacement on invalid scalar values.+--+-- > scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]+--+-- __Properties__+--+-- @'head' ('scanl' f z xs) = z@+--+-- @'last' ('scanl' f z xs) = 'foldl' f z xs@+scanl :: (Char -> Char -> Char) -> Char -> NonEmptyStrictText -> NonEmptyStrictText+scanl f s = overNonEmpty $ T.scanl f s+{-# INLINE scanl #-}++-- | /O(n)/ 'scanl1' is a variant of 'scanl' that has no starting+-- value argument. Performs replacement on invalid scalar values.+--+-- > scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]+scanl1 :: (Char -> Char -> Char) -> NonEmptyStrictText -> NonEmptyStrictText+scanl1 f = overNonEmpty $ T.scanl1 f+{-# INLINE scanl1 #-}++-- | /O(n)/ 'scanr' is the right-to-left dual of 'scanl'.  Performs+-- replacement on invalid scalar values.+--+-- > scanr f v == reverse . scanl (flip f) v . reverse+scanr :: (Char -> Char -> Char) -> Char -> NonEmptyStrictText -> NonEmptyStrictText+scanr f s = overNonEmpty $ T.scanr f s+{-# INLINE scanr #-}++-- | /O(n)/ 'scanr1' is a variant of 'scanr' that has no starting+-- value argument. Performs replacement on invalid scalar values.+scanr1 :: (Char -> Char -> Char) -> NonEmptyStrictText -> NonEmptyStrictText+scanr1 f = overNonEmpty $ T.scanr1 f+{-# INLINE scanr1 #-}++-- | /O(n)/ Like a combination of 'map' and 'foldl''. Applies a+-- function to each element of a 'NonEmptyStrictText', passing an accumulating+-- parameter from left to right, and returns a final 'NonEmptyStrictText'.  Performs+-- replacement on invalid scalar values.+mapAccumL :: forall a. (a -> Char -> (a, Char)) -> a -> NonEmptyStrictText -> (a, NonEmptyStrictText)+mapAccumL f s = fmap trustedNonEmpty . T.mapAccumL f s . getNonEmpty+{-# INLINE mapAccumL #-}++-- | The 'mapAccumR' function behaves like a combination of 'map' and+-- a strict 'foldr'; it applies a function to each element of a+-- 'NonEmptyStrictText', passing an accumulating parameter from right to left, and+-- returning a final value of this accumulator together with the new+-- 'NonEmptyStrictText'.+-- Performs replacement on invalid scalar values.+mapAccumR :: forall a. (a -> Char -> (a, Char)) -> a -> NonEmptyStrictText -> (a, NonEmptyStrictText)+mapAccumR f s = fmap trustedNonEmpty . T.mapAccumR f s . getNonEmpty+{-# INLINE mapAccumR #-}++-- -----------------------------------------------------------------------------++-- ** Generating and unfolding 'NonEmptyStrictText's++-- | /O(n*m)/ 'replicate' @n@ @t@ is a 'NonEmptyStrictText' consisting of the input+-- @t@ repeated @n@ times, @n@ should be strictly positive.+replicate :: Int -> NonEmptyStrictText -> NonEmptyStrictText+replicate n x =+  if n > 0+    then overNonEmpty (T.replicate n) x+    else error "replicate.n should be strictly positive"+{-# INLINE replicate #-}++-- -----------------------------------------------------------------------------++-- * Substrings++-- | /O(n)/ 'take' @n@, applied to a 'NonEmptyStrictText', returns the prefix of the+-- 'Text' of length @n@, or the 'Text' itself if @n@ is greater than+-- the length of the NonEmptyStrictText.+take :: Int -> NonEmptyStrictText -> T.Text+take n = T.take n . getNonEmpty+{-# INLINE take #-}++-- | /O(n)/ 'takeEnd' @n@ @t@ returns the suffix remaining after+-- taking @n@ characters from the end of @t@.+--+-- Examples:+--+-- >>> takeEnd 3 "foobar"+-- "bar"+takeEnd :: Int -> NonEmptyStrictText -> T.Text+takeEnd n = T.takeEnd n . getNonEmpty+{-# INLINE takeEnd #-}++-- | /O(n)/ 'drop' @n@, applied to a 'NonEmptyStrictText', returns the suffix of the+-- 'Text' after the first @n@ characters, or the empty 'Text' if @n@+-- is greater than the length of the 'NonEmptyStrictText'.+drop :: Int -> NonEmptyStrictText -> T.Text+drop n = T.drop n . getNonEmpty+{-# INLINE drop #-}++-- | /O(n)/ 'dropEnd' @n@ @t@ returns the prefix remaining after+-- dropping @n@ characters from the end of @t@.+--+-- Examples:+--+-- >>> dropEnd 3 "foobar"+-- "foo"+dropEnd :: Int -> NonEmptyStrictText -> T.Text+dropEnd n = T.dropEnd n . getNonEmpty+{-# INLINE dropEnd #-}++-- | /O(n)/ 'takeWhile', applied to a predicate @p@ and a 'NonEmptyStrictText',+-- returns the longest prefix (possibly empty) of elements that+-- satisfy @p@.+takeWhile :: (Char -> Bool) -> NonEmptyStrictText -> T.Text+takeWhile p = T.takeWhile p . getNonEmpty+{-# INLINE takeWhile #-}++-- | /O(n)/ 'takeWhileEnd', applied to a predicate @p@ and a 'NonEmptyStrictText',+-- returns the longest suffix (possibly empty) of elements that+-- satisfy @p@.+-- Examples:+--+-- >>> takeWhileEnd (=='o') "foo"+-- "oo"+takeWhileEnd :: (Char -> Bool) -> NonEmptyStrictText -> T.Text+takeWhileEnd p = T.takeWhileEnd p . getNonEmpty+{-# INLINE takeWhileEnd #-}++-- | /O(n)/ 'dropWhile' @p@ @t@ returns the suffix remaining after+-- 'takeWhile' @p@ @t@.+dropWhile :: (Char -> Bool) -> NonEmptyStrictText -> T.Text+dropWhile p = T.dropWhile p . getNonEmpty+{-# INLINE dropWhile #-}++-- | /O(n)/ 'dropWhileEnd' @p@ @t@ returns the prefix remaining after+-- dropping characters that satisfy the predicate @p@ from the end of+-- @t@.+--+-- Examples:+--+-- >>> dropWhileEnd (=='.') "foo..."+-- "foo"+dropWhileEnd :: (Char -> Bool) -> NonEmptyStrictText -> T.Text+dropWhileEnd p = T.dropWhileEnd p . getNonEmpty+{-# INLINE dropWhileEnd #-}++-- | /O(n)/ 'dropAround' @p@ @t@ returns the substring remaining after+-- dropping characters that satisfy the predicate @p@ from both the+-- beginning and end of @t@.+dropAround :: (Char -> Bool) -> NonEmptyStrictText -> T.Text+dropAround p = T.dropAround p . getNonEmpty+{-# INLINE dropAround #-}++-- | /O(n)/ Remove leading white space from a string.  Equivalent to:+--+-- > dropWhile isSpace+stripStart :: NonEmptyStrictText -> T.Text+stripStart = T.stripStart . getNonEmpty+{-# INLINE stripStart #-}++-- | /O(n)/ Remove trailing white space from a string.  Equivalent to:+--+-- > dropWhileEnd isSpace+stripEnd :: NonEmptyStrictText -> T.Text+stripEnd = T.stripEnd . getNonEmpty+{-# INLINE stripEnd #-}++-- | /O(n)/ Remove leading and trailing white space from a string.+-- Equivalent to:+--+-- > dropAround isSpace+strip :: NonEmptyStrictText -> T.Text+strip = T.strip . getNonEmpty+{-# INLINE strip #-}++-- | /O(n)/ 'splitAt' @n t@ returns a pair whose first element is a+-- prefix of @t@ of length @n@, and whose second is the remainder of+-- the string. It is equivalent to @('take' n t, 'drop' n t)@.+splitAt :: Int -> NonEmptyStrictText -> (T.Text, T.Text)+splitAt n = T.splitAt n . getNonEmpty+{-# INLINE splitAt #-}++-- | /O(n)/ 'span', applied to a predicate @p@ and text @t@, returns+-- a pair whose first element is the longest prefix (possibly empty)+-- of @t@ of elements that satisfy @p@, and whose second is the+-- remainder of the text.+--+-- >>> T.span (=='0') "000AB"+-- ("000","AB")+span :: (Char -> Bool) -> NonEmptyStrictText -> (T.Text, T.Text)+span p = T.span p . getNonEmpty+{-# INLINE span #-}++-- | /O(n)/ 'break' is like 'span', but the prefix returned is+-- over elements that fail the predicate @p@.+--+-- >>> T.break (=='c') "180cm"+-- ("180","cm")+break :: (Char -> Bool) -> NonEmptyStrictText -> (T.Text, T.Text)+break p = T.break p . getNonEmpty+{-# INLINE break #-}++-- | /O(n)/ Group characters in a string according to a predicate.+groupBy :: (Char -> Char -> Bool) -> NonEmptyStrictText -> NonEmpty [T.Text]+groupBy p = overNonEmpty $ T.groupBy p+{-# INLINE groupBy #-}++-- | /O(n)/ Group characters in a string by equality.+group :: NonEmptyStrictText -> NonEmpty [NonEmptyStrictText]+group = overNonEmpty $ fmap trustedNonEmpty . T.group+{-# INLINE group #-}++-- | /O(n)/ Return all initial segments of the given 'NonEmptyStrictText', shortest+-- first.+inits :: NonEmptyStrictText -> NonEmpty [T.Text]+inits = overNonEmpty T.inits+{-# INLINE inits #-}++-- | /O(n)/ Return all final segments of the given 'NonEmptyStrictText', longest+-- first.+tails :: NonEmptyStrictText -> NonEmpty [T.Text]+tails = overNonEmpty T.tails+{-# INLINE tails #-}++-- $split+--+-- Splitting functions in this library do not perform character-wise+-- copies to create substrings; they just construct new 'Text's that+-- are slices of the original.++-- | /O(m+n)/ Break a 'NonEmptyStrictText' into pieces separated by the first 'Text'+-- argument (which cannot be empty), consuming the delimiter. An empty+-- delimiter is invalid, and will cause an error to be raised.+--+-- Examples:+--+-- >>> splitOn "\r\n" "a\r\nb\r\nd\r\ne"+-- ["a","b","d","e"]+--+-- >>> splitOn "aaa"  "aaaXaaaXaaaXaaa"+-- ["","X","X","X",""]+--+-- >>> splitOn "x"    "x"+-- ["",""]+--+-- and+--+-- > intercalate s . splitOn s         == id+-- > splitOn (singleton c)             == split (==c)+--+-- (Note: the string @s@ to split on above cannot be empty.)+--+-- In (unlikely) bad cases, this function's time complexity degrades+-- towards /O(n*m)/.+splitOn ::+  -- | String to split on. If this string is empty, an error+  -- will occur.+  NonEmptyStrictText ->+  -- | Input text.+  NonEmptyStrictText ->+  NonEmpty [T.Text]+splitOn = overNonEmpty2 T.splitOn+{-# INLINE splitOn #-}++-- | /O(n)/ Splits a 'NonEmptyStrictText' into components delimited by separators,+-- where the predicate returns True for a separator element.  The+-- resulting components do not contain the separators.  Two adjacent+-- separators result in an empty component in the output.  eg.+--+-- >>> split (=='a') "aabbaca"+-- ["","","bb","c",""]+--+-- >>> split (=='a') ""+-- [""]+split :: (Char -> Bool) -> NonEmptyStrictText -> NonEmpty [T.Text]+split p = overNonEmpty $ T.split p+{-# INLINE split #-}++-- | /O(n)/ Splits a 'NonEmptyStrictText' into components of length @k@.  The last+-- element may be shorter than the other chunks, depending on the+-- length of the input. Examples:+--+-- >>> chunksOf 3 "foobarbaz"+-- ["foo","bar","baz"]+--+-- >>> chunksOf 4 "haskell.org"+-- ["hask","ell.","org"]+chunksOf :: Int -> NonEmptyStrictText -> [T.Text]+chunksOf p = T.chunksOf p . getNonEmpty+{-# INLINE chunksOf #-}++-- ----------------------------------------------------------------------------++-- * Searching++-------------------------------------------------------------------------------++-- ** Searching with a predicate++-- | /O(n)/ The 'elem' function takes a character and a 'NonEmptyStrictText', and+-- returns 'True' if the element is found in the given 'NonEmptyStrictText', or+-- 'False' otherwise.+#if MIN_VERSION_text(1,2,5)+elem :: Char -> NonEmptyStrictText -> Bool+elem p = T.elem p . getNonEmpty+{-# INLINE elem #-}+#endif++-- | /O(n)/ The 'find' function takes a predicate and a 'NonEmptyStrictText', and+-- returns the first element matching the predicate, or 'Nothing' if+-- there is no such element.+find :: (Char -> Bool) -> NonEmptyStrictText -> Maybe Char+find p = T.find p . getNonEmpty+{-# INLINE find #-}++-- | /O(n)/ The 'partition' function takes a predicate and a 'NonEmptyStrictText',+-- and returns the pair of 'Text's with elements which do and do not+-- satisfy the predicate, respectively; i.e.+--+-- > partition p t == (filter p t, filter (not . p) t)+partition :: (Char -> Bool) -> NonEmptyStrictText -> (T.Text, T.Text)+partition p = T.partition p . getNonEmpty+{-# INLINE partition #-}++-- | /O(n)/ 'filter', applied to a predicate and a 'NonEmptyStrictText',+-- returns a 'Text' containing those characters that satisfy the+-- predicate.+filter :: (Char -> Bool) -> NonEmptyStrictText -> T.Text+filter p = T.filter p . getNonEmpty+{-# INLINE filter #-}++-- | /O(n+m)/ Find the first instance of @needle@ (which must be+-- non-'null') in @haystack@.  The first element of the returned tuple+-- is the prefix of @haystack@ before @needle@ is matched.  The second+-- is the remainder of @haystack@, starting with the match.+--+-- Examples:+--+-- >>> breakOn "::" "a::b::c"+-- ("a","::b::c")+--+-- >>> breakOn "/" "foobar"+-- ("foobar","")+--+-- Laws:+--+-- > append prefix match == haystack+-- >   where (prefix, match) = breakOn needle haystack+--+-- If you need to break a string by a substring repeatedly (e.g. you+-- want to break on every instance of a substring), use 'breakOnAll'+-- instead, as it has lower startup overhead.+--+-- In (unlikely) bad cases, this function's time complexity degrades+-- towards /O(n*m)/.+breakOn :: NonEmptyStrictText -> NonEmptyStrictText -> (T.Text, T.Text)+breakOn t = T.breakOn (getNonEmpty t) . getNonEmpty+{-# INLINE breakOn #-}++-- | /O(n+m)/ Similar to 'breakOn', but searches from the end of the+-- string.+--+-- The first element of the returned tuple is the prefix of @haystack@+-- up to and including the last match of @needle@.  The second is the+-- remainder of @haystack@, following the match.+--+-- >>> breakOnEnd "::" "a::b::c"+-- ("a::b::","c")+breakOnEnd :: NonEmptyStrictText -> NonEmptyStrictText -> (T.Text, T.Text)+breakOnEnd t = T.breakOnEnd (getNonEmpty t) . getNonEmpty+{-# INLINE breakOnEnd #-}++-- | /O(n+m)/ Find all non-overlapping instances of @needle@ in+-- @haystack@.  Each element of the returned list consists of a pair:+--+-- * The entire string prior to the /k/th match (i.e. the prefix)+--+-- * The /k/th match, followed by the remainder of the string+--+-- Examples:+--+-- >>> breakOnAll "::" ""+-- []+--+-- >>> breakOnAll "/" "a/b/c/"+-- [("a","/b/c/"),("a/b","/c/"),("a/b/c","/")]+--+-- In (unlikely) bad cases, this function's time complexity degrades+-- towards /O(n*m)/.+--+-- The @needle@ parameter may not be empty.+breakOnAll ::+  -- | @needle@ to search for+  NonEmptyStrictText ->+  -- | @haystack@ in which to search+  NonEmptyStrictText ->+  [(T.Text, T.Text)]+breakOnAll = T.breakOnAll `on` getNonEmpty+{-# INLINE breakOnAll #-}++-------------------------------------------------------------------------------++-- ** Indexing 'NonEmptyStrictText's++-- $index+--+-- If you think of a 'NonEmptyStrictText' value as an array of 'Char' values (which+-- it is not), you run the risk of writing inefficient code.+--+-- An idiom that is common in some languages is to find the numeric+-- offset of a character or substring, then use that number to split+-- or trim the searched string.  With a 'NonEmptyStrictText' value, this approach+-- would require two /O(n)/ operations: one to perform the search, and+-- one to operate from wherever the search ended.+--+-- For example, suppose you have a string that you want to split on+-- the substring @\"::\"@, such as @\"foo::bar::quux\"@. Instead of+-- searching for the index of @\"::\"@ and taking the substrings+-- before and after that index, you would instead use @breakOnAll \"::\"@.++-- | /O(n)/ 'NonEmptyStrictText' index (subscript) operator, starting from 0.+index :: HasCallStack => NonEmptyStrictText -> Int -> Char+index x = T.index (getNonEmpty x)+{-# INLINE index #-}++-- | /O(n)/ The 'findIndex' function takes a predicate and a 'NonEmptyStrictText'+-- and returns the index of the first element in the 'NonEmptyStrictText' satisfying+-- the predicate.+findIndex :: (Char -> Bool) -> NonEmptyStrictText -> Maybe Int+findIndex p = T.findIndex p . getNonEmpty+{-# INLINE findIndex #-}++-- | /O(n+m)/ The 'count' function returns the number of times the+-- query string appears in the given 'NonEmptyStrictText'. An empty query string is+-- invalid, and will cause an error to be raised.+--+-- In (unlikely) bad cases, this function's time complexity degrades+-- towards /O(n*m)/.+count :: NonEmptyStrictText -> NonEmptyStrictText -> Int+count = T.count `on` getNonEmpty+{-# INLINE count #-}++-------------------------------------------------------------------------------++-- * Zipping++-- | /O(n)/ 'zip' takes two 'NonEmptyStrictText's and returns a list of+-- corresponding pairs of bytes. If one input 'NonEmptyStrictText' is short,+-- excess elements of the longer 'NonEmptyStrictText' are discarded. This is+-- equivalent to a pair of 'unpack' operations.+zip :: NonEmptyStrictText -> NonEmptyStrictText -> NonEmpty [(Char, Char)]+zip = overNonEmpty2 T.zip+{-# INLINE zip #-}++-- | /O(n)/ 'zipWith' generalises 'zip' by zipping with the function+-- given as the first argument, instead of a tupling function.+-- Performs replacement on invalid scalar values.+zipWith :: (Char -> Char -> Char) -> NonEmptyStrictText -> NonEmptyStrictText -> NonEmptyStrictText+zipWith p = overNonEmpty2 $ T.zipWith p+{-# INLINE zipWith #-}++-- | /O(n)/ Breaks a 'NonEmptyStrictText' up into a list of words, delimited by 'Char's+-- representing white space.+words :: NonEmptyStrictText -> NonEmpty [NonEmptyStrictText]+words = overNonEmpty $ fmap trustedNonEmpty . T.words+{-# INLINE words #-}++-- | /O(n)/ Breaks a 'NonEmptyStrictText' up into a list of 'NonEmptyStrictText's at newline characters+-- @'\\n'@ (LF, line feed). The resulting strings do not contain newlines.+--+-- 'lines' __does not__ treat @'\\r'@ (CR, carriage return) as a newline character.+lines :: NonEmptyStrictText -> NonEmpty [NonEmptyStrictText]+lines = overNonEmpty $ fmap trustedNonEmpty . T.lines+{-# INLINE lines #-}++-- | /O(n)/ Joins lines, after appending a terminating newline to+-- each.+unlines :: NonEmpty [NonEmptyStrictText] -> NonEmptyStrictText+unlines = overNonEmpty $ T.unlines . fmap getNonEmpty+{-# INLINE unlines #-}++-- | /O(n)/ Joins words using single space characters.+unwords :: NonEmpty [NonEmptyStrictText] -> NonEmptyStrictText+unwords = overNonEmpty $ T.unwords . fmap getNonEmpty+{-# INLINE unwords #-}++-- | /O(n)/ The 'isPrefixOf' function takes two 'NonEmptyStrictText's and returns+-- 'True' if and only if the first is a prefix of the second.+isPrefixOf :: NonEmptyStrictText -> NonEmptyStrictText -> Bool+isPrefixOf = T.isPrefixOf `on` getNonEmpty+{-# INLINE isPrefixOf #-}++-- | /O(n)/ The 'isSuffixOf' function takes two 'NonEmptyStrictText's and returns+-- 'True' if and only if the first is a suffix of the second.+isSuffixOf :: NonEmptyStrictText -> NonEmptyStrictText -> Bool+isSuffixOf = T.isSuffixOf `on` getNonEmpty+{-# INLINE isSuffixOf #-}++-- | /O(n+m)/ The 'isInfixOf' function takes two 'NonEmptyStrictText's and returns+-- 'True' if and only if the first is contained, wholly and intact, anywhere+-- within the second.+--+-- In (unlikely) bad cases, this function's time complexity degrades+-- towards /O(n*m)/.+isInfixOf :: HasCallStack => NonEmptyStrictText -> NonEmptyStrictText -> Bool+isInfixOf = T.isInfixOf `on` getNonEmpty+{-# INLINE isInfixOf #-}++-------------------------------------------------------------------------------++-- * View patterns++-- | /O(n)/ Return the suffix of the second string if its prefix+-- matches the entire first string.+--+-- Examples:+--+-- >>> stripPrefix "foo" "foobar"+-- Just "bar"+--+-- >>> stripPrefix ""    "baz"+-- Just "baz"+--+-- >>> stripPrefix "foo" "quux"+-- Nothing+--+-- This is particularly useful with the @ViewPatterns@ extension to+-- GHC, as follows:+--+-- > {-# LANGUAGE ViewPatterns #-}+-- > import Data.Text.NonEmpty as T+-- >+-- > fnordLength :: NonEmptyStrictText -> Int+-- > fnordLength (stripPrefix "fnord" -> Just suf) = T.length suf+-- > fnordLength _                                 = -1+stripPrefix :: NonEmptyStrictText -> NonEmptyStrictText -> Maybe T.Text+stripPrefix = T.stripPrefix `on` getNonEmpty+{-# INLINE stripPrefix #-}++-- | /O(n)/ Find the longest non-empty common prefix of two strings+-- and return it, along with the suffixes of each string at which they+-- no longer match.+--+-- If the strings do not have a common prefix or either one is empty,+-- this function returns 'Nothing'.+--+-- Examples:+--+-- >>> commonPrefixes "foobar" "fooquux"+-- Just ("foo","bar","quux")+--+-- >>> commonPrefixes "veeble" "fetzer"+-- Nothing+--+-- >>> commonPrefixes "" "baz"+-- Nothing+commonPrefixes :: NonEmptyStrictText -> NonEmptyStrictText -> Maybe (T.Text, T.Text, T.Text)+commonPrefixes = T.commonPrefixes `on` getNonEmpty+{-# INLINE commonPrefixes #-}++-- | /O(n)/ Return the prefix of the second string if its suffix+-- matches the entire first string.+--+-- Examples:+--+-- >>> stripSuffix "bar" "foobar"+-- Just "foo"+--+-- >>> stripSuffix ""    "baz"+-- Just "baz"+--+-- >>> stripSuffix "foo" "quux"+-- Nothing+--+-- This is particularly useful with the @ViewPatterns@ extension to+-- GHC, as follows:+--+-- > {-# LANGUAGE ViewPatterns #-}+-- > import Data.Text.NonEmpty as T+-- >+-- > quuxLength :: NonEmptyStrictText -> Int+-- > quuxLength (stripSuffix "quux" -> Just pre) = T.length pre+-- > quuxLength _                                = -1+stripSuffix :: NonEmptyStrictText -> NonEmptyStrictText -> Maybe T.Text+stripSuffix = T.stripSuffix `on` getNonEmpty+{-# INLINE stripSuffix #-}