%Zb~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcd e f g hijklmn opqrstuvwxyz{|}~         !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~          !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! ! !          """""###### #!#"###$#%#&#'#(#)#*#+#,#-#.#/#0#1#2#3#4#5#6#7#8#9#:#;#<#=#>#?#@#A#B#C#D#E#F#G#H#I#J#K#L#M#N#O#P#Q#R#S#T#U#V$W$X$Y$Z$[$\$]$^$_$`$a$b$c$d%e%f%g%h&i%j&k%l%m%n%o%p%q%r%s%t%u%v%w%x%y%z%{%|&}&~&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&''''''''''''''''''''''''''''(())()))))((((()(()()))))))))))***(((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( (((((((((((((++++++ +!+"+#+$+%+&+'"(")*"+,,,-./012"3"4"5"6"7"8"9":";"<"=">"?"@"A"B"C"D"E"F"G"H"I"J"K"L"M"N"O"P"Q"R"S"T"U"V"W"X"Y"Z"["\"]"^"_"`"a"b"c"d"e"f"g"h"i"j"k"l"m"n"o"p"q"r"s"t"u"v"w"x"y"z"{"|"}"B BSD-style*Nicolas Di Prima <nicolas@primetype.co.uk>statbleportableSafe)0DR##  BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0BDRPinning statusLowlevel BooleanCountOf in bytes type aliasEfor code documentation purpose only, just a simple type alias on Int#)Offset in a bytearray, string, type aliasEfor code documentation purpose only, just a simple type alias on Int#File size in bytes BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone  )0BDR:Flag record whether a specific byte array is pinned or notturn an Int# into a Bool<Since GHC 7.8, boolean primitive don't return Bool but Int#.A version friendly of andI#!A version friendly of quotRemInt#*A version friendly fo copyAddrToByteArray#only available from GHC 7.8*A version friendly fo copyByteArrayToAddr#only available from GHC 7.8*A mkWeak# version that keep working on 8.0,signature change in ghc-prim: * 0.4: mkWeakD :: o -> b -> c -> State RealWorld -> (State RealWorld, Weak b) * 0.5 :mkWeak :: o -> b -> (State RealWorld -> (State RealWorld, c )) -> State RealWorld -> (State RealWorld, Weak b)6I6I None )0DIRSS  BSD-style FoundationNone )09;DRNegation support e.g. -(f x)Fractional Literal support'e.g. 1.2 :: Double 0.03 :: FloatIntegral Literal support&e.g. 123 :: Integer 123 :: Word8/, BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DRRR BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableSafe)0DRQPOQPO Safe )*0DR  BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableSafe)0DRgedfgfed BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DR/Only to use internally for internal error cases!for support of if .. then .. elseRxwyz|{  ba`_^]\[ZYXWVU ! "~}#$%&()EH*+,-./0123FG4LMN56789:;o<JKTcihjkpqruvكhviuj"~}!  xw|{zy %  3FG4LMN)EH-2*./01789:6+,5R$&<JKba`_^]\[ZYXWVUTc#(krqp;o BSD-stylePsychohistorians experimentalportableNone)0DRSimple Reader monadSimple State monad  BSD-styleHaskell Foundation experimentalportableNone )0DIR(Class of types that can be byte-swapped.e.g. Word16, Word32, Word64Big Endian valueLittle Endian value.Convert a value in cpu endianess to big endian5Convert from a big endian value to the cpu endianness1Convert a value in cpu endianess to little endian8Convert from a little endian value to the cpu endianness&endianness of the current architecture~~None)0DRNone)06<=BDRTOCast an integral value to another value that have the same representional size Upsize an integral valueThe destination type b9 size need to be greater or equal than the size type of a Downsize an integral value`      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcd           \       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdNone)*09;<=DRTfXClass of things that can mostly be converted from a to b, but with possible error cases.i1Class of things that can be converted from a to bk^Same as from but reverse the type variable so that the destination type can be specified firste.g. converting:from _ Word (10 :: Int)into @Word (10 :: Int)lsame as tryFrom but reversed efghijklmnoefghijklijhfgekl efghijklmno BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0ABDRTp Monad that can represent failureHSimilar to MonadFail but with a parametrized Failure linked to the MonadqbThe associated type with the MonadFailure, representing what failure can be encoded in this monadr Raise a Failure through a monad.s)Primitive monad that can handle mutation.For example: IO and ST.t3type of state token associated with the PrimMonad mu0type of variable associated with the PrimMonad mvmUnwrap the State# token to pass to a function a primitive function that returns an unboxed state and a value.w&Throw Exception in the primitive monadx(Run a Prim monad from a dedicated state#y&Build a new variable in the Prim Monadz#Read the variable in the Prim Monad{$Write the variable in the Prim Monad| just like unwrapPrimMonad9 but throw away the result and return just the new State#}+Convert a prim monad to another prim monad.The net effect is that it coerce the state repr to another, so the runtime representation should be the same, otherwise hilary ensues.~%Convert any prim monad to an ST monad%Convert any prim monad to an IO monad$Convert any IO monad to a prim monad(Touch primitive lifted to any prim monadpqrstuvwxyz{|}~pqrstuvwxyz{|}~stuvwxyz{pqr|}~ pqrstuvwxyz{|}~ BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0BDR-Create a pointer with an associated finalizer3Check if 2 final ptr points on the same memory bitsit stand to reason that provided a final ptr that is still being referenced and thus have the memory still valid, if 2 final ptrs have the same address, they should be the same final ptr$create a new FinalPtr from a Pointer'Create a new FinalPtr from a ForeignPtr.Cast a finalized pointer from type a to type b}Looks at the raw pointer inside a FinalPtr, making sure the data pointed by the pointer is not finalized during the call to fUnsafe version of   None%&),0ADQRTGConstraint to check if a natural is within a specific bounds of a type.i.e. given a Nat n", is it possible to convert it to ty without losing information?Check if a Nat is in bounds of another integral / natural typesGGet Maximum bounds of different Integral / Natural types related to Nat'>?@ABCDst>'stB?@ACDNone)0DRJNon Negative Number literals, convertible through the generic Natural type>Number literals, convertible through the generic Integer type.Fall number are Enum'erable, meaning that you can move to next elementNone )0BDReRepresent class of things that can be added together, contains a neutral element and is commutative. )x + azero = x azero + x = x x + y = y + x6None)0DRCompute the size of the listSum the element in a listNone )09;DR'Support for division between same typesCThis is likely to change to represent specific mathematic divisions3Represent types that supports an euclidian division "(x div  y) * y + (x mod  y) == x9Represent class of things that can be multiplied together #x * midentity = x midentity * x = x$Identity element over multiplication;Multiplication of 2 elements that result in another elementRaise to power, repeated multiplication e.g. > a ^ 2 = a * a > a ^ 10 = (a ^ 5) * (a ^ 5) .. (^) :: (IsNatural n) => a -> n -> a+  $778None)0DR1Represent class of things that can be subtracted.dNote that the result is not necessary of the same type as the operand depending on the actual type. For example: (-) :: Int -> Int -> Int (-) :: DateTime -> DateTime -> Seconds (-) :: Ptr a -> Ptr a -> PtrDiff (-) :: Natural -> Natural -> Maybe Natural      6None)0BDR  ASCII value between 0x0 and 0x7f Convert a   to a unicode code point *Try to convert a * to a  9If the code point is non ascii, then Nothing is returned.Try to convert 7 to a  9If the byte got higher bit set, then Nothing is returned. Convert a * to a   ignoring all higher bits Convert a Byte to a   ignoring the higher bit   !"#$   !"#$   !"#$   !"#$ BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0<=BDIR(CountOf of a data structure.@More specifically, it represents the number of elements of type ty# that fit into the data structure.6length (fromList ['a', 'b', 'c', '']) :: CountOf Char CountOf 4Same caveats as * apply here.*:Offset in a data structure consisting of elements of type ty.Int is a terrible backing type which is hard to get away from, considering that GHC/Haskell are mostly using this for offset. Trying to bring some sanity by a lightweight wrapping.,IOffset in bytes used for memory addressing (e.g. in a vector, string, ..)-File size in bytes4+subtract 2 CountOf values of the same type.gm need to be greater than n, otherwise negative count error ensue use the safer (-) version if unsure.:+subtract 2 CountOf values of the same type.gm need to be greater than n, otherwise negative count error ensue use the safer (-) version if unsure.?!alignment need to be a power of 2+()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQR()*+,-./0123456789:;<=>?@ABC-.*+,123584769;<:?=/0()>A@BC(()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQR BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DRb?Exception for using NonEmpty assertion with an empty collectionj?Exception during an operation accessing the vector out of boundXRepresent the type of operation, the index accessed, and the total length of the vector.l<The type of operation that triggers an OutOfBound exception.&OOB_Index: reading an immutable vector"OOB_Read: reading a mutable vector!OOB_Write: write a mutable vectorbcdefghijklmnopqrstuvwbcdefghijklmnopqrstjklmnopqtrsdehifgbc bcdefghijklmnopqrstuvw BSD-style Foundation experimentalportableNone)0DR$NonEmpty property for any CollectionNone)0DIR.The in-progress state of a building operation.The previous buffers are in reverse order, and this contains the current buffer and the state of progress packing the elements inside.   None)0DR/Data that can be fully evaluated in Normal Form21  BSD-style*Nicolas Di Prima <nicolas@primetype.co.uk>stableportableNone)0DREither a or b or both.!None)09;BDRT [A constraint class for serializable type that have an unique memory compare representatione.g. Float and Double have -0.0 and 0.0 which are Eq individual, yet have a different memory representation which doesn't allow for memcmp operationNRepresent the accessor for types that can be stored in the UArray and MUArray.=Types need to be a instance of storable and have fixed sized.%get the size in bytes of a ty elementget the shift size-return the element stored at a specific index.Read an element at an index in a mutable array7Write an element to a specific cell in a mutable array.Read from Address, without a state. the value read should be considered a constant for all pratical purpose, otherwise bad thing will happens.4Read a value from Addr in a specific primitive monad3Write a value to Addr in a specific primitive monadUCast a CountOf linked to type A (CountOf A) to a CountOf linked to type B (CountOf B)A  <==<9  - BSD-style foundationNone)0DR5Defines the maximum size in bytes of unpinned arrays.?You can change this value by setting the environment variable !HS_FOUNDATION_UARRAY_UNPINNED_MAX to an unsigned integer number. Note: We use  here. If the environment variable changes during runtime and the runtime system decides to recompute this value, referential transparency is violated (like the First Order violated the Galactic Concordance!).CTODO The default value of 1024 bytes is arbitrarily chosen for now. None)0BDR    ;on       ;on   .None )0:ABDRT   /None )0:BDR   0 BSD-style FoundationNone )0:BDRADifferent way to encode a Character in UTF8 represented as an ADTTransform a Unicode code point * intovnote that we expect here a valid unicode code point in the *allowed* range. bits will be lost if going above 0x10ffff1 BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0BDR(Check if the byte is a continuation byteJGet the number of following bytes given the first byte of a UTF8 sequence.(Check if the byte is a continuation byteJGet the number of following bytes given the first byte of a UTF8 sequence. 2None)0DR?Possible failure related to validating bytes of UTF8 sequences.$Step when processing ASCII characterEStep when processing digits. the value is between 0 and 9 to be validASimilar to Step but used when processing the string from the end.fThe stepper is thus the previous character, and the offset of the beginning of the previous characterStep when walking a Stringthis is a return value composed of : * the unicode code point read (Char) which need to be between 0 and 0x10ffff (inclusive) * The next offset to start reading the next unicode code point (or end)3None )0:BDRAnextAsciiBa specialized to get a digit between 0 and 9 (included)4None )0:BDRAnextAsciiBa specialized to get a digit between 0 and 9 (included)5None )0:BDR6None )0:BDR7 BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0BDRCopy all bytes from a byteArray to a mutableByteArray$Copy @nbBytes bytes from a byteArray to a mutableByteArray starting at an offsetsame as  except copy using 32 bits wordsame as  except copy using 64 bits word# BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0BDRTMutable Array of a Array of a1return the numbers of elements in a mutable array1return the numbers of elements in a mutable array5Return the element at a specific index from an array.5If the index @n is out of bounds, an error is raised.MReturn the element at a specific index from an array without bounds checking.NReading from invalid memory can return unpredictable and invalid values. use  if unsure.read a cell in a mutable array.2If the index is out of bounds, an error is raised. <read from a cell in a mutable array without bounds checking.NReading from invalid memory can return unpredictable and invalid values. use  if unsure.!#Write to a cell in a mutable array.2If the index is out of bounds, an error is raised.";write to a cell in a mutable array without bounds checking.^Writing with invalid bounds will corrupt memory and your program will become unreliable. use ! if unsure.#%Freeze a mutable array into an array..the MArray must not be changed after freezing.$Thaw an immutable array.)The Array must not be used after thawing.%!Thaw an array to a mutable array.the array is not modified, instead a new mutable array is created and every values is copied, before returning the mutable array.''Copy the element to a new element arrayECopy a number of elements from an array to another array with offsets(Copy nu sequential elements from the specified offset in a source array to the specified position in a destination array.mThis function does not check bounds. Accessing invalid memory can return unpredictable and invalid values.aAllocate a new array with a fill function that has access to the elements of the source array.)&Create a new mutable array of size @n.Ball the cells are uninitialized and could contains invalid values.|All mutable arrays are allocated on a 64 bits aligned addresses and always contains a number of bytes multiples of 64 bits.Create a new array of size /n by settings each cells through the function f.7Append 2 arrays together by creating a new bigger arrayN !"#$%&'destination arrayoffset at destination source arrayoffset at sourcenumber of elements to copy(destination arrayoffset at destination source arrayoffset at sourcenumber of elements to copy Source arrayLength of the destination array4Function called for each element in the source arrayReturns the filled new array)the size of the array,the function that set the value at the indexthe array created*+,-./ 01234567 89:;<=>?@A  BCDEFGHIJKLMNOPQRSTU4 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLM4*+'(%)#$&" !89,-./01234675:;<=@AB>?DCEFGHIJKLML !"#$%&'()*+,-./ 01234567 89:;<=>?@A  BCDEFGHIJKLMNOPQRSTU$ BSD-styleHaskell FoundationNone ),0DRTVA type level bounded naturalX/A type level bounded natural backed by a Word64Z'Create an element of !$/n!$ from a Word64\If the value is greater than n, then the value is normalized by using the integer modulus n[/Create an element of !$/n!$ from a type level Nat\)Create an element of !$/n!$ from a Natural.\If the value is greater than n, then the value is normalized by using the integer modulus n]/Create an element of !$/n!$ from a type level Nat V WXYZ[\]VWXYZ[\] XYYVWWZ\[]V WXYZ[\]8None  )0BDR9None )0BDRTdPA Mutable block of memory containing unpacked bytes representing values of type tyfHA block of memory containing unpacked bytes representing values of type tyCreate an empty block of memoryjMReturn the element at a specific index from an array without bounds checking.NReading from invalid memory can return unpredictable and invalid values. use index if unsure.%make a block from a list of elements.transform a block to a list.!Check if two blocks are identicalCompare 2 blocks7Append 2 blocks together by creating a new bigger blockk$Freeze a mutable block into a block.|If the mutable block is still use after freeze, then the modification will be reflected in an unexpected way in the Block.lThaw an immutable block.If the immutable block is modified, then the original immutable block will be modified too, but lead to unexpected results when queryingm7Create a new mutable block of a specific size in bytes.qNote that no checks are made to see if the size in bytes is compatible with the size of the underlaying element ty in the block.use n if unsuren3Create a new mutable block of a specific N size of ty elementspECopy a number of elements from an array to another array with offsetsr]Copy a number of bytes from a MutableBlock to another MutableBlock with specific byte offsetssPCopy a number of bytes from a Block to a MutableBlock with specific byte offsetst<read from a cell in a mutable block without bounds checking.NReading from invalid memory can return unpredictable and invalid values. use read if unsure.u;write to a cell in a mutable block without bounds checking.^Writing with invalid bounds will corrupt memory and your program will become unreliable. use write if unsure.'defghij klmnopdestination mutable blockoffset at destinationsource mutable blockoffset at sourcenumber of elements to copyqdestination mutable blockoffset at destination source blockoffset at sourcenumber of elements to copyrdestination mutable blockoffset at destinationsource mutable blockoffset at sourcenumber of elements to copysdestination mutable blockoffset at destination source blockoffset at sourcenumber of elements to copytu!"#$%&'()defghijklmnopqrstu!"%defghij klmnopqrstu!"#$%&'()% BSD-styleHaskell FoundationNone )0BDRTv$Return the length of a Mutable BlockEnote: we don't allow resizing yet, so this can remain a pure functionx4Get the address of the context of the mutable block.;if the block is not pinned, this is a _dangerous_ operationy(Set all mutable block element to a valuezread a cell in a mutable array.2If the index is out of bounds, an error is raised.{#Write to a cell in a mutable array.2If the index is out of bounds, an error is raised.vwxyz{defgiklmnopqrstuvwxyz{fgdevwxnoiyz{mutklpqrsvwxyz{& BSD-styleHaskell FoundationNone )0BDRT|LCopy all the block content to the memory starting at the destination address}Create a new array of size /n by settings each cells through the function f. Thaw a Block into a MutableBlockqthe Block is not modified, instead a new Mutable Block is created and its content is copied to the mutable block4Copy every cells of an existing Block to a new Block5Return the element at a specific index from an array.5If the index @n is out of bounds, an error is raised.Map all element a from a block to a new block of b!|the source block to copy8The destination address where the copy is going to start}(the size of the block (in element of ty),the function that set the value at the indexthe array created~)defghjkl|}~)fgdehlkj}~|!|}~' BSD-styleHaskell FoundationNone),0DIQRTf*+,-./*+,-./:None $)0BDRT/An array of type built on top of GHC primitive.The elements need to have fixed sized and the representation is a packed contiguous array in memory that can easily be passed to foreign interface7A Mutable array of types built on top of GHC primitive./Element in this array can be modified in place.0'Return if the array is pinned in memory-note that Foreign array are considered pinned1-Return if a mutable array is pinned in memory-Create a new pinned mutable array of size @n.Ball the cells are uninitialized and could contains invalid values.?All mutable arrays are allocated on a 64 bits aligned addresses&Create a new mutable array of size @n.When memory for a new array is allocated, we decide if that memory region should be pinned (will not be copied around by GC) or unpinned (can be moved around by GC) depending on its size.MYou can change the threshold value used by setting the environment variable !HS_FOUNDATION_UARRAY_UNPINNED_MAX.<read from a cell in a mutable array without bounds checking.NReading from invalid memory can return unpredictable and invalid values. use read if unsure.;write to a cell in a mutable array without bounds checking.^Writing with invalid bounds will corrupt memory and your program will become unreliable. use write if unsure.MReturn the element at a specific index from an array without bounds checking.NReading from invalid memory can return unpredictable and invalid values. use index if unsure.%Freeze a mutable array into an array./the MUArray must not be changed after freezing.Thaw an immutable array.*The UArray must not be used after thawing.2&make an array from a list of elements.3transform an array to a list.4"Check if two vectors are identical5Compare 2 vectorsECopy a number of elements from an array to another array with offsetsCopy nu sequential elements from the specified offset in a source array to the specified position in a destination array.mThis function does not check bounds. Accessing invalid memory can return unpredictable and invalid values.67Append 2 arrays together by creating a new bigger array:789:;<=>?@A01Bmove to a MutableBlockCDEF234G5HIJdestination arrayoffset at destination source arrayoffset at sourcenumber of elements to copydestination arrayoffset at destination source arrayoffset at sourcenumber of elements to copyKL6MNOPQRSTU)789:;<=>@A01BCDEF4LN3789:;<=>?@A01BCDEF234G5HIJKL6MNOPQRSTU)#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0BDRTread a cell in a mutable array.2If the index is out of bounds, an error is raised.#Write to a cell in a mutable array.2If the index is out of bounds, an error is raised.1return the numbers of elements in a mutable arrayLCreate a pointer on the beginning of the mutable array and call a function f.)The mutable buffer can be mutated by the f@ function and the change will be reflected in the mutable arraycIf the mutable array is unpinned, a trampoline buffer is created and the data is only copied when f return.Copy from a pointer, count! elements, into the mutable arrayLCopy all the block content to the memory starting at the destination address V"the start pointer with a finalizer/the number of elements (in elements, not bytes)W the source mutable array to copy8The destination address where the copy is going to start VW*None )0BDRConvert a byte value in Word to two Word9s containing the hexadecimal representation of the Word#GThe output words# are guaranteed to be included in the 0 to 2^7-1 rangejNote that calling convertByte with a value greater than 256 will cause segfault or other horrible effect. hex word16 hex word32XYZ[XYZ[( BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0BDORT4Copy every cells of an existing array to a new array!Thaw an array to a mutable array.the array is not modified, instead a new mutable array is created and every values is copied, before returning the mutable array.5Return the element at a specific index from an array.5If the index @n is out of bounds, an error is raised.\aAllocate a new array with a fill function that has access to the elements of the source array.Create a new array of size /n by settings each cells through the function f.*Create a pinned array that is filled by a filler- function (typically an IO call like hGetBuf)KFreeze a chunk of memory pointed, of specific size into a new unboxed array9update an array by creating a new array with the updates.Jthe operation copy the previous array, modify it in place, then freeze it.LCopy all the block content to the memory starting at the destination address*Recast an array of type a to an array of bKa and b need to have the same size otherwise this raise an async exceptionTTake a count of elements from the array and create an array with just those elements]Drop a count of elements from the array and return the new array minus those dropped elementsmSplit an array into two, with a count of at most N elements in the first one and the remaining in the other.5Similar to breakElem specialized to split on linefeedit either returns: * Left. no line has been found, and whether the last character is a CR * Right, a line has been found with an optional CR, and it returns the array of bytes on the left of the CR/LF, and the the array of bytes on the right of the LF.-Take the N elements from the end of the array-Drop the N elements from the end of the arraySplit an array at the N element from the end, and return the last N elements in the first part of the tuple, and whatever first elements remaining in the second  Replace all the occurrencies of needle with  replacement in the haystack string.D"the start pointer with a finalizer/the number of elements (in elements, not bytes)\ Source arrayLength of the destination array4Function called for each element in the source arrayReturns the filled new arraythe size of the array,the function that set the value at the indexthe array createdthe size of the arrayfilling function thatthe source array to copy8The destination address where the copy is going to start]^     _`W     W     D\]^     _`; BSD-style Foundation experimentalportableNone)0:DRaZthe unit element use for the encoding. i.e. Word8 for ASCII7 or UTF8, Word16 for UTF16...bIdefine the type of error handling you want to use for the next function. %type Error UTF8 = Either UTF8_Invalidcnconsume an `Unit encoding` and return the Unicode point and the position of the next possible `Unit encoding`dYhelper to convert a given Array in a given encoding into an array with another encoding.tThis is a helper to convert from one String encoding to another. This function is (quite) slow and needs some work.z``` let s16 = ... -- string in UTF16 -- create s8, a UTF8 String let s8 = runST $ convertWith UTF16 UTF8 (toBytes s16) print s8 ```eabcfdInput's encoding typeOutput's encoding typethe input raw arrayeabcfdeabcfd< BSD-style Foundation experimentalportableNone)0BDRg>validate a given byte is within ASCII characters encoring size+This function check the 8th bit is set to 0hfconsume an Ascii7 char and return the Unicode point and the position of the next possible Ascii7 char ijklmghmethod to access a given byteindex of the byte_either successfully validated the ASCII char and returned the next index or fail with an errorn\expecting it to be a valid Ascii character. otherwise this function will throw an exceptionopijklmijklmghnop= BSD-style Foundation experimentalportableNone)0BDR qrstuvwxyqrstqrstuvwxy> BSD-style Foundation experimentalportableNone)0BDR z{|}~z{|}~z{|}~? BSD-style Foundation experimentalportableNone)0BDR+ BSD-styleHaskell Foundation experimentalportableNone )0:BDIR7Opaque packed array of characters in the ASCII encodingkConvert a Byte Array representing ASCII data directly to an AsciiString without checking for ASCII validity|If the input contains invalid Char7 value (anything above 0x7f), it will trigger runtime async errors when processing data.In doubt, use   :Convert a Byte Array representing ASCII checking validity.8If the byte array is not valid, then Nothing is returned  !"#   !"#@ BSD-style FoundationNone )0:BDIR'Mutable String Buffer.Use as an *append* buffer, as UTF8 variable encoding doesn't really allow to change previously written character without potentially shifting bytes.)6Opaque packed array of characters in the UTF8 encodingsize in bytes.this size is available in o(1)(Convert a String to a list of characters/The list is lazily created as evaluation neededDassuming the given Addr# is a valid modified UTF-8 sequence of bytesJWe only modify the given Unicode Null-character (0xC080) into a null bytesFIXME: need to evaluate the kind of modified UTF8 GHC is actually expecting it is plausible they only handle the Null Bytes, which this function actually does.-Create a new String from a list of characterszThe list is strictly and fully evaluated before creating the new String, as the size need to be computed before filling.5Allocate a MutableString of a specific size in bytes.'()*$in number of bytes, not of elements.$in number of bytes, not of elements.'()*'()*,None)0DR+XReturns a list of the program's command line arguments (not including the program name).,"Lookup variable in the environment+,+,+,+,ANone )+0ABDRT-,stop execution and displays an error message---BNone)0DR.&Use the Show class to create a String.yNote that this is not efficient, since an intermediate [Char] is going to be created before turning into a real String.... BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DR/HIEEE754 Floating point Binary64, double precision (Also known as Double)0GIEEE754 Floating point Binary32, simple precision (Also known as Float)1!for support of if .. then .. else/01Rxwyz|{  ba`_^]\[ZYXWVU ! "#$%&=ml()EH*+,-./0123FG4LMN56789:;o<JKSTcihjkpqruv (*)-./01hviu-j".!  xw|{zy %  3FG4LMN)EH-2S*(* )./01789:6+,50/R$&=ml<JKba`_^]\[ZYXWVUTc#(krqp;o1/01" BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0:BDRB2DVarious String Encoding that can be use to convert to and from bytes UTF8 Encoder"Validate a bytearray for UTF8'nessUOn success Nothing is returned On Failure the position along with the failure reason8 Similar to  but works on a MutableByteArray9Check if a String is null:GCreate a string composed of a number @n of Chars (Unicode code points).Zif the input @s contains less characters than required, then the input string is returned.;SCreate a string with the remaining Chars after dropping @n Chars from the beginning<iSplit a string at the Offset specified (in Char) returning both the leading part and the remaining part.CReturn the offset (in bytes) of the N'th sequence in an UTF8 String= Similar to : but from the end> Similar to ; but from the end? Similar to < but from the end@:Split on the input string using the predicate as separatore.g. splitOn (== ',') "," == ["",""] splitOn (== ',') ",abc," == ["","abc",""] splitOn (== ':') "abc" == ["abc"] splitOn (== ':') "abc::def" == ["abc","","def"] splitOn (== ':') "::abc::def" == ["","","abc","","def"]A8Internal call to make a substring given offset in bytes.tThis is unsafe considering that one can create a substring starting and/or ending on the middle of a UTF8 sequence.;Internal call to split at a given index in offset of bytes.bThis is unsafe considering that one can split in the middle of a UTF8 sequence, so use with care.BMBreak a string into 2 strings at the location where the predicate return TrueCEBreak a string into 2 strings at the first occurence of the characterDFSame as break but cut on a line feed with an optional carriage return.eThis is the same operation as 'breakElem LF' dropping the last character of the string if it's a CR.\Also for efficiency reason (streaming), it returns if the last character was a CR character.EApply a  predicateY to the string to return the longest prefix that satisfy the predicate and the remainingF=Drop character from the beginning while the predicate is trueG>Return whereas the string contains a specific character or notHIntersperse the character sep% between each character in the string "intersperse ' ' "Hello Foundation"!"H e l l o F o u n d a t i o n"Allocate a new StringI with a fill function that has access to the characters of the source String.I Length of a String using CountOfthis size is available in o(n)JReplicate a character c n$ times to create a string of length nKCopy the StringkThe slice of memory is copied to a new slice, making the new string independent from the original string..LCreate a single element StringM"Unsafely create a string of up to sz bytes. The callback f needs to return the number of bytes filled in the underlaying bytes buffer. No check is made on the callback return values, and if it's not contained without the bounds, bad things will happen.NLMonomorphically map the character in a string and return the transformed oneOAAppend a Char to the end of the String and return this new StringPHPrepend a Char to the beginning of the String and return this new StringQUExtract the String stripped of the last character and the last character if not emptyIf empty, Nothing is returnedRXExtract the First character of a string, and the String stripped of the first character.If empty, Nothing is returnedSLLook for a predicate in the String and return the matched character, if any.T=Sort the character in a String using a specific sort function'TODO: optimise not going through a listU1Filter characters of a string using the predicateVReverse a stringX Replace all the occurrencies of needle with  replacement in the haystack string.Y$Return the nth character in a StringlCompared to an array, the string need to be scanned from the beginning since the UTF8 encoding is variable.ZWReturn the index in unit of Char of the first occurence of the predicate returning True!If not found, Nothing is returned[=Convert a ByteArray to a string assuming a specific encoding.It returns a 3-tuple of:@The string that has been succesfully converted without any errorAn optional validation errorThe remaining buffer that hasn't been processed (either as a result of an error, or because the encoded sequence is not fully available)Considering a stream of data that is fetched chunk by chunk, it's valid to assume that some sequence might fall in a chunk boundary. When converting chunks, if the error is Nothing and the remaining buffer is not empty, then this buffer need to be prepended to the next chunk\*Convert a UTF8 array of bytes to a String.qIf there's any error in the stream, it will automatically insert replacement bytes to replace invalid sequences.In the case of sequence that fall in the middle of 2 chunks, the remaining buffer is supposed to be preprended to the next chunk, and resume the parsing.]SDecode a stream of binary chunks containing UTF8 encoding in a list of valid String`Chunk not necessarily contains a valid string, as a UTF8 sequence could be split over 2 chunks.^cConvert a Byte Array representing UTF8 data directly to a string without checking for UTF8 validitycIf the input contains invalid sequences, it will trigger runtime async errors when processing data.In doubt, use [_6Convert a String to a bytearray in a specific encodingeif the encoding is UTF8, the underlying buffer is returned without extra allocation or any processingJIn any other encoding, some allocation and processing are done to convert.`4Split lines in a string using newline as separation.xNote that carriage return preceding a newline are also strip for maximum compatibility between Windows and Unix system.a2Split words in a string using spaces as separation words "Hello Foundation"  Hello,  Foundation b&Append a character to a String builderc,Create a new String builder using chunks of  sizeChunksIeRead an Integer from a StringCConsume an optional minus sign and many digits until end of string.gRead a Natural from a String(Consume many digits until end of string.hTry to read a Doublei+Try to read a floating number as a Rational Note that for safety reason, only exponent between -10000 and 10000 is allowed as otherwise DoS/OOM is very likely. if you don't want this behavior, switching to a scientific type (not provided yet) that represent the exponent separately is the advised solution.j)Read an Floating like number of the form:    numbers [ h  numbers ] [ ( e | E ) [  ]  number ]Call a function with:0A boolean representing if the number is negativeYThe digits part represented as a single natural number (123.456 is represented as 123456)?The number of digits in the fractional part (e.g. 123.456 => 3)The exponent if any6The code is structured as a simple state machine that:Optionally Consume a  sign$Consume number for the integral part OptionallyConsume h5Consume remaining digits if not already end of stringOptionally Consume a e or E follow by an optional  and a number)Take decimal digits and accumulate it in acc?The loop starts at the offset specified and finish either when:It reach the end of the stringIt reach a non-ASCII character8It reach an ASCII character that is not a digit (0 to 9)Otherwise each iterations:(Transform the ASCII digits into a numberscale the accumulator by 103Add the number (between 0 and 9) to the accumulatorIt then returns:The new accumulated value'Whether it stop by end of string or not$The end offset when the loop stoppedQIf end offset == start offset then no digits have been consumed by this function-same as decimalDigitsBA specialized for ptr #k Convert a )_ to the upper-case equivalent. Does not properly support multicharacter Unicode conversions.l Convert a )_ to the upper-case equivalent. Does not properly support multicharacter Unicode conversions.m@Check whether the first string is a prefix of the second string.n@Check whether the first string is a suffix of the second string.oDCheck whether the first string is contains within the second string.STODO: implemented the naive way and thus terribly inefficient, reimplement properlyp1Try to strip a prefix from the start of a String.mIf the prefix is not starting the string, then Nothing is returned, otherwise the striped string is returnedq/Try to strip a suffix from the end of a String.kIf the suffix is not ending the string, then Nothing is returned, otherwise the striped string is returnedtTransform string src! to base64 binary representation.uTransform string srct to URL-safe base64 binary representation. The result will be either padded or unpadded, depending on the boolean padded argument.vTransform string src) to OpenBSD base64 binary representation.X23456789:;<=>?@ABCDEFGH Source string)Length of the destination string in bytes7Function called for each character in the source StringReturns the filled new stringIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwN'()*23567489:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvN)*'(MJI234567[]^\_8KY9;:<>=?@AGWHEBCDFLNOPQRSZTUVXbcdfeghijklmnopqrs`atuvR23456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwCDEFGHFGIFJKFJLFMNFMOFMPFMQCRSCRTFJUFJVFJWFJXFJYFZ[F\]F\^F\_F\`FJaFJbFJcFJdFJeFJfFMgFMhCRiFJjFklFJmCRnFopFqrFZsFJtFuvFwxFJyCz{Cz|Cz}Cz~CzFFFFFJCzCzCzFFFFFFFuCzFwFwFwFwFwFwCzFJFJCzCzFFCzCzCzFFFF\FFkFkFkFkFkFkFkFkFkFkFkFkFkFkFkFkFFFFFFFFFuFuFFFFFFwFwFFFMFMFMFMFMFMFoFoFoFFJFJFJFJFJFFFCRCRCRCRCRCRCRCRCRCR                             ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 89:;;<==>?@ABCDEFFGHHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abccdefghijklmnopqrstuvwxyz{|}~~               !!!!!!! !!!"!#!$!%!&!'!(!)!*!+!,!-!.!/!0!1!2!3!4!5!6!7!8!9!:!;!<!=!>!?!@!A!B!C!D!E!F!G!H!I!J!K!L!M!N!O!P!Q!R!S!T U U V W X Y Z [ \ ]2^2_2`2a2b#c#d#e#f#g#h#i#j#k#l#m#n#o#p#q#r#s#'#(#t#u#v#w#x#y#z#{#|#}#~###########*###################$$$$$$$$$$$$$$99999'99g9l9m99r999999i9k%%%%%h%j&&&&&&&n&o&p&f&&&&&&&&{&&&v&y&|&~&&&&z&&&*&&}'''''''n'o'f''''''{'''v'''''*''}''':::::':::r:i:k:g::l::m:::::q))h)j))){)e))))***(p(n(f(((o((((((((((((((((t((u((v(((w(x(y(z({(((|((}(~((((((((((*(((((((((((((((+++++++++++++@@@@,,AB:""""""""("t"u"v"w"x"y"z"{"|"""~"""}"'""p"""""""""""*"""f"""""""" """" " " " """"""""""""""""""""" !"#$%&!'!(!)!*!+!,--F./.0.1.2.3.4.5..6.../0/1/2/3/4/5//6///0708090:0;0<0=0>0?0@0A0B0C0D0E0F0G0H0I0J0K1L1M1N1O1P1P1Q1R1S2T2U2V2W2T2U2V2W2X2Y2Z3[3\303]3^313_3`3a3b3c3d3j3`3333'4[4\404]4^414_4`4a4b4c4d4j4`4444'5e5f6e6f7g7h7i7j7k7l###m##n#c#d#o#"#p#q#r#s#t#u##v#$$8w8x8y8z8{8|9s9}9~9"99n999999s999999999'''''':::q:r:":p:n:::::::::o:::::::::::::s:s::::::::)s)*P*P**(m((u((;;;;;;<<b<<<<<<j<<======b=j==>>>>`>>b>j>>?????b?j??@@@@@r@@b@c@`@a@j@@o@@@@@@""f"""m""""""""""u"""%basement-0.0.0-ERHrvUIE8g8CKu8S3WibQ9Basement.Compat.BaseBasement.Compat.IsListBasement.Compat.Typeable Basement.NatBasement.Compat.PrimitiveBasement.ImportsBasement.Compat.IdentityBasement.Compat.NaturalBasement.Compat.BifunctorBasement.Types.PtrBasement.Compat.CallStackBasement.Compat.PrimTypesBasement.Compat.NumLiteralBasement.Compat.MonadTransBasement.EndiannessBasement.FloatingBasement.IntegralConv Basement.FromBasement.MonadBasement.FinalPtrBasement.Numerical.NumberBasement.Numerical.AdditiveBasement.Compat.ExtList!Basement.Numerical.MultiplicativeBasement.Numerical.SubtractiveBasement.Types.Char7Basement.Types.OffsetSizeBasement.ExceptionBasement.NonEmptyBasement.MutableBuilderBasement.NormalFormBasement.TheseBasement.PrimTypeBasement.StringBasement.BoxedArrayBasement.BoundedBasement.Block.MutableBasement.BlockBasement.BlockNBasement.UArrayBasement.UArray.MutableBasement.Base16Basement.Types.AsciiStringBasement.EnvironmentBasement.RuntimeBasement.UArray.AddrBasement.UArray.BABasement.UTF8.HelperBasement.UTF8.TableBasement.UTF8.TypesBasement.UTF8.AddrBasement.UTF8.BABasement.String.AddrBasement.String.BABasement.UtilsBasement.Bindings.MemoryBasement.Block.BaseBasement.UArray.Base!Basement.String.Encoding.EncodingBasement.String.Encoding.ASCII7#Basement.String.Encoding.ISO_8859_1Basement.String.Encoding.UTF16Basement.String.Encoding.UTF32Basement.UTF8.BaseBasement.Error Basement.Showghc-primGHC.Primseqbase Data.TuplefstsndGHC.Base otherwise$GHC.EnumenumFrom enumFromThen enumFromToenumFromThenTo GHC.Classes==>=fail>>=>>fmapreturn Data.String fromStringGHC.ExtsIsListfromList fromListNtoListmemptymappendmconcat<*>pure*>BoundedEnumEqMonad Data.DataDataFunctorOrdGHC.ShowShowData.Typeable.InternalTypeableIsString Applicative GHC.GenericsGeneric GHC.TypeLitsKnownNatMonoid GHC.TypesBoolCharDoubleFloatIntGHC.IntInt8Int16Int32Int64 integer-gmpGHC.Integer.TypeIntegerMaybeOrderingIOWordGHC.WordWord8Word16Word32Word64GHC.PtrPtr Data.EitherEitherRepNat+*^<=?-CmpNatFalseNothingJustTrueW#LeftRightLTEQGTData.Functor.Identity runIdentityIdentityItem GHC.NaturalNatural mkNoRepTypegmapMogmapMpgmapMgmapQigmapQgmapQrgmapQlgmapT dataCast2 dataCast1 dataTypeOftoConstrgunfoldgfoldlDataTypeData.Bifunctorsecondfirstbimap BifunctorControl.Category.id Data.Foldableand Data.Monoid<>tofromcastPtrGHC.IOthrowIO GHC.Exceptionthrow ExceptionnatVal<=either Data.Functor<$>maxBoundminBoundfromEnumtoEnumpredsuccshowListshow showsPrec Data.Maybemaybe$!flipconst<$<*GHC.Err undefinederrorGHC.Stack.Types HasCallStack/=compare&&||not<>maxminPinned#Bool#CountOf#Offset# FileSize# PinnedStatusPinnedUnpinnedcompatIsMutableByteArrayPinned#compatIsByteArrayPinned#toPinnedStatus#bool# compatAndI#compatQuotRemInt#compatCopyAddrToByteArray#compatCopyByteArrayToAddr# compatMkWeak# compatGetSizeofMutableByteArray#compatShrinkMutableByteArray#compatResizeMutableByteArray#$fEqPinnedStatusintegerToNatural HasNegationnegate Fractional fromRationalIntegral fromInteger$fFractionalCDouble$fFractionalCFloat$fFractionalDouble$fFractionalFloat$fFractionalRatio$fHasNegationCDouble$fHasNegationCFloat$fHasNegationDouble$fHasNegationFloat$fHasNegationCInt$fHasNegationWord64$fHasNegationWord32$fHasNegationWord16$fHasNegationWord8$fHasNegationWord$fHasNegationInt64$fHasNegationInt32$fHasNegationInt16$fHasNegationInt8$fHasNegationInt$fHasNegationInteger$fIntegralCDouble$fIntegralCFloat$fIntegralDouble$fIntegralFloat$fIntegralCUIntPtr$fIntegralCOff$fIntegralCInt$fIntegralCSize$fIntegralInt64$fIntegralInt32$fIntegralInt16$fIntegralInt8$fIntegralWord64$fIntegralWord32$fIntegralWord16$fIntegralWord8$fIntegralWord $fIntegralInt$fIntegralNatural$fIntegralInteger internalError ifThenElseReader runReaderStaterunState $fMonadReader$fApplicativeReader$fFunctorReader $fMonadState$fApplicativeState$fFunctorStateByteSwapBEunBELEunLE Endianness LittleEndian BigEndiantoBEfromBEtoLEfromLE endianness$fByteSwapWord64$fByteSwapWord32$fByteSwapWord16$fOrdBE$fOrdLE$fEqEndianness$fShowEndianness$fShowLE$fEqLE$fBitsLE$fShowBE$fEqBE$fBitsBEintegerToDoublenaturalToDoubledoubleExponantintegerToFloatnaturalToFloat IntegralCast integralCastIntegralUpsizeintegralUpsizeIntegralDownsizeintegralDownsizeintegralDownsizeCheck intToInt64 int64ToInt wordToWord64 word64ToWordword64ToWord32s wordToChar wordToInt charToInt$fIntegralCastWord32Int32$fIntegralCastWord16Int16$fIntegralCastWord8Int8$fIntegralCastInt32Word32$fIntegralCastInt16Word16$fIntegralCastInt8Word8$fIntegralCastInt64Word64$fIntegralCastWord64Int64$fIntegralCastIntWord$fIntegralCastWordInt$fIntegralDownsizeNaturalWord64$fIntegralDownsizeNaturalWord32$fIntegralDownsizeNaturalWord16$fIntegralDownsizeNaturalWord8 $fIntegralDownsizeIntegerNatural$fIntegralDownsizeIntegerWord64$fIntegralDownsizeIntegerWord32$fIntegralDownsizeIntegerWord16$fIntegralDownsizeIntegerWord8$fIntegralDownsizeIntegerInt64$fIntegralDownsizeIntegerInt32$fIntegralDownsizeIntegerInt16$fIntegralDownsizeIntegerInt8$fIntegralDownsizeWord16Word8$fIntegralDownsizeWord32Word16$fIntegralDownsizeWord32Word8$fIntegralDownsizeWordWord32$fIntegralDownsizeWordWord16$fIntegralDownsizeWordWord8$fIntegralDownsizeWord64Word32$fIntegralDownsizeWord64Word16$fIntegralDownsizeWord64Word8$fIntegralDownsizeInt64Int$fIntegralDownsizeInt64Int32$fIntegralDownsizeInt64Int16$fIntegralDownsizeInt64Int8$fIntegralDownsizeIntInt32$fIntegralDownsizeIntInt16$fIntegralDownsizeIntInt8$fIntegralUpsizeNaturalInteger$fIntegralUpsizeWord64Natural$fIntegralUpsizeWord64Integer$fIntegralUpsizeWordWord64$fIntegralUpsizeWordNatural$fIntegralUpsizeWordInteger$fIntegralUpsizeWord32Natural$fIntegralUpsizeWord32Integer$fIntegralUpsizeWord32Word$fIntegralUpsizeWord32Word64$fIntegralUpsizeWord16Natural$fIntegralUpsizeWord16Integer$fIntegralUpsizeWord16Word$fIntegralUpsizeWord16Word64$fIntegralUpsizeWord16Word32$fIntegralUpsizeWord8Natural$fIntegralUpsizeWord8Integer$fIntegralUpsizeWord8Int$fIntegralUpsizeWord8Int64$fIntegralUpsizeWord8Int32$fIntegralUpsizeWord8Int16$fIntegralUpsizeWord8Word$fIntegralUpsizeWord8Word64$fIntegralUpsizeWord8Word32$fIntegralUpsizeWord8Word16$fIntegralUpsizeInt64Integer$fIntegralUpsizeIntInt64$fIntegralUpsizeIntInteger$fIntegralUpsizeInt32Integer$fIntegralUpsizeInt32Int$fIntegralUpsizeInt32Int64$fIntegralUpsizeInt16Integer$fIntegralUpsizeInt16Int$fIntegralUpsizeInt16Int64$fIntegralUpsizeInt16Int32$fIntegralUpsizeInt8Integer$fIntegralUpsizeInt8Int$fIntegralUpsizeInt8Int64$fIntegralUpsizeInt8Int32$fIntegralUpsizeInt8Int16TryIntoTryFromtryFromIntoFromintotryInto $fFromWordInt $fFromIntWord$fFromaa MonadFailureFailuremFail PrimMonad PrimStatePrimVar primitive primThrow unPrimMonad primVarNew primVarRead primVarWrite unPrimMonad_unsafePrimCastunsafePrimToSTunsafePrimToIOunsafePrimFromIO primTouch$fMonadFailureEither$fMonadFailureMaybe $fPrimMonadST $fPrimMonadIOFinalPtr FinalForeignfinalPtrSameMemory toFinalPtrtoFinalPtrForeign castFinalPtrwithFinalPtrNoTouch withFinalPtr touchFinalPtrwithUnsafeFinalPtr $fOrdFinalPtr $fEqFinalPtr$fShowFinalPtrNatWithinBound NatInBoundOfNatNumMaxBound natValNatural natValInt natValInt64 natValInt32 natValInt16 natValInt8 natValWord natValWord64 natValWord32 natValWord16 natValWord8 IsNatural toNatural IsIntegral toInteger$fIsNaturalCSize$fIsNaturalWord64$fIsNaturalWord32$fIsNaturalWord16$fIsNaturalWord8$fIsNaturalWord$fIsNaturalNatural$fIsIntegralCSize$fIsIntegralWord64$fIsIntegralWord32$fIsIntegralWord16$fIsIntegralWord8$fIsIntegralWord$fIsIntegralNatural$fIsIntegralInt64$fIsIntegralInt32$fIsIntegralInt16$fIsIntegralInt8$fIsIntegralInt$fIsIntegralIntegerAdditiveazeroscale$fAdditiveCSize$fAdditiveDouble$fAdditiveFloat$fAdditiveWord64$fAdditiveWord32$fAdditiveWord16$fAdditiveWord8$fAdditiveNatural$fAdditiveWord$fAdditiveInt64$fAdditiveInt32$fAdditiveInt16$fAdditiveInt8 $fAdditiveInt$fAdditiveIntegerlengthnullsumreverse Divisible/ IDivisibledivmoddivModMultiplicative midentityrecip$fDivisibleDouble$fDivisibleFloat$fDivisibleRatio$fIDivisibleWord64$fIDivisibleWord32$fIDivisibleWord16$fIDivisibleWord8$fIDivisibleWord$fIDivisibleNatural$fIDivisibleInt64$fIDivisibleInt32$fIDivisibleInt16$fIDivisibleInt8$fIDivisibleInt$fIDivisibleInteger$fMultiplicativeRatio$fMultiplicativeDouble$fMultiplicativeFloat$fMultiplicativeWord64$fMultiplicativeWord32$fMultiplicativeWord16$fMultiplicativeWord8$fMultiplicativeWord$fMultiplicativeNatural$fMultiplicativeInt64$fMultiplicativeInt32$fMultiplicativeInt16$fMultiplicativeInt8$fMultiplicativeInt$fMultiplicativeInteger Subtractive Difference$fSubtractiveChar$fSubtractiveDouble$fSubtractiveFloat$fSubtractiveWord64$fSubtractiveWord32$fSubtractiveWord16$fSubtractiveWord8$fSubtractiveWord$fSubtractiveNatural$fSubtractiveInt64$fSubtractiveInt32$fSubtractiveInt16$fSubtractiveInt8$fSubtractiveInt$fSubtractiveIntegerChar7toBytetoCharfromCharfromByte fromCharMask fromByteMaskc7_LFc7_CRc7_minusc7_ac7_Ac7_zc7_Zc7_0c7_1c7_2c7_3c7_4c7_5c7_6c7_7c7_8c7_9 $fShowChar7 $fEqChar7 $fOrdChar7CountOfOffsetOffset8FileSize+..==# offsetOfE offsetPlusE offsetMinusE offsetSub offsetRecast offsetShiftR offsetShiftL offsetCastsizeCastsizeSubsizeLastOffset sizeAsOffset offsetAsSizesizeOfEcountOfRoundUp csizeOfSize csizeOfOffset sizeOfCSSize sizeOfCSize$fIntegralCastWordCountOf$fIntegralCastIntCountOf$fMonoidCountOf$fSubtractiveCountOf$fAdditiveCountOf$fIsNaturalCountOf$fIsIntegralCountOf$fFromCountOfWord$fFromCountOfInt $fNumCountOf$fIntegralCastWordOffset$fIntegralCastIntOffset$fSubtractiveOffset$fIsNaturalOffset$fIsIntegralOffset$fShowFileSize $fEqFileSize $fOrdFileSize $fShowOffset $fEqOffset $fOrdOffset $fEnumOffset$fAdditiveOffset$fIntegralOffset $fNumOffset $fShowCountOf $fEqCountOf $fOrdCountOf $fEnumCountOf$fIntegralCountOfNonEmptyCollectionIsEmpty InvalidRecastRecastDestinationSizeRecastSourceSize OutOfBoundOutOfBoundOperationOOB_Read OOB_Write OOB_MemSet OOB_MemCopy OOB_Index outOfBoundprimOutOfBound isOutOfBound$$fExceptionNonEmptyCollectionIsEmpty$fExceptionInvalidRecast$fExceptionOutOfBound$fShowOutOfBoundOperation$fEqOutOfBoundOperation$fShowOutOfBound$fShowRecastSourceSize$fEqRecastSourceSize$fShowRecastDestinationSize$fEqRecastDestinationSize$fShowInvalidRecast$fShowNonEmptyCollectionIsEmptyNonEmpty getNonEmpty$fIsListNonEmpty$fShowNonEmpty $fEqNonEmpty BuildingState prevChunksprevChunksSizecurChunk chunkSizeBuilder runBuilder$fMonadFailureBuilder$fFunctorBuilder$fApplicativeBuilder$fMonadBuilder NormalForm toNormalFormdeepseqforce$fNormalForm(,,,,,,,)$fNormalForm(,,,,,,)$fNormalForm(,,,,,)$fNormalForm(,,,,)$fNormalForm(,,,)$fNormalForm(,,)$fNormalForm(,)$fNormalForm[]$fNormalFormBE$fNormalFormLE$fNormalFormEither$fNormalFormMaybe$fNormalFormCountOf$fNormalFormOffset$fNormalFormPtr$fNormalFormCDouble$fNormalFormCFloat$fNormalFormCULLong$fNormalFormCLLong$fNormalFormCULong$fNormalFormCLong$fNormalFormCUInt$fNormalFormCInt$fNormalFormCUShort$fNormalFormCShort$fNormalFormCSChar$fNormalFormCUChar$fNormalFormCChar$fNormalForm()$fNormalFormBool$fNormalFormChar$fNormalFormChar7$fNormalFormDouble$fNormalFormFloat$fNormalFormNatural$fNormalFormWord$fNormalFormWord64$fNormalFormWord32$fNormalFormWord16$fNormalFormWord8$fNormalFormInteger$fNormalFormInt$fNormalFormInt64$fNormalFormInt32$fNormalFormInt16$fNormalFormInt8TheseThisThat$fFunctorThese$fBifunctorThese$fNormalFormThese $fEqThese $fOrdThese $fShowThesePrimMemoryComparablePrimTypeprimSizeInBytesprimShiftToBytes primBaUIndex primMbaURead primMbaUWrite primAddrIndex primAddrRead primAddrWrite primBaIndex primMbaRead primMbaWriteprimArrayIndexprimMutableArrayReadprimMutableArrayWrite sizeRecast sizeInBytes offsetInBytesoffsetInElementsprimOffsetRecastoffsetIsAligned primOffsetOfEprimWordGetByteAndShiftprimWord64GetByteAndShiftprimWord64GetHiLo$fPrimMemoryComparableBE$fPrimMemoryComparableLE$fPrimMemoryComparableCUChar$fPrimMemoryComparableCChar$fPrimMemoryComparableChar$fPrimMemoryComparableInt64$fPrimMemoryComparableInt32$fPrimMemoryComparableInt16$fPrimMemoryComparableInt8$fPrimMemoryComparableWord64$fPrimMemoryComparableWord32$fPrimMemoryComparableWord16$fPrimMemoryComparableWord8$fPrimMemoryComparableWord$fPrimMemoryComparableInt $fPrimTypeBE $fPrimTypeLE$fPrimTypeChar7$fPrimTypeCUChar$fPrimTypeCChar$fPrimTypeChar$fPrimTypeDouble$fPrimTypeFloat$fPrimTypeInt64$fPrimTypeInt32$fPrimTypeInt16$fPrimTypeInt8$fPrimTypeWord64$fPrimTypeWord32$fPrimTypeWord16$fPrimTypeWord8$fPrimTypeWord $fPrimTypeIntAddraddrPlus addrPlusSz addrPlusCSzptrPlus ptrPlusSz ptrPlusCSz$fEqAddr $fOrdAddrValidationFailure InvalidHeaderInvalidContinuation MissingByteBuildingFailureMArrayArray mutableLengthindex unsafeIndexread unsafeReadwrite unsafeWrite unsafeFreeze unsafeThawthawfreezecopyunsafeCopyAtROnewemptytakedropsplitAtrevTakerevDrop revSplitAtsplitOnsubbreak interspersespan singleton replicateconssnocunconsunsnocelemfindsortByfilterfoldrfoldl'foldl1'foldr1allany isPrefixOf isSuffixOf builderAppend builderBuild builderBuild_ $fIsListArray $fOrdArray $fEqArray $fShowArray $fMonoidArray$fFunctorArray$fNormalFormArray $fDataArrayZnunZnZn64unZn64zn64zn64NatznznNat $fShowZn64$fEqZn64 $fOrdZn64$fShowZn$fEqZn$fOrdZn MutableBlockBlock mutableEmpty unsafeNew newPinnedunsafeCopyElementsunsafeCopyElementsROunsafeCopyBytesunsafeCopyBytesROmutableLengthSizemutableLengthBytesmutableGetAddriterSetunsafeCopyToPtrcreateisPinnedisMutablePinnedmap MutableBlockNBlockNtoBlockNtoBlock$fNormalFormBlockN $fEqBlockN $fShowBlockNUArrayMUArray newNative unsafeIndexerunsafeFreezeShrinkonMutableBackend unsafeDewrap equalMemcmpcopyAtsizeInMutableBytesOfContent mutableSamemutableForeignMemwithMutablePtr copyFromPtr copyToPtr mutableOffsetunsafeConvertByte hexWord16 hexWord32 foreignMemfromForeignPtr freezeShrink unsafeSlide createFromIO createFromPtrupdate unsafeUpdatewithPtrrecast unsafeRecast unsafeTake unsafeDrop breakElem breakLine findIndex revFindIndexmapIndexindicesreplace toHexadecimaltoBase64InternalMutableAsciiString AsciiStringtoBytesfromBytesUnsafe fromBytes$fIsListAsciiString$fIsStringAsciiString$fShowAsciiString$fMonoidAsciiString$fEqAsciiString$fOrdAsciiString MutableStringStringgetArgs lookupEnvFP64FP32EncodingASCII7UTF8UTF16UTF32 ISO_8859_1mutableValidate dropWhilecharMapfromBytesLenientfromChunkByteslineswords readIntegral readInteger readNatural readDouble readRationalreadFloatingExactupperlower isInfixOf stripPrefix stripSuffixtoBase64 toBase64URLtoBase64OpenBSD$fEncodingEncoderUTF8$fDataEncoding $fEqEncoding $fOrdEncoding$fShowEncoding$fEnumEncoding$fBoundedEncodingbyteSwapintegralDownsizeBounded word64ToWord#equalcompare_scaleNumpowerevensizeIntsizeWordshiftInt shiftWordsizeRecastBytesprimOffsetRecastBytesunsafeUArrayUnpinnedMaxSize GHC.IO.UnsafeunsafePerformIO Immutable primIndex findIndexElemrevFindIndexElemfindIndexPredicatefoldlfoldl1UTF8Char asUTF8CharUTF8_1UTF8_2UTF8_3UTF8_4maskContinuation# maskHeader2# maskHeader3# maskHeader4#or3#or4#toChar#toChar1toChar2toChar3toChar4numBytesskipNextHeaderValue headerIsAscii charToBytesisContinuation getNbBytesisContinuation# getNbBytes#TableunTable contTable headTable StepASCII StepDigitStepBackStepisValidStepASCIIisValidStepDigit$fExceptionValidationFailurenextAsciiDigitMutable primWriteprimRead primIndex64 nextAscii expectAsciinextprevprevSkip copyFiltervalidateprimCopyFreezedBytesprimCopyFreezedBytesOffsetprimCopyFreezedW32primCopyFreezedW64 primMutableByteArraySlideToStartprimMutableAddrSlideToStartunsafeCopyFromappend arrayTypevCompare vFromListvToListconcat onNewArraycountFromStartfreezeUntilIndexsysHsMemFindByteAddrsysHsMemFindByteBasysHsMemcmpPtrPtrsysHsMemcmpPtrBasysHsMemcmpBaPtrsysHsMemcmpBaBainternalFromListinternalToListinternalCompare blockType lengthBytesempty_ compareMemcmptouch mutableTouch $fIsListBlock $fMonoidBlock $fOrdBlock $fEqBlock $fShowBlock$fNormalFormBlock $fDataBlockunMBlockunBlocktoCounttoOffset ValidRange UArrayBackendUArrayBA UArrayAddrMUArrayBackend MUArrayMBA MUArrayAddroffsetoffsetsValidRange newUnpinned onBackend onBackendPrim unsafeDewrap2pureST equalBytes vCompareBytesvCompareMemcmpmemcmp$fIsListUArray$fMonoidUArray $fOrdUArray $fEqUArray $fShowUArray$fNormalFormUArray $fDataUArraywithMutablePtrHinttableLotableHi breakElemByteoutputLengthBase64convert3UnitError encodingNext convertFromTo encodingWriteisAsciiASCII7_InvalidByteOutOfBound CharNotAscii$fEncodingASCII7$fExceptionASCII7_InvalidISO_8859_1_Invalid NotISO_8859_1aone$fEncodingISO_8859_1$fExceptionISO_8859_1_Invalid UTF16_InvalidInvalidUnicode$fEncodingUTF16$fExceptionUTF16_Invalid UTF32_Invalid$fEncodingUTF32$fExceptionUTF32_InvalidsizesToList fromModified sFromList stringType$fNormalFormString $fDataString$fIsListString$fIsStringString $fShowString EncoderUTF8indexN splitIndexdecimalDigitsBAdecimalDigitsPtrReadFloatingCallbacknextWithIndexerwriteWithBuilder writeUTF8CharcountCharMoreThanBytesfromEncoderBytestoEncoderBytes stringDewrap