zn      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklm ,Provides an efficient buffering abstraction.None!"0:T[)Exception that is thrown when an invalid ' is being used that is no longer valid.A  is considered to be invalid ifit has explicitly been freed=an Exception has occured during an operation that modified it'function name that caused the exception'printed representation of the exceptionn)A buffer into which bytes can be written. Invariants: ,size >= containedBytes >= consumedBytes >= 0The range from ptr to ptr o size will be allocatedThe range from ptr to ptr o containedBytes6 will contain bytes previously copied to the bufferThe buffer contains containedBytes - consumedBytes` bytes of data that have been copied to it, but not yet read. They are in the range from ptr o consumedBytes to ptr o containedBytes.WThe first two invariants are encoded in Liquid Haskell, and can be statically checked.<If an Exception occurs during an operation that modifies a , the B is invalidated and can no longer be used. Trying to access the  subsequently will result in a  being thrown.pThe amount of memory allocated.qThe number of bytes that the  currently holds.r4The number of bytes that have already been consumed.s>This points to the beginning of the memory allocated for the tQOn any Exception, this will invalidate the ByteBuffer and re-throw the Exception.Invalidating the ) includes freeing the underlying pointer.uTry to use the n of a  , or throw a  if it's invalid.Number of available bytes in a F (that is, bytes that have been copied to, but not yet read from the .WAllocates a new ByteBuffer with a given buffer size filling from the given FillBuffer. Note that s created with * have to be deallocated explicitly using /. For automatic deallocation, consider using  instead.Free a byte buffer.SPerform some action with a bytebuffer, with automatic allocation and deallocation.vReset a nV, i.e. copy all the bytes that have not yet been consumed to the front of the buffer.w!Make sure the buffer is at least minSize bytes long.xIn order to avoid having to enlarge the buffer too often, we multiply its size by a factor of 1.5 until it is at least minSize bytes long.Copy the contents of a x to a .If necessary, the 8 is enlarged and/or already consumed bytes are dropped.)Will read at most n bytes from the given yU, in a non-blocking fashion. This function is intended to be used with non-blocking Socket!s, such the ones created by the network package.4Returns how many bytes could be read non-blockingly. Try to get a pointer to n bytes from the .TNote that the pointer should be used before any other actions are performed on the . It points to some address within the buffer, so operations such as enlarging the buffer or feeding it new data will change the data the pointer points to. This is why this function is called unsafe.!As  , but instead of returning a z into the contents of the , it returns a x containing the next n7 bytes in the buffer. This involves allocating a new x and copying the n bytes to it.!n{pqrs|tBlocation information: function from which the exception was thrownthis - will be invalidated when an Exception occursu Size of buffer to allocate. If }, use the default value of 4MBThe byte buffer.Initial length of the . If } , use the default value of 4MB.vw~ nWill be  Left missing when there are only  n-missing bytes left in the .!"# !! n{pqrs|tuvw~ !"#Safe%#Type used to store the length of a Message.&6Some fixed arbitrary magic number that precedes every Message.%&'()%&'()&'()%%&'() None,069:;<=DQRTa-Info about a type's serialized length. Either the length is known independently of the value, or the length depends on the value.0The 0Z typeclass provides efficient serialization and deserialization to raw pointer addresses.The 3 and 2& methods should be defined such that  decodeEx (encode x) == x .1 Yields the -T of the buffer, in bytes, required to store the encoded representation of the type.INote that the correctness of this function is crucial for the safety of 2U, as it does not do any bounds checking. It is the responsibility of the invoker of 2 (4W and similar functions) to ensure that there's enough space in the output buffer. If 2n writes beyond, then arbitrary memory can be overwritten, causing undefined behavior and segmentation faults.2~Serializes a value to bytes. It is the responsibility of the caller to ensure that at least the number of bytes required by 1- are available. These details are handled by 4 and similar utilities.3mSerialized a value from bytes, throwing exceptions if it encounters invalid data or runs out of input bytes.4Serializes a value to a x-. In order to do this, it first allocates a x of the correct size (based on 1), and then uses 2 to fill it.6Safety of this function depends on correctness of the 0 instance. If 1 returns a. The good news is that this isn't an issue if you use well-tested manual instances (such as those from this package) combined with auomatic definition of instances.5Decodes a value from a x{. Returns an exception if there's an error while decoding, or if decoding undershoots / overshoots the end of the buffer.6Decodes a value from a xP, potentially throwing exceptions. It is an exception to not consume all input.7Decodes a value from a xP, potentially throwing exceptions. It is an exception to not consume all input.8>Get the number of bytes needed to store the given value. See 1.9Given a - value and a value of the type a, returns its  size.:Create an aggregate -< by providing functions to split the input into two pieces.If both of the types are /, the result is /% and the functions will not be used.;Create an aggregate -H by providing functions to split the input into two pieces, as well as -' values to use to measure the results.If both of the input - values are /, the result is /$ and the functions will not be used.<Adds a constant amount to a - value.A 1( implementation based on an instance of  and .A 1( implementation based on an instance of . Use this if the type is not .;*+,-./0123456789:;<=>?"*+,-./0321456789:;<=>?0*+,-./0123123456789:;<=>?None@Test a 0 instance using  smallcheck and .BHCheck if a given value succeeds in decoding its encoded representation.@AB@AB@BA@ABNone$BF[Get a map from the  type of instances to .CDEFGHIJKCDEFGHIJFDEGHCIJCDEFGHIJKNone$,0259:;<=BDORTaQ Implement 1 for an  of 0 instances.eNote that many monomorphic containers have more efficient implementations (for example, via memcpy).R Implement 2 for an  of 0 instances.eNote that many monomorphic containers have more efficient implementations (for example, via memcpy).S Implement 3 for an  of 0 instances.eNote that many monomorphic containers have more efficient implementations (for example, via memcpy).T Implement 1 for an  of 0 instances.U Implement 2 for an  of 0 instances.V Implement 3 for an  of 0 instances.W Implement 1 for an  of where both  and  are 0 instances.X Implement 2 for an  of where both  and  are 0 instances.Y Implement 3 for an  of where both  and  are 0 instances.oMarker for maps that are encoded in ascending order instead of the descending order mistakenly implemented in Y in store versions < 0.4.See  'https://github.com/fpco/store/issues/97.Z+Ensure the presence of a given magic value. Throws a  if the value isn't present.[Like W7 but should only be used for ordered containers where  returns an ascending list.\Like X7 but should only be used for ordered containers where  returns an ascending list.]Decode the results of \. using a given function to construct the map.Implementation of peek for mutable sequences. The user provides a function for initializing the sequence and a function for mutating an element at a particular index.^Skip n bytes forward._AIsolate the input to n bytes, skipping n bytes forward. Fails if m1 advances the offset beyond the isolated region.ELMNOPQRSTUVWXYZ[\]@A function to construct the map from an ascending list such as .^_`abcdefghijklmnopqrstuvwxyz{|}~C  *+,-./0321456789:;<=>?LMNOPQRSTUVWXYZ[\]^_`abcdeG45670123123 -./89:;<QRSTUVWXY[\]cde,=+>*?^_ZLMNOP`abBLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None !"05IT#<Configuration for the version checking of a particular type.%>When set, specifies the hash which is expected to be computed.&<When set, specifies the name to instead use to tag the data.'DataTypes to ignore.(6Allowed renamings of datatypes, useful when they move.$#$%&'()*+,-./ #$%&'()*+,-./ )*+#$%&'(,-./#$%&'()*+,-./ None*+,-./0321456745670123123-./,+*!A thin streaming layer that uses 0 for serialisation.None:[:bWe use this type as a more descriptive unit to signal that more input should be read from the Fd.LThis data-type is only available on POSIX systems (essentially, non-windows)<$Given some sort of input, fills the  with it.The K is how many bytes we'd like: this is useful when the filling function is  fillFromFd", where we can specify a max size.=yThe result of peeking at the next message can either be a successfully deserialised object, or a request for more input.>If a is an instance of 0,  Message a< can be serialised and deserialised in a streaming fashion.A Encode a > to a x.Decode a value, given a z; and the number of bytes that make up the encoded message.'Read and check the magic number from a  Decode a % from a .BDecode some object from a 9, by first reading its header, and then the actual data.C Decode a > from a S and an action that can get additional inputs to refill the buffer when necessary.8The only conditions under which this function will give }, is when the , contains zero bytes, and refilling yields }H. If there is some data available, but not enough to decode the whole >, a  will be thrown.D Decode some > from a 4, by first reading its header, and then the actual >.F&Peeks a message from a _non blocking_ y.KThis function is only available on POSIX systems (essentially, non-windows)GDecodes all the message using  registerFd to find out when a Socket is ready for reading.KThis function is only available on POSIX systems (essentially, non-windows)HConduit for encoding >s to xs.IConduit for decoding >s from xs.:;<=>?@ABCDEFGHIInitial length of the " used for buffering the incoming xs. If } , use the default value of 4MB.:;<=>?@ABCDEFGHI>?@A=<BCDE:;FGHI:;<=>?@ABCDEFGHINone ,/05ITWAt compiletime, this yields a hash of the specified datatypes. Not only does this cover the datatypes themselves, but also all transitive dependencies..The resulting expression is a literal of type P.XBAt compiletime, this yields a cryptographic hash of the specified C, including the definition of things it references (transitively)..The resulting expression is a literal of type P.NOPQRSTUVWXYZ[\]^_`abNOPQRSTUVWXYZ[\]^STUbaPQR`_VWXYZ[NO\]^NOPQRSTUVWXYZ[\]^_`ab NoneNOPSTU\]STUPNO\]                     !"#$%&'()*+,-./01234 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I JKLMNOPQRSTUVWXYYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,--./01223456789:;<=>?@ABBCDEEFGHIJKLMNOPQRSTUVVWXXYZ[\]^_`abcdefghijklmnopqrstu<vwxyz{|}~sstrs ss                                    "store-0.4.1-6PwM1yWjY1yBkYOHPfNXBjData.Store.InternalSystem.IO.ByteBufferData.Store.Streaming.Internal Data.Store.THData.Store.TH.InternalData.Store.VersionData.Store.StreamingData.Store.TypeHash.InternalData.Store.Impl Data.StoreData.Store.TypeHash%store-core-0.4-8V6LlTgkKeEEX1ovGURHpcData.Store.CoredecodeIOPortionWith decodeIOWithdecodeExPortionWith decodeExWith decodeWith tooManyBytes peekException pokeExceptionPoke pokeExMessagepokeExByteIndex PokeExceptionrunPeekPeek peekExMessagepeekExBytesFromEnd PeekException ByteBufferByteBufferException _bbeLocation _bbeException totalSizeisEmptyavailableBytesnewfreewithcopyByteString fillFromFd unsafeConsumeconsume$fExceptionByteBufferException$fShowByteBufferException$fEqByteBufferExceptionSizeTag messageMagic magicLength sizeTagLength headerLength GStorePeek GStorePoke GStoreSizeSizeVarSize ConstSizeStoresizepokepeekencodedecodedecodeExdecodeIOgetSize getSizeWith combineSizecombineSizeWithaddSize genericSize genericPoke genericPeeksmallcheckManyStoreassertRoundtripcheckRoundtrip deriveStorederiveTupleStoreInstancederiveGenericInstancederiveManyStoreFromStorablederiveManyStorePrimVectorderiveManyStoreUnboxVectorgetAllInstanceTypes1 isMonoType$fDeriverStore IsStaticSize toStaticSize StaticSize unStaticSize sizeSequence pokeSequence peekSequencesizeSetpokeSetpeekSetsizeMappokeMappeekMap peekMagic sizeOrdMap pokeOrdMappeekOrdMapWithskipisolatetoStaticSizeExliftStaticSizestaticByteStringExp sizeArray pokeArray peekArray $fStoreEither $fStoreMaybe $fStoreLast $fStoreFirst$fStoreProduct $fStoreSum $fStoreDual $fStore()$fStoreUTCTime$fStoreDiffTime $fStoreDay $fStoreRatio $fStoreFixed$fStoreInteger $fStoreUArray $fStoreArray$fStoreHashSet$fStoreHashMap $fStoreMap $fStoreIntMap $fStoreIntSet $fStoreSet $fStoreSeq$fStoreNonEmpty $fStore[]$fStoreStaticSize$fIsStaticSizenByteString$fNFDataStaticSize $fStoreText$fStoreByteString$fStoreShortByteString$fStoreByteString0 $fStoreVector$fStoreVector0$fEqStaticSize$fShowStaticSize$fOrdStaticSize$fDataStaticSize$fGenericStaticSize $fStoreBool $fStoreVoid $fStoreAny $fStoreAll$fStore(,,,,,,)$fStore(,,,,,) $fStore(,,,,) $fStore(,,,) $fStore(,,) $fStore(,)$fStoreVector1$fStoreVector2$fStoreVector3$fStoreVector4$fStoreVector5$fStoreVector6$fStoreVector7$fStoreVector8$fStoreVector9$fStoreVector10$fStoreVector11$fStoreVector12$fStoreVector13$fStoreVector14$fStoreVector15$fStoreVector16$fStoreVector17$fStoreVector18$fStoreVector19$fStoreVector20$fStoreVector21 $fStoreWord $fStoreInt $fStoreFloat $fStoreDouble $fStoreChar $fStoreFd $fStoreCUid$fStoreCTcflag $fStoreCSsize $fStoreCSpeed $fStoreCRLim $fStoreCPid $fStoreCOff $fStoreCNlink $fStoreCMode $fStoreCIno $fStoreCGid $fStoreCDev $fStoreCCc $fStoreWord8 $fStoreWord64 $fStoreWord32 $fStoreWord16$fStoreStablePtr $fStorePtr $fStoreFunPtr $fStoreInt8 $fStoreInt64 $fStoreInt32 $fStoreInt16$fStoreFingerprint$fStoreWordPtr $fStoreIntPtr $fStoreCWchar$fStoreCUShort$fStoreCUSeconds $fStoreCULong$fStoreCULLong$fStoreCUIntPtr$fStoreCUIntMax $fStoreCUInt $fStoreCUChar $fStoreCTime $fStoreCSize$fStoreCSigAtomic $fStoreCShort$fStoreCSUSeconds $fStoreCSChar$fStoreCPtrdiff $fStoreCLong $fStoreCLLong$fStoreCIntPtr$fStoreCIntMax $fStoreCInt $fStoreCFloat$fStoreCDouble $fStoreCClock $fStoreCChar$fStoreIdentity $fStoreConst$fStoreComplex$fStoreVector22$fStoreVector23$fStoreVector24$fStoreVector25$fStoreVector26$fStoreVector27$fStoreVector28$fStoreVector29$fStoreVector30$fStoreVector31$fStoreVector32$fStoreVector33$fStoreVector34$fStoreVector35$fStoreVector36$fStoreVector37$fStorePkgName$fStoreNameSpace$fStoreModName $fStoreRole$fStoreInjectivityAnn$fStoreFamilyResultSig$fStoreTypeFamilyHead$fStoreTySynEqn$fStoreAnnTarget$fStoreRuleBndr $fStorePhases$fStoreRuleMatch $fStoreInline $fStorePragma$fStoreFixityDirection $fStoreFixity $fStoreSafety$fStoreCallconv$fStoreForeign$fStoreOverlap $fStoreFunDep$fStoreSourceStrictness$fStoreSourceUnpackedness $fStoreBang $fStoreCon $fStoreRange $fStoreStmt $fStoreGuard $fStoreBody $fStoreMatch $fStoreExp $fStoreTyLit$fStoreTyVarBndr $fStoreType $fStoreLit $fStorePat $fStoreClause$fStoreNameFlavour$fStoreOccName $fStoreName $fStoreDec $fStoreInfo VersionConfigvcExpectedHash vcManualNamevcIgnore vcRenames StoreVersionunStoreVersionhashedVersionConfignamedVersionConfigencodeWithVersionQdecodeWithVersionQ$fEqStoreVersion$fShowStoreVersion$fOrdStoreVersion$fDataStoreVersion$fGenericStoreVersion$fStoreStoreVersion$fEqVersionConfig$fShowVersionConfig$fDataVersionConfig$fGenericVersionConfig ReadMoreDataFillByteBuffer PeekMessageMessage fromMessage encodeMessage peekMessage decodeMessage peekMessageBSdecodeMessageBS peekMessageFddecodeMessageFd conduitEncode conduitDecode $fEqMessage $fShowMessage$fEqReadMoreData$fShowReadMoreData HasTypeHashtypeHashTypeHash unTypeHashTaggedunTaggedreifyManyTyDeclstypeHashForNames hashOfTypegetTypeInfosRecursively getConNames getVarNames mkHasTypeHashmkManyHasTypeHashcombineTypeHashes$fLiftTypeHash$fNFDataTypeHash $fStoreTagged$fNFDataTagged $fEqTagged $fOrdTagged $fShowTagged $fDataTagged$fGenericTagged $fEqTypeHash $fOrdTypeHash$fShowTypeHash$fStoreTypeHash$fGenericTypeHash$fDataTypeHashBBRefbaseGHC.PtrplusPtr containedconsumedptr bbHandleruseBBRef resetBBRef enlargeBBRefbytestring-0.10.8.1Data.ByteString.Internal ByteStringSystem.Posix.TypesFdPtrc_recvGHC.BaseNothingfillBBRefFromFdcreateBS_get1_get2_get3ghc-prim GHC.TypesInt sizeStorableForeign.StorableStorableData.Typeable.InternalTypeablesizeStorableTy GStorePeekSumgpeekSum GStorePokeSumgpokeSum GStoreSizeSumgsizeSumgpeekgpokegsizeSumArity$fGStorePeekSumnM1$fGStorePokeSumnM1$fGStoreSizeSumnM1$fGStorePeekSumn:+:$fGStorePokeSumn:+:$fGStoreSizeSumn:+:$fGStorePeek:+:$fGStorePoke:+:$fGStoreSize:+:$fGStorePeek:*:$fGStorePoke:*:$fGStoreSize:*:$fGStorePeekV1$fGStorePokeV1$fGStoreSizeV1$fGStorePeekU1$fGStorePokeU1$fGStoreSizeU1$fGStorePeekK1$fGStorePokeK1$fGStoreSizeK1$fGStorePeekM1$fGStorePokeM1$fGStoreSizeM1$fContravariantSize'hspec-core-2.4.2-5ZmjMIc0KLD5zsIKHjzU5MTest.Hspec.Core.RunnerhspecsmallcheckMany verboseTrace instancesMap getTyHead*th-reify-many-0.1.6-JMjusvFbGftD3sLFQokl7R&Language.Haskell.TH.ReifyMany.InternalTypeclassInstanceprimSizeOfExpr getUnboxInfo postprocessmakeStoreInstancegetAllInstanceTypesisVarTinstanceArgTypes-mono-traversable-1.0.2-GKlPo70b32DI1MkWIoSphqData.Sequences IsSequenceData.ContainersIsSetIsMap ContainerKeyMapValuemarkMapPokedInAscendingOrder mapToListpeekMutableSequencecontainers-0.5.7.1Data.Map.StrictfromDistinctAscListSsResults sCurResult sFieldNames WhichFuncEncodeDecodeimplwriteVersionInfostoreVersionedPathgetStructureInfogetStructureInfo'showsQualTypeRepshowsQualTyCon isTupleTyConshowArgs showTupletcListtcFuntyConOfdisplayVersionErrormarkEncodedVersion decodeFromPtrpeekMessageMagicpeekMessageSizeTag needMoreInput peekSizedtemplate-haskellLanguage.Haskell.TH.SyntaxType