Std.Text.Parse.takeOf
1 declaration
fn
takeOf: Str -> fn(Std.Text.Parse.Input) -> Result[(Str, Std.Text.Parse.Input), Std.Text.Parse.Problem]This is a callable function.
What it does
The longest run made only of these characters, possibly none.
The set is the vocabulary oneOf and noneOf already use. A run scanned
against a set costs one step rather than one step for every character it
covers, and a predicate written as a function costs a call each time it is
asked — which is the whole difference between reading a line and reading a
file. takeWhile stays for a rule a set cannot state.
Read the signature
- The text after the name is the type checked by Pudu.
- Read arrows from left to right: inputs come first, and the final type is returned.
- Names inside [ ] are type arguments, such as the item type held by a collection.
- Result makes success and recoverable failure part of the function's type.