l)      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abc d e f g hijklmno p q r s t u v w x y z { | } ~          !"#$%&'()*+,-./0123 4 5 6 7 8 9 : ; < = > ? @ A B C D E FGHIJKLMNOP Q R S T U V W XYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~            !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwx y z { | } ~ !!!!!!!!!!!!!!!  """""""""""""""""#########################       $$qSafe)0DR YX[Z [ZYX None)0DR% BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableSafe)0DR  BSD-style FoundationstableportableSafe)0DR&None )0BDRConvert a byte value in Word to two Word9s containing the hexadecimal representation of the Word#jNote that calling convertByte with a value greater than 256 will cause segfault or other horrible effect.'None )0<=BDR*Various conversion between integral numberlossless integral convertion Convert an * into a 4(Safe)0DRSR) BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableSafe)0DRlnm* 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 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) 4 + BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0BDRSize 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,None )0DIRI- 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)0DRH/ BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableSafe)0DRGFE0Safe )*0DR1 BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DR/Only to use internally for internal error cases!for support of if .. then .. else !"H #$%&'()*+,-./01 !234"#$5678%&;>'()*+,-./0<=1ABC34567899:?@:;WV<\=>bk?  2 BSD-style Foundation experimentalportableNone)0DR(Class of types that can be byte-swapped.e.g. Word16, Word32, Word64@ABCDEF@@ABC3 BSD-stylePsychohistorians experimentalportableNone)0DRGSimple Reader monadHSimple State monad GIJHKLMNOPQRGIJHKLGIJHKLMNOPQR4None )0DRTMonad that can ensure cleanup actions are performed even in the case of exceptions, both synchronous and asynchronous. This usually excludes continuation-based monads.iA generalized version of the standard bracket function which allows distinguishing different exit cases.Monad that can catch exceptionMonad that can throw exception(Throw immediatity an exception. Only a 1 monad will be able to catch the exception using  Monad that can represent failureHSimilar to MonadFail but with a parametrized Failure linked to the MonadbThe associated type with the MonadFailure, representing what failure can be encoded in this monad Raise a Failure through a monad.STUVW  STUVW5None)0DRBasic Transformer classGLift a computation from an inner monad to the current transformer monadNone )05DRGFESRSRGFE6None)0DRXIdentity Transformer XYZ[\]^_`abXZ XYZ[\]^_`ab7None)0DR  $SRXNone)0DRReader Transformer c cNone)0DLRState Transformer d d8None)09DRIEEE754 Floating Pointefef9None)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 elementghijklmnopqrstuvwxghijklmnopqrstuvwx:None)06DReRepresent class of things that can be added together, contains a neutral element and is commutative. )x + azero = x azero + x = x x + y = y + xyz{|}~yz{|}~6;None )069;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+ $778<None)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 Natural6= BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DIRSize of a data structure.@More specifically, it represents the number of elements of type ty# that fit into the data structure.7lengthSize (fromList ['a', 'b', 'c', '']) :: Size CharSize 4Same caveats as  apply here."Size of a data structure in bytes.: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 bytes> BSD-style foundation experimentalportableNone)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. BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )069;DRRound up, to the next integral.Also known as ceiling $Round down, to the previous integralAlso known as floor GTruncate to the closest integral to the fractional number closer to 0.TThis is equivalent to roundUp for negative Number and roundDown for positive Number Round to the nearest integral roundNearest 3.64 > roundNearest 3.4 3 -types that have sign and can be made absoluteSign of a signed number     (     (          None)09DR/Method to support basic trigonometric functions the famous pi value!sine"cosine#tan$sine-1%cosine-1& tangent-1'hyperbolic sine(hyperbolic cosine)hyperbolic tangent*hyperbolic sine-1+hyperbolic cosine-1,hyperbolic tangent-1 !"#$%&'()*+,-. !"#$%&'()*+, !"#$%&'()*+,  !"#$%&'()*+,-.? BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DIR/BAn error related to the evaluation of a Partial value that failed.?it contains the name of the function and the reason for failure0Partialiality wrapper."Throw an asynchronous PartialError1CCreate a value that is partial. this can only be unwrap using the 2 function2Dewrap a possible partial value*Partial function to get the head of a list1Partial function to grab the value inside a Maybe /012 /012 /012@ BSD-styleHaskell Foundation experimentalportableNone)0DR3Big Endian value6Little Endian value9.Convert a value in cpu endianess to big endian:5Convert from a big endian value to the cpu endianness;1Convert a value in cpu endianess to little endian<8Convert from a little endian value to the cpu endianness 3456789:;< 3456789:;<3456789:;<A BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0ABDRT=)Primitive monad that can handle mutation.For example: IO and ST.>3type of state token associated with the PrimMonad m?0type of variable associated with the PrimMonad m@mUnwrap the State# token to pass to a function a primitive function that returns an unboxed state and a value.A&Throw Exception in the primitive monadB(Run a Prim monad from a dedicated state#C&Build a new variable in the Prim MonadD#Read the variable in the Prim MonadE$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 monad=>?@ABCDE=>?@ABCDE =>?@ABCDEB BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0BDRF-Create a pointer with an associated finalizerI3Check 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 ptrJ$create a new FinalPtr from a PointerK'Create a new FinalPtr from a ForeignPtrL.Cast a finalized pointer from type a to type bN}Looks at the raw pointer inside a FinalPtr, making sure the data pointed by the pointer is not finalized during the call to fOUnsafe version of NFGHIJKLMNO FGHIJKLMNO FGHIJKLMNOC BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)09;BDRT PNRepresent 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.Q%get the size in bytes of a ty elementR-return the element stored at a specific indexS.Read an element at an index in a mutable arrayT7Write an element to a specific cell in a mutable array.URead from Address, without a state. the value read should be considered a constant for all pratical purpose, otherwise bad thing will happens.V4Read a value from Addr in a specific primitive monadW3Write a value to Addr in a specific primitive monadICast a Size linked to type A (Size A) to a Size linked to type B (Size B)"PQRSTUVWPRSTQUVWPQRSTUVW  BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )069;DR3456789:;<=>?@ABCDEPRSTQUVWPQRSTUVW=>?@ABCDE678;<3459:D 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 wordE 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.         (c) Vincent Hanquez 2014-2017 BSD-styleVincent Hanquez provisionalnon-portable (requires POSIX)None)0DRXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~XYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~܅YXqrstuvwxyz{|}~ponmlkjihgfedcba`_^]\[ZXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~FNone)0DRXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~(c) Vincent Hanquez 2014-2017 BSD-styleVincent Hanquez provisionalnon-portable (requires Linux)None)0DRG BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DR   H BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalGoodNone )0DRTqtry to fill the ptr with the amount of data required. Return the number of bytes, or a negative number otherwise   BSD-style foundation experimentalportableNone)0:DR Path type classddefines the Path associated types and basic functions to implement related to the path manipulation # TODO, add missing enhancement: ~splitExtension :: PathEnt path -> (PathEnt path, PathEnt path) addExtension :: PathEnt path -> PathEnt path -> PathEnt path ( .$) :: path -> PathEnt path -> path (- .") :: path -> PathEnt path -> path 'the associated PathEntity of the given path this type is the minimal element contained in the Path a Path is not a collection but it is possible to see this associated type equivalent to the I type family#the associated prefix of the given pathin the case of a JK-, it is a void (i.e. `()`) in the case of a JL!, it is the schema, host, port...'the associated suffix of the given pathin the case of the JK/, it is a void (i.e. `()`) in the case of the JL!, it is a the query, the fragment"join a path entity to a given path+split the path into the associated elements+build the path from the associated elements*parent is only going to drop the filename.Gif you actually want to reference to the parent directory, simply uses:  parent "." = "." <> ".." parent ("foo.hs" :: FilePath).%parent ("foo/bar/baz.hs" :: FilePath)foo/bar"get the filename of the given path.If there is no filename, you will receive the  of the filename ("foo.hs" :: FilePath)foo.hs'filename ("foo/bar/baz.hs" :: FilePath)baz.hsget the path prefix information prefix ("/home/tab" :: FilePath)Absoluteprefix ("home/tab" :: FilePath)Relative#or for URI (TODO, not yet accurate) prefix " .http://github.com/vincenthz/hs-foundation?w=1"; == URISchema http Nothing Nothing "github.com" Nothing get the path suffix information suffix ("/home/tab" :: FilePath)()#or for URI (TODO, not yet accurate) suffix " .http://github.com/vincenthz/hs-foundation?w=1"' == URISuffix (["w", "1"], Nothing)    BSD-style foundation experimentalportableNone)0DR TODO this is not implemented yet                        BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )09;<=DR1Class of things that can be converted from a to bMNone )0DORT<A component of a conduit pipeline, which takes a stream of input, produces a stream of output&, performs actions in the underlying monad, and produces a value of result( when no more output data is available.%A pipe producing and consuming values A basic intuition is that every Pipe produces a stream of outputO values and eventually indicates that this stream is terminated by sending a result. On the receiving end of a Pipe, these become the input and upstream parameters.WProvide new output to be sent downstream. This constructor has three fields: the next Pipe< to be used, a finalization function, and the output value.^Request more input from upstream. The first field takes a new input value and provides a new Pipei. The second takes an upstream result value, which indicates that upstream is producing no more results. Processing with this Pipe) is complete, providing the final result.!4Require running of a monadic action to get the next Pipe."EReturn leftover input, which should be provided to future operations. Await for a value from upstream.Send a value downstream.Same as W, but additionally takes a finalizer to be run if the downstream component terminates. \Provide leftover input to be consumed by the next component in the current monadic binding.!%Run a conduit pipeline to completion."*Run a pure conduit pipeline to completion.#Run a conduit pipeline in a ! context for acquiring resources.#Internal: run a Pipe%PSend the output of the first Conduit component to the second Conduit component.A$%&'()*+,-./0123 !"4 finalizer !"#$#%56789:;<=>?@ABCDEFGHIJKLMNO$%/023 !" !"#$%70$%&'()*+,-./0123 !"4 !"#$#%56789:;<=>?@ABCDEFGHIJKLMNON BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DRP?Simple helper to split a list repeatly when the predicate matchPQRSTUPQRSTUPQRSTUO BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )069;DR&1Collection of things that can be looked up by Key&'()V&'()&'()V BSD-styleHaskell Foundation experimentalportableNone )09;DR*UExtending the Storable type class to the types that can be sequenced in a structure.-&Storable type of self determined size.1like . but at a given offset.2like / but at a given offset.3*+,-./W012X3456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ 9]*,+-./012 -./*+,90]12/*+,-./W012X3456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableSafe)0DRQONPQPONP BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)05DR[0Class of product types that have a third element^1Class of product types that have a second elementa0Class of product types that have a first elementdStrict tuple (a,b,c,d)fStrict tuple (a,b,c)hStrict tuple (a,b) [\]^_`abcdefghiYZ[\]^_`abcdefghi[\]^_`abcdefghi[\]^_`abcdefghiYZ[\]^_`abcdefghi BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone ),09;<=DRjRA generalized version of indexed accessor allowing access to tuples n'th element.Indexing starts at 1, as c is used to get first element.jklmnopqrstuvwxyz{|}~jkljkljklmnopqrstuvwxyz{|}~QNone)0DRjCompute the size of the listkSum the element in a listjkjkjkRNone)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)0DRUnsafe Shift Left OperatorUnsafe Shift Right Operator&Round up (if needed) to a multiple of  alignment closst to m alignment needs to be a power of two.alignRoundUp 16 8 = 16 alignRoundUp 15 8 = 16(Round down (if needed) to a multiple of  alignment closest to m alignment needs to be a power of two /alignRoundDown 15 8 = 8 alignRoundDown 8 8 = 8Number to AlignAlignment (power of 2)Number to AlignAlignment (power of 2)~}|{zyxwvutsrqpo~}|{zyxwvutsrqpoS BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DR?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 vectormnopqrsltuvwxy mnopqrsltuvwmnopqrsltuvwxyT BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0BDRT 7A Mutable array of types built on top of GHC primitive./Element in this array can be modified in place.zread 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 z 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.~-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.ECopy a number of elements from an array to another array with offsets1return 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 arrayaIf the mutable array is unpinned, a trampoline buffer is created and the data is only copy when f return.z{|}~"the start pointer with a finalizer/the number of elements (in elements, not bytes)destination arrayoffset at destination source arrayoffset at sourcenumber of elements to copyz{|}~z{|}~U BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone $)0BDR/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 interface4Copy 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.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.+return the number of elements of the array.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.%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.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)&make an array from a list of elements.transform an array to a list."Check if two vectors are identicalCompare 2 vectors7Append 2 arrays together by creating a new bigger array9update an array by creating a new array with the updates.Jthe operation copy the previous array, modify it in place, then freeze it.L"the start pointer with a finalizer/the number of elements (in elements, not bytes)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 arraythe size of the array,the function that set the value at the indexthe array createdthe size of the arrayfilling function thatHPRSTQUVW{}J BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DRV BSD-style foundation experimentalportableNone )0:BDRHassuming the given ByteArray 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.WNone)0DRMutable Byte Array alias BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DRA     FGHIJKLMNO FGHILJKNOMX BSD-style Foundation experimentalportableNone)0:DRZthe unit element use for the encoding. i.e. Word8 for ASCII7 or UTF8, Word16 for UTF16...Idefine the type of error handling you want to use for the next function. %type Error UTF8 = Either UTF8_Invalidnconsume an `Unit encoding` and return the Unicode point and the position of the next possible `Unit encoding`Yhelper 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 ```Input's encoding typeOutput's encoding typethe input raw arrayY BSD-style Foundation experimentalportableNone)0BDR>validate a given byte is within ASCII characters encoring size+This function check the 8th bit is set to 0fconsume an Ascii7 char and return the Unicode point and the position of the next possible Ascii7 char method to access a given byteindex of the byte_either successfully validated the ASCII char and returned the next index or fail with an error\expecting it to be a valid Ascii character. otherwise this function will throw an exceptionZ BSD-style Foundation experimentalportableNone)0BDR  !"#$%&' !" !"#$%&'[ BSD-style Foundation experimentalportableNone)0BDR ()*+,-./0()*+,()*+,-./0\ BSD-style Foundation experimentalportableNone)0BDR1234567813412345678] BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0:BDIR7DVarious String Encoding that can be use to convert to and from bytes9ADifferent way to encode a Character in UTF8 represented as an ADT: UTF8 Encoder?Possible failure related to validating bytes of UTF8 sequences.;Mutable String Buffer.Note that it's hard to use properly since the UTF8 encoding is variable, and thus you can't mutable previously filled data without potentially have to move all the data around.See <( for an idea of the scale of the problem6Opaque packed array of characters in the UTF8 encoding="Validate a bytearray for UTF8'nessUOn success Nothing is returned On Failure the position along with the failure reason> Similar to = but works on a ?(Convert a String to a list of characters/The list is lazily created as evaluation needed@-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.ACheck if a String is nullBGCreate 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.CSCreate a string with the remaining Chars after dropping @n Chars from the beginningDiSplit a string at the Offset specified (in Char) returning both the leading part and the remaining part.ECReturn the offset (in bytes) of the N'th sequence in an UTF8 StringF Similar to B but from the endG Similar to C but from the endH Similar to D but from the endI: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"]J8Internal 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.K;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.LMBreak a string into 2 strings at the location where the predicate return TrueMEBreak a string into 2 strings at the first occurence of the characterNApply a  predicateY to the string to return the longest prefix that satisfy the predicate and the remainingO>Return whereas the string contains a specific character or notPIntersperse 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"QAllocate a new StringI with a fill function that has access to the characters of the source String.Rsize in bytes.this size is available in o(1)SLength of a String using Sizethis size is available in o(n)T*Length of a string in number of charactersUReplicate a character c n$ times to create a string of length nVCopy the StringkThe slice of memory is copied to a new slice, making the new string independent from the original string..WCreate a single element StringX5Allocate a MutableString of a specific size in bytes.Y"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.<LMonomorphically map the character in a string and return the transformed oneZAAppend a Char to the end of the String and return this new String[HPrepend a Char to the beginning of the String and return this new String\UExtract the String stripped of the last character and the last character if not emptyIf empty, Nothing is returned]XExtract the First character of a string, and the String stripped of the first character.If empty, Nothing is returned^LLook for a predicate in the String and return the matched character, if any._=Sort the character in a String using a specific sort function`1Filter characters of a string using the predicateaReverse a stringb$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.cWReturn 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.dSDecode 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.3Split lines in a string using newline as separation2Split words in a string using spaces as separation words "Hello Foundation"  Hello,  Foundation e&Append a character to a String builderf,Create a new String builder using chunks of  sizeChunksIZ9ghij:k;lmn=>opqrstuvwx?@ABCDEFGHIJKLMNOPQ Source string)Length of the destination string in bytes7Function called for each character in the source StringReturns the filled new stringRSTUVWX$in number of bytes, not of elements.Yy<Z[\]^_`abczd{ef|}~7;lm>?ABCDFGHIJLMNOPTUVWY<Z[\]^_`abcdefK9ghij:k;lmn=>opqrstuvwx?@ABCDEFGHIJKLMNOPQRSTUVWXYy<Z[\]^_`abczd{ef|}~^None )+0ABDRT,stop execution and displays an error message BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DR_ BSD-style Foundation experimentalportableNone)0DR!Print a string to standard output0Print a string with a newline to standard output BSD-style foundation experimentalportableNone)0DR4Enumeration of the known GHC supported architecture.9get the operating system on which the program is running.Either return the known  or a strict  of the OS name.This function uses the base's  function.<get the machine architecture on which the program is running1Either return the known architecture or a Strict  of the architecture name.This function uses the base's  function.get the compiler nameKget the compilerName from base package but convert it into a strict String*returns the number of CPUs the machine has&endianness of the current architectureDMLKJDMLKJ BSD-style FoundationstablegoodNone)0DRGet some of the system entropy` BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0BDRMutable Array of a Array of a1return 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 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.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 arrayDdestination arrayoffset at destination source arrayoffset at sourcenumber of elements to copydestination 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 arraythe size of the array,the function that set the value at the indexthe array created,BaNone)0DRb BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DRElement type of a collectionc BSD-style foundation experimentalportableNone)0DR-Collections that can be built chunk by chunk.Use the  instance of  to chain  operations and feed it into :HrunST $ build 32 (append 'a' >> append 'b' >> append 'c') :: UArray Char"abc">Mutable collection type used for incrementally writing chunks.)Unit of the smallest step possible in an  operation.qA UTF-8 character can have a size between 1 and 4 bytes, so this should be defined as 1 byte for collections of '.d BSD-style Foundation experimentalportableNone )0:ADRT &A set of methods for ordered colectionCheck if a collection is empty,Length of a collection (number of Element c)1Check if a collection contains a specific elementThis is the inverse of .;Check if a collection does *not* contain a specific elementThis is the inverse of .'Get the maximum element of a collection'Get the minimum element of a collectionADetermine is any elements of the collection satisfy the predicateADetermine is all elements of the collection satisfy the predicate$NonEmpty property for any Collection#This can only be made, through the  smart contructor1Smart constructor to create a NonEmpty collectionsIf the collection is empty, then Nothing is returned Otherwise, the collection is wrapped in the NonEmpty propertysame as Z, but assume that the collection is non empty, and return an asynchronous error if it is.  e BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DR/Give the ability to fold a collection on itself%Left-associative fold of a structure.In the case of lists, foldl, when applied to a binary operator, a starting value (typically the left-identity of the operator), and a list, reduces the list using the binary operator, from left to right: Efoldl f z [x1, x2, ..., xn] == (...((z `f` x1) `f` x2) `f`...) `f` xnNote that to produce the outermost application of the operator the entire input list must be traversed. This means that foldl' will diverge if given an infinite list.hAlso note that if you want an efficient left-fold, you probably want to use foldl' instead of foldl. The reason for this is that latter does not force the "inner" results (e.g. z f x1 in the above example) before applying them to the operator (e.g. to (f x2)). This results in a thunk chain O(n) elements long, which then must be evaluated from the outside-in.QLeft-associative fold of a structure but with strict application of the operator.&Right-associative fold of a structure. @foldr f z [x1, x2, ..., xn] == x1 `f` (x2 `f` ... (xn `f` z)...)SRight-associative fold of a structure, but with strict application of the operator.f BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )069;DR.Collection of elements that can indexed by intgNone)06DRKA monomorphic functor that maps the inner values to values of the same typeh BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DRjCollection of things that can be made mutable, modified and then freezed into an MutableFreezed collection  i BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )069:;<DR&A set of methods for ordered colection*Take the first @n elements of a collection)Take the last @n elements of a collection*Drop the first @n elements of a collection)Drop the last @n elements of a collection*Split the collection at the @n'th elements7Split the collection at the @n'th elements from the end:Split on a specific elements returning a list of colletion1Split a collection when the predicate return true1Split a collection when the predicate return true The  v function takes an element and a list and `intersperses' that element between the elements of the list. For example, &intersperse ',' "abcde" == "a,b,c,d,e"   xs xss is equivalent to ( (  xs xss)). It inserts the list xs in between the lists in xss and concatenates the result. 2Split a collection while the predicate return true 2Filter all the elements that satisfy the predicate GPartition the elements thtat satisfy the predicate and those that don'tReverse a collectionyDecompose a collection into its first element and the remaining collection. If the collection is empty, returns Nothing.Decompose a collection into a collection without its last element, and the last element If the collection is empty, returns Nothing.+Prepend an element to an ordered collection*Append an element to an ordered collection(Find an element in an ordered collection=Sort an ordered collection using the specified order function)Create a collection with a single element/get the first element of a non-empty collection.get the last element of a non-empty collectionGExtract the elements after the first element of a non-empty collection.GExtract the elements before the last element of a non-empty collection.ZTakes two collections and returns True iff the first collection is a prefix of the second.ZTakes two collections and returns True iff the first collection is a suffix of the second."               j BSD-style foundation experimentalportableNone )09;<=DR takes two collections and returns a collections of corresponding pairs. If one input collection is short, excess elements of the longer collection are discarded.Like , but works with 3 collections.Like , but works with 4 collections. Like , but works with 5 collections.!Like , but works with 6 collections."Like , but works with 7 collections.##q transforms a collection of pairs into a collection of first components and a collection of second components.$Like #0, but works on a collection of 3-element tuples.%Like #0, but works on a collection of 4-element tuples.&Like #0, but works on a collection of 5-element tuples.'Like #0, but works on a collection of 6-element tuples.(Like #0, but works on a collection of 7-element tuples.** generalises j by zipping with the function given as the first argument, instead of a tupling function. For example, * (+)U is applied to two collections to produce the collection of corresponding sums.+Like *, but works with 3 collections.,Like *, but works with 4 collections.-Like *, but works with 5 collections..Like *, but works with 6 collections./Like *, but works with 7 collections.& !"#$%&'()*+,-./#$ !"%&'()*+,-./  !"#$%&'()*+,-./ BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )069;DRj&'()     #$ !"%&'()*+,-./n !"#$%&'(     &'())*+,-./k BSD-style.Alfredo Di Napoli <alfredo.dinapoli@gmail.com> experimentalportableNone )0ABDORTReturns the length of this 08, by summing each inner length. Complexity: O(n) where n0 is the number of chunks, as U.length u is O(1).Returns >* if the given element is contained in the 0. Complexity: O(n) where n0 is the number of chunks, as U.length u is O(1).TODO: Improve implementation.TODO: Improve implementation.Equality between 0X. This function is fiddly to write as is not enough to compare for equality the inner /(s), we need an element-by-element comparison.$Take the first n elements from this 0. TODO: Perform compaction? Compacting the underlying chunks will have the snag of copying data, but the pro of improving cache-friendliness and reduce data scattering.$0     0#0      BSD-styleHaskell Foundation experimentalportableNone )0:DORT9Simple parser structure?The continuation of the next buffer value, and the parsed value<The continuation of the current buffer, and the error string<3Simple parsing result, that represent respectively:failure: with the error message+continuation: that need for more input data9success: the remaining unparsed data and the parser valueB#some bytes didn't satisfy predicateC&not enough data to complete the parserD,only use in the event of Monad.fail functionEthe expected inputFbut received this dataG"Run a parser on an @initial input.|If the Parser need more data than available, the @feeder function is automatically called and fed to the More continuation.H*Run a Parser on a ByteString and return a <Iparse only the given inputrThe left-over `Element input` will be ignored, if the parser call for more data it will be continuously fed with < (up to 256 iterations).K,Get the next `Element input` from the parserL4Parse a specific `Element input` at current position]if the `Element input` is different than the expected one, this parser will raise a failure.M2Parse a sequence of elements from current position;if the following `Element input` don't match the expected input, completely, the parser will raise a failureO8Take @n elements from the current position in the streamP/take one element if satisfy the given predicateQPTake elements while the @predicate hold from the current position in the streamRCTake the remaining elements from the current position in the streamS8Skip @n elements from the current position in the streamTWSkip `Element input` while the @predicate hold from the current position in the streamUOSkip all the remaining `Element input` from the current position in the streamV.repeat the given Parser a given amount of timeBIf you know you want it to exactly perform a given amount of time:%``` repeat (Exactly Twice) (element a) ```8If you know your parser must performs from 0 to 8 times:*``` repeat (Between Never (Other 8)) ```QThis interface is still WIP* but went handy when writting the IPv4/IPv6 parsers.6123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTU !"VWXYZ[\]^*U123456789:;<=>?@DABCEFGHIJKLMNOPQRSTUV*9:;<=>?@ABCDEFHGIJLPKMNOQRSTUU45678123V%123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTU !"VWXYZ[\]^ BSD-styleHaskell Foundation experimentalportableNone )0:BDIRd7Opaque packed array of characters in the ASCII encoding#GCreate a string composed of a number @n of Chars (Unicode code points).<if the input @s contains less characters than required, then$SCreate a string with the remaining Chars after dropping @n Chars from the beginning%: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"]& size in bytesgCopy the AsciiString':Allocate a MutableAsciiString of a specific size in bytes.icConvert 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  fromBytes0()d*e+,-./01#$2345%6789&:fg'$in number of bytes, not of elements.h;<=>?@ABCijklmnopqrdefghijk dehfiegjk-()d*e+,-./01#$2345%6789&:fg'h;<=>?@ABCijklmnopqrl BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DRD5Return the element at a specific index from a Bitmap.5If the index @n is out of bounds, an error is raised.EMReturn the element at a specific index from an array without bounds checking.NReading from invalid memory can return unpredictable and invalid values. use D if unsure.F&make an array from a list of elements.Gtransform an array to a list.H"Check if two vectors are identicalICompare 2 vectorsJ7Append 2 arrays together by creating a new bigger arrayTODO completely non optimized=vKwLMNOPQRSTUVWXDEYZ[\FGHIJ]^_`abcdefghijklmnopqrstuvwxyz{|}~ vwUVWXDE[J]fg;vKwLMNOPQRSTUVWXDEYZ[\FGHIJ]^_`abcdefghijklmnopqrstuvwxyz{|}~ BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone )0BDR P0vw 0wvPmNone)0DR x9Incremental Hashing state. Represent an hashing algorithm$the base primitive of this class is ", append mix a Word8 in the stateThe class allow to define faster mixing function that works on bigger Word size and any unboxed array of any PrimType elements.Associate type when finalizing the state with Create a new Hashing context.Finalize the state and returns the hash result:Mix a Word8 (Byte) into the state and return the new state4Mix a Word16 into the state and return the new state4Mix a Word32 into the state and return the new state4Mix a Word64 into the state and return the new state=Mix an arbitrary sized unboxed array and return the new state x xxn BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalgoodNone )0BDIR yFNV1a 64 bit statezFNV1a 32 bit state{FNV1 64 bit state|FNV1 32 bit stateFNV1(a) hash (64 bit variants)FNV1(a) hash (32 bit variants)6compute FNV1 (32 bit variant) of a raw piece of memory7compute FNV1a (32 bit variant) of a raw piece of memory6compute FNV1 (64 bit variant) of a raw piece of memory7compute FNV1a (64 bit variant) of a raw piece of memoryyz{|yz{|yz{|o BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalgoodNone)0DR}"Type with the ability to be hashedHashable doesn't have any specific rules, and it's made for raw speed. More specifically don't expect different type representing the same data to hash to the same value .hashMix (1 :: Integer) /= hashMix (1 :: Word8)True}~}~}~None )09;DIRIPv4 data typeParse a IPv4 address  ! BSD-style*Nicolas Di Prima <nicolas@primetype.co.uk> experimentalportableNone )09;DIRIPv6 data type serialise to human readable IPv6/toString (fromString "0:0:0:0:0:0:0:1" :: IPv6)#create an IPv6 from the given tupledecompose an IPv6 into a tuple#IPv6 Parser as described in RFC4291for more details: 4https://tools.ietf.org/html/rfc4291.html#section-2.2which is exactly:``` ipv6ParserPreferred  | ipv6ParserIPv4Embedded  | ipv6ParserCompressed ```1IPv6 parser as described in RFC4291 section 2.2.11The preferred form is x:x:x:x:x:x:x:x, where the xPs are one to four hexadecimal digits of the eight 16-bit pieces of the address.)`ABCD:EF01:2345:6789:ABCD:EF01:2345:6789``2001:DB8:0:0:8:800:200C:417A`'IPv6 address with embedded IPv4 address`when dealing with a mixed environment of IPv4 and IPv6 nodes is x:x:x:x:x:x:d.d.d.d, where the xZs are the hexadecimal values of the six high-order 16-bit pieces of the address, and the dls are the decimal values of the four low-order 8-bit pieces of the address (standard IPv4 representation).`0:0:0:0:0:0:13.1.68.3``0:0:0:0:0:FFFF:129.144.52.38` `::13.1.68.3``::FFFF:129.144.52.38`1IPv6 parser as described in RFC4291 section 2.2.2The use of "::" indicates one or more groups of 16 bits of zeros. The "::" can only appear once in an address. The "::" can also be used to compress leading or trailing zeros in an address.`2001:DB8::8:800:200C:417A` `FF01::101``::1``::`  p BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalgoodNone )0BDR5Sip State 1-3 (1 compression rounds, 3 digest rounds)5Sip State 2-4 (2 compression rounds, 4 digest rounds)Siphash Hash value SigHash Keysame as hash], except also specifies the number of sipround iterations for compression (C) and digest (D).#  BSD-style FoundationNone)0DR xyz{|}~ }~x|{zy" BSD-style experimentalGoodNone)0DRRNG based on ChaCha core.The algorithm is identical to the arc4random found in recent BSDs, namely a ChaCha core provide 64 bytes of random from 32 bytes of key.GAn alias to the default choice of deterministic random number generatorUnless, you want to have the stability of a specific random number generator, e.g. for tests purpose, it's recommended to use this alias so that you would keep up to date with possible bugfixes, or change of algorithms.[A simple Monad class very similar to a State Monad with the state being a RandomGenerator.,A Deterministic Random Generator (DRG) class!Initialize a new random generator)Generate N bytes of randomness from a DRG7A monad constraint that allows to generate random bytes6Run a pure computation with a Random Generator in the   # BSD-style foundation experimentalportableNone)0DR'errors related to FileName manipulation0this means a null byte was found in the FileName5this means a path separator was found in the FileNameencoding error"some unknown trainling bytes found+A filename (or path entity) in the FilePath  Authorised"""."".." "foundation" Unauthorised"/""file/""/file" "file/path")error associated to filepath manipulation2this mean there were 2 contiguous path separators.9This is not valid in Foundation's FilePath specifications$FilePath is a collection of FileNameTODO: Eq and Ord are implemented using Show This is not very efficient and would need to be improved Also, it is possible the ordering is not necessary what we want in this case.#A FilePath is one of the following:  An Absolute:#starts with one of the follwing "/" A relative:don't start with a "/" authorised:"/""filepath"".""..""workhaskellhs-foundation" unauthorised"path//""information about type of FilePathA file path being only  or ..define the Path separator for POSIX systems : / convert a FileName into a String?This function may throw an exception associated to the encoding*conversion of FileName into a list of Char"this function may throw exceptions,conversion of a FilePath into a list of Char"this function may throw exceptions/build a file path from a given list of filename7this is unsafe and is mainly needed for testing purpose(build a file name from a given ByteArray7this is unsafe and is mainly needed for testing purpose)   J BSD-style foundation experimentalportableNone)0DRq BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DRgContains all the information related to a file mapping, including the size and the finalizer function.kFrom a file mapping, create a final ptr which will automatically unmap memory when the pointer is garbage.r(c) Vincent Hanquez 2014 BSD-styleVincent Hanquez provisionalnon-portable (requires POSIX)None)0DRMemory synchronization flagsperform asynchronous write.perform synchronous write.invalidate cache data.Advice to put on memory.only define the posix one. no specific advice, the default. BExpect page references in random order. No readahead should occur. RExpect page references in sequential order. Page should be readahead aggressively. IExpect access in the near future. Probably a good idea to readahead early (Do not expect access in the near future. Memory protection Mapping flag)memory changes are shared between process%memory changes are private to processMap pages of memory.vIf fd is present, this memory will represent the file associated. Otherwise, the memory will be an anonymous mapping.use mmapUnmap pages of memoryuse munmap7give advice to the operating system about use of memorycall madvise%lock a range of process address spacecall mlock'unlock a range of process address spacecall munlock set protection of memory mappingcall mprotect4memorySync synchronize memory with physical storage.FOn an anonymous mapping this function does not have any effect. call msync&Return the operating system page size.call sysconf'      !"#$%&*The address to map to if MapFixed is used.The length of the mapping1the memory protection associated with the mapping'()     )      !"#$%&'()sNone)0DR)t BSD-style Foundation experimentalportableNone)0DR2list the file name in the given FilePath directoryqTODO: error management and not implemented yet getDirectory :: FilePath -> IO [FileName] getDirectory = undefinedOpen a new handle on the fileClose a handle-Read binary data directly from the specified *.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 the specified size, or an empty array if EOF has been reached. is implemented in terms of hGetBuf.+hGetNonBlocking 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 an empty array.7Note: on Windows, this function behaves identically to .,Like , except that a shorter array may be returned if there are not enough bytes immediately available to satisfy the whole request. ,N only blocks if there is no data available, and EOF has not yet been reached. filepath mode act opens a file using the mode and run acta. the by-product handle will be closed when act finish, either normally or through an exception.(The value returned is the result of act@IRead a binary file and return the whole content in one contiguous buffer.oFold over chunks file calling the callback function for each chunks read from the file, until the end of file. +,-Fold callback functioninitial accumulator File to read.gfedc+, +,-.  BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DRgfedcgfedc$ BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DR*Map in memory the whole content of a file.COnce the array goes out of scope, the memory get (eventually) unmap*Map in memory the whole content of a file,// BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNone)0DR:Alias to Prelude String ([Char]) for compatibility purpose&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.XReturns a list of the program's command line arguments (not including the program name).H  !"#$%&;>'()*+,-./0<=1ABC2345678:?@IQONPTWV\^ba`_hijklnm  /012P[\]^_`abcdefghi     Vhifgdeabc^_`[\]Wk!  QPON$ #H  0<=1ABC&;>'3:?@+,-.56784*/I2)(P%\     hjiTba`_"^nml01/2None)0DROperator version of %. !"#$% !"#%$20uvwxyzxy{x|}x|~x|x|uuxyxyxyxyxyxxxxxxxxyxyxyxyxyxyx|x|uxyxyuxxxxyxyuuuuuxxxxxyuxuuxxxxxxuxyxyuxxuuuxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx x x x x xxxxxxxxxxxxxx|x|x|x| x|!x|"x#$x#%x#&x#'x#(x#)x#*x#+x,-x,.x,/xy0xy1xy2xy3xy4xy5xy6xy7xy8xy9xy:x;<x=u>u?u@uAuBuCuDuEuFuGHIJKLMNO P Q R S T U V-W-X-Y-Z-[-\1]2^4_4`4a4b4c4d4e4f4g5h5ijklmnopqrstuvwxyz{|}8~888889999::::;;;;;;;;;;;<<<====????@@@@@@@@@@AAAAAAAAABBBBBBBBBBCCCCCCCC      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~LLMMMMMMMMMMMMMMOOOOPPPPPPPPPPPPPPPRRRRR R R R R    STTUUUUUUUU]]]]] ]!]"]#]$]%]&]'](])]*]+],^-_._/0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTU`V`WaXaYbIcZc[c\c]c^d_d`dadbdcdddedfdgdhdidjdkelemeneoepfqfrfsgtguhvhwhxhyhzh{h|h}h~hhhhiiiiiiiiiiiiiiiiiiiiiiiiiiiiijjjjjjjjjjjjjjjjjjjjk*Y)+,llmnnnnoo!!!!! ! ! ! ! !!!!!!pp"""""""""""" "!"""#"$"%#&#K#'#(#)#*#+#,#-#.#/#0#1#2#3#4#5#6#7#8#9#:#;#<#=t>t?t@tAtBtCtD$E$FGHIJKLMNO&P&Q&Q&R&S'T'U'V'W'X'Y'Z*[*\*]*^*_*`*[*a*b*c*d*e*fug+h+i+j-k-l-m-n-o-p-q-r-s-t-u-v-w-x-y-z-{-|-}-~--------------------x111x,x,xxxxxxxxxxxxxxxxxHxxxxxxxxxxxdx;-2222xxx3333333333334444466666666666jt88999999999999999999:::::::::::::::;;;;;;;;;;;;;;;;;; ; ; ; ; ;;;;;;;;;;<<<<<<<<< <!<"<#<$<%=&='=(=(=)=*=+=,=-=.=/=0=1=2=3=4=5=6=7=8>9x:;<?=??>?????@?A@B@CADAEAFAGAHAIAJAKBLBMBNBOBPCQCRCSCTCUCVCWCXCYCZC[C\C]C^C_C`CaCbCcCdCeCfCgChCiCjDkDlDmDnDoDpEqErEsEtEQEQEuEvEwGxGxGyHzH{H{H|H}H~HHHHHMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMNNNNNNOPPPPPPPPPPPPPPPPPQaQSSSSSSSSSSSSSSTTTTTTTTTTTTTTTTTTTTUYU|UUUaUUU{UzUUUUULUU]UUUUUUUU}UUUUUUUU`UUUUUUUUUUsUUUbUUUUUUUUUUUUUmUoUnUUUUUUUUVVV W W W W xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx x x!x!x"x"x#x#x$x%x&x'x'x(x(x)x)x*x*X+X,X-X.XX/Y0Y1YYY2Y3Y4Y5YY6Y7Z!Z!Z8Z9Z5Z1ZZ:Z;[[[<[$[=[1[[>[?\@\@\ \ \1\\A\B]C]D]E]F]G]H]I]J]`]]]]K]]]]]]L]]]]b]]]]]a]]Y]]]]]]]]]]]]]s]M]]]N]O]P]Q]D]E]&]R]S]T]U]1]V]W]X]]}]]Y]Z][]\]]]^]_]`]axBxC````````{`z`|`Y``````]`V`W``}`L```a`````b```````````````````````c```m`o`n```d`e`f`g`h`i`jakalamancocpcqdhdrdsdtdudvdwexeyezf{f|f}f~gggghhiiiiijjjjjjjjjjjjjjjjjjkakbkekdkLkkkk]kkkk`kkkkkkkkkkkkkkkkkkkkkkf1}IJ`alllllLll]lllllll|l}lzl{lllllalllll`lllllllllllllllllmlolplnllllllllllllmmmmmmmmmmmnnnnnnnnnnnnnnnnnnnnnnooooooooooooooooooooo!!!!!!!!!!pppppppppppppppppppppppppp p p p p ppp""""###########&#K### #!#"###$#%#&q'q(q)q'q*q+q,r-r.r/r0r1r2r3r4r5r6r7r8r9r:r;r<r=r>r?r@rArBrCrDrErFrGrHrIrJrKrLrMrNrOrPrQrRrExSTtUtVtWtX$YZ'foundation-0.0.4-IaToPwkcfjq4Ci4a0FEJlA FoundationFoundation.Network.IPv4Foundation.Class.StorableFoundation.System.InfoFoundation.MonadFoundation.Class.BifunctorFoundation.Parser#Foundation.System.Bindings.PosixDef Foundation.IOFoundation.BitsFoundation.System.Bindings.HsFoundation.StrictFoundation.PrimitiveFoundation.Monad.ReaderFoundation.Monad.StateFoundation.NumericalFoundation.Math.TrigonometryFoundation.Foreign Foundation.System.Bindings.Posix Foundation.System.Bindings.LinuxFoundation.VFS.PathFoundation.VFS.URIFoundation.ConvertibleFoundation.ConduitFoundation.CollectionFoundation.Tuple.NthFoundation.ArrayFoundation.Array.InternalFoundation.StringFoundation.System.EntropyFoundation.String.ASCIIFoundation.HashingFoundation.Network.IPv6Foundation.RandomFoundation.VFS.FilePathFoundation.IO.FileMapFoundation.String.InternalFoundation.Primitive.Base16Foundation.Numerical.PrimitivesFoundation.Monad.MonadIOFoundation.Internal.ProxyFoundation.Internal.PrimitiveFoundation.Internal.PrimTypesFoundation.Internal.NaturalFoundation.Internal.NumLiteralFoundation.Internal.IsListFoundation.Internal.IdentityFoundation.Internal.CallStackFoundation.Internal.BaseFoundation.Internal.ByteSwapFoundation.Internal.MonadTransFoundation.Monad.ExceptionFoundation.Monad.TransformerFoundation.Monad.IdentityFoundation.Monad.BaseFoundation.Numerical.FloatingFoundation.Numerical.NumberFoundation.Numerical.Additive#Foundation.Numerical.Multiplicative Foundation.Numerical.SubtractiveFoundation.Internal.TypesFoundation.Internal.EnvironmentFoundation.PartialFoundation.Primitive.EndiannessFoundation.Primitive.MonadFoundation.Primitive.FinalPtrFoundation.Primitive.TypesFoundation.Primitive.UtilsFoundation.String.UTF8TableFoundation.System.Bindings Foundation.System.Entropy.CommonFoundation.System.Entropy.UnixElementFoundation.VFSFilePathURIFoundation.Conduit.InternalFoundation.Collection.ListFoundation.Collection.KeyedFoundation.TupleFoundation.Boot.ListFoundation.Boot.BuilderFoundation.Array.Common Foundation.Array.Unboxed.MutableFoundation.Array.UnboxedFoundation.String.ModifiedUTF8"Foundation.Array.Unboxed.ByteArray#Foundation.String.Encoding.Encoding!Foundation.String.Encoding.ASCII7%Foundation.String.Encoding.ISO_8859_1 Foundation.String.Encoding.UTF16 Foundation.String.Encoding.UTF32Foundation.String.UTF8Foundation.Internal.ErrorFoundation.IO.TerminalFoundation.Array.BoxedFoundation.Collection.CopyFoundation.Collection.ElementFoundation.Collection.Buildable Foundation.Collection.CollectionFoundation.Collection.FoldableFoundation.Collection.Indexed"Foundation.Collection.InnerFunctorFoundation.Collection.Mutable Foundation.Collection.SequentialFoundation.Collection.Zippable Foundation.Array.Chunked.UnboxedFoundation.Array.BitmapFoundation.Hashing.HasherFoundation.Hashing.FNVFoundation.Hashing.HashableFoundation.Hashing.SipHash"Foundation.Foreign.MemoryMap.Types"Foundation.Foreign.MemoryMap.PosixFoundation.Foreign.MemoryMapFoundation.IO.Fileghc-primGHC.PrimseqbaseGHC.Base otherwise$GHC.EnumenumFrom enumFromThen enumFromToenumFromThenTo GHC.Classes==>=fail>>=>>fmapreturn Data.String fromStringGHC.Real fromIntegral realToFracGHC.ExtsIsListfromList fromListNtoListmemptymappendmconcat<*>pure*>BoundedEnumEqMonadFunctorOrdGHC.ShowShowData.Typeable.InternalTypeableIsString ApplicativeMonoid GHC.TypesBoolCharDoubleFloatIntGHC.IntInt8Int16Int32Int64 integer-gmpGHC.Integer.TypeIntegerMaybeOrderingRationalIOWordGHC.WordWord8Word16Word32Word64GHC.PtrPtr Data.EitherEitherFalseNothingJustTrueLeftRightLTEQGT System.InfocompilerVersionData.Functor.Identity runIdentityIdentityItem GHC.NaturalNatural Data.Version versionTags versionBranchVersionData.Bifunctorsecondfirstbimap BifunctorControl.Monad.IO.ClassliftIOMonadIO Control.Monad>=>Control.ApplicativeoptionalControl.Category.idSystem.Posix.TypesCModeCOff Data.Monoid<>castPtrGHC.IO.Exception IOException GHC.ExceptiondisplayException fromException toException Exception GHC.IO.IOMode ReadWriteMode AppendMode WriteModeReadModeIOModepartitionEithersrightsleftseither Data.Proxy asProxyTypeOfProxy Data.BitspopCountrotateRrotateL unsafeShiftRshiftR unsafeShiftLshiftLisSignedbitSize bitSizeMaybetestBit complementBitclearBitsetBitbitzeroBitsrotateshift complementxor.|..&.Bits Data.Functionon Data.Functor<$>^^maxBoundminBoundfromEnumtoEnumpredsucc Data.MaybemapMaybe catMaybes listToMaybe maybeToList fromMaybe isNothingisJustmaybe Data.TupleswapuncurrycurryasTypeOfuntil$!flipconst=<<<$<*manysome<|>GHC.Err undefined SomeException/=compare<=&&||not<>maxmin COpenFlags CSysconfName CMemSyncFlags CMemAdviceCMemMappingFlags CMemProtFlagsCFdCErrnosysHsCoreGetErrnostrict1strict2strict3strict4strict5strict6 HasNegationnegate Fractional fromRationalIntegral fromInteger ifThenElseByteSwap MonadBracketgeneralBracket MonadCatchcatch MonadThrowthrow MonadFailureFailuremFail MonadTransliftReaderT runReaderT$fMonadCatchReaderT$fMonadThrowReaderT$fMonadFailureReaderT$fMonadIOReaderT$fMonadTransReaderT$fMonadReaderT$fApplicativeReaderT$fFunctorReaderTStateT runStateT$fMonadCatchStateT$fMonadThrowStateT$fMonadFailureStateT$fMonadIOStateT$fMonadTransStateT $fMonadStateT$fApplicativeStateT$fFunctorStateT FloatingPoint floatRadix floatDigits floatRange floatDecode floatEncode IsNatural toNatural IsIntegral toIntegerAdditiveazero+scale Divisible/ IDivisibledivmoddivModMultiplicative midentity*^recip Subtractive Difference-SizeOffsetIntegralRoundingroundUp roundDown roundTruncate roundNearestSignedabssignumSign SignNegativeSignZero SignPositive$fIntegralRoundingFloat$fIntegralRoundingDouble$fIntegralRoundingRatio$fSignedDouble $fSignedFloat $fSignedInt64 $fSignedInt32 $fSignedInt16 $fSignedInt8 $fSignedInt$fSignedInteger$fEqSign Trigonometrypisincostanasinacosatansinhcoshtanhasinhacoshatanh$fTrigonometryDouble$fTrigonometryFloat PartialErrorPartialpartial fromPartialBEunBELEunLEtoBEfromBEtoLEfromLE PrimMonad PrimStatePrimVar primitive primThrow unPrimMonad primVarNew primVarRead primVarWriteFinalPtr FinalForeignfinalPtrSameMemory toFinalPtrtoFinalPtrForeign castFinalPtrwithFinalPtrNoTouch withFinalPtrwithUnsafeFinalPtrPrimTypeprimSizeInBytes primBaUIndex primMbaURead primMbaUWrite primAddrIndex primAddrRead primAddrWriteCDirentCDir sysPosixDirfdsysPosixClosedirsysPosixRewinddirsysPosixSeekdirsysPosixTelldirsysPosixReaddirRsysPosixReaddirsysPosixFdopendirsysPosixOpendirsysPosixFtruncatesysPosixFnctlPtrsysPosixFnctlNoArg sysPosixClosesysPosixOpenAt sysPosixOpensysPosixSysconfsysPosixMunlock sysPosixMlocksysPosixMprotect sysPosixMsyncsysPosixMadvisesysPosixMunmap sysPosixMmapsysPosix_E2BIGsysPosix_EACCESsysPosix_EADDRINUSEsysPosix_EADDRNOTAVAILsysPosix_EAFNOSUPPORTsysPosix_EAGAINsysPosix_EALREADYsysPosix_EBADFsysPosix_EBADMSGsysPosix_EBUSYsysPosix_ECANCELEDsysPosix_ECHILDsysPosix_ECONNABORTEDsysPosix_ECONNREFUSEDsysPosix_ECONNRESETsysPosix_EDEADLKsysPosix_EDESTADDRREQ sysPosix_EDOMsysPosix_EDQUOTsysPosix_EEXISTsysPosix_EFAULTsysPosix_EFBIGsysPosix_EHOSTUNREACHsysPosix_EIDRMsysPosix_EILSEQsysPosix_EINPROGRESSsysPosix_EINTRsysPosix_EINVAL sysPosix_EIOsysPosix_EISCONNsysPosix_EISDIRsysPosix_ELOOPsysPosix_EMFILEsysPosix_EMLINKsysPosix_EMSGSIZEsysPosix_EMULTIHOPsysPosix_ENAMETOOLONGsysPosix_ENETDOWNsysPosix_ENETRESETsysPosix_ENETUNREACHsysPosix_ENFILEsysPosix_ENOBUFSsysPosix_ENODATAsysPosix_ENODEVsysPosix_ENOENTsysPosix_ENOEXECsysPosix_ENOLCKsysPosix_ENOLINKsysPosix_ENOMEMsysPosix_ENOMSGsysPosix_ENOPROTOOPTsysPosix_ENOSPCsysPosix_ENOSRsysPosix_ENOSTRsysPosix_ENOSYSsysPosix_ENOTCONNsysPosix_ENOTDIRsysPosix_ENOTEMPTYsysPosix_ENOTRECOVERABLEsysPosix_ENOTSOCKsysPosix_ENOTSUPsysPosix_ENOTTYsysPosix_ENXIOsysPosix_EOPNOTSUPPsysPosix_EOVERFLOWsysPosix_EOWNERDEADsysPosix_EPERMsysPosix_EPIPEsysPosix_EPROTOsysPosix_EPROTONOSUPPORTsysPosix_EPROTOTYPEsysPosix_ERANGEsysPosix_EROFSsysPosix_ESPIPEsysPosix_ESRCHsysPosix_ESTALEsysPosix_ETIMEsysPosix_ETIMEDOUTsysPosix_ETXTBSYsysPosix_EWOULDBLOCKsysPosix_EXDEVsysPosix_O_RDONLYsysPosix_O_WRONLYsysPosix_O_RDWRsysPosix_O_NONBLOCKsysPosix_O_APPENDsysPosix_O_CREATsysPosix_O_TRUNCsysPosix_O_EXCLsysPosix_O_NOFOLLOWsysPosix_O_CLOEXECsysPosix_PROT_NONEsysPosix_PROT_READsysPosix_PROT_WRITEsysPosix_PROT_EXECsysPosix_MAP_SHAREDsysPosix_MAP_PRIVATEsysPosix_MAP_FIXEDsysPosix_MAP_ANONYMOUSsysPosix_MADV_NORMALsysPosix_MADV_RANDOMsysPosix_MADV_SEQUENTIALsysPosix_MADV_WILLNEEDsysPosix_MADV_DONTNEEDsysPosix_MS_ASYNCsysPosix_MS_SYNCsysPosix_MS_INVALIDATEsysPosix_SC_PAGESIZECWatchDescriptor CInotifyMask CInotifyFlagssysLinuxInotifyRmWatchsysLinuxInotifyAddWatchsysLinuxInotifyInitsysLinux_O_TMPFILEsysLinux_IN_NONBLOCKsysLinux_IN_CLOEXECsysLinux_IN_ACCESSsysLinux_IN_ATTRIBsysLinux_IN_CLOSE_WRITEsysLinux_IN_CLOSE_NOWRITEsysLinux_IN_CREATEsysLinux_IN_DELETEsysLinux_IN_DELETE_SELFsysLinux_IN_MODIFYsysLinux_IN_MOVE_SELFsysLinux_IN_MOVED_FROMsysLinux_IN_MOVED_TOsysLinux_IN_OPENsysLinux_IN_DONT_FOLLOWsysLinux_IN_EXCL_UNLINKsysLinux_IN_MASK_ADDsysLinux_IN_ONESHOTsysLinux_IN_ONLYDIRsysLinux_IN_IGNOREDsysLinux_IN_ISDIRsysLinux_IN_Q_OVERFLOWsysLinux_IN_UNMOUNTcinotifyEventSizePathPathEnt PathPrefix PathSuffix splitPath buildPathparentfilenameprefixsuffixURIPath URIFragmentURIQuery URIAuthority URISchema $fPathURI ConvertibleConvertconvert$fConvertibleaa ResourceTZipSink getZipSinkConduitawaityieldyieldOrleftover runConduitrunConduitPure runConduitResbracketConduitfuseKeyedCollectionKeyValuelookup StorableFixedsize alignmentStorablepeekpokeplusPtrpeekOffpokeOff$fStorableFixedPtr$fStorableFixedLE$fStorableFixedBE$fStorableFixedWord64$fStorableFixedLE0$fStorableFixedBE0$fStorableFixedWord32$fStorableFixedLE1$fStorableFixedBE1$fStorableFixedWord16$fStorableFixedWord8$fStorableFixedInt64$fStorableFixedInt32$fStorableFixedInt16$fStorableFixedInt8$fStorableFixedFloat$fStorableFixedDouble$fStorableFixedChar$fStorableFixedCUChar$fStorableFixedCChar $fStorablePtr $fStorableLE $fStorableBE$fStorableWord64 $fStorableLE0 $fStorableBE0$fStorableWord32 $fStorableLE1 $fStorableBE1$fStorableWord16$fStorableWord8$fStorableInt64$fStorableInt32$fStorableInt16$fStorableInt8$fStorableFloat$fStorableDouble$fStorableChar$fStorableCUChar$fStorableCCharThdable ProductThirdthdSndable ProductSecondsndFstable ProductFirstfstTuple4Tuple3Tuple2NthableNthTynth$fNthable4Tuple4$fNthable3Tuple4$fNthable2Tuple4$fNthable1Tuple4$fNthable4(,,,)$fNthable3(,,,)$fNthable2(,,,)$fNthable1(,,,)$fNthable3Tuple3$fNthable2Tuple3$fNthable1Tuple3$fNthable3(,,)$fNthable2(,,)$fNthable1(,,)$fNthable2Tuple2$fNthable1Tuple2 $fNthable2(,) $fNthable1(,) BuildingState prevChunksprevChunksSizecurChunk chunkSizeBuilder runBuilder.<<..>>. alignRoundUpalignRoundDown OutOfBoundMUArraymutableForeignMemUArrayUVecBAUVecAddr foreignMemfromForeignPtrwithPtrrecast toHexadecimalEncodingASCII7UTF8UTF16UTF32 ISO_8859_1ValidationFailure InvalidHeaderInvalidContinuation MissingByteString fromBytesfromBytesLenientfromBytesUnsafetoByteslineswordserrorputStrputStrLn Endianness LittleEndian BigEndianArchI386X86_64PowerPC PowerPC64SparcSparc64ARMARM64OSWindowsOSXLinuxAndroidBSDosarch compilerNamecpus endianness$fShowOS$fEqOS$fOrdOS$fEnumOS $fBoundedOS$fDataOS $fShowArch$fEqArch $fOrdArch $fEnumArch $fBoundedArch $fDataArch$fEqEndianness$fShowEndianness getEntropyMArrayArrayCopycopy BuildableMutableStepappendbuild CollectionnulllengthelemnotElemmaximumminimumanyallNonEmpty getNonEmptynonEmpty nonEmpty_Foldablefoldlfoldl'foldrfoldr'IndexedCollection! findIndex InnerFunctorimapMutableCollectionMutableFreezed MutableKey MutableValue unsafeThaw unsafeFreezethawfreezemutNewmutUnsafeWritemutWrite mutUnsafeReadmutRead SequentialtakerevTakedroprevDropsplitAt revSplitAtsplitOnbreak breakElem intersperse intercalatespanfilter partitionreverseunconsunsnocsnocconsfindsortBy singletonheadlasttailinit isPrefixOf isSuffixOf BoxedZippablezipzip3zip4zip5zip6zip7unzipunzip3unzip4unzip5unzip6unzip7ZippablezipWithzipWith3zipWith4zipWith5zipWith6zipWith7 ChunkedUArray ConditionExactlyBetweenCountNeverOnceTwiceOtherParser runParserResult ParseFail ParseMoreParseOK ParserErrorExpected DoesNotSatify NotEnough MonadFail expectedInput receivedInput parseFeedparse parseOnlyhasMore anyElementelementelementsstringsatisfy takeWhiletakeAllskip skipWhileskipAllrepeat $fEnumCount$fAlternativeParser$fMonadPlusParser $fMonadParser$fApplicativeParser$fFunctorParser $fShowResult$fExceptionParserError$fShowParserError$fEqParserError$fOrdParserError $fShowCount$fShowCondition AsciiString replicatecreate$fZippableAsciiString$fSequentialAsciiString$fCollectionAsciiString$fInnerFunctorAsciiString$fIsListAsciiString$fIsStringAsciiString$fShowAsciiString$fMonoidAsciiString$fEqAsciiString$fOrdAsciiString MutableBitmapBitmapHasherFNV1a_64FNV1a_32FNV1_64FNV1_32HashablehashMixIPv4toString fromTupletoTuple ipv4Parser$fStorableFixedIPv4$fStorableIPv4$fIsStringIPv4 $fShowIPv4$fEqIPv4 $fOrdIPv4$fHashableIPv4IPv6 ipv6Parseripv6ParserPreferredipv6ParserIpv4Embeddedipv6ParserCompressed$fStorableFixedIPv6$fStorableIPv6$fIsStringIPv6 $fShowIPv6$fHashableIPv6$fEqIPv6 $fOrdIPv6Sip1_3Sip2_4RNGv1RNGMonadRandomStaterunRandomState RandomGen randomNewrandomGenerate MonadRandomgetRandomByteswithRandomGenerator$fRandomGenRNGv1$fMonadRandomMonadRandomState$fMonadMonadRandomState$fApplicativeMonadRandomState$fFunctorMonadRandomState$fMonadRandomIOFileName RelativityAbsoluteRelativefilePathToStringfilePathToLStringunsafeFilePathunsafeFileName extension$fPathFilePath$fMonoidFileName$fIsStringFileName$fShowFileName$fExceptionFileName_Invalid$fIsStringFilePath$fExceptionFilePath_Invalid $fOrdFilePath $fEqFilePath$fShowFilePath$fEqRelativity$fShowRelativity$fShowFilePath_Invalid $fEqFileName$fShowFileName_InvalidopenFile closeFilehGethPutwithFilereadFile foldTextFile fileMapReadfileMapReadWithLStringshowgetArgs.| sourceFile sourceHandlesinkFile sinkHandlesinkList convertByteTabletableLotableHiIntegralConvertintegralConvert intToWord$fIntegralConvertInt64Word64$fIntegralConvertInt32Word32$fIntegralConvertInt16Word16$fIntegralConvertInt8Word8 PinnedStatusbool# compatAndI#compatQuotRemInt#compatCopyAddrToByteArray# compatMkWeak#isPinnedpinnedunpinned compatGetSizeofMutableByteArray#compatShrinkMutableByteArray#compatResizeMutableByteArray#W#Size#Offset# FileSize#$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$fIntegralCOff$fIntegralCInt$fIntegralCSize$fIntegralInt64$fIntegralInt32$fIntegralInt16$fIntegralInt8$fIntegralWord64$fIntegralWord32$fIntegralWord16$fIntegralWord8$fIntegralWord $fIntegralInt$fIntegralNatural$fIntegralIntegerGHC.Stack.Types HasCallStack internalErrorFP64FP32 Data.DataDatagfoldlgunfoldtoConstr dataTypeOf dataCast1 dataCast2gmapTgmapQlgmapQrgmapQgmapQigmapMgmapMpgmapMo showsPrecshowList GHC.GenericsGenericRepfromto mkNoRepTypeDataType Data.FoldableandGHC.IOthrowIObyteSwap$fByteSwapWord64$fByteSwapWord32$fByteSwapWord16 byteSwap64 byteSwap32 byteSwap16ReaderState runReaderrunState $fMonadReader$fApplicativeReader$fFunctorReader $fMonadState$fApplicativeState$fFunctorState$fMonadBracketIO$fMonadCatchIO$fMonadThrowIO$fMonadFailureEither$fMonadFailureMaybe IdentityT runIdentityT$fMonadCatchIdentityT$fMonadThrowIdentityT$fMonadFailureIdentityT$fMonadIOIdentityT$fMonadTransIdentityT$fMonadIdentityT$fApplicativeIdentityT$fFunctorIdentityT$fFloatingPointDouble$fFloatingPointFloat$fIsNaturalWord64$fIsNaturalWord32$fIsNaturalWord16$fIsNaturalWord8$fIsNaturalWord$fIsNaturalNatural$fIsIntegralWord64$fIsIntegralWord32$fIsIntegralWord16$fIsIntegralWord8$fIsIntegralWord$fIsIntegralNatural$fIsIntegralInt64$fIsIntegralInt32$fIsIntegralInt16$fIsIntegralInt8$fIsIntegralInt$fIsIntegralIntegerscaleNum$fAdditiveDouble$fAdditiveFloat$fAdditiveWord64$fAdditiveWord32$fAdditiveWord16$fAdditiveWord8$fAdditiveNatural$fAdditiveWord$fAdditiveInt64$fAdditiveInt32$fAdditiveInt16$fAdditiveInt8 $fAdditiveInt$fAdditiveIntegerpowereven$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$fSubtractiveDouble$fSubtractiveFloat$fSubtractiveWord64$fSubtractiveWord32$fSubtractiveWord16$fSubtractiveWord8$fSubtractiveWord$fSubtractiveNatural$fSubtractiveInt64$fSubtractiveInt32$fSubtractiveInt16$fSubtractiveInt8$fSubtractiveInt$fSubtractiveIntegerSize8Offset8FileSize+. offsetOfE offsetPlusE offsetMinusE offsetRecastsizeOfE$fSubtractiveSize$fAdditiveSize$fIsNaturalSize$fIsIntegralSize$fIntegralSize$fSubtractiveOffset$fAdditiveOffset$fIsNaturalOffset$fIsIntegralOffset$fIntegralOffsetunsafeUArrayUnpinnedMaxSize GHC.IO.UnsafeunsafePerformIOorderingToSign partialErrorfromJust fromRightfromLeft$fExceptionPartialError$fOrdBE$fOrdLE unPrimMonad_unsafePrimCastunsafePrimToSTunsafePrimToIOunsafePrimFromIO primTouch $fPrimMonadST $fPrimMonadIOequalcompare_ $fOrdFinalPtr $fEqFinalPtr$fShowFinalPtr sizeRecast primBaIndex primMbaRead primMbaWriteprimArrayIndexprimMutableArrayReadprimMutableArrayWriteprimOffsetRecast primOffsetOfE sizeAsOffset offsetAsSize $fPrimTypeBE $fPrimTypeLE$fPrimTypeCUChar$fPrimTypeCChar$fPrimTypeChar$fPrimTypeDouble$fPrimTypeFloat$fPrimTypeInt64$fPrimTypeInt32$fPrimTypeInt16$fPrimTypeInt8$fPrimTypeWord64$fPrimTypeWord32$fPrimTypeWord16$fPrimTypeWord8primCopyFreezedBytesprimCopyFreezedBytesOffsetprimCopyFreezedW32primCopyFreezedW64 primMutableByteArraySlideToStartprimMutableAddrSlideToStartisContinuation getNbBytesisContinuation# getNbBytes#unTable contTable headTableEntropySystemMissing$fExceptionEntropySystemMissing entropyGather EntropyCtxEntropySyscallc_sysrandom_linux entropyOpen entropyCloseentropyMaximumSizeopenDevgatherDevEntropysupportSyscallPipeYieldAwaitDonePipeMLeftoverrunPipe MonadResource liftResourceTNextKeyRefCount ReleaseType ReleaseEarly ReleaseNormalReleaseException ReleaseMapReleaseMapClosed unResourceTVoid unConduitawait'absurdinjectLeftovers runResourceTallocate$fMonadResourceConduit$fMonadResourceResourceT$fMonadBracketResourceT$fMonadCatchResourceT$fMonadThrowResourceT$fMonadIOResourceT$fMonadTransResourceT$fMonadResourceT$fApplicativeResourceT$fFunctorResourceT$fApplicativeZipSink$fFunctorZipSink$fMonadCatchConduit$fMonadThrowConduit$fMonadFailureConduit$fMonadIOConduit$fMonadTransConduit$fMonadConduit$fApplicativeConduit$fFunctorConduit $fMonadPipe$fApplicativePipe $fFunctorPipe wordsWhen$fKeyedCollection[]toProxy toUndefined$fThdableTuple4$fThdableTuple3$fThdable(,,,) $fThdable(,,)$fSndableTuple4$fSndableTuple3$fSndableTuple2$fSndable(,,,) $fSndable(,,) $fSndable(,)$fFstableTuple4$fFstableTuple3$fFstableTuple2$fFstable(,,,) $fFstable(,,) $fFstable(,)$fBifunctorTuple2sumOutOfBoundOperation InvalidRecastRecastDestinationSizeRecastSourceSizeOOB_Read OOB_Write OOB_MemSet OOB_Index$fExceptionInvalidRecast$fExceptionOutOfBoundread unsafeReadwrite unsafeWrite newPinnednewcopyAt mutableLengthwithMutablePtrMUVecMA MUVecAddrmutableArrayProxyTysizeInMutableBytesOfContentmvectorProxyTy newUnpinnedempty mutableSame newNativesubwithMutablePtrHintindex unsafeIndexunsafeCopyAtROunsafeCopyFrom createFromIO vFromListvToListvCompareupdate arrayType vectorProxyTy unsafeIndexer unsafeDewrap lengthSizeunsafeFreezeShrink freezeShrink unsafeSlideconcat unsafeUpdate unsafeRecast splitElemmapmapIndex builderAppend builderBuild$fIsListUArray$fMonoidUArray $fOrdUArray $fEqUArray $fShowUArray $fDataUArray fromModified accessBytesbuildByteArrayMutableByteArraymutableByteArraySetmutableByteArraySetBetweenmutableByteArrayMoveForeign.C.TypesCCharCSCharCUCharCShortCUShortCIntCUIntCLongCULongCLLongCULLongCFloatCDoubleCPtrdiffCSizeCWchar CSigAtomicCClockCTime CUSeconds CSUSecondsCFileCFposCJmpBufCIntPtrCUIntPtrCIntMaxCUIntMaxUnitError encodingNext convertFromTo encodingWriteisAsciinextASCII7_InvalidByteOutOfBound CharNotAsciiaone$fEncodingASCII7$fExceptionASCII7_InvalidISO_8859_1_Invalid NotISO_8859_1$fEncodingISO_8859_1$fExceptionISO_8859_1_Invalid UTF16_InvalidInvalidUnicode$fEncodingUTF16$fExceptionUTF16_Invalid UTF32_Invalid$fEncodingUTF32$fExceptionUTF32_InvalidUTF8Char EncoderUTF8 MutableStringcharMapvalidatemutableValidatesToList sFromListindexN splitIndexfromChunkBytesUTF8_1UTF8_2UTF8_3UTF8_4 stringTypeskipNextHeaderValuenextWithIndexerwriteWithBuilder asUTF8CharnumBytes writeUTF8Char charToBytesfromEncoderBytestoEncoderBytes$fEncodingEncoderUTF8$fExceptionValidationFailure$fIsListString$fIsStringString $fShowString $fDataString onNewArrayfreezeUntilIndex $fIsListArray $fOrdArray $fEqArray $fShowArray $fMonoidArray$fFunctorArray $fDataArray $fCopyString $fCopyArray $fCopyUArray$fCopy[]$fBuildableString$fBuildableArray$fBuildableUArray$fCollectionNonEmpty$fCollectionString$fCollectionArray$fCollectionUArray$fCollection[]$fIsListNonEmpty$fFoldableArray$fFoldableUArray $fFoldable[]$fIndexedCollectionString$fIndexedCollectionArray$fIndexedCollectionUArray$fIndexedCollection[]$fInnerFunctorString$fInnerFunctorArray$fInnerFunctorUArray$fInnerFunctor[]$fMutableCollectionMArray$fMutableCollectionMUArraymconcatCollection$fSequentialString$fSequentialArray$fSequentialUArray$fSequential[]uncons2uncons3uncons4uncons5uncons6uncons7uncurry2uncurry3uncurry4uncurry5uncurry6uncurry7$fBoxedZippableArray$fBoxedZippable[]$fZippableString$fZippableArray$fZippableUArray $fZippable[] $fIndexedCollectionChunkedUArray$fSequentialChunkedUArray$fCollectionChunkedUArray$fIsListChunkedUArray$fMonoidChunkedUArray$fEqChunkedUArraySuccessgetMoregetAllflushAll shouldStopcanStop decrementMutableAsciiString cucharToChar charToCUChar cucharMap bitsPerTy shiftPerTy maskPerTy bitmapIndex unoptimised $fMutableCollectionMutableBitmap$fIndexedCollectionBitmap$fSequentialBitmap$fCollectionBitmap$fFoldableBitmap$fInnerFunctorBitmap$fIsListBitmap$fMonoidBitmap $fOrdBitmap $fEqBitmap $fShowBitmaphashMix8 HashResulthashEndhashNew hashMix16 hashMix32 hashMix64 hashMixBytesunWord16unWord32 unWord64_32 FNV1Hash64 FNV1Hash32 fnv1_32_mixBafnv1a_32_mixBa fnv1_64_mixBafnv1a_64_mixBaxor32xor64 fnv1_32_Mix8 fnv1a_32_Mix8 fnv1_64_Mix8 fnv1a_64_Mix8$fHasherFNV1a_64$fHasherFNV1_64$fHasherFNV1a_32$fHasherFNV1_32$fHashableTuple4$fHashableTuple3$fHashableTuple2$fHashable(,,,,,)$fHashable(,,,,)$fHashable(,,,)$fHashable(,,) $fHashable(,) $fHashable[]$fHashableUArray$fHashableString$fHashableInteger$fHashableInt64$fHashableInt32$fHashableInt16$fHashableInt8$fHashableNatural$fHashableWord64$fHashableWord32$fHashableWord16$fHashableWord8 fromLString toLStringshowHex4showHexformat skipColonskipDot takeAWord8 takeAWord16SipHashSipKeymixBaSipIncrementalSipIncremental0SipIncremental1SipIncremental2SipIncremental3SipIncremental4SipIncremental5SipIncremental6SipIncremental7 InternalStateSip newSipStatemix8Primmix8mix32mix64finishdoRoundprocessfinalize loopRounds andMask64$fHasherSip1_3$fHasherSip2_4c_rngv1_generate rngv1KeySize rngv1GenerateFileName_InvalidContainsNullByteContainsSeparator EncodingErrorUnknownTrailingBytesFilePath_InvalidContiguousPathSeparatorpathSeparatorPOSIXfileNameToStringfileNameToLStringpathSeparatorPOSIXCpathSeparatorC pathSeparator hasNullByte hasSeparator isSeparatorhasContigueSeparatorsjoinfilenameIntercalate FileMappingfileMappingToFinalPtr FileMapReadFfileMappingPtrfileMappingSizefileMappingUnmapMemorySyncFlagMemorySyncAsyncMemorySyncSyncMemorySyncInvalidate MemoryAdviceMemoryAdviceNormalMemoryAdviceRandomMemoryAdviceSequentialMemoryAdviceWillNeedMemoryAdviceDontNeedMemoryProtection MemoryMapFlagMemoryMapSharedMemoryMapPrivate memoryMap memoryUnmap memoryAdvise memoryLock memoryUnlock memoryProtect memorySyncsysconfPageSizeMemoryProtectionNoneMemoryProtectionReadMemoryProtectionWriteMemoryProtectionExecute c_sysconf c_munlockc_mlock c_mprotectc_msync c_madvisec_munmapc_mmapcvalueOfMemoryProtscvalueOfMemorySyncfileSizeToCSizefileSizeFromIntegerGHC.IO.Handle.TypesHandlehGetNonBlockinghGetSomeinvalidBufferSize blockSizegetSize