Succeed if the input is empty.

Read the given number of bytes as a ByteString.

Throws a runtime error if given a negative integer.

This does no copying. The ByteString returned is a "slice" of the input, and will keep it alive. To avoid this, use copy on the output.

Read n# bytes as a ByteString. Fails if fewer than n# bytes are available.

Throws a runtime error if given a negative integer.

This does no copying. The ByteString returned is a "slice" of the input, and will keep it alive. To avoid this, use copy on the output.

Read n# bytes as a ByteString. Fails if fewer than n# bytes are available.

Undefined behaviour if given a negative integer.

This does no copying. The ByteString returned is a "slice" of the input, and will keep it alive. To avoid this, use copy on the output.

Consume the rest of the input. May return the empty bytestring.

This does no copying. The ByteString returned is a "slice" of the input, and will keep it alive. To avoid this, use copy on the output.

Skip forward n bytes. Fails if fewer than n bytes are available.

Throws a runtime error if given a negative integer.

Skip forward n# bytes. Fails if fewer than n# bytes are available.

Throws a runtime error if given a negative integer.

Go back i bytes in the input. Takes a positive integer.

Extremely unsafe. Makes no checks. Almost certainly a Bad Idea.

Go back n# bytes. Takes a positive integer.

Extremely unsafe. Makes no checks. Almost certainly a Bad Idea.

Skip forward n# bytes and run the given parser. Fails if fewer than n# bytes are available.

Throws a runtime error if given a negative integer.

Skip forward n bytes and run the given parser. Fails if fewer than n bytes are available.

Undefined behaviour if given a negative integer.

Branch on a parser: if the first argument succeeds, continue with the second, else with the third. This can produce slightly more efficient code than (<|>). Moreover, branch does not backtrack from the true/false cases.

Succeed if the first parser succeeds and the second one fails.

An analogue of the list foldl function: first parse a b, then parse zero or more a-s, and combine the results in a left-nested way by the b -> a -> b function. Note: this is not the usual chainl function from the parsec libraries!

An analogue of the list foldr function: parse zero or more a-s, terminated by a b, and combine the results in a right-nested way using the a -> b -> b function. Note: this is not the usual chainr function from the parsec libraries!

Save the parsing state, then run a parser, then restore the state.

Assert that there are at least n bytes remaining.

Undefined behaviour if given a negative integer.

Assert that there are at least n# bytes remaining.

Undefined behaviour if given a negative integer.

Assert that there are at least n# bytes remaining (CPS).

Undefined behaviour if given a negative integer.

Assert that there is at least 1 byte remaining (CPS).

Undefined behaviour if given a negative integer.

Assert that there are at least n# bytes remaining (CPS).

Undefined behaviour if given a negative integer.

isolate n p runs the parser p isolated to the next n bytes. All isolated bytes must be consumed.

Throws a runtime error if given a negative integer.

isolate# n# p runs the parser p isolated to the next n# bytes. All isolated bytes must be consumed.

Throws a runtime error if given a negative integer.

isolateUnsafe# n# p runs the parser p isolated to the next n# bytes. All isolated bytes must be consumed.

Undefined behaviour if given a negative integer.

Skip a parser zero or more times.

Skip a parser one or more times.

The failing parser. By default, parser choice (<|>) arbitrarily backtracks on parser failure.

Convert a parsing error into failure.

Throw a parsing error. By default, parser choice (<|>) can't backtrack on parser error. Use try to convert an error to a recoverable failure.

Run the parser, if an error is thrown, handle it with the given function.

Run the parser, and handle each possible result.

Convert a parsing failure to a success.

Convert a parsing failure to an error.

Run the parser, if we get a failure, throw the given error, but if we get an error, merge the inner and the newly given errors using the e -> e -> e function. This can be useful for implementing parsing errors which may propagate hints or accummulate contextual information.

Convert a parsing failure to a Maybe. If possible, use withOption instead.

Convert a parsing failure to a ().

CPS'd version of optional. This is usually more efficient, since it gets rid of the extra Maybe allocation.