úÎ!Çš®†ÿœ      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£¤¥¦§¨©ª«¬­®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòóôõö÷øùúûüýþÿ      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š› None,.28=>?@AHUVXf?Estore‚Info about a type's serialized length. Either the length is known independently of the value, or the length depends on the value.storeThe Z typeclass provides efficient serialization and deserialization to raw pointer addresses.The  and & methods should be defined such that  decodeEx (encode x) == x .store 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 U, as it does not do any bounds checking. It is the responsibility of the invoker of  (W and similar functions) to ensure that there's enough space in the output buffer. If n writes beyond, then arbitrary memory can be overwritten, causing undefined behavior and segmentation faults.store~Serializes a value to bytes. It is the responsibility of the caller to ensure that at least the number of bytes required by - are available. These details are handled by  and similar utilities.storemSerialized a value from bytes, throwing exceptions if it encounters invalid data or runs out of input bytes.storeSerializes a value to a œ-. In order to do this, it first allocates a œ of the correct size (based on ), and then uses  to fill it.6Safety of this function depends on correctness of the  instance. If ± 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.storeDecodes a value from a œ{. Returns an exception if there's an error while decoding, or if decoding undershoots / overshoots the end of the buffer.storeDecodes a value from a œP, potentially throwing exceptions. It is an exception to not consume all input. storeDecodes a value from a œP, potentially throwing exceptions. It is an exception to not consume all input.!store>Get the number of bytes needed to store the given value. See ."storeGiven a  value and a value of the type a, returns its  size.#storeCreate 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.$storeCreate 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.%storeAdds a constant amount to a  value.žstoreA ( implementation based on an instance of Ÿ and  .¡storeA ( implementation based on an instance of Ÿ. Use this if the type is not  .%¢£¤¥¦§¨©ª«¬­® !"#$%ž¡&'(None%FJ_E)store~Given the name of a type, generate a Store instance for it, assuming that all type variables also need to be Store instances.oNote that when used with datatypes that require type variables, the ScopedTypeVariables extension is required.¯storeGet a map from the ° type of instances to ±. )*+,-./01 -+,./*)01NoneG¡3storeTest a  instance using  smallcheck and ².5storeHCheck if a given value succeeds in decoding its encoded representation.)345)354None%.247=>?@AFHSVXfdw;store Implement  for an ³ of  instances.eNote that many monomorphic containers have more efficient implementations (for example, via memcpy).<store Implement  for an ³ of  instances.eNote that many monomorphic containers have more efficient implementations (for example, via memcpy).=store Implement  for an ³ of  instances.eNote that many monomorphic containers have more efficient implementations (for example, via memcpy).>store Implement  for an ´ of  instances.?store Implement  for an ³ of  instances.@store Implement  for an ³ of  instances.Astore Implement  for an µ of where both ¶ and · are  instances.Bstore Implement  for an µ of where both ¶ and · are  instances.Cstore Implement  for an µ of where both ¶ and · are  instances.¸storeoMarker for maps that are encoded in ascending order instead of the descending order mistakenly implemented in C in store versions < 0.4.See  'https://github.com/fpco/store/issues/97.Dstore+Ensure the presence of a given magic value. Throws a  if the value isn't present.EstoreLike A7 but should only be used for ordered containers where ¹ returns an ascending list.FstoreLike B7 but should only be used for ordered containers where ¹ returns an ascending list.GstoreDecode the results of F. using a given function to construct the map.ºstore¨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.HstoreSkip n bytes forward.IstoreAIsolate the input to n bytes, skipping n bytes forward. Fails if m1 advances the offset beyond the isolated region.Gstore@A function to construct the map from an ascending list such as ».C   !"#$%&'(6789:;<=>?@ABCDEFGHIJKLMNOC  !"#$%;<=>?@ABCEFGMNO&'(HID6789:JKLNonefÅ  None .127MXnj\store™At 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 U.]storeBAt 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 U.STUVWXYZ[\]^_`abcXYZUVW[\]^_`STabc Noneo(STUXYZabXYZUSTabNone "#27MXtŒsstore<Configuration for the version checking of a particular type.ustore>When set, specifies the hash which is expected to be computed.vstore<When set, specifies the name to instead use to tag the data.wstoreDataTypes to ignore.xstore6Allowed renamings of datatypes, useful when they move. stuvwxyz{|}~ yz{stuvwx|}~,Provides an efficient buffering abstraction.None"#2>X_® ‹store)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 itstore'function name that caused the exceptionŽstore'printed representation of the exception½store)A buffer into which bytes can be written. Invariants: ,size >= containedBytes >= consumedBytes >= 0The range from ptr to ptr ¾ size will be allocatedThe range from ptr to ptr ¾ 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 ¾ consumedBytes to ptr ¾ 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.¿storeThe amount of memory allocated.ÀstoreThe number of bytes that the Š currently holds.Ástore4The number of bytes that have already been consumed.Âstore>This points to the beginning of the memory allocated for the ŠÃstoreQOn any Exception, this will invalidate the ByteBuffer and re-throw the Exception.Invalidating the Š) includes freeing the underlying pointer.ÄstoreTry to use the ½ of a Š , or throw a ‹ if it's invalid.‘storeNumber of available bytes in a ŠF (that is, bytes that have been copied to, but not yet read from the Š.’storeWAllocates 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.“storeFree a byte buffer.”storeSPerform some action with a bytebuffer, with automatic allocation and deallocation.ÅstoreReset a ½V, i.e. copy all the bytes that have not yet been consumed to the front of the buffer.Æstore!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.•storeCopy the contents of a œ to a Š.If necessary, the Š8 is enlarged and/or already consumed bytes are dropped.–store)Will read at most n bytes from the given ÇU, 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.—storeTry 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.˜storeAs —, but instead of returning a È into the contents of the Š, it returns a œ containing the next n7 bytes in the buffer. This involves allocating a new œ and copying the n bytes to it.ÃstoreBlocation information: function from which the exception was thrownstorethis Š- will be invalidated when an Exception occurs’store Size of buffer to allocate. If É, use the default value of 4MBstoreThe byte buffer.”storeInitial length of the Š. If É , use the default value of 4MB.—storenstoreWill be  Left missing when there are only  n-missing bytes left in the Š.Š‹ŒŽ‘’“”•–—˜Š’“”‘•–˜—‹ŒŽÊ                  !"#$%&'()*+,-./0123456789:;<=>?@ABBCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£¤¥¦§¨©ª«¬­®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòóôõö÷øùúûüýþÿ      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^^_``abcdefghijklmnopqrstuvwxyzz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£¤¥¦§¨©§ª«¬­®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁÂÃÄÂÅÆÂÅÇÂÅÈÂÅÉÊÂÅËÌÍÎÏÐÑÒÓ§ÔÕ$Ö×ØÙÚÛܧÝÞ§Ôߧàáâ"store-0.7.6-IQrrPwmdkbVJK9vmHUU72VData.Store.InternalData.Store.TH.Internal Data.Store.THData.Store.TypeHash.InternalData.Store.VersionSystem.IO.ByteBufferData.Store.Impl Data.StoreData.Store.TypeHash)store-core-0.4.4.3-E53oh2CvUd66boU0bATjkGData.Store.CoredecodeIOPortionWith decodeIOWithdecodeExPortionWith decodeExWith decodeWith tooManyBytes peekException pokeExceptionPoke pokeExMessagepokeExByteIndex PokeExceptionrunPeekPeek peekExMessagepeekExBytesFromEnd PeekException GStorePeek GStorePoke GStoreSizeSizeVarSize ConstSizeStoresizepokepeekencodedecodedecodeExdecodeIOgetSize getSizeWith combineSizecombineSizeWithaddSize genericSize genericPoke genericPeek makeStore deriveStorederiveTupleStoreInstancederiveGenericInstancederiveManyStoreFromStorablederiveManyStorePrimVectorderiveManyStoreUnboxVectorgetAllInstanceTypes1 isMonoType$fDeriverStoresmallcheckManyStoreassertRoundtripcheckRoundtrip IsStaticSize toStaticSize StaticSize unStaticSize sizeSequence pokeSequence peekSequencesizeSetpokeSetpeekSetsizeMappokeMappeekMap peekMagic sizeOrdMap pokeOrdMappeekOrdMapWithskipisolatetoStaticSizeExliftStaticSizestaticByteStringExp sizeArray pokeArray peekArray $fStoreConst $fStoreMaybe $fStoreLast $fStoreFirst$fStoreProduct $fStoreSum $fStoreDual $fStore()$fStoreUTCTime$fStoreDiffTime $fStoreDay$fStoreIdentity$fStoreComplex $fStoreRatio $fStoreFixed$fStoreInteger $fStoreUArray $fStoreArray$fStoreHashSet$fStoreHashMap $fStoreMap $fStoreIntMap $fStoreIntSet $fStoreSet $fStoreSeq$fStoreNonEmpty $fStore[] $fStoreText$fStoreByteString$fStoreShortByteString$fStoreByteString0 $fStoreVector$fStoreVector0$fStoreStaticSize$fNFDataStaticSize$fIsStaticSizenByteString$fEqStaticSize$fShowStaticSize$fOrdStaticSize$fDataStaticSize$fGenericStaticSize $fStoreEither $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$fStoreVector22$fStoreVector23$fStoreVector24$fStoreVector25$fStoreVector26$fStoreVector27$fStoreVector28$fStoreVector29$fStoreVector30$fStoreVector31$fStoreVector32$fStoreVector33$fStoreVector34$fStoreVector35$fStoreVector36$fStoreVector37$fStorePrimStorable$fStorePortNumber $fStoreWord $fStoreInt $fStoreFloat $fStoreDouble $fStoreChar$fStoreTimeSpec $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 $fStoreCBool$fStoreVector38$fStoreVector39$fStoreVector40$fStoreVector41$fStoreVector42$fStoreVector43$fStoreVector44$fStoreVector45$fStoreVector46$fStoreVector47$fStoreVector48$fStoreVector49$fStoreVector50$fStoreVector51$fStoreVector52$fStoreVector53$fStoreVector54$fStoreVector55$fStoreVector56$fStoreVector57$fStoreVector58$fStoreVector59$fStoreVector60$fStoreVector61$fStoreVector62$fStoreVector63$fStoreVector64$fStoreVector65$fStoreVector66$fStoreVector67$fStoreVector68$fStoreVector69$fStoreVector70$fStoreVector71$fStoreVector72$fStoreVector73$fStoreVector74$fStoreVector75$fStoreVector76$fStoreVector77$fStoreVector78$fStoreVector79$fStoreVector80$fStoreVector81$fStoreVector82$fStoreVector83$fStoreVector84$fStoreVector85$fStoreVector86$fStoreVector87$fStoreVector88$fStoreVector89$fStoreVector90$fStoreVector91$fStoreVector92$fStoreVector93$fStoreVector94$fStoreVector95$fStoreVector96$fStoreVector97$fStoreVector98$fStoreVector99$fStoreVector100$fStoreVector101$fStoreVector102$fStoreVector103$fStoreVector104$fStoreVector105$fStoreVector106$fStoreVector107$fStoreVector108$fStoreVector109$fStoreVector110$fStoreVector111$fStoreVector112$fStoreVector113$fStorePkgName$fStoreNameSpace$fStoreModName$fStorePatSynDir$fStorePatSynArgs $fStoreRole$fStoreInjectivityAnn$fStoreFamilyResultSig$fStoreTypeFamilyHead$fStoreTySynEqn$fStoreAnnTarget$fStoreRuleBndr $fStorePhases$fStoreRuleMatch $fStoreInline $fStorePragma$fStoreFixityDirection $fStoreFixity $fStoreSafety$fStoreCallconv$fStoreForeign$fStoreOverlap $fStoreFunDep$fStoreDerivStrategy$fStoreDerivClause$fStoreSourceStrictness$fStoreSourceUnpackedness $fStoreBang $fStoreCon $fStoreRange $fStoreStmt $fStoreGuard $fStoreBody $fStoreMatch $fStoreExp $fStoreTyLit$fStoreTyVarBndr $fStoreType $fStoreLit $fStorePat $fStoreClause$fStoreNameFlavour$fStoreOccName $fStoreName $fStoreDec $fStoreInfo HasTypeHashtypeHashTypeHash unTypeHashTaggedunTaggedreifyManyTyDeclstypeHashForNames hashOfTypegetTypeInfosRecursively getConNames getVarNames mkHasTypeHashmkManyHasTypeHashcombineTypeHashes$fNFDataTagged$fLiftTypeHash$fNFDataTypeHash $fStoreTagged $fEqTagged $fOrdTagged $fShowTagged $fDataTagged$fGenericTagged $fEqTypeHash $fOrdTypeHash$fShowTypeHash$fStoreTypeHash$fGenericTypeHash$fDataTypeHash VersionConfigvcExpectedHash vcManualNamevcIgnore vcRenames StoreVersionunStoreVersionhashedVersionConfignamedVersionConfigencodeWithVersionQdecodeWithVersionQ$fEqStoreVersion$fShowStoreVersion$fOrdStoreVersion$fDataStoreVersion$fGenericStoreVersion$fStoreStoreVersion$fEqVersionConfig$fShowVersionConfig$fDataVersionConfig$fGenericVersionConfig ByteBufferByteBufferException _bbeLocation _bbeException totalSizeisEmptyavailableBytesnewfreewithcopyByteString fillFromFd unsafeConsumeconsume$fExceptionByteBufferException$fShowByteBufferException$fEqByteBufferExceptionbytestring-0.10.8.2Data.ByteString.Internal ByteStringghc-prim GHC.TypesInt sizeStorablebaseForeign.StorableStorableData.Typeable.InternalTypeablesizeStorableTy GStorePeekSumgpeekSum GStorePokeSumgpokeSum GStoreSizeSumgsizeSumTypeErrorMessageFitsInByteResult FitsInBytegpeekgpokegsizeSumArity instancesMap getTyHead*th-reify-many-0.1.9-4AN3aHsLpX33Ufg4l7sZdX&Language.Haskell.TH.ReifyMany.InternalTypeclassInstance'hspec-core-2.7.1-8cp7b1LhUFzFD4kMxpUz1hTest.Hspec.Core.Runnerhspec0mono-traversable-1.0.15.1-CNieI3ogmDP50nj4BQE23hData.Sequences IsSequenceData.ContainersIsSetIsMap ContainerKeyMapValuemarkMapPokedInAscendingOrder mapToListpeekMutableSequencecontainers-0.6.0.1Data.Map.Strict.InternalfromDistinctAscListtemplate-haskellLanguage.Haskell.TH.SyntaxTypeBBRefGHC.PtrplusPtr containedconsumedptr bbHandleruseBBRef resetBBRef enlargeBBRefSystem.Posix.TypesFdPtr GHC.MaybeNothing