úÎ!SêQ .      !"#$%&'()*+,-None'-.14;FHSX_`akO®) bytesmithThe result of running a parser. bytesmith,An error message indicating what went wrong. bytesmithpThe parsed value, the offset after the last consumed byte, and the number of bytes remaining in parsed slice. bytesmithA non-resumable parser. bytesmithiParse a slice of a byte array. This can succeed even if the entire slice was not consumed by the parser. bytesmith Variant of  that accepts an unsliced .. bytesmith Variant of L that allows the parser to be run as part of an existing effectful context.  bytesmithpGet the current offset into the chunk. Using this makes it possible to observe the internal difference between /. that refer to equivalent slices. Be careful.  bytesmith×Return the byte array being parsed. This includes bytes that preceed the current offset and may include bytes that go beyond the length. This is somewhat dangerous, so only use this is you know what you're doing.  bytesmithMove the cursor back by nB bytes. Precondition: you must have previously consumed at least n bytes.  bytesmith,Lift an effectful computation into a parser.  bytesmith…Only valid for characters with a Unicode code point lower than 128. This consumes a single byte, decoding it as an ASCII character. bytesmith Parse three bytes in succession. bytesmithParse four bytes in succession. bytesmith%Fail with the provided error message. bytesmithlInterpret the next byte as an ASCII-encoded character. Fails if the byte corresponds to a number above 127. bytesmithRConsumes and returns the next byte in the input. Fails if no characters are left. bytesmithlInterpret the next byte as an ASCII-encoded character. Fails if the byte corresponds to a number above 127. bytesmithlInterpret the next byte as an ASCII-encoded character. Fails if the byte corresponds to a number above 127. bytesmith‰Interpret the next one to four bytes as a UTF-8-encoded character. Fails if the decoded codepoint is in the range U+D800 through U+DFFF. bytesmith§Interpret the next byte as an ASCII-encoded character. Fails if the byte corresponds to a number above 127. Returns nothing if the end of the input has been reached. bytesmith<Skip while the predicate is matched. This is always inlined. bytesmithœParse exactly four ASCII-encoded characters, interpretting them as the hexadecimal encoding of a 32-bit number. Note that this rejects a sequence such as 5A9 , requiring 05A9' instead. This is insensitive to case. bytesmith;Skip ASCII-encoded digits until a non-digit is encountered. bytesmithQSkip uppercase and lowercase letters until a non-alpha character is encountered. bytesmithQSkip uppercase and lowercase letters until a non-alpha character is encountered. bytesmithQSkip uppercase and lowercase letters until a non-alpha character is encountered. bytesmith]Skip the character any number of times. This succeeds even if the character was not present. bytesmith\Skip the character any number of times. It must occur at least once or else this will fail. bytesmithSkip bytes until the character from the ASCII plane is encountered. This does not ensure that the skipped bytes were ASCII-encoded characters.  bytesmith-Fails if there is still more input remaining.! bytesmith`Returns true if there are no more bytes in the input. Returns false otherwise. Always succeeds." bytesmithYParse a decimal-encoded 8-bit word. If the number is larger than 255, this parser fails.# bytesmith\Parse a decimal-encoded 16-bit word. If the number is larger than 65535, this parser fails.$ bytesmithaParse a decimal-encoded 32-bit word. If the number is larger than 4294967295, this parser fails.% bytesmith®Parse a decimal-encoded number. If the number is too large to be represented by a machine word, this overflows rather than failing. This may be changed in a future release.& bytesmithÿÁParse a decimal-encoded positive integer of arbitrary size. Note: this is not implemented efficiently. This pulls in one digit at a time, multiplying the accumulator by ten each time and adding the new digit. Since arithmetic involving arbitrary-precision integers is somewhat expensive, it would be better to pull in several digits at a time, convert those to a machine-sized integer, then upcast and perform the multiplication and addition.' bytesmith Convert a 0 parser to a 1 parser.( bytesmith Convert a 1 parser to a 0T parser. Precondition: the argument parser only returns words less than 4294967296.) bytesmith#There is a law-abiding instance of  Alternative for J. However, it is not terribly useful since error messages seldom have a 27 instance. This function is a right-biased variant of <|>+. Consequently, it lacks an identity. See  ,https://github.com/bos/attoparsec/issues/122attoparsec #122$ for more discussion of this topic.* bytesmith7Specialization of monadic bind for parsers that return 3. bytesmith Error message+  !"#$%&'()*+ %"#$& ! '(*)4      !"#$%&'()*+,-./0123456789:5;<89=>(bytesmith-0.1.0.0-F6nASWwmruhF1ynvl4x4iRData.Bytes.ParserResultFailureSuccessParser runParser parseBytesparseByteArray parseBytesSTcursorexpose unconsumeeffectasciiascii3ascii4fail peekAnyAsciianyanyAscii anyAscii#anyUtf8# anyAsciiOpt skipWhile hexWord16skipDigitsAsciiskipDigitsAscii1skipAlphaAsciiskipAlphaAscii1 skipAscii skipAscii1skipUntilAsciiConsume endOfInput isEndOfInputdecWord8 decWord16 decWord32decWorddecPositiveInteger unboxWord32 boxWord32orElsebindChar $fMonadParser$fApplicativeParser$fFunctorParser(primitive-0.7.0.0-9xMM76CsovTEGnXCHiCdRJData.Primitive.ByteArray ByteArray(byteslice-0.1.2.0-CoD5rgYcKhCLyEuGYd3X90Data.Bytes.TypesBytesbaseGHC.WordWord32ghc-primGHC.PrimWord#GHC.BaseMonoidChar#