h$I3      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                                                                                                                                                                                                                                   02010-2011 Simon Meier, 2010 Jasper van der JeugtBSD3-style (see LICENSE) Simon Meier unstable, privateGHCUnsafe bytestringA builder primitive that always results in sequence of bytes that is no longer than a pre-determined bound. bytestringA builder primitive that always results in a sequence of bytes of a pre-determined, fixed size. bytestring0The type used for sizes and sizeBounds of sizes. bytestringA fmap-like operator for builder primitives, both bounded and fixed size.Builder primitives are contravariant so it's like the normal fmap, but backwards (look at the type). (If it helps to remember, the operator symbol is like ( $) but backwards.)We can use it for example to prepend and/or append fixed values to an primitive.  import Data.ByteString.Builder.Prim as P showEncoding ((\x -> ('\'', (x, '\''))) >$< fixed3) 'x' = "'x'" where fixed3 = P.char7 >*< P.char7 >*< P.char7Note that the rather verbose syntax for composition stems from the requirement to be able to compute the size / size bound at compile time. bytestringA pairing/concatenation operator for builder primitives, both bounded and fixed size. For example, ?toLazyByteString (primFixed (char7 >*< char7) ('x','y')) = "xy")We can combine multiple primitives using  multiple times. toLazyByteString (primFixed (char7 >*< char7 >*< char7) ('x',('y','z'))) = "xyz" bytestring5The size of the sequences of bytes generated by this .  bytestringThe 1 that always results in the zero-length sequence.  bytestringEncode a pair by encoding its first component and then its second component.  bytestringChange a primitives such that it first applies a function to the value to be encoded.Note that primitives are   0http://hackage.haskell.org/package/contravariant". Hence, the following laws hold. contramapF id = id contramapF f . contramapF g = contramapF (g . f)  bytestring Convert a  to a .  bytestringLift a  to a . bytestring>The bound on the size of sequences of bytes generated by this .  bytestring bytestring Change a  such that it first applies a function to the value to be encoded. Note that s are   0http://hackage.haskell.org/package/contravariant". Hence, the following laws hold. contramapB id = id contramapB f . contramapB g = contramapB (g . f) bytestringThe 1 that always results in the zero-length sequence. bytestringEncode a pair by encoding its first component and then its second component. bytestring Encode an  value using the first  for  values and the second  for  values.Note that the functions , , and  (written below using ) suffice to construct :s for all non-recursive algebraic datatypes. For example, maybeB :: BoundedPrim () -> BoundedPrim a -> BoundedPrim (Maybe a) maybeB nothing just =  (Left ()) Right  eitherB nothing just  bytestringConditionally select a . For example, we can implement the ASCII primitive that drops characters with Unicode codepoints above 127 as follows. charASCIIDrop =  (< '\128') (  )   bytestringSelect an implementation depending on bitness. Throw a compile time error if bitness is neither 32 nor 64.   45(c) 2011 Simon MeierBSD3-style (see LICENSE) Simon Meier  experimentalGHC Trustworthy  bytestring&An encoding table for Base16 encoding. bytestringThe encoding table for hexadecimal values with lower-case characters; e.g., deadbeef. bytestringEncode an octet as 16bit word comprising both encoded nibbles ordered according to the host endianness. Writing these 16bit to memory will write the nibbles in the correct order (i.e. big-endian).(c) 2010 Simon MeierBSD3-style (see LICENSE) Simon Meier  experimentalGHC Trustworthy  bytestring Encode a  using a  encoding. PRE: The / encoding must have a size of at least 4 bytes. bytestring Encode a  using a  encoding. PRE: The / encoding must have a size of at least 8 bytes.(c) 2010-2011 Simon MeierBSD3-style (see LICENSE) Simon Meier GHC Trustworthy* bytestring%Encoding single unsigned bytes as-is. bytestring Encoding s in big endian format. bytestring Encoding s in little endian format.  bytestring Encoding s in big endian format.! bytestring Encoding s in little endian format." bytestring Encoding s in big endian format.# bytestring Encoding s in little endian format.$ bytestringEncode a single native machine . The s is encoded in host order, host endian form, for the machine you are on. On a 64 bit machine the  is an 8 byte value, on a 32 bit machine, 4 bytes. Values encoded this way are not portable to different endian or word sized machines, without conversion.% bytestring Encoding +s in native host order and host endianness.& bytestring Encoding +s in native host order and host endianness.' bytestring Encoding +s in native host order and host endianness.( bytestring#Encoding single signed bytes as-is.) bytestring Encoding s in big endian format.* bytestring Encoding s in little endian format.+ bytestring Encoding s in big endian format., bytestring Encoding s in little endian format.- bytestring Encoding s in big endian format.. bytestring Encoding s in little endian format./ bytestringEncode a single native machine . The s is encoded in host order, host endian form, for the machine you are on. On a 64 bit machine the  is an 8 byte value, on a 32 bit machine, 4 bytes. Values encoded this way are not portable to different endian or integer sized machines, without conversion.0 bytestring Encoding +s in native host order and host endianness.1 bytestring Encoding +s in native host order and host endianness.2 bytestring Encoding +s in native host order and host endianness.3 bytestring Encode a  in big endian format.4 bytestring Encode a  in little endian format.5 bytestring Encode a  in big endian format.6 bytestring Encode a  in little endian format.7 bytestring Encode a  in native host order and host endianness. Values written this way are not portable to different endian machines, without conversion.8 bytestring Encode a * in native host order and host endianness. !"#$%&'()*+,-./012345678(c) 2010 Jasper Van der Jeugt (c) 2010 - 2011 Simon MeierBSD3-style (see LICENSE) Simon Meier GHC Trustworthy09 bytestringEncode the least 7-bits of a  using the ASCII encoding.: bytestringDecimal encoding of an .; bytestringDecimal encoding of an .< bytestringDecimal encoding of an .= bytestringDecimal encoding of an .> bytestringDecimal encoding of an .? bytestringDecimal encoding of a .@ bytestringDecimal encoding of a .A bytestringDecimal encoding of a .B bytestringDecimal encoding of a .C bytestringDecimal encoding of a .D bytestringHexadecimal encoding of a .E bytestringHexadecimal encoding of a .F bytestringHexadecimal encoding of a .G bytestringHexadecimal encoding of a .H bytestringHexadecimal encoding of a .I bytestring Encode a & using 2 nibbles (hexadecimal digits).J bytestring Encode a  using 4 nibbles.K bytestring Encode a  using 8 nibbles.L bytestring Encode a  using 16 nibbles.M bytestring Encode a & using 2 nibbles (hexadecimal digits).N bytestring Encode a  using 4 nibbles.O bytestring Encode a  using 8 nibbles.P bytestring Encode a  using 16 nibbles.Q bytestringEncode an IEEE  using 8 nibbles.R bytestringEncode an IEEE  using 16 nibbles.9:;<=>?@ABCDEFGHIJKLMNOPQR(c) Lawrence Wu 2021 BSD-stylelawrencejwu@gmail.com Safe-Inferred2[ bytestringBound for bits of  2^k / 5^q for floats bytestringBound for bits of  5^-e2-q / 2^k for floats bytestringBound for bits of  5^-e2-q / 2^k for doubles bytestringBound for bits of  2^k / 5^q for doubles(c) Don Stewart 2006-2008 (c) Duncan Coutts 2006-2012 BSD-style.dons00@gmail.com, duncan@community.haskell.orgunstable non-portableUnsafe &3L9 S  bytestring'Type synonym for the strict flavour of T.T bytestring&A space-efficient representation of a / vector, supporting many efficient operations.A T8 contains 8-bit bytes, or by using the operations from Data.ByteString.Char87 it can be interpreted as containing 8-bit characters.U  bytestring^ bytestring^ foreignPtr offset length represents a T with data backed by a given  foreignPtr, starting at a given offset in bytes and of a specified length.+This pattern is used to emulate the legacy T data constructor, so that pre-existing code generally doesn't need to change to benefit from the simplified U5 constructor and can continue to function unchanged.Note: Matching with this constructor will always be given a 0 offset, as the base will be manipulated by  instead.` bytestring` is a variant of findIndex, that returns the length of the string if no element is found, rather than Nothing.e bytestringO(n) Pack a null-terminated sequence of bytes, pointed to by an Addr# (an arbitrary machine address assumed to point outside the garbage-collected heap) into a  ByteString". A much faster way to create an  is with an unboxed string literal, than to pack a boxed string. A unboxed string literal is compiled to a static char [] by GHC. Establishing the length of the string requires a call to  strlen(3) , so the > must point to a null-terminated buffer (as is the case with  "string"# literals in GHC). Use 2 if you know the length of the string statically. An example: (literalFS = unsafePackAddress "literal"#This function is unsafe7. If you modify the buffer pointed to by the original 7 this modification will be reflected in the resulting  ByteString$, breaking referential transparency."Note this also won't work if your  has embedded '\0' characters in the string, as strlen will return too short a length.f  bytestringSee e. This function is similar, but takes an additional length argument rather then computing it with strlen. Therefore embedding '\0' characters is possible.g  bytestringSee e. This function has similar behavior. Prefer this function when the address in known to be an Addr# literal. In that context, there is no need for the sequencing guarantees that 6 provides. On GHC 9.0 and up, this function uses the FinalPtr data constructor for ForeignPtrContents.h  bytestringSee g. This function is similar, but takes an additional length argument rather then computing it with strlen. Therefore embedding '\0' characters is possible.q bytestring5The 0 pointer. Used to indicate the empty Bytestring.r bytestringO(1)& Build a ByteString from a ForeignPtr.If you do not need the offset parameter then you should be using  or  instead.s  bytestringt bytestringO(1)+ Deconstruct a ForeignPtr from a ByteStringu  bytestringO(1)+ Deconstruct a ForeignPtr from a ByteStringv bytestring8A way of creating ByteStrings outside the IO monad. The Int2 argument gives the final size of the ByteString.w bytestringLike v but instead of giving the final size of the ByteString, it is just an upper bound. The inner action returns the actual size. Unlike | the ByteString is not reallocated if the final size is less than the estimated size.x  bytestringy bytestringCreate ByteString of size l and use action f to fill its contents.z bytestringGiven a maximum size l and an action f that fills the T starting at the given * and returns the actual utilized length, z` l f returns the filled T.{  bytestringLike z>, but also returns an additional value created by the action.| bytestringGiven the maximum size needed and a function to make the contents of a ByteString, createAndTrim makes the T. The generating function is required to return the actual final size (<= the maximum size), and the resulting byte array is realloced to this size.createAndTrim is the main mechanism for creating custom, efficient ByteString functions, using Haskell or C functions to fill the space.~ bytestring Wrapper of # with faster implementation for GHC bytestringO(1) The empty T bytestring5Add two non-negative numbers. Errors out on overflow. bytestringConversion between  and . Should compile to a no-op. bytestringUnsafe conversion between  and . This is a no-op and silently truncates to 8 bits Chars > '255'. It is provided as convenience for ByteString construction. bytestringSelects words corresponding to white-space characters in the Latin-1 range bytestring3Selects white-space characters in the Latin-1 range bytestring0This "function" has a superficial similarity to  but it is in fact a malevolent agent of chaos. It unpicks the seams of reality (and the  monad) so that the normal rules no longer apply. It lulls you into thinking it is reasonable, but when you are not looking it stabs you in the back and aliases all of your mutable buffers. The carcass of many a seasoned Haskell programmer lie strewn at its feet.!Witness the trail of destruction: https://github.com/haskell/bytestring/commit/71c4b438c675aa360c79d79acc9a491e7bbc26e7 https://github.com/haskell/bytestring/commit/210c656390ae617d9ee3b8bcff5c88dd17cef8da ,https://ghc.haskell.org/trac/ghc/ticket/3486 ,https://ghc.haskell.org/trac/ghc/ticket/3487 ,https://ghc.haskell.org/trac/ghc/ticket/72707Do not talk about "safe"! You do not know what is safe!Yield not to its blasphemous call! Flee traveller! Flee or you will be corrupted and devoured!  bytestring bytestringBeware:  truncates multi-byte characters to octets. e.g. "````a`a`" becomes 6knh~Qn  bytestringr bytestringOffset bytestringLengths bytestringLengtht bytestring(ptr, offset, length)u bytestring (ptr, length)8STU^VWXYZ[\]_`abcdefghijklmnopqrstuvwxyz{|}~9TU^^S`aicbjdkmolnpefghyz{|}vwx~rtsuq]\[ZYXWV_(c) Lawrence Wu 2021 BSD-stylelawrencejwu@gmail.comNone#$\& bytestringBookkeeping state for finding the shortest, correctly-rounded representation. The same trimming algorithm is similar enough for 32- and 64-bit floats bytestring9Wrapper for polymorphic handling of 32- and 64-bit floats bytestringSpecial rendering for NaN, positive/negative 0, and positive/negative infinity. These are based on the IEEE representation of non-numbers.Infinity8sign = 0 for positive infinity, 1 for negative infinity.biased exponent = all 1 bits.fraction = all 0 bits.NaNsign = either 0 or 1 (ignored)biased exponent = all 1 bits.&fraction = anything except all 0 bits.We also handle 0 specially here so that the exponent rendering is more correct.sign = either 0 or 1.biased exponent = all 0 bits.fraction = all 0 bits. bytestring*Build a full bit-mask of specified length.e.g showHex (mask 12) [] = "fff" bytestring(Convert boolean false to 0 and true to 1 bytestring(Convert boolean false to 0 and true to 1 bytestringMonomorphic conversion for  Int32 -> Int bytestringMonomorphic conversion for  Int -> Int32 bytestringMonomorphic conversion for  Word32 -> Int bytestringMonomorphic conversion for  Word64 -> Int bytestringMonomorphic conversion for Word32 -> Word64 bytestringMonomorphic conversion for Word64 -> Word32 bytestringReturns the number of decimal digits in v, which must not contain more than 9 digits. bytestringReturns the number of decimal digits in v, which must not contain more than 17 digits. bytestring0Renders NonNumbersAndZero into bounded primitive bytestringPart of the calculation on whether to round up the decimal representation. This is currently a constant function to match behavior in Base  and is implemented as acceptBounds _ = False +For round-to-even and correct shortest, use +acceptBounds v = ((v `quot` 4) .&. 1) == 0  bytestring%Boxed versions of the functions above bytestring%Boxed versions of the functions above bytestring%Boxed versions of the functions above bytestringReturns w / 10 bytestringReturns w % 10 bytestringReturns w / 5 bytestringReturns w % 5 bytestringReturns w / 10 bytestringReturns w / 100 bytestringReturns (w / 10, w % 10) bytestringReturns w / 5 bytestringReturns w % 5 bytestringBoxed version of  for 64 bits bytestringReturns the number of times w is divisible by 5 bytestringReturns True if value is divisible by 5^p bytestringReturns True if value is divisible by 2^p bytestringTrim digits and update bookkeeping state when the table-computed step results in trailing zeros (the general case, happens rarely)NB: This function isn't actually necessary so long as acceptBounds is always False since we don't do anything different with the trailing-zero information directly: - vuIsTrailingZeros is always False. We can see this by noting that in all places where vuTrailing can possible be True, we must have acceptBounds be True (accept_smaller) - The final result doesn't change the lastRemovedDigit for rounding anyway bytestringTrim digits and update bookkeeping state when the table-computed step results has no trailing zeros (common case) bytestringReturns the correctly rounded decimal representation mantissa based on if we need to round up (next decimal place >= 5) or if we are outside the bounds bytestring0Index into the 64-bit word lookup table provided bytestring;Index into the 128-bit word lookup table provided Return ( high-64-bits , low-64-bits ) NB: really just swaps the bytes and doesn't reorder the words bytestringReturns the decimal representation of a floating point number in scientific (exponential) notation?(c) Don Stewart 2006-2008 (c) Duncan Coutts 2006-2011 BSD-style.dons00@gmail.com, duncan@community.haskell.orgunstable non-portableUnsafe3;d  bytestring%Type synonym for the lazy flavour of . bytestring&A space-efficient representation of a / vector, supporting many efficient operations.A lazy 8 contains 8-bit bytes, or by using the operations from Data.ByteString.Lazy.Char87 it can be interpreted as containing 8-bit characters. bytestring5The data type invariant: Every ByteString is either  or consists of non-null Ts. All functions must preserve this, and the QC properties must check this. bytestring+In a form that checks the invariant lazily. bytestringSmart constructor for %. Guarantees the data type invariant. bytestringConsume the chunks of a lazy ByteString with a natural right fold. bytestringConsume the chunks of a lazy ByteString with a strict, tail-recursive, accumulating left fold. bytestringThe chunk size used for I/O. Currently set to 32k, less the memory management overhead bytestringThe recommended chunk size. Currently set to 4k, less the memory management overhead bytestringThe memory management overhead. Currently this is tuned for GHC only. bytestringO(1) Convert a strict  into a lazy . bytestringO(n) Convert a lazy  into a strict .Note that this is an  expensive operation that forces the whole lazy ByteString into memory and then copies all the data. If possible, try to avoid converting back and forth between strict and lazy bytestrings. bytestringBeware:  truncates multi-byte characters to octets. e.g. "````a`a`" becomes 6knh~Qn  bytestring /(c) Duncan Coutts 2012-2013, Julian Ospald 2022 BSD-stylehasufell@posteo.destableghc onlyUnsafe 3B bytestringA compact representation of a  vector.&It has a lower memory overhead than a T and does not contribute to heap fragmentation. It can be converted to or from a T (at the cost of copying the string data). It supports very few other operations.It is suitable for use as an internal representation for code that needs to keep many short strings in memory, but it  should not be used as an interchange type. That is, it should not generally be used in public APIs. The T type is usually more suitable for use in interfaces; it is more flexible and it supports a wide range of operations. bytestringO(1) . The empty . bytestringO(1) The length of a . bytestringO(1) Test whether a  is empty. bytestringO(1) - index (subscript) operator, starting from 0.  bytestringO(1) & index, starting from 0, that returns  if: 0 <= n < length bs  bytestringO(1) & index, starting from 0, that returns  if: 0 <= n < length bs bytestringO(n) . Convert a T into a .7This makes a copy, so does not retain the input string. bytestringO(n) . Convert a  into a T.  bytestringO(1) Convert a  into a  bytestringO(n). Convert a list into a  bytestringO(n) . Convert a  into a list.  bytestringO(n) Append a byte to the end of a "Note: copies the entire byte array  bytestringO(n)  is analogous to (:) for lists."Note: copies the entire byte array  bytestringO(1) Extract the last element of a ShortByteString, which must be finite and non-empty. An exception will be thrown in the case of an empty ShortByteString.+This is a partial function, consider using  instead.  bytestringO(n) Extract the elements after the head of a ShortByteString, which must be non-empty. An exception will be thrown in the case of an empty ShortByteString.+This is a partial function, consider using  instead."Note: copies the entire byte array  bytestringO(n) Extract the head and tail of a ByteString, returning Nothing if it is empty.  bytestringO(1) Extract the first element of a ShortByteString, which must be non-empty. An exception will be thrown in the case of an empty ShortByteString.+This is a partial function, consider using  instead.  bytestringO(n) Return all the elements of a  except the last one. An exception will be thrown in the case of an empty ShortByteString.+This is a partial function, consider using  instead."Note: copies the entire byte array  bytestringO(n) Extract the  and 4 of a ByteString, returning Nothing if it is empty.  bytestringO(n)  f xs- is the ShortByteString obtained by applying f to each element of xs.  bytestringO(n)  xs% efficiently returns the elements of xs in reverse order.  bytestringO(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.  bytestring, applied to a binary operator, a starting value (typically the left-identity of the operator), and a ShortByteString, reduces the ShortByteString using the binary operator, from left to right.  bytestring is like  , but strict in the accumulator.  bytestring, applied to a binary operator, a starting value (typically the right-identity of the operator), and a ShortByteString, reduces the ShortByteString using the binary operator, from right to left.  bytestring is like  , but strict in the accumulator.  bytestring is a variant of  that has no starting value argument, and thus must be applied to non-empty s. An exception will be thrown in the case of an empty ShortByteString.  bytestring is like , but strict in the accumulator. An exception will be thrown in the case of an empty ShortByteString.  bytestring is a variant of  that has no starting value argument, and thus must be applied to non-empty s An exception will be thrown in the case of an empty ShortByteString.  bytestring is a variant of $, but is strict in the accumulator.  bytestringO(n) Applied to a predicate and a , $ determines if all elements of the  satisfy the predicate.  bytestringO(n)* Applied to a predicate and a ByteString, # determines if any element of the T satisfies the predicate.  bytestringO(n)  n, applied to a ShortByteString xs, returns the prefix of xs of length n, or xs itself if n >  xs."Note: copies the entire byte array  bytestring Similar to , returns the longest (possibly empty) prefix of elements satisfying the predicate.  bytestringO(n)  n xs is equivalent to  ( xs - n) xs . Takes n! elements from end of bytestring.takeEnd 3 "abcdefg""efg"takeEnd 0 "abcdefg"""takeEnd 4 "abc""abc"  bytestringReturns the longest (possibly empty) suffix of elements satisfying the predicate. p is equivalent to  .  p . .  bytestringO(n)  n xs returns the suffix of xs after the first n elements, or [] if n >  xs."Note: copies the entire byte array  bytestringO(n)  n xs is equivalent to  ( xs - n) xs . Drops n! elements from end of bytestring.dropEnd 3 "abcdefg""abcd"dropEnd 0 "abcdefg" "abcdefg"dropEnd 4 "abc"""  bytestring Similar to  , drops the longest (possibly empty) prefix of elements satisfying the predicate and returns the remainder."Note: copies the entire byte array  bytestring Similar to !, drops the longest (possibly empty) suffix of elements satisfying the predicate and returns the remainder. p is equivalent to  .  p . .  bytestring>Returns the longest (possibly empty) suffix of elements which do not8 satisfy the predicate and the remainder of the string. p is equivalent to  (not . p) and to ( (not . p) &&&  (not . p)).  bytestring Similar to ", returns the longest (possibly empty) prefix of elements which do not8 satisfy the predicate and the remainder of the string. p is equivalent to  (not . p) and to ( (not . p) &&&  (not . p)).  bytestring Similar to #, returns the longest (possibly empty) prefix of elements satisfying the predicate and the remainder of the string. p is equivalent to  (not . p) and to ( p &&&  p).  bytestringReturns the longest (possibly empty) suffix of elements satisfying the predicate and the remainder of the string. p is equivalent to  (not . p) and to ( p &&&  p).We have 0spanEnd (not . isSpace) "x y z" == ("x y ", "z")and spanEnd (not . isSpace) sbs == let (x, y) = span (not . isSpace) (reverse sbs) in (reverse y, reverse x)  bytestringO(n)  n sbs is equivalent to ( n sbs,  n sbs).Note: copies the substrings  bytestringO(n) Break a  into pieces separated by the byte argument, consuming the delimiter. I.e. split 10 "a\nb\nd\ne" == ["a","b","d","e"] -- fromEnum '\n' == 10 split 97 "aXaXaXa" == ["","X","X","X",""] -- fromEnum 'a' == 97 split 120 "x" == ["",""] -- fromEnum 'x' == 120 split undefined "" == [] -- and not [""]and 9intercalate [c] . split c == id split == splitWith . (==)Note: copies the substrings  bytestringO(n) Splits a  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. splitWith (==97) "aabbaca" == ["","","bb","c",""] -- fromEnum 'a' == 97 splitWith undefined "" == [] -- and not [""]  bytestringO(n) The 1 function takes two ShortByteStrings and returns  the remainder of the second iff the first is its suffix, and otherwise .  bytestringO(n) The 1 function takes two ShortByteStrings and returns  the remainder of the second iff the first is its prefix, and otherwise .  bytestringO(n)  n x is a ByteString of length n with x2 the value of every element. The following holds: .replicate w c = unfoldr w (\u -> Just (u,u)) c  bytestringO(n), where n# is the length of the result. The 0 function is analogous to the List 'unfoldr'.  builds a ShortByteString from a seed value. The function takes the element and returns 9 if it is done producing the ShortByteString or returns  (a,b), in which case, a& is the next byte in the string, and b* is the seed value for further production.=This function is not efficient/safe. It will build a list of [Word8]) and run the generator until it returns 7, otherwise recurse infinitely, then finally create a ./If you know the maximum length, consider using . Examples:  unfoldr (\x -> if x <= 5 then Just (x, x + 1) else Nothing) 0 == pack [0, 1, 2, 3, 4, 5]  bytestringO(n) Like ,  builds a ShortByteString from a seed value. However, the length of the result is limited by the first argument to (. This function is more efficient than 1 when the maximum length of the result is known.The following equation relates  and : ,fst (unfoldrN n f s) == take n (unfoldr f s)  bytestring3Check whether one string is a substring of another.  bytestringO(n) The 1 function takes two ShortByteStrings and returns   bytestringO(n) The 1 function takes two ShortByteStrings and returns * iff the first is a suffix of the second.The following holds: 2isSuffixOf x y == reverse x `isPrefixOf` reverse y  bytestringBreak a string on a substring, returning a pair of the part of the string prior to the match, and the rest of the string.!The following relationships hold: 0break (== c) l == breakSubstring (singleton c) l7For example, to tokenise a string, dropping delimiters: tokenise x y = h : if null t then [] else tokenise x (drop (length x) t) where (h,t) = breakSubstring x y+To skip to the first occurence of a string: snd (breakSubstring x y)1To take the parts of a string before a delimiter: fst (breakSubstring x y)Note that calling `breakSubstring x` does some preprocessing work, so you should avoid unnecessarily duplicating breakSubstring calls with the same pattern.  bytestringO(n)  is the  membership predicate.  bytestringO(n) , applied to a predicate and a ByteString, returns a ByteString containing those characters that satisfy the predicate.  bytestringO(n) The  function takes a predicate and a ByteString, and returns the first element in matching the predicate, or  if there is no such element. find f p = case findIndex f p of Just n -> Just (p ! n) ; _ -> Nothing  bytestringO(n) The  function takes a predicate a ByteString and returns the pair of ByteStrings with elements which do and do not satisfy the predicate, respectively; i.e., 6partition p bs == (filter p sbs, filter (not . p) sbs)  bytestringO(n) The ? function returns the index of the first element in the given * which is equal to the query element, or  if there is no such element.  bytestringO(n) The  function extends , by returning the indices of all elements equal to the query element, in ascending order.  bytestringcount returns the number of times its argument appears in the ShortByteString  bytestringO(n) The " function takes a predicate and a  and returns the index of the first element in the ByteString satisfying the predicate.  bytestringO(n) The  function extends , by returning the indices of all elements satisfying the predicate, in ascending order.  bytestringO(n). Construct a new ShortByteString from a CString. The resulting ShortByteString' is an immutable copy of the original CString4, and is managed on the Haskell heap. The original CString must be null terminated.  bytestringO(n). Construct a new ShortByteString from a  CStringLen. The resulting ShortByteString& is an immutable copy of the original  CStringLen. The ShortByteString is a normal Haskell value and will be managed on the Haskell heap.  bytestringO(n) construction. Use a ShortByteString. with a function requiring a null-terminated CString. The CString is a copy and will be freed automatically; it must not be stored or used after the subcomputation finishes.  bytestringO(n) construction. Use a ShortByteString with a function requiring a  CStringLen . As for  useAsCString, this function makes a copy of the original ShortByteString. It must not be stored or used after the subcomputation finishes.  bytestringO(n) Check whether a  represents valid UTF-8. bytestringBeware:  truncates multi-byte characters to octets. e.g. "````a`a`" becomes 6knh~Qn  bytestring  bytestring bytestringString to search for bytestringString to search in bytestring+Head and tail of string broken at substring bytestring source data bytestringoffset into source bytestring destination bytestringnumber of bytes to copy bytestring source data bytestringnumber of bytes to copy55 /(c) Duncan Coutts 2012-2013, Julian Ospald 2022 BSD-stylehasufell@posteo.destableghc only Trustworthy(c) Don Stewart 2006-2008 (c) Duncan Coutts 2006-2011 BSD-style.dons00@gmail.com, duncan@community.haskell.org provisional non-portableUnsafe bytestring A variety of  for non-empty ByteStrings.  omits the check for the empty case, so there is an obligation on the programmer to provide a proof that the ByteString is non-empty. bytestring A variety of  for non-empty ByteStrings. . omits the check for the empty case. As with , the programmer must provide a separate proof that the ByteString is non-empty. bytestring A variety of  for non-empty ByteStrings. . omits the check for the empty case. As with , the programmer must provide a separate proof that the ByteString is non-empty. bytestring A variety of  for non-empty ByteStrings. . omits the check for the empty case. As with , the programmer must provide a separate proof that the ByteString is non-empty. bytestringUnsafe T: index (subscript) operator, starting from 0, returning a  This omits the bounds check, which means there is an accompanying obligation on the programmer to ensure the bounds are checked in some other way. bytestring A variety of  which omits the checks on n so there is an obligation on the programmer to provide a proof that  0 <= n <=  xs. bytestring A variety of  which omits the checks on n so there is an obligation on the programmer to provide a proof that  0 <= n <=  xs. bytestringO(1) ) provides constant-time construction of Ts, which is ideal for string literals. It packs a sequence of bytes into a T, given a raw . to the string, and the length of the string.This function is unsafe in two ways:the length argument is assumed to be correct. If the length argument is incorrect, it is possible to overstep the end of the byte array.if the underlying  is later modified, this change will be reflected in the resulting T%, breaking referential transparency.%If in doubt, don't use this function. bytestringO(1) Construct a T given a Ptr Word8 to a buffer, a length, and an IO action representing a finalizer. This function is not available on Hugs.This function is unsafe, it is possible to break referential transparency by modifying the underlying buffer pointed to by the first argument. Any changes to the original buffer will be reflected in the resulting T. bytestring/Explicitly run the finaliser associated with a T. References to this value after finalisation may generate invalid memory references.This function is unsafe, as there may be other Ts referring to the same underlying pages. If you use this, you need to have a proof of some kind that all Ts ever generated from the underlying byte array are no longer live. bytestringO(n) Build a T from a . This value will have no finalizer associated to it, and will not be garbage collected by Haskell. The ByteString length is calculated using  strlen(3) , and thus the complexity is a O(n).This function is unsafe . If the  is later modified, this change will be reflected in the resulting T%, breaking referential transparency. bytestringO(1) Build a T from a . This value will have no finalizer associated with it, and will not be garbage collected by Haskell. This operation has O(1)6 complexity as we already know the final size, so no  strlen(3) is required.This function is unsafe. If the original  is later modified, this change will be reflected in the resulting T%, breaking referential transparency. bytestringO(n) Build a T from a malloced . This value will have a free(3) finalizer associated to it.This function is unsafe. If the original  is later modified, this change will be reflected in the resulting T%, breaking referential transparency.This function is also unsafe if you call its finalizer twice, which will result in a  double free error, or if you pass it a  not allocated with $%. bytestringO(1) Build a T from a malloced . This value will have a free(3) finalizer associated to it.This function is unsafe. If the original  is later modified, this change will be reflected in the resulting T%, breaking referential transparency.This function is also unsafe if you call its finalizer twice, which will result in a  double free error, or if you pass it a  not allocated with $%. bytestringO(1) construction Use a T with a function requiring a .6This function does zero copying, and merely unwraps a T to appear as a . It is unsafe in two ways: After calling this function the 6 shares the underlying byte buffer with the original T. Thus modifying the >, either in C, or using poke, will cause the contents of the T6 to change, breaking referential transparency. Other T1s created by sharing (such as those produced via  or 1) will also reflect these changes. Modifying the ; will break referential transparency. To avoid this, use &%, which makes a copy of the original T.s are often passed to functions that require them to be null-terminated. If the original T+ wasn't null terminated, neither will the  be. It is the programmers responsibility to guarantee that the T. is indeed null terminated. If in doubt, use &.The memory may freed at any point after the subcomputation terminates, so the pointer to the storage must *not* be used after this. bytestringO(1) construction Use a T with a function requiring a .6This function does zero copying, and merely unwraps a T to appear as a . It is unsafe: After calling this function the 6 shares the underlying byte buffer with the original T. Thus modifying the >, either in C, or using poke, will cause the contents of the T6 to change, breaking referential transparency. Other T1s created by sharing (such as those produced via  or 1) will also reflect these changes. Modifying the ; will break referential transparency. To avoid this, use '%, which makes a copy of the original T.If ( is given, it will pass ()*, 0).ee(c) The University of Glasgow 2001, (c) David Roundy 2003-2005, (c) Simon Marlow 2005, (c) Bjorn Bringert 2006, (c) Don Stewart 2005-2008, (c) Duncan Coutts 2006-2013 BSD-style.dons00@gmail.com, duncan@community.haskell.orgstableportable Trustworthy% bytestringO(1) Convert a  into a T bytestringO(n) Convert a [] into a T.8For applications with large numbers of string literals, 5 can be a bottleneck. In such cases, consider using e (GHC only). bytestringO(n) Converts a T to a [].  bytestring Convert a  to a T.The  type is expected to use the file system encoding as reported by . This encoding allows for round-tripping of arbitrary data on platforms that allow arbitrary bytes in their paths. This conversion function does the same thing that +, would do when decoding the .This function is in  because the file system encoding can be changed. If the encoding can be assumed to be constant in your use case, you may invoke this function via .  bytestring Convert a T to a .;This function uses the file system encoding, and resulting s can be safely used with standard IO functions and will reference the correct path in the presence of arbitrary non-UTF-8 encoded paths.This function is in  because the file system encoding can be changed. If the encoding can be assumed to be constant in your use case, you may invoke this function via . bytestringO(1)$ Test whether a ByteString is empty. bytestringO(1) * returns the length of a ByteString as an . bytestringO(n)  is analogous to (:) for lists, but of different complexity, as it requires making a copy. bytestringO(n) Append a byte to the end of a T bytestringO(1) Extract the first element of a ByteString, which must be non-empty. An exception will be thrown in the case of an empty ByteString. bytestringO(1) Extract the elements after the head of a ByteString, which must be non-empty. An exception will be thrown in the case of an empty ByteString. bytestringO(1) Extract the head and tail of a ByteString, returning Nothing if it is empty. bytestringO(1) Extract the last element of a ByteString, which must be finite and non-empty. An exception will be thrown in the case of an empty ByteString. bytestringO(1) Return all the elements of a T except the last one. An exception will be thrown in the case of an empty ByteString. bytestringO(1) Extract the  and 4 of a ByteString, returning Nothing if it is empty. bytestringO(n) Append two ByteStrings bytestringO(n)  f xs( is the ByteString obtained by applying f to each element of xs. bytestringO(n)  xs% efficiently returns the elements of xs in reverse order. bytestringO(n) The  function takes a  and a T; and `intersperses' that byte between the elements of the T9. It is analogous to the intersperse function on Lists. bytestringThe 2 function transposes the rows and columns of its T argument. bytestring, applied to a binary operator, a starting value (typically the left-identity of the operator), and a ByteString, reduces the ByteString using the binary operator, from left to right. bytestring is like  , but strict in the accumulator. bytestring, applied to a binary operator, a starting value (typically the right-identity of the operator), and a ByteString, reduces the ByteString using the binary operator, from right to left. bytestring is like  , but strict in the accumulator. bytestring is a variant of  that has no starting value argument, and thus must be applied to non-empty Ts. An exception will be thrown in the case of an empty ByteString. bytestring is like , but strict in the accumulator. An exception will be thrown in the case of an empty ByteString. bytestring is a variant of  that has no starting value argument, and thus must be applied to non-empty Ts An exception will be thrown in the case of an empty ByteString. bytestring is a variant of $, but is strict in the accumulator. bytestringO(n)# Concatenate a list of ByteStrings. bytestringMap a function over a T and concatenate the results bytestringO(n)* Applied to a predicate and a ByteString, # determines if any element of the T satisfies the predicate. bytestringO(n) Applied to a predicate and a T, $ determines if all elements of the T satisfy the predicate. bytestringO(n) " returns the maximum value from a T An exception will be thrown in the case of an empty ByteString. bytestringO(n) " returns the minimum value from a T An exception will be thrown in the case of an empty ByteString. bytestringThe ( function behaves like a combination of  and ; it applies a function to each element of a ByteString, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new list. bytestringThe ( function behaves like a combination of  and ; it applies a function to each element of a ByteString, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new ByteString. bytestring is similar to , but returns a list of successive reduced values from the left. scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...] Note that  Just (u,u)) cThis implementation uses  memset(3) bytestringO(n), where n# is the length of the result. The 0 function is analogous to the List 'unfoldr'.  builds a ByteString from a seed value. The function takes the element and returns 4 if it is done producing the ByteString or returns  (a,b), in which case, a& is the next byte in the string, and b* is the seed value for further production. Examples:  unfoldr (\x -> if x <= 5 then Just (x, x + 1) else Nothing) 0 == pack [0, 1, 2, 3, 4, 5] bytestringO(n) Like ,  builds a ByteString from a seed value. However, the length of the result is limited by the first argument to (. This function is more efficient than 1 when the maximum length of the result is known.The following equation relates  and : ,fst (unfoldrN n f s) == take n (unfoldr f s) bytestringO(1)  n, applied to a ByteString xs, returns the prefix of xs of length n, or xs itself if n >  xs.  bytestringO(1)  n xs is equivalent to  ( xs - n) xs . Takes n! elements from end of bytestring.takeEnd 3 "abcdefg""efg"takeEnd 0 "abcdefg"""takeEnd 4 "abc""abc" bytestringO(1)  n xs returns the suffix of xs after the first n elements, or [] if n >  xs.  bytestringO(1)  n xs is equivalent to  ( xs - n) xs . Drops n! elements from end of bytestring.dropEnd 3 "abcdefg""abcd"dropEnd 0 "abcdefg" "abcdefg"dropEnd 4 "abc""" bytestringO(1)  n xs is equivalent to ( n xs,  n xs). bytestring Similar to , returns the longest (possibly empty) prefix of elements satisfying the predicate.  bytestringReturns the longest (possibly empty) suffix of elements satisfying the predicate. p is equivalent to  .  p . . bytestring Similar to  , drops the longest (possibly empty) prefix of elements satisfying the predicate and returns the remainder.  bytestring Similar to !, drops the longest (possibly empty) suffix of elements satisfying the predicate and returns the remainder. p is equivalent to  .  p . . bytestring Similar to ", returns the longest (possibly empty) prefix of elements which do not8 satisfy the predicate and the remainder of the string. p is equivalent to  (not . p) and to ( (not . p) &&&  (not . p)).Under GHC, a rewrite rule will transform break (==) into a call to the specialised breakByte: 6break ((==) x) = breakByte x break (==x) = breakByte x bytestring>Returns the longest (possibly empty) suffix of elements which do not8 satisfy the predicate and the remainder of the string. p is equivalent to  (not . p) and to ( (not . p) &&&  (not . p)). bytestring Similar to #, returns the longest (possibly empty) prefix of elements satisfying the predicate and the remainder of the string. p is equivalent to  (not . p) and to ( p &&&  p). bytestringReturns the longest (possibly empty) suffix of elements satisfying the predicate and the remainder of the string. p is equivalent to  (not . p) and to ( p &&&  p).We have 0spanEnd (not . isSpace) "x y z" == ("x y ", "z")and spanEnd (not . isSpace) ps == let (x, y) = span (not . isSpace) (reverse ps) in (reverse y, reverse x) bytestringO(n) Splits a T 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. splitWith (==97) "aabbaca" == ["","","bb","c",""] -- fromEnum 'a' == 97 splitWith undefined "" == [] -- and not [""] bytestringO(n) Break a T into pieces separated by the byte argument, consuming the delimiter. I.e. split 10 "a\nb\nd\ne" == ["a","b","d","e"] -- fromEnum '\n' == 10 split 97 "aXaXaXa" == ["","X","X","X",""] -- fromEnum 'a' == 97 split 120 "x" == ["",""] -- fromEnum 'x' == 120 split undefined "" == [] -- and not [""]and 9intercalate [c] . split c == id split == splitWith . (==)As for all splitting functions in this library, this function does not copy the substrings, it just constructs new T#s that are slices of the original. bytestringThe  function takes a ByteString and returns a list of ByteStrings such that the concatenation of the result is equal to the argument. 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. It is about 40% faster than  groupBy (==) bytestringThe + function is the non-overloaded version of . bytestringO(n) The  function takes a T and a list of Ts and concatenates the list after interspersing the first argument between each element of the list. bytestringO(1) T- index (subscript) operator, starting from 0.  bytestringO(1) T& index, starting from 0, that returns  if: 0 <= n < length bs  bytestringO(1) T& index, starting from 0, that returns  if: 0 <= n < length bs bytestringO(n) The ? function returns the index of the first element in the given T* which is equal to the query element, or  if there is no such element. This implementation uses memchr(3). bytestringO(n) The > function returns the last index of the element in the given T* which is equal to the query element, or 3 if there is no such element. The following holds: elemIndexEnd c xs = case elemIndex c (reverse xs) of Nothing -> Nothing Just i -> Just (length xs - 1 - i) bytestringO(n) The  function extends , by returning the indices of all elements equal to the query element, in ascending order. This implementation uses memchr(3). bytestringcount returns the number of times its argument appears in the ByteString count = length . elemIndicesBut more efficiently than using length on the intermediate list. bytestringO(n) The " function takes a predicate and a T and returns the index of the first element in the ByteString satisfying the predicate.  bytestringO(n) The " function takes a predicate and a T and returns the index of the last element in the ByteString satisfying the predicate. bytestringO(n) The  function extends , by returning the indices of all elements satisfying the predicate, in ascending order. bytestringO(n)  is the T membership predicate. bytestringO(n)  is the inverse of  bytestringO(n) , applied to a predicate and a ByteString, returns a ByteString containing those characters that satisfy the predicate. bytestringO(n) The  function takes a predicate and a ByteString, and returns the first element in matching the predicate, or  if there is no such element. find f p = case findIndex f p of Just n -> Just (p ! n) ; _ -> Nothing bytestringO(n) The  function takes a predicate a ByteString and returns the pair of ByteStrings with elements which do and do not satisfy the predicate, respectively; i.e., 4partition p bs == (filter p xs, filter (not . p) xs) bytestringO(n) The , function takes two ByteStrings and returns ) if the first is a prefix of the second.  bytestringO(n) The , function takes two ByteStrings and returns  the remainder of the second iff the first is its prefix, and otherwise . bytestringO(n) The , function takes two ByteStrings and returns * iff the first is a suffix of the second.The following holds: 2isSuffixOf x y == reverse x `isPrefixOf` reverse yHowever, the real implementation uses memcmp to compare the end of the string only, with no reverse required.. bytestringO(n) The , function takes two ByteStrings and returns  the remainder of the second iff the first is its suffix, and otherwise . bytestring3Check whether one string is a substring of another.  bytestringO(n) Check whether a T represents valid UTF-8. bytestringBreak a string on a substring, returning a pair of the part of the string prior to the match, and the rest of the string.!The following relationships hold: 0break (== c) l == breakSubstring (singleton c) l7For example, to tokenise a string, dropping delimiters: tokenise x y = h : if null t then [] else tokenise x (drop (length x) t) where (h,t) = breakSubstring x y+To skip to the first occurence of a string: snd (breakSubstring x y)1To take the parts of a string before a delimiter: fst (breakSubstring x y)Note that calling `breakSubstring x` does some preprocessing work, so you should avoid unnecessarily duplicating breakSubstring calls with the same pattern. bytestringO(n)  takes two ByteStrings and returns a list of corresponding pairs of bytes. If one input ByteString is short, excess elements of the longer ByteString are discarded. This is equivalent to a pair of  operations. bytestring generalises  by zipping with the function given as the first argument, instead of a tupling function. For example,  (+) is applied to two ByteStrings to produce the list of corresponding sums.  bytestringA specialised version of  for the common case of a simultaneous map over two ByteStrings, to build a 3rd. bytestringO(n)  transforms a list of pairs of bytes into a pair of ByteStrings. Note that this performs two  operations. bytestringO(n)* Return all initial segments of the given T, shortest first. bytestringO(n)( Return all final segments of the given T, longest first. bytestringO(n)4 Sort a ByteString efficiently, using counting sort. bytestringO(n) construction Use a  ByteString. with a function requiring a null-terminated CString. The CString is a copy and will be freed automatically; it must not be stored or used after the subcomputation finishes. bytestringO(n) construction Use a  ByteString with a function requiring a  CStringLen . As for  useAsCString, this function makes a copy of the original  ByteString. It must not be stored or used after the subcomputation finishes. bytestringO(n). Construct a new  ByteString from a CString. The resulting  ByteString' is an immutable copy of the original CString4, and is managed on the Haskell heap. The original CString must be null terminated. bytestringO(n). Construct a new  ByteString from a  CStringLen. The resulting  ByteString& is an immutable copy of the original  CStringLen. The  ByteString is a normal Haskell value and will be managed on the Haskell heap. bytestringO(n) Make a copy of the T with its own storage. This is mainly useful to allow the rest of the data pointed to by the T to be garbage collected, for example if a large string has been read in, and only a small part of it is needed in the rest of the program. bytestringRead a line from stdin. bytestringRead a line from a handle bytestring Outputs a T to the specified . bytestring Similar to  except that it will never block. Instead it returns any tail that did not get written. This tail may be  in the case that the whole string was written, or the whole original string if nothing was written. Partial writes are also possible.Note: on Windows and with Haskell implementation other than GHC, this function does not work correctly; it behaves identically to . bytestringA synonym for hPut, for compatibility bytestringWrite a ByteString to stdout bytestringRead a T directly from the specified . This is far more efficient than reading the characters into a  and then using . First argument is the Handle to read from, and the second is the number of bytes to read. It returns the bytes read, up to n, or  if EOF has been reached. is implemented in terms of .If the handle is a pipe or socket, and the writing end is closed, # will behave as if EOF was reached. bytestringhGetNonBlocking is similar to , except that it will never block waiting for data to become available, instead it returns only whatever data is available. If there is no data available to be read,  returns .Note: on Windows and with Haskell implementation other than GHC, this function does not work correctly; it behaves identically to . bytestringLike , except that a shorter T may be returned if there are not enough bytes immediately available to satisfy the whole request.  only blocks if there is no data available, and EOF has not yet been reached. bytestring0Read a handle's entire contents strictly into a T.This function reads chunks at a time, increasing the chunk size on each read. The final string is then reallocated to the appropriate size. For files > half of available memory, this may lead to memory exhaustion. Consider using  in this case.The Handle is closed once the contents have been read, or if an exception is thrown. bytestringgetContents. Read stdin strictly. Equivalent to hGetContents stdin The - is closed after the contents have been read. bytestring/The interact function takes a function of type ByteString -> ByteString as its argument. The entire input from the standard input device is passed to this function as its argument, and the resulting string is output on the standard output device. bytestring$Read an entire file strictly into a T. bytestringWrite a T to a file. bytestring Append a T to a file. bytestring)accumulator -> element -> new accumulator bytestringstarting value of accumulator bytestringinput of length n bytestringoutput of length n+1 bytestring)element -> accumulator -> new accumulator bytestringstarting value of accumulator bytestringinput of length n bytestringoutput of length n+1 bytestringString to search for bytestringString to search in bytestring+Head and tail of string broken at substringSTTS55- Safe-Inferred bytestringTotal length in bytes ?(c) Don Stewart 2006 (c) Duncan Coutts 2006-2011 BSD-style.dons00@gmail.com, duncan@community.haskell.orgstableportable Trustworthy_2 bytestringO(1) The empty  bytestringO(1) Convert a  into a  bytestringO(n) Convert a '[Word8]' into a . bytestringO(n) Converts a  to a '[Word8]'. bytestringO(c) Convert a list of strict  into a lazy  bytestringO(c) Convert a lazy  into a list of strict  bytestringO(1)$ Test whether a ByteString is empty. bytestringO(c) * returns the length of a ByteString as an  bytestringO(1)  is analogous to . for lists. bytestringO(1) Unlike ,  is strict in the ByteString that we are consing onto. More precisely, it forces the head and the first chunk. It does this because, for space efficiency, it may coalesce the new byte onto the first 'chunk' rather than starting a new 'chunk'.So that means you can't use a lazy recursive contruction like this: let xs = cons' c xs in xsYou can however use  , as well as  and &, to build infinite lazy ByteStrings. bytestringO(n/c) Append a byte to the end of a  bytestringO(1) Extract the first element of a ByteString, which must be non-empty. bytestringO(1) Extract the head and tail of a ByteString, returning Nothing if it is empty. bytestringO(1) Extract the elements after the head of a ByteString, which must be non-empty. bytestringO(n/c) Extract the last element of a ByteString, which must be finite and non-empty. bytestringO(n/c) Return all the elements of a  except the last one. bytestringO(n/c) Extract the  and 4 of a ByteString, returning Nothing if it is empty.It is no faster than using  and  bytestringO(n/c) Append two ByteStrings bytestringO(n)  f xs( is the ByteString obtained by applying f to each element of xs. bytestringO(n)  xs returns the elements of xs in reverse order. bytestringThe  function takes a  and a ; and `intersperses' that byte between the elements of the 8. It is analogous to the intersperse function on Lists. bytestringThe 2 function transposes the rows and columns of its  argument. bytestring, applied to a binary operator, a starting value (typically the left-identity of the operator), and a ByteString, reduces the ByteString using the binary operator, from left to right. bytestring is like  , but strict in the accumulator. bytestring, applied to a binary operator, a starting value (typically the right-identity of the operator), and a ByteString, reduces the ByteString using the binary operator, from right to left.  bytestring is like  , but strict in the accumulator. bytestring is a variant of  that has no starting value argument, and thus must be applied to non-empty s. bytestring is like  , but strict in the accumulator. bytestring is a variant of  that has no starting value argument, and thus must be applied to non-empty s  bytestring is like  , but strict in the accumulator. bytestringO(n)# Concatenate a list of ByteStrings. bytestringMap a function over a  and concatenate the results bytestringO(n)* Applied to a predicate and a ByteString, # determines if any element of the  satisfies the predicate. bytestringO(n) Applied to a predicate and a , $ determines if all elements of the  satisfy the predicate. bytestringO(n) " returns the maximum value from a  bytestringO(n) " returns the minimum value from a   bytestringO(c)  compares the length of a  to an  bytestringThe ( function behaves like a combination of  and ; it applies a function to each element of a ByteString, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new ByteString. bytestringThe ( function behaves like a combination of  and ; it applies a function to each element of a ByteString, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new ByteString. bytestring is similar to , but returns a list of successive reduced values from the left. scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...] Note that   xs.  bytestringO(c)  n xs is equivalent to  ( xs - n) xs . Takes n! elements from end of bytestring.takeEnd 3 "abcdefg""efg"takeEnd 0 "abcdefg"""takeEnd 4 "abc""abc" bytestringO(n/c)  n xs returns the suffix of xs after the first n elements, or [] if n >  xs.  bytestringO(n)  n xs is equivalent to  ( xs - n) xs . Drops n! elements from end of bytestring.dropEnd 3 "abcdefg""abcd"dropEnd 0 "abcdefg" "abcdefg"dropEnd 4 "abc""" bytestringO(n/c)  n xs is equivalent to ( n xs,  n xs). bytestring Similar to , returns the longest (possibly empty) prefix of elements satisfying the predicate.  bytestringReturns the longest (possibly empty) suffix of elements satisfying the predicate. p is equivalent to  .  p . . {-# LANGUAGE OverloadedLists #-)takeWhileEnd even [1,2,3,4,6][4,6] bytestring Similar to  , drops the longest (possibly empty) prefix of elements satisfying the predicate and returns the remainder.  bytestring Similar to !, drops the longest (possibly empty) suffix of elements satisfying the predicate and returns the remainder. p is equivalent to  .  p . . {-# LANGUAGE OverloadedLists #-)dropWhileEnd even [1,2,3,4,6][1,2,3] bytestring Similar to ", returns the longest (possibly empty) prefix of elements which do not8 satisfy the predicate and the remainder of the string. p is equivalent to  (not . p) and to ( (not . p) &&&  (not . p)).  bytestring>Returns the longest (possibly empty) suffix of elements which do not8 satisfy the predicate and the remainder of the string. p is equivalent to  (not . p) and to ( (not . p) &&&  (not . p)). bytestring Similar to #, returns the longest (possibly empty) prefix of elements satisfying the predicate and the remainder of the string. p is equivalent to  (not . p) and to ( p &&&  p).  bytestringReturns the longest (possibly empty) suffix of elements satisfying the predicate and the remainder of the string. p is equivalent to  (not . p) and to ( p &&&  p).We have 0spanEnd (not . isSpace) "x y z" == ("x y ", "z")and spanEnd (not . isSpace) ps == let (x, y) = span (not . isSpace) (reverse ps) in (reverse y, reverse x) bytestringO(n) Splits a  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. splitWith (==97) "aabbaca" == ["","","bb","c",""] -- fromEnum 'a' == 97 splitWith undefined "" == [] -- and not [""] bytestringO(n) Break a  into pieces separated by the byte argument, consuming the delimiter. I.e. split 10 "a\nb\nd\ne" == ["a","b","d","e"] -- fromEnum '\n' == 10 split 97 "aXaXaXa" == ["","X","X","X",""] -- fromEnum 'a' == 97 split 120 "x" == ["",""] -- fromEnum 'x' == 120 split undefined "" == [] -- and not [""]and 9intercalate [c] . split c == id split == splitWith . (==)As for all splitting functions in this library, this function does not copy the substrings, it just constructs new #s that are slices of the original. bytestringThe  function takes a ByteString and returns a list of ByteStrings such that the concatenation of the result is equal to the argument. 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. bytestringThe + function is the non-overloaded version of . bytestringO(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. bytestringO(c) - index (subscript) operator, starting from 0.  bytestringO(c) & index, starting from 0, that returns  if: 0 <= n < length bs  bytestringO(1) & index, starting from 0, that returns  if: 0 <= n < length bs bytestringO(n) The ? function returns the index of the first element in the given * which is equal to the query element, or  if there is no such element. This implementation uses memchr(3).  bytestringO(n) The > function returns the last index of the element in the given * which is equal to the query element, or 3 if there is no such element. The following holds: elemIndexEnd c xs = case elemIndex c (reverse xs) of Nothing -> Nothing Just i -> Just (length xs - 1 - i) bytestringO(n) The  function extends , by returning the indices of all elements equal to the query element, in ascending order. This implementation uses memchr(3). bytestringcount returns the number of times its argument appears in the ByteString count = length . elemIndicesBut more efficiently than using length on the intermediate list. bytestringThe " function takes a predicate and a  and returns the index of the first element in the ByteString satisfying the predicate.  bytestringThe " function takes a predicate and a  and returns the index of the last element in the ByteString satisfying the predicate. bytestringO(n) The  function takes a predicate and a ByteString, and returns the first element in matching the predicate, or  if there is no such element. find f p = case findIndex f p of Just n -> Just (p ! n) ; _ -> Nothing bytestringThe  function extends , by returning the indices of all elements satisfying the predicate, in ascending order. bytestringO(n)  is the  membership predicate. bytestringO(n)  is the inverse of  bytestringO(n) , applied to a predicate and a ByteString, returns a ByteString containing those characters that satisfy the predicate. bytestringO(n) The  function takes a predicate a ByteString and returns the pair of ByteStrings with elements which do and do not satisfy the predicate, respectively; i.e., 4partition p bs == (filter p xs, filter (not . p) xs) bytestringO(n) The , function takes two ByteStrings and returns * iff the first is a prefix of the second.  bytestringO(n) The , function takes two ByteStrings and returns  the remainder of the second iff the first is its prefix, and otherwise . bytestringO(n) The , function takes two ByteStrings and returns * iff the first is a suffix of the second.The following holds: 2isSuffixOf x y == reverse x `isPrefixOf` reverse y bytestringO(n) The , function takes two ByteStrings and returns  the remainder of the second iff the first is its suffix, and otherwise . bytestringO(n)  takes two ByteStrings and returns a list of corresponding pairs of bytes. If one input ByteString is short, excess elements of the longer ByteString are discarded. This is equivalent to a pair of  operations. bytestring generalises  by zipping with the function given as the first argument, instead of a tupling function. For example,  (+) is applied to two ByteStrings to produce the list of corresponding sums.  bytestringA specialised version of  for the common case of a simultaneous map over two ByteStrings, to build a 3rd. bytestringO(n)  transforms a list of pairs of bytes into a pair of ByteStrings. Note that this performs two  operations. bytestringO(n)* Return all initial segments of the given , shortest first. bytestringO(n)( Return all final segments of the given , longest first. bytestringO(n) Make a copy of the  with its own storage. This is mainly useful to allow the rest of the data pointed to by the  to be garbage collected, for example if a large string has been read in, and only a small part of it is needed in the rest of the program. bytestringRead entire handle contents lazily into a ;. Chunks are read on demand, using the default chunk size.File handles are closed on EOF if all the file is read, or through garbage collection otherwise. bytestringRead n bytes into a , directly from the specified . bytestringhGetNonBlocking is similar to , except that it will never block waiting for data to become available, instead it returns only whatever data is available. If there is no data available to be read,  returns .Note: on Windows and with Haskell implementation other than GHC, this function does not work correctly; it behaves identically to . bytestringRead an entire file lazily into a .The , will be held open until EOF is encountered.3Note that this function's implementation relies on 3. The reader is advised to read its documentation. bytestringWrite a  to a file. bytestring Append a  to a file. bytestring9getContents. Equivalent to hGetContents stdin. Will read lazily bytestring Outputs a  to the specified . The chunks will be written one at a time. Other threads might write to the  between the writes, and hence 3 alone might not be suitable for concurrent writes. bytestring Similar to  except that it will never block. Instead it returns any tail that did not get written. This tail may be  in the case that the whole string was written, or the whole original string if nothing was written. Partial writes are also possible.Note: on Windows and with Haskell implementation other than GHC, this function does not work correctly; it behaves identically to . bytestringA synonym for hPut, for compatibility bytestringWrite a ByteString to stdout bytestring/The interact function takes a function of type ByteString -> ByteString as its argument. The entire input from the standard input device is passed to this function as its argument, and the resulting string is output on the standard output device. bytestring)accumulator -> element -> new accumulator bytestringstarting value of accumulator bytestringinput of length n bytestringoutput of length n+1 bytestring)element -> accumulator -> new accumulator bytestringstarting value of accumulator bytestringinput of length n bytestringoutput of length n+1555 (c) Don Stewart 2006-2008 (c) Duncan Coutts 2006-2011 BSD-style.dons00@gmail.com, duncan@community.haskell.orgstableportable Trustworthy bytestringO(1) Convert a  into a  bytestringO(n) Convert a  into a . bytestringO(n) Converts a  to a . bytestringO(1)  is analogous to . for lists. bytestringO(1) Unlike ,  is strict in the ByteString that we are consing onto. More precisely, it forces the head and the first chunk. It does this because, for space efficiency, it may coalesce the new byte onto the first 'chunk' rather than starting a new 'chunk'.So that means you can't use a lazy recursive contruction like this: let xs = cons' c xs in xsYou can however use  , as well as  and &, to build infinite lazy ByteStrings. bytestringO(n) Append a Char to the end of a . Similar to ", this function performs a memcpy. bytestringO(1) Extract the first element of a ByteString, which must be non-empty. bytestringO(1) Extract the head and tail of a ByteString, returning Nothing if it is empty. bytestringO(n/c) Extract the  and 4 of a ByteString, returning Nothing if it is empty. bytestringO(1) Extract the last element of a packed string, which must be non-empty. bytestringO(n)  f xs( is the ByteString obtained by applying f to each element of xs bytestringO(n) The  function takes a Char and a < and `intersperses' that Char between the elements of the 8. It is analogous to the intersperse function on Lists. bytestring, applied to a binary operator, a starting value (typically the left-identity of the operator), and a ByteString, reduces the ByteString using the binary operator, from left to right. bytestring. is like foldl, but strict in the accumulator. bytestring, applied to a binary operator, a starting value (typically the right-identity of the operator), and a packed string, reduces the packed string using the binary operator, from right to left.  bytestring is like  , but strict in the accumulator. bytestring is a variant of  that has no starting value argument, and thus must be applied to non-empty s. bytestring is like  , but strict in the accumulator. bytestring is a variant of  that has no starting value argument, and thus must be applied to non-empty s  bytestring is like  , but strict in the accumulator. bytestringMap a function over a  and concatenate the results bytestring)Applied to a predicate and a ByteString, # determines if any element of the  satisfies the predicate. bytestringApplied to a predicate and a , $ determines if all elements of the  satisfy the predicate. bytestring" returns the maximum value from a  bytestring" returns the minimum value from a  bytestring is similar to , but returns a list of successive reduced values from the left. 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.  bytestring is a variant of % that has no starting value argument. .scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]  bytestring is similar to , but returns a list of successive reduced values from the right. scanr f z [..., x{n-1}, xn] == [..., x{n-1} `f` (xn `f` z), xn `f` z, z] Note that  function returns the last index of the element in the given * which is equal to the query element, or 3 if there is no such element. The following holds: elemIndexEnd c xs = case elemIndex c (reverse xs) of Nothing -> Nothing Just i -> Just (length xs - 1 - i) bytestringO(n) The  function extends , by returning the indices of all elements equal to the query element, in ascending order. bytestringThe " function takes a predicate and a  and returns the index of the first element in the ByteString satisfying the predicate.  bytestringThe " function takes a predicate and a  and returns the index of the last element in the ByteString satisfying the predicate. bytestringThe  function extends , by returning the indices of all elements satisfying the predicate, in ascending order. bytestringcount returns the number of times its argument appears in the ByteString ?count == length . elemIndices count '\n' == length . linesBut more efficiently than using length on the intermediate list. bytestringO(n)  is the 1 membership predicate. This implementation uses  memchr(3). bytestringO(n)  is the inverse of  bytestringO(n) , applied to a predicate and a ByteString, returns a ByteString containing those characters that satisfy the predicate.  bytestring bytestringO(n) The  function takes a predicate and a ByteString, and returns the first element in matching the predicate, or  if there is no such element. bytestringO(n)  takes two ByteStrings and returns a list of corresponding pairs of Chars. If one input ByteString is short, excess elements of the longer ByteString are discarded. This is equivalent to a pair of  operations, and so space usage may be large for multi-megabyte ByteStrings bytestring generalises  by zipping with the function given as the first argument, instead of a tupling function. For example,  (+) is applied to two ByteStrings to produce the list of corresponding sums.  bytestringA specialised version of  for the common case of a simultaneous map over two ByteStrings, to build a 3rd.  bytestringO(n)  transforms a list of pairs of chars into a pair of ByteStrings. Note that this performs two  operations. bytestring breaks a ByteString up into a list of ByteStrings at newline Chars ('\n'1). The resulting strings do not contain newlines.As of bytestring 0.9.0.3, this function is stricter than its list cousin. Note that it does not regard CR ('\r') as a newline character. bytestring9 joins lines, appending a terminating newline after each.Equivalent to " . Data.List.concatMap (\x -> [x,  '\n']). bytestring breaks a ByteString up into a list of words, which were delimited by Chars representing white space. And tokens isSpace = words bytestringThe  function is analogous to the  function, on words. bytestringreadInt reads an Int from the beginning of the ByteString. If there is no integer at the beginning of the string, it returns Nothing, otherwise it just returns the int read, and the rest of the string.=Note: This function will overflow the Int for large integers. bytestringreadInteger reads an Integer from the beginning of the ByteString. If there is no integer at the beginning of the string, it returns Nothing, otherwise it just returns the int read, and the rest of the string. bytestring8Write a ByteString to a handle, appending a newline byte bytestring6Write a ByteString to stdout, appending a newline byte bytestring)element -> accumulator -> new accumulator bytestringstarting value of accumulator bytestringinput of length n bytestringoutput of length n+1555 (c) Don Stewart 2006-2008 (c) Duncan Coutts 2006-2011 BSD-style.dons00@gmail.com, duncan@community.haskell.orgstableportable Trustworthy| bytestringO(1) Convert a  into a T bytestringO(n) Convert a  into a TFor applications with large numbers of string literals, pack can be a bottleneck. bytestringO(n) Converts a T to a . bytestringO(n)  is analogous to (:) for lists, but of different complexity, as it requires a memcpy. bytestringO(n) Append a Char to the end of a T. Similar to ", this function performs a memcpy. bytestringO(1) Extract the head and tail of a ByteString, returning Nothing if it is empty. bytestringO(1) Extract the  and 4 of a ByteString, returning Nothing if it is empty. bytestringO(1) Extract the first element of a ByteString, which must be non-empty. bytestringO(1) Extract the last element of a packed string, which must be non-empty. bytestringO(n)  f xs( is the ByteString obtained by applying f to each element of xs bytestringO(n) The  function takes a Char and a T< and `intersperses' that Char between the elements of the T8. It is analogous to the intersperse function on Lists. bytestring, applied to a binary operator, a starting value (typically the left-identity of the operator), and a ByteString, reduces the ByteString using the binary operator, from left to right. bytestring. is like foldl, but strict in the accumulator. bytestring, applied to a binary operator, a starting value (typically the right-identity of the operator), and a packed string, reduces the packed string using the binary operator, from right to left. bytestring is a strict variant of foldr bytestring is a variant of  that has no starting value argument, and thus must be applied to non-empty Ts. bytestringA strict version of  bytestring is a variant of  that has no starting value argument, and thus must be applied to non-empty Ts bytestringA strict variant of foldr1 bytestringMap a function over a T and concatenate the results bytestring)Applied to a predicate and a ByteString, # determines if any element of the T satisfies the predicate. bytestringApplied to a predicate and a T, $ determines if all elements of the T satisfy the predicate. bytestring" returns the maximum value from a T bytestring" returns the minimum value from a T bytestringThe ( function behaves like a combination of  and ; it applies a function to each element of a ByteString, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new list. bytestringThe ( function behaves like a combination of  and ; it applies a function to each element of a ByteString, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new ByteString. bytestring is similar to , but returns a list of successive reduced values from the left: 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. bytestring is a variant of % that has no starting value argument: .scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...] bytestring)scanr is the right-to-left dual of scanl. bytestring is a variant of % that has no starting value argument. bytestringO(n)  n x is a ByteString of length n with x2 the value of every element. The following holds: .replicate w c = unfoldr w (\u -> Just (u,u)) cThis implementation uses  memset(3) bytestringO(n), where n# is the length of the result. The 0 function is analogous to the List 'unfoldr'.  builds a ByteString from a seed value. The function takes the element and returns 4 if it is done producing the ByteString or returns  (a,b), in which case, a+ is the next character in the string, and b* is the seed value for further production. Examples: unfoldr (\x -> if x <= '9' then Just (x, succ x) else Nothing) '0' == "0123456789" bytestringO(n) Like ,  builds a ByteString from a seed value. However, the length of the result is limited by the first argument to (. This function is more efficient than 1 when the maximum length of the result is known.The following equation relates  and : &unfoldrN n f s == take n (unfoldr f s) bytestring, applied to a predicate p and a ByteString xs2, returns the longest prefix (possibly empty) of xs of elements that satisfy p.  bytestring, applied to a predicate p and a ByteString xs2, returns the longest suffix (possibly empty) of xs of elements that satisfy p. bytestring p xs$ returns the suffix remaining after  p xs.  bytestring p xs$ returns the prefix remaining after  p xs. bytestring p is equivalent to  ( . p). bytestring p xs? breaks the ByteString into two segments. It is equivalent to ( p xs,  p xs) bytestring behaves like  but from the end of the T . We have -spanEnd (not.isSpace) "x y z" == ("x y ","z")and spanEnd (not . isSpace) ps == let (x,y) = span (not.isSpace) (reverse ps) in (reverse y, reverse x) bytestring behaves like  but from the end of the TbreakEnd p == spanEnd (not.p) bytestringO(n) Break a T into pieces separated by the byte argument, consuming the delimiter. I.e. split '\n' "a\nb\nd\ne" == ["a","b","d","e"] split 'a' "aXaXaXa" == ["","X","X","X",""] split 'x' "x" == ["",""] split undefined "" == [] -- and not [""]and 9intercalate [c] . split c == id split == splitWith . (==)As for all splitting functions in this library, this function does not copy the substrings, it just constructs new T#s that are slices of the original. bytestringO(n) Splits a T 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. splitWith (=='a') "aabbaca" == ["","","bb","c",""] splitWith undefined "" == [] -- and not [""] bytestringThe + function is the non-overloaded version of . bytestringO(1) T- index (subscript) operator, starting from 0.  bytestringO(1) T& index, starting from 0, that returns  if: 0 <= n < length bs  bytestringO(1) T& index, starting from 0, that returns  if: 0 <= n < length bs bytestringO(n) The ? function returns the index of the first element in the given T6 which is equal (by memchr) to the query element, or  if there is no such element. bytestringO(n) The > function returns the last index of the element in the given T* which is equal to the query element, or 3 if there is no such element. The following holds: elemIndexEnd c xs = case elemIndex c (reverse xs) of Nothing -> Nothing Just i -> Just (length xs - 1 - i) bytestringO(n) The  function extends , by returning the indices of all elements equal to the query element, in ascending order. bytestringThe " function takes a predicate and a T and returns the index of the first element in the ByteString satisfying the predicate.  bytestringO(n) The " function takes a predicate and a T and returns the index of the last element in the ByteString satisfying the predicate. bytestringThe  function extends , by returning the indices of all elements satisfying the predicate, in ascending order. bytestringcount returns the number of times its argument appears in the ByteString count = length . elemIndicesAlso count '\n' == length . linesBut more efficiently than using length on the intermediate list. bytestringO(n)  is the T1 membership predicate. This implementation uses  memchr(3). bytestringO(n)  is the inverse of  bytestringO(n) , applied to a predicate and a ByteString, returns a ByteString containing those characters that satisfy the predicate.  bytestring bytestringO(n) The  function takes a predicate and a ByteString, and returns the first element in matching the predicate, or  if there is no such element. bytestringO(n)  takes two ByteStrings and returns a list of corresponding pairs of Chars. If one input ByteString is short, excess elements of the longer ByteString are discarded. This is equivalent to a pair of  operations, and so space usage may be large for multi-megabyte ByteStrings bytestring generalises  by zipping with the function given as the first argument, instead of a tupling function. For example,  (+) is applied to two ByteStrings to produce the list of corresponding sums.  bytestringA specialised version of  for the common case of a simultaneous map over two ByteStrings, to build a 3rd. bytestring transforms a list of pairs of Chars into a pair of ByteStrings. Note that this performs two  operations.  bytestring efficiently returns the T argument with white space Chars removed from the front. It is more efficient than calling dropWhile for removing whitespace. I.e. dropWhile isSpace == dropSpace  bytestring/Remove leading and trailing white space from a T. bytestring breaks a ByteString up into a list of ByteStrings at newline Chars ('\n'1). The resulting strings do not contain newlines. Note that it does not regard CR ('\r') as a newline character. bytestring9 joins lines, appending a terminating newline after each.Equivalent to " . Data.List.concatMap (\x -> [x,  '\n']). bytestring breaks a ByteString up into a list of words, which were delimited by Chars representing white space. bytestringThe  function is analogous to the  function, on words. bytestringreadInt reads an Int from the beginning of the ByteString. If there is no integer at the beginning of the string, it returns Nothing, otherwise it just returns the int read, and the rest of the string.=Note: This function will overflow the Int for large integers. bytestringreadInteger reads an Integer from the beginning of the ByteString. If there is no integer at the beginning of the string, it returns Nothing, otherwise it just returns the int read, and the rest of the string. bytestring8Write a ByteString to a handle, appending a newline byte bytestring6Write a ByteString to stdout, appending a newline byteTT55 (c) 2010 - 2011 Simon MeierBSD3-style (see LICENSE) Simon Meier unstable, privateGHCUnsafe1 bytestring+A buffer allocation strategy for executing s. bytestringA  action denotes a computation of a value that writes a stream of bytes as a side-effect. s are strict in their side-effect; i.e., the stream of bytes will always be written before the computed value is returned.s are a generalization of s. The typical use case is the implementation of an encoding that might fail (e.g., an interface to the  (https://hackage.haskell.org/package/zlibzlib compression library or the conversion from Base64 encoded data to 8-bit data). For a , the only way to handle and report such a failure is ignore it or call . In contrast,  actions are expressive enough to allow reportng and handling such a failure in a pure fashion. () actions are isomorphic to s. The functions  and  convert between these two types. Where possible, you should use ;s, as sequencing them is slightly cheaper than sequencing 4s because they do not carry around a computed value. bytestring's denote sequences of bytes. They are  s where $ is the zero-length sequence and ! is concatenation, which runs in O(1). bytestring&s abstract signals to the caller of a . There are three signals: , , or 'insertChunks signals bytestrings may be called *multiple times* and they must not rise an async. exception. bytestring/A stream of chunks that are constructed in the  monad.This datatype serves as the common interface for the buffer-by-buffer execution of a  by '. Typical users of this interface are # or iteratee-style libraries like  enumerator. bytestring:The partially filled last buffer together with the result. bytestringYield a  non-empty strict T. bytestringA  together with the  of free bytes. The filled space starts at offset 0 and ends at the first free byte. bytestringA range of bytes in a buffer represented by the pointer to the first byte of the range and the pointer to the first byte after the range. bytestring9Combined size of the filled and free space in the buffer. bytestring(Allocate a new buffer of the given size. bytestringConvert the filled part of a  to a strict T. bytestring Convert a  () to a lazy  using . bytestring Convert a 0 to a lazy tuple of the result and the written  using . bytestringSignal that the current " is done and has computed a value. bytestring'Signal that the current buffer is full. bytestringSignal that a T# chunk should be inserted directly. bytestringFill a  using a . bytestring Construct a . In contrast to s, !s are referentially transparent. bytestring&The final build step that returns the  signal. bytestringRun a  with the . bytestringRun a . bytestringThe  denoting a zero-length sequence of bytes. This function is only exported for use in rewriting rules. Use  otherwise. bytestringConcatenate two s. This function is only exported for use in rewriting rules. Use  otherwise. bytestring;Flush the current buffer. This introduces a chunk boundary. bytestring Construct a  action. In contrast to s, s are referentially transparent in the sense that sequencing the same  multiple times yields every time the same value with the same side-effect. bytestringRun a . bytestringRun a  as a side-effect of a  () action. bytestring Convert a  () action to a . bytestringRun a - action redirecting the produced output to a .!The output is buffered using the s associated buffer. If this buffer is too small to execute one step of the 9 action, then it is replaced with a large enough buffer. bytestring Execute a  and return the computed result and the bytes written during the computation as a lazy .This function is strict in the computed result and lazy in the writing of the bytes. For example, given infinitePut = sequence_ (repeat (putBuilder (word8 1))) >> return 0 evaluating the expression 'fst $ putToLazyByteString infinitePut 3does not terminate, while evaluating the expression 0L.head $ snd $ putToLazyByteString infinitePut $does terminate and yields the value  1 :: Word8.An illustrative example for these strictness properties is the implementation of Base64 decoding ( #http://en.wikipedia.org/wiki/Base64). *type DecodingState = ... decodeBase64 :: T -> DecodingState -> + (Maybe DecodingState) decodeBase64 = ... "The above function takes a strict T supposed to represent Base64 encoded data and the current decoding state. It writes the decoded bytes as the side-effect of the  and returns the new decoding state, if the decoding of all data in the T- was successful. The checking if the strict T represents Base64 encoded data and the actual decoding are fused. This makes the common case, where all data represents Base64 encoded data, more efficient. It also implies that all data must be decoded before the final decoding state can be returned. s are intended for implementing such fused checking and decoding/encoding, which is reflected in their strictness properties. bytestring Execute a  with a buffer-allocation strategy and a continuation. For example,  is implemented as follows. putToLazyByteString =  (  ) (x -> (x, L.empty))  bytestring n! ensures that there are at least n free bytes for the following . bytestring Construct a  that copies the strict Ts, if it is smaller than the treshold, and inserts it directly otherwise. For example, byteStringThreshold 1024 copies strict Ts whose size is less or equal to 1kb, and inserts them directly otherwise. This implies that the average chunk-size of the generated lazy  may be as low as 513 bytes, as there could always be just a single byte between the directly inserted 1025 byte, strict Ts. bytestring Construct a  that copies the strict T.Use this function to create s from smallish (<= 4kb) T's or if you need to guarantee that the T1 is not shared with the chunks generated by the . bytestring Construct a  that always inserts the strict T directly as a chunk.This implies flushing the output buffer, even if it contains just a single byte. You should therefore use  only for large (> 8kb) Ts. Otherwise, the generated chunks are too fragmented to be processed efficiently afterwards. bytestring Construct a  that copies the 01. bytestring Construct a ( that uses the thresholding strategy of  for each chunk of the lazy . bytestring Construct a  that copies the lazy . bytestring Construct a % that inserts all chunks of the lazy  directly. bytestring Create a 2 denoting the same sequence of bytes as a strict T. The  inserts large Ts directly, but copies small ones to ensure that the generated chunks are large on average. bytestring Create a 0 denoting the same sequence of bytes as a lazy . The " inserts large chunks of the lazy  directly, but copies small ones to ensure that the generated chunks are large on average. bytestringThe maximal size of a T that is copied. 2 * - to guarantee that on average a chunk is of . bytestring6Create a custom allocation strategy. See the code for  and  for examples. bytestring&Use this strategy for generating lazy s whose chunks are discarded right after they are generated. For example, if you just generate them to write them to a network socket. bytestring&Use this strategy for generating lazy s whose chunks are likely to survive one garbage collection. This strategy trims buffers that are filled less than half in order to avoid spilling too much memory. bytestringHeavy inlining. Execute a " with custom execution parameters.This function is inlined despite its heavy code-size to allow fusing with the allocation strategy. For example, the default  execution function 2 is defined as follows. {-# NOINLINE toLazyByteString #-} toLazyByteString = toLazyByteStringWith (   ) L.empty where L.empty is the zero-length lazy .&In most cases, the parameters used by 22 give good performance. A sub-performing case of 2" is executing short (<128 bytes) s. In this case, the allocation overhead for the first 4kb buffer and the trimming cost dominate the cost of executing the ". You can avoid this problem using >toLazyByteStringWith (safeStrategy 128 smallChunkSize) L.emptyThis reduces the allocation and trimming overhead, as all generated s fit into the first buffer and there is no trimming required, if more than 64 bytes and less than 128 bytes are written. bytestring Convert a  to a  stream by executing it on #s allocated according to the given . bytestringNext free byte in current  bytestringComputed value bytestringMinimal size of next . bytestringNext free byte in current . bytestring to run on the next . This & may assume that it is called with a  of at least the required minimal size; i.e., the caller of this  must guarantee this. bytestringNext free byte in current  bytestringChunk to insert. bytestring to run on next  bytestring"Build step to use for filling the . bytestring Handling the  signal bytestring Handling the  signal bytestring Handling the  signal bytestringBuffer range to fill. bytestring"Value computed while filling this . bytestringA function that fills a +, calls the continuation with the updated = once its done, and signals its caller how to proceed using , , or .This function must be referentially transparent; i.e., calling it multiple times with equally sized s must result in the same sequence of bytes being written. If you need mutable state, then you must allocate it anew upon each call of this function. Moroever, this function must call the continuation once its done. Otherwise, concatenation of s does not work. Finally, this function must write to all bytes that it claims it has written. Otherwise, the resulting  is not guaranteed to be referentially transparent and sensitive data might leak. bytestring to run bytestring& that writes the byte stream of this  and signals  upon completion. bytestring to run bytestring Continuation  bytestringA function that fills a +, calls the continuation with the updated  and its computed value once its done, and signals its caller how to proceed using , , or  signals.This function must be referentially transparent; i.e., calling it multiple times with equally sized s must result in the same sequence of bytes being written and the same value being computed. If you need mutable state, then you must allocate it anew upon each call of this function. Moroever, this function must call the continuation once its done. Otherwise, monadic sequencing of s does not work. Finally, this function must write to all bytes that it claims it has written. Otherwise, the resulting  is not guaranteed to be referentially transparent and sensitive data might leak. bytestring Put to run bytestring, that first writes the byte stream of this / and then yields the computed value using the  signal. bytestring to execute bytestringResult and lazy  written as its side-effect bytestring!Buffer allocation strategy to use bytestringContinuation to use for computing the final result and the tail of its side-effect (the written bytes). bytestring to execute bytestringResulting lazy  bytestringBuffer allocation function. If < is given, then a new first buffer should be allocated. If  (oldBuf, minSize), is given, then a buffer with minimal size minSize/ must be returned. The strategy may reuse the oldBuf?, if it can guarantee that this referentially transparent and oldBuf is large enough. bytestringDefault buffer size. bytestring A predicate trim used allocated returning 9, if the buffer should be trimmed before it is returned. bytestringSize of the first buffer bytestringSize of successive buffers bytestringAn allocation strategy that does not trim any of the filled buffers before converting it to a chunk bytestringSize of first buffer bytestringSize of successive buffers bytestringAn allocation strategy that guarantees that at least half of the allocated memory is used for live data bytestring!Buffer allocation strategy to use bytestringLazy + to use as the tail of the generated lazy  bytestring to execute bytestringResulting lazy  bytestring!Buffer allocation strategy to use bytestring to execute66(c) 2010-2011 Simon Meier (c) 2010 Jasper van der JeugtBSD3-style (see LICENSE) Simon Meier GHC TrustworthyD bytestringEncode a value with a . bytestring2Encode a list of values from left-to-right with a . bytestring*Encode a list of values represented as an 34 with a . bytestringHeavy inlining. Encode all bytes of a strict T from left-to-right with a . This function is quite versatile. For example, we can use it to construct a  that maps every byte before copying it to the buffer to be filled. mapToBuilder :: (Word8 -> Word8) -> S.ByteString -> Builder mapToBuilder f = primMapByteStringFixed (contramapF f word8)*We can also use it to hex-encode a strict T as shown by the 56 example above. bytestringHeavy inlining. Encode all bytes of a lazy  from left-to-right with a . bytestring Create a $ that encodes values with the given .We rewrite consecutive uses of 4 such that the bound-checks are fused. For example, 9primBounded (word32 c1) `mappend` primBounded (word32 c2)%is rewritten such that the resulting  checks only once, if ther are at 8 free bytes, instead of checking twice, if there are 4 free bytes. This optimization is not observationally equivalent in a strict sense, as it influences the boundaries of the generated chunks. However, for a user of this library it is observationally equivalent, as chunk boundaries of a lazy  can only be observed through the internal interface. Morevoer, we expect that all primitives write much fewer than 4kb (the default short buffer size). Hence, it is safe to ignore the additional memory spilled due to the more agressive buffer wrapping introduced by this optimization. bytestring Create a 6 that encodes a list of values consecutively using a 7 for each element. This function is more efficient than mconcat . map (primBounded w)or foldMap (primBounded w)9because it moves several variables out of the inner loop. bytestring Create a > that encodes a sequence generated from a seed value using a  for each sequence element. bytestring Create a  that encodes each  of a strict T using a . For example, we can write a  that filters a strict T as follows. 2import qualified Data.ByteString.Builder.Prim as P >filterBS p = P.condB p (P.liftFixedToBounded P.word8) P.emptyB bytestringChunk-wise application of .  bytestring A null-terminated ASCII encoded 78). Null characters are not representable.  bytestring A null-terminated UTF-8 encoded 78%. Null characters can be encoded as  0xc0 0x80. bytestringChar8 encode a . bytestringUTF-8 encode a .  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQR ()+- "35*,.!#46/012$%&'789:;<=>?@ABCDEFGHMNOPIJKLQR9(c) Lawrence Wu 2021 BSD-stylelawrencejwu@gmail.comNone  bytestring%Render a Float in scientific notation bytestringReturns the decimal representation of a Float. NaN and Infinity will return `FloatingDecimal 0 0`:(c) Lawrence Wu 2021 BSD-stylelawrencejwu@gmail.comNone  bytestring&Render a Double in scientific notation bytestringReturns the decimal representation of a Double. NaN and Infinity will return `FloatingDecimal 0 0`(c) Lawrence Wu 2021 BSD-stylelawrencejwu@gmail.comNone   bytestringFormat type for use with  and . bytestring"Returns a rendered Float. Matches 2 in displaying in standard or scientific notation  floatDec =    bytestring#Returns a rendered Double. Matches 2 in displaying in standard or scientific notation  doubleDec =     bytestringStandard notation with n decimal places  bytestringStandard notation with the 'default precision' (decimal places matching )  bytestringScientific notation with 'default precision' (decimal places matching )  bytestringStandard or scientific notation depending on the exponent. Matches   bytestringReturns a rendered Float. Returns the 'shortest' representation in scientific notation and takes an optional precision argument in standard notation. Also see .With standard notation, the precision argument is used to truncate (or extend with 0s) the 'shortest' rendered Float. The 'default precision' does no such modifications and will return as many decimal places as the representation demands.e.g"formatFloat (standard 1) 1.2345e-2"0.0"#formatFloat (standard 10) 1.2345e-2"0.0123450000".formatFloat standardDefaultPrecision 1.2345e-2 "0.01234"formatFloat scientific 12.345 "1.2345e1"formatFloat generic 12.345"12.345"  bytestringReturns a rendered Double. Returns the 'shortest' representation in scientific notation and takes an optional precision argument in standard notation. Also see .With standard notation, the precision argument is used to truncate (or extend with 0s) the 'shortest' rendered Float. The 'default precision' does no such modifications and will return as many decimal places as the representation demands.e.g#formatDouble (standard 1) 1.2345e-2"0.0"$formatDouble (standard 10) 1.2345e-2"0.0123450000"/formatDouble standardDefaultPrecision 1.2345e-2 "0.01234"formatDouble scientific 12.345 "1.2345e1"formatDouble generic 12.345"12.345"  (c) 2010 Jasper Van der Jeugt (c) 2010-2011 Simon MeierBSD3-style (see LICENSE) Simon Meier GHC Trustworthy2 bytestringAfter running a ; action there are three possibilities for what comes next: bytestringThis means we're all done. All the builder data has now been written. bytestringThis indicates that there may be more data to write. It gives you the next  action. You should call that action with an appropriate buffer. The int indicates the minimum# buffer size required by the next 3 action. That is, if you call the next action you must6 supply it with a buffer length of at least this size. bytestringIn addition to the data that has just been written into your buffer by the 9 action, it gives you a pre-existing chunk of data as a T". It also gives you the following  action. It is safe to run this following action using a buffer with as much free space as was left by the previous run action. bytestringA $ represents the result of running a . It unfolds as a sequence of chunks of data. These chunks come in two forms:an IO action for writing the Builder's data into a user-supplied memory buffer.6a pre-existing chunks of data represented by a strict TWhile this is rather low level, it provides you with full flexibility in how the data is written out.The  itself is an IO action: you supply it with a buffer (as a pointer and length) and it will write data into the buffer. It returns a number indicating how many bytes were actually written (which can be 0). It also returns a " which describes what comes next. bytestringTurn a  into its initial  action. bytestringEncode a single native machine . The  is encoded in host order, host endian form, for the machine you're on. On a 64 bit machine the  is an 8 byte value, on a 32 bit machine, 4 bytes. Values encoded this way are not portable to different endian or int sized machines, without conversion. bytestring Encode a * in native host order and host endianness. bytestring Encode a * in native host order and host endianness. bytestring Encode a * in native host order and host endianness. bytestringEncode a single native machine . The  is encoded in host order, host endian form, for the machine you're on. On a 64 bit machine the  is an 8 byte value, on a 32 bit machine, 4 bytes. Values encoded this way are not portable to different endian or word sized machines, without conversion. bytestring Encode a * in native host order and host endianness. bytestring Encode a * in native host order and host endianness. bytestring Encode a * in native host order and host endianness. bytestring Encode a  in native host order. Values encoded this way are not portable to different endian machines, without conversion. bytestring Encode a  in native host order.5(c) 2010 - 2011 Simon MeierBSD3-style (see LICENSE) Simon Meier GHC Trustworthy(K bytestringDecimal encoding of an  using the ASCII digits.e.g. toLazyByteString (int8Dec 42) = "42" toLazyByteString (int8Dec (-1)) = "-1" bytestringDecimal encoding of an  using the ASCII digits. bytestringDecimal encoding of an  using the ASCII digits. bytestringDecimal encoding of an  using the ASCII digits. bytestringDecimal encoding of an  using the ASCII digits. bytestringDecimal encoding of a  using the ASCII digits. bytestringDecimal encoding of a  using the ASCII digits. bytestringDecimal encoding of a  using the ASCII digits. bytestringDecimal encoding of a  using the ASCII digits. bytestringDecimal encoding of a  using the ASCII digits. bytestring#Shortest hexadecimal encoding of a  using lower-case characters. bytestring#Shortest hexadecimal encoding of a  using lower-case characters. bytestring#Shortest hexadecimal encoding of a  using lower-case characters. bytestring#Shortest hexadecimal encoding of a  using lower-case characters. bytestring#Shortest hexadecimal encoding of a  using lower-case characters. bytestring Encode a & using 2 nibbles (hexadecimal digits). bytestring Encode a  using 4 nibbles. bytestring Encode a  using 8 nibbles. bytestring Encode a  using 16 nibbles. bytestring Encode a & using 2 nibbles (hexadecimal digits). bytestring Encode a  using 4 nibbles. bytestring Encode a  using 8 nibbles. bytestring Encode a  using 16 nibbles. bytestringEncode an IEEE  using 8 nibbles. bytestringEncode an IEEE  using 16 nibbles. bytestringEncode each byte of a T$ using its fixed-width hex encoding. bytestringEncode each byte of a lazy $ using its fixed-width hex encoding. bytestringDecimal encoding of an  using the ASCII digits.(c) 2010 Jasper Van der Jeugt (c) 2010 - 2011 Simon MeierBSD3-style (see LICENSE) Simon Meier GHC Trustworthy2 bytestring Execute a + and return the generated chunks as a lazy . The work is performed lazy, i.e., only when a chunk of the lazy  is forced. bytestring Output a  to a . The + is executed directly on the buffer of the . If the buffer is too small (or not present), then it is replaced with a large enough buffer.It is recommended that the  is set to binary and +; mode. See +< and +=.%This function is more efficient than hPut .  because in many cases no buffer allocation has to be done. Moreover, the results of several executions of short s are concatenated in the 9s buffer, therefore avoiding unnecessary buffer flushes.  bytestringWrite a  to a file. Similarly to ., this function is more efficient than using > .  with a file handle. bytestring"Encode a single signed byte as-is. bytestring$Encode a single unsigned byte as-is. bytestring Encode an  in little endian format. bytestring Encode an  in little endian format. bytestring Encode an  in little endian format. bytestring Encode a  in little endian format. bytestring Encode a  in little endian format. bytestring Encode a  in little endian format. bytestring Encode a  in little endian format. bytestring Encode a  in little endian format. bytestring Encode an  in big endian format. bytestring Encode an  in big endian format. bytestring Encode an  in big endian format. bytestring Encode a  in big endian format. bytestring Encode a  in big endian format. bytestring Encode a  in big endian format. bytestring Encode a  in big endian format. bytestring Encode a  in big endian format. bytestringChar7 encode a . bytestringChar7 encode a . bytestringChar8 encode a . bytestringChar8 encode a . bytestringUTF-8 encode a . bytestringUTF-8 encode a . Note that  performs no codepoint validation and consequently may emit invalid UTF-8 if asked (e.g. single surrogates).  bytestring=?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~( 1  (                                        !  " #        4                   & '            4 !"#&'>(4 !"#>                                   4   ! "  #                                                               4    ! " #                                                            (       >                       pqrsefghxy5z5{5|5}5~5555555555555555555556552i^kmo`bduwjln_actv???????????????????????????78?7??????------(-----?????999999::::::*bytestring-0.11.3.0-KnBlAfwQ74b5WrfOo8XBxIData.ByteString.InternalData.ByteString.Builder.Prim%Data.ByteString.Builder.Prim.InternalData.ByteStringData.ByteString.UnsafeData.ByteString.LazyData.ByteString.Lazy.InternalData.ByteString.Builder.Extra Data.ByteString.Builder.InternalData.ByteString.ShortData.ByteString.Short.InternalData.ByteString.Lazy.Char8Data.ByteString.Char8Data.ByteString.Builder!Data.ByteString.Builder.RealFloatchar7,Data.ByteString.Builder.Prim.Internal.Base16.Data.ByteString.Builder.Prim.Internal.Floating#Data.ByteString.Builder.Prim.Binary"Data.ByteString.Builder.Prim.ASCII0Data.ByteString.Builder.RealFloat.TableGeneratorunsafePackAddressLenunsafePackCStringLenunsafePackCStringFinalizerForeign.ForeignPtrmallocForeignPtrBytesSystem.IO.UnsafeunsafePerformIO*Data.ByteString.Builder.RealFloat.InternalPrelude takeWhile dropWhile dropWhileEndbreakspanForeign.Marshal.Allocmalloc useAsCStringuseAsCStringLenempty Foreign.PtrnullPtr System.IOopenFile#Data.ByteString.Lazy.Internal.Deque:PSHShortByteStringtoLazyByteString Data.ListunfoldrData.ByteString.Builder.ASCII byteStringHexForeign.C.StringCString%Data.ByteString.Builder.RealFloat.F2S%Data.ByteString.Builder.RealFloat.D2SBlockBufferinghSetBinaryMode hSetBufferinghPutbaseGHC.ForeignPtrplusForeignPtr BoundedPrim FixedPrimSize>$<>*< fixedPrimsizerunFemptyFpairF contramapFtoBliftFixedToBounded storableToF sizeBound boundedPrim boudedPrimrunB contramapBemptyBpairBeitherBcondBcaseWordSize_32_64$fMonoidalFixedPrim$fContravariantFixedPrim$fMonoidalBoundedPrim$fContravariantBoundedPrimword8word16BEword16LEword32BEword32LEword64BEword64LEwordHost word16Host word32Host word64Hostint8int16BEint16LEint32BEint32LEint64BEint64LEintHost int16Host int32Host int64HostfloatBEfloatLEdoubleBEdoubleLE floatHost doubleHostint8Decint16Decint32Decint64DecintDecword8Dec word16Dec word32Dec word64DecwordDecword8Hex word16Hex word32Hex word64HexwordHex word8HexFixedword16HexFixedword32HexFixedword64HexFixed int8HexFixed int16HexFixed int32HexFixed int64HexFixed floatHexFixeddoubleHexFixedStrictByteString ByteStringBSc_sortc_count c_minimum c_maximum c_intersperse c_reversec_free_finalizerc_strlenPSunsafeWithForeignPtrfindIndexOrLength packBytes packCharsunsafePackLenBytesunsafePackLenCharsunsafePackAddressunsafePackLenAddressunsafePackLiteralunsafePackLenLiteralpackUptoLenBytespackUptoLenChars unpackBytes unpackCharsunpackAppendBytesLazyunpackAppendCharsLazyunpackAppendBytesStrictunpackAppendCharsStrictnullForeignPtrfromForeignPtrfromForeignPtr0 toForeignPtr toForeignPtr0 unsafeCreateunsafeCreateUptoNunsafeCreateUptoN'create createUptoN createUptoN' createAndTrimcreateAndTrim'mallocByteString checkedAddw2cc2w isSpaceWord8 isSpaceChar8accursedUnutterablePerformIOmemchrmemcmpmemcpymemset$fLiftLiftedRepByteString$fDataByteString$fIsStringByteString$fIsListByteString$fReadByteString$fShowByteString$fNFDataByteString$fMonoidByteString$fSemigroupByteString$fOrdByteString$fEqByteStringLazyByteStringEmptyChunk invariantcheckInvariantchunk foldrChunks foldlChunksdefaultChunkSizesmallChunkSize chunkOverhead fromStricttoStrictSBSlengthnullindex indexMaybe!?toShort fromShort singletonpackunpackappendconcatsnocconslasttailunconsheadinitunsnocmapreverse intercalatefoldlfoldl'foldrfoldr'foldl1foldl1'foldr1foldr1'allanytaketakeEnd takeWhileEnddropdropEndbreakEndspanEndsplitAtsplit splitWith stripSuffix stripPrefix replicateunfoldrN isInfixOf isPrefixOf isSuffixOfbreakSubstringelemfilterfind partition elemIndex elemIndicescount findIndex findIndices copyToPtr createFromPtr packCStringpackCStringLen isValidUtf8$fDataShortByteString$fIsStringShortByteString$fIsListShortByteString$fReadShortByteString$fShowShortByteString$fNFDataShortByteString$fMonoidShortByteString$fSemigroupShortByteString$fOrdShortByteString$fEqShortByteString$fLiftLiftedRepShortByteString unsafeHead unsafeTail unsafeInit unsafeLast unsafeIndex unsafeTake unsafeDropunsafeFinalizeunsafePackCStringunsafePackMallocCStringunsafePackMallocCStringLenunsafeUseAsCStringunsafeUseAsCStringLen fromFilePath toFilePath intersperse transpose concatMapmaximumminimum mapAccumL mapAccumRscanlscanl1scanrscanr1groupgroupBy elemIndexEnd findIndexEndnotElemzipzipWith packZipWithunzipinitstailssortcopygetLinehGetLinehPutNonBlockinghPutStrputStrhGethGetNonBlockinghGetSome hGetContents getContentsinteractreadFile writeFile appendFile fromChunkstoChunkscons' compareLengthiteraterepeatcyclelinesunlineswordsunwordsreadInt readInteger hPutStrLnputStrLn dropSpacestripAllocationStrategyPutBuilder BuildSignal BuildStep ChunkIOStreamFinishedYield1Buffer BufferRange bufferSize newBufferbyteStringFromBufferciosUnitToLazyByteStringciosToLazyByteStringdone bufferFull insertChunkfillWithBuildStepbuilderfinalBuildStep runBuilderrunBuilderWithflushputrunPut putBuilderfromPutputToLazyByteStringputToLazyByteStringWith ensureFreebyteStringThresholdbyteStringCopybyteStringInsertshortByteStringlazyByteStringThresholdlazyByteStringCopylazyByteStringInsert byteStringlazyByteStringmaximalCopySizecustomStrategyuntrimmedStrategy safeStrategytoLazyByteStringWithbuildStepToCIOS$fMonoidBuilder$fSemigroupBuilder $fMonadPut$fApplicativePut $fFunctorPut primFixedprimMapListFixedprimUnfoldrFixedprimMapByteStringFixedprimMapLazyByteStringFixed primBoundedprimMapListBoundedprimUnfoldrBoundedprimMapByteStringBoundedprimMapLazyByteStringBoundedcstring cstringUtf8char8charUtf8 FloatFormatfloatDec doubleDecstandardstandardDefaultPrecision scientificgeneric formatFloat formatDouble$fShowFormatModeNextDoneMore BufferWriterlazyByteStringHex integerDec hPutBuilderstring7string8 stringUtf8 $fShowBuilder$fIsStringBuilder Contravariant Data.EitherEitherLeftRight Data.Maybemaybe EncodingTable lowerTableencode8_as_16hencodeFloatViaWord32Fghc-prim GHC.TypesFloatGHC.WordWord32encodeDoubleViaWord64FDoubleWord64Word16WordGHC.IntInt16Int32Int64IntCharInt8Word8float_pow5_inv_bitcountfloat_pow5_bitcountdouble_pow5_bitcountdouble_pow5_inv_bitcountfloat_max_splitfloat_max_inv_splitdouble_max_splitdouble_max_inv_splitGHC.PrimAddr#IOGHC.PtrPtr Data.String fromString BoundsStateMantissaNonNumbersAndZeromask boolToWord32 boolToWord64 int32ToInt intToInt32 word32ToInt word64ToIntword32ToWord64word64ToWord32decimalLength9decimalLength17toCharsNonNumbersAndZero acceptBoundsGHC.Showshowpow5bits log10pow2 log10pow5fquot10frem10fquot5frem5dquot10dquot100 dquotRem10dquot5drem5 timesWord2 timesWord2# pow5_factormultipleOfPowerOf5multipleOfPowerOf2 trimTrailingtrimNoTrailingclosestCorrectlyRounded getWord64At getWord128AttoCharsScientific GHC.FloatcastDoubleToWord64castFloatToWord32 ByteArrayAddrvuvvvwlastRemovedDigitvuIsTrailingZerosvvIsTrailingZerosnegativeexponent_all_onemantissa_non_zero GHC.MaybeJustNothingTrueGHC.List Data.Foldable CStringLenGHC.IOFilePathGHC.IO.EncodinggetFileSystemEncoding GHC.IO.UnsafeGHC.IO.Handle.TypesHandleGHC.BaseStringGHC.IO.Handle.TexthGetBuf byteLengthDequefrontrearpopFrontpopRear GHC.ClassesnotGHC.ErrerrorMonoidmemptymappendunsafeDupablePerformIOf2sf2IntermediateFloatingDecimal fmantissa fexponentd2sd2Intermediate dmantissa dexponentinteger-wired-inGHC.Integer.TypeInteger