h*LCy      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFG H I JKLMNO P Q R S T U V W X Y Z [ \ ] ^ _`abcdefghijklmnopqrstuvwxyz{|}~                       !!!!!!!!!!!!!!!!!!!!!"0.7.0# Safe-Inferred )1=>binrepCommon type error string for when you attempt to use a binrep instance at a sum data type GHC is asked to derive a non-sum instance, but the data type in question turns out to be a sum data type.No need to add the data type name here, since GHC's context includes the surrounding instance declaration.binrepCommon type error string for when you attempt to use a binrep instance at an empty data type (e.g. #$, %&). Safe-Inferred )1=> |binrep4DerivingVia newtype for types which can borrow from Prim'.   Safe-Inferred )1=>) binrepParse error parsing prefix tag. binrep7Unable to match a constructor to the parsed prefix tag.binrep2A generic context layer for a parse error of type e.Recursive: parse errors occurring in fields are wrapped up here. (Those errors may also have a generic context layer.)Making this explicitly recursive may seem strange, but it clarifies that this data type is to be seen as a layer over a top-level type.binrep1Parse error relating to sum types (constructors).binrep#Parse error in a constructor field.binrepexpected first, got secondbinrepexpected first, got secondbinrepexpected first, got secondbinrep known failbinrepparse fail (where you parse a larger object, then a smaller one in it)binrep#ran out of input, needed precisely n bytes for this part (n > 0) Actually a  , but we use 0 because that's what flatparse uses internally.binrep$Parse error with no further context.binrep!Somehow, we got two parse errors.I have a feeling that seeing this indicates a problem in your code.binrep(Parse error decorated with generic info.)Should not be set except by library code.binrepStructured parse error.binrepUnhandled parse error.>You get this if you don't change a flatparse fail to an error.)Should not be set except by library code. binrepconstructors testedbinrepprettified prefix tagbinrepconstructor namebinrepfield record name (if present)binrepfield index in constructorbinrepfield parse errorbinrepdata type name    Safe-Inferred )1=>p/binrep Decode a  ByteString to  with an explicit encoding.;This is intended to be used with visible type applications.0binrep7binrepAny  value is always valid UTF-8.66 Safe-Inferred )1=>;binrep Encode some + to the given character set using text-icu.No guarantees about correctness. Encodings are weird. e.g. Shift JIS's yen/backslash problem is apparently to do with OSs treating it differently. Expects a = that is confirmed valid for converting to the character set.The charset must be valid, or it's exception time. See text-icu.AbinrepTODO Unsafely assume all s are valid Shift-JIS.:;<=>:;<=> Safe-Inferred")1=>sBbinrep7-bitDbinrep: must be validated if you want to permit 7-bit ASCII only.TODO there should be a MUCH faster check here in text-2.0. text-short has it, text doesn't yet. see: *https://github.com/haskell/text/issues/496FbinrepWe reuse UTF-8 encoding for ASCII, since it is a subset of UTF-8.BCBC  Safe-Inferred )1=>zHbinrep Convert some  i where i >= 0 to a .,This is intended for wrapping the output of  functions.*underflows if you call it with a negative  :)GHIGHI Safe-Inferred )1=> LKJ LKJ  Safe-Inferred )1=>9PbinrepAny  value is always valid UTF-32.OO  Safe-Inferred )1=>VbinrepAny  value is always valid UTF-16.UU  Safe-Inferred )1=>][binrepEncode some validated text.\binrepEncode some text to a bytestring, asserting that the resulting value is valid for the requested bytestring representation.;This is intended to be used with visible type applications:+let Right t = refine @UTF8 (Text.pack "hi"):t tt :: AsText UTF8 let Right bs = encodeToRep @'C t:t bsbs :: Refined 'C Bytes201[\./6BCUO:<>;=201[\./  Safe-Inferred )1=>]binrepCommon type error string for when GHC is asked to derive a sum instance, but the data type in question turns out to be a non-sum data type.No need to add the data type name here, since GHC's context includes the surrounding instance declaration.^binrepCommon type error string for when GHC is asked to derive a non-sum instance, but the data type in question turns out to be a sum data type.No need to add the data type name here, since GHC's context includes the surrounding instance declaration.]^^] Safe-Inferred )1=>!6_binrep$Types which may be used as prefixes.'Generally, these will be integer types.Note that this is separate to binary representation, so endianness is irrelevant.9Note that we are also limited by the host architecture's  type. We don't try to work around this, because most types are indexed with 4s, so I think other things will break before we do.abinrepused by put. guaranteed that it fits from refined. that is, lenToPfx <= Max.bbinrepused by get. better not lie.gbinrep3Length prefixing with the unit means a length of 0.This is the only sensible case. 1 doesn't work because refining checks <=.I think there are laws here, where using this is the same as doing nothing at all.binrep/Byte ordering doesn't change how prefixes work._ba`_ba`' Safe-Inferred )1=>!w Safe-Inferred )1=>!ii Safe-Inferred )1=>"ZjbinrepRun a parser, and return the result as well as the number of bytes it consumed.jj Safe-Inferred)1=>"kbinrep The length of a type-level list.klmlmk Safe-Inferred)1=>#nbinrepDefunctionalization symbol for p.This is required for parameterized type-level generics e.g. bytezap's ().qbinrep6Reify a type's constant byte length to the term level.nopqrsopqrsn Safe-Inferred )1=>&abinrepconstant size putterbinrep)Serialize a term of the struct-like type a via its  instance.binrep%Look weird? Yeah. But it's correct :)binrep)Unit type serializes to nothing. How zen.binrep2Byte order is irrelevant for 8-bit (1-byte) words.binrep2Byte order is irrelevant for 8-bit (1-byte) words.binrep8-bit (1-byte) words do not require byte order in order to precisely define their representation.binrep8-bit (1-byte) words do not require byte order in order to precisely define their representation. Safe-Inferred )1=>'hbinrepconstant size parserbinrepdoesn't check lenbinrepdoesn't check lenbinrep)Serialize a term of the struct-like type a via its  instance.   Safe-Inferred)-1=>+ binrepParse from binary.binrep6Convert a bytezap struct parser to a flatparse parser.binrep:Parse. On parse error, coat it in a generic context layer.binrep Parse any .binrepReturn the rest of the input.A plain unannotated bytestring isn't very useful -- you'll usually want to null-terminate or length-prefix it.Note that this _does_ perform work: we make a new bytestring so we don't rely on the input bytestring. To use the input bytestring directly, see Binrep.Type.Thin.binrepParse elements until EOF. Sometimes used at the "top" of binary formats.binrepParse tuples left-to-right.binrepUnit type parses nothing.binrep2Byte order is irrelevant for 8-bit (1-byte) words.binrep2Byte order is irrelevant for 8-bit (1-byte) words.binrep8-bit (1-byte) words do not require byte order in order to precisely define their representation.binrep8-bit (1-byte) words do not require byte order in order to precisely define their representation.%  Safe-Inferred )1=>,binrepI don't know how to pattern match in types without writing type families. Safe-Inferred )1=>1 binrep1DerivingVia wrapper for types which may derive a ! instance through an existing o, instance (i.e. it is known at compile time)Examples of such types include machine integers, and explicitly-sized types (e.g. Binrep.Type.Sized).binrep7Class for types with easily-calculated length in bytes.If it appears hard to calculate byte length for a given type (e.g. without first serializing it, then measuring serialized byte length), consider whether this type is a good fit for binrep.binrep8Calculate the serialized byte length of the given value.binrep6Measure the byte length of a term of the non-sum type a via its  instance.binrep2Measure the byte length of a term of the sum type a via its  instance.You must provide a function to obtain the byte length for the prefix tag, via inspecting the reified constructor names. This is regrettably inefficient. Alas. Do write your own instance if you want better performance!binrep_O(1)_ s store their own length.binrep0_O(n)_ Sum the length of each element of a list.binrep_O(1)_ Sum tuples.binrep_O(1)_ Unit type has length 0.qq Safe-Inferred )1=>6 binrep%Serialize a term of the non-sum type a via its  instance.binrep!Serialize a term of the sum type a via its  instance."You must provide a serializer for a's constructors. This is regrettably inefficient due to having to use s. Alas. Do write your own instance if you want better performance!binrepPut types refined with multiple predicates by wrapping the left predicate with the right. LOL REALLY?binrep)Unit type serializes to nothing. How zen.binrep$Serialize generically using generic .binrep2Byte order is irrelevant for 8-bit (1-byte) words.binrep2Byte order is irrelevant for 8-bit (1-byte) words.binrep8-bit (1-byte) words do not require byte order in order to precisely define their representation.binrep8-bit (1-byte) words do not require byte order in order to precisely define their representation.  * Safe-Inferred )1=>6jqoppnrs  Safe-Inferred )1=>7 Safe-Inferred ")1=>7binrep$Essentially runtime reflection of a  type to p. Safe-Inferred")1=>7 Safe-Inferred")1=>9binrepThe byte length of a count-prefixed type is the length of the prefix type (holding the length of the type) plus the length of the type.(Bit confusing. How to explain this? TODObinrepWe can know byte length at compile time _if_ we know it for the prefix and the list-like.This is extremely unlikely, because then what counting are we even performing for the list-like? But it's a valid instance. Safe-Inferred ")1=>;binrepNull-terminated data. Arbitrary length terminated with a null byte. Permits no null bytes inside the data.binrepWe may parse any null-terminated data using a special flatparse combinator.binrepSerialization of null-terminated data may be defined generally using the data's underlying serializer.binrep4Null-terminated data may not contain any null bytes. Safe-Inferred )1=>=binrepreallyUnsafeRefine : safe assuming Haskell constructor names are UTF-8 with no null bytes allowedTurn a constructor name into a prefix tag by adding a null terminator.Not common in binary data representations, but safe and useful for debugging. Safe-Inferred ")1=>>binrep:A type which is to be null-padded to a given total length. Given some a ::  n a, it is guaranteed that  a  m @n thus m @n   a  0 That is, the serialized stored data will not be longer than the total length.binrepAssert that term will fit.binrepRun a Getter a isolated to n bytes.  Safe-Inferred )1=>B binrep!Types which define a magic value.binrep*How to turn the type into a list of bytes.binrep The length of a type-level list.binrepA singleton data type representing a "magic number" via a phantom type.The phantom type variable unambiguously defines a constant bytestring. A handful of types are supported for using magics conveniently, e.g. for pure ASCII magics, you may use a  type-level string.binrepStrengthen the unit to some  a.binrep Weaken a  a to the unit.binrepType-level symbols are turned into their Unicode codepoints - but multibyte characters aren't handled, so they'll simply be overlarge bytes, which will fail further down.binrepType-level naturals go as-is. (Make sure you don't go over 255, though!)binrep4The byte length of a magic is known at compile time.binrep4The byte length of a magic is obtained via reifying.  ! Safe-Inferred )1=>CI  +,-+,.+,/0120120134566789:;8<=>?@ABCD=E;FFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmno p q rstuvw x y z { | } ~         r                       !!!!!!!!!!!!!!!!!!!!!+''''''''+%0++++binrep-0.7.0-inplaceBinrep.Util.ByteOrderBinrep.Common.Class.TypeErrorsBinrep.Common.Via.PrimBinrep.Get.ErrorBinrep.Type.Text.InternalBinrep.Type.Text.Encoding.Utf8"Binrep.Type.Text.Encoding.ShiftJisBinrep.Type.Text.Encoding.Ascii Binrep.UtilBinrep.Type.Text.Encoding.Utf32Binrep.Type.Text.Encoding.Utf16Binrep.Type.TextBinrep.Util.GenericBinrep.Util.Prefix"Raehik.Compat.FlatParse.Basic.Prim(Raehik.Compat.FlatParse.Basic.WithLength Util.TypeNats Binrep.CBLenBinrep.Put.StructBinrep.Get.Struct Binrep.GetBinrep.CBLen.Generic Binrep.BLen Binrep.PutBinrep.Type.ThinBinrep.Type.SizedBinrep.Type.Prefix.SizeBinrep.Type.Prefix.CountBinrep.Type.NullTerminatedBinrep.GenericBinrep.Type.NullPaddedBinrep.Type.Magic Binrep.Testbinrep Data.VoidVoid GHC.GenericsV1 Paths_binrepBytezap.Struct.Generic GPokeBaseBinrepbase GHC.ByteOrder ByteOrder BigEndian LittleEndian$bytezap-1.1.0-6czEDCjH49692ZvGPMhBpr)Raehik.Compat.Data.Primitive.Types.Endian ByteOrdered unByteOrderedENoSumENoEmptyViaPrim unViaPrim EGenericSumEGenericSumTagEGenericSumTagNoMatchEGeneric EGenericFieldEBase EExpectedByte EOverlong EExpected EFailNamed EFailParseERanOutEMiddleEAndEEFail $fEqEMiddle $fShowEMiddle$fGenericEMiddle$fEqE$fShowE $fGenericE $fEqEGeneric$fShowEGeneric$fGenericEGeneric$fEqEGenericSum$fShowEGenericSum$fGenericEGenericSum $fEqEBase $fShowEBase$fGenericEBaseDecodedecodeEncodeencode'AsTextBytes decodeTextwrapUnsafeDecoderUtf8$fPredicateTYPEUtf8Text$fDecodeTYPEUtf8$fEncodeTYPEUtf8ShiftJisencodeViaTextICUencodeViaTextICU'decodeViaTextICUdecodeViaTextICU'$fDecodeTYPEShiftJis$fEncodeTYPEShiftJis$fPredicateTYPEShiftJisTextAsciicatchErrorCall$fPredicateTYPEAsciiText$fDecodeTYPEAscii$fEncodeTYPEAsciitshow posIntToNatnatVal''EndianBELE$fStrengthenByteOrdered$fWeakenByteOrderedUtf32$fPredicateTYPEUtf32Text$fDecodeTYPEUtf32$fDecodeTYPEUtf320$fEncodeTYPEUtf32$fEncodeTYPEUtf320Utf16$fPredicateTYPEUtf16Text$fDecodeTYPEUtf16$fDecodeTYPEUtf160$fEncodeTYPEUtf16$fEncodeTYPEUtf160encode encodeToRepEUnexpectedNonSumEUnexpectedSumPrefixMaxlenToPfxpfxToLen$fPrefixWord64$fPrefixWord32$fPrefixWord16 $fPrefixWord8 $fPrefix()$fPrefixByteOrderedanyPrimparseWithLengthLength natValIntCBLenSymIsCBLenCBLencblencblen# cblenProxy#$fIsCBLenTYPERefined$fIsCBLenTYPEByteOrdered$fIsCBLenTYPEInt64$fIsCBLenTYPEWord64$fIsCBLenTYPEInt32$fIsCBLenTYPEWord32$fIsCBLenTYPEInt16$fIsCBLenTYPEWord16$fIsCBLenTYPEInt8$fIsCBLenTYPEWord8$fIsCBLenTYPE(,)$fIsCBLenTYPE()PutCputCPutterCrunPutCputGenericStruct $fPutC(,)$fPutC() $fPutCPoke$fPutCIdentity $fPutCEither $fPutCVoid $fPutCViaPrim$fPutCGenerically$fGPokeBaseFUNPutC$fPutCByteOrdered$fPutCByteOrdered0$fPutCByteOrdered1$fPutCByteOrdered2 $fPutCInt8 $fPutCWord8GetCgetCGetterC runGetCBsunsafeRunGetC'unsafeRunGetCPtrgetGenericStructeCBase getECBase$fGetCIdentity $fGetCViaPrim$fGetC()$fGetCGenerically$fGParseBaseFUNGetC$fGetCByteOrdered$fGetCByteOrdered0$fGetCByteOrdered1$fGetCByteOrdered2 $fGetCInt8 $fGetCWord8ViaGetC unViaGetCGetgetGetterrunGet runGettergetGenericNonSum getGenericSumeBasegetEBasebzToFpfpToBzgetWrapGenericgetWrapGeneric'getPrim $fGetRefined $fGetViaPrim$fGetByteString $fGetList$fGet(,)$fGet() $fGetIdentity $fGetEither $fGetVoid$fGenericTraverseSumFUNGet$fGenericTraverseFUNGet $fGetViaGetC$fGetByteOrdered$fGetByteOrdered0$fGetByteOrdered1$fGetByteOrdered2 $fGetInt8 $fGetWord8NothingXJustXGCBLenCaseMaybeMaybeEq GCBLenSumGCBLenCBLenGenericNonSum CBLenGenericViaCBLen unViaCBLenBLenblenblenGenericNonSumblenGenericSum$fBLenByteString $fBLenList $fBLen(,)$fBLen() $fBLenEither $fBLenVoid $fBLenRefined$fGenericFoldMapFUNBLen$fBLenViaCBLen$fBLenByteOrdered $fBLenInt64 $fBLenWord64 $fBLenInt32 $fBLenWord32 $fBLenInt16 $fBLenWord16 $fBLenInt8 $fBLenWord8ViaPutC unViaPutCPutputPutterrunPutputGenericNonSum putGenericSum $fPutRefined$fPutByteString $fPutList$fPut(,)$fPut() $fPutPoke $fPutIdentity $fPutEither $fPutVoid $fPutViaPrim$fGenericFoldMapFUNPut $fPutViaPutC$fPutByteOrdered$fPutByteOrdered0$fPutByteOrdered1$fPutByteOrdered2 $fPutInt8 $fPutWord8ThinunThin $fGetThin $fGenericThin $fDataThin $fShowThin $fReadThin$fEqThin $fOrdThin$fSemigroupThin $fMonoidThin $fNFDataThin$fIsStringThin $fIsListThin $fBLenThin $fPutThin $fWeakenThin$fStrengthenThinSizedSize$fPredicateTYPESizea $fPutCRefinedGetSizegetSize SizePrefixed SizePrefix$fPredicateTYPESizePrefixa $fGetSizeThin$fGetSizeByteStringGetCountgetCount CountPrefixed CountPrefix$fPredicateTYPECountPrefixf $fPredicate1TYPETYPECountPrefixf $fPutRefined1$fBLenRefined1$fIsCBLenTYPERefined1 $fGetRefined1$fGetCountList NullCheck hasNoNullsNullTerminated NullTerminate$fNullCheckByteString$fPredicateTYPENullTerminateanullTermCstrPfxTag NullPaddedNullPad$fPredicateTYPENullPada $fGetCRefinedMagical MagicBytesSymbolAsCharList'SymbolAsCharListCharListUnicodeCodepointsSymbolUnicodeCodepointsMagic$fStrengthenMagic $fWeakenMagic$fMagicalSymbolsym$fMagicalListns $fGetCMagic $fPutCMagic$fIsCBLenTYPEMagic$fGenericMagic $fDataMagic $fShowMagic $fEqMagic $fGetMagic $fPutMagic $fBLenMagicDStructdStruct1dStruct2dStruct3 DMagicSum DMagicSum1 DMagicSum2DMagic dMagic1_8b $fPutCDMagic$fIsCBLenTYPEDMagic$fIsCBLenTYPEDMagicSum $fGetCDStruct$fIsCBLenTYPEDStruct$fGenericDStruct $fShowDStruct$fGenericDMagicSum$fGenericDMagic $fGetDStruct ghc-bignumGHC.Num.NaturalNaturalghc-prim GHC.TypesInt text-2.0.2Data.Text.InternalText Data.FoldablelengthR:MaxByteOrderedversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDirgetDataFileName getSysconfDirGeneric"Raehik.Compat.Data.Primitive.TypesPrim'bytestring-0.11.5.3Data.ByteString.Internal.Type ByteStringGHC.BaseStringfoldMap Data.Type.Ord<= GHC.TypeNats- GHC.Classes>=Symbol