Struct SeqAlt11

pub struct SeqAlt11<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> { /* private fields */ }

Trait Implementations

impl<'a, I: ?Sized + Sequence, O1, O2, O3, O4, O5, O6, O7, O8, O9, O10, O11, E: ParserError, P1, T1, P2, T2, P3, T3, P4, T4, P5, T5, P6, T6, P7, T7, P8, T8, P9, T9, P10, T10, P11, T11> Parser<'a, I, (O1, O2, O3, O4, O5, O6, O7, O8, O9, O10, O11), E, SeqAlt11<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>> for Permutation<(P1, P2, P3, P4, P5, P6, P7, P8, P9, P10, P11)>

where P1: Parser<'a, I, O1, E, T1>, P2: Parser<'a, I, O2, E, T2>, P3: Parser<'a, I, O3, E, T3>, P4: Parser<'a, I, O4, E, T4>, P5: Parser<'a, I, O5, E, T5>, P6: Parser<'a, I, O6, E, T6>, P7: Parser<'a, I, O7, E, T7>, P8: Parser<'a, I, O8, E, T8>, P9: Parser<'a, I, O9, E, T9>, P10: Parser<'a, I, O10, E, T10>, P11: Parser<'a, I, O11, E, T11>,

fn fab( &self, input: &mut &'a I, ) -> Result<(O1, O2, O3, O4, O5, O6, O7, O8, O9, O10, O11), E>

Parses the input. This method advances the input reference to the remaining unparsed input. The method is named “fab” instead of “parse” to avoid conflicts with the “parse” method of &str.

fn fab_value<V: Clone>(self, value: V) -> Value<Self, V, I, O, E>

where Self: Sized,

Returns a parser that replaces the output of the underlying parser with V.

fn fab_map<F>(self, func: F) -> ParserMap<Self, I, O, E, F>

where Self: Sized,

This creates a Map parser that applies the function to the output of the underlying parser.

fn fab_try_map<F>(self, func: F) -> ParserTryMap<Self, I, O, E, F>

where Self: Sized,

This parser first maps the input, and if the result is Option::Some or Result::Ok, it unwraps the input. Othewise, the parser fails.

fn fab_repeat(self) -> Repeat<Self, I, O, E, fn(&mut Vec<O>, O), Vec<O>>

where Self: Sized, O: Clone,

Repeats the underlying parser, returning the results in a Vec. This parser will accept any number of repetitions, including 0.