!p      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEF G H I J K L M NOPQRSTUVWXYZ[\]^_`abcdefghijklmnopq r s t u v w x y z { | } ~    BSD-style#Vincent Hanquez <vincent@snarc.org>stableGoodNone}0Class to allocate new ByteArray of specific size allocate n& bytes and perform the given operation7Class to Access size properties and data of a ByteArray)Return the length in bytes of a bytearrayAllow to use using a pointerNnumber of bytes to allocate. i.e. might not match the size of the given type ba. BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalunknownSafe.A simple Extended Word128 composed of 2 Word64 BSD-style#Vincent Hanquez <vincent@snarc.org>stableGoodNoneperform io for hashes that do allocation and ffi. unsafeDupablePerformIO is used when possible as the computation is pure and the output is directly linked to the input. we also do not modify anything after it has been returned to the user. BSD-style#Vincent Hanquez <vincent@snarc.org>stablegoodNoneKz (Class of types that can be byte-swapped.e.g. Word16, Word32, Word64 Big Endian value Little Endian valuerepresent the CPU endiannessBig endian system stores bytes with the MSB as the first byte. Little endian system stores bytes with the LSB as the first byte.#middle endian is purposely avoided.Return the system endianness.Convert a value in cpu endianess to big endian5Convert from a big endian value to the cpu endianness1Convert a value in cpu endianess to little endian8Convert from a little endian value to the cpu endianness       BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalgoodNone%#Siphash tag value% SigHash Key;produce a siphash with a key and a memory pointer + length.same as U, except also specifies the number of sipround iterations for compression and digest. siphash C siphash Dkey for the hashmemory pointerlength of the data#$%&#$%& BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalunknownNoneDQV/')Transform a raw memory to an hexadecimal user beware, no checks are made('Transform a number of bytes pointed by.0src in the hexadecimal binary representation in dst\destination memory need to be of correct size, otherwise it will lead to really bad things.Convert a value Word to two Word9s containing the hexadecimal representation of the Word#)convert a base16 src in dst.n need to even'a with1 type of function to hold reference to the objectlength in bytes(destination memory source memorynumber of bytes'()'() BSD-style#Vincent Hanquez <vincent@snarc.org>stableCompatNoneD9$byteswap Word# to or from Big Endian0on a big endian machine, this function is a nop.'byteswap Word# to or from Little Endian3on a little endian machine, this function is a nop.VSimple compatibility for byteswap the lower 32 bits of a Word# at the primitive levelpSimple wrapper to handle pre 7.8 and future, where most comparaison functions don't returns a boolean anymore.=Apply or or another function if 8 divides the number of bytesnumber of bytes?if it divided by 8, the argument is the number of 8 bytes words'if it doesn't, just the number of bytes BSD-style&Nicolas DI PRIMA <nicolas@di-prima.fr> experimentalunknownNoneDQVDD*'Transform a number of bytes pointed by.+src in the base32 binary representation in dst\destination memory need to be of correct size, otherwise it will lead to really bad things.+GGet the length needed for the destination buffer for a base32 decoding.9if the length is not a multiple of 8, Nothing is returned,convert from base32 in src to binary in (dst, using the number of bytes specifiedthe user should use unBase32Length to compute the correct length, or check that the length specification is proper. no check is done here.*inputoutput input len*+,*+, BSD-style#Vincent Hanquez <vincent@snarc.org>stableCompatNoneDE BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalunknownSafeGQ BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalunknownSafeH, BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalgoodNoneDKO-FNV1(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 memory-./0-./0 BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalgoodNoneXj18Compute the SipHash tag of a byte array for a given key.1# is equivalent to 'sipHashWith 2 4'28Compute the SipHash tag of a byte array for a given key.2The user can choose the C and D numbers of rounds.calling 1# is equivalent to 'sipHashWith 2 4'32Compute the FNV1 32 bit hash value of a byte array43Compute the FNV1a 32 bit hash value of a byte array52Compute the FNV1 64 bit hash value of a byte array63Compute the FNV1a 64 bit hash value of a byte array2c roundsd roundskey data to hash#$%&-./0123456%&#$12/0-.3456 BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalunknownNoneDQVkP7'Transform a number of bytes pointed by src$ to base64 binary representation in dst`The destination memory need to be of correct size, otherwise it will lead to really bad things.8'Transform a number of bytes pointed by src/ to, URL-safe base64 binary representation in dstJ. The result will be either padded or unpadded, depending on the boolean padded argument.`The destination memory need to be of correct size, otherwise it will lead to really bad things.:GGet the length needed for the destination buffer for a base64 decoding.9if the length is not a multiple of 4, Nothing is returned;9Get the length needed for the destination buffer for an  .http://tools.ietf.org/html/rfc4648#section-3.2unpadded base64 decoding.If the length of the encoded string is a multiple of 4, plus one, Nothing is returned. Any other value can be valid without padding.>convert from base64 in src to binary in dst%, using the number of bytes specifiedthe user should use unBase64Length to compute the correct length, or check that the length specification is proper. no check is done here.789:;<=>789:;>=< BSD-style#Vincent Hanquez <vincent@snarc.org>stableGoodNones?*A simple abstraction to a piece of memory.fDo beware that garbage collection related to piece of memory could be triggered before this is used.XOnly use with the appropriate handler has been used (e.g. withForeignPtr on ForeignPtr)A>Increase the memory view while reducing the size of the windowkthis is useful as an abtraction to represent the current offset in a buffer, and the remaining bytes left.?@A?@ BSD-StyleNonev0BSimple ByteArray PackerCPacking result:=PackerMore: the next state of Packing with an arbitrary valuePackerFail: an error happenedrun a sized actionrun a sized actionBCDEBCDE BSD-style#Vincent Hanquez <vincent@snarc.org>stableCompatNoneDw(c) Vincent Hanquez 2014 BSD-styleVincent Hanquez provisionalnon-portable (requires POSIX)NoneMemory 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.EOn an anonymous mapping this function doesn't 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              BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalunknownSafeDFCreate a new temporary bufferG1xor bytes from source1 and source2 to destination d = s1 xor s22s1, nor s2 are modified unless d point to s1 or s2H:xor bytes from source with a specific value to destinationd = replicate (sizeof s) v ! sI Copy a set number of bytes from src to dstJSet $n number of bytes to the same value vK'Check if two piece of memory are equalsL8Compare two piece of memory and returns how they compareM2A constant time equality test for 2 Memory bufferscompared to normal equality function, this function will go over all the bytes present before yielding a result even when knowing the overall result early in the processing.FGHIJKLMFGHIJKML BSD-style#Vincent Hanquez <vincent@snarc.org>StableGHCNoneDN=ScrubbedBytes is a memory chunk which have the properties of:+Being scrubbed after its goes out of scope.6A Show instance that doesn't actually show any content#A Eq instance that is constant timeNN" BSD-style#Vincent Hanquez <vincent@snarc.org>stableGoodNoneOQAllocate a new bytearray of specific size, and run the initializer on this memoryPQAllocate a new bytearray of specific size, and run the initializer on this memoryQ similar to O: but hide the allocation and initializer in a pure contextR similar to P: but hide the allocation and initializer in a pure contextSCreate an empty byte arrayTCheck if a byte array is emptyU%Pack a list of bytes into a bytearrayV(Un-pack a bytearray into a list of bytesWPreturns the first byte, and the remaining bytearray if the bytearray is not nullX&Create a byte array from a single byteY%prepend a single byte to a byte arrayZ$append a single byte to a byte array[&Create a xor of bytes between a and b.9the returns byte array is the size of the smallest input.\@return a specific byte indexed by a number from 0 in a bytearray"unsafe, no bound checking are done]7Split a bytearray at a specific length in two bytearray^Take the first n byte of a bytearray_drop the first n byte of a bytearray`%Split a bytearray at the point where pred becomes invalida-Concatenate bytearray into a larger bytearrayb!append one bytearray to the othercJDuplicate a bytearray into another bytearray, and run an initializer on itd Similar to c> but also provide a way to return a value from the initializere Similiar to c5 but expect the resulting bytearray in a pure contextfFCreate a bytearray of a specific size containing a repeated byte valueg6Create a bytearray of a specific size initialized to 0h!Check if two bytearray are equalsUThis is not constant time, as soon some byte differs the function will returns. use i+ in sensitive context where timing matters.i;A constant time equality test for 2 ByteArrayAccess values._If values are of 2 different sizes, the function will abort early without comparing any bytes.compared to == , this function will go over all the bytes present before yielding a result even when knowing the overall result early in the processing.j:Check if any element of a byte array satisfies a predicatek9Check if all elements of a byte array satisfy a predicatel0Convert a bytearray to another type of bytearrayOPQRSTUVWXYZ[\]^_`abcdefghijkl BSD-style&Nicolas DI PRIMA <nicolas@di-prima.fr>stableGoodNone7ma view on a given bytesEquality test in constant timen"create a view on a given bytearrayCThis function update the offset and the size in order to guarantee: offset >= 0 size >= 0offset < lengthsize =< length - offseto&create a view from the given bytearraypWcreate a view from the given byte array starting after having dropped the fist n bytesnthe byte array we put a view on%the offset to start the byte array onthe size of the viewo byte araysize of the viewp byte array7the number of bytes do dropped before creating the viewmnopm#$%&  BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalportableNoneQVq"Simple ByteString parser structure'?The continuation of the next buffer value, and the parsed value(<The continuation of the current buffer, and the error stringr3Simple parsing result, that represent respectively:failure: with the error message+continuation: that need for more input data9success: the remaining unparsed data and the parser valuev&Run a parser on an @initial byteArray.|If the Parser need more data than available, the @feeder function is automatically called and fed to the More continuation.w*Run a Parser on a ByteString and return a ry!Get the next byte from the parserz)Parse a specific byte at current positionQif the byte is different than the expected on, this parser will raise a failure.{/Parse a sequence of bytes from current positiongif the following bytes don't match the expected bytestring completely, the parser will raise a failure|7Take a storable from the current position in the stream}5Take @n bytes from the current position in the stream~LTake bytes while the @predicate hold from the current position in the stream@Take the remaining bytes from the current position in the stream5Skip @n bytes from the current position in the streamLSkip bytes while the @predicate hold from the current position in the streamDSkip all the remaining bytes from the current position in the streamqrtsuvwxyz{|}~qrstuwvxzy{}~|q)*rstu  BSD-style#Vincent Hanquez <vincent@snarc.org>stableGoodNoneSTransform a bytearray at a specific offset into a Word64 tagged as BE (Big Endian)no bounds checking. unsafeVTransform a bytearray at a specific offset into a Word64 tagged as LE (Little Endian)no bounds checking. unsafe Serialize a Word64 to a  ByteArray in big endian formatmap blocks of 128 bits of a bytearray, creating a new bytestring of equivalent size where each blocks has been mapped through f"no length checking is done. unsafe~map blocks of 64 bits of a bytearray, creating a new bytestring of equivalent size where each blocks has been mapped through f"no length checking is done. unsafe  BSD-style#Vincent Hanquez <vincent@snarc.org> experimentalunknownNone Different bases that can be usedSee  "http://tools.ietf.org/html/rfc4648RFC46489 for details. In particular, Base64 can be standard or  ,http://tools.ietf.org/html/rfc4648#section-5URL-safeD. URL-safe encoding is often used in other specifications without  .http://tools.ietf.org/html/rfc4648#section-3.2padding characters.similar to hexadecimalstandard Base64unpadded URL-safe Base64<Base64 as used in OpenBSD password encoding (such as bcrypt)GConvert a bytearray to the equivalent representation in a specific BasePTry to Convert a bytearray from the equivalent representation in a specific Base BSD-style#Vincent Hanquez <vincent@snarc.org>stableGoodNoneDSimplest Byte Array+ BSD-style#Vincent Hanquez <vincent@snarc.org>stableGoodNoneD+?@NOPQRSTUVWXYZ[\]^_`abcdefghijklmnop,N?@AmnopOQPRUVWSXYZTfgc^_`lde][\hijkba BSD-Style#Vincent Hanquez <vincent@snarc.org> experimentalunknownNone >Fill a given sized buffer with the result of the Packer action/Pack the given packer into the given bytestring6Put a storable from the current position in the stream8Put a Byte Array from the current position in the stream)If the ByteArray is null, then do nothing7Skip some bytes from the current position in the streamCSkip the size of a storable from the current position in the stream:Fill up from the current position in the stream to the endIt is equivalent to: #fillUpWith s == fillList (repeat s)UWill put the given storable list from the current position in the stream to the end.jThis function will fail with not enough storage if the given storable can't be written (not enough space)Example: *> pack (fillList $ [1..] :: Word8) 9 "\1\2\3\4\5\6\7\8\9" > pack (fillList $ [1..] :: Word32) 4 "\1\0\0\0" > pack (fillList $ [1..] :: Word32) 64 .. <..succesful..> > pack (fillList $ [1..] :: Word32) 1 .. <.. not enough space ..> > pack (fillList $ [1..] :: Word32) 131 .. <.. not enough space ..>/put Word8 in the current position in the streamHput Word16 in the current position in the stream /! use Host EndiannessHput Word32 in the current position in the stream /! use Host EndiannessBCDEBCDE,    !""#$%&&'(()*+,-./0123456789:;<==>>?@ABCDEEFFGHIJKLMNOPQRSTUUVWXYZ [ \ ] ^ _ ` a bcdefghijklmnopqrstuvwxyz{|}~  X    s       j        hW !"#$%&'()*+,-./0123456789:pc;<= > ?  @A%memory-0.14.11-CrTYVLIZ7M3F0ihMWMiuVgData.ByteArrayData.Memory.ExtendedWordsData.Memory.EndianData.ByteArray.HashData.Memory.Encoding.Base16Data.Memory.Encoding.Base32Data.Memory.Encoding.Base64Data.ByteArray.PackData.Memory.PtrMethodsData.ByteArray.ParseData.ByteArray.MappingData.ByteArray.EncodingData.ByteArray.TypesData.Memory.Internal.CompatData.Memory.Hash.SipHashData.Memory.Internal.CompatPrim!Data.Memory.Internal.CompatPrim64Data.Memory.Internal.DeepSeqData.Memory.Internal.ImportsData.Memory.Hash.FNVData.ByteArray.MemViewData.ByteArray.Pack.InternalData.Memory.Internal.ScrubberData.Memory.MemMap.PosixData.ByteArray.ScrubbedBytesData.ByteArray.MethodsData.ByteArray.ViewData.ByteArray.Bytes ByteArrayallocRetByteArrayAccesslength withByteArrayWord128 $fShowWord128 $fEqWord128ByteSwapBEunBELEunLE Endianness LittleEndian BigEndiangetSystemEndiannesstoBEfromBEtoLEfromLE$fByteSwapWord64$fByteSwapWord32$fByteSwapWord16$fShowEndianness$fEqEndianness$fShowLE$fEqLE $fStorableLE$fShowBE$fEqBE $fStorableBESipHashSipKeyshowHexadecimal toHexadecimalfromHexadecimaltoBase32unBase32Length fromBase32 FnvHash64 FnvHash32sipHash sipHashWithfnv1Hash fnv1aHash fnv1_64Hash fnv1a_64HashtoBase64 toBase64URLtoBase64OpenBSDunBase64LengthunBase64LengthUnpaddedfromBase64OpenBSDfromBase64URLUnpadded fromBase64MemView memViewPlusPackerResult PackerMore PackerFailmemCreateTemporarymemXor memXorWithmemCopymemSetmemEqual memCompare memConstEqual ScrubbedBytesalloccreateallocAndFreeze unsafeCreateemptynullpackunpackuncons singletonconssnocxorindexsplitAttakedropspanconcatappendcopycopyRet copyAndFreeze replicatezeroeqconstEqanyallconvertViewviewtakeViewdropViewParser ParseFail ParseMoreParseOK parseFeedparsehasMoreanyBytebytebytes takeStorable takeWhiletakeAllskip skipWhileskipAll $fShowResult$fAlternativeParser$fMonadPlusParser $fMonadParser$fApplicativeParser$fFunctorParsertoW64BEtoW64LE fromW64BE mapAsWord128 mapAsWord64BaseBase16Base32Base64Base64URLUnpadded Base64OpenBSD convertToBaseconvertFromBase $fShowBase$fEqBaseBytesfill putStorableputBytes skipStorable fillUpWithfillListputWord8 putWord16 putWord32 unsafeDoIObaseGHC.Word byteSwap64 byteSwap32 byteSwap16 Data.Bits unsafeShiftR unsafeShiftLpopCountbyteSwaphashhashWith InternalStateGHC.BaseString convertBytebe32Primle32Primbyteswap32Prim booleanPrimeitherDivideBy8#Int64#Word64# eqWord64# neWord64# ltWord64# leWord64# gtWord64# geWord64#eqInt64#neInt64#ltInt64#leInt64#gtInt64#geInt64# quotInt64# remInt64#and64#or64#xor64#not64#uncheckedShiftL64#uncheckedShiftRL64#int64ToWord64#word64ToInt64# intToInt64# int64ToInt# wordToWord64# word64ToWord# timesWord64#w64#deepseq-1.4.3.0Control.DeepSeqNFDatarnf<$ Applicativepure<*>*>liftA2<*ghc-prim GHC.TypesWordWord8Word16Word32Word64Data.TraversableforMControl.Applicativeoptional WrappedMonad WrapMonad unwrapMonad WrappedArrow WrapArrow unwrapArrowZipList getZipList Control.ArrowfirstsecondData.Functor.ConstConstgetConst Data.FoldableforM_ Data.Functorvoid<$>liftA3liftA<**> Alternative<|>somemanyfnv1fnv1afnv1_64fnv1a_64 actionPackeractionPackerWithRemain runPacker_ getScrubberMemorySyncFlagMemorySyncAsyncMemorySyncSyncMemorySyncInvalidate MemoryAdviceMemoryAdviceNormalMemoryAdviceRandomMemoryAdviceSequentialMemoryAdviceWillNeedMemoryAdviceDontNeedMemoryProtection MemoryMapFlagMemoryMapSharedMemoryMapPrivate memoryMap memoryUnmap memoryAdvise memoryLock memoryUnlock memoryProtect memorySyncsysconfPageSizeMemoryProtectionNoneMemoryProtectionReadMemoryProtectionWriteMemoryProtectionExecute viewOffsetviewSizeunViewSuccessFailure runParser