take -package:base package:attoparsec
Consume exactly n bytes of input.
Consume exactly n characters of input.
Consume n bytes of input.
Consume all remaining input and return it as a single string.
Consume all remaining input and return it as a single string.
Consume input as long as the predicate returns
False (i.e.
until it returns
True), and return the consumed input.
This parser does not fail. It will return an empty string if the
predicate returns
True on the first byte of input.
Note: Because this parser does not fail, do not use it with
combinators such as
many, because such parsers loop until a
failure occurs. Careless use will thus result in an infinite loop.
Consume input as long as the predicate returns
True, and return
the consumed input.
This parser does not fail. It will return an empty string if the
predicate returns
False on the first byte of input.
Note: Because this parser does not fail, do not use it with
combinators such as
many, because such parsers loop until a
failure occurs. Careless use will thus result in an infinite loop.
Consume input as long as the predicate returns
True, and return
the consumed input.
This parser requires the predicate to succeed on at least one byte of
input: it will fail if the predicate never returns
True or if
there is no input left.
Consume input until immediately after the predicate returns
True, and return the consumed input.
This parser will consume at least one
Word8 or fail.
Consume input as long as the predicate returns
False (i.e.
until it returns
True), and return the consumed input.
This parser does not fail. It will return an empty string if the
predicate returns
True on the first byte of input.
Note: Because this parser does not fail, do not use it with
combinators such as
many, because such parsers loop until a
failure occurs. Careless use will thus result in an infinite loop.
Consume input as long as the predicate returns
True, and return
the consumed input.
This parser does not fail. It will return an empty string if the
predicate returns
False on the first byte of input.
Note: Because this parser does not fail, do not use it with
combinators such as
many, because such parsers loop until a
failure occurs. Careless use will thus result in an infinite loop.
Consume input as long as the predicate returns
True, and return
the consumed input.
This parser requires the predicate to succeed on at least one byte of
input: it will fail if the predicate never returns
True or if
there is no input left.
Consume all remaining input and return it as a single string.
Consume all remaining input and return it as a single string.
Consume input as long as the predicate returns
False (i.e.
until it returns
True), and return the consumed input.
This parser does not fail. It will return an empty string if the
predicate returns
True on the first character of input.
Note: Because this parser does not fail, do not use it with
combinators such as
many, because such parsers loop until a
failure occurs. Careless use will thus result in an infinite loop.
Consume input as long as the predicate returns
True, and return
the consumed input.
This parser does not fail. It will return an empty string if the
predicate returns
False on the first character of input.
Note: Because this parser does not fail, do not use it with
combinators such as
many, because such parsers loop until a
failure occurs. Careless use will thus result in an infinite loop.
Consume input as long as the predicate returns
True, and return
the consumed input.
This parser requires the predicate to succeed on at least one
character of input: it will fail if the predicate never returns
True or if there is no input left.
Consume input while the predicate returns
True.