-8      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ portable experimentalSrtharper@aftereternity.co.uk, bos@serpentine.com, duncan@haskell.org GHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.org=This is a workaround for poor optimisation in GHC 6.8.2. It C fails to notice constant-width shifts, and adds a test and branch < to every shift. This imposes about a 10% performance hit. BThese functions are undefined when the amount being shifted by is / greater than the size in bits of a machine Int#.  GHC experimentalSrtharper@aftereternity.co.uk, bos@serpentine.com, duncan@haskell.org byte to check  lower bound  upper bound  portable experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.orgUnknown size. Upper bound on size.  Exact size. Minimum of two size hints. Maximum of two size hints. 'Convert a size hint to an upper bound. +Compute the minimum size from a size hint. 8Compute the maximum size from a size hint, if possible.    GHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.org  =Allow a function over a stream to switch between two states.    %Specialised, strict Maybe-like type. 'Specialised tuple for case conversion. O(n)& Determines if two streams are equal. The empty stream.              GHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.org <An exception type for representing Unicode encoding errors. :Tried to encode a character that could not be represented > under the given encoding, or ran out of input in mid-encode. >Could not decode a byte sequence because it was invalid under 8 the given encoding, or ran out of input in mid-decode. @Function type for handling a coding error. It is supplied with  two inputs:  A  that describes the error. < The input value that caused the error. If the error arose C because the end of input was reached or could not be identified ! precisely, this value will be . ,If the handler returns a value wrapped with , that value will E be used in the output as the replacement for the invalid input. If  it returns ', no value will be used in the output. ;Should the handler need to abort processing, it should use    or ! an exception (preferably a  ). It may @ use the description provided to construct a more helpful error  report. "Throw a  if decoding fails. ;Replace an invalid input byte with the Unicode replacement  character U+FFFD. Throw a  if encoding fails. =Ignore an invalid input, substituting nothing in the output. .Replace an invalid input with a valid output.    GHC experimentalSrtharper@aftereternity.co.uk, bos@serpentine.com, duncan@haskell.org#$%#$%#$%GHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.orgF&'()*+,-./012345678O(n)1 Adds a character to the front of a Stream Char. 9O(n)* Adds a character to the end of a stream. :O(n)" Appends one Stream to the other. ;O(1)A Returns the first character of a Text, which must be non-empty.  Subject to array fusion. <O(1)0 Returns the first character and remainder of a 'Stream  Char', or % if empty. Subject to array fusion. =O(n)! Returns the last character of a ' Stream Char' , which must  be non-empty. >O(1)D Returns all characters after the head of a Stream Char, which must  be non-empty. ?O(1)< Returns all but the last character of a Stream Char, which  must be non-empty. @O(1). Tests whether a Stream Char is empty or not. AO(n)/ Returns the number of characters in a string. BO(n)9 Indicate whether a string contains exactly one element. CO(n) C f +xs is the Stream Char obtained by applying f  to each element of xs. DO(n)3 Take a character and place it between each of the  characters of a ' Stream Char'. EFO(n); Convert a string to folded case. This function is mainly = useful for performing caseless (or 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 G% to the input string. For instance, D the Armenian small ligature men now (U+FB13) is case folded to the B bigram men now (U+0574 U+0576), while the micro sign (U+00B5) is E case folded to the Greek small letter letter mu (U+03BC) instead of  itself. HO(n)3 Convert a string to upper case, using simple case E conversion. The result string may be longer than the input string. A For instance, the German eszett (U+00DF) maps to the two-letter  sequence SS. GO(n)3 Convert a string to lower case, using simple case E conversion. The result string may be longer than the input string. B For instance, the Latin capital letter I with dot above (U+0130) @ maps to the sequence Latin small letter i (U+0069) followed by  combining dot above (U+0307). IJEfoldl, applied to a binary operator, a starting value (typically the L left-identity of the operator), and a Stream, reduces the Stream using the & binary operator, from left to right. KA strict version of foldl. LBfoldl1 is a variant of foldl that has no starting value argument, 0 and thus must be applied to non-empty Streams. MA strict version of foldl1. NN@, applied to a binary operator, a starting value (typically the M right-identity of the operator), and a stream, reduces the stream using the & binary operator, from right to left. Ofoldr1 is a variant of N& that has no starting value argument, 0 and thus must be applied to non-empty streams.  Subject to array fusion. PQO(n)9 Concatenate a list of streams. Subject to array fusion. RJMap a function over a stream that results in a stream and concatenate the  results. SO(n) any p -xs determines if any character in the stream  xs satisifes the predicate p. TO(n) all p 'xs determines if all characters in the Text  xs satisify the predicate p. UO(n)@ maximum returns the maximum value from a stream, which must be  non-empty. VO(n)* minimum returns the minimum value from a Text, which must be  non-empty. WXYZO(n), where n3 is the length of the result. The unfoldr function  is analogous to the List Z. unfoldr builds a stream ? from a seed value. The function takes the element and returns < Nothing if it is done producing the stream or returns Just B (a,b), in which case, a is the next Char in the string, and b is ( the seed value for further production. [O(n) Like Z, [ builds a stream from a seed < value. However, the length of the result is limited by the  first argument to ['. This function is more efficient than  Z) when the length of the result is known. \O(n)8 take n, applied to a stream, returns the prefix of the  stream of length n, or the stream itself if n is greater than the  length of the stream. ]O(n)8 drop n, applied to a stream, returns the suffix of the  stream of length n, or the empty stream if n is greater than the  length of the stream. ^"takeWhile, applied to a predicate p and a stream, returns the = longest prefix (possibly empty) of elements that satisfy p. _ dropWhile p 0xs returns the suffix remaining after takeWhile p xs. `O(n) The ` function takes two s and returns  a* iff the first is a prefix of the second. bO(n)* elem is the stream membership predicate. cO(n) The c* function takes a predicate and a stream, = and returns the first element in matching the predicate, or   if there is no such element. dO(n)5 Stream index (subscript) operator, starting from 0. eO(n) e', applied to a predicate and a stream, ? returns a stream containing those characters that satisfy the  predicate. fThe f- function takes a predicate and a stream and E returns the index of the first element in the stream satisfying the  predicate. gThe g- function takes a predicate and a stream and B returns all indices of the elements in the stream satisfying the  predicate. hzipWith generalises zip' by zipping with the function given as 4 the first argument, instead of a tupling function. iO(n) The i* function returns the number of times the , query element appears in the given stream. jkl256789:;<=>?@ABCDFHGIJKLMNOPQRSTUVWXYZ[\]^_`bcdefhi256789:;<=>?@ABCDFHGIJKLMNOPQRSTUVWXYZ[\]^_`bcdefhiportable experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.orgm;Operations supported by all elements that can be stored in  arrays. n:Indicate how many bytes would be used for an array of the  given size. o=Unchecked read of an immutable array. May return garbage or # crash on an out-of-bounds access. p:Unchecked read of a mutable array. May return garbage or # crash on an out-of-bounds access. q;Unchecked write of a mutable array. May return garbage or # crash on an out-of-bounds access. r7Read an immutable array. An invalid index results in a  runtime error. s<Read a mutable array. An invalid index results in a runtime  error. t=Write a mutable array. An invalid index results in a runtime  error. u$Operations supported by all arrays. vReturn the length of an array. w-Mutable array type, for use in the ST monad. xyImmutable array type. z{|}~'Create an uninitialized mutable array. *Freeze a mutable array. Do not mutate the xw afterwards! ?Create a mutable array, with its elements initialized with the  given value. &Convert an immutable array to a list. An empty immutable array. ?Run an action in the ST monad and return an immutable array of  its result. ?Run an action in the ST monad and return an immutable array of : its result paired with whatever else the action returns. @Copy an array in its entirety. The destination array must be at  least as big as the source.  source array destination array (Unsafely copy the elements of an array. mnopqrstuvwymnopqrstnopqrstuvvwyGHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.org 6A space efficient, packed, unboxed Unicode text type. Smart constructor. O(1) The empty  .  Construct a  - without invisibly pinning its byte array in , memory if its length has dwindled to zero.  A useful '-like function for debugging purposes.     GHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.orgGHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.org O(n) Convert a   into a ' Stream Char'. O(n) Convert a   into a ' Stream Char', but iterate  backwards. O(n) Convert a ' Stream Char' into a  . O(n)% Reverse the characters of a string. O(n) Perform the equivalent of scanr over a list, only with  the input and result reversed. O(n) Like unfoldr,  builds a stream from a seed < value. However, the length of the result is limited by the  first argument to '. This function is more efficient than  unfoldr) when the length of the result is known. O(n)5 stream index (subscript) operator, starting from 0. The - function takes a predicate and a stream and 6 returns the index of the first element in the stream  satisfying the predicate. O(n) The count0 function returns the number of times the query & element appears in the given stream.   portable experimentalSrtharper@aftereternity.co.uk, bos@serpentine.com, duncan@haskell.orgO(n): Convert a Stream Char into a UTF-8 encoded Stream Word8. portable experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.orgO(1) A variant of  for non-empty  .  B omits the check for the empty case, so there is an obligation on , the programmer to provide a proof that the   is non-empty. O(1) A variant of  for non-empty  .  B omits the check for the empty case, so there is an obligation on , the programmer to provide a proof that the   is non-empty. O(1)3 Iterate one step forwards through a UTF-16 array, B returning the current character and the delta to add to give the  next offset to iterate at. O(1)8 Iterate one step through a UTF-16 array, returning the 5 delta to add to give the next offset to iterate at. O(1)4 Iterate one step backwards through a UTF-16 array, > returning the current character and the delta to add (i.e. a 9 negative number) to give the next offset to iterate at. FJust like unsafePerformIO, but we inline it. Big performance gains as 0 it exposes lots of things to further inlining.  Very unsafe. In : particular, you should do no memory allocation inside an   block. On Hugs this is just unsafePerformIO. portable experimentalSrtharper@aftereternity.co.uk, bos@serpentine.com, duncan@haskell.orgO(n) Convert a  into a ' Stream Char', using UTF-8  encoding. O(n) Convert a  into a ' Stream Char', using little  endian UTF-16 encoding. O(n) Convert a  into a ' Stream Char' , using big  endian UTF-16 encoding. O(n) Convert a  into a ' Stream Char' , using big  endian UTF-32 encoding. O(n) Convert a  into a ' Stream Char', using little  endian UTF-32 encoding. O(n) Convert a   to a .  portable experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.org  Decode a & containing 7-bit ASCII encoded text.  Decode a  containing UTF-8 encoded text.  Decode a  containing UTF-8 encoded text. "Encode text using UTF-8 encoding. 0Decode text from little endian UTF-16 encoding. 0Decode text from little endian UTF-16 encoding. -Decode text from big endian UTF-16 encoding. -Decode text from big endian UTF-16 encoding. 1Encode text using little endian UTF-16 encoding. .Encode text using big endian UTF-16 encoding. 0Decode text from little endian UTF-32 encoding. 0Decode text from little endian UTF-32 encoding. -Decode text from big endian UTF-32 encoding. -Decode text from big endian UTF-32 encoding. 1Encode text using little endian UTF-32 encoding. .Encode text using big endian UTF-32 encoding.    portable experimentalTbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.orgO(n) Convert a lazy  into a ' Stream Char', using  UTF-8 encoding. O(n) Convert a   to a lazy . O(n) Convert a   to a lazy . GHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.orgO(n+m)4 Find the offsets of all non-overlapping indices of  needle within haystack. 'In (unlikely) bad cases, this algorithm's complexity degrades  towards O(n*m). Substring to search for (needle) Text to search in (haystack) GHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.orgO(n) Create a new   from a   by copying the  contents of the array.  source array length of source array (in  units) O(1) Return the length of a   in units of . This @ is useful for sizing a target array appropriately before using  . O(n) Copy a  . to an array. The array is assumed to be big + enough to hold the contents of the entire  . O(n)5 Perform an action on a temporary, mutable copy of a   4. The copy is freed as soon as the action returns.    GHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.orgZ!O(n) Convert a  into a  . Subject to fusion. "O(n)3 Convert a Text into a String. Subject to fusion. #O(1)" Convert a character into a Text.  Subject to fusion. $O(n)$ Adds a character to the front of a  . This function  is more costly than its List! counterpart because it requires * copying a new array. Subject to fusion. %O(n)" Adds a character to the end of a  . This copies the @ entire array in the process, unless fused. Subject to fusion. &O(n) Appends one  & to the other by copying both of them  into a new  . Subject to fusion. 'O(1)" Returns the first character of a  , which must be  non-empty. Subject to fusion. (O(1)+ Returns the first character and rest of a  , or   if empty. Subject to fusion. +Lifted from Control.Arrow and specialized. )O(1)! Returns the last character of a  , which must be  non-empty. Subject to fusion. *O(1), Returns all characters after the head of a  , which ( must be non-empty. Subject to fusion. +O(1)) Returns all but the last character of a   , which must # be non-empty. Subject to fusion. ,O(1) Tests whether a   is empty or not. Subject to  fusion. O(1) Tests whether a  ! contains exactly one character.  Subject to fusion. -O(n)' Returns the number of characters in a  .  Subject to fusion. .O(n) . f t is the   obtained by applying f to  each element of t. Subject to fusion. /O(n) The / function takes a   and a list of   :s and concatenates the list after interspersing the first , argument between each element of the list. 0O(n) The 0* function takes a character and places it  between the characters of a  . Subject to fusion. 1O(n)8 Reverse the characters of a string. Subject to fusion. 2O(m+n)9 Replace every occurrence of one substring with another. Text to search for Replacement text  Input text 3O(n); Convert a string to folded case. This function is mainly A 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 4% to the input string. For instance,  the Armenian small ligature "" (men now, U+FB13) is case  folded to the sequence "t" (men, U+0574) followed by  "v" (now, U+0576), while the Greek "" (micro sign,  U+00B5) is case folded to "" (small letter mu, U+03BC)  instead of itself. 4O(n)3 Convert a string to lower case, using simple case E conversion. The result string may be longer than the input string.  For instance, "0") (Latin capital letter I with dot above,  U+0130) maps to the sequence "i") (Latin small letter i, U+0069) followed  by " " (combining dot above, U+0307). 5O(n)3 Convert a string to upper case, using simple case E conversion. The result string may be longer than the input string.  For instance, the German "" (eszett, U+00DF) maps to the  two-letter sequence "SS". 6O(n)6 Left-justify a string to the given length, using the E specified fill character on the right. Subject to fusion. Examples: ) justifyLeft 7 'x' "foo" == "fooxxxx" ( justifyLeft 3 'x' "foobar" == "foobar" 7O(n)7 Right-justify a string to the given length, using the 1 specified fill character on the left. Examples: * justifyRight 7 'x' "bar" == "xxxxbar" ) justifyRight 3 'x' "foobar" == "foobar" 8O(n)0 Center a string to the given length, using the 4 specified fill character on either side. Examples:  center 8 'x' "HS" = "xxxHSxxx" 9O(n) The 9* function transposes the rows and columns  of its  ) argument. Note that this function uses !,  ":, and the list version of transpose, and is thus not very  efficient. :O(n) :1, applied to a binary operator, a starting value 6 (typically the left-identity of the operator), and a  ,  reduces the  0 using the binary operator, from left to right.  Subject to fusion. ;O(n) A strict version of :. Subject to fusion. <O(n) A variant of :& that has no starting value argument, ) and thus must be applied to a non-empty  . Subject to fusion. =O(n) A strict version of <. Subject to fusion. >O(n) >1, applied to a binary operator, a starting value 7 (typically the right-identity of the operator), and a  ,  reduces the  0 using the binary operator, from right to left.  Subject to fusion. ?O(n) A variant of >& that has no starting value argument, * and thust must be applied to a non-empty  . Subject to  fusion. @O(n) Concatenate a list of  s. AO(n) Map a function over a   that results in a  , and  concatenate the results. BO(n) B p t) determines whether any character in the    t satisifes the predicate p. Subject to fusion. CO(n) C p t* determines whether all characters in the    t satisify the predicate p. Subject to fusion. DO(n) D" returns the maximum value from a  , which ' must be non-empty. Subject to fusion. EO(n) E" returns the minimum value from a  , which ' must be non-empty. Subject to fusion. FO(n) F is similar to :, but returns a list of = successive reduced values from the left. Subject to fusion.  B scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]  Note that & last (scanl f z xs) == foldl f z xs. GO(n) G is a variant of F that has no starting % value argument. Subject to fusion. 0 scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...] HO(n) H is the right-to-left dual of F. 3 scanr f v == reverse . scanl (flip f) v . reverse IO(n) I is a variant of H that has no starting % value argument. Subject to fusion. JO(n) Like a combination of . and : . Applies a  function to each element of a  , passing an accumulating 3 parameter from left to right, and returns a final  . KThe K( function behaves like a combination of . and  >-; it applies a function to each element of a   , passing E an accumulating parameter from right to left, and returning a final 1 value of this accumulator together with the new  . LO(n*m) L n t is a   consisting of the input  t repeated n times. O(n)  n c is a   of length n with c the , value of every element. Subject to fusion. MO(n), where n" is the length of the result. The M # function is analogous to the List . M builds a   7 from a seed value. The function takes the element and  returns  if it is done producing the   , otherwise   (a,b). In this case, a is the next  in the  string, and b3 is the seed value for further production. Subject  to fusion. NO(n) Like M, N builds a   from a seed C value. However, the length of the result should be limited by the  first argument to N'. This function is more efficient than  M4 when the maximum length of the result is known and 2 correct, otherwise its performance is similar to M . Subject  to fusion. OO(n) O n, applied to a  , returns the prefix of the    of length n , or the   itself if n is greater than , the length of the Text. Subject to fusion. PO(n) P n, applied to a  , returns the suffix of the    of length n, or the empty   if n is greater than the  length of the  . Subject to fusion. QO(n) Q, applied to a predicate p and a  , > returns the longest prefix (possibly empty) of elements that  satisfy p. Subject to fusion. RO(n) R p t$ returns the suffix remaining after  Q p t. Subject to fusion. SO(n) S p t$ returns the prefix remaining after - dropping characters that fail the predicate p from the end of  t. Subject to fusion.  Examples: ( dropWhileEnd (=='.') "foo..." == "foo" TO(n) T p t' returns the substring remaining after - dropping characters that fail the predicate p from both the  beginning and end of t. Subject to fusion. UO(n); Remove leading white space from a string. Equivalent to:  dropWhile isSpace VO(n)< Remove trailing white space from a string. Equivalent to:  dropWhileEnd isSpace WO(n)8 Remove leading and trailing white space from a string.  Equivalent to:  dropAround isSpace XO(n) X 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 (O n t, P n t). YO(n) Y, applied to a predicate p and text t , returns C 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 list. ZO(n) Z is like Y, but the prefix returned is ' over elements that fail the predicate p. [O(n)8 Group characters in a string according to a predicate.  Returns the array index (in units of  ) at which a " character may be found. This is not the same as the logical  index returned by e.g. i. \O(n)+ Group characters in a string by equality. ]O(n)* Return all initial segments of the given   , shortest  first. ^O(n)( Return all final segments of the given   , longest  first. _O(m+n) Break a  $ into pieces separated by the first   : argument, consuming the delimiter. An empty delimiter is 0 invalid, and will cause an error to be raised.  Examples:  6 split "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"] 8 split "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""] , split "x" "x" == ["",""] and  ' intercalate s . split s == id 2 split (singleton c) == splitBy (==c) &In (unlikely) bad cases, this function's time complexity degrades  towards O(n*m). `O(n) Splits a  * into components delimited by separators, @ where the predicate returns True for a separator element. The C resulting components do not contain the separators. Two adjacent = separators result in an empty component in the output. eg. 2 splitBy (=='a') "aabbaca" == ["","","bb","c",""] # splitBy (=='a') "" == [""] aO(n) Splits a   into components of length k . The last @ element may be shorter than the other chunks, depending on the  length of the input. Examples: 1 chunksOf 3 "foobarbaz" == ["foo","bar","baz"] 3 chunksOf 4 "haskell.org" == ["hask","ell.","org"] bO(n) The b" function takes a predicate and a  , and 9 returns the first element in matching the predicate, or   if there is no such element. cO(n) The c" function takes a predicate and a  ,  and returns the pair of  $s with elements which do and do not + satisfy the predicate, respectively; i.e. 5 partitionBy p t == (filter p t, filter (not . p) t) dO(n) d, applied to a predicate and a  ,  returns a  . containing those characters that satisfy the  predicate. eO(n+m) Find the first instance of needle (which must be  non-,) 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:  * break "::" "a::b::c" ==> ("a", "::b::c") ) break "/" "foobar" ==> ("foobar", "") Laws:  ! append prefix match == haystack 1 where (prefix, match) = break needle haystack BIf you need to break a string by a substring repeatedly (e.g. you 6 want to break on every instance of a substring), use g , instead, as it has lower startup overhead. &In (unlikely) bad cases, this function's time complexity degrades  towards O(n*m). fO(n+m) Similar to e+, but searches from the end of the string. 9The 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. - breakEnd "::" "a::b::c" ==> ("a::b::", "c") gO(n+m)' Find all non-overlapping instances of needle in  haystack8. The first element of the returned pair is the prefix  of haystack prior to any matches of needle. The second is a  list of pairs. >The first element of each pair in the list is a span from the D beginning of a match to the beginning of the next match, while the D second is a span from the beginning of the match to the end of the  input.  Examples:   find "::" ""  ==> ("", [])  find "/" "a/b/c/d" : ==> ("a", [("/b","/b/c/d"), ("/c","/c/d"), ("/d","/d")]) &In (unlikely) bad cases, this function's time complexity degrades  towards O(n*m). hO(n)  . index (subscript) operator, starting from 0. iO(n) The i" function takes a predicate and a   3 and returns the index of the first element in the   satisfying # the predicate. Subject to fusion. jO(n+m) The j* function returns the number of times the # query string appears in the given  . An empty query string is 0 invalid, and will cause an error to be raised. &In (unlikely) bad cases, this function's time complexity degrades  towards O(n*m). O(n) The * function returns the number of times the $ query element appears in the given  . Subject to fusion. kO(n) k takes two  s and returns a list of , corresponding pairs of bytes. If one input   is short,  excess elements of the longer   are discarded. This is  equivalent to a pair of " operations. lO(n) l generalises k by zipping with the function = given as the first argument, instead of a tupling function. mO(n) Breaks a  ' up into a list of words, delimited by s  representing white space. nO(n) Breaks a   up into a list of  s at  newline 2s. The resulting strings do not contain newlines. oO(n)7 Joins lines, after appending a terminating newline to  each. pO(n), Joins words using single space characters. qO(n) The q function takes two  s and returns  a< iff the first is a prefix of the second. This function is  subject to fusion. rO(n) The r function takes two  s and returns  a* iff the first is a suffix of the second. sO(n+m) The s function takes two  s and returns  a9 iff 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). U !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrsU !"# $%&(')*+,-./0912345678:;<=>?@ABCDEFGHIJKLMNOPQRSTWUVXYefZ\[]^_`anmopqrsdgbchijklS!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrsGHC experimentalbos@serpentine.comBRead a single line of input from a handle, constructing a list of " decoded chunks as we go. When we'!re done, transform them into the  destination type. ?Read a single chunk of strict text from a buffer. Used by both 6 the strict and lazy implementations of hGetContents. GHC experimentalbos@serpentine.comtThe t3 function reads a file and returns the contents of B the file as a string. The entire file is read strictly, as with  |. u@Write a string to a file. The file is truncated to zero length  before writing begins. v"Write a string the end of a file. w!Read the remaining contents of a  as a string. The  6 is closed once the contents have been read, or if an  exception is thrown. ;Internally, this function reads a chunk at a time from the E lower-level buffering abstraction, and concatenates the chunks into 5 a single string once the entire file has been read. CAs a result, it requires approximately twice as much memory as its @ result to construct its result. For files more than a half of > available RAM in size, this may result in memory exhaustion. x"Read a single line from a handle. yWrite a string to a handle. z3Write a string to a handle, followed by a newline. {The {# function takes a function of type  Text -> Text E as its argument. The entire input from the standard input device is C passed to this function as its argument, and the resulting string * is output on the standard output device. |Read all user input on  as a single string. }&Read a single line of user input from . ~Write a string to . Write a string to , followed by a newline. tuvwxyz{|}~ tuvwxyz{|}~ tuvwxyz{|}~GHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.org The data type invariant: Every  is either  or  consists of non-null  &s. All functions must preserve this, ( and the QC properties must check this. ,In a form that checks the invariant lazily. Smart constructor for &. Guarantees the data type invariant. Smart constructor for . Consume the chunks of a lazy  with a natural right fold. Consume the chunks of a lazy  with a strict, tail-recursive,  accumulating left fold. ;Currently set to 32k, less the memory management overhead. :Currently set to 4k, less the memory management overhead. FThe memory management overhead. Currently this is tuned for GHC only.  GHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.orgO(n) Convert a  into a ' Stream Char'. O(n) Convert a ' Stream Char' into a , using the given  chunk size. O(n) Convert a ' Stream Char' into a , using  . O(n)- Returns the number of characters in a text. O(n) Like unfoldr,  unfoldrN64 builds a stream from a seed < value. However, the length of the result is limited by the  first argument to  unfoldrN64'. This function is more efficient than  unfoldr) when the length of the result is known. O(n)5 stream index (subscript) operator, starting from 0. O(n) The count0 function returns the number of times the query & element appears in the given stream. GHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.orgO(n+m)4 Find the offsets of all non-overlapping indices of  needle within haystack. This function is strict in needle , and lazy (as far as possible)  in the chunks of haystack. 'In (unlikely) bad cases, this algorithm's complexity degrades  towards O(n*m). Substring to search for (needle) Text to search in (haystack) "Fast index into a partly unpacked . We take into account A the possibility that the caller might try to access one element  past the end. The number of  values in a . GHC experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.org\O(n) Convert a  into a . *This function is subject to array fusion. O(n) Convert a  into a .  Subject to array fusion. O(c) Convert a list of strict  s into a lazy . O(n) Convert a lazy  into a list of strict  s. O(n\c)/ Appends one  to another. Subject to array  fusion. O(1)+ Returns the first character and rest of a , or  $ if empty. Subject to array fusion. O(1)" Returns the first character of a , which must be & non-empty. Subject to array fusion. O(1), Returns all characters after the head of a , which . must be non-empty. Subject to array fusion. O(1)) Returns all but the last character of a  , which must ) be non-empty. Subject to array fusion. O(1) Tests whether a $ is empty or not. Subject to array  fusion. O(1) Tests whether a ! contains exactly one character.  Subject to fusion. O(1)! Returns the last character of a , which must be & non-empty. Subject to array fusion. O(n)  f t is the  obtained by applying f to  each element of t. Subject to array fusion. O(n) The  function takes a  and a list of  :s and concatenates the list after interspersing the first , argument between each element of the list. O(n) The * function takes a character and places it  between the characters of a . Subject to array fusion. O(n)6 Left-justify a string to the given length, using the E specified fill character on the right. Subject to fusion. Examples: ) justifyLeft 7 'x' "foo" == "fooxxxx" ( justifyLeft 3 'x' "foobar" == "foobar" O(n)7 Right-justify a string to the given length, using the 1 specified fill character on the left. Examples: * justifyRight 7 'x' "bar" == "xxxxbar" ) justifyRight 3 'x' "foobar" == "foobar" O(n)0 Center a string to the given length, using the 4 specified fill character on either side. Examples:  center 8 'x' "HS" = "xxxHSxxx" O(n) The * function transposes the rows and columns  of its ) argument. Note that this function uses ,  :, and the list version of transpose, and is thus not very  efficient. O(n)  t returns the elements of t in reverse order. O(m+n)9 Replace every occurrence of one substring with another. Text to search for Replacement text  Input text O(n); Convert a string to folded case. This function is mainly = useful for performing caseless (or 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 % to the input string. For instance, D the Armenian small ligature men now (U+FB13) is case folded to the B bigram men now (U+0574 U+0576), while the micro sign (U+00B5) is E case folded to the Greek small letter letter mu (U+03BC) instead of  itself. O(n)3 Convert a string to lower case, using simple case E conversion. The result string may be longer than the input string. B For instance, the Latin capital letter I with dot above (U+0130) @ maps to the sequence Latin small letter i (U+0069) followed by  combining dot above (U+0307). O(n)3 Convert a string to upper case, using simple case E conversion. The result string may be longer than the input string. A For instance, the German eszett (U+00DF) maps to the two-letter  sequence SS. O(n) 1, applied to a binary operator, a starting value 6 (typically the left-identity of the operator), and a ,  reduces the 0 using the binary operator, from left to right.  Subject to array fusion. O(n) A strict version of .  Subject to array fusion. O(n) A variant of & that has no starting value argument, ) and thus must be applied to a non-empty . Subject to array  fusion. O(n) A strict version of .  Subject to array fusion. O(n) 1, applied to a binary operator, a starting value 7 (typically the right-identity of the operator), and a ,  reduces the 0 using the binary operator, from right to left.  Subject to array fusion. O(n) A variant of * that has no starting value argument, and & thust must be applied to a non-empty . Subject to array  fusion. O(n) Concatenate a list of s. O(n) Map a function over a  that results in a , and  concatenate the results. O(n)  p t) determines whether any character in the   t satisifes the predicate p. Subject to array fusion. O(n)  p t* determines whether all characters in the   t satisify the predicate p. Subject to array fusion. O(n) " returns the maximum value from a , which - must be non-empty. Subject to array fusion. O(n) " returns the minimum value from a , which - must be non-empty. Subject to array fusion. O(n)  is similar to , but returns a list of C successive reduced values from the left. This function is subject  to array fusion.  B scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]  Note that & last (scanl f z xs) == foldl f z xs. O(n)  is a variant of  that has no starting < value argument. This function is subject to array fusion. 0 scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...] O(n)  is the right-to-left dual of . 3 scanr f v == reverse . scanl (flip f) v . reverse O(n)  is a variant of  that has no starting  value argument. O(n) Like a combination of  and  . Applies a  function to each element of a , passing an accumulating 3 parameter from left to right, and returns a final . The ( function behaves like a combination of  and  -; it applies a function to each element of a  , passing E an accumulating parameter from right to left, and returning a final 1 value of this accumulator together with the new . O(n*m)  n t is a  consisting of the input  t repeated n times. O(n)  n c is a  of length n with c the , value of every element. Subject to fusion. O(n), where n" is the length of the result. The  # function is analogous to the List .  builds a  7 from a seed value. The function takes the element and  returns  if it is done producing the  , otherwise   (a,b). In this case, a is the next  in the  string, and b+ is the seed value for further production. O(n) Like ,  builds a  from a seed C value. However, the length of the result should be limited by the  first argument to '. This function is more efficient than  4 when the maximum length of the result is known and 2 correct, otherwise its performance is similar to . O(n)  n, applied to a , returns the prefix of the   of length n , or the  itself if n is greater than , the length of the Text. Subject to fusion. O(n)  n, applied to a , returns the suffix of the   of length n, or the empty  if n is greater than the  length of the . Subject to fusion. O(n)  n returns the suffix with n Word16  values dropped, or the empty  if n is greater than the  number of Word16 values present. O(n) , applied to a predicate p and a  , returns > the longest prefix (possibly empty) of elements that satisfy p. + This function is subject to array fusion. O(n)  p t$ returns the suffix remaining after   p t,. This function is subject to array fusion. O(n)  p t$ returns the prefix remaining after - dropping characters that fail the predicate p from the end of  t.  Examples: ( dropWhileEnd (=='.') "foo..." == "foo" O(n)  p t' returns the substring remaining after - dropping characters that fail the predicate p from both the  beginning and end of t. Subject to fusion. O(n); Remove leading white space from a string. Equivalent to:  dropWhile isSpace O(n)< Remove trailing white space from a string. Equivalent to:  dropWhileEnd isSpace O(n)8 Remove leading and trailing white space from a string.  Equivalent to:  dropAround isSpace O(n)  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 ( n t,  n t). O(n)  n t# returns a strict pair whose first  element is a prefix of t whose chunks contain n Word16 : values, and whose second is the remainder of the string. O(n+m) Find the first instance of needle (which must be  non-) 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:  * break "::" "a::b::c" ==> ("a", "::b::c") ) break "/" "foobar" ==> ("foobar", "") Laws:  ! append prefix match == haystack 1 where (prefix, match) = break needle haystack BIf you need to break a string by a substring repeatedly (e.g. you 6 want to break on every instance of a substring), use  , instead, as it has lower startup overhead. ?This function is strict in its first argument, and lazy in its  second. &In (unlikely) bad cases, this function's time complexity degrades  towards O(n*m). O(n+m) Similar to +, but searches from the end of the string. 9The 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. - breakEnd "::" "a::b::c" ==> ("a::b::", "c") O(n+m)' Find all non-overlapping instances of needle in  haystack8. The first element of the returned pair is the prefix  of haystack prior to any matches of needle. The second is a  list of pairs. >The first element of each pair in the list is a span from the D beginning of a match to the beginning of the next match, while the D second is a span from the beginning of the match to the end of the  input.  Examples:   find "::" ""  ==> ("", [])  find "/" "a/b/c/d" : ==> ("a", [("/b","/b/c/d"), ("/c","/c/d"), ("/d","/d")]) ?This function is strict in its first argument, and lazy in its  second. &In (unlikely) bad cases, this function's time complexity degrades  towards O(n*m). O(n)  is like ", but the prefix returned is over " elements that fail the predicate p. O(n) , applied to a predicate p and text t , returns C 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 list. The  function takes a  and returns a list of s E such that the concatenation of the result is equal to the argument. D Moreover, each sublist in the result contains only equal elements.  For example,  < group "Mississippi" = ["M","i","ss","i","ss","i","pp","i"] It is a special case of !, which allows the programmer to ! supply their own equality test. The + function is the non-overloaded version of . O(n)* Return all initial segments of the given ,  shortest first. O(n)( Return all final segments of the given  , longest  first. O(m+n) Break a $ into pieces separated by the first  : argument, consuming the delimiter. An empty delimiter is 0 invalid, and will cause an error to be raised.  Examples:  6 split "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"] 8 split "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""] , split "x" "x" == ["",""] and  ' intercalate s . split s == id 2 split (singleton c) == splitBy (==c) ?This function is strict in its first argument, and lazy in its  second. &In (unlikely) bad cases, this function's time complexity degrades  towards O(n*m). Text to split on  Input text O(n) Splits a * into components delimited by separators, @ where the predicate returns True for a separator element. The C resulting components do not contain the separators. Two adjacent = separators result in an empty component in the output. eg. 2 splitBy (=='a') "aabbaca" == ["","","bb","c",""] # splitBy (=='a') [] == [""] O(n) Splits a  into components of length k . The last @ element may be shorter than the other chunks, depending on the  length of the input. Examples: 1 chunksOf 3 "foobarbaz" == ["foo","bar","baz"] 3 chunksOf 4 "haskell.org" == ["hask","ell.","org"] O(n) Breaks a  up into a list of s at  newline 2s. The resulting strings do not contain newlines. O(n) Breaks a ' up into a list of words, delimited by s  representing white space. O(n)7 Joins lines, after appending a terminating newline to  each. O(n), Joins words using single space characters. O(n) The  function takes two s and returns  a< iff the first is a prefix of the second. This function is  subject to fusion. O(n) The  function takes two s and returns  a* iff the first is a suffix of the second. O(n+m) The  function takes two s and returns  a9 iff the first is contained, wholly and intact, anywhere  within the second. ?This function is strict in its first argument, and lazy in its  second. &In (unlikely) bad cases, this function's time complexity degrades  towards O(n*m). O(n) , applied to a predicate and a ,  returns a . containing those characters that satisfy the  predicate. O(n) The " function takes a predicate and a , and 9 returns the first element in matching the predicate, or   if there is no such element. O(n) The " function takes a predicate and a ,  and returns the pair of $s with elements which do and do not + satisfy the predicate, respectively; i.e. 5 partitionBy p t == (filter p t, filter (not . p) t) O(n) . index (subscript) operator, starting from 0. O(n+m) The * function returns the number of times the # query string appears in the given . An empty query string is 0 invalid, and will cause an error to be raised. &In (unlikely) bad cases, this function's time complexity degrades  towards O(n*m). O(n) The * function returns the number of times the $ query element appears in the given . This function is subject  to fusion. O(n)  takes two s and returns a list of , corresponding pairs of bytes. If one input  is short,  excess elements of the longer  are discarded. This is  equivalent to a pair of  operations. O(n)  generalises  by zipping with the function = given as the first argument, instead of a tupling function. VVTportable experimentalSbos@serpentine.com, rtharper@aftereternity.co.uk, duncan@haskell.org Decode a  containing UTF-8 encoded text.  Decode a  containing UTF-8 encoded text. "Encode text using UTF-8 encoding. GHC experimentalbos@serpentine.comThe 3 function reads a file and returns the contents of B the file as a string. The entire file is read strictly, as with  . @Write a string to a file. The file is truncated to zero length  before writing begins. "Write a string the end of a file. "Read a single line from a handle. Write a string to a handle. 3Write a string to a handle, followed by a newline. The # function takes a function of type  Text -> Text E as its argument. The entire input from the standard input device is C passed to this function as its argument, and the resulting string * is output on the standard output device. Read all user input on  as a single string. &Read a single line of user input from . Write a string to . Write a string to , followed by a newline.  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNO(PQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~)*?@ABCDFEHIJGKLMNSTUVO(PQRWXYZ[\]^_`abcdefghijklmnopqrstuwvyxz{|}~,-.                         *ABCDEFGHIJLNPQRWXYZ[\M]^_`abcjlmnoK      *) KO!k"#$%&'()E*)H+,-./01234567 89:01;3< :=>?8@ABCjDEF"GHI@JKLMNOPQRSTUTVWXYZ[\]^_`a< Kk"=bBcd"efghitext-0.7Data.Text.Encoding.Error Data.TextData.Text.EncodingData.Text.Foreign Data.Text.IOData.Text.LazyData.Text.Lazy.EncodingData.Text.Lazy.IOData.Text.Encoding.Utf32Data.Text.UnsafeShiftData.Text.Encoding.Utf8Data.Text.Fusion.SizeData.Text.Fusion.InternalData.Text.Fusion.CaseMappingData.Text.Encoding.Utf16Data.Text.Fusion.CommonData.Text.ArrayData.Text.InternalData.Text.UnsafeCharData.Text.Fusion Data.Text.Encoding.Fusion.CommonData.Text.UnsafeData.Text.Encoding.FusionData.Text.Lazy.Encoding.FusionData.Text.SearchData.Text.IO.InternalData.Text.Lazy.InternalData.Text.Lazy.FusionData.Text.Lazy.SearchUnicodeException EncodeError DecodeError OnEncodeError OnDecodeErrorOnError strictDecode lenientDecode strictEncodeignorereplaceTextempty decodeASCIIdecodeUtf8With decodeUtf8 encodeUtf8decodeUtf16LEWith decodeUtf16LEdecodeUtf16BEWith decodeUtf16BE encodeUtf16LE encodeUtf16BEdecodeUtf32LEWith decodeUtf32LEdecodeUtf32BEWith decodeUtf32BE encodeUtf32LE encodeUtf32BEfromPtr lengthWord16unsafeCopyToPtruseAsPtrpackunpack singletonconssnocappendheadunconslasttailinitnulllengthmap intercalate interspersereverse toCaseFoldtoLowertoUpper justifyLeft justifyRightcenter transposefoldlfoldl'foldl1foldl1'foldrfoldr1concat concatMapanyallmaximumminimumscanlscanl1scanrscanr1 mapAccumL mapAccumR replicateunfoldrunfoldrNtakedrop takeWhile dropWhile dropWhileEnd dropAround stripStartstripEndstripsplitAtspanBybreakBygroupBygroupinitstailssplitsplitBychunksOffindBy partitionByfilterbreakbreakEndfindindex findIndexcountzipzipWithwordslinesunlinesunwords isPrefixOf isSuffixOf isInfixOfreadFile writeFile appendFile hGetContentshGetLinehPutStr hPutStrLninteract getContentsgetLineputStrputStrLn fromChunkstoChunksvalidate UnsafeShiftshiftLshiftRbetweenord2ord3ord4chr2chr3chr4 validate1 validate2 validate3 validate4SizeUnknownMaxExact exactSizemaxSize unknownSizeaddSize subtractSizemulSizesmallerlargertoMax lowerBound upperBoundisEmptyStreamStepYieldSkipDoneSwitchS2S1PairS:*:SM8MJNCCeqcmp upperMapping lowerMapping foldMappingbaseGHC.BaseString Data.MaybeNothingJustGHC.Errerror GHC.ExceptionthrowshowUnicodeExceptionRIII3I2I1InitInit1Init0ERLCC1C0 streamList unstreamListlengthI isSingleton caseConvert justifyLeftIreplicateCharI replicateI unfoldrNIghc-primGHC.BoolTrueelemindexI findIndexI findIndicesI countCharI streamError emptyError internalErrorElt bytesInArray unsafeIndex unsafeRead unsafeWritereadwriteIArrayMArrayArrayarrayTcmArrayTccheck wORD16_SCALE unsafeNew unsafeFreezenewtoListrunrun2copy unsafeCopytexttextPshowTextGHC.Showshow unsafeChr unsafeChr8 unsafeChr32stream reverseStreamunstream reverseScanr countChar restreamUtf8restreamUtf16BErestreamUtf16LErestreamUtf32BErestreamUtf32LE unsafeHeadGHC.List unsafeTailiteriter_ reverseIterinlinePerformIO streamASCII streamUtf8bytestring-0.9.1.7Data.ByteString.Internal ByteString streamUtf16LE streamUtf16BE streamUtf32BE streamUtf32LEGHC.WordWord8 decodeErrorData.ByteString.Lazy.InternalunstreamChunksindicesGHC.PtrPtrWord16second replicateChar Data.List GHC.TypesCharfindAIndexOrEnd hGetLineWith hGetLineLoopmaybeFillReadBuffer unpack_nlgetSomeCharacters readChunk sizeErrorGHC.IO.Handle.TypesHandle hPutChars writeBlocksgetSpareBuffer commitBufferGHC.IO.Handle.FDstdinstdoutChunkEmpty invariant showStructurecheckInvariantchunk foldrChunks foldlChunksdefaultChunkSizesmallChunkSize chunkOverhead wordLength dropWords splitAtWord revChunksimpossibleErrorlazyReadlazyReadBuffered