úÎ!s näI      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGH#© 2017 Marko Bencun, 2018-2019 IOHK Apache-2.0None .;HMUV_kœ+bech32KThe zero-based position of a character in a string, counting from the left.bech32URepresents the set of errors that may occur while decoding a Bech32 string with the & function. bech32ÿ4In cases where it is possible to determine the exact locations of erroneous characters, this list will encode those locations. Clients can use this information to provide user feedback. In cases where it isn't possible to reliably determine the locations of erroneous characters, this list will be empty. bech32XRepresents the set of error conditions that may occur while encoding a Bech32 string. bech32rRepresents the set of error conditions that may occur while parsing the human-readable part of a Bech32 string.bech32KRepresents the human-readable part of a Bech32 string, as defined here: https://git.io/fj8FSbech32ARepresents the data part of a Bech32 string, as defined here: https://git.io/fj8FSbech32 Returns true iff. the specified  is valid.bech32 Constructs a  from a I.This function encodes a IH in such a way that guarantees it can be successfully decoded with the  function: /dataPartToBytes (dataPartFromBytes b) == Just bbech32Attempts to extract a I from a .;This function guarantees to satisfy the following property: /dataPartToBytes (dataPartFromBytes b) == Just bbech32 Constructs a H from textual input. All characters in the input must be a member of W, the set of characters permitted to appear within the data part of a Bech32 string.Returns J3 if any character in the input is not a member of .;This function guarantees to satisfy the following property: -dataPartFromText (dataPartToText d) == Just dbech32 Converts a  to K7, using the Bech32 character set to render the data.;This function guarantees to satisfy the following property: -dataPartFromText (dataPartToText d) == Just dbech32 Construct a  directly from words.=This function guarantees to satisfy the following properties: UdataPartFromWords (dataPartToWords d) == d dataPartToWords (dataPartFromWords w) == wbech32 Convert a  into words.Lbech32‹Returns true iff. the specified character is permitted to appear within the data part of a Bech32 string. See here for more details: https://git.io/fj8FSbech32}A list of all characters that are permitted to appear within the data part of a Bech32 string. See here for more details: https://git.io/fj8FSbech32–If the specified character is permitted to appear within the data part of a Bech32 string, this function returns that character's corresponding m value. If the specified character is not permitted, or if the specified character is upper-case, returns J.bech32Maps the specified Y onto a character that is permitted to appear within the data part of a Bech32 string.bech32GParses the human-readable part of a Bech32 string, as defined here: https://git.io/fj8FSbech32?Get the raw text of the human-readable part of a Bech32 string.bech32=Convert the specified human-readable part to a list of words.bech32PThe shortest length permitted for the human-readable part of a Bech32 string. bech32OThe longest length permitted for the human-readable part of a Bech32 string.Mbech32vReturns true iff. the specified character is permitted to appear within the human-readable part of a Bech32 string.!bech32rThe lower bound of the set of characters permitted to appear within the human-readable part of a Bech32 string."bech32rThe upper bound of the set of characters permitted to appear within the human-readable part of a Bech32 string.#bech32Like $› but allows output to be longer than 90 characters. This isn't ideal as the error detection becomes worse as string get longer but it's still acceptable.From BIP-0173:­Even though the chosen code performs reasonably well up to 1023 characters, other designs are preferable for lengths above 89 characters (excluding the separator).$bech32EEncode a human-readable string and data payload into a Bech32 string.%bech32Like &2 but does not enforce a maximum length. See also # for details.&bech32@Decode a Bech32 string into a human-readable part and data part.Nbech32ÙParse a data-with-checksum part, checking that each character is part of the supported character set. If one or more characters are not in the supported character set, return the list of illegal character positions.Obech32`Convert an error encountered while parsing a human-readable part into a general decoding error.'bech32tThe separator character. This character appears immediately after the human-readable part and before the data part.(bech32BThe length of the checksum portion of an encoded string, in bytes.)bech32CThe length of the separator portion of an encoded string, in bytes.*bech32«The maximum length of an encoded string, in bytes. This length includes the human-readable part, the separator character, the encoded data portion, and the checksum.+bech32«The minimum length of an encoded string, in bytes. This length includes the human-readable part, the separator character, the encoded data portion, and the checksum./bech321Big-endian conversion of a word string from base  '2^frombits' to base  '2^tobits'. The frombits and twobits% parameters must be positive, while  '2^frombits' and  '2^tobits'" must be smaller than the size of P. Every value in dat must be strictly smaller than  '2^frombits'.Qbech32_This lookup table is a Haskell translation of the reference JavaScript implementation here: https://git.io/fj8FRRbech32_This lookup table is a Haskell translation of the reference JavaScript implementation here: https://git.io/fj8FESbech32[This function is a Haskell translation of the reference JavaScript implementation here: https://git.io/fj8FuTbech32”For a given Bech32 string residue and Bech32 string length, reports the positions of detectably erroneous characters in the original Bech32 string.¨The reported character positions are zero-based, counting from right to left within the original string, but omitting the separation character (which is not counted).\Returns the empty list if it is not possible to reliably determine the locations of errors.YThis function is a Haskell translation of the reference JavaScript implementation here: https://git.io/fj8FzUbech32Splits the given K€ into a prefix and a suffix using the last occurrence of the specified separator character as a splitting point. Evaluates to J if the specified K+ does not contain the separator character.2   !"#$%&'()*+,-./012$# &% (*+')  !"/,10.-#© 2017 Marko Bencun, 2018-2019 IOHK Apache-2.0Nonen   #$%&$# &%  V      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`#bech32-1.0.0-CSRRQgr38wY7Y2WgyoHIFLCodec.Binary.Bech32.InternalCodec.Binary.Bech32Word5getWord5 CharPosition DecodingErrorStringToDecodeTooLongStringToDecodeTooShortStringToDecodeHasMixedCase"StringToDecodeMissingSeparatorChar"StringToDecodeContainsInvalidChars EncodingErrorEncodedStringTooLongHumanReadablePartErrorHumanReadablePartTooShortHumanReadablePartTooLong%HumanReadablePartContainsInvalidCharsHumanReadablePartDataPartdataPartIsValiddataPartFromBytesdataPartToBytesdataPartFromTextdataPartToTextdataPartFromWordsdataPartToWords dataCharListdataCharToWorddataCharFromWordhumanReadablePartFromTexthumanReadablePartToTexthumanReadablePartToWordshumanReadablePartMinLengthhumanReadablePartMaxLengthhumanReadableCharMinBoundhumanReadableCharMaxBound encodeLenientencode decodeLenientdecode separatorCharchecksumLengthseparatorLengthencodedStringMaxLengthencodedStringMinLengthword5 yesPadding noPadding convertBitstoBase32 toBase256 $fIxWord5 $fEnumWord5$fBoundedWord5 $fEqDataPart$fMonoidDataPart$fSemigroupDataPart$fShowDataPart$fEqHumanReadablePart$fMonoidHumanReadablePart$fSemigroupHumanReadablePart$fShowHumanReadablePart$fEqEncodingError$fShowEncodingError$fEqCharPosition$fOrdCharPosition$fShowCharPosition$fEqDecodingError$fShowDecodingError$fEqHumanReadablePartError$fShowHumanReadablePartError $fEqWord5 $fOrdWord5 $fShowWord5bytestring-0.10.8.2Data.ByteString.Internal ByteStringbase GHC.MaybeNothing text-1.2.3.1Data.Text.InternalTextdataCharIsValidhumanReadableCharIsValidparseDataWithChecksumParthumanReadablePartErrorghc-prim GHC.TypesWord gf_1024_exp gf_1024_logsyndrome locateErrorssplitAtLastOccurrence