!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ NoneLennart Kolmodin, Ross PatersonBSD3-style (see LICENSE)%Lennart Kolmodin <kolmodin@gmail.com> experimentalportable to Hugs and GHC Trustworthy<$A # is an efficient way to build lazy 1s. There are several functions for constructing Xs, but only one to inspect them: to extract any data, you have to turn them into lazy s using .Internally, a  constructs a lazy    by filling byte arrays piece by piece. As each buffer is filled, it is 'popped' off, to become a new chunk of the resulting lazy +. All this is hidden from the user of the .O(1). The empty Builder, satisfying   = O(1).+ A Builder taking a single byte, satisfying  ( b) =  bO(1).L The concatenation of two Builders, an associative operation with identity  , satisfying  ( x y) =  ( x) ( y)O(1). A Builder taking a  , satisfying  ( bs) =  [bs]O(1). A Builder taking a lazy  , satisfying  ( bs) = bsO(n). A builder taking & and copy it to a Builder, satisfying@ ( bs) =  [ bs]O(n). Extract a lazy  from a P. The construction work takes place if and when the relevant part of the lazy  is demanded.O(1). Pop the N we have constructed so far, if any, yielding a new chunk in the result lazy .&Sequence an IO operation on the bufferGet the size of the buffer&Map the resulting list of bytestrings.Ensure that there are at least n many bytes available.  Ensure that n# bytes are available, and then use f to write at most n bytes into memory. f1 must return the actual number of bytes written.  Ensure that n# bytes are available, and then use f to write exactly n bytes into memory. #Write a Word16 in big endian format &Write a Word16 in little endian format #Write a Word32 in big endian format&Write a Word32 in little endian format#Write a Word64 in big endian format&Write a Word64 in little endian format"Write a Int16 in big endian format%Write a Int16 in little endian format"Write a Int32 in big endian format%Write a Int32 in little endian format"Write a Int64 in big endian format%Write a Int64 in little endian formatO(1).; A Builder taking a single native machine word. The word is written in host order, host endian form, for the machine you're on. On a 64 bit machine the Word is an 8 byte value, on a 32 bit machine, 4 bytes. Values written this way are not portable to different endian or word sized machines, without conversion.]Write a Word16 in native host order and host endianness. 2 bytes will be written, unaligned.]Write a Word32 in native host order and host endianness. 4 bytes will be written, unaligned.Write a Word64 in native host order. On a 32 bit machine we write two host order Word32s, in big endian form. 8 bytes will be written, unaligned.O(1).: A Builder taking a single native machine word. The word is written in host order, host endian form, for the machine you're on. On a 64 bit machine the Int is an 8 byte value, on a 32 bit machine, 4 bytes. Values written this way are not portable to different endian or word sized machines, without conversion.\Write a Int16 in native host order and host endianness. 2 bytes will be written, unaligned.\Write a Int32 in native host order and host endianness. 4 bytes will be written, unaligned.Write a Int64 in native host order. On a 32 bit machine we write two host order Int32s, in big endian form. 8 bytes will be written, unaligned.'Write a character using UTF-8 encoding.2   / Lennart Kolmodin, Ross PatersonBSD3-style (see LICENSE)%Lennart Kolmodin <kolmodin@gmail.com> experimentalportable to Hugs and GHCSafe  None <>ILN# A decoder produced by running a ! monad.$8The decoder ran into an error. The decoder either used " or was not provided enough input.%RThe decoder has consumed the available input and needs more to continue. Provide ! if more input is available and # otherwise, and you will get a new #.&bThe decoder has successfully finished. Except for the output value you also get the unused input.'The decoder needs to know the current position in the input. Given the number of bytes remaning in the decoder, the outer decoder runner needs to calculate the position and resume the decoding.(Run a ! monad. See #b for what to do next, like providing input, handling decoding errors and to get the output value.Make sure we don't have to pass Nothing to a Partial twice. This way we don't need to pass around an EOF value in the Get monad, it can safely ask several times if it needs to.)1Get the total number of bytes read to this point.*Isolate a decoder to operate with a fixed number of bytes, and fail if fewer bytes were consumed, or more bytes were attempted to be consumed. If the given decoder fails, * will also fail. Offset from )" will be relative to the start of *!, not the absolute of the input.Since: 0.7.2.0-WTest whether all input has been consumed, i.e. there are no remaining undecoded bytes..DEPRECATED. Same as 4.qRun a decoder and keep track of all the input it consumes. Once it's finished, return the final decoder (always & or $), and unconsume all the the input the decoder required to run. Any additional chunks which was required to run the decoder will also be returned./pRun the given decoder, but without consuming its input. If the given decoder fails, then so will this function.Since: 0.7.0.00@Run the given decoder, and only consume its input if it returns . If d is returned, the input will be unconsumed. If the given decoder fails, then so will this function.Since: 0.7.0.01@Run the given decoder, and only consume its input if it returns . If d is returned, the input will be unconsumed. If the given decoder fails, then so will this function.Since: 0.7.1.02mLabel a decoder. If the decoder fails, the label will be appended on a new line to the error message string.Since: 0.7.2.03LDEPRECATED. Get the number of bytes of remaining input. Note that this is an expensive function to use as in order to calculate how much input remains, all input has to be read and kept in-memory. The decoder keeps the input as a strict bytestring, so you are likely better off by calculating the remaining input in another way.4DAn efficient get method for strict ByteStrings. Fails if fewer than n" bytes are left in the input. If n <= 0# then the empty string is returned.5Get the current chunk.6Replace the current chunk.7Return at least nV bytes, maybe more. If not enough data is available the computation will escape with %.8Ensure that there are at least n< bytes available. If not, the computation will escape with %.9 readNWith n f where f1 must be deterministic and not have side effects.Since: 0.7.0.0Since: 0.7.1.0. !"#$%&'()*)The number of bytes that must be consumedThe decoder to isolate+,-./0123456789 !"#$%&'()*+,-./0123456789!""#$%&'(79)*+ ,5683.-/0124( !"#$%&'()*+,-./0123456789Lennart Kolmodin, Ross PatersonBSD3-style (see LICENSE)%Lennart Kolmodin <kolmodin@gmail.com> experimentalportable to Hugs and GHCSafe   Lennart KolmodinBSD3-style (see LICENSE)%Lennart Kolmodin <kolmodin@gmail.com> experimentalportable to Hugs and GHC. Trustworthy<IN&:An offset, counted in bytes.; A decoder procuced by running a ! monad.<8The decoder ran into an error. The decoder either used c or was not provided enough input. Contains any unconsumed input and the number of bytes consumed.=RThe decoder has consumed the available input and needs more to continue. Provide ! if more input is available and # otherwise, and you will get a new ;.>The decoder has successfully finished. Except for the output value you also get any unused input as well as the number of bytes consumed.?Run a ! monad. See ; for what to do next, like providing input, handling decoder errors and to get the output value. Hint: Use the helper functions C, D and E.@RDEPRECATED. Provides compatibility with previous versions of this library. Run a ! monad and return a tuple with three values. The first value is the result of the decoder. The second and third are the unused input, and the number of consumed bytes.ARun a ! monad and return  on failure and  on success. In both cases any unconsumed input and the number of bytes consumed is returned. In the case of failure, a human-readable error message is included as well.Since: 0.6.4.0B The simplest interface to run a !4 decoder. If the decoder runs into an error, calls %, or runs out of input, it will call .CFeed a ; with more input. If the ; is > or < it will add the input to  of unconsumed input.  ?4 myParser `pushChunk` myInput1 `pushChunk` myInput2 DFeed a ; with more input. If the ; is > or < it will add the input to  ByteString of unconsumed input.  ?( myParser `pushChunks` myLazyByteString ETell a ;* that there is no more input. This passes  to a =2 decoder, otherwise returns the decoder unchanged.F Skip ahead n bytes. Fails if fewer than n bytes are available.GBAn efficient get method for lazy ByteStrings. Fails if fewer than n bytes are left in the input.HGet a lazy ByteString that is terminated with a NUL byte. The returned string does not contain the NUL byte. Fails if it reaches the end of input without finding a NUL.IGet the remaining bytes as a lazy ByteString. Note that this can be an expensive function to use as it forces reading all input and keeping the string in-memory.J!Read a Word8 from the monad stateK!Read an Int8 from the monad stateL"Read a Word16 in big endian formatM%Read a Word16 in little endian formatN"Read a Word32 in big endian formatO%Read a Word32 in little endian formatP"Read a Word64 in big endian formatQ%Read a Word64 in little endian formatR"Read an Int16 in big endian formatS"Read an Int32 in big endian formatT"Read an Int64 in big endian formatU%Read an Int16 in little endian formatV%Read an Int32 in little endian formatW%Read an Int64 in little endian formatXO(1). Read a single native machine word. The word is read in host order, host endian form, for the machine you're on. On a 64 bit machine the Word is an 8 byte value, on a 32 bit machine, 4 bytes.YO(1).? Read a 2 byte Word16 in native host order and host endianness.ZO(1).8 Read a Word32 in native host order and host endianness.[O(1).7 Read a Word64 in native host order and host endianess.\O(1).V Read a single native machine word in native host order. It works in the same way as X.]O(1).> Read a 2 byte Int16 in native host order and host endianness.^O(1).8 Read an Int32 in native host order and host endianness._O(1).7 Read an Int64 in native host order and host endianess.7:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_1!)*-./01234:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_1!BA:;<=>?CDEF-)*/0124GHIJLNPMOQXYZ[KRSTUVW\]^_@3.4:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_Lennart KolmodinBSD3-style (see LICENSE)%Lennart Kolmodin <kolmodin@gmail.com>stable(Portable to Hugs and GHC. Requires MPTCsSafe`<Put merely lifts Builder into a Writer monad, applied to ().a@The PutM type. A Writer monad over the efficient Builder monoid.eRun the ` monadfRun the ` monad with a serialisergRun the `+ monad with a serialiser and get its resulthfPop the ByteString we have constructed so far, if any, yielding a new chunk in the result ByteString.i/Efficiently write a byte into the output bufferj6Efficiently write a signed byte into the output bufferkAn efficient primitive to write a strict ByteString into the output buffer. It flushes the current buffer, and writes the argument into a new chunk.lfWrite a lazy ByteString efficiently, simply appending the lazy ByteString chunks to the output buffermWrite  to the buffern#Write a Word16 in big endian formato&Write a Word16 in little endian formatp#Write a Word32 in big endian formatq&Write a Word32 in little endian formatr#Write a Word64 in big endian formats&Write a Word64 in little endian formatt#Write an Int16 in big endian formatu&Write an Int16 in little endian formatv#Write an Int32 in big endian formatw&Write an Int32 in little endian formatx#Write an Int64 in big endian formaty&Write an Int64 in little endian formatzO(1).0 Write a single native machine word. The word is written in host order, host endian form, for the machine you're on. On a 64 bit machine the Word is an 8 byte value, on a 32 bit machine, 4 bytes. Values written this way are not portable to different endian or word sized machines, without conversion.{O(1).V Write a Word16 in native host order and host endianness. For portability issues see  putWordhost.|O(1).V Write a Word32 in native host order and host endianness. For portability issues see  putWordhost.}O(1). Write a Word64 in native host order On a 32 bit machine we write two host order Word32s, in big endian form. For portability issues see  putWordhost.~O(1)./ Write a single native machine word. The word is written in host order, host endian form, for the machine you're on. On a 64 bit machine the Int is an 8 byte value, on a 32 bit machine, 4 bytes. Values written this way are not portable to different endian or word sized machines, without conversion.O(1).V Write an Int16 in native host order and host endianness. For portability issues see  putInthost.O(1).V Write an Int32 in native host order and host endianness. For portability issues see  putInthost.O(1). Write an Int64 in native host order On a 32 bit machine we write two host order Int32s, in big endian form. For portability issues see  putInthost.)`abcdefghijklmnopqrstuvwxyz{|}~"`abcdefghijklmnopqrstuvwxyz{|}~"`abcfgdehijklmnprtvxoqsuwyz{|}~&`abcdefghijklmnopqrstuvwxyz{|}~ Lennart KolmodinBSD3-style (see LICENSE)%Lennart Kolmodin <kolmodin@gmail.com>unstableFportable to Hugs and GHC. Requires the FFI and some flexible instancesSafe14 The  class provides  and :, methods to encode and decode a Haskell value to a lazy . It mirrors the  and  classes for textual representation of Haskell types, and is suitable for serialising Haskell values to disk, over the network.For decoding and generating simple external binary formats (e.g. C structures), Binary may be used, but in general is not suitable for complex protocols. Instead use the ` and ! primitives directly.:Instances of Binary should satisfy the following property: decode . encode == id That is, the  and i methods should be the inverse of each other. A range of instances are provided for basic Haskell types. Encode a value in the Put monad.Decode a value in the Get monad'getMany n' get n. elements in order, without blowing the stack.Since: 0.8.0.0Since: 0.7.6.0Since: 0.7.3.0Since: 0.8.0.0Since: 0.8.0.0:     6      Bryan O'SullivanBSD3-style (see LICENSE)%Bryan O'Sullivan <bos@serpentine.com>unstable!Only works with GHC 7.2 and newerSafe 35>KLN !"#$%&'()*+,- !"#$%&'()*+,-Lennart KolmodinBSD3-style (see LICENSE)%Lennart Kolmodin <kolmodin@gmail.com>unstableGportable to Hugs and GHC. Requires the FFI and some flexible instances. Trustworthy?Encode a value using binary serialisation to a lazy ByteString.MDecode a value from a lazy ByteString, reconstructing the original structure.1Decode a value from a lazy ByteString. Returning  on failure and  on success. In both cases the unconsumed input and the number of consumed bytes is returned. In case of failure, a human-readable error message will be returned as well.Since: 0.7.0.0#Lazily serialise a value to a file.<This is just a convenience function, it's defined simply as: %encodeFile f = B.writeFile f . encode@So for example if you wanted to compress as well, you could use: !B.writeFile f . compress . encode/Decode a value from a file. In case of errors, ( will be called with the error message.Since: 0.7.0.0ODecode a value from a file. In case of success, the value will be returned in _. In case of decoder errors, the error message together with the byte offset will be returned../012345!J`i!`iJ6  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFG01235HIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghihjklmnopqrs !"#$%&'()*+ t C B u v w xyz{|}~                                      !"#$%$&$'$($)$*$+,binar_00mRCXa5CocKCZ3s4LK8NPData.Binary.BuilderData.Binary.Builder.InternalData.Binary.Get.InternalData.Binary.GetData.Binary.Put Data.BinaryData.Binary.InternalData.Binary.Builder.BaseL BytestringData.Binary.ClassData.Binary.GenericBuilderempty singletonappendfromByteStringfromLazyByteStringfromShortByteStringtoLazyByteStringflush writeAtMostwriteN putWord16be putWord16le putWord32be putWord32le putWord64be putWord64le putInt16be putInt16le putInt32be putInt32le putInt64be putInt64le putWordhost putWord16host putWord32host putWord64host putInthost putInt16host putInt32host putInt64host putCharUtf8ConsumeGetrunContDecoderFailPartialDone BytesReadrunGetIncremental bytesReadisolatewithInputChunks failOnEOFisEmptygetBytes lookAhead lookAheadM lookAheadElabel remaining getByteStringgetputreadNensureN readNWith ByteOffset runGetState runGetOrFailrunGet pushChunk pushChunkspushEndOfInputskipgetLazyByteStringgetLazyByteStringNulgetRemainingLazyByteStringgetWord8getInt8 getWord16be getWord16le getWord32be getWord32le getWord64be getWord64le getInt16be getInt32be getInt64be getInt16le getInt32le getInt64le getWordhost getWord16host getWord32host getWord64host getInthost getInt16host getInt32host getInt64hostPutPutMunPut putBuilderexecPutrunPutrunPutMputWord8putInt8 putByteStringputLazyByteStringputShortByteStringBinary GBinaryGetgget GBinaryPutgputencodedecode decodeOrFail encodeFile decodeFiledecodeFileOrFailbytes_6VWy06pWzJq9evDvK2d4w6Data.ByteString.InternalaccursedUnutterablePerformIOData.ByteString.Lazy.Internal ByteStringData.ByteString.Lazy fromChunksData.ByteString.Short.InternalShortByteString fromShort withBufferwithSize mapBuilder ensureFreeBuffer runBuilder defaultSize writeBuffer newBufferord2ord3ord4 shiftr_w16 shiftr_w32 shiftr_w64$fMonoidBuilderbaseGHC.BasefailJustNothing noMeansNorunAndKeepTrack Data.EitherRightLeft$fAlternativeGet$fMonadPlusGetSuccessCbindGfailGapGfmapGpromptprompt'pushBack pushFront unsafeReadN $fShowDecoder$fFunctorDecoder $fFunctorGet$fApplicativeGet $fMonadGetGHC.ErrerrorcalculateOffset takeHeadChunk dropHeadChunk consumeBytesconsumeUntilNul consumeAll resumeOnEOFgetPtrword16beword16leword32beword32leword64beword64le shiftl_w16 shiftl_w32 shiftl_w64PairSsndStell $fMonadPutM$fApplicativePutM $fFunctorPutMGHC.ReadReadGHC.ShowShowgetMany$fBinaryVersion$fBinaryFingerprint$fBinaryNatural $fBinaryFixed $fBinaryVoid NaturalWordSmallIntunrollroll$fBinaryUArray $fBinaryArray $fBinaryTree $fBinaryFloat$fBinaryDouble $fBinarySeq$fBinaryIntMap$fBinaryIntSet $fBinaryMap $fBinarySet$fBinaryShortByteString$fBinaryByteString$fBinaryByteString0$fBinaryEither $fBinaryMaybe $fBinary[]$fBinary(,,,,,,,,,)$fBinary(,,,,,,,,)$fBinary(,,,,,,,)$fBinary(,,,,,,)$fBinary(,,,,,)$fBinary(,,,,) $fBinary(,,,) $fBinary(,,) $fBinary(,) $fBinaryChar $fBinaryRatio$fBinaryInteger $fBinaryInt $fBinaryWord $fBinaryInt64 $fBinaryInt32 $fBinaryInt16 $fBinaryInt8$fBinaryWord64$fBinaryWord32$fBinaryWord16 $fBinaryWord8$fBinaryOrdering $fBinaryBool $fBinary()TaggedunTaggedSumSizesumSizeGSumPutputSumGSumGetgetSum sizeError checkGetSum $fSumSizeM1 $fSumSize:+: $fGSumPutM1 $fGSumGetM1 $fGSumPut:+: $fGSumGet:+:$fGBinaryGet:+:$fGBinaryPut:+:$fGBinaryGetK1$fGBinaryPutK1$fGBinaryGetM1$fGBinaryPutM1$fGBinaryGet:*:$fGBinaryPut:*:$fGBinaryGetU1$fGBinaryPutU1$fGBinaryGetV1$fGBinaryPutV1ghc-prim GHC.TypesWordGHC.WordWord8Word16Word32Word64 byteSwap64 byteSwap32 byteSwap16